blob: 837211dacebdb4f47defcc6e5b02ce9149c0b25c [file] [log] [blame]
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +01001/*
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>
Jens Axboe93e2db22012-03-13 09:45:22 +010027#include <stdlib.h>
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010028
29#include <cairo.h>
30#include <gtk/gtk.h>
31
32#include "tickmarks.h"
Stephen M. Cameron09ad20f2012-03-11 11:34:38 +010033#include "graph.h"
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010034
35struct xyvalue {
36 double x, y;
Jens Axboe93e2db22012-03-13 09:45:22 +010037 int gx, gy;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010038};
39
40struct graph_value {
41 struct graph_value *next;
Jens Axboe93e2db22012-03-13 09:45:22 +010042 char *tooltip;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010043 void *value;
44};
45
46struct graph_label {
47 char *label;
48 struct graph_value *tail;
49 struct graph_value *values;
50 struct graph_label *next;
51 double r, g, b;
52 int value_count;
Jens Axboe93e2db22012-03-13 09:45:22 +010053 unsigned int tooltip_count;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010054 struct graph *parent;
55};
56
57struct graph {
58 char *title;
59 char *xtitle;
60 char *ytitle;
Jens Axboe87d5f272012-03-07 12:31:40 +010061 unsigned int xdim, ydim;
Stephen M. Cameron57f9d282012-03-11 11:36:51 +010062 double xoffset, yoffset;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010063 struct graph_label *labels;
64 struct graph_label *tail;
65 int per_label_limit;
Jens Axboef3e84402012-03-07 13:14:32 +010066 const char *font;
Stephen M. Cameron7175d912012-03-11 11:35:10 +010067 graph_axis_unit_change_callback x_axis_unit_change_callback;
68 graph_axis_unit_change_callback y_axis_unit_change_callback;
Jens Axboed8fbeef2012-03-14 10:25:44 +010069 unsigned int base_offset;
Stephen M. Camerondef0ac22012-03-12 07:32:57 +010070 double left_extra;
71 double right_extra;
72 double top_extra;
73 double bottom_extra;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010074};
75
Stephen M. Cameron3ea48b82012-03-07 19:40:58 +010076void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim)
77{
78 g->xdim = xdim;
79 g->ydim = ydim;
80}
81
Stephen M. Cameron57f9d282012-03-11 11:36:51 +010082void graph_set_position(struct graph *g, double xoffset, double yoffset)
83{
84 g->xoffset = xoffset;
85 g->yoffset = yoffset;
86}
87
Jens Axboef3e84402012-03-07 13:14:32 +010088struct graph *graph_new(unsigned int xdim, unsigned int ydim, const char *font)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010089{
90 struct graph *g;
91
92 g = calloc(1, sizeof(*g));
Stephen M. Cameron3ea48b82012-03-07 19:40:58 +010093 graph_set_size(g, xdim, ydim);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010094 g->per_label_limit = -1;
Jens Axboef3e84402012-03-07 13:14:32 +010095 g->font = font;
96 if (!g->font)
97 g->font = "Sans";
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +010098 return g;
99}
100
Stephen M. Cameron7175d912012-03-11 11:35:10 +0100101void graph_x_axis_unit_change_notify(struct graph *g, graph_axis_unit_change_callback f)
102{
103 g->x_axis_unit_change_callback = f;
104}
105
106void graph_y_axis_unit_change_notify(struct graph *g, graph_axis_unit_change_callback f)
107{
108 g->y_axis_unit_change_callback = f;
109}
110
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100111static int count_labels(struct graph_label *labels)
112{
113 int count = 0;
114 struct graph_label *i;
115
116 for (i = labels; i; i = i->next)
117 count++;
118 return count;
119}
120
121static int count_values(struct graph_value *values)
122{
123 int count = 0;
124 struct graph_value *i;
125
126 for (i = values; i; i = i->next)
127 count++;
128 return count;
129}
130
131typedef double (*double_comparator)(double a, double b);
132
133static double mindouble(double a, double b)
134{
135 return a < b ? a : b;
136}
137
138static double maxdouble(double a, double b)
139{
140 return a < b ? b : a;
141}
142
143static double find_double_values(struct graph_value *values, double_comparator cmp)
144{
145 struct graph_value *i;
146 int first = 1;
147 double answer, tmp;
148
149 assert(values != NULL);
150 answer = 0.0; /* shut the compiler up, might need to think harder though. */
151 for (i = values; i; i = i->next) {
152 tmp = *(double *) i->value;
153 if (first) {
154 answer = tmp;
155 first = 0;
156 } else {
157 answer = cmp(answer, tmp);
158 }
159 }
160 return answer;
161}
162
163static double find_double_data(struct graph_label *labels, double_comparator cmp)
164{
165 struct graph_label *i;
166 int first = 1;
167 double answer, tmp;
168
169 assert(labels != NULL);
170 answer = 0.0; /* shut the compiler up, might need to think harder though. */
171 for (i = labels; i; i = i->next) {
172 tmp = find_double_values(i->values, cmp);
173 if (first) {
174 answer = tmp;
175 first = 0;
176 } else {
177 answer = cmp(tmp, answer);
178 }
179 }
180 return answer;
181}
182
183static double find_min_data(struct graph_label *labels)
184{
185 return find_double_data(labels, mindouble);
186}
187
188static double find_max_data(struct graph_label *labels)
189{
190 return find_double_data(labels, maxdouble);
191}
192
193static void draw_bars(struct graph *bg, cairo_t *cr, struct graph_label *lb,
194 double label_offset, double bar_width,
195 double mindata, double maxdata)
196{
197 struct graph_value *i;
198 double x1, y1, x2, y2;
199 int bar_num = 0;
200 double domain, range, v;
201
202 domain = (maxdata - mindata);
203 range = (double) bg->ydim * 0.80; /* FIXME */
204 cairo_stroke(cr);
205 for (i = lb->values; i; i = i->next) {
206
207 x1 = label_offset + (double) bar_num * bar_width + (bar_width * 0.05);
208 x2 = x1 + bar_width * 0.90;
209 y2 = bg->ydim * 0.90;
210 v = *(double *) i->value;
211 y1 = y2 - (((v - mindata) / domain) * range);
212 cairo_move_to(cr, x1, y1);
213 cairo_line_to(cr, x1, y2);
214 cairo_line_to(cr, x2, y2);
215 cairo_line_to(cr, x2, y1);
216 cairo_close_path(cr);
217 cairo_fill(cr);
218 cairo_stroke(cr);
219 bar_num++;
220 }
221}
222
Stephen M. Cameron10e54cd2012-03-07 19:39:55 +0100223static void draw_aligned_text(struct graph *g, cairo_t *cr, double x, double y,
224 double fontsize, const char *text, int alignment)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100225{
Stephen M. Cameron10e54cd2012-03-07 19:39:55 +0100226#define CENTERED 0
227#define LEFT_JUSTIFIED 1
228#define RIGHT_JUSTIFIED 2
229
230 double factor, direction;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100231 cairo_text_extents_t extents;
232
Stephen M. Cameron10e54cd2012-03-07 19:39:55 +0100233 switch(alignment) {
234 case CENTERED:
235 direction = -1.0;
236 factor = 0.5;
237 break;
238 case RIGHT_JUSTIFIED:
239 direction = -1.0;
240 factor = 1.0;
241 break;
242 case LEFT_JUSTIFIED:
243 default:
244 direction = 1.0;
245 factor = 1.0;
246 break;
247 }
Jens Axboef3e84402012-03-07 13:14:32 +0100248 cairo_select_font_face (cr, g->font, CAIRO_FONT_SLANT_NORMAL, CAIRO_FONT_WEIGHT_NORMAL);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100249
250 cairo_set_font_size(cr, fontsize);
251 cairo_text_extents(cr, text, &extents);
Stephen M. Cameron10e54cd2012-03-07 19:39:55 +0100252 x = x + direction * (factor * extents.width + extents.x_bearing);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100253 y = y - (extents.height / 2 + extents.y_bearing);
254
255 cairo_move_to(cr, x, y);
256 cairo_show_text(cr, text);
257}
258
Stephen M. Cameron10e54cd2012-03-07 19:39:55 +0100259static inline void draw_centered_text(struct graph *g, cairo_t *cr, double x, double y,
260 double fontsize, const char *text)
261{
262 draw_aligned_text(g, cr, x, y, fontsize, text, CENTERED);
263}
264
265static inline void draw_right_justified_text(struct graph *g, cairo_t *cr,
266 double x, double y,
267 double fontsize, const char *text)
268{
269 draw_aligned_text(g, cr, x, y, fontsize, text, RIGHT_JUSTIFIED);
270}
271
272static inline void draw_left_justified_text(struct graph *g, cairo_t *cr,
273 double x, double y,
274 double fontsize, const char *text)
275{
276 draw_aligned_text(g, cr, x, y, fontsize, text, LEFT_JUSTIFIED);
277}
278
Jens Axboef3e84402012-03-07 13:14:32 +0100279static void draw_vertical_centered_text(struct graph *g, cairo_t *cr, double x,
280 double y, double fontsize,
281 const char *text)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100282{
283 double sx, sy;
284 cairo_text_extents_t extents;
285
Jens Axboef3e84402012-03-07 13:14:32 +0100286 cairo_select_font_face(cr, g->font, CAIRO_FONT_SLANT_NORMAL, CAIRO_FONT_WEIGHT_NORMAL);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100287
288 cairo_set_font_size(cr, fontsize);
289 cairo_text_extents(cr, text, &extents);
290 sx = x;
291 sy = y;
292 y = y + (extents.width / 2.0 + extents.x_bearing);
293 x = x - (extents.height / 2.0 + extents.y_bearing);
294
295 cairo_move_to(cr, x, y);
296 cairo_save(cr);
297 cairo_translate(cr, -sx, -sy);
298 cairo_rotate(cr, -90.0 * M_PI / 180.0);
299 cairo_translate(cr, sx, sy);
300 cairo_show_text(cr, text);
301 cairo_restore(cr);
302}
303
304static void graph_draw_common(struct graph *g, cairo_t *cr,
305 double *x1, double *y1, double *x2, double *y2)
306{
307 cairo_set_source_rgb(cr, 0, 0, 0);
Jens Axboef3e84402012-03-07 13:14:32 +0100308 cairo_set_line_width (cr, 0.8);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100309
Jens Axboe9ede9c92012-03-14 10:43:20 +0100310 *x1 = 0.10 * g->xdim;
Stephen M. Cameron6bf86002012-03-08 16:58:50 +0100311 *x2 = 0.95 * g->xdim;
312 *y1 = 0.10 * g->ydim;
313 *y2 = 0.90 * g->ydim;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100314
315 cairo_move_to(cr, *x1, *y1);
316 cairo_line_to(cr, *x1, *y2);
317 cairo_line_to(cr, *x2, *y2);
318 cairo_line_to(cr, *x2, *y1);
319 cairo_line_to(cr, *x1, *y1);
320 cairo_stroke(cr);
321
Jens Axboef3e84402012-03-07 13:14:32 +0100322 draw_centered_text(g, cr, g->xdim / 2, g->ydim / 20, 20.0, g->title);
323 draw_centered_text(g, cr, g->xdim / 2, g->ydim * 0.97, 14.0, g->xtitle);
324 draw_vertical_centered_text(g, cr, g->xdim * 0.02, g->ydim / 2, 14.0, g->ytitle);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100325 cairo_stroke(cr);
326}
327
328static void graph_draw_x_ticks(struct graph *g, cairo_t *cr,
329 double x1, double y1, double x2, double y2,
Jens Axboed8fbeef2012-03-14 10:25:44 +0100330 double minx, double maxx, int nticks, int add_tm_text)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100331{
332 struct tickmark *tm;
333 double tx;
Stephen M. Cameron7175d912012-03-11 11:35:10 +0100334 int i, power_of_ten;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100335 static double dash[] = { 1.0, 2.0 };
336
Stephen M. Cameron7175d912012-03-11 11:35:10 +0100337 nticks = calc_tickmarks(minx, maxx, nticks, &tm, &power_of_ten,
Jens Axboed8fbeef2012-03-14 10:25:44 +0100338 g->x_axis_unit_change_callback == NULL, g->base_offset);
Stephen M. Cameron7175d912012-03-11 11:35:10 +0100339 if (g->x_axis_unit_change_callback)
340 g->x_axis_unit_change_callback(g, power_of_ten);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100341
342 for (i = 0; i < nticks; i++) {
343 tx = (((tm[i].value) - minx) / (maxx - minx)) * (x2 - x1) + x1;
Jens Axboed8fbeef2012-03-14 10:25:44 +0100344
345 /* really tx < yx || tx > x2, but protect against rounding */
346 if (x1 - tx > 0.01 || tx - x2 > 0.01)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100347 continue;
348
349 /* Draw tick mark */
Jens Axboef3e84402012-03-07 13:14:32 +0100350 cairo_set_line_width(cr, 0.8);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100351 cairo_move_to(cr, tx, y2);
352 cairo_line_to(cr, tx, y2 + (y2 - y1) * 0.03);
353 cairo_stroke(cr);
354
355 /* draw grid lines */
356 cairo_save(cr);
357 cairo_set_dash(cr, dash, 2, 2.0);
358 cairo_set_line_width(cr, 0.5);
359 cairo_move_to(cr, tx, y1);
360 cairo_line_to(cr, tx, y2);
361 cairo_stroke(cr);
362 cairo_restore(cr);
363
Jens Axboed8fbeef2012-03-14 10:25:44 +0100364 if (!add_tm_text)
365 continue;
366
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100367 /* draw tickmark label */
Jens Axboef3e84402012-03-07 13:14:32 +0100368 draw_centered_text(g, cr, tx, y2 * 1.04, 12.0, tm[i].string);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100369 cairo_stroke(cr);
370
371 }
372}
373
Jens Axboed8fbeef2012-03-14 10:25:44 +0100374static double graph_draw_y_ticks(struct graph *g, cairo_t *cr,
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100375 double x1, double y1, double x2, double y2,
Jens Axboed8fbeef2012-03-14 10:25:44 +0100376 double miny, double maxy, int nticks, int add_tm_text)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100377{
378 struct tickmark *tm;
379 double ty;
Stephen M. Cameron7175d912012-03-11 11:35:10 +0100380 int i, power_of_ten;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100381 static double dash[] = { 2.0, 2.0 };
382
Stephen M. Cameron7175d912012-03-11 11:35:10 +0100383 nticks = calc_tickmarks(miny, maxy, nticks, &tm, &power_of_ten,
Jens Axboed8fbeef2012-03-14 10:25:44 +0100384 g->y_axis_unit_change_callback == NULL, g->base_offset);
Stephen M. Cameron7175d912012-03-11 11:35:10 +0100385 if (g->y_axis_unit_change_callback)
386 g->y_axis_unit_change_callback(g, power_of_ten);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100387
Jens Axboed8fbeef2012-03-14 10:25:44 +0100388 /*
389 * Use highest tickmark as top of graph, not highest value. Otherwise
390 * it's impossible to see what the max value is, if the graph is
391 * fairly flat.
392 */
393 maxy = tm[nticks - 1].value;
394
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100395 for (i = 0; i < nticks; i++) {
396 ty = y2 - (((tm[i].value) - miny) / (maxy - miny)) * (y2 - y1);
Jens Axboed8fbeef2012-03-14 10:25:44 +0100397
398 /* really ty < y1 || ty > y2, but protect against rounding */
399 if (y1 - ty > 0.01 || ty - y2 > 0.01)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100400 continue;
Jens Axboed8fbeef2012-03-14 10:25:44 +0100401
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100402 /* draw tick mark */
403 cairo_move_to(cr, x1, ty);
404 cairo_line_to(cr, x1 - (x2 - x1) * 0.02, ty);
405 cairo_stroke(cr);
406
407 /* draw grid lines */
408 cairo_save(cr);
409 cairo_set_dash(cr, dash, 2, 2.0);
410 cairo_set_line_width(cr, 0.5);
411 cairo_move_to(cr, x1, ty);
412 cairo_line_to(cr, x2, ty);
413 cairo_stroke(cr);
414 cairo_restore(cr);
415
Jens Axboed8fbeef2012-03-14 10:25:44 +0100416 if (!add_tm_text)
417 continue;
418
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100419 /* draw tickmark label */
Stephen M. Cameron10e54cd2012-03-07 19:39:55 +0100420 draw_right_justified_text(g, cr, x1 - (x2 - x1) * 0.025, ty, 12.0, tm[i].string);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100421 cairo_stroke(cr);
422 }
Jens Axboed8fbeef2012-03-14 10:25:44 +0100423
424 /*
425 * Return new max to use
426 */
427 return maxy;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100428}
429
430void bar_graph_draw(struct graph *bg, cairo_t *cr)
431{
432 double x1, y1, x2, y2;
433 double space_per_label, bar_width;
434 double label_offset, mindata, maxdata;
435 int i, nlabels;
436 struct graph_label *lb;
437
438 cairo_save(cr);
Stephen M. Cameron57f9d282012-03-11 11:36:51 +0100439 cairo_translate(cr, bg->xoffset, bg->yoffset);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100440 graph_draw_common(bg, cr, &x1, &y1, &x2, &y2);
441
442 nlabels = count_labels(bg->labels);
Jens Axboed8fbeef2012-03-14 10:25:44 +0100443 space_per_label = (x2 - x1) / (double) nlabels;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100444
Jens Axboebb393792012-03-15 10:52:38 +0100445 /*
446 * Start bars at 0 unless we have negative values, otherwise we
447 * present a skewed picture comparing label X and X+1.
448 */
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100449 mindata = find_min_data(bg->labels);
Jens Axboebb393792012-03-15 10:52:38 +0100450 if (mindata > 0)
451 mindata = 0;
452
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100453 maxdata = find_max_data(bg->labels);
454
455 if (fabs(maxdata - mindata) < 1e-20) {
Jens Axboef3e84402012-03-07 13:14:32 +0100456 draw_centered_text(bg, cr,
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100457 x1 + (x2 - x1) / 2.0,
458 y1 + (y2 - y1) / 2.0, 20.0, "No good data");
459 return;
460 }
461
Jens Axboebb393792012-03-15 10:52:38 +0100462 maxdata = graph_draw_y_ticks(bg, cr, x1, y1, x2, y2, mindata, maxdata, 10, 1);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100463 i = 0;
464 for (lb = bg->labels; lb; lb = lb->next) {
465 int nvalues;
466 nvalues = count_values(lb->values);
467 bar_width = (space_per_label - space_per_label * 0.2) / (double) nvalues;
468 label_offset = bg->xdim * 0.1 + space_per_label * (double) i + space_per_label * 0.1;
469 draw_bars(bg, cr, lb, label_offset, bar_width, mindata, maxdata);
470 // draw_centered_text(cr, label_offset + (bar_width / 2.0 + bar_width * 0.1), bg->ydim * 0.93,
Jens Axboef3e84402012-03-07 13:14:32 +0100471 draw_centered_text(bg, cr, x1 + space_per_label * (i + 0.5), bg->ydim * 0.93,
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100472 12.0, lb->label);
473 i++;
474 }
475 cairo_stroke(cr);
476 cairo_restore(cr);
477}
478
479typedef double (*xy_value_extractor)(struct graph_value *v);
480
481static double getx(struct graph_value *v)
482{
483 struct xyvalue *xy = v->value;
484 return xy->x;
485}
486
487static double gety(struct graph_value *v)
488{
489 struct xyvalue *xy = v->value;
490 return xy->y;
491}
492
493static double find_xy_value(struct graph *g, xy_value_extractor getvalue, double_comparator cmp)
494{
Stephen M. Cameron10e54cd2012-03-07 19:39:55 +0100495 double tmp, answer = 0.0;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100496 struct graph_label *i;
497 struct graph_value *j;
Stephen M. Camerond582bf72012-03-07 19:37:57 +0100498 int first = 1;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100499
500 for (i = g->labels; i; i = i->next)
501 for (j = i->values; j; j = j->next) {
502 tmp = getvalue(j);
Stephen M. Camerond582bf72012-03-07 19:37:57 +0100503 if (first) {
504 first = 0;
505 answer = tmp;
506 }
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100507 answer = cmp(tmp, answer);
508 }
509 return answer;
510}
511
512void line_graph_draw(struct graph *g, cairo_t *cr)
513{
514 double x1, y1, x2, y2;
Stephen M. Camerondef0ac22012-03-12 07:32:57 +0100515 double minx, miny, maxx, maxy, gminx, gminy, gmaxx, gmaxy;
516 double tx, ty, top_extra, bottom_extra, left_extra, right_extra;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100517 struct graph_label *i;
518 struct graph_value *j;
Stephen M. Cameron9ce9cfb2012-03-07 19:37:25 +0100519 int good_data = 1, first = 1;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100520
521 cairo_save(cr);
Stephen M. Cameron57f9d282012-03-11 11:36:51 +0100522 cairo_translate(cr, g->xoffset, g->yoffset);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100523 graph_draw_common(g, cr, &x1, &y1, &x2, &y2);
524
525 minx = find_xy_value(g, getx, mindouble);
526 maxx = find_xy_value(g, getx, maxdouble);
527 miny = find_xy_value(g, gety, mindouble);
Jens Axboe5aec6682012-03-16 10:17:08 +0100528
529 /*
530 * Start graphs at zero, unless we have a value below. Otherwise
531 * it's hard to visually compare the read and write graph, since
532 * the lowest valued one will be the floor of the graph view.
533 */
534 if (miny > 0)
535 miny = 0;
536
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100537 maxy = find_xy_value(g, gety, maxdouble);
538
539 if (fabs(maxx - minx) < 1e-20 || fabs(maxy - miny) < 1e-20) {
Stephen M. Cameron9ce9cfb2012-03-07 19:37:25 +0100540 good_data = 0;
541 minx = 0.0;
542 miny = 0.0;
543 maxx = 10.0;
544 maxy = 100.0;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100545 }
546
Stephen M. Camerondef0ac22012-03-12 07:32:57 +0100547 top_extra = 0.0;
548 bottom_extra = 0.0;
549 left_extra = 0.0;
550 right_extra = 0.0;
551
552 if (g->top_extra > 0.001)
553 top_extra = fabs(maxy - miny) * g->top_extra;
554 if (g->bottom_extra > 0.001)
555 bottom_extra = fabs(maxy - miny) * g->bottom_extra;
556 if (g->left_extra > 0.001)
557 left_extra = fabs(maxx - minx) * g->left_extra;
558 if (g->right_extra > 0.001)
559 right_extra = fabs(maxx - minx) * g->right_extra;
560
561 gminx = minx - left_extra;
562 gmaxx = maxx + right_extra;
563 gminy = miny - bottom_extra;
564 gmaxy = maxy + top_extra;
565
Jens Axboed8fbeef2012-03-14 10:25:44 +0100566 graph_draw_x_ticks(g, cr, x1, y1, x2, y2, gminx, gmaxx, 10, good_data);
567 gmaxy = graph_draw_y_ticks(g, cr, x1, y1, x2, y2, gminy, gmaxy, 10, good_data);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100568
Stephen M. Cameron9ce9cfb2012-03-07 19:37:25 +0100569 if (!good_data)
570 goto skip_data;
571
Jens Axboef3e84402012-03-07 13:14:32 +0100572 cairo_set_line_width(cr, 1.5);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100573 for (i = g->labels; i; i = i->next) {
574 first = 1;
Stephen M. Cameroncae08722012-03-07 14:47:38 +0100575 if (i->r < 0) /* invisible data */
576 continue;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100577 cairo_set_source_rgb(cr, i->r, i->g, i->b);
578 for (j = i->values; j; j = j->next) {
Jens Axboe93e2db22012-03-13 09:45:22 +0100579 struct xyvalue *xy = j->value;
580
Stephen M. Camerondef0ac22012-03-12 07:32:57 +0100581 tx = ((getx(j) - gminx) / (gmaxx - gminx)) * (x2 - x1) + x1;
582 ty = y2 - ((gety(j) - gminy) / (gmaxy - gminy)) * (y2 - y1);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100583 if (first) {
584 cairo_move_to(cr, tx, ty);
585 first = 0;
586 } else {
587 cairo_line_to(cr, tx, ty);
588 }
Jens Axboe93e2db22012-03-13 09:45:22 +0100589 xy->gx = tx;
590 xy->gy = ty;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100591 }
592 cairo_stroke(cr);
593 }
Stephen M. Cameron9ce9cfb2012-03-07 19:37:25 +0100594
595skip_data:
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100596 cairo_restore(cr);
Stephen M. Cameron9ce9cfb2012-03-07 19:37:25 +0100597
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100598}
599
600static void gfree(void *f)
601{
602 if (f)
603 free(f);
604}
605
606static void setstring(char **str, const char *value)
607{
608 gfree(*str);
609 *str = strdup(value);
610}
611
612void graph_title(struct graph *bg, const char *title)
613{
614 setstring(&bg->title, title);
615}
616
617void graph_x_title(struct graph *bg, const char *title)
618{
619 setstring(&bg->xtitle, title);
620}
621
622void graph_y_title(struct graph *bg, const char *title)
623{
624 setstring(&bg->ytitle, title);
625}
626
627static struct graph_label *graph_find_label(struct graph *bg,
628 const char *label)
629{
630 struct graph_label *i;
631
632 for (i = bg->labels; i; i = i->next)
633 if (strcmp(label, i->label) == 0)
634 return i;
635 return NULL;
636}
637
638void graph_add_label(struct graph *bg, const char *label)
639{
640 struct graph_label *i;
641
642 i = graph_find_label(bg, label);
643 if (i)
644 return; /* already present. */
645 i = calloc(1, sizeof(*i));
646 i->parent = bg;
647 setstring(&i->label, label);
648 i->next = NULL;
649 if (!bg->tail)
650 bg->labels = i;
651 else
652 bg->tail->next = i;
653 bg->tail = i;
654}
655
Jens Axboe93e2db22012-03-13 09:45:22 +0100656static void graph_label_add_value(struct graph_label *i, void *value,
657 const char *tooltip)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100658{
659 struct graph_value *x;
660
661 x = malloc(sizeof(*x));
662 x->value = value;
Jens Axboe93e2db22012-03-13 09:45:22 +0100663 if (tooltip)
664 x->tooltip = strdup(tooltip);
665 else
666 x->tooltip = NULL;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100667 x->next = NULL;
668 if (!i->tail) {
669 i->values = x;
670 } else {
671 i->tail->next = x;
672 }
673 i->tail = x;
674 i->value_count++;
Jens Axboe93e2db22012-03-13 09:45:22 +0100675 if (x->tooltip)
676 i->tooltip_count++;
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100677
678 if (i->parent->per_label_limit != -1 &&
679 i->value_count > i->parent->per_label_limit) {
Jens Axboec148dae2012-03-11 21:35:47 +0100680 int to_drop = 1;
681
682 /*
683 * If the limit was dynamically reduced, making us more
684 * than 1 entry ahead after adding this one, drop two
685 * entries. This will make us (eventually) reach the
686 * specified limit.
687 */
688 if (i->value_count - i->parent->per_label_limit >= 2)
689 to_drop = 2;
690
691 while (to_drop--) {
692 x = i->values;
693 i->values = i->values->next;
Jens Axboe93e2db22012-03-13 09:45:22 +0100694 if (x->tooltip) {
695 free(x->tooltip);
696 i->tooltip_count--;
697 }
Jens Axboec148dae2012-03-11 21:35:47 +0100698 free(x->value);
699 free(x);
700 i->value_count--;
701 }
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100702 }
703}
704
705int graph_add_data(struct graph *bg, const char *label, const double value)
706{
707 struct graph_label *i;
708 double *d;
709
710 d = malloc(sizeof(*d));
711 *d = value;
712
713 i = graph_find_label(bg, label);
714 if (!i)
715 return -1;
Jens Axboe93e2db22012-03-13 09:45:22 +0100716 graph_label_add_value(i, d, NULL);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100717 return 0;
718}
719
720int graph_add_xy_data(struct graph *bg, const char *label,
Jens Axboe93e2db22012-03-13 09:45:22 +0100721 const double x, const double y, const char *tooltip)
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100722{
723 struct graph_label *i;
724 struct xyvalue *xy;
725
726 xy = malloc(sizeof(*xy));
727 xy->x = x;
728 xy->y = y;
729
730 i = graph_find_label(bg, label);
731 if (!i)
732 return -1;
Jens Axboe93e2db22012-03-13 09:45:22 +0100733
734 graph_label_add_value(i, xy, tooltip);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100735 return 0;
736}
737
738static void graph_free_values(struct graph_value *values)
739{
740 struct graph_value *i, *next;
741
742 for (i = values; i; i = next) {
743 next = i->next;
744 gfree(i->value);
745 gfree(i);
746 }
747}
748
749static void graph_free_labels(struct graph_label *labels)
750{
751 struct graph_label *i, *next;
752
753 for (i = labels; i; i = next) {
754 next = i->next;
755 graph_free_values(i->values);
756 gfree(i);
757 }
758}
759
760void graph_set_color(struct graph *gr, const char *label,
761 double red, double green, double blue)
762{
763 struct graph_label *i;
764 double r, g, b;
765
Stephen M. Cameroncae08722012-03-07 14:47:38 +0100766 if (red < 0.0) { /* invisible color */
767 r = -1.0;
768 g = -1.0;
769 b = -1.0;
770 } else {
771 r = fabs(red);
772 g = fabs(green);
773 b = fabs(blue);
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100774
Stephen M. Cameroncae08722012-03-07 14:47:38 +0100775 if (r > 1.0)
776 r = 1.0;
777 if (g > 1.0)
778 g = 1.0;
779 if (b > 1.0)
780 b =1.0;
781 }
Stephen M. Cameronaf58ef32012-03-07 07:56:16 +0100782
783 for (i = gr->labels; i; i = i->next)
784 if (strcmp(i->label, label) == 0) {
785 i->r = r;
786 i->g = g;
787 i->b = b;
788 break;
789 }
790}
791
792void graph_free(struct graph *bg)
793{
794 gfree(bg->title);
795 gfree(bg->xtitle);
796 gfree(bg->ytitle);
797 graph_free_labels(bg->labels);
798}
799
800/* For each line in the line graph, up to per_label_limit segments may
801 * be added. After that, adding more data to the end of the line
802 * causes data to drop off of the front of the line.
803 */
804void line_graph_set_data_count_limit(struct graph *g, int per_label_limit)
805{
806 g->per_label_limit = per_label_limit;
807}
808
Stephen M. Camerondef0ac22012-03-12 07:32:57 +0100809void graph_add_extra_space(struct graph *g, double left_percent, double right_percent,
810 double top_percent, double bottom_percent)
811{
812 g->left_extra = left_percent;
813 g->right_extra = right_percent;
814 g->top_extra = top_percent;
815 g->bottom_extra = bottom_percent;
816}
817
Jens Axboed8fbeef2012-03-14 10:25:44 +0100818/*
819 * Normally values are logged in a base unit of 0, but for other purposes
820 * it makes more sense to log in higher unit. For instance for bandwidth
821 * purposes, you may want to log in KB/sec (or MB/sec) rather than bytes/sec.
822 */
823void graph_set_base_offset(struct graph *g, unsigned int base_offset)
824{
825 g->base_offset = base_offset;
826}
827
Jens Axboe93e2db22012-03-13 09:45:22 +0100828int graph_has_tooltips(struct graph *g)
829{
830 struct graph_label *i;
Stephen M. Camerondef0ac22012-03-12 07:32:57 +0100831
Jens Axboe93e2db22012-03-13 09:45:22 +0100832 for (i = g->labels; i; i = i->next)
833 if (i->tooltip_count)
834 return 1;
835
836 return 0;
837}
838
839int graph_contains_xy(struct graph *g, int x, int y)
840{
841 int first_x = g->xoffset;
842 int last_x = g->xoffset + g->xdim;
843 int first_y = g->yoffset;
844 int last_y = g->yoffset + g->ydim;
845
846 return (x >= first_x && x <= last_x) && (y >= first_y && y <= last_y);
847}
848
849static int xy_match(struct xyvalue *xy, int x, int y)
850{
851 int xdiff = abs(xy->gx - x);
852 int ydiff = abs(xy->gy - y);
853
Jens Axboeef4ad582012-03-15 15:37:36 +0100854 return xdiff <= 10 && ydiff <= 10;
Jens Axboe93e2db22012-03-13 09:45:22 +0100855}
856
857const char *graph_find_tooltip(struct graph *g, int x, int y)
858{
859 struct graph_label *i;
860 struct graph_value *j;
861
862 for (i = g->labels; i; i = i->next) {
863 for (j = i->values; j; j = j->next) {
864 struct xyvalue *xy = j->value;
865
866 if (xy_match(xy, x - g->xoffset, y))
867 return j->tooltip;
868 }
869 }
870
871 return NULL;
872}