Merge branch 'no-unittest-dep' of https://github.com/parallel-fs-utils/fio
[fio.git] / graph.c
CommitLineData
af58ef32
SC
1/*
2 * gfio - gui front end for fio - the flexible io tester
3 *
3c3ed070 4 * Copyright (C) 2012 Stephen M. Cameron <stephenmcameron@gmail.com>
af58ef32
SC
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
fa07eaa6 20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
af58ef32
SC
21 *
22 */
23#include <string.h>
2ef39e09 24#include <stdlib.h>
af58ef32
SC
25#include <math.h>
26#include <assert.h>
93e2db2b 27#include <stdlib.h>
af58ef32
SC
28
29#include <cairo.h>
30#include <gtk/gtk.h>
31
32#include "tickmarks.h"
09ad20ff 33#include "graph.h"
b65c7ec4
JA
34#include "flist.h"
35#include "lib/prio_tree.h"
ee2f55b2 36#include "cairo_text_helpers.h"
b65c7ec4
JA
37
38/*
39 * Allowable difference to show tooltip
40 */
b7a69ad8 41#define TOOLTIP_DELTA 0.08
af58ef32
SC
42
43struct xyvalue {
44 double x, y;
45};
46
cdae5ff8
JA
47enum {
48 GV_F_ON_PRIO = 1,
8dfd6071 49 GV_F_PRIO_SKIP = 2,
cdae5ff8
JA
50};
51
af58ef32 52struct graph_value {
cdae5ff8 53 struct flist_head list;
b65c7ec4 54 struct prio_tree_node node;
cdae5ff8
JA
55 struct flist_head alias;
56 unsigned int flags;
93e2db2b 57 char *tooltip;
af58ef32
SC
58 void *value;
59};
60
61struct graph_label {
cdae5ff8 62 struct flist_head list;
af58ef32 63 char *label;
cdae5ff8 64 struct flist_head value_list;
b65c7ec4 65 struct prio_tree_root prio_tree;
af58ef32 66 double r, g, b;
01a947f0 67 int hide;
af58ef32
SC
68 int value_count;
69 struct graph *parent;
70};
71
b65c7ec4
JA
72struct tick_value {
73 unsigned int offset;
74 double value;
75};
76
af58ef32
SC
77struct graph {
78 char *title;
79 char *xtitle;
80 char *ytitle;
87d5f276 81 unsigned int xdim, ydim;
57f9d28e 82 double xoffset, yoffset;
cdae5ff8 83 struct flist_head label_list;
af58ef32 84 int per_label_limit;
f3e8440f 85 const char *font;
7175d91d
SC
86 graph_axis_unit_change_callback x_axis_unit_change_callback;
87 graph_axis_unit_change_callback y_axis_unit_change_callback;
d8fbeefb 88 unsigned int base_offset;
01a947f0 89 unsigned int dont_graph_all_zeroes;
3c3ed070
JA
90 double left_extra;
91 double right_extra;
92 double top_extra;
93 double bottom_extra;
b65c7ec4
JA
94
95 double xtick_zero;
96 double xtick_delta;
97 double xtick_zero_val;
b7a69ad8 98 double xtick_one_val;
b65c7ec4
JA
99 double ytick_zero;
100 double ytick_delta;
101 double ytick_zero_val;
b7a69ad8 102 double ytick_one_val;
af58ef32
SC
103};
104
3ea48b88
SC
105void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim)
106{
107 g->xdim = xdim;
108 g->ydim = ydim;
109}
110
57f9d28e
SC
111void graph_set_position(struct graph *g, double xoffset, double yoffset)
112{
113 g->xoffset = xoffset;
114 g->yoffset = yoffset;
115}
116
f3e8440f 117struct graph *graph_new(unsigned int xdim, unsigned int ydim, const char *font)
af58ef32
SC
118{
119 struct graph *g;
120
121 g = calloc(1, sizeof(*g));
cdae5ff8 122 INIT_FLIST_HEAD(&g->label_list);
3ea48b88 123 graph_set_size(g, xdim, ydim);
af58ef32 124 g->per_label_limit = -1;
f3e8440f
JA
125 g->font = font;
126 if (!g->font)
a1e7972d 127 g->font = GRAPH_DEFAULT_FONT;
af58ef32
SC
128 return g;
129}
130
a1e7972d
JA
131void graph_set_font(struct graph *g, const char *font)
132{
133 g->font = font;
134}
135
7175d91d
SC
136void graph_x_axis_unit_change_notify(struct graph *g, graph_axis_unit_change_callback f)
137{
138 g->x_axis_unit_change_callback = f;
139}
140
141void graph_y_axis_unit_change_notify(struct graph *g, graph_axis_unit_change_callback f)
142{
143 g->y_axis_unit_change_callback = f;
144}
145
cdae5ff8 146static int count_labels(struct graph *g)
af58ef32 147{
cdae5ff8 148 struct flist_head *entry;
af58ef32 149 int count = 0;
af58ef32 150
cdae5ff8 151 flist_for_each(entry, &g->label_list)
af58ef32 152 count++;
cdae5ff8 153
af58ef32
SC
154 return count;
155}
156
cdae5ff8 157static int count_values(struct graph_label *l)
af58ef32 158{
cdae5ff8 159 struct flist_head *entry;
af58ef32 160 int count = 0;
af58ef32 161
cdae5ff8 162 flist_for_each(entry, &l->value_list)
af58ef32 163 count++;
cdae5ff8 164
af58ef32
SC
165 return count;
166}
167
168typedef double (*double_comparator)(double a, double b);
169
170static double mindouble(double a, double b)
171{
172 return a < b ? a : b;
173}
174
175static double maxdouble(double a, double b)
176{
177 return a < b ? b : a;
178}
179
cdae5ff8 180static double find_double_values(struct graph_label *l, double_comparator cmp)
af58ef32 181{
cdae5ff8 182 struct flist_head *entry;
4aaefbfa 183 double answer = 0.0, tmp;
cdae5ff8 184 int first = 1;
af58ef32 185
01a947f0
JA
186 if (flist_empty(&l->value_list))
187 return 0.0;
188
cdae5ff8
JA
189 flist_for_each(entry, &l->value_list) {
190 struct graph_value *i;
191
192 i = flist_entry(entry, struct graph_value, list);
193 tmp = *(double *) i->value;
af58ef32
SC
194 if (first) {
195 answer = tmp;
196 first = 0;
197 } else {
198 answer = cmp(answer, tmp);
199 }
200 }
201 return answer;
202}
203
cdae5ff8 204static double find_double_data(struct graph *g, double_comparator cmp)
af58ef32 205{
cdae5ff8 206 struct flist_head *entry;
af58ef32
SC
207 struct graph_label *i;
208 int first = 1;
209 double answer, tmp;
210
01a947f0
JA
211 if (flist_empty(&g->label_list))
212 return 0.0;
213
cdae5ff8
JA
214 flist_for_each(entry, &g->label_list) {
215 i = flist_entry(entry, struct graph_label, list);
216 tmp = find_double_values(i, cmp);
af58ef32
SC
217 if (first) {
218 answer = tmp;
219 first = 0;
220 } else {
221 answer = cmp(tmp, answer);
222 }
223 }
224 return answer;
225}
226
cdae5ff8 227static double find_min_data(struct graph *g)
af58ef32 228{
cdae5ff8 229 return find_double_data(g, mindouble);
af58ef32
SC
230}
231
cdae5ff8 232static double find_max_data(struct graph *g)
af58ef32 233{
cdae5ff8 234 return find_double_data(g, maxdouble);
af58ef32
SC
235}
236
237static void draw_bars(struct graph *bg, cairo_t *cr, struct graph_label *lb,
238 double label_offset, double bar_width,
239 double mindata, double maxdata)
240{
cdae5ff8 241 struct flist_head *entry;
af58ef32
SC
242 double x1, y1, x2, y2;
243 int bar_num = 0;
244 double domain, range, v;
245
246 domain = (maxdata - mindata);
247 range = (double) bg->ydim * 0.80; /* FIXME */
248 cairo_stroke(cr);
cdae5ff8
JA
249 flist_for_each(entry, &lb->value_list) {
250 struct graph_value *i;
251
252 i = flist_entry(entry, struct graph_value, list);
af58ef32
SC
253
254 x1 = label_offset + (double) bar_num * bar_width + (bar_width * 0.05);
255 x2 = x1 + bar_width * 0.90;
256 y2 = bg->ydim * 0.90;
257 v = *(double *) i->value;
258 y1 = y2 - (((v - mindata) / domain) * range);
259 cairo_move_to(cr, x1, y1);
260 cairo_line_to(cr, x1, y2);
261 cairo_line_to(cr, x2, y2);
262 cairo_line_to(cr, x2, y1);
263 cairo_close_path(cr);
264 cairo_fill(cr);
265 cairo_stroke(cr);
3c3ed070 266 bar_num++;
af58ef32
SC
267 }
268}
269
f3a3176b
JA
270static void graph_draw_common(struct graph *g, cairo_t *cr, double *x1,
271 double *y1, double *x2, double *y2)
af58ef32 272{
f3a3176b
JA
273 const double shade_col[3][3] = { { 0.55, 0.54, 0.54 },
274 { 0.80, 0.78, 0.78 },
275 { 0.93, 0.91, 0.91 } };
276 int i;
af58ef32 277
3c3ed070 278 *x1 = 0.10 * g->xdim;
6bf86008 279 *x2 = 0.95 * g->xdim;
3c3ed070 280 *y1 = 0.10 * g->ydim;
6bf86008 281 *y2 = 0.90 * g->ydim;
af58ef32 282
f3a3176b
JA
283 /*
284 * Add shade
285 */
286 cairo_set_line_width(cr, 1.0);
287 for (i = 0; i < 3; i++) {
288 float offset = i + 1.0;
289
290 cairo_set_source_rgb(cr, shade_col[i][0], shade_col[i][1], shade_col[i][2]);
291 cairo_move_to(cr, offset + *x1, *y1 - offset);
292 cairo_line_to(cr, *x2 + offset, *y1 - offset);
293 cairo_line_to(cr, *x2 + offset, *y2 - offset);
294 cairo_stroke(cr);
295 }
296
297 cairo_set_source_rgb(cr, 0, 0, 0);
298 cairo_set_line_width(cr, 1.2);
299
af58ef32
SC
300 cairo_move_to(cr, *x1, *y1);
301 cairo_line_to(cr, *x1, *y2);
302 cairo_line_to(cr, *x2, *y2);
303 cairo_line_to(cr, *x2, *y1);
304 cairo_line_to(cr, *x1, *y1);
305 cairo_stroke(cr);
306
ee2f55b2
SC
307 draw_centered_text(cr, g->font, g->xdim / 2, g->ydim / 20, 20.0, g->title);
308 draw_centered_text(cr, g->font, g->xdim / 2, g->ydim * 0.97, 14.0, g->xtitle);
309 draw_vertical_centered_text(cr, g->font, g->xdim * 0.02, g->ydim / 2, 14.0, g->ytitle);
af58ef32
SC
310 cairo_stroke(cr);
311}
312
313static void graph_draw_x_ticks(struct graph *g, cairo_t *cr,
314 double x1, double y1, double x2, double y2,
d8fbeefb 315 double minx, double maxx, int nticks, int add_tm_text)
af58ef32
SC
316{
317 struct tickmark *tm;
318 double tx;
7175d91d 319 int i, power_of_ten;
af58ef32
SC
320 static double dash[] = { 1.0, 2.0 };
321
7175d91d 322 nticks = calc_tickmarks(minx, maxx, nticks, &tm, &power_of_ten,
d8fbeefb 323 g->x_axis_unit_change_callback == NULL, g->base_offset);
7175d91d
SC
324 if (g->x_axis_unit_change_callback)
325 g->x_axis_unit_change_callback(g, power_of_ten);
af58ef32
SC
326
327 for (i = 0; i < nticks; i++) {
328 tx = (((tm[i].value) - minx) / (maxx - minx)) * (x2 - x1) + x1;
d8fbeefb 329
b65c7ec4
JA
330 /*
331 * Update tick delta
332 */
333 if (!i) {
334 g->xtick_zero = tx;
335 g->xtick_zero_val = tm[0].value;
b7a69ad8 336 } else if (i == 1) {
b65c7ec4 337 g->xtick_delta = (tm[1].value - tm[0].value) / (tx - g->xtick_zero);
b7a69ad8
JA
338 g->xtick_one_val = tm[1].value;
339 }
b65c7ec4 340
d8fbeefb
JA
341 /* really tx < yx || tx > x2, but protect against rounding */
342 if (x1 - tx > 0.01 || tx - x2 > 0.01)
af58ef32
SC
343 continue;
344
345 /* Draw tick mark */
6bc821bd 346 cairo_set_line_width(cr, 1.0);
af58ef32
SC
347 cairo_move_to(cr, tx, y2);
348 cairo_line_to(cr, tx, y2 + (y2 - y1) * 0.03);
349 cairo_stroke(cr);
350
351 /* draw grid lines */
352 cairo_save(cr);
6bc821bd
JA
353 cairo_set_dash(cr, dash, 2, 0.66);
354 cairo_set_line_width(cr, 0.33);
af58ef32
SC
355 cairo_move_to(cr, tx, y1);
356 cairo_line_to(cr, tx, y2);
357 cairo_stroke(cr);
358 cairo_restore(cr);
359
d8fbeefb
JA
360 if (!add_tm_text)
361 continue;
362
af58ef32 363 /* draw tickmark label */
ee2f55b2 364 draw_centered_text(cr, g->font, tx, y2 * 1.04, 12.0, tm[i].string);
af58ef32 365 cairo_stroke(cr);
af58ef32
SC
366 }
367}
368
d8fbeefb 369static double graph_draw_y_ticks(struct graph *g, cairo_t *cr,
af58ef32 370 double x1, double y1, double x2, double y2,
d8fbeefb 371 double miny, double maxy, int nticks, int add_tm_text)
af58ef32
SC
372{
373 struct tickmark *tm;
374 double ty;
7175d91d 375 int i, power_of_ten;
6bc821bd 376 static double dash[] = { 1.0, 2.0 };
af58ef32 377
7175d91d 378 nticks = calc_tickmarks(miny, maxy, nticks, &tm, &power_of_ten,
d8fbeefb 379 g->y_axis_unit_change_callback == NULL, g->base_offset);
7175d91d
SC
380 if (g->y_axis_unit_change_callback)
381 g->y_axis_unit_change_callback(g, power_of_ten);
af58ef32 382
d8fbeefb
JA
383 /*
384 * Use highest tickmark as top of graph, not highest value. Otherwise
385 * it's impossible to see what the max value is, if the graph is
386 * fairly flat.
387 */
388 maxy = tm[nticks - 1].value;
389
af58ef32
SC
390 for (i = 0; i < nticks; i++) {
391 ty = y2 - (((tm[i].value) - miny) / (maxy - miny)) * (y2 - y1);
d8fbeefb 392
b65c7ec4
JA
393 /*
394 * Update tick delta
395 */
396 if (!i) {
397 g->ytick_zero = ty;
398 g->ytick_zero_val = tm[0].value;
b7a69ad8 399 } else if (i == 1) {
b65c7ec4 400 g->ytick_delta = (tm[1].value - tm[0].value) / (ty - g->ytick_zero);
b7a69ad8
JA
401 g->ytick_one_val = tm[1].value;
402 }
b65c7ec4 403
d8fbeefb
JA
404 /* really ty < y1 || ty > y2, but protect against rounding */
405 if (y1 - ty > 0.01 || ty - y2 > 0.01)
af58ef32 406 continue;
d8fbeefb 407
af58ef32
SC
408 /* draw tick mark */
409 cairo_move_to(cr, x1, ty);
410 cairo_line_to(cr, x1 - (x2 - x1) * 0.02, ty);
411 cairo_stroke(cr);
412
413 /* draw grid lines */
414 cairo_save(cr);
6bc821bd
JA
415 cairo_set_dash(cr, dash, 2, 0.66);
416 cairo_set_line_width(cr, 0.33);
af58ef32
SC
417 cairo_move_to(cr, x1, ty);
418 cairo_line_to(cr, x2, ty);
419 cairo_stroke(cr);
420 cairo_restore(cr);
421
d8fbeefb
JA
422 if (!add_tm_text)
423 continue;
424
af58ef32 425 /* draw tickmark label */
ee2f55b2 426 draw_right_justified_text(cr, g->font, x1 - (x2 - x1) * 0.025, ty, 12.0, tm[i].string);
af58ef32
SC
427 cairo_stroke(cr);
428 }
d8fbeefb
JA
429
430 /*
431 * Return new max to use
432 */
433 return maxy;
af58ef32
SC
434}
435
436void bar_graph_draw(struct graph *bg, cairo_t *cr)
437{
438 double x1, y1, x2, y2;
439 double space_per_label, bar_width;
440 double label_offset, mindata, maxdata;
441 int i, nlabels;
442 struct graph_label *lb;
cdae5ff8 443 struct flist_head *entry;
af58ef32
SC
444
445 cairo_save(cr);
57f9d28e 446 cairo_translate(cr, bg->xoffset, bg->yoffset);
af58ef32
SC
447 graph_draw_common(bg, cr, &x1, &y1, &x2, &y2);
448
cdae5ff8 449 nlabels = count_labels(bg);
d8fbeefb 450 space_per_label = (x2 - x1) / (double) nlabels;
af58ef32 451
bb39379f
JA
452 /*
453 * Start bars at 0 unless we have negative values, otherwise we
454 * present a skewed picture comparing label X and X+1.
455 */
cdae5ff8 456 mindata = find_min_data(bg);
bb39379f
JA
457 if (mindata > 0)
458 mindata = 0;
459
cdae5ff8 460 maxdata = find_max_data(bg);
af58ef32
SC
461
462 if (fabs(maxdata - mindata) < 1e-20) {
ee2f55b2 463 draw_centered_text(cr, bg->font,
af58ef32
SC
464 x1 + (x2 - x1) / 2.0,
465 y1 + (y2 - y1) / 2.0, 20.0, "No good data");
466 return;
467 }
468
bb39379f 469 maxdata = graph_draw_y_ticks(bg, cr, x1, y1, x2, y2, mindata, maxdata, 10, 1);
af58ef32 470 i = 0;
cdae5ff8 471 flist_for_each(entry, &bg->label_list) {
af58ef32 472 int nvalues;
cdae5ff8
JA
473
474 lb = flist_entry(entry, struct graph_label, list);
475 nvalues = count_values(lb);
af58ef32
SC
476 bar_width = (space_per_label - space_per_label * 0.2) / (double) nvalues;
477 label_offset = bg->xdim * 0.1 + space_per_label * (double) i + space_per_label * 0.1;
478 draw_bars(bg, cr, lb, label_offset, bar_width, mindata, maxdata);
479 // draw_centered_text(cr, label_offset + (bar_width / 2.0 + bar_width * 0.1), bg->ydim * 0.93,
ee2f55b2 480 draw_centered_text(cr, bg->font, x1 + space_per_label * (i + 0.5), bg->ydim * 0.93,
3c3ed070 481 12.0, lb->label);
af58ef32
SC
482 i++;
483 }
484 cairo_stroke(cr);
485 cairo_restore(cr);
486}
487
488typedef double (*xy_value_extractor)(struct graph_value *v);
489
490static double getx(struct graph_value *v)
491{
492 struct xyvalue *xy = v->value;
493 return xy->x;
494}
495
496static double gety(struct graph_value *v)
497{
498 struct xyvalue *xy = v->value;
499 return xy->y;
500}
501
502static double find_xy_value(struct graph *g, xy_value_extractor getvalue, double_comparator cmp)
503{
10e54cdc 504 double tmp, answer = 0.0;
af58ef32
SC
505 struct graph_label *i;
506 struct graph_value *j;
cdae5ff8 507 struct flist_head *jentry, *entry;
d582bf70 508 int first = 1;
af58ef32 509
cdae5ff8
JA
510 flist_for_each(entry, &g->label_list) {
511 i = flist_entry(entry, struct graph_label, list);
512
513 flist_for_each(jentry, &i->value_list) {
514 j = flist_entry(jentry, struct graph_value, list);
af58ef32 515 tmp = getvalue(j);
d582bf70
SC
516 if (first) {
517 first = 0;
518 answer = tmp;
519 }
3c3ed070 520 answer = cmp(tmp, answer);
af58ef32 521 }
cdae5ff8
JA
522 }
523
af58ef32 524 return answer;
01a947f0 525}
af58ef32
SC
526
527void line_graph_draw(struct graph *g, cairo_t *cr)
528{
529 double x1, y1, x2, y2;
def0ac29
SC
530 double minx, miny, maxx, maxy, gminx, gminy, gmaxx, gmaxy;
531 double tx, ty, top_extra, bottom_extra, left_extra, right_extra;
af58ef32
SC
532 struct graph_label *i;
533 struct graph_value *j;
9ce9cfbd 534 int good_data = 1, first = 1;
cdae5ff8 535 struct flist_head *entry, *lentry;
af58ef32
SC
536
537 cairo_save(cr);
57f9d28e 538 cairo_translate(cr, g->xoffset, g->yoffset);
af58ef32
SC
539 graph_draw_common(g, cr, &x1, &y1, &x2, &y2);
540
541 minx = find_xy_value(g, getx, mindouble);
542 maxx = find_xy_value(g, getx, maxdouble);
543 miny = find_xy_value(g, gety, mindouble);
5aec6680
JA
544
545 /*
546 * Start graphs at zero, unless we have a value below. Otherwise
547 * it's hard to visually compare the read and write graph, since
548 * the lowest valued one will be the floor of the graph view.
549 */
550 if (miny > 0)
551 miny = 0;
552
af58ef32
SC
553 maxy = find_xy_value(g, gety, maxdouble);
554
555 if (fabs(maxx - minx) < 1e-20 || fabs(maxy - miny) < 1e-20) {
9ce9cfbd
SC
556 good_data = 0;
557 minx = 0.0;
558 miny = 0.0;
559 maxx = 10.0;
560 maxy = 100.0;
af58ef32
SC
561 }
562
def0ac29
SC
563 top_extra = 0.0;
564 bottom_extra = 0.0;
565 left_extra = 0.0;
566 right_extra = 0.0;
567
568 if (g->top_extra > 0.001)
569 top_extra = fabs(maxy - miny) * g->top_extra;
570 if (g->bottom_extra > 0.001)
571 bottom_extra = fabs(maxy - miny) * g->bottom_extra;
572 if (g->left_extra > 0.001)
573 left_extra = fabs(maxx - minx) * g->left_extra;
574 if (g->right_extra > 0.001)
575 right_extra = fabs(maxx - minx) * g->right_extra;
576
577 gminx = minx - left_extra;
578 gmaxx = maxx + right_extra;
579 gminy = miny - bottom_extra;
580 gmaxy = maxy + top_extra;
581
d8fbeefb
JA
582 graph_draw_x_ticks(g, cr, x1, y1, x2, y2, gminx, gmaxx, 10, good_data);
583 gmaxy = graph_draw_y_ticks(g, cr, x1, y1, x2, y2, gminy, gmaxy, 10, good_data);
af58ef32 584
9ce9cfbd
SC
585 if (!good_data)
586 goto skip_data;
587
f3e8440f 588 cairo_set_line_width(cr, 1.5);
10987b9d
JA
589 cairo_set_line_join(cr, CAIRO_LINE_JOIN_ROUND);
590
cdae5ff8
JA
591 flist_for_each(lentry, &g->label_list) {
592 i = flist_entry(lentry, struct graph_label, list);
af58ef32 593 first = 1;
01a947f0 594 if (i->hide || i->r < 0) /* invisible data */
cae08727 595 continue;
b65c7ec4 596
af58ef32 597 cairo_set_source_rgb(cr, i->r, i->g, i->b);
cdae5ff8
JA
598 flist_for_each(entry, &i->value_list) {
599 j = flist_entry(entry, struct graph_value, list);
def0ac29
SC
600 tx = ((getx(j) - gminx) / (gmaxx - gminx)) * (x2 - x1) + x1;
601 ty = y2 - ((gety(j) - gminy) / (gmaxy - gminy)) * (y2 - y1);
af58ef32
SC
602 if (first) {
603 cairo_move_to(cr, tx, ty);
604 first = 0;
10987b9d 605 } else
af58ef32 606 cairo_line_to(cr, tx, ty);
af58ef32
SC
607 }
608 cairo_stroke(cr);
609 }
9ce9cfbd
SC
610
611skip_data:
af58ef32
SC
612 cairo_restore(cr);
613}
614
af58ef32
SC
615static void setstring(char **str, const char *value)
616{
b65c7ec4 617 free(*str);
af58ef32
SC
618 *str = strdup(value);
619}
620
621void graph_title(struct graph *bg, const char *title)
622{
623 setstring(&bg->title, title);
624}
625
626void graph_x_title(struct graph *bg, const char *title)
627{
628 setstring(&bg->xtitle, title);
629}
630
631void graph_y_title(struct graph *bg, const char *title)
632{
633 setstring(&bg->ytitle, title);
634}
635
636static struct graph_label *graph_find_label(struct graph *bg,
637 const char *label)
638{
cdae5ff8 639 struct flist_head *entry;
af58ef32 640 struct graph_label *i;
3c3ed070 641
cdae5ff8
JA
642 flist_for_each(entry, &bg->label_list) {
643 i = flist_entry(entry, struct graph_label, list);
644
af58ef32
SC
645 if (strcmp(label, i->label) == 0)
646 return i;
cdae5ff8
JA
647 }
648
af58ef32
SC
649 return NULL;
650}
651
8dfd6071 652graph_label_t graph_add_label(struct graph *bg, const char *label)
af58ef32
SC
653{
654 struct graph_label *i;
3c3ed070 655
af58ef32
SC
656 i = graph_find_label(bg, label);
657 if (i)
8dfd6071 658 return i; /* already present. */
af58ef32 659 i = calloc(1, sizeof(*i));
cdae5ff8 660 INIT_FLIST_HEAD(&i->value_list);
af58ef32
SC
661 i->parent = bg;
662 setstring(&i->label, label);
cdae5ff8 663 flist_add_tail(&i->list, &bg->label_list);
b65c7ec4 664 INIT_PRIO_TREE_ROOT(&i->prio_tree);
8dfd6071 665 return i;
af58ef32
SC
666}
667
cdae5ff8
JA
668static void __graph_value_drop(struct graph_label *l, struct graph_value *v)
669{
d0db819d 670 flist_del_init(&v->list);
cdae5ff8
JA
671 if (v->tooltip)
672 free(v->tooltip);
673 free(v->value);
674 free(v);
675 l->value_count--;
676}
677
678static void graph_value_drop(struct graph_label *l, struct graph_value *v)
679{
8dfd6071
JA
680 if (v->flags & GV_F_PRIO_SKIP) {
681 __graph_value_drop(l, v);
682 return;
683 }
684
cdae5ff8
JA
685 /*
686 * Find head, the guy that's on the prio tree
687 */
688 while (!(v->flags & GV_F_ON_PRIO)) {
689 assert(!flist_empty(&v->alias));
9342d5f8 690 v = flist_first_entry(&v->alias, struct graph_value, alias);
cdae5ff8
JA
691 }
692
693 prio_tree_remove(&l->prio_tree, &v->node);
694
695 /*
696 * Free aliases
697 */
d0db819d 698 while (!flist_empty(&v->alias)) {
cdae5ff8
JA
699 struct graph_value *a;
700
9342d5f8 701 a = flist_first_entry(&v->alias, struct graph_value, alias);
d0db819d 702 flist_del_init(&a->alias);
cdae5ff8
JA
703
704 __graph_value_drop(l, a);
705 }
706
707 __graph_value_drop(l, v);
708}
709
b7a69ad8
JA
710static void graph_label_add_value(struct graph_label *i, void *value,
711 const char *tooltip)
af58ef32 712{
b7a69ad8 713 struct graph *g = i->parent;
af58ef32
SC
714 struct graph_value *x;
715
716 x = malloc(sizeof(*x));
3ca30e63 717 memset(x, 0, sizeof(*x));
cdae5ff8
JA
718 INIT_FLIST_HEAD(&x->alias);
719 INIT_FLIST_HEAD(&x->list);
720 flist_add_tail(&x->list, &i->value_list);
af58ef32 721 i->value_count++;
cdae5ff8 722 x->value = value;
b65c7ec4 723
f00e43f2 724 if (tooltip) {
b7a69ad8
JA
725 double xval = getx(x);
726 double minx = xval - (g->xtick_one_val * TOOLTIP_DELTA);
727 double maxx = xval + (g->xtick_one_val * TOOLTIP_DELTA);
4c0cd537 728 struct prio_tree_node *ret;
b65c7ec4 729
5fb8d791
JA
730 /*
731 * use msec to avoid dropping too much precision when
732 * storing as an integer.
733 */
b7a69ad8
JA
734 minx = minx * 1000.0;
735 maxx = maxx * 1000.0;
736
3ca30e63 737 INIT_PRIO_TREE_NODE(&x->node);
b7a69ad8
JA
738 x->node.start = minx;
739 x->node.last = maxx;
cdae5ff8 740 x->tooltip = strdup(tooltip);
b5526827 741 if (x->node.last == x->node.start) {
b7a69ad8
JA
742 x->node.last += fabs(g->xtick_delta);
743 if (x->node.last == x->node.start)
744 x->node.last++;
b5526827 745 }
b65c7ec4 746
4c0cd537
JA
747 /*
748 * If ret != &x->node, we have an alias. Since the values
749 * should be identical, we can drop it
750 */
751 ret = prio_tree_insert(&i->prio_tree, &x->node);
cdae5ff8
JA
752 if (ret != &x->node) {
753 struct graph_value *alias;
754
755 alias = container_of(ret, struct graph_value, node);
756 flist_add_tail(&x->alias, &alias->alias);
bd10a069 757 } else
cdae5ff8 758 x->flags = GV_F_ON_PRIO;
8dfd6071
JA
759 } else
760 x->flags = GV_F_PRIO_SKIP;
af58ef32 761
b7a69ad8
JA
762 if (g->per_label_limit != -1 &&
763 i->value_count > g->per_label_limit) {
c148daed
JA
764 int to_drop = 1;
765
766 /*
767 * If the limit was dynamically reduced, making us more
768 * than 1 entry ahead after adding this one, drop two
769 * entries. This will make us (eventually) reach the
770 * specified limit.
771 */
b7a69ad8 772 if (i->value_count - g->per_label_limit >= 2)
c148daed
JA
773 to_drop = 2;
774
cdae5ff8 775 while (to_drop-- && !flist_empty(&i->value_list)) {
9342d5f8 776 x = flist_first_entry(&i->value_list, struct graph_value, list);
cdae5ff8
JA
777 graph_value_drop(i, x);
778
779 /*
780 * If we have aliases, we could drop > 1 above.
781 */
782 if (i->value_count <= g->per_label_limit)
783 break;
c148daed 784 }
af58ef32
SC
785 }
786}
787
8dfd6071 788int graph_add_data(struct graph *bg, graph_label_t label, const double value)
af58ef32 789{
8dfd6071 790 struct graph_label *i = label;
af58ef32
SC
791 double *d;
792
793 d = malloc(sizeof(*d));
794 *d = value;
795
b7a69ad8 796 graph_label_add_value(i, d, NULL);
af58ef32
SC
797 return 0;
798}
799
01a947f0
JA
800static int graph_nonzero_y(struct graph_label *l)
801{
802 struct flist_head *entry;
803
804 flist_for_each(entry, &l->value_list) {
805 struct graph_value *v;
806
807 v = flist_entry(entry, struct graph_value, list);
808 if (gety(v) != 0.0)
809 return 1;
810 }
811
812 return 0;
813}
814
8dfd6071 815int graph_add_xy_data(struct graph *bg, graph_label_t label,
93e2db2b 816 const double x, const double y, const char *tooltip)
af58ef32 817{
8dfd6071 818 struct graph_label *i = label;
af58ef32
SC
819 struct xyvalue *xy;
820
01a947f0
JA
821 if (bg->dont_graph_all_zeroes && y == 0.0 && !graph_nonzero_y(i))
822 i->hide = 1;
823 else
824 i->hide = 0;
825
826 xy = malloc(sizeof(*xy));
827 xy->x = x;
828 xy->y = y;
829
b7a69ad8 830 graph_label_add_value(i, xy, tooltip);
af58ef32
SC
831 return 0;
832}
833
cdae5ff8 834static void graph_free_values(struct graph_label *l)
af58ef32 835{
cdae5ff8 836 struct graph_value *i;
af58ef32 837
cdae5ff8 838 while (!flist_empty(&l->value_list)) {
9342d5f8 839 i = flist_first_entry(&l->value_list, struct graph_value, list);
cdae5ff8 840 graph_value_drop(l, i);
3c3ed070 841 }
af58ef32
SC
842}
843
cdae5ff8 844static void graph_free_labels(struct graph *g)
af58ef32 845{
cdae5ff8 846 struct graph_label *i;
af58ef32 847
cdae5ff8 848 while (!flist_empty(&g->label_list)) {
9342d5f8 849 i = flist_first_entry(&g->label_list, struct graph_label, list);
cdae5ff8
JA
850 flist_del(&i->list);
851 graph_free_values(i);
b65c7ec4 852 free(i);
3c3ed070 853 }
af58ef32
SC
854}
855
5721d270
JA
856void graph_clear_values(struct graph *g)
857{
858 struct flist_head *node;
859 struct graph_label *i;
860
861 flist_for_each(node, &g->label_list) {
862 i = flist_entry(node, struct graph_label, list);
863 graph_free_values(i);
864 }
865}
866
8dfd6071
JA
867void graph_set_color(struct graph *gr, graph_label_t label, double red,
868 double green, double blue)
af58ef32 869{
8dfd6071 870 struct graph_label *i = label;
af58ef32
SC
871 double r, g, b;
872
cae08727
SC
873 if (red < 0.0) { /* invisible color */
874 r = -1.0;
875 g = -1.0;
876 b = -1.0;
877 } else {
878 r = fabs(red);
879 g = fabs(green);
880 b = fabs(blue);
881
882 if (r > 1.0)
883 r = 1.0;
884 if (g > 1.0)
885 g = 1.0;
886 if (b > 1.0)
b65c7ec4 887 b = 1.0;
cae08727 888 }
af58ef32 889
8dfd6071
JA
890 i->r = r;
891 i->g = g;
892 i->b = b;
af58ef32
SC
893}
894
895void graph_free(struct graph *bg)
896{
b65c7ec4
JA
897 free(bg->title);
898 free(bg->xtitle);
899 free(bg->ytitle);
cdae5ff8 900 graph_free_labels(bg);
af58ef32
SC
901}
902
903/* For each line in the line graph, up to per_label_limit segments may
904 * be added. After that, adding more data to the end of the line
905 * causes data to drop off of the front of the line.
906 */
907void line_graph_set_data_count_limit(struct graph *g, int per_label_limit)
908{
909 g->per_label_limit = per_label_limit;
910}
911
3c3ed070
JA
912void graph_add_extra_space(struct graph *g, double left_percent,
913 double right_percent, double top_percent,
914 double bottom_percent)
def0ac29 915{
3c3ed070
JA
916 g->left_extra = left_percent;
917 g->right_extra = right_percent;
918 g->top_extra = top_percent;
919 g->bottom_extra = bottom_percent;
def0ac29
SC
920}
921
d8fbeefb
JA
922/*
923 * Normally values are logged in a base unit of 0, but for other purposes
924 * it makes more sense to log in higher unit. For instance for bandwidth
925 * purposes, you may want to log in KB/sec (or MB/sec) rather than bytes/sec.
926 */
927void graph_set_base_offset(struct graph *g, unsigned int base_offset)
928{
929 g->base_offset = base_offset;
930}
931
93e2db2b
JA
932int graph_has_tooltips(struct graph *g)
933{
cdae5ff8 934 struct flist_head *entry;
93e2db2b
JA
935 struct graph_label *i;
936
cdae5ff8
JA
937 flist_for_each(entry, &g->label_list) {
938 i = flist_entry(entry, struct graph_label, list);
939
940 if (!prio_tree_empty(&i->prio_tree))
93e2db2b 941 return 1;
cdae5ff8 942 }
93e2db2b
JA
943
944 return 0;
945}
946
947int graph_contains_xy(struct graph *g, int x, int y)
948{
949 int first_x = g->xoffset;
950 int last_x = g->xoffset + g->xdim;
951 int first_y = g->yoffset;
952 int last_y = g->yoffset + g->ydim;
953
954 return (x >= first_x && x <= last_x) && (y >= first_y && y <= last_y);
955}
def0ac29 956
b65c7ec4 957const char *graph_find_tooltip(struct graph *g, int ix, int iy)
93e2db2b 958{
b65c7ec4
JA
959 double x = ix, y = iy;
960 struct prio_tree_iter iter;
961 struct prio_tree_node *n;
b65c7ec4 962 struct graph_value *best = NULL;
cdae5ff8 963 struct flist_head *entry;
b65c7ec4 964 double best_delta;
b7a69ad8 965 double maxy, miny;
93e2db2b 966
b65c7ec4
JA
967 x -= g->xoffset;
968 y -= g->yoffset;
93e2db2b 969
b65c7ec4
JA
970 x = g->xtick_zero_val + ((x - g->xtick_zero) * g->xtick_delta);
971 y = g->ytick_zero_val + ((y - g->ytick_zero) * g->ytick_delta);
93e2db2b 972
b7a69ad8
JA
973 x = x * 1000.0;
974 maxy = y + (g->ytick_one_val * TOOLTIP_DELTA);
975 miny = y - (g->ytick_one_val * TOOLTIP_DELTA);
b65c7ec4 976 best_delta = UINT_MAX;
cdae5ff8
JA
977 flist_for_each(entry, &g->label_list) {
978 struct graph_label *i;
979
980 i = flist_entry(entry, struct graph_label, list);
01a947f0
JA
981 if (i->hide)
982 continue;
cdae5ff8 983
08d7d5a8 984 INIT_PRIO_TREE_ITER(&iter);
b7a69ad8 985 prio_tree_iter_init(&iter, &i->prio_tree, x, x);
b65c7ec4
JA
986
987 n = prio_tree_next(&iter);
988 if (!n)
989 continue;
990
991 do {
cdae5ff8 992 struct graph_value *v, *rootv;
b7a69ad8 993 double yval, ydiff;
b65c7ec4
JA
994
995 v = container_of(n, struct graph_value, node);
cdae5ff8
JA
996 rootv = v;
997 do {
998 yval = gety(v);
999 ydiff = fabs(yval - y);
1000
1001 /*
1002 * zero delta, or within or match critera, break
1003 */
1004 if (ydiff < best_delta) {
1005 best_delta = ydiff;
1006 if (!best_delta ||
1007 (yval >= miny && yval <= maxy)) {
1008 best = v;
1009 break;
1010 }
b65c7ec4 1011 }
cdae5ff8 1012 if (!flist_empty(&v->alias))
9342d5f8 1013 v = flist_first_entry(&v->alias, struct graph_value, alias);
cdae5ff8 1014 } while (v != rootv);
b65c7ec4
JA
1015 } while ((n = prio_tree_next(&iter)) != NULL);
1016
1017 /*
1018 * If we got matches in one label, don't check others.
1019 */
d0db819d
JA
1020 if (best)
1021 break;
cdae5ff8 1022 }
b65c7ec4
JA
1023
1024 if (best)
1025 return best->tooltip;
93e2db2b
JA
1026
1027 return NULL;
1028}
01a947f0
JA
1029
1030void graph_set_graph_all_zeroes(struct graph *g, unsigned int set)
1031{
1032 g->dont_graph_all_zeroes = !set;
1033}