Commit | Line | Data |
---|---|---|
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 | |
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> | |
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 | |
43 | struct xyvalue { | |
44 | double x, y; | |
45 | }; | |
46 | ||
cdae5ff8 JA |
47 | enum { |
48 | GV_F_ON_PRIO = 1, | |
8dfd6071 | 49 | GV_F_PRIO_SKIP = 2, |
cdae5ff8 JA |
50 | }; |
51 | ||
af58ef32 | 52 | struct 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 | ||
61 | struct 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 |
72 | struct tick_value { |
73 | unsigned int offset; | |
74 | double value; | |
75 | }; | |
76 | ||
af58ef32 SC |
77 | struct 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 |
105 | void 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 |
111 | void graph_set_position(struct graph *g, double xoffset, double yoffset) |
112 | { | |
113 | g->xoffset = xoffset; | |
114 | g->yoffset = yoffset; | |
115 | } | |
116 | ||
f3e8440f | 117 | struct 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 |
131 | void graph_set_font(struct graph *g, const char *font) |
132 | { | |
133 | g->font = font; | |
134 | } | |
135 | ||
7175d91d SC |
136 | void 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 | ||
141 | void 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 | 146 | static 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 | 157 | static 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 | ||
168 | typedef double (*double_comparator)(double a, double b); | |
169 | ||
170 | static double mindouble(double a, double b) | |
171 | { | |
172 | return a < b ? a : b; | |
173 | } | |
174 | ||
175 | static double maxdouble(double a, double b) | |
176 | { | |
177 | return a < b ? b : a; | |
178 | } | |
179 | ||
cdae5ff8 | 180 | static double find_double_values(struct graph_label *l, double_comparator cmp) |
af58ef32 | 181 | { |
cdae5ff8 | 182 | struct flist_head *entry; |
af58ef32 | 183 | double answer, 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 | 204 | static 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 | 227 | static double find_min_data(struct graph *g) |
af58ef32 | 228 | { |
cdae5ff8 | 229 | return find_double_data(g, mindouble); |
af58ef32 SC |
230 | } |
231 | ||
cdae5ff8 | 232 | static double find_max_data(struct graph *g) |
af58ef32 | 233 | { |
cdae5ff8 | 234 | return find_double_data(g, maxdouble); |
af58ef32 SC |
235 | } |
236 | ||
237 | static 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 | ||
af58ef32 SC |
270 | static void graph_draw_common(struct graph *g, cairo_t *cr, |
271 | double *x1, double *y1, double *x2, double *y2) | |
272 | { | |
4e14f018 | 273 | cairo_set_source_rgb(cr, 0, 0, 0); |
3c3ed070 | 274 | cairo_set_line_width(cr, 0.8); |
af58ef32 | 275 | |
3c3ed070 | 276 | *x1 = 0.10 * g->xdim; |
6bf86008 | 277 | *x2 = 0.95 * g->xdim; |
3c3ed070 | 278 | *y1 = 0.10 * g->ydim; |
6bf86008 | 279 | *y2 = 0.90 * g->ydim; |
af58ef32 SC |
280 | |
281 | cairo_move_to(cr, *x1, *y1); | |
282 | cairo_line_to(cr, *x1, *y2); | |
283 | cairo_line_to(cr, *x2, *y2); | |
284 | cairo_line_to(cr, *x2, *y1); | |
285 | cairo_line_to(cr, *x1, *y1); | |
286 | cairo_stroke(cr); | |
287 | ||
ee2f55b2 SC |
288 | draw_centered_text(cr, g->font, g->xdim / 2, g->ydim / 20, 20.0, g->title); |
289 | draw_centered_text(cr, g->font, g->xdim / 2, g->ydim * 0.97, 14.0, g->xtitle); | |
290 | draw_vertical_centered_text(cr, g->font, g->xdim * 0.02, g->ydim / 2, 14.0, g->ytitle); | |
af58ef32 SC |
291 | cairo_stroke(cr); |
292 | } | |
293 | ||
294 | static void graph_draw_x_ticks(struct graph *g, cairo_t *cr, | |
295 | double x1, double y1, double x2, double y2, | |
d8fbeefb | 296 | double minx, double maxx, int nticks, int add_tm_text) |
af58ef32 SC |
297 | { |
298 | struct tickmark *tm; | |
299 | double tx; | |
7175d91d | 300 | int i, power_of_ten; |
af58ef32 SC |
301 | static double dash[] = { 1.0, 2.0 }; |
302 | ||
7175d91d | 303 | nticks = calc_tickmarks(minx, maxx, nticks, &tm, &power_of_ten, |
d8fbeefb | 304 | g->x_axis_unit_change_callback == NULL, g->base_offset); |
7175d91d SC |
305 | if (g->x_axis_unit_change_callback) |
306 | g->x_axis_unit_change_callback(g, power_of_ten); | |
af58ef32 SC |
307 | |
308 | for (i = 0; i < nticks; i++) { | |
309 | tx = (((tm[i].value) - minx) / (maxx - minx)) * (x2 - x1) + x1; | |
d8fbeefb | 310 | |
b65c7ec4 JA |
311 | /* |
312 | * Update tick delta | |
313 | */ | |
314 | if (!i) { | |
315 | g->xtick_zero = tx; | |
316 | g->xtick_zero_val = tm[0].value; | |
b7a69ad8 | 317 | } else if (i == 1) { |
b65c7ec4 | 318 | g->xtick_delta = (tm[1].value - tm[0].value) / (tx - g->xtick_zero); |
b7a69ad8 JA |
319 | g->xtick_one_val = tm[1].value; |
320 | } | |
b65c7ec4 | 321 | |
d8fbeefb JA |
322 | /* really tx < yx || tx > x2, but protect against rounding */ |
323 | if (x1 - tx > 0.01 || tx - x2 > 0.01) | |
af58ef32 SC |
324 | continue; |
325 | ||
326 | /* Draw tick mark */ | |
f3e8440f | 327 | cairo_set_line_width(cr, 0.8); |
af58ef32 SC |
328 | cairo_move_to(cr, tx, y2); |
329 | cairo_line_to(cr, tx, y2 + (y2 - y1) * 0.03); | |
330 | cairo_stroke(cr); | |
331 | ||
332 | /* draw grid lines */ | |
333 | cairo_save(cr); | |
334 | cairo_set_dash(cr, dash, 2, 2.0); | |
335 | cairo_set_line_width(cr, 0.5); | |
336 | cairo_move_to(cr, tx, y1); | |
337 | cairo_line_to(cr, tx, y2); | |
338 | cairo_stroke(cr); | |
339 | cairo_restore(cr); | |
340 | ||
d8fbeefb JA |
341 | if (!add_tm_text) |
342 | continue; | |
343 | ||
af58ef32 | 344 | /* draw tickmark label */ |
ee2f55b2 | 345 | draw_centered_text(cr, g->font, tx, y2 * 1.04, 12.0, tm[i].string); |
af58ef32 | 346 | cairo_stroke(cr); |
af58ef32 SC |
347 | } |
348 | } | |
349 | ||
d8fbeefb | 350 | static double graph_draw_y_ticks(struct graph *g, cairo_t *cr, |
af58ef32 | 351 | double x1, double y1, double x2, double y2, |
d8fbeefb | 352 | double miny, double maxy, int nticks, int add_tm_text) |
af58ef32 SC |
353 | { |
354 | struct tickmark *tm; | |
355 | double ty; | |
7175d91d | 356 | int i, power_of_ten; |
af58ef32 SC |
357 | static double dash[] = { 2.0, 2.0 }; |
358 | ||
7175d91d | 359 | nticks = calc_tickmarks(miny, maxy, nticks, &tm, &power_of_ten, |
d8fbeefb | 360 | g->y_axis_unit_change_callback == NULL, g->base_offset); |
7175d91d SC |
361 | if (g->y_axis_unit_change_callback) |
362 | g->y_axis_unit_change_callback(g, power_of_ten); | |
af58ef32 | 363 | |
d8fbeefb JA |
364 | /* |
365 | * Use highest tickmark as top of graph, not highest value. Otherwise | |
366 | * it's impossible to see what the max value is, if the graph is | |
367 | * fairly flat. | |
368 | */ | |
369 | maxy = tm[nticks - 1].value; | |
370 | ||
af58ef32 SC |
371 | for (i = 0; i < nticks; i++) { |
372 | ty = y2 - (((tm[i].value) - miny) / (maxy - miny)) * (y2 - y1); | |
d8fbeefb | 373 | |
b65c7ec4 JA |
374 | /* |
375 | * Update tick delta | |
376 | */ | |
377 | if (!i) { | |
378 | g->ytick_zero = ty; | |
379 | g->ytick_zero_val = tm[0].value; | |
b7a69ad8 | 380 | } else if (i == 1) { |
b65c7ec4 | 381 | g->ytick_delta = (tm[1].value - tm[0].value) / (ty - g->ytick_zero); |
b7a69ad8 JA |
382 | g->ytick_one_val = tm[1].value; |
383 | } | |
b65c7ec4 | 384 | |
d8fbeefb JA |
385 | /* really ty < y1 || ty > y2, but protect against rounding */ |
386 | if (y1 - ty > 0.01 || ty - y2 > 0.01) | |
af58ef32 | 387 | continue; |
d8fbeefb | 388 | |
af58ef32 SC |
389 | /* draw tick mark */ |
390 | cairo_move_to(cr, x1, ty); | |
391 | cairo_line_to(cr, x1 - (x2 - x1) * 0.02, ty); | |
392 | cairo_stroke(cr); | |
393 | ||
394 | /* draw grid lines */ | |
395 | cairo_save(cr); | |
396 | cairo_set_dash(cr, dash, 2, 2.0); | |
397 | cairo_set_line_width(cr, 0.5); | |
398 | cairo_move_to(cr, x1, ty); | |
399 | cairo_line_to(cr, x2, ty); | |
400 | cairo_stroke(cr); | |
401 | cairo_restore(cr); | |
402 | ||
d8fbeefb JA |
403 | if (!add_tm_text) |
404 | continue; | |
405 | ||
af58ef32 | 406 | /* draw tickmark label */ |
ee2f55b2 | 407 | draw_right_justified_text(cr, g->font, x1 - (x2 - x1) * 0.025, ty, 12.0, tm[i].string); |
af58ef32 SC |
408 | cairo_stroke(cr); |
409 | } | |
d8fbeefb JA |
410 | |
411 | /* | |
412 | * Return new max to use | |
413 | */ | |
414 | return maxy; | |
af58ef32 SC |
415 | } |
416 | ||
417 | void bar_graph_draw(struct graph *bg, cairo_t *cr) | |
418 | { | |
419 | double x1, y1, x2, y2; | |
420 | double space_per_label, bar_width; | |
421 | double label_offset, mindata, maxdata; | |
422 | int i, nlabels; | |
423 | struct graph_label *lb; | |
cdae5ff8 | 424 | struct flist_head *entry; |
af58ef32 SC |
425 | |
426 | cairo_save(cr); | |
57f9d28e | 427 | cairo_translate(cr, bg->xoffset, bg->yoffset); |
af58ef32 SC |
428 | graph_draw_common(bg, cr, &x1, &y1, &x2, &y2); |
429 | ||
cdae5ff8 | 430 | nlabels = count_labels(bg); |
d8fbeefb | 431 | space_per_label = (x2 - x1) / (double) nlabels; |
af58ef32 | 432 | |
bb39379f JA |
433 | /* |
434 | * Start bars at 0 unless we have negative values, otherwise we | |
435 | * present a skewed picture comparing label X and X+1. | |
436 | */ | |
cdae5ff8 | 437 | mindata = find_min_data(bg); |
bb39379f JA |
438 | if (mindata > 0) |
439 | mindata = 0; | |
440 | ||
cdae5ff8 | 441 | maxdata = find_max_data(bg); |
af58ef32 SC |
442 | |
443 | if (fabs(maxdata - mindata) < 1e-20) { | |
ee2f55b2 | 444 | draw_centered_text(cr, bg->font, |
af58ef32 SC |
445 | x1 + (x2 - x1) / 2.0, |
446 | y1 + (y2 - y1) / 2.0, 20.0, "No good data"); | |
447 | return; | |
448 | } | |
449 | ||
bb39379f | 450 | maxdata = graph_draw_y_ticks(bg, cr, x1, y1, x2, y2, mindata, maxdata, 10, 1); |
af58ef32 | 451 | i = 0; |
cdae5ff8 | 452 | flist_for_each(entry, &bg->label_list) { |
af58ef32 | 453 | int nvalues; |
cdae5ff8 JA |
454 | |
455 | lb = flist_entry(entry, struct graph_label, list); | |
456 | nvalues = count_values(lb); | |
af58ef32 SC |
457 | bar_width = (space_per_label - space_per_label * 0.2) / (double) nvalues; |
458 | label_offset = bg->xdim * 0.1 + space_per_label * (double) i + space_per_label * 0.1; | |
459 | draw_bars(bg, cr, lb, label_offset, bar_width, mindata, maxdata); | |
460 | // draw_centered_text(cr, label_offset + (bar_width / 2.0 + bar_width * 0.1), bg->ydim * 0.93, | |
ee2f55b2 | 461 | draw_centered_text(cr, bg->font, x1 + space_per_label * (i + 0.5), bg->ydim * 0.93, |
3c3ed070 | 462 | 12.0, lb->label); |
af58ef32 SC |
463 | i++; |
464 | } | |
465 | cairo_stroke(cr); | |
466 | cairo_restore(cr); | |
467 | } | |
468 | ||
469 | typedef double (*xy_value_extractor)(struct graph_value *v); | |
470 | ||
471 | static double getx(struct graph_value *v) | |
472 | { | |
473 | struct xyvalue *xy = v->value; | |
474 | return xy->x; | |
475 | } | |
476 | ||
477 | static double gety(struct graph_value *v) | |
478 | { | |
479 | struct xyvalue *xy = v->value; | |
480 | return xy->y; | |
481 | } | |
482 | ||
483 | static double find_xy_value(struct graph *g, xy_value_extractor getvalue, double_comparator cmp) | |
484 | { | |
10e54cdc | 485 | double tmp, answer = 0.0; |
af58ef32 SC |
486 | struct graph_label *i; |
487 | struct graph_value *j; | |
cdae5ff8 | 488 | struct flist_head *jentry, *entry; |
d582bf70 | 489 | int first = 1; |
af58ef32 | 490 | |
cdae5ff8 JA |
491 | flist_for_each(entry, &g->label_list) { |
492 | i = flist_entry(entry, struct graph_label, list); | |
493 | ||
494 | flist_for_each(jentry, &i->value_list) { | |
495 | j = flist_entry(jentry, struct graph_value, list); | |
af58ef32 | 496 | tmp = getvalue(j); |
d582bf70 SC |
497 | if (first) { |
498 | first = 0; | |
499 | answer = tmp; | |
500 | } | |
3c3ed070 | 501 | answer = cmp(tmp, answer); |
af58ef32 | 502 | } |
cdae5ff8 JA |
503 | } |
504 | ||
af58ef32 | 505 | return answer; |
01a947f0 | 506 | } |
af58ef32 SC |
507 | |
508 | void line_graph_draw(struct graph *g, cairo_t *cr) | |
509 | { | |
510 | double x1, y1, x2, y2; | |
def0ac29 SC |
511 | double minx, miny, maxx, maxy, gminx, gminy, gmaxx, gmaxy; |
512 | double tx, ty, top_extra, bottom_extra, left_extra, right_extra; | |
af58ef32 SC |
513 | struct graph_label *i; |
514 | struct graph_value *j; | |
9ce9cfbd | 515 | int good_data = 1, first = 1; |
cdae5ff8 | 516 | struct flist_head *entry, *lentry; |
af58ef32 SC |
517 | |
518 | cairo_save(cr); | |
57f9d28e | 519 | cairo_translate(cr, g->xoffset, g->yoffset); |
af58ef32 SC |
520 | graph_draw_common(g, cr, &x1, &y1, &x2, &y2); |
521 | ||
522 | minx = find_xy_value(g, getx, mindouble); | |
523 | maxx = find_xy_value(g, getx, maxdouble); | |
524 | miny = find_xy_value(g, gety, mindouble); | |
5aec6680 JA |
525 | |
526 | /* | |
527 | * Start graphs at zero, unless we have a value below. Otherwise | |
528 | * it's hard to visually compare the read and write graph, since | |
529 | * the lowest valued one will be the floor of the graph view. | |
530 | */ | |
531 | if (miny > 0) | |
532 | miny = 0; | |
533 | ||
af58ef32 SC |
534 | maxy = find_xy_value(g, gety, maxdouble); |
535 | ||
536 | if (fabs(maxx - minx) < 1e-20 || fabs(maxy - miny) < 1e-20) { | |
9ce9cfbd SC |
537 | good_data = 0; |
538 | minx = 0.0; | |
539 | miny = 0.0; | |
540 | maxx = 10.0; | |
541 | maxy = 100.0; | |
af58ef32 SC |
542 | } |
543 | ||
def0ac29 SC |
544 | top_extra = 0.0; |
545 | bottom_extra = 0.0; | |
546 | left_extra = 0.0; | |
547 | right_extra = 0.0; | |
548 | ||
549 | if (g->top_extra > 0.001) | |
550 | top_extra = fabs(maxy - miny) * g->top_extra; | |
551 | if (g->bottom_extra > 0.001) | |
552 | bottom_extra = fabs(maxy - miny) * g->bottom_extra; | |
553 | if (g->left_extra > 0.001) | |
554 | left_extra = fabs(maxx - minx) * g->left_extra; | |
555 | if (g->right_extra > 0.001) | |
556 | right_extra = fabs(maxx - minx) * g->right_extra; | |
557 | ||
558 | gminx = minx - left_extra; | |
559 | gmaxx = maxx + right_extra; | |
560 | gminy = miny - bottom_extra; | |
561 | gmaxy = maxy + top_extra; | |
562 | ||
d8fbeefb JA |
563 | graph_draw_x_ticks(g, cr, x1, y1, x2, y2, gminx, gmaxx, 10, good_data); |
564 | gmaxy = graph_draw_y_ticks(g, cr, x1, y1, x2, y2, gminy, gmaxy, 10, good_data); | |
af58ef32 | 565 | |
9ce9cfbd SC |
566 | if (!good_data) |
567 | goto skip_data; | |
568 | ||
f3e8440f | 569 | cairo_set_line_width(cr, 1.5); |
cdae5ff8 JA |
570 | flist_for_each(lentry, &g->label_list) { |
571 | i = flist_entry(lentry, struct graph_label, list); | |
af58ef32 | 572 | first = 1; |
01a947f0 | 573 | if (i->hide || i->r < 0) /* invisible data */ |
cae08727 | 574 | continue; |
b65c7ec4 | 575 | |
af58ef32 | 576 | cairo_set_source_rgb(cr, i->r, i->g, i->b); |
cdae5ff8 JA |
577 | flist_for_each(entry, &i->value_list) { |
578 | j = flist_entry(entry, struct graph_value, list); | |
def0ac29 SC |
579 | tx = ((getx(j) - gminx) / (gmaxx - gminx)) * (x2 - x1) + x1; |
580 | ty = y2 - ((gety(j) - gminy) / (gmaxy - gminy)) * (y2 - y1); | |
af58ef32 SC |
581 | if (first) { |
582 | cairo_move_to(cr, tx, ty); | |
583 | first = 0; | |
584 | } else { | |
585 | cairo_line_to(cr, tx, ty); | |
586 | } | |
587 | } | |
588 | cairo_stroke(cr); | |
589 | } | |
9ce9cfbd SC |
590 | |
591 | skip_data: | |
af58ef32 SC |
592 | cairo_restore(cr); |
593 | } | |
594 | ||
af58ef32 SC |
595 | static void setstring(char **str, const char *value) |
596 | { | |
b65c7ec4 | 597 | free(*str); |
af58ef32 SC |
598 | *str = strdup(value); |
599 | } | |
600 | ||
601 | void graph_title(struct graph *bg, const char *title) | |
602 | { | |
603 | setstring(&bg->title, title); | |
604 | } | |
605 | ||
606 | void graph_x_title(struct graph *bg, const char *title) | |
607 | { | |
608 | setstring(&bg->xtitle, title); | |
609 | } | |
610 | ||
611 | void graph_y_title(struct graph *bg, const char *title) | |
612 | { | |
613 | setstring(&bg->ytitle, title); | |
614 | } | |
615 | ||
616 | static struct graph_label *graph_find_label(struct graph *bg, | |
617 | const char *label) | |
618 | { | |
cdae5ff8 | 619 | struct flist_head *entry; |
af58ef32 | 620 | struct graph_label *i; |
3c3ed070 | 621 | |
cdae5ff8 JA |
622 | flist_for_each(entry, &bg->label_list) { |
623 | i = flist_entry(entry, struct graph_label, list); | |
624 | ||
af58ef32 SC |
625 | if (strcmp(label, i->label) == 0) |
626 | return i; | |
cdae5ff8 JA |
627 | } |
628 | ||
af58ef32 SC |
629 | return NULL; |
630 | } | |
631 | ||
8dfd6071 | 632 | graph_label_t graph_add_label(struct graph *bg, const char *label) |
af58ef32 SC |
633 | { |
634 | struct graph_label *i; | |
3c3ed070 | 635 | |
af58ef32 SC |
636 | i = graph_find_label(bg, label); |
637 | if (i) | |
8dfd6071 | 638 | return i; /* already present. */ |
af58ef32 | 639 | i = calloc(1, sizeof(*i)); |
cdae5ff8 | 640 | INIT_FLIST_HEAD(&i->value_list); |
af58ef32 SC |
641 | i->parent = bg; |
642 | setstring(&i->label, label); | |
cdae5ff8 | 643 | flist_add_tail(&i->list, &bg->label_list); |
b65c7ec4 | 644 | INIT_PRIO_TREE_ROOT(&i->prio_tree); |
8dfd6071 | 645 | return i; |
af58ef32 SC |
646 | } |
647 | ||
cdae5ff8 JA |
648 | static void __graph_value_drop(struct graph_label *l, struct graph_value *v) |
649 | { | |
d0db819d | 650 | flist_del_init(&v->list); |
cdae5ff8 JA |
651 | if (v->tooltip) |
652 | free(v->tooltip); | |
653 | free(v->value); | |
654 | free(v); | |
655 | l->value_count--; | |
656 | } | |
657 | ||
658 | static void graph_value_drop(struct graph_label *l, struct graph_value *v) | |
659 | { | |
8dfd6071 JA |
660 | if (v->flags & GV_F_PRIO_SKIP) { |
661 | __graph_value_drop(l, v); | |
662 | return; | |
663 | } | |
664 | ||
cdae5ff8 JA |
665 | /* |
666 | * Find head, the guy that's on the prio tree | |
667 | */ | |
668 | while (!(v->flags & GV_F_ON_PRIO)) { | |
669 | assert(!flist_empty(&v->alias)); | |
670 | v = flist_entry(v->alias.next, struct graph_value, alias); | |
671 | } | |
672 | ||
673 | prio_tree_remove(&l->prio_tree, &v->node); | |
674 | ||
675 | /* | |
676 | * Free aliases | |
677 | */ | |
d0db819d | 678 | while (!flist_empty(&v->alias)) { |
cdae5ff8 JA |
679 | struct graph_value *a; |
680 | ||
d0db819d JA |
681 | a = flist_entry(v->alias.next, struct graph_value, alias); |
682 | flist_del_init(&a->alias); | |
cdae5ff8 JA |
683 | |
684 | __graph_value_drop(l, a); | |
685 | } | |
686 | ||
687 | __graph_value_drop(l, v); | |
688 | } | |
689 | ||
b7a69ad8 JA |
690 | static void graph_label_add_value(struct graph_label *i, void *value, |
691 | const char *tooltip) | |
af58ef32 | 692 | { |
b7a69ad8 | 693 | struct graph *g = i->parent; |
af58ef32 SC |
694 | struct graph_value *x; |
695 | ||
696 | x = malloc(sizeof(*x)); | |
3ca30e63 | 697 | memset(x, 0, sizeof(*x)); |
cdae5ff8 JA |
698 | INIT_FLIST_HEAD(&x->alias); |
699 | INIT_FLIST_HEAD(&x->list); | |
700 | flist_add_tail(&x->list, &i->value_list); | |
af58ef32 | 701 | i->value_count++; |
cdae5ff8 | 702 | x->value = value; |
b65c7ec4 | 703 | |
f00e43f2 | 704 | if (tooltip) { |
b7a69ad8 JA |
705 | double xval = getx(x); |
706 | double minx = xval - (g->xtick_one_val * TOOLTIP_DELTA); | |
707 | double maxx = xval + (g->xtick_one_val * TOOLTIP_DELTA); | |
4c0cd537 | 708 | struct prio_tree_node *ret; |
b65c7ec4 | 709 | |
5fb8d791 JA |
710 | /* |
711 | * use msec to avoid dropping too much precision when | |
712 | * storing as an integer. | |
713 | */ | |
b7a69ad8 JA |
714 | minx = minx * 1000.0; |
715 | maxx = maxx * 1000.0; | |
716 | ||
3ca30e63 | 717 | INIT_PRIO_TREE_NODE(&x->node); |
b7a69ad8 JA |
718 | x->node.start = minx; |
719 | x->node.last = maxx; | |
cdae5ff8 | 720 | x->tooltip = strdup(tooltip); |
b5526827 | 721 | if (x->node.last == x->node.start) { |
b7a69ad8 JA |
722 | x->node.last += fabs(g->xtick_delta); |
723 | if (x->node.last == x->node.start) | |
724 | x->node.last++; | |
b5526827 | 725 | } |
b65c7ec4 | 726 | |
4c0cd537 JA |
727 | /* |
728 | * If ret != &x->node, we have an alias. Since the values | |
729 | * should be identical, we can drop it | |
730 | */ | |
731 | ret = prio_tree_insert(&i->prio_tree, &x->node); | |
cdae5ff8 JA |
732 | if (ret != &x->node) { |
733 | struct graph_value *alias; | |
734 | ||
735 | alias = container_of(ret, struct graph_value, node); | |
736 | flist_add_tail(&x->alias, &alias->alias); | |
bd10a069 | 737 | } else |
cdae5ff8 | 738 | x->flags = GV_F_ON_PRIO; |
8dfd6071 JA |
739 | } else |
740 | x->flags = GV_F_PRIO_SKIP; | |
af58ef32 | 741 | |
b7a69ad8 JA |
742 | if (g->per_label_limit != -1 && |
743 | i->value_count > g->per_label_limit) { | |
c148daed JA |
744 | int to_drop = 1; |
745 | ||
746 | /* | |
747 | * If the limit was dynamically reduced, making us more | |
748 | * than 1 entry ahead after adding this one, drop two | |
749 | * entries. This will make us (eventually) reach the | |
750 | * specified limit. | |
751 | */ | |
b7a69ad8 | 752 | if (i->value_count - g->per_label_limit >= 2) |
c148daed JA |
753 | to_drop = 2; |
754 | ||
cdae5ff8 JA |
755 | while (to_drop-- && !flist_empty(&i->value_list)) { |
756 | x = flist_entry(i->value_list.next, struct graph_value, list); | |
757 | graph_value_drop(i, x); | |
758 | ||
759 | /* | |
760 | * If we have aliases, we could drop > 1 above. | |
761 | */ | |
762 | if (i->value_count <= g->per_label_limit) | |
763 | break; | |
c148daed | 764 | } |
af58ef32 SC |
765 | } |
766 | } | |
767 | ||
8dfd6071 | 768 | int graph_add_data(struct graph *bg, graph_label_t label, const double value) |
af58ef32 | 769 | { |
8dfd6071 | 770 | struct graph_label *i = label; |
af58ef32 SC |
771 | double *d; |
772 | ||
773 | d = malloc(sizeof(*d)); | |
774 | *d = value; | |
775 | ||
b7a69ad8 | 776 | graph_label_add_value(i, d, NULL); |
af58ef32 SC |
777 | return 0; |
778 | } | |
779 | ||
01a947f0 JA |
780 | static int graph_nonzero_y(struct graph_label *l) |
781 | { | |
782 | struct flist_head *entry; | |
783 | ||
784 | flist_for_each(entry, &l->value_list) { | |
785 | struct graph_value *v; | |
786 | ||
787 | v = flist_entry(entry, struct graph_value, list); | |
788 | if (gety(v) != 0.0) | |
789 | return 1; | |
790 | } | |
791 | ||
792 | return 0; | |
793 | } | |
794 | ||
8dfd6071 | 795 | int graph_add_xy_data(struct graph *bg, graph_label_t label, |
93e2db2b | 796 | const double x, const double y, const char *tooltip) |
af58ef32 | 797 | { |
8dfd6071 | 798 | struct graph_label *i = label; |
af58ef32 SC |
799 | struct xyvalue *xy; |
800 | ||
01a947f0 JA |
801 | if (bg->dont_graph_all_zeroes && y == 0.0 && !graph_nonzero_y(i)) |
802 | i->hide = 1; | |
803 | else | |
804 | i->hide = 0; | |
805 | ||
806 | xy = malloc(sizeof(*xy)); | |
807 | xy->x = x; | |
808 | xy->y = y; | |
809 | ||
b7a69ad8 | 810 | graph_label_add_value(i, xy, tooltip); |
af58ef32 SC |
811 | return 0; |
812 | } | |
813 | ||
cdae5ff8 | 814 | static void graph_free_values(struct graph_label *l) |
af58ef32 | 815 | { |
cdae5ff8 | 816 | struct graph_value *i; |
af58ef32 | 817 | |
cdae5ff8 JA |
818 | while (!flist_empty(&l->value_list)) { |
819 | i = flist_entry(l->value_list.next, struct graph_value, list); | |
820 | graph_value_drop(l, i); | |
3c3ed070 | 821 | } |
af58ef32 SC |
822 | } |
823 | ||
cdae5ff8 | 824 | static void graph_free_labels(struct graph *g) |
af58ef32 | 825 | { |
cdae5ff8 | 826 | struct graph_label *i; |
af58ef32 | 827 | |
cdae5ff8 JA |
828 | while (!flist_empty(&g->label_list)) { |
829 | i = flist_entry(g->label_list.next, struct graph_label, list); | |
830 | flist_del(&i->list); | |
831 | graph_free_values(i); | |
b65c7ec4 | 832 | free(i); |
3c3ed070 | 833 | } |
af58ef32 SC |
834 | } |
835 | ||
8dfd6071 JA |
836 | void graph_set_color(struct graph *gr, graph_label_t label, double red, |
837 | double green, double blue) | |
af58ef32 | 838 | { |
8dfd6071 | 839 | struct graph_label *i = label; |
af58ef32 SC |
840 | double r, g, b; |
841 | ||
cae08727 SC |
842 | if (red < 0.0) { /* invisible color */ |
843 | r = -1.0; | |
844 | g = -1.0; | |
845 | b = -1.0; | |
846 | } else { | |
847 | r = fabs(red); | |
848 | g = fabs(green); | |
849 | b = fabs(blue); | |
850 | ||
851 | if (r > 1.0) | |
852 | r = 1.0; | |
853 | if (g > 1.0) | |
854 | g = 1.0; | |
855 | if (b > 1.0) | |
b65c7ec4 | 856 | b = 1.0; |
cae08727 | 857 | } |
af58ef32 | 858 | |
8dfd6071 JA |
859 | i->r = r; |
860 | i->g = g; | |
861 | i->b = b; | |
af58ef32 SC |
862 | } |
863 | ||
864 | void graph_free(struct graph *bg) | |
865 | { | |
b65c7ec4 JA |
866 | free(bg->title); |
867 | free(bg->xtitle); | |
868 | free(bg->ytitle); | |
cdae5ff8 | 869 | graph_free_labels(bg); |
af58ef32 SC |
870 | } |
871 | ||
872 | /* For each line in the line graph, up to per_label_limit segments may | |
873 | * be added. After that, adding more data to the end of the line | |
874 | * causes data to drop off of the front of the line. | |
875 | */ | |
876 | void line_graph_set_data_count_limit(struct graph *g, int per_label_limit) | |
877 | { | |
878 | g->per_label_limit = per_label_limit; | |
879 | } | |
880 | ||
3c3ed070 JA |
881 | void graph_add_extra_space(struct graph *g, double left_percent, |
882 | double right_percent, double top_percent, | |
883 | double bottom_percent) | |
def0ac29 | 884 | { |
3c3ed070 JA |
885 | g->left_extra = left_percent; |
886 | g->right_extra = right_percent; | |
887 | g->top_extra = top_percent; | |
888 | g->bottom_extra = bottom_percent; | |
def0ac29 SC |
889 | } |
890 | ||
d8fbeefb JA |
891 | /* |
892 | * Normally values are logged in a base unit of 0, but for other purposes | |
893 | * it makes more sense to log in higher unit. For instance for bandwidth | |
894 | * purposes, you may want to log in KB/sec (or MB/sec) rather than bytes/sec. | |
895 | */ | |
896 | void graph_set_base_offset(struct graph *g, unsigned int base_offset) | |
897 | { | |
898 | g->base_offset = base_offset; | |
899 | } | |
900 | ||
93e2db2b JA |
901 | int graph_has_tooltips(struct graph *g) |
902 | { | |
cdae5ff8 | 903 | struct flist_head *entry; |
93e2db2b JA |
904 | struct graph_label *i; |
905 | ||
cdae5ff8 JA |
906 | flist_for_each(entry, &g->label_list) { |
907 | i = flist_entry(entry, struct graph_label, list); | |
908 | ||
909 | if (!prio_tree_empty(&i->prio_tree)) | |
93e2db2b | 910 | return 1; |
cdae5ff8 | 911 | } |
93e2db2b JA |
912 | |
913 | return 0; | |
914 | } | |
915 | ||
916 | int graph_contains_xy(struct graph *g, int x, int y) | |
917 | { | |
918 | int first_x = g->xoffset; | |
919 | int last_x = g->xoffset + g->xdim; | |
920 | int first_y = g->yoffset; | |
921 | int last_y = g->yoffset + g->ydim; | |
922 | ||
923 | return (x >= first_x && x <= last_x) && (y >= first_y && y <= last_y); | |
924 | } | |
def0ac29 | 925 | |
b65c7ec4 | 926 | const char *graph_find_tooltip(struct graph *g, int ix, int iy) |
93e2db2b | 927 | { |
b65c7ec4 JA |
928 | double x = ix, y = iy; |
929 | struct prio_tree_iter iter; | |
930 | struct prio_tree_node *n; | |
b65c7ec4 | 931 | struct graph_value *best = NULL; |
cdae5ff8 | 932 | struct flist_head *entry; |
b65c7ec4 | 933 | double best_delta; |
b7a69ad8 | 934 | double maxy, miny; |
93e2db2b | 935 | |
b65c7ec4 JA |
936 | x -= g->xoffset; |
937 | y -= g->yoffset; | |
93e2db2b | 938 | |
b65c7ec4 JA |
939 | x = g->xtick_zero_val + ((x - g->xtick_zero) * g->xtick_delta); |
940 | y = g->ytick_zero_val + ((y - g->ytick_zero) * g->ytick_delta); | |
93e2db2b | 941 | |
b7a69ad8 JA |
942 | x = x * 1000.0; |
943 | maxy = y + (g->ytick_one_val * TOOLTIP_DELTA); | |
944 | miny = y - (g->ytick_one_val * TOOLTIP_DELTA); | |
b65c7ec4 | 945 | best_delta = UINT_MAX; |
cdae5ff8 JA |
946 | flist_for_each(entry, &g->label_list) { |
947 | struct graph_label *i; | |
948 | ||
949 | i = flist_entry(entry, struct graph_label, list); | |
01a947f0 JA |
950 | if (i->hide) |
951 | continue; | |
cdae5ff8 | 952 | |
08d7d5a8 | 953 | INIT_PRIO_TREE_ITER(&iter); |
b7a69ad8 | 954 | prio_tree_iter_init(&iter, &i->prio_tree, x, x); |
b65c7ec4 JA |
955 | |
956 | n = prio_tree_next(&iter); | |
957 | if (!n) | |
958 | continue; | |
959 | ||
960 | do { | |
cdae5ff8 | 961 | struct graph_value *v, *rootv; |
b7a69ad8 | 962 | double yval, ydiff; |
b65c7ec4 JA |
963 | |
964 | v = container_of(n, struct graph_value, node); | |
cdae5ff8 JA |
965 | rootv = v; |
966 | do { | |
967 | yval = gety(v); | |
968 | ydiff = fabs(yval - y); | |
969 | ||
970 | /* | |
971 | * zero delta, or within or match critera, break | |
972 | */ | |
973 | if (ydiff < best_delta) { | |
974 | best_delta = ydiff; | |
975 | if (!best_delta || | |
976 | (yval >= miny && yval <= maxy)) { | |
977 | best = v; | |
978 | break; | |
979 | } | |
b65c7ec4 | 980 | } |
cdae5ff8 JA |
981 | if (!flist_empty(&v->alias)) |
982 | v = flist_entry(v->alias.next, struct graph_value, alias); | |
983 | } while (v != rootv); | |
b65c7ec4 JA |
984 | } while ((n = prio_tree_next(&iter)) != NULL); |
985 | ||
986 | /* | |
987 | * If we got matches in one label, don't check others. | |
988 | */ | |
d0db819d JA |
989 | if (best) |
990 | break; | |
cdae5ff8 | 991 | } |
b65c7ec4 JA |
992 | |
993 | if (best) | |
994 | return best->tooltip; | |
93e2db2b JA |
995 | |
996 | return NULL; | |
997 | } | |
01a947f0 JA |
998 | |
999 | void graph_set_graph_all_zeroes(struct graph *g, unsigned int set) | |
1000 | { | |
1001 | g->dont_graph_all_zeroes = !set; | |
1002 | } |