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