3ce39598c8b5d28e7d54ce3f87f4fc9e30d4916f
1 /****************************************************************************
2 * RRDtool 1.2.11 Copyright by Tobi Oetiker, 1997-2005
3 ****************************************************************************
4 * rrd__graph.c produce graphs from data in rrdfiles
5 ****************************************************************************/
8 #include <sys/stat.h>
10 #include "rrd_tool.h"
12 #if defined(_WIN32) && !defined(__CYGWIN__) && !defined(__CYGWIN32__)
13 #include <io.h>
14 #include <fcntl.h>
15 #endif
17 #ifdef HAVE_TIME_H
18 #include <time.h>
19 #endif
21 #ifdef HAVE_LOCALE_H
22 #include <locale.h>
23 #endif
25 #include "rrd_graph.h"
27 /* some constant definitions */
31 #ifndef RRD_DEFAULT_FONT
32 /* there is special code later to pick Cour.ttf when running on windows */
33 #define RRD_DEFAULT_FONT "DejaVuSansMono-Roman.ttf"
34 #endif
36 text_prop_t text_prop[] = {
37 { 8.0, RRD_DEFAULT_FONT }, /* default */
38 { 9.0, RRD_DEFAULT_FONT }, /* title */
39 { 7.0, RRD_DEFAULT_FONT }, /* axis */
40 { 8.0, RRD_DEFAULT_FONT }, /* unit */
41 { 8.0, RRD_DEFAULT_FONT } /* legend */
42 };
44 xlab_t xlab[] = {
45 {0, TMT_SECOND,30, TMT_MINUTE,5, TMT_MINUTE,5, 0,"%H:%M"},
46 {2, TMT_MINUTE,1, TMT_MINUTE,5, TMT_MINUTE,5, 0,"%H:%M"},
47 {5, TMT_MINUTE,2, TMT_MINUTE,10, TMT_MINUTE,10, 0,"%H:%M"},
48 {10, TMT_MINUTE,5, TMT_MINUTE,20, TMT_MINUTE,20, 0,"%H:%M"},
49 {30, TMT_MINUTE,10, TMT_HOUR,1, TMT_HOUR,1, 0,"%H:%M"},
50 {60, TMT_MINUTE,30, TMT_HOUR,2, TMT_HOUR,2, 0,"%H:%M"},
51 {180, TMT_HOUR,1, TMT_HOUR,6, TMT_HOUR,6, 0,"%H:%M"},
52 /*{300, TMT_HOUR,3, TMT_HOUR,12, TMT_HOUR,12, 12*3600,"%a %p"}, this looks silly*/
53 {600, TMT_HOUR,6, TMT_DAY,1, TMT_DAY,1, 24*3600,"%a"},
54 {1800, TMT_HOUR,12, TMT_DAY,1, TMT_DAY,2, 24*3600,"%a"},
55 {3600, TMT_DAY,1, TMT_WEEK,1, TMT_WEEK,1, 7*24*3600,"Week %V"},
56 {3*3600, TMT_WEEK,1, TMT_MONTH,1, TMT_WEEK,2, 7*24*3600,"Week %V"},
57 {6*3600, TMT_MONTH,1, TMT_MONTH,1, TMT_MONTH,1, 30*24*3600,"%b"},
58 {48*3600, TMT_MONTH,1, TMT_MONTH,3, TMT_MONTH,3, 30*24*3600,"%b"},
59 {10*24*3600, TMT_YEAR,1, TMT_YEAR,1, TMT_YEAR,1, 365*24*3600,"%y"},
60 {-1,TMT_MONTH,0,TMT_MONTH,0,TMT_MONTH,0,0,""}
61 };
63 /* sensible logarithmic y label intervals ...
64 the first element of each row defines the possible starting points on the
65 y axis ... the other specify the */
67 double yloglab[][12]= {{ 1e9, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
68 { 1e3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
69 { 1e1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
70 /* { 1e1, 1, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, */
71 { 1e1, 1, 2.5, 5, 7.5, 0, 0, 0, 0, 0, 0, 0 },
72 { 1e1, 1, 2, 4, 6, 8, 0, 0, 0, 0, 0, 0 },
73 { 1e1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0 },
74 { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }};
76 /* sensible y label intervals ...*/
78 ylab_t ylab[]= {
79 {0.1, {1,2, 5,10}},
80 {0.2, {1,5,10,20}},
81 {0.5, {1,2, 4,10}},
82 {1.0, {1,2, 5,10}},
83 {2.0, {1,5,10,20}},
84 {5.0, {1,2, 4,10}},
85 {10.0, {1,2, 5,10}},
86 {20.0, {1,5,10,20}},
87 {50.0, {1,2, 4,10}},
88 {100.0, {1,2, 5,10}},
89 {200.0, {1,5,10,20}},
90 {500.0, {1,2, 4,10}},
91 {0.0, {0,0,0,0}}};
94 gfx_color_t graph_col[] = /* default colors */
95 { 0xFFFFFFFF, /* canvas */
96 0xF0F0F0FF, /* background */
97 0xD0D0D0FF, /* shade A */
98 0xA0A0A0FF, /* shade B */
99 0x90909080, /* grid */
100 0xE0505080, /* major grid */
101 0x000000FF, /* font */
102 0x802020FF, /* arrow */
103 0x202020FF, /* axis */
104 0x000000FF /* frame */
105 };
108 /* #define DEBUG */
110 #ifdef DEBUG
111 # define DPRINT(x) (void)(printf x, printf("\n"))
112 #else
113 # define DPRINT(x)
114 #endif
117 /* initialize with xtr(im,0); */
118 int
119 xtr(image_desc_t *im,time_t mytime){
120 static double pixie;
121 if (mytime==0){
122 pixie = (double) im->xsize / (double)(im->end - im->start);
123 return im->xorigin;
124 }
125 return (int)((double)im->xorigin
126 + pixie * ( mytime - im->start ) );
127 }
129 /* translate data values into y coordinates */
130 double
131 ytr(image_desc_t *im, double value){
132 static double pixie;
133 double yval;
134 if (isnan(value)){
135 if(!im->logarithmic)
136 pixie = (double) im->ysize / (im->maxval - im->minval);
137 else
138 pixie = (double) im->ysize / (log10(im->maxval) - log10(im->minval));
139 yval = im->yorigin;
140 } else if(!im->logarithmic) {
141 yval = im->yorigin - pixie * (value - im->minval);
142 } else {
143 if (value < im->minval) {
144 yval = im->yorigin;
145 } else {
146 yval = im->yorigin - pixie * (log10(value) - log10(im->minval));
147 }
148 }
149 /* make sure we don't return anything too unreasonable. GD lib can
150 get terribly slow when drawing lines outside its scope. This is
151 especially problematic in connection with the rigid option */
152 if (! im->rigid) {
153 /* keep yval as-is */
154 } else if (yval > im->yorigin) {
155 yval = im->yorigin +0.00001;
156 } else if (yval < im->yorigin - im->ysize){
157 yval = im->yorigin - im->ysize - 0.00001;
158 }
159 return yval;
160 }
164 /* conversion function for symbolic entry names */
167 #define conv_if(VV,VVV) \
168 if (strcmp(#VV, string) == 0) return VVV ;
170 enum gf_en gf_conv(char *string){
172 conv_if(PRINT,GF_PRINT)
173 conv_if(GPRINT,GF_GPRINT)
174 conv_if(COMMENT,GF_COMMENT)
175 conv_if(HRULE,GF_HRULE)
176 conv_if(VRULE,GF_VRULE)
177 conv_if(LINE,GF_LINE)
178 conv_if(AREA,GF_AREA)
179 conv_if(STACK,GF_STACK)
180 conv_if(TICK,GF_TICK)
181 conv_if(DEF,GF_DEF)
182 conv_if(CDEF,GF_CDEF)
183 conv_if(VDEF,GF_VDEF)
184 #ifdef WITH_PIECHART
185 conv_if(PART,GF_PART)
186 #endif
187 conv_if(XPORT,GF_XPORT)
188 conv_if(SHIFT,GF_SHIFT)
190 return (-1);
191 }
193 enum gfx_if_en if_conv(char *string){
195 conv_if(PNG,IF_PNG)
196 conv_if(SVG,IF_SVG)
197 conv_if(EPS,IF_EPS)
198 conv_if(PDF,IF_PDF)
200 return (-1);
201 }
203 enum tmt_en tmt_conv(char *string){
205 conv_if(SECOND,TMT_SECOND)
206 conv_if(MINUTE,TMT_MINUTE)
207 conv_if(HOUR,TMT_HOUR)
208 conv_if(DAY,TMT_DAY)
209 conv_if(WEEK,TMT_WEEK)
210 conv_if(MONTH,TMT_MONTH)
211 conv_if(YEAR,TMT_YEAR)
212 return (-1);
213 }
215 enum grc_en grc_conv(char *string){
217 conv_if(BACK,GRC_BACK)
218 conv_if(CANVAS,GRC_CANVAS)
219 conv_if(SHADEA,GRC_SHADEA)
220 conv_if(SHADEB,GRC_SHADEB)
221 conv_if(GRID,GRC_GRID)
222 conv_if(MGRID,GRC_MGRID)
223 conv_if(FONT,GRC_FONT)
224 conv_if(ARROW,GRC_ARROW)
225 conv_if(AXIS,GRC_AXIS)
226 conv_if(FRAME,GRC_FRAME)
228 return -1;
229 }
231 enum text_prop_en text_prop_conv(char *string){
233 conv_if(DEFAULT,TEXT_PROP_DEFAULT)
234 conv_if(TITLE,TEXT_PROP_TITLE)
235 conv_if(AXIS,TEXT_PROP_AXIS)
236 conv_if(UNIT,TEXT_PROP_UNIT)
237 conv_if(LEGEND,TEXT_PROP_LEGEND)
238 return -1;
239 }
242 #undef conv_if
244 int
245 im_free(image_desc_t *im)
246 {
247 unsigned long i,ii;
249 if (im == NULL) return 0;
250 for(i=0;i<(unsigned)im->gdes_c;i++){
251 if (im->gdes[i].data_first){
252 /* careful here, because a single pointer can occur several times */
253 free (im->gdes[i].data);
254 if (im->gdes[i].ds_namv){
255 for (ii=0;ii<im->gdes[i].ds_cnt;ii++)
256 free(im->gdes[i].ds_namv[ii]);
257 free(im->gdes[i].ds_namv);
258 }
259 }
260 free (im->gdes[i].p_data);
261 free (im->gdes[i].rpnp);
262 }
263 free(im->gdes);
264 gfx_destroy(im->canvas);
265 return 0;
266 }
268 /* find SI magnitude symbol for the given number*/
269 void
270 auto_scale(
271 image_desc_t *im, /* image description */
272 double *value,
273 char **symb_ptr,
274 double *magfact
275 )
276 {
278 char *symbol[] = {"a", /* 10e-18 Atto */
279 "f", /* 10e-15 Femto */
280 "p", /* 10e-12 Pico */
281 "n", /* 10e-9 Nano */
282 "u", /* 10e-6 Micro */
283 "m", /* 10e-3 Milli */
284 " ", /* Base */
285 "k", /* 10e3 Kilo */
286 "M", /* 10e6 Mega */
287 "G", /* 10e9 Giga */
288 "T", /* 10e12 Tera */
289 "P", /* 10e15 Peta */
290 "E"};/* 10e18 Exa */
292 int symbcenter = 6;
293 int sindex;
295 if (*value == 0.0 || isnan(*value) ) {
296 sindex = 0;
297 *magfact = 1.0;
298 } else {
299 sindex = floor(log(fabs(*value))/log((double)im->base));
300 *magfact = pow((double)im->base, (double)sindex);
301 (*value) /= (*magfact);
302 }
303 if ( sindex <= symbcenter && sindex >= -symbcenter) {
304 (*symb_ptr) = symbol[sindex+symbcenter];
305 }
306 else {
307 (*symb_ptr) = "?";
308 }
309 }
312 /* find SI magnitude symbol for the numbers on the y-axis*/
313 void
314 si_unit(
315 image_desc_t *im /* image description */
316 )
317 {
319 char symbol[] = {'a', /* 10e-18 Atto */
320 'f', /* 10e-15 Femto */
321 'p', /* 10e-12 Pico */
322 'n', /* 10e-9 Nano */
323 'u', /* 10e-6 Micro */
324 'm', /* 10e-3 Milli */
325 ' ', /* Base */
326 'k', /* 10e3 Kilo */
327 'M', /* 10e6 Mega */
328 'G', /* 10e9 Giga */
329 'T', /* 10e12 Tera */
330 'P', /* 10e15 Peta */
331 'E'};/* 10e18 Exa */
333 int symbcenter = 6;
334 double digits,viewdigits=0;
336 digits = floor( log( max( fabs(im->minval),fabs(im->maxval)))/log((double)im->base));
338 if (im->unitsexponent != 9999) {
339 /* unitsexponent = 9, 6, 3, 0, -3, -6, -9, etc */
340 viewdigits = floor(im->unitsexponent / 3);
341 } else {
342 viewdigits = digits;
343 }
345 im->magfact = pow((double)im->base , digits);
347 #ifdef DEBUG
348 printf("digits %6.3f im->magfact %6.3f\n",digits,im->magfact);
349 #endif
351 im->viewfactor = im->magfact / pow((double)im->base , viewdigits);
353 if ( ((viewdigits+symbcenter) < sizeof(symbol)) &&
354 ((viewdigits+symbcenter) >= 0) )
355 im->symbol = symbol[(int)viewdigits+symbcenter];
356 else
357 im->symbol = '?';
358 }
360 /* move min and max values around to become sensible */
362 void
363 expand_range(image_desc_t *im)
364 {
365 double sensiblevalues[] ={1000.0,900.0,800.0,750.0,700.0,
366 600.0,500.0,400.0,300.0,250.0,
367 200.0,125.0,100.0,90.0,80.0,
368 75.0,70.0,60.0,50.0,40.0,30.0,
369 25.0,20.0,10.0,9.0,8.0,
370 7.0,6.0,5.0,4.0,3.5,3.0,
371 2.5,2.0,1.8,1.5,1.2,1.0,
372 0.8,0.7,0.6,0.5,0.4,0.3,0.2,0.1,0.0,-1};
374 double scaled_min,scaled_max;
375 double adj;
376 int i;
380 #ifdef DEBUG
381 printf("Min: %6.2f Max: %6.2f MagFactor: %6.2f\n",
382 im->minval,im->maxval,im->magfact);
383 #endif
385 if (isnan(im->ygridstep)){
386 if(im->extra_flags & ALTAUTOSCALE) {
387 /* measure the amplitude of the function. Make sure that
388 graph boundaries are slightly higher then max/min vals
389 so we can see amplitude on the graph */
390 double delt, fact;
392 delt = im->maxval - im->minval;
393 adj = delt * 0.1;
394 fact = 2.0 * pow(10.0,
395 floor(log10(max(fabs(im->minval), fabs(im->maxval))/im->magfact)) - 2);
396 if (delt < fact) {
397 adj = (fact - delt) * 0.55;
398 #ifdef DEBUG
399 printf("Min: %6.2f Max: %6.2f delt: %6.2f fact: %6.2f adj: %6.2f\n", im->minval, im->maxval, delt, fact, adj);
400 #endif
401 }
402 im->minval -= adj;
403 im->maxval += adj;
404 }
405 else if(im->extra_flags & ALTAUTOSCALE_MAX) {
406 /* measure the amplitude of the function. Make sure that
407 graph boundaries are slightly higher than max vals
408 so we can see amplitude on the graph */
409 adj = (im->maxval - im->minval) * 0.1;
410 im->maxval += adj;
411 }
412 else {
413 scaled_min = im->minval / im->magfact;
414 scaled_max = im->maxval / im->magfact;
416 for (i=1; sensiblevalues[i] > 0; i++){
417 if (sensiblevalues[i-1]>=scaled_min &&
418 sensiblevalues[i]<=scaled_min)
419 im->minval = sensiblevalues[i]*(im->magfact);
421 if (-sensiblevalues[i-1]<=scaled_min &&
422 -sensiblevalues[i]>=scaled_min)
423 im->minval = -sensiblevalues[i-1]*(im->magfact);
425 if (sensiblevalues[i-1] >= scaled_max &&
426 sensiblevalues[i] <= scaled_max)
427 im->maxval = sensiblevalues[i-1]*(im->magfact);
429 if (-sensiblevalues[i-1]<=scaled_max &&
430 -sensiblevalues[i] >=scaled_max)
431 im->maxval = -sensiblevalues[i]*(im->magfact);
432 }
433 }
434 } else {
435 /* adjust min and max to the grid definition if there is one */
436 im->minval = (double)im->ylabfact * im->ygridstep *
437 floor(im->minval / ((double)im->ylabfact * im->ygridstep));
438 im->maxval = (double)im->ylabfact * im->ygridstep *
439 ceil(im->maxval /( (double)im->ylabfact * im->ygridstep));
440 }
442 #ifdef DEBUG
443 fprintf(stderr,"SCALED Min: %6.2f Max: %6.2f Factor: %6.2f\n",
444 im->minval,im->maxval,im->magfact);
445 #endif
446 }
448 void
449 apply_gridfit(image_desc_t *im)
450 {
451 if (isnan(im->minval) || isnan(im->maxval))
452 return;
453 ytr(im,DNAN);
454 if (im->logarithmic) {
455 double ya, yb, ypix, ypixfrac;
456 double log10_range = log10(im->maxval) - log10(im->minval);
457 ya = pow((double)10, floor(log10(im->minval)));
458 while (ya < im->minval)
459 ya *= 10;
460 if (ya > im->maxval)
461 return; /* don't have y=10^x gridline */
462 yb = ya * 10;
463 if (yb <= im->maxval) {
464 /* we have at least 2 y=10^x gridlines.
465 Make sure distance between them in pixels
466 are an integer by expanding im->maxval */
467 double y_pixel_delta = ytr(im, ya) - ytr(im, yb);
468 double factor = y_pixel_delta / floor(y_pixel_delta);
469 double new_log10_range = factor * log10_range;
470 double new_ymax_log10 = log10(im->minval) + new_log10_range;
471 im->maxval = pow(10, new_ymax_log10);
472 ytr(im,DNAN); /* reset precalc */
473 log10_range = log10(im->maxval) - log10(im->minval);
474 }
475 /* make sure first y=10^x gridline is located on
476 integer pixel position by moving scale slightly
477 downwards (sub-pixel movement) */
478 ypix = ytr(im, ya) + im->ysize; /* add im->ysize so it always is positive */
479 ypixfrac = ypix - floor(ypix);
480 if (ypixfrac > 0 && ypixfrac < 1) {
481 double yfrac = ypixfrac / im->ysize;
482 im->minval = pow(10, log10(im->minval) - yfrac * log10_range);
483 im->maxval = pow(10, log10(im->maxval) - yfrac * log10_range);
484 ytr(im,DNAN); /* reset precalc */
485 }
486 } else {
487 /* Make sure we have an integer pixel distance between
488 each minor gridline */
489 double ypos1 = ytr(im, im->minval);
490 double ypos2 = ytr(im, im->minval + im->ygrid_scale.gridstep);
491 double y_pixel_delta = ypos1 - ypos2;
492 double factor = y_pixel_delta / floor(y_pixel_delta);
493 double new_range = factor * (im->maxval - im->minval);
494 double gridstep = im->ygrid_scale.gridstep;
495 double minor_y, minor_y_px, minor_y_px_frac;
496 im->maxval = im->minval + new_range;
497 ytr(im,DNAN); /* reset precalc */
498 /* make sure first minor gridline is on integer pixel y coord */
499 minor_y = gridstep * floor(im->minval / gridstep);
500 while (minor_y < im->minval)
501 minor_y += gridstep;
502 minor_y_px = ytr(im, minor_y) + im->ysize; /* ensure > 0 by adding ysize */
503 minor_y_px_frac = minor_y_px - floor(minor_y_px);
504 if (minor_y_px_frac > 0 && minor_y_px_frac < 1) {
505 double yfrac = minor_y_px_frac / im->ysize;
506 double range = im->maxval - im->minval;
507 im->minval = im->minval - yfrac * range;
508 im->maxval = im->maxval - yfrac * range;
509 ytr(im,DNAN); /* reset precalc */
510 }
511 calc_horizontal_grid(im); /* recalc with changed im->maxval */
512 }
513 }
515 /* reduce data reimplementation by Alex */
517 void
518 reduce_data(
519 enum cf_en cf, /* which consolidation function ?*/
520 unsigned long cur_step, /* step the data currently is in */
521 time_t *start, /* start, end and step as requested ... */
522 time_t *end, /* ... by the application will be ... */
523 unsigned long *step, /* ... adjusted to represent reality */
524 unsigned long *ds_cnt, /* number of data sources in file */
525 rrd_value_t **data) /* two dimensional array containing the data */
526 {
527 int i,reduce_factor = ceil((double)(*step) / (double)cur_step);
528 unsigned long col,dst_row,row_cnt,start_offset,end_offset,skiprows=0;
529 rrd_value_t *srcptr,*dstptr;
531 (*step) = cur_step*reduce_factor; /* set new step size for reduced data */
532 dstptr = *data;
533 srcptr = *data;
534 row_cnt = ((*end)-(*start))/cur_step;
536 #ifdef DEBUG
537 #define DEBUG_REDUCE
538 #endif
539 #ifdef DEBUG_REDUCE
540 printf("Reducing %lu rows with factor %i time %lu to %lu, step %lu\n",
541 row_cnt,reduce_factor,*start,*end,cur_step);
542 for (col=0;col<row_cnt;col++) {
543 printf("time %10lu: ",*start+(col+1)*cur_step);
544 for (i=0;i<*ds_cnt;i++)
545 printf(" %8.2e",srcptr[*ds_cnt*col+i]);
546 printf("\n");
547 }
548 #endif
550 /* We have to combine [reduce_factor] rows of the source
551 ** into one row for the destination. Doing this we also
552 ** need to take care to combine the correct rows. First
553 ** alter the start and end time so that they are multiples
554 ** of the new step time. We cannot reduce the amount of
555 ** time so we have to move the end towards the future and
556 ** the start towards the past.
557 */
558 end_offset = (*end) % (*step);
559 start_offset = (*start) % (*step);
561 /* If there is a start offset (which cannot be more than
562 ** one destination row), skip the appropriate number of
563 ** source rows and one destination row. The appropriate
564 ** number is what we do know (start_offset/cur_step) of
565 ** the new interval (*step/cur_step aka reduce_factor).
566 */
567 #ifdef DEBUG_REDUCE
568 printf("start_offset: %lu end_offset: %lu\n",start_offset,end_offset);
569 printf("row_cnt before: %lu\n",row_cnt);
570 #endif
571 if (start_offset) {
572 (*start) = (*start)-start_offset;
573 skiprows=reduce_factor-start_offset/cur_step;
574 srcptr+=skiprows* *ds_cnt;
575 for (col=0;col<(*ds_cnt);col++) *dstptr++ = DNAN;
576 row_cnt-=skiprows;
577 }
578 #ifdef DEBUG_REDUCE
579 printf("row_cnt between: %lu\n",row_cnt);
580 #endif
582 /* At the end we have some rows that are not going to be
583 ** used, the amount is end_offset/cur_step
584 */
585 if (end_offset) {
586 (*end) = (*end)-end_offset+(*step);
587 skiprows = end_offset/cur_step;
588 row_cnt-=skiprows;
589 }
590 #ifdef DEBUG_REDUCE
591 printf("row_cnt after: %lu\n",row_cnt);
592 #endif
594 /* Sanity check: row_cnt should be multiple of reduce_factor */
595 /* if this gets triggered, something is REALLY WRONG ... we die immediately */
597 if (row_cnt%reduce_factor) {
598 printf("SANITY CHECK: %lu rows cannot be reduced by %i \n",
599 row_cnt,reduce_factor);
600 printf("BUG in reduce_data()\n");
601 exit(1);
602 }
604 /* Now combine reduce_factor intervals at a time
605 ** into one interval for the destination.
606 */
608 for (dst_row=0;(long int)row_cnt>=reduce_factor;dst_row++) {
609 for (col=0;col<(*ds_cnt);col++) {
610 rrd_value_t newval=DNAN;
611 unsigned long validval=0;
613 for (i=0;i<reduce_factor;i++) {
614 if (isnan(srcptr[i*(*ds_cnt)+col])) {
615 continue;
616 }
617 validval++;
618 if (isnan(newval)) newval = srcptr[i*(*ds_cnt)+col];
619 else {
620 switch (cf) {
621 case CF_HWPREDICT:
622 case CF_DEVSEASONAL:
623 case CF_DEVPREDICT:
624 case CF_SEASONAL:
625 case CF_AVERAGE:
626 newval += srcptr[i*(*ds_cnt)+col];
627 break;
628 case CF_MINIMUM:
629 newval = min (newval,srcptr[i*(*ds_cnt)+col]);
630 break;
631 case CF_FAILURES:
632 /* an interval contains a failure if any subintervals contained a failure */
633 case CF_MAXIMUM:
634 newval = max (newval,srcptr[i*(*ds_cnt)+col]);
635 break;
636 case CF_LAST:
637 newval = srcptr[i*(*ds_cnt)+col];
638 break;
639 }
640 }
641 }
642 if (validval == 0){newval = DNAN;} else{
643 switch (cf) {
644 case CF_HWPREDICT:
645 case CF_DEVSEASONAL:
646 case CF_DEVPREDICT:
647 case CF_SEASONAL:
648 case CF_AVERAGE:
649 newval /= validval;
650 break;
651 case CF_MINIMUM:
652 case CF_FAILURES:
653 case CF_MAXIMUM:
654 case CF_LAST:
655 break;
656 }
657 }
658 *dstptr++=newval;
659 }
660 srcptr+=(*ds_cnt)*reduce_factor;
661 row_cnt-=reduce_factor;
662 }
663 /* If we had to alter the endtime, we didn't have enough
664 ** source rows to fill the last row. Fill it with NaN.
665 */
666 if (end_offset) for (col=0;col<(*ds_cnt);col++) *dstptr++ = DNAN;
667 #ifdef DEBUG_REDUCE
668 row_cnt = ((*end)-(*start))/ *step;
669 srcptr = *data;
670 printf("Done reducing. Currently %lu rows, time %lu to %lu, step %lu\n",
671 row_cnt,*start,*end,*step);
672 for (col=0;col<row_cnt;col++) {
673 printf("time %10lu: ",*start+(col+1)*(*step));
674 for (i=0;i<*ds_cnt;i++)
675 printf(" %8.2e",srcptr[*ds_cnt*col+i]);
676 printf("\n");
677 }
678 #endif
679 }
682 /* get the data required for the graphs from the
683 relevant rrds ... */
685 int
686 data_fetch(image_desc_t *im )
687 {
688 int i,ii;
689 int skip;
691 /* pull the data from the log files ... */
692 for (i=0;i< (int)im->gdes_c;i++){
693 /* only GF_DEF elements fetch data */
694 if (im->gdes[i].gf != GF_DEF)
695 continue;
697 skip=0;
698 /* do we have it already ?*/
699 for (ii=0;ii<i;ii++) {
700 if (im->gdes[ii].gf != GF_DEF)
701 continue;
702 if ((strcmp(im->gdes[i].rrd, im->gdes[ii].rrd) == 0)
703 && (im->gdes[i].cf == im->gdes[ii].cf)
704 && (im->gdes[i].cf_reduce == im->gdes[ii].cf_reduce)
705 && (im->gdes[i].start == im->gdes[ii].start)
706 && (im->gdes[i].end == im->gdes[ii].end)
707 && (im->gdes[i].step == im->gdes[ii].step)) {
708 /* OK, the data is already there.
709 ** Just copy the header portion
710 */
711 im->gdes[i].start = im->gdes[ii].start;
712 im->gdes[i].end = im->gdes[ii].end;
713 im->gdes[i].step = im->gdes[ii].step;
714 im->gdes[i].ds_cnt = im->gdes[ii].ds_cnt;
715 im->gdes[i].ds_namv = im->gdes[ii].ds_namv;
716 im->gdes[i].data = im->gdes[ii].data;
717 im->gdes[i].data_first = 0;
718 skip=1;
719 }
720 if (skip)
721 break;
722 }
723 if (! skip) {
724 unsigned long ft_step = im->gdes[i].step ;
726 if((rrd_fetch_fn(im->gdes[i].rrd,
727 im->gdes[i].cf,
728 &im->gdes[i].start,
729 &im->gdes[i].end,
730 &ft_step,
731 &im->gdes[i].ds_cnt,
732 &im->gdes[i].ds_namv,
733 &im->gdes[i].data)) == -1){
734 return -1;
735 }
736 im->gdes[i].data_first = 1;
737 im->gdes[i].step = im->step;
739 if (ft_step < im->gdes[i].step) {
740 reduce_data(im->gdes[i].cf_reduce,
741 ft_step,
742 &im->gdes[i].start,
743 &im->gdes[i].end,
744 &im->gdes[i].step,
745 &im->gdes[i].ds_cnt,
746 &im->gdes[i].data);
747 } else {
748 im->gdes[i].step = ft_step;
749 }
750 }
752 /* lets see if the required data source is really there */
753 for(ii=0;ii<(int)im->gdes[i].ds_cnt;ii++){
754 if(strcmp(im->gdes[i].ds_namv[ii],im->gdes[i].ds_nam) == 0){
755 im->gdes[i].ds=ii; }
756 }
757 if (im->gdes[i].ds== -1){
758 rrd_set_error("No DS called '%s' in '%s'",
759 im->gdes[i].ds_nam,im->gdes[i].rrd);
760 return -1;
761 }
763 }
764 return 0;
765 }
767 /* evaluate the expressions in the CDEF functions */
769 /*************************************************************
770 * CDEF stuff
771 *************************************************************/
773 long
774 find_var_wrapper(void *arg1, char *key)
775 {
776 return find_var((image_desc_t *) arg1, key);
777 }
779 /* find gdes containing var*/
780 long
781 find_var(image_desc_t *im, char *key){
782 long ii;
783 for(ii=0;ii<im->gdes_c-1;ii++){
784 if((im->gdes[ii].gf == GF_DEF
785 || im->gdes[ii].gf == GF_VDEF
786 || im->gdes[ii].gf == GF_CDEF)
787 && (strcmp(im->gdes[ii].vname,key) == 0)){
788 return ii;
789 }
790 }
791 return -1;
792 }
794 /* find the largest common denominator for all the numbers
795 in the 0 terminated num array */
796 long
797 lcd(long *num){
798 long rest;
799 int i;
800 for (i=0;num[i+1]!=0;i++){
801 do {
802 rest=num[i] % num[i+1];
803 num[i]=num[i+1]; num[i+1]=rest;
804 } while (rest!=0);
805 num[i+1] = num[i];
806 }
807 /* return i==0?num[i]:num[i-1]; */
808 return num[i];
809 }
811 /* run the rpn calculator on all the VDEF and CDEF arguments */
812 int
813 data_calc( image_desc_t *im){
815 int gdi;
816 int dataidx;
817 long *steparray, rpi;
818 int stepcnt;
819 time_t now;
820 rpnstack_t rpnstack;
822 rpnstack_init(&rpnstack);
824 for (gdi=0;gdi<im->gdes_c;gdi++){
825 /* Look for GF_VDEF and GF_CDEF in the same loop,
826 * so CDEFs can use VDEFs and vice versa
827 */
828 switch (im->gdes[gdi].gf) {
829 case GF_XPORT:
830 break;
831 case GF_SHIFT: {
832 graph_desc_t *vdp = &im->gdes[im->gdes[gdi].vidx];
834 /* remove current shift */
835 vdp->start -= vdp->shift;
836 vdp->end -= vdp->shift;
838 /* vdef */
839 if (im->gdes[gdi].shidx >= 0)
840 vdp->shift = im->gdes[im->gdes[gdi].shidx].vf.val;
841 /* constant */
842 else
843 vdp->shift = im->gdes[gdi].shval;
845 /* normalize shift to multiple of consolidated step */
846 vdp->shift = (vdp->shift / (long)vdp->step) * (long)vdp->step;
848 /* apply shift */
849 vdp->start += vdp->shift;
850 vdp->end += vdp->shift;
851 break;
852 }
853 case GF_VDEF:
854 /* A VDEF has no DS. This also signals other parts
855 * of rrdtool that this is a VDEF value, not a CDEF.
856 */
857 im->gdes[gdi].ds_cnt = 0;
858 if (vdef_calc(im,gdi)) {
859 rrd_set_error("Error processing VDEF '%s'"
860 ,im->gdes[gdi].vname
861 );
862 rpnstack_free(&rpnstack);
863 return -1;
864 }
865 break;
866 case GF_CDEF:
867 im->gdes[gdi].ds_cnt = 1;
868 im->gdes[gdi].ds = 0;
869 im->gdes[gdi].data_first = 1;
870 im->gdes[gdi].start = 0;
871 im->gdes[gdi].end = 0;
872 steparray=NULL;
873 stepcnt = 0;
874 dataidx=-1;
876 /* Find the variables in the expression.
877 * - VDEF variables are substituted by their values
878 * and the opcode is changed into OP_NUMBER.
879 * - CDEF variables are analized for their step size,
880 * the lowest common denominator of all the step
881 * sizes of the data sources involved is calculated
882 * and the resulting number is the step size for the
883 * resulting data source.
884 */
885 for(rpi=0;im->gdes[gdi].rpnp[rpi].op != OP_END;rpi++){
886 if(im->gdes[gdi].rpnp[rpi].op == OP_VARIABLE ||
887 im->gdes[gdi].rpnp[rpi].op == OP_PREV_OTHER){
888 long ptr = im->gdes[gdi].rpnp[rpi].ptr;
889 if (im->gdes[ptr].ds_cnt == 0) { /* this is a VDEF data source */
890 #if 0
891 printf("DEBUG: inside CDEF '%s' processing VDEF '%s'\n",
892 im->gdes[gdi].vname,
893 im->gdes[ptr].vname);
894 printf("DEBUG: value from vdef is %f\n",im->gdes[ptr].vf.val);
895 #endif
896 im->gdes[gdi].rpnp[rpi].val = im->gdes[ptr].vf.val;
897 im->gdes[gdi].rpnp[rpi].op = OP_NUMBER;
898 } else { /* normal variables and PREF(variables) */
900 /* add one entry to the array that keeps track of the step sizes of the
901 * data sources going into the CDEF. */
902 if ((steparray =
903 rrd_realloc(steparray,
904 (++stepcnt+1)*sizeof(*steparray)))==NULL){
905 rrd_set_error("realloc steparray");
906 rpnstack_free(&rpnstack);
907 return -1;
908 };
910 steparray[stepcnt-1] = im->gdes[ptr].step;
912 /* adjust start and end of cdef (gdi) so
913 * that it runs from the latest start point
914 * to the earliest endpoint of any of the
915 * rras involved (ptr)
916 */
918 if(im->gdes[gdi].start < im->gdes[ptr].start)
919 im->gdes[gdi].start = im->gdes[ptr].start;
921 if(im->gdes[gdi].end == 0 ||
922 im->gdes[gdi].end > im->gdes[ptr].end)
923 im->gdes[gdi].end = im->gdes[ptr].end;
925 /* store pointer to the first element of
926 * the rra providing data for variable,
927 * further save step size and data source
928 * count of this rra
929 */
930 im->gdes[gdi].rpnp[rpi].data = im->gdes[ptr].data + im->gdes[ptr].ds;
931 im->gdes[gdi].rpnp[rpi].step = im->gdes[ptr].step;
932 im->gdes[gdi].rpnp[rpi].ds_cnt = im->gdes[ptr].ds_cnt;
934 /* backoff the *.data ptr; this is done so
935 * rpncalc() function doesn't have to treat
936 * the first case differently
937 */
938 } /* if ds_cnt != 0 */
939 } /* if OP_VARIABLE */
940 } /* loop through all rpi */
942 /* move the data pointers to the correct period */
943 for(rpi=0;im->gdes[gdi].rpnp[rpi].op != OP_END;rpi++){
944 if(im->gdes[gdi].rpnp[rpi].op == OP_VARIABLE ||
945 im->gdes[gdi].rpnp[rpi].op == OP_PREV_OTHER){
946 long ptr = im->gdes[gdi].rpnp[rpi].ptr;
947 long diff = im->gdes[gdi].start - im->gdes[ptr].start;
949 if(diff > 0)
950 im->gdes[gdi].rpnp[rpi].data += (diff / im->gdes[ptr].step) * im->gdes[ptr].ds_cnt;
951 }
952 }
954 if(steparray == NULL){
955 rrd_set_error("rpn expressions without DEF"
956 " or CDEF variables are not supported");
957 rpnstack_free(&rpnstack);
958 return -1;
959 }
960 steparray[stepcnt]=0;
961 /* Now find the resulting step. All steps in all
962 * used RRAs have to be visited
963 */
964 im->gdes[gdi].step = lcd(steparray);
965 free(steparray);
966 if((im->gdes[gdi].data = malloc((
967 (im->gdes[gdi].end-im->gdes[gdi].start)
968 / im->gdes[gdi].step)
969 * sizeof(double)))==NULL){
970 rrd_set_error("malloc im->gdes[gdi].data");
971 rpnstack_free(&rpnstack);
972 return -1;
973 }
975 /* Step through the new cdef results array and
976 * calculate the values
977 */
978 for (now = im->gdes[gdi].start + im->gdes[gdi].step;
979 now<=im->gdes[gdi].end;
980 now += im->gdes[gdi].step)
981 {
982 rpnp_t *rpnp = im -> gdes[gdi].rpnp;
984 /* 3rd arg of rpn_calc is for OP_VARIABLE lookups;
985 * in this case we are advancing by timesteps;
986 * we use the fact that time_t is a synonym for long
987 */
988 if (rpn_calc(rpnp,&rpnstack,(long) now,
989 im->gdes[gdi].data,++dataidx) == -1) {
990 /* rpn_calc sets the error string */
991 rpnstack_free(&rpnstack);
992 return -1;
993 }
994 } /* enumerate over time steps within a CDEF */
995 break;
996 default:
997 continue;
998 }
999 } /* enumerate over CDEFs */
1000 rpnstack_free(&rpnstack);
1001 return 0;
1002 }
1004 /* massage data so, that we get one value for each x coordinate in the graph */
1005 int
1006 data_proc( image_desc_t *im ){
1007 long i,ii;
1008 double pixstep = (double)(im->end-im->start)
1009 /(double)im->xsize; /* how much time
1010 passes in one pixel */
1011 double paintval;
1012 double minval=DNAN,maxval=DNAN;
1014 unsigned long gr_time;
1016 /* memory for the processed data */
1017 for(i=0;i<im->gdes_c;i++) {
1018 if((im->gdes[i].gf==GF_LINE) ||
1019 (im->gdes[i].gf==GF_AREA) ||
1020 (im->gdes[i].gf==GF_TICK) ||
1021 (im->gdes[i].gf==GF_STACK)) {
1022 if((im->gdes[i].p_data = malloc((im->xsize +1)
1023 * sizeof(rrd_value_t)))==NULL){
1024 rrd_set_error("malloc data_proc");
1025 return -1;
1026 }
1027 }
1028 }
1030 for (i=0;i<im->xsize;i++) { /* for each pixel */
1031 long vidx;
1032 gr_time = im->start+pixstep*i; /* time of the current step */
1033 paintval=0.0;
1035 for (ii=0;ii<im->gdes_c;ii++) {
1036 double value;
1037 switch (im->gdes[ii].gf) {
1038 case GF_LINE:
1039 case GF_AREA:
1040 case GF_TICK:
1041 if (!im->gdes[ii].stack)
1042 paintval = 0.0;
1043 case GF_STACK:
1044 value = im->gdes[ii].yrule;
1045 if (isnan(value) || (im->gdes[ii].gf == GF_TICK)) {
1046 /* The time of the data doesn't necessarily match
1047 ** the time of the graph. Beware.
1048 */
1049 vidx = im->gdes[ii].vidx;
1050 if (im->gdes[vidx].gf == GF_VDEF) {
1051 value = im->gdes[vidx].vf.val;
1052 } else if (((long int)gr_time >= (long int)im->gdes[vidx].start) &&
1053 ((long int)gr_time <= (long int)im->gdes[vidx].end) ) {
1054 value = im->gdes[vidx].data[
1055 (unsigned long) floor(
1056 (double)(gr_time - im->gdes[vidx].start)
1057 / im->gdes[vidx].step)
1058 * im->gdes[vidx].ds_cnt
1059 + im->gdes[vidx].ds
1060 ];
1061 } else {
1062 value = DNAN;
1063 }
1064 };
1066 if (! isnan(value)) {
1067 paintval += value;
1068 im->gdes[ii].p_data[i] = paintval;
1069 /* GF_TICK: the data values are not
1070 ** relevant for min and max
1071 */
1072 if (finite(paintval) && im->gdes[ii].gf != GF_TICK ) {
1073 if (isnan(minval) || paintval < minval)
1074 minval = paintval;
1075 if (isnan(maxval) || paintval > maxval)
1076 maxval = paintval;
1077 }
1078 } else {
1079 im->gdes[ii].p_data[i] = DNAN;
1080 }
1081 break;
1082 default:
1083 break;
1084 }
1085 }
1086 }
1088 /* if min or max have not been asigned a value this is because
1089 there was no data in the graph ... this is not good ...
1090 lets set these to dummy values then ... */
1092 if (isnan(minval)) minval = 0.0;
1093 if (isnan(maxval)) maxval = 1.0;
1095 /* adjust min and max values */
1096 if (isnan(im->minval)
1097 /* don't adjust low-end with log scale */
1098 || ((!im->logarithmic && !im->rigid) && im->minval > minval)
1099 )
1100 im->minval = minval;
1101 if (isnan(im->maxval)
1102 || (!im->rigid && im->maxval < maxval)
1103 ) {
1104 if (im->logarithmic)
1105 im->maxval = maxval * 1.1;
1106 else
1107 im->maxval = maxval;
1108 }
1109 /* make sure min is smaller than max */
1110 if (im->minval > im->maxval) {
1111 im->minval = 0.99 * im->maxval;
1112 }
1114 /* make sure min and max are not equal */
1115 if (im->minval == im->maxval) {
1116 im->maxval *= 1.01;
1117 if (! im->logarithmic) {
1118 im->minval *= 0.99;
1119 }
1120 /* make sure min and max are not both zero */
1121 if (im->maxval == 0.0) {
1122 im->maxval = 1.0;
1123 }
1124 }
1125 return 0;
1126 }
1130 /* identify the point where the first gridline, label ... gets placed */
1132 time_t
1133 find_first_time(
1134 time_t start, /* what is the initial time */
1135 enum tmt_en baseint, /* what is the basic interval */
1136 long basestep /* how many if these do we jump a time */
1137 )
1138 {
1139 struct tm tm;
1140 localtime_r(&start, &tm);
1141 switch(baseint){
1142 case TMT_SECOND:
1143 tm.tm_sec -= tm.tm_sec % basestep; break;
1144 case TMT_MINUTE:
1145 tm.tm_sec=0;
1146 tm.tm_min -= tm.tm_min % basestep;
1147 break;
1148 case TMT_HOUR:
1149 tm.tm_sec=0;
1150 tm.tm_min = 0;
1151 tm.tm_hour -= tm.tm_hour % basestep; break;
1152 case TMT_DAY:
1153 /* we do NOT look at the basestep for this ... */
1154 tm.tm_sec=0;
1155 tm.tm_min = 0;
1156 tm.tm_hour = 0; break;
1157 case TMT_WEEK:
1158 /* we do NOT look at the basestep for this ... */
1159 tm.tm_sec=0;
1160 tm.tm_min = 0;
1161 tm.tm_hour = 0;
1162 tm.tm_mday -= tm.tm_wday -1; /* -1 because we want the monday */
1163 if (tm.tm_wday==0) tm.tm_mday -= 7; /* we want the *previous* monday */
1164 break;
1165 case TMT_MONTH:
1166 tm.tm_sec=0;
1167 tm.tm_min = 0;
1168 tm.tm_hour = 0;
1169 tm.tm_mday = 1;
1170 tm.tm_mon -= tm.tm_mon % basestep; break;
1172 case TMT_YEAR:
1173 tm.tm_sec=0;
1174 tm.tm_min = 0;
1175 tm.tm_hour = 0;
1176 tm.tm_mday = 1;
1177 tm.tm_mon = 0;
1178 tm.tm_year -= (tm.tm_year+1900) % basestep;
1180 }
1181 return mktime(&tm);
1182 }
1183 /* identify the point where the next gridline, label ... gets placed */
1184 time_t
1185 find_next_time(
1186 time_t current, /* what is the initial time */
1187 enum tmt_en baseint, /* what is the basic interval */
1188 long basestep /* how many if these do we jump a time */
1189 )
1190 {
1191 struct tm tm;
1192 time_t madetime;
1193 localtime_r(¤t, &tm);
1194 do {
1195 switch(baseint){
1196 case TMT_SECOND:
1197 tm.tm_sec += basestep; break;
1198 case TMT_MINUTE:
1199 tm.tm_min += basestep; break;
1200 case TMT_HOUR:
1201 tm.tm_hour += basestep; break;
1202 case TMT_DAY:
1203 tm.tm_mday += basestep; break;
1204 case TMT_WEEK:
1205 tm.tm_mday += 7*basestep; break;
1206 case TMT_MONTH:
1207 tm.tm_mon += basestep; break;
1208 case TMT_YEAR:
1209 tm.tm_year += basestep;
1210 }
1211 madetime = mktime(&tm);
1212 } while (madetime == -1); /* this is necessary to skip impssible times
1213 like the daylight saving time skips */
1214 return madetime;
1216 }
1219 /* calculate values required for PRINT and GPRINT functions */
1221 int
1222 print_calc(image_desc_t *im, char ***prdata)
1223 {
1224 long i,ii,validsteps;
1225 double printval;
1226 time_t printtime;
1227 int graphelement = 0;
1228 long vidx;
1229 int max_ii;
1230 double magfact = -1;
1231 char *si_symb = "";
1232 char *percent_s;
1233 int prlines = 1;
1234 if (im->imginfo) prlines++;
1235 for(i=0;i<im->gdes_c;i++){
1236 switch(im->gdes[i].gf){
1237 case GF_PRINT:
1238 prlines++;
1239 if(((*prdata) = rrd_realloc((*prdata),prlines*sizeof(char *)))==NULL){
1240 rrd_set_error("realloc prdata");
1241 return 0;
1242 }
1243 case GF_GPRINT:
1244 /* PRINT and GPRINT can now print VDEF generated values.
1245 * There's no need to do any calculations on them as these
1246 * calculations were already made.
1247 */
1248 vidx = im->gdes[i].vidx;
1249 if (im->gdes[vidx].gf==GF_VDEF) { /* simply use vals */
1250 printval = im->gdes[vidx].vf.val;
1251 printtime = im->gdes[vidx].vf.when;
1252 } else { /* need to calculate max,min,avg etcetera */
1253 max_ii =((im->gdes[vidx].end
1254 - im->gdes[vidx].start)
1255 / im->gdes[vidx].step
1256 * im->gdes[vidx].ds_cnt);
1257 printval = DNAN;
1258 validsteps = 0;
1259 for( ii=im->gdes[vidx].ds;
1260 ii < max_ii;
1261 ii+=im->gdes[vidx].ds_cnt){
1262 if (! finite(im->gdes[vidx].data[ii]))
1263 continue;
1264 if (isnan(printval)){
1265 printval = im->gdes[vidx].data[ii];
1266 validsteps++;
1267 continue;
1268 }
1270 switch (im->gdes[i].cf){
1271 case CF_HWPREDICT:
1272 case CF_DEVPREDICT:
1273 case CF_DEVSEASONAL:
1274 case CF_SEASONAL:
1275 case CF_AVERAGE:
1276 validsteps++;
1277 printval += im->gdes[vidx].data[ii];
1278 break;
1279 case CF_MINIMUM:
1280 printval = min( printval, im->gdes[vidx].data[ii]);
1281 break;
1282 case CF_FAILURES:
1283 case CF_MAXIMUM:
1284 printval = max( printval, im->gdes[vidx].data[ii]);
1285 break;
1286 case CF_LAST:
1287 printval = im->gdes[vidx].data[ii];
1288 }
1289 }
1290 if (im->gdes[i].cf==CF_AVERAGE || im->gdes[i].cf > CF_LAST) {
1291 if (validsteps > 1) {
1292 printval = (printval / validsteps);
1293 }
1294 }
1295 } /* prepare printval */
1297 if (!strcmp(im->gdes[i].format,"%c")) { /* VDEF time print */
1298 char ctime_buf[128]; /* PS: for ctime_r, must be >= 26 chars */
1299 int iii=0;
1300 ctime_r(&printtime,ctime_buf);
1301 while(isprint(ctime_buf[iii])){iii++;}
1302 ctime_buf[iii]='\0';
1303 if (im->gdes[i].gf == GF_PRINT){
1304 (*prdata)[prlines-2] = malloc((FMT_LEG_LEN+2)*sizeof(char));
1305 sprintf((*prdata)[prlines-2],"%s (%lu)",ctime_buf,printtime);
1306 (*prdata)[prlines-1] = NULL;
1307 } else {
1308 sprintf(im->gdes[i].legend,"%s (%lu)",ctime_buf,printtime);
1309 graphelement = 1;
1310 }
1311 } else {
1312 if ((percent_s = strstr(im->gdes[i].format,"%S")) != NULL) {
1313 /* Magfact is set to -1 upon entry to print_calc. If it
1314 * is still less than 0, then we need to run auto_scale.
1315 * Otherwise, put the value into the correct units. If
1316 * the value is 0, then do not set the symbol or magnification
1317 * so next the calculation will be performed again. */
1318 if (magfact < 0.0) {
1319 auto_scale(im,&printval,&si_symb,&magfact);
1320 if (printval == 0.0)
1321 magfact = -1.0;
1322 } else {
1323 printval /= magfact;
1324 }
1325 *(++percent_s) = 's';
1326 } else if (strstr(im->gdes[i].format,"%s") != NULL) {
1327 auto_scale(im,&printval,&si_symb,&magfact);
1328 }
1330 if (im->gdes[i].gf == GF_PRINT){
1331 (*prdata)[prlines-2] = malloc((FMT_LEG_LEN+2)*sizeof(char));
1332 (*prdata)[prlines-1] = NULL;
1333 if (bad_format(im->gdes[i].format)) {
1334 rrd_set_error("bad format for PRINT in '%s'", im->gdes[i].format);
1335 return -1;
1336 }
1337 #ifdef HAVE_SNPRINTF
1338 snprintf((*prdata)[prlines-2],FMT_LEG_LEN,im->gdes[i].format,printval,si_symb);
1339 #else
1340 sprintf((*prdata)[prlines-2],im->gdes[i].format,printval,si_symb);
1341 #endif
1342 } else {
1343 /* GF_GPRINT */
1345 if (bad_format(im->gdes[i].format)) {
1346 rrd_set_error("bad format for GPRINT in '%s'", im->gdes[i].format);
1347 return -1;
1348 }
1349 #ifdef HAVE_SNPRINTF
1350 snprintf(im->gdes[i].legend,FMT_LEG_LEN-2,im->gdes[i].format,printval,si_symb);
1351 #else
1352 sprintf(im->gdes[i].legend,im->gdes[i].format,printval,si_symb);
1353 #endif
1354 graphelement = 1;
1355 }
1356 }
1357 break;
1358 case GF_LINE:
1359 case GF_AREA:
1360 case GF_TICK:
1361 case GF_STACK:
1362 case GF_HRULE:
1363 case GF_VRULE:
1364 graphelement = 1;
1365 break;
1366 case GF_COMMENT:
1367 case GF_DEF:
1368 case GF_CDEF:
1369 case GF_VDEF:
1370 #ifdef WITH_PIECHART
1371 case GF_PART:
1372 #endif
1373 case GF_SHIFT:
1374 case GF_XPORT:
1375 break;
1376 }
1377 }
1378 return graphelement;
1379 }
1382 /* place legends with color spots */
1383 int
1384 leg_place(image_desc_t *im)
1385 {
1386 /* graph labels */
1387 int interleg = im->text_prop[TEXT_PROP_LEGEND].size*2.0;
1388 int border = im->text_prop[TEXT_PROP_LEGEND].size*2.0;
1389 int fill=0, fill_last;
1390 int leg_c = 0;
1391 int leg_x = border, leg_y = im->yimg;
1392 int leg_cc;
1393 int glue = 0;
1394 int i,ii, mark = 0;
1395 char prt_fctn; /*special printfunctions */
1396 int *legspace;
1398 if( !(im->extra_flags & NOLEGEND) & !(im->extra_flags & ONLY_GRAPH) ) {
1399 if ((legspace = malloc(im->gdes_c*sizeof(int)))==NULL){
1400 rrd_set_error("malloc for legspace");
1401 return -1;
1402 }
1404 for(i=0;i<im->gdes_c;i++){
1405 fill_last = fill;
1407 /* hid legends for rules which are not displayed */
1409 if(!(im->extra_flags & FORCE_RULES_LEGEND)) {
1410 if (im->gdes[i].gf == GF_HRULE &&
1411 (im->gdes[i].yrule < im->minval || im->gdes[i].yrule > im->maxval))
1412 im->gdes[i].legend[0] = '\0';
1414 if (im->gdes[i].gf == GF_VRULE &&
1415 (im->gdes[i].xrule < im->start || im->gdes[i].xrule > im->end))
1416 im->gdes[i].legend[0] = '\0';
1417 }
1419 leg_cc = strlen(im->gdes[i].legend);
1421 /* is there a controle code ant the end of the legend string ? */
1422 /* and it is not a tab \\t */
1423 if (leg_cc >= 2 && im->gdes[i].legend[leg_cc-2] == '\\' && im->gdes[i].legend[leg_cc-1] != 't') {
1424 prt_fctn = im->gdes[i].legend[leg_cc-1];
1425 leg_cc -= 2;
1426 im->gdes[i].legend[leg_cc] = '\0';
1427 } else {
1428 prt_fctn = '\0';
1429 }
1430 /* remove exess space */
1431 while (prt_fctn=='g' &&
1432 leg_cc > 0 &&
1433 im->gdes[i].legend[leg_cc-1]==' '){
1434 leg_cc--;
1435 im->gdes[i].legend[leg_cc]='\0';
1436 }
1437 if (leg_cc != 0 ){
1438 legspace[i]=(prt_fctn=='g' ? 0 : interleg);
1440 if (fill > 0){
1441 /* no interleg space if string ends in \g */
1442 fill += legspace[i];
1443 }
1444 fill += gfx_get_text_width(im->canvas, fill+border,
1445 im->text_prop[TEXT_PROP_LEGEND].font,
1446 im->text_prop[TEXT_PROP_LEGEND].size,
1447 im->tabwidth,
1448 im->gdes[i].legend, 0);
1449 leg_c++;
1450 } else {
1451 legspace[i]=0;
1452 }
1453 /* who said there was a special tag ... ?*/
1454 if (prt_fctn=='g') {
1455 prt_fctn = '\0';
1456 }
1457 if (prt_fctn == '\0') {
1458 if (i == im->gdes_c -1 ) prt_fctn ='l';
1460 /* is it time to place the legends ? */
1461 if (fill > im->ximg - 2*border){
1462 if (leg_c > 1) {
1463 /* go back one */
1464 i--;
1465 fill = fill_last;
1466 leg_c--;
1467 prt_fctn = 'j';
1468 } else {
1469 prt_fctn = 'l';
1470 }
1472 }
1473 }
1476 if (prt_fctn != '\0'){
1477 leg_x = border;
1478 if (leg_c >= 2 && prt_fctn == 'j') {
1479 glue = (im->ximg - fill - 2* border) / (leg_c-1);
1480 } else {
1481 glue = 0;
1482 }
1483 if (prt_fctn =='c') leg_x = (im->ximg - fill) / 2.0;
1484 if (prt_fctn =='r') leg_x = im->ximg - fill - border;
1486 for(ii=mark;ii<=i;ii++){
1487 if(im->gdes[ii].legend[0]=='\0')
1488 continue; /* skip empty legends */
1489 im->gdes[ii].leg_x = leg_x;
1490 im->gdes[ii].leg_y = leg_y;
1491 leg_x +=
1492 gfx_get_text_width(im->canvas, leg_x,
1493 im->text_prop[TEXT_PROP_LEGEND].font,
1494 im->text_prop[TEXT_PROP_LEGEND].size,
1495 im->tabwidth,
1496 im->gdes[ii].legend, 0)
1497 + legspace[ii]
1498 + glue;
1499 }
1500 leg_y += im->text_prop[TEXT_PROP_LEGEND].size*1.8;
1501 if (prt_fctn == 's') leg_y -= im->text_prop[TEXT_PROP_LEGEND].size;
1502 fill = 0;
1503 leg_c = 0;
1504 mark = ii;
1505 }
1506 }
1507 im->yimg = leg_y;
1508 free(legspace);
1509 }
1510 return 0;
1511 }
1513 /* create a grid on the graph. it determines what to do
1514 from the values of xsize, start and end */
1516 /* the xaxis labels are determined from the number of seconds per pixel
1517 in the requested graph */
1521 int
1522 calc_horizontal_grid(image_desc_t *im)
1523 {
1524 double range;
1525 double scaledrange;
1526 int pixel,i;
1527 int gridind;
1528 int decimals, fractionals;
1530 im->ygrid_scale.labfact=2;
1531 gridind=-1;
1532 range = im->maxval - im->minval;
1533 scaledrange = range / im->magfact;
1535 /* does the scale of this graph make it impossible to put lines
1536 on it? If so, give up. */
1537 if (isnan(scaledrange)) {
1538 return 0;
1539 }
1541 /* find grid spaceing */
1542 pixel=1;
1543 if(isnan(im->ygridstep)){
1544 if(im->extra_flags & ALTYGRID) {
1545 /* find the value with max number of digits. Get number of digits */
1546 decimals = ceil(log10(max(fabs(im->maxval), fabs(im->minval))*im->viewfactor/im->magfact));
1547 if(decimals <= 0) /* everything is small. make place for zero */
1548 decimals = 1;
1550 im->ygrid_scale.gridstep = pow((double)10, floor(log10(range*im->viewfactor/im->magfact)))/im->viewfactor*im->magfact;
1552 if(im->ygrid_scale.gridstep == 0) /* range is one -> 0.1 is reasonable scale */
1553 im->ygrid_scale.gridstep = 0.1;
1554 /* should have at least 5 lines but no more then 15 */
1555 if(range/im->ygrid_scale.gridstep < 5)
1556 im->ygrid_scale.gridstep /= 10;
1557 if(range/im->ygrid_scale.gridstep > 15)
1558 im->ygrid_scale.gridstep *= 10;
1559 if(range/im->ygrid_scale.gridstep > 5) {
1560 im->ygrid_scale.labfact = 1;
1561 if(range/im->ygrid_scale.gridstep > 8)
1562 im->ygrid_scale.labfact = 2;
1563 }
1564 else {
1565 im->ygrid_scale.gridstep /= 5;
1566 im->ygrid_scale.labfact = 5;
1567 }
1568 fractionals = floor(log10(im->ygrid_scale.gridstep*(double)im->ygrid_scale.labfact*im->viewfactor/im->magfact));
1569 if(fractionals < 0) { /* small amplitude. */
1570 int len = decimals - fractionals + 1;
1571 if (im->unitslength < len+2) im->unitslength = len+2;
1572 sprintf(im->ygrid_scale.labfmt, "%%%d.%df%s", len, -fractionals,(im->symbol != ' ' ? " %c" : ""));
1573 } else {
1574 int len = decimals + 1;
1575 if (im->unitslength < len+2) im->unitslength = len+2;
1576 sprintf(im->ygrid_scale.labfmt, "%%%d.0f%s", len, ( im->symbol != ' ' ? " %c" : "" ));
1577 }
1578 }
1579 else {
1580 for(i=0;ylab[i].grid > 0;i++){
1581 pixel = im->ysize / (scaledrange / ylab[i].grid);
1582 if (pixel > 7) {
1583 gridind = i;
1584 break;
1585 }
1586 }
1588 for(i=0; i<4;i++) {
1589 if (pixel * ylab[gridind].lfac[i] >= 2.5 * im->text_prop[TEXT_PROP_AXIS].size) {
1590 im->ygrid_scale.labfact = ylab[gridind].lfac[i];
1591 break;
1592 }
1593 }
1595 im->ygrid_scale.gridstep = ylab[gridind].grid * im->magfact;
1596 }
1597 } else {
1598 im->ygrid_scale.gridstep = im->ygridstep;
1599 im->ygrid_scale.labfact = im->ylabfact;
1600 }
1601 return 1;
1602 }
1604 int draw_horizontal_grid(image_desc_t *im)
1605 {
1606 int i;
1607 double scaledstep;
1608 char graph_label[100];
1609 double X0=im->xorigin;
1610 double X1=im->xorigin+im->xsize;
1612 int sgrid = (int)( im->minval / im->ygrid_scale.gridstep - 1);
1613 int egrid = (int)( im->maxval / im->ygrid_scale.gridstep + 1);
1614 double MaxY;
1615 scaledstep = im->ygrid_scale.gridstep/(double)im->magfact*(double)im->viewfactor;
1616 MaxY = scaledstep*(double)egrid;
1617 for (i = sgrid; i <= egrid; i++){
1618 double Y0=ytr(im,im->ygrid_scale.gridstep*i);
1619 if ( Y0 >= im->yorigin-im->ysize
1620 && Y0 <= im->yorigin){
1621 if(i % im->ygrid_scale.labfact == 0){
1622 if (im->symbol == ' ') {
1623 if(im->extra_flags & ALTYGRID) {
1624 sprintf(graph_label,im->ygrid_scale.labfmt,scaledstep*(double)i);
1625 } else {
1626 if(MaxY < 10) {
1627 sprintf(graph_label,"%4.1f",scaledstep*(double)i);
1628 } else {
1629 sprintf(graph_label,"%4.0f",scaledstep*(double)i);
1630 }
1631 }
1632 }else {
1633 char sisym = ( i == 0 ? ' ' : im->symbol);
1634 if(im->extra_flags & ALTYGRID) {
1635 sprintf(graph_label,im->ygrid_scale.labfmt,scaledstep*(double)i,sisym);
1636 } else {
1637 if(MaxY < 10){
1638 sprintf(graph_label,"%4.1f %c",scaledstep*(double)i, sisym);
1639 } else {
1640 sprintf(graph_label,"%4.0f %c",scaledstep*(double)i, sisym);
1641 }
1642 }
1643 }
1645 gfx_new_text ( im->canvas,
1646 X0-im->text_prop[TEXT_PROP_AXIS].size, Y0,
1647 im->graph_col[GRC_FONT],
1648 im->text_prop[TEXT_PROP_AXIS].font,
1649 im->text_prop[TEXT_PROP_AXIS].size,
1650 im->tabwidth, 0.0, GFX_H_RIGHT, GFX_V_CENTER,
1651 graph_label );
1652 gfx_new_dashed_line ( im->canvas,
1653 X0-2,Y0,
1654 X1+2,Y0,
1655 MGRIDWIDTH, im->graph_col[GRC_MGRID],
1656 im->grid_dash_on, im->grid_dash_off);
1658 } else if (!(im->extra_flags & NOMINOR)) {
1659 gfx_new_dashed_line ( im->canvas,
1660 X0-1,Y0,
1661 X1+1,Y0,
1662 GRIDWIDTH, im->graph_col[GRC_GRID],
1663 im->grid_dash_on, im->grid_dash_off);
1665 }
1666 }
1667 }
1668 return 1;
1669 }
1671 /* logaritmic horizontal grid */
1672 int
1673 horizontal_log_grid(image_desc_t *im)
1674 {
1675 double pixpex;
1676 int ii,i;
1677 int minoridx=0, majoridx=0;
1678 char graph_label[100];
1679 double X0,X1,Y0;
1680 double value, pixperstep, minstep;
1682 /* find grid spaceing */
1683 pixpex= (double)im->ysize / (log10(im->maxval) - log10(im->minval));
1685 if (isnan(pixpex)) {
1686 return 0;
1687 }
1689 for(i=0;yloglab[i][0] > 0;i++){
1690 minstep = log10(yloglab[i][0]);
1691 for(ii=1;yloglab[i][ii+1] > 0;ii++){
1692 if(yloglab[i][ii+2]==0){
1693 minstep = log10(yloglab[i][ii+1])-log10(yloglab[i][ii]);
1694 break;
1695 }
1696 }
1697 pixperstep = pixpex * minstep;
1698 if(pixperstep > 5){minoridx = i;}
1699 if(pixperstep > 2 * im->text_prop[TEXT_PROP_LEGEND].size){majoridx = i;}
1700 }
1702 X0=im->xorigin;
1703 X1=im->xorigin+im->xsize;
1704 /* paint minor grid */
1705 for (value = pow((double)10, log10(im->minval)
1706 - fmod(log10(im->minval),log10(yloglab[minoridx][0])));
1707 value <= im->maxval;
1708 value *= yloglab[minoridx][0]){
1709 if (value < im->minval) continue;
1710 i=0;
1711 while(yloglab[minoridx][++i] > 0){
1712 Y0 = ytr(im,value * yloglab[minoridx][i]);
1713 if (Y0 <= im->yorigin - im->ysize) break;
1714 gfx_new_dashed_line ( im->canvas,
1715 X0-1,Y0,
1716 X1+1,Y0,
1717 GRIDWIDTH, im->graph_col[GRC_GRID],
1718 im->grid_dash_on, im->grid_dash_off);
1719 }
1720 }
1722 /* paint major grid and labels*/
1723 for (value = pow((double)10, log10(im->minval)
1724 - fmod(log10(im->minval),log10(yloglab[majoridx][0])));
1725 value <= im->maxval;
1726 value *= yloglab[majoridx][0]){
1727 if (value < im->minval) continue;
1728 i=0;
1729 while(yloglab[majoridx][++i] > 0){
1730 Y0 = ytr(im,value * yloglab[majoridx][i]);
1731 if (Y0 <= im->yorigin - im->ysize) break;
1732 gfx_new_dashed_line ( im->canvas,
1733 X0-2,Y0,
1734 X1+2,Y0,
1735 MGRIDWIDTH, im->graph_col[GRC_MGRID],
1736 im->grid_dash_on, im->grid_dash_off);
1738 sprintf(graph_label,"%3.0e",value * yloglab[majoridx][i]);
1739 gfx_new_text ( im->canvas,
1740 X0-im->text_prop[TEXT_PROP_AXIS].size, Y0,
1741 im->graph_col[GRC_FONT],
1742 im->text_prop[TEXT_PROP_AXIS].font,
1743 im->text_prop[TEXT_PROP_AXIS].size,
1744 im->tabwidth,0.0, GFX_H_RIGHT, GFX_V_CENTER,
1745 graph_label );
1746 }
1747 }
1748 return 1;
1749 }
1752 void
1753 vertical_grid(
1754 image_desc_t *im )
1755 {
1756 int xlab_sel; /* which sort of label and grid ? */
1757 time_t ti, tilab, timajor;
1758 long factor;
1759 char graph_label[100];
1760 double X0,Y0,Y1; /* points for filled graph and more*/
1761 struct tm tm;
1763 /* the type of time grid is determined by finding
1764 the number of seconds per pixel in the graph */
1767 if(im->xlab_user.minsec == -1){
1768 factor=(im->end - im->start)/im->xsize;
1769 xlab_sel=0;
1770 while ( xlab[xlab_sel+1].minsec != -1
1771 && xlab[xlab_sel+1].minsec <= factor){ xlab_sel++; }
1772 im->xlab_user.gridtm = xlab[xlab_sel].gridtm;
1773 im->xlab_user.gridst = xlab[xlab_sel].gridst;
1774 im->xlab_user.mgridtm = xlab[xlab_sel].mgridtm;
1775 im->xlab_user.mgridst = xlab[xlab_sel].mgridst;
1776 im->xlab_user.labtm = xlab[xlab_sel].labtm;
1777 im->xlab_user.labst = xlab[xlab_sel].labst;
1778 im->xlab_user.precis = xlab[xlab_sel].precis;
1779 im->xlab_user.stst = xlab[xlab_sel].stst;
1780 }
1782 /* y coords are the same for every line ... */
1783 Y0 = im->yorigin;
1784 Y1 = im->yorigin-im->ysize;
1787 /* paint the minor grid */
1788 if (!(im->extra_flags & NOMINOR))
1789 {
1790 for(ti = find_first_time(im->start,
1791 im->xlab_user.gridtm,
1792 im->xlab_user.gridst),
1793 timajor = find_first_time(im->start,
1794 im->xlab_user.mgridtm,
1795 im->xlab_user.mgridst);
1796 ti < im->end;
1797 ti = find_next_time(ti,im->xlab_user.gridtm,im->xlab_user.gridst)
1798 ){
1799 /* are we inside the graph ? */
1800 if (ti < im->start || ti > im->end) continue;
1801 while (timajor < ti) {
1802 timajor = find_next_time(timajor,
1803 im->xlab_user.mgridtm, im->xlab_user.mgridst);
1804 }
1805 if (ti == timajor) continue; /* skip as falls on major grid line */
1806 X0 = xtr(im,ti);
1807 gfx_new_dashed_line(im->canvas,X0,Y0+1, X0,Y1-1,GRIDWIDTH,
1808 im->graph_col[GRC_GRID],
1809 im->grid_dash_on, im->grid_dash_off);
1811 }
1812 }
1814 /* paint the major grid */
1815 for(ti = find_first_time(im->start,
1816 im->xlab_user.mgridtm,
1817 im->xlab_user.mgridst);
1818 ti < im->end;
1819 ti = find_next_time(ti,im->xlab_user.mgridtm,im->xlab_user.mgridst)
1820 ){
1821 /* are we inside the graph ? */
1822 if (ti < im->start || ti > im->end) continue;
1823 X0 = xtr(im,ti);
1824 gfx_new_dashed_line(im->canvas,X0,Y0+3, X0,Y1-2,MGRIDWIDTH,
1825 im->graph_col[GRC_MGRID],
1826 im->grid_dash_on, im->grid_dash_off);
1828 }
1829 /* paint the labels below the graph */
1830 for(ti = find_first_time(im->start - im->xlab_user.precis/2,
1831 im->xlab_user.labtm,
1832 im->xlab_user.labst);
1833 ti <= im->end - im->xlab_user.precis/2;
1834 ti = find_next_time(ti,im->xlab_user.labtm,im->xlab_user.labst)
1835 ){
1836 tilab= ti + im->xlab_user.precis/2; /* correct time for the label */
1837 /* are we inside the graph ? */
1838 if (tilab < im->start || tilab > im->end) continue;
1840 #if HAVE_STRFTIME
1841 localtime_r(&tilab, &tm);
1842 strftime(graph_label,99,im->xlab_user.stst, &tm);
1843 #else
1844 # error "your libc has no strftime I guess we'll abort the exercise here."
1845 #endif
1846 gfx_new_text ( im->canvas,
1847 xtr(im,tilab), Y0+im->text_prop[TEXT_PROP_AXIS].size*1.4+5,
1848 im->graph_col[GRC_FONT],
1849 im->text_prop[TEXT_PROP_AXIS].font,
1850 im->text_prop[TEXT_PROP_AXIS].size,
1851 im->tabwidth, 0.0, GFX_H_CENTER, GFX_V_BOTTOM,
1852 graph_label );
1854 }
1856 }
1859 void
1860 axis_paint(
1861 image_desc_t *im
1862 )
1863 {
1864 /* draw x and y axis */
1865 /* gfx_new_line ( im->canvas, im->xorigin+im->xsize,im->yorigin,
1866 im->xorigin+im->xsize,im->yorigin-im->ysize,
1867 GRIDWIDTH, im->graph_col[GRC_AXIS]);
1869 gfx_new_line ( im->canvas, im->xorigin,im->yorigin-im->ysize,
1870 im->xorigin+im->xsize,im->yorigin-im->ysize,
1871 GRIDWIDTH, im->graph_col[GRC_AXIS]); */
1873 gfx_new_line ( im->canvas, im->xorigin-4,im->yorigin,
1874 im->xorigin+im->xsize+4,im->yorigin,
1875 MGRIDWIDTH, im->graph_col[GRC_AXIS]);
1877 gfx_new_line ( im->canvas, im->xorigin,im->yorigin+4,
1878 im->xorigin,im->yorigin-im->ysize-4,
1879 MGRIDWIDTH, im->graph_col[GRC_AXIS]);
1882 /* arrow for X and Y axis direction */
1883 gfx_new_area ( im->canvas,
1884 im->xorigin+im->xsize+2, im->yorigin-2,
1885 im->xorigin+im->xsize+2, im->yorigin+3,
1886 im->xorigin+im->xsize+7, im->yorigin+0.5, /* LINEOFFSET */
1887 im->graph_col[GRC_ARROW]);
1889 gfx_new_area ( im->canvas,
1890 im->xorigin-2, im->yorigin-im->ysize-2,
1891 im->xorigin+3, im->yorigin-im->ysize-2,
1892 im->xorigin+0.5, im->yorigin-im->ysize-7, /* LINEOFFSET */
1893 im->graph_col[GRC_ARROW]);
1895 }
1897 void
1898 grid_paint(image_desc_t *im)
1899 {
1900 long i;
1901 int res=0;
1902 double X0,Y0; /* points for filled graph and more*/
1903 gfx_node_t *node;
1905 /* draw 3d border */
1906 node = gfx_new_area (im->canvas, 0,im->yimg,
1907 2,im->yimg-2,
1908 2,2,im->graph_col[GRC_SHADEA]);
1909 gfx_add_point( node , im->ximg - 2, 2 );
1910 gfx_add_point( node , im->ximg, 0 );
1911 gfx_add_point( node , 0,0 );
1912 /* gfx_add_point( node , 0,im->yimg ); */
1914 node = gfx_new_area (im->canvas, 2,im->yimg-2,
1915 im->ximg-2,im->yimg-2,
1916 im->ximg - 2, 2,
1917 im->graph_col[GRC_SHADEB]);
1918 gfx_add_point( node , im->ximg,0);
1919 gfx_add_point( node , im->ximg,im->yimg);
1920 gfx_add_point( node , 0,im->yimg);
1921 /* gfx_add_point( node , 0,im->yimg ); */
1924 if (im->draw_x_grid == 1 )
1925 vertical_grid(im);
1927 if (im->draw_y_grid == 1){
1928 if(im->logarithmic){
1929 res = horizontal_log_grid(im);
1930 } else {
1931 res = draw_horizontal_grid(im);
1932 }
1934 /* dont draw horizontal grid if there is no min and max val */
1935 if (! res ) {
1936 char *nodata = "No Data found";
1937 gfx_new_text(im->canvas,im->ximg/2, (2*im->yorigin-im->ysize) / 2,
1938 im->graph_col[GRC_FONT],
1939 im->text_prop[TEXT_PROP_AXIS].font,
1940 im->text_prop[TEXT_PROP_AXIS].size,
1941 im->tabwidth, 0.0, GFX_H_CENTER, GFX_V_CENTER,
1942 nodata );
1943 }
1944 }
1946 /* yaxis unit description */
1947 gfx_new_text( im->canvas,
1948 10, (im->yorigin - im->ysize/2),
1949 im->graph_col[GRC_FONT],
1950 im->text_prop[TEXT_PROP_UNIT].font,
1951 im->text_prop[TEXT_PROP_UNIT].size, im->tabwidth,
1952 RRDGRAPH_YLEGEND_ANGLE,
1953 GFX_H_LEFT, GFX_V_CENTER,
1954 im->ylegend);
1956 /* graph title */
1957 gfx_new_text( im->canvas,
1958 im->ximg/2, im->text_prop[TEXT_PROP_TITLE].size*1.3+4,
1959 im->graph_col[GRC_FONT],
1960 im->text_prop[TEXT_PROP_TITLE].font,
1961 im->text_prop[TEXT_PROP_TITLE].size, im->tabwidth, 0.0,
1962 GFX_H_CENTER, GFX_V_CENTER,
1963 im->title);
1964 /* rrdtool 'logo' */
1965 gfx_new_text( im->canvas,
1966 im->ximg-7, 7,
1967 ( im->graph_col[GRC_FONT] & 0xffffff00 ) | 0x00000044,
1968 im->text_prop[TEXT_PROP_AXIS].font,
1969 5.5, im->tabwidth, 270,
1970 GFX_H_RIGHT, GFX_V_TOP,
1971 "RRDTOOL / TOBI OETIKER");
1973 /* graph labels */
1974 if( !(im->extra_flags & NOLEGEND) & !(im->extra_flags & ONLY_GRAPH) ) {
1975 for(i=0;i<im->gdes_c;i++){
1976 if(im->gdes[i].legend[0] =='\0')
1977 continue;
1979 /* im->gdes[i].leg_y is the bottom of the legend */
1980 X0 = im->gdes[i].leg_x;
1981 Y0 = im->gdes[i].leg_y;
1982 gfx_new_text ( im->canvas, X0, Y0,
1983 im->graph_col[GRC_FONT],
1984 im->text_prop[TEXT_PROP_LEGEND].font,
1985 im->text_prop[TEXT_PROP_LEGEND].size,
1986 im->tabwidth,0.0, GFX_H_LEFT, GFX_V_BOTTOM,
1987 im->gdes[i].legend );
1988 /* The legend for GRAPH items starts with "M " to have
1989 enough space for the box */
1990 if ( im->gdes[i].gf != GF_PRINT &&
1991 im->gdes[i].gf != GF_GPRINT &&
1992 im->gdes[i].gf != GF_COMMENT) {
1993 int boxH, boxV;
1995 boxH = gfx_get_text_width(im->canvas, 0,
1996 im->text_prop[TEXT_PROP_LEGEND].font,
1997 im->text_prop[TEXT_PROP_LEGEND].size,
1998 im->tabwidth,"o", 0) * 1.2;
1999 boxV = boxH*1.1;
2001 /* make sure transparent colors show up the same way as in the graph */
2002 node = gfx_new_area(im->canvas,
2003 X0,Y0-boxV,
2004 X0,Y0,
2005 X0+boxH,Y0,
2006 im->graph_col[GRC_BACK]);
2007 gfx_add_point ( node, X0+boxH, Y0-boxV );
2009 node = gfx_new_area(im->canvas,
2010 X0,Y0-boxV,
2011 X0,Y0,
2012 X0+boxH,Y0,
2013 im->gdes[i].col);
2014 gfx_add_point ( node, X0+boxH, Y0-boxV );
2015 node = gfx_new_line(im->canvas,
2016 X0,Y0-boxV,
2017 X0,Y0,
2018 1.0,im->graph_col[GRC_FRAME]);
2019 gfx_add_point(node,X0+boxH,Y0);
2020 gfx_add_point(node,X0+boxH,Y0-boxV);
2021 gfx_close_path(node);
2022 }
2023 }
2024 }
2025 }
2028 /*****************************************************
2029 * lazy check make sure we rely need to create this graph
2030 *****************************************************/
2032 int lazy_check(image_desc_t *im){
2033 FILE *fd = NULL;
2034 int size = 1;
2035 struct stat imgstat;
2037 if (im->lazy == 0) return 0; /* no lazy option */
2038 if (stat(im->graphfile,&imgstat) != 0)
2039 return 0; /* can't stat */
2040 /* one pixel in the existing graph is more then what we would
2041 change here ... */
2042 if (time(NULL) - imgstat.st_mtime >
2043 (im->end - im->start) / im->xsize)
2044 return 0;
2045 if ((fd = fopen(im->graphfile,"rb")) == NULL)
2046 return 0; /* the file does not exist */
2047 switch (im->canvas->imgformat) {
2048 case IF_PNG:
2049 size = PngSize(fd,&(im->ximg),&(im->yimg));
2050 break;
2051 default:
2052 size = 1;
2053 }
2054 fclose(fd);
2055 return size;
2056 }
2058 #ifdef WITH_PIECHART
2059 void
2060 pie_part(image_desc_t *im, gfx_color_t color,
2061 double PieCenterX, double PieCenterY, double Radius,
2062 double startangle, double endangle)
2063 {
2064 gfx_node_t *node;
2065 double angle;
2066 double step=M_PI/50; /* Number of iterations for the circle;
2067 ** 10 is definitely too low, more than
2068 ** 50 seems to be overkill
2069 */
2071 /* Strange but true: we have to work clockwise or else
2072 ** anti aliasing nor transparency don't work.
2073 **
2074 ** This test is here to make sure we do it right, also
2075 ** this makes the for...next loop more easy to implement.
2076 ** The return will occur if the user enters a negative number
2077 ** (which shouldn't be done according to the specs) or if the
2078 ** programmers do something wrong (which, as we all know, never
2079 ** happens anyway :)
2080 */
2081 if (endangle<startangle) return;
2083 /* Hidden feature: Radius decreases each full circle */
2084 angle=startangle;
2085 while (angle>=2*M_PI) {
2086 angle -= 2*M_PI;
2087 Radius *= 0.8;
2088 }
2090 node=gfx_new_area(im->canvas,
2091 PieCenterX+sin(startangle)*Radius,
2092 PieCenterY-cos(startangle)*Radius,
2093 PieCenterX,
2094 PieCenterY,
2095 PieCenterX+sin(endangle)*Radius,
2096 PieCenterY-cos(endangle)*Radius,
2097 color);
2098 for (angle=endangle;angle-startangle>=step;angle-=step) {
2099 gfx_add_point(node,
2100 PieCenterX+sin(angle)*Radius,
2101 PieCenterY-cos(angle)*Radius );
2102 }
2103 }
2105 #endif
2107 int
2108 graph_size_location(image_desc_t *im, int elements
2110 #ifdef WITH_PIECHART
2111 , int piechart
2112 #endif
2114 )
2115 {
2116 /* The actual size of the image to draw is determined from
2117 ** several sources. The size given on the command line is
2118 ** the graph area but we need more as we have to draw labels
2119 ** and other things outside the graph area
2120 */
2122 /* +-+-------------------------------------------+
2123 ** |l|.................title.....................|
2124 ** |e+--+-------------------------------+--------+
2125 ** |b| b| | |
2126 ** |a| a| | pie |
2127 ** |l| l| main graph area | chart |
2128 ** |.| .| | area |
2129 ** |t| y| | |
2130 ** |r+--+-------------------------------+--------+
2131 ** |e| | x-axis labels | |
2132 ** |v+--+-------------------------------+--------+
2133 ** | |..............legends......................|
2134 ** +-+-------------------------------------------+
2135 */
2136 int Xvertical=0,
2137 Ytitle =0,
2138 Xylabel =0,
2139 Xmain =0, Ymain =0,
2140 #ifdef WITH_PIECHART
2141 Xpie =0, Ypie =0,
2142 #endif
2143 Yxlabel =0,
2144 #if 0
2145 Xlegend =0, Ylegend =0,
2146 #endif
2147 Xspacing =15, Yspacing =15;
2149 if (im->extra_flags & ONLY_GRAPH) {
2150 im->xorigin =0;
2151 im->ximg = im->xsize;
2152 im->yimg = im->ysize;
2153 im->yorigin = im->ysize;
2154 ytr(im,DNAN);
2155 return 0;
2156 }
2158 if (im->ylegend[0] != '\0' ) {
2159 Xvertical = im->text_prop[TEXT_PROP_UNIT].size *2;
2160 }
2163 if (im->title[0] != '\0') {
2164 /* The title is placed "inbetween" two text lines so it
2165 ** automatically has some vertical spacing. The horizontal
2166 ** spacing is added here, on each side.
2167 */
2168 /* don't care for the with of the title
2169 Xtitle = gfx_get_text_width(im->canvas, 0,
2170 im->text_prop[TEXT_PROP_TITLE].font,
2171 im->text_prop[TEXT_PROP_TITLE].size,
2172 im->tabwidth,
2173 im->title, 0) + 2*Xspacing; */
2174 Ytitle = im->text_prop[TEXT_PROP_TITLE].size*2.6+10;
2175 }
2177 if (elements) {
2178 Xmain=im->xsize;
2179 Ymain=im->ysize;
2180 if (im->draw_x_grid) {
2181 Yxlabel=im->text_prop[TEXT_PROP_AXIS].size *2.5;
2182 }
2183 if (im->draw_y_grid) {
2184 Xylabel=gfx_get_text_width(im->canvas, 0,
2185 im->text_prop[TEXT_PROP_AXIS].font,
2186 im->text_prop[TEXT_PROP_AXIS].size,
2187 im->tabwidth,
2188 "0", 0) * im->unitslength;
2189 }
2190 }
2192 #ifdef WITH_PIECHART
2193 if (piechart) {
2194 im->piesize=im->xsize<im->ysize?im->xsize:im->ysize;
2195 Xpie=im->piesize;
2196 Ypie=im->piesize;
2197 }
2198 #endif
2200 /* Now calculate the total size. Insert some spacing where
2201 desired. im->xorigin and im->yorigin need to correspond
2202 with the lower left corner of the main graph area or, if
2203 this one is not set, the imaginary box surrounding the
2204 pie chart area. */
2206 /* The legend width cannot yet be determined, as a result we
2207 ** have problems adjusting the image to it. For now, we just
2208 ** forget about it at all; the legend will have to fit in the
2209 ** size already allocated.
2210 */
2211 im->ximg = Xylabel + Xmain + 2 * Xspacing;
2213 #ifdef WITH_PIECHART
2214 im->ximg += Xpie;
2215 #endif
2217 if (Xmain) im->ximg += Xspacing;
2218 #ifdef WITH_PIECHART
2219 if (Xpie) im->ximg += Xspacing;
2220 #endif
2222 im->xorigin = Xspacing + Xylabel;
2224 /* the length of the title should not influence with width of the graph
2225 if (Xtitle > im->ximg) im->ximg = Xtitle; */
2227 if (Xvertical) { /* unit description */
2228 im->ximg += Xvertical;
2229 im->xorigin += Xvertical;
2230 }
2231 xtr(im,0);
2233 /* The vertical size is interesting... we need to compare
2234 ** the sum of {Ytitle, Ymain, Yxlabel, Ylegend} with Yvertical
2235 ** however we need to know {Ytitle+Ymain+Yxlabel} in order to
2236 ** start even thinking about Ylegend.
2237 **
2238 ** Do it in three portions: First calculate the inner part,
2239 ** then do the legend, then adjust the total height of the img.
2240 */
2242 /* reserve space for main and/or pie */
2244 im->yimg = Ymain + Yxlabel;
2246 #ifdef WITH_PIECHART
2247 if (im->yimg < Ypie) im->yimg = Ypie;
2248 #endif
2250 im->yorigin = im->yimg - Yxlabel;
2252 /* reserve space for the title *or* some padding above the graph */
2253 if (Ytitle) {
2254 im->yimg += Ytitle;
2255 im->yorigin += Ytitle;
2256 } else {
2257 im->yimg += 1.5*Yspacing;
2258 im->yorigin += 1.5*Yspacing;
2259 }
2260 /* reserve space for padding below the graph */
2261 im->yimg += Yspacing;
2263 /* Determine where to place the legends onto the image.
2264 ** Adjust im->yimg to match the space requirements.
2265 */
2266 if(leg_place(im)==-1)
2267 return -1;
2270 #if 0
2271 if (Xlegend > im->ximg) {
2272 im->ximg = Xlegend;
2273 /* reposition Pie */
2274 }
2275 #endif
2277 #ifdef WITH_PIECHART
2278 /* The pie is placed in the upper right hand corner,
2279 ** just below the title (if any) and with sufficient
2280 ** padding.
2281 */
2282 if (elements) {
2283 im->pie_x = im->ximg - Xspacing - Xpie/2;
2284 im->pie_y = im->yorigin-Ymain+Ypie/2;
2285 } else {
2286 im->pie_x = im->ximg/2;
2287 im->pie_y = im->yorigin-Ypie/2;
2288 }
2289 #endif
2291 ytr(im,DNAN);
2292 return 0;
2293 }
2295 /* draw that picture thing ... */
2296 int
2297 graph_paint(image_desc_t *im, char ***calcpr)
2298 {
2299 int i,ii;
2300 int lazy = lazy_check(im);
2301 #ifdef WITH_PIECHART
2302 int piechart = 0;
2303 double PieStart=0.0;
2304 #endif
2305 FILE *fo;
2306 gfx_node_t *node;
2308 double areazero = 0.0;
2309 enum gf_en stack_gf = GF_PRINT;
2310 graph_desc_t *lastgdes = NULL;
2312 /* if we are lazy and there is nothing to PRINT ... quit now */
2313 if (lazy && im->prt_c==0) return 0;
2315 /* pull the data from the rrd files ... */
2317 if(data_fetch(im)==-1)
2318 return -1;
2320 /* evaluate VDEF and CDEF operations ... */
2321 if(data_calc(im)==-1)
2322 return -1;
2324 #ifdef WITH_PIECHART
2325 /* check if we need to draw a piechart */
2326 for(i=0;i<im->gdes_c;i++){
2327 if (im->gdes[i].gf == GF_PART) {
2328 piechart=1;
2329 break;
2330 }
2331 }
2332 #endif
2334 /* calculate and PRINT and GPRINT definitions. We have to do it at
2335 * this point because it will affect the length of the legends
2336 * if there are no graph elements we stop here ...
2337 * if we are lazy, try to quit ...
2338 */
2339 i=print_calc(im,calcpr);
2340 if(i<0) return -1;
2341 if(((i==0)
2342 #ifdef WITH_PIECHART
2343 &&(piechart==0)
2344 #endif
2345 ) || lazy) return 0;
2347 #ifdef WITH_PIECHART
2348 /* If there's only the pie chart to draw, signal this */
2349 if (i==0) piechart=2;
2350 #endif
2352 /* get actual drawing data and find min and max values*/
2353 if(data_proc(im)==-1)
2354 return -1;
2356 if(!im->logarithmic){si_unit(im);} /* identify si magnitude Kilo, Mega Giga ? */
2358 if(!im->rigid && ! im->logarithmic)
2359 expand_range(im); /* make sure the upper and lower limit are
2360 sensible values */
2362 if (!calc_horizontal_grid(im))
2363 return -1;
2365 if (im->gridfit)
2366 apply_gridfit(im);
2369 /**************************************************************
2370 *** Calculating sizes and locations became a bit confusing ***
2371 *** so I moved this into a separate function. ***
2372 **************************************************************/
2373 if(graph_size_location(im,i
2374 #ifdef WITH_PIECHART
2375 ,piechart
2376 #endif
2377 )==-1)
2378 return -1;
2380 /* the actual graph is created by going through the individual
2381 graph elements and then drawing them */
2383 node=gfx_new_area ( im->canvas,
2384 0, 0,
2385 0, im->yimg,
2386 im->ximg, im->yimg,
2387 im->graph_col[GRC_BACK]);
2389 gfx_add_point(node,im->ximg, 0);
2391 #ifdef WITH_PIECHART
2392 if (piechart != 2) {
2393 #endif
2394 node=gfx_new_area ( im->canvas,
2395 im->xorigin, im->yorigin,
2396 im->xorigin + im->xsize, im->yorigin,
2397 im->xorigin + im->xsize, im->yorigin-im->ysize,
2398 im->graph_col[GRC_CANVAS]);
2400 gfx_add_point(node,im->xorigin, im->yorigin - im->ysize);
2402 if (im->minval > 0.0)
2403 areazero = im->minval;
2404 if (im->maxval < 0.0)
2405 areazero = im->maxval;
2406 #ifdef WITH_PIECHART
2407 }
2408 #endif
2410 #ifdef WITH_PIECHART
2411 if (piechart) {
2412 pie_part(im,im->graph_col[GRC_CANVAS],im->pie_x,im->pie_y,im->piesize*0.5,0,2*M_PI);
2413 }
2414 #endif
2416 for(i=0;i<im->gdes_c;i++){
2417 switch(im->gdes[i].gf){
2418 case GF_CDEF:
2419 case GF_VDEF:
2420 case GF_DEF:
2421 case GF_PRINT:
2422 case GF_GPRINT:
2423 case GF_COMMENT:
2424 case GF_HRULE:
2425 case GF_VRULE:
2426 case GF_XPORT:
2427 case GF_SHIFT:
2428 break;
2429 case GF_TICK:
2430 for (ii = 0; ii < im->xsize; ii++)
2431 {
2432 if (!isnan(im->gdes[i].p_data[ii]) &&
2433 im->gdes[i].p_data[ii] > 0.0)
2434 {
2435 /* generate a tick */
2436 gfx_new_line(im->canvas, im -> xorigin + ii,
2437 im -> yorigin - (im -> gdes[i].yrule * im -> ysize),
2438 im -> xorigin + ii,
2439 im -> yorigin,
2440 1.0,
2441 im -> gdes[i].col );
2442 }
2443 }
2444 break;
2445 case GF_LINE:
2446 case GF_AREA:
2447 stack_gf = im->gdes[i].gf;
2448 case GF_STACK:
2449 /* fix data points at oo and -oo */
2450 for(ii=0;ii<im->xsize;ii++){
2451 if (isinf(im->gdes[i].p_data[ii])){
2452 if (im->gdes[i].p_data[ii] > 0) {
2453 im->gdes[i].p_data[ii] = im->maxval ;
2454 } else {
2455 im->gdes[i].p_data[ii] = im->minval ;
2456 }
2458 }
2459 } /* for */
2461 /* *******************************************************
2462 a ___. (a,t)
2463 | | ___
2464 ____| | | |
2465 | |___|
2466 -------|--t-1--t--------------------------------
2468 if we know the value at time t was a then
2469 we draw a square from t-1 to t with the value a.
2471 ********************************************************* */
2472 if (im->gdes[i].col != 0x0){
2473 /* GF_LINE and friend */
2474 if(stack_gf == GF_LINE ){
2475 double last_y=0;
2476 node = NULL;
2477 for(ii=1;ii<im->xsize;ii++){
2478 if (isnan(im->gdes[i].p_data[ii]) || (im->slopemode==1 && isnan(im->gdes[i].p_data[ii-1]))){
2479 node = NULL;
2480 continue;
2481 }
2482 if ( node == NULL ) {
2483 last_y = ytr(im,im->gdes[i].p_data[ii]);
2484 if ( im->slopemode == 0 ){
2485 node = gfx_new_line(im->canvas,
2486 ii-1+im->xorigin,last_y,
2487 ii+im->xorigin,last_y,
2488 im->gdes[i].linewidth,
2489 im->gdes[i].col);
2490 } else {
2491 node = gfx_new_line(im->canvas,
2492 ii-1+im->xorigin,ytr(im,im->gdes[i].p_data[ii-1]),
2493 ii+im->xorigin,last_y,
2494 im->gdes[i].linewidth,
2495 im->gdes[i].col);
2496 }
2497 } else {
2498 double new_y = ytr(im,im->gdes[i].p_data[ii]);
2499 if ( im->slopemode==0 && new_y != last_y){
2500 gfx_add_point(node,ii-1+im->xorigin,new_y);
2501 last_y = new_y;
2502 };
2503 gfx_add_point(node,ii+im->xorigin,new_y);
2504 };
2506 }
2507 } else {
2508 int idxI=-1;
2509 double *foreY=malloc(sizeof(double)*im->xsize*2);
2510 double *foreX=malloc(sizeof(double)*im->xsize*2);
2511 double *backY=malloc(sizeof(double)*im->xsize*2);
2512 double *backX=malloc(sizeof(double)*im->xsize*2);
2513 int drawem = 0;
2514 for(ii=0;ii<=im->xsize;ii++){
2515 double ybase,ytop;
2516 if ( idxI > 0 && ( drawem != 0 || ii==im->xsize)){
2517 int cntI=1;
2518 int lastI=0;
2519 while (cntI < idxI && foreY[lastI] == foreY[cntI] && foreY[lastI] == foreY[cntI+1]){cntI++;}
2520 node = gfx_new_area(im->canvas,
2521 backX[0],backY[0],
2522 foreX[0],foreY[0],
2523 foreX[cntI],foreY[cntI], im->gdes[i].col);
2524 while (cntI < idxI) {
2525 lastI = cntI;
2526 cntI++;
2527 while ( cntI < idxI && foreY[lastI] == foreY[cntI] && foreY[lastI] == foreY[cntI+1]){cntI++;}
2528 gfx_add_point(node,foreX[cntI],foreY[cntI]);
2529 }
2530 gfx_add_point(node,backX[idxI],backY[idxI]);
2531 while (idxI > 1){
2532 lastI = idxI;
2533 idxI--;
2534 while ( idxI > 1 && backY[lastI] == backY[idxI] && backY[lastI] == backY[idxI-1]){idxI--;}
2535 gfx_add_point(node,backX[idxI],backY[idxI]);
2536 }
2537 idxI=-1;
2538 drawem = 0;
2539 }
2540 if (drawem != 0){
2541 drawem = 0;
2542 idxI=-1;
2543 }
2544 if (ii == im->xsize) break;
2546 /* keep things simple for now, just draw these bars
2547 do not try to build a big and complex area */
2550 if ( im->slopemode == 0 && ii==0){
2551 continue;
2552 }
2553 if ( isnan(im->gdes[i].p_data[ii]) ) {
2554 drawem = 1;
2555 continue;
2556 }
2557 ytop = ytr(im,im->gdes[i].p_data[ii]);
2558 if ( lastgdes && im->gdes[i].stack ) {
2559 ybase = ytr(im,lastgdes->p_data[ii]);
2560 } else {
2561 ybase = ytr(im,areazero);
2562 }
2563 if ( ybase == ytop ){
2564 drawem = 1;
2565 continue;
2566 }
2567 /* every area has to be wound clock-wise,
2568 so we have to make sur base remains base */
2569 if (ybase > ytop){
2570 double extra = ytop;
2571 ytop = ybase;
2572 ybase = extra;
2573 }
2574 if ( im->slopemode == 0 ){
2575 backY[++idxI] = ybase-0.2;
2576 backX[idxI] = ii+im->xorigin-1;
2577 foreY[idxI] = ytop+0.2;
2578 foreX[idxI] = ii+im->xorigin-1;
2579 }
2580 backY[++idxI] = ybase-0.2;
2581 backX[idxI] = ii+im->xorigin;
2582 foreY[idxI] = ytop+0.2;
2583 foreX[idxI] = ii+im->xorigin;
2584 }
2585 /* close up any remaining area */
2586 free(foreY);
2587 free(foreX);
2588 free(backY);
2589 free(backX);
2590 } /* else GF_LINE */
2591 } /* if color != 0x0 */
2592 /* make sure we do not run into trouble when stacking on NaN */
2593 for(ii=0;ii<im->xsize;ii++){
2594 if (isnan(im->gdes[i].p_data[ii])) {
2595 if (lastgdes && (im->gdes[i].stack)) {
2596 im->gdes[i].p_data[ii] = lastgdes->p_data[ii];
2597 } else {
2598 im->gdes[i].p_data[ii] = areazero;
2599 }
2600 }
2601 }
2602 lastgdes = &(im->gdes[i]);
2603 break;
2604 #ifdef WITH_PIECHART
2605 case GF_PART:
2606 if(isnan(im->gdes[i].yrule)) /* fetch variable */
2607 im->gdes[i].yrule = im->gdes[im->gdes[i].vidx].vf.val;
2609 if (finite(im->gdes[i].yrule)) { /* even the fetched var can be NaN */
2610 pie_part(im,im->gdes[i].col,
2611 im->pie_x,im->pie_y,im->piesize*0.4,
2612 M_PI*2.0*PieStart/100.0,
2613 M_PI*2.0*(PieStart+im->gdes[i].yrule)/100.0);
2614 PieStart += im->gdes[i].yrule;
2615 }
2616 break;
2617 #endif
2619 } /* switch */
2620 }
2621 #ifdef WITH_PIECHART
2622 if (piechart==2) {
2623 im->draw_x_grid=0;
2624 im->draw_y_grid=0;
2625 }
2626 #endif
2629 /* grid_paint also does the text */
2630 if( !(im->extra_flags & ONLY_GRAPH) )
2631 grid_paint(im);
2634 if( !(im->extra_flags & ONLY_GRAPH) )
2635 axis_paint(im);
2637 /* the RULES are the last thing to paint ... */
2638 for(i=0;i<im->gdes_c;i++){
2640 switch(im->gdes[i].gf){
2641 case GF_HRULE:
2642 if(isnan(im->gdes[i].yrule)) { /* fetch variable */
2643 im->gdes[i].yrule = im->gdes[im->gdes[i].vidx].vf.val;
2644 };
2645 if(im->gdes[i].yrule >= im->minval
2646 && im->gdes[i].yrule <= im->maxval)
2647 gfx_new_line(im->canvas,
2648 im->xorigin,ytr(im,im->gdes[i].yrule),
2649 im->xorigin+im->xsize,ytr(im,im->gdes[i].yrule),
2650 1.0,im->gdes[i].col);
2651 break;
2652 case GF_VRULE:
2653 if(im->gdes[i].xrule == 0) { /* fetch variable */
2654 im->gdes[i].xrule = im->gdes[im->gdes[i].vidx].vf.when;
2655 };
2656 if(im->gdes[i].xrule >= im->start
2657 && im->gdes[i].xrule <= im->end)
2658 gfx_new_line(im->canvas,
2659 xtr(im,im->gdes[i].xrule),im->yorigin,
2660 xtr(im,im->gdes[i].xrule),im->yorigin-im->ysize,
2661 1.0,im->gdes[i].col);
2662 break;
2663 default:
2664 break;
2665 }
2666 }
2669 if (strcmp(im->graphfile,"-")==0) {
2670 fo = im->graphhandle ? im->graphhandle : stdout;
2671 #if defined(_WIN32) && !defined(__CYGWIN__) && !defined(__CYGWIN32__)
2672 /* Change translation mode for stdout to BINARY */
2673 _setmode( _fileno( fo ), O_BINARY );
2674 #endif
2675 } else {
2676 if ((fo = fopen(im->graphfile,"wb")) == NULL) {
2677 rrd_set_error("Opening '%s' for write: %s",im->graphfile,
2678 rrd_strerror(errno));
2679 return (-1);
2680 }
2681 }
2682 gfx_render (im->canvas,im->ximg,im->yimg,0x00000000,fo);
2683 if (strcmp(im->graphfile,"-") != 0)
2684 fclose(fo);
2685 return 0;
2686 }
2689 /*****************************************************
2690 * graph stuff
2691 *****************************************************/
2693 int
2694 gdes_alloc(image_desc_t *im){
2696 im->gdes_c++;
2697 if ((im->gdes = (graph_desc_t *) rrd_realloc(im->gdes, (im->gdes_c)
2698 * sizeof(graph_desc_t)))==NULL){
2699 rrd_set_error("realloc graph_descs");
2700 return -1;
2701 }
2704 im->gdes[im->gdes_c-1].step=im->step;
2705 im->gdes[im->gdes_c-1].stack=0;
2706 im->gdes[im->gdes_c-1].debug=0;
2707 im->gdes[im->gdes_c-1].start=im->start;
2708 im->gdes[im->gdes_c-1].end=im->end;
2709 im->gdes[im->gdes_c-1].vname[0]='\0';
2710 im->gdes[im->gdes_c-1].data=NULL;
2711 im->gdes[im->gdes_c-1].ds_namv=NULL;
2712 im->gdes[im->gdes_c-1].data_first=0;
2713 im->gdes[im->gdes_c-1].p_data=NULL;
2714 im->gdes[im->gdes_c-1].rpnp=NULL;
2715 im->gdes[im->gdes_c-1].shift=0;
2716 im->gdes[im->gdes_c-1].col = 0x0;
2717 im->gdes[im->gdes_c-1].legend[0]='\0';
2718 im->gdes[im->gdes_c-1].format[0]='\0';
2719 im->gdes[im->gdes_c-1].rrd[0]='\0';
2720 im->gdes[im->gdes_c-1].ds=-1;
2721 im->gdes[im->gdes_c-1].p_data=NULL;
2722 im->gdes[im->gdes_c-1].yrule=DNAN;
2723 im->gdes[im->gdes_c-1].xrule=0;
2724 return 0;
2725 }
2727 /* copies input untill the first unescaped colon is found
2728 or until input ends. backslashes have to be escaped as well */
2729 int
2730 scan_for_col(char *input, int len, char *output)
2731 {
2732 int inp,outp=0;
2733 for (inp=0;
2734 inp < len &&
2735 input[inp] != ':' &&
2736 input[inp] != '\0';
2737 inp++){
2738 if (input[inp] == '\\' &&
2739 input[inp+1] != '\0' &&
2740 (input[inp+1] == '\\' ||
2741 input[inp+1] == ':')){
2742 output[outp++] = input[++inp];
2743 }
2744 else {
2745 output[outp++] = input[inp];
2746 }
2747 }
2748 output[outp] = '\0';
2749 return inp;
2750 }
2751 /* Some surgery done on this function, it became ridiculously big.
2752 ** Things moved:
2753 ** - initializing now in rrd_graph_init()
2754 ** - options parsing now in rrd_graph_options()
2755 ** - script parsing now in rrd_graph_script()
2756 */
2757 int
2758 rrd_graph(int argc, char **argv, char ***prdata, int *xsize, int *ysize, FILE *stream, double *ymin, double *ymax)
2759 {
2760 image_desc_t im;
2761 rrd_graph_init(&im);
2762 im.graphhandle = stream;
2764 rrd_graph_options(argc,argv,&im);
2765 if (rrd_test_error()) {
2766 im_free(&im);
2767 return -1;
2768 }
2770 if (strlen(argv[optind])>=MAXPATH) {
2771 rrd_set_error("filename (including path) too long");
2772 im_free(&im);
2773 return -1;
2774 }
2775 strncpy(im.graphfile,argv[optind],MAXPATH-1);
2776 im.graphfile[MAXPATH-1]='\0';
2778 rrd_graph_script(argc,argv,&im,1);
2779 if (rrd_test_error()) {
2780 im_free(&im);
2781 return -1;
2782 }
2784 /* Everything is now read and the actual work can start */
2786 (*prdata)=NULL;
2787 if (graph_paint(&im,prdata)==-1){
2788 im_free(&im);
2789 return -1;
2790 }
2792 /* The image is generated and needs to be output.
2793 ** Also, if needed, print a line with information about the image.
2794 */
2796 *xsize=im.ximg;
2797 *ysize=im.yimg;
2798 *ymin=im.minval;
2799 *ymax=im.maxval;
2800 if (im.imginfo) {
2801 char *filename;
2802 if (!(*prdata)) {
2803 /* maybe prdata is not allocated yet ... lets do it now */
2804 if ((*prdata = calloc(2,sizeof(char *)))==NULL) {
2805 rrd_set_error("malloc imginfo");
2806 return -1;
2807 };
2808 }
2809 if(((*prdata)[0] = malloc((strlen(im.imginfo)+200+strlen(im.graphfile))*sizeof(char)))
2810 ==NULL){
2811 rrd_set_error("malloc imginfo");
2812 return -1;
2813 }
2814 filename=im.graphfile+strlen(im.graphfile);
2815 while(filename > im.graphfile) {
2816 if (*(filename-1)=='/' || *(filename-1)=='\\' ) break;
2817 filename--;
2818 }
2820 sprintf((*prdata)[0],im.imginfo,filename,(long)(im.canvas->zoom*im.ximg),(long)(im.canvas->zoom*im.yimg));
2821 }
2822 im_free(&im);
2823 return 0;
2824 }
2826 void
2827 rrd_graph_init(image_desc_t *im)
2828 {
2829 unsigned int i;
2831 #ifdef HAVE_TZSET
2832 tzset();
2833 #endif
2834 #ifdef HAVE_SETLOCALE
2835 setlocale(LC_TIME,"");
2836 #endif
2837 im->yorigin=0;
2838 im->xorigin=0;
2839 im->minval=0;
2840 im->xlab_user.minsec = -1;
2841 im->ximg=0;
2842 im->yimg=0;
2843 im->xsize = 400;
2844 im->ysize = 100;
2845 im->step = 0;
2846 im->ylegend[0] = '\0';
2847 im->title[0] = '\0';
2848 im->minval = DNAN;
2849 im->maxval = DNAN;
2850 im->unitsexponent= 9999;
2851 im->unitslength= 6;
2852 im->symbol = ' ';
2853 im->viewfactor = 1.0;
2854 im->extra_flags= 0;
2855 im->rigid = 0;
2856 im->gridfit = 1;
2857 im->imginfo = NULL;
2858 im->lazy = 0;
2859 im->slopemode = 0;
2860 im->logarithmic = 0;
2861 im->ygridstep = DNAN;
2862 im->draw_x_grid = 1;
2863 im->draw_y_grid = 1;
2864 im->base = 1000;
2865 im->prt_c = 0;
2866 im->gdes_c = 0;
2867 im->gdes = NULL;
2868 im->canvas = gfx_new_canvas();
2869 im->grid_dash_on = 1;
2870 im->grid_dash_off = 1;
2871 im->tabwidth = 40.0;
2873 for(i=0;i<DIM(graph_col);i++)
2874 im->graph_col[i]=graph_col[i];
2876 #if defined(_WIN32) && !defined(__CYGWIN__) && !defined(__CYGWIN32__)
2877 {
2878 char *windir;
2879 char rrd_win_default_font[1000];
2880 windir = getenv("windir");
2881 /* %windir% is something like D:\windows or C:\winnt */
2882 if (windir != NULL) {
2883 strncpy(rrd_win_default_font,windir,999);
2884 rrd_win_default_font[999] = '\0';
2885 strcat(rrd_win_default_font,"\\fonts\\");
2886 strcat(rrd_win_default_font,RRD_DEFAULT_FONT);
2887 for(i=0;i<DIM(text_prop);i++){
2888 strncpy(text_prop[i].font,rrd_win_default_font,sizeof(text_prop[i].font)-1);
2889 text_prop[i].font[sizeof(text_prop[i].font)-1] = '\0';
2890 }
2891 }
2892 }
2893 #endif
2894 {
2895 char *deffont;
2896 deffont = getenv("RRD_DEFAULT_FONT");
2897 if (deffont != NULL) {
2898 for(i=0;i<DIM(text_prop);i++){
2899 strncpy(text_prop[i].font,deffont,sizeof(text_prop[i].font)-1);
2900 text_prop[i].font[sizeof(text_prop[i].font)-1] = '\0';
2901 }
2902 }
2903 }
2904 for(i=0;i<DIM(text_prop);i++){
2905 im->text_prop[i].size = text_prop[i].size;
2906 strcpy(im->text_prop[i].font,text_prop[i].font);
2907 }
2908 }
2910 void
2911 rrd_graph_options(int argc, char *argv[],image_desc_t *im)
2912 {
2913 int stroff;
2914 char *parsetime_error = NULL;
2915 char scan_gtm[12],scan_mtm[12],scan_ltm[12],col_nam[12];
2916 time_t start_tmp=0,end_tmp=0;
2917 long long_tmp;
2918 struct rrd_time_value start_tv, end_tv;
2919 gfx_color_t color;
2920 optind = 0; opterr = 0; /* initialize getopt */
2922 parsetime("end-24h", &start_tv);
2923 parsetime("now", &end_tv);
2925 while (1){
2926 static struct option long_options[] =
2927 {
2928 {"start", required_argument, 0, 's'},
2929 {"end", required_argument, 0, 'e'},
2930 {"x-grid", required_argument, 0, 'x'},
2931 {"y-grid", required_argument, 0, 'y'},
2932 {"vertical-label",required_argument,0,'v'},
2933 {"width", required_argument, 0, 'w'},
2934 {"height", required_argument, 0, 'h'},
2935 {"interlaced", no_argument, 0, 'i'},
2936 {"upper-limit",required_argument, 0, 'u'},
2937 {"lower-limit",required_argument, 0, 'l'},
2938 {"rigid", no_argument, 0, 'r'},
2939 {"base", required_argument, 0, 'b'},
2940 {"logarithmic",no_argument, 0, 'o'},
2941 {"color", required_argument, 0, 'c'},
2942 {"font", required_argument, 0, 'n'},
2943 {"title", required_argument, 0, 't'},
2944 {"imginfo", required_argument, 0, 'f'},
2945 {"imgformat", required_argument, 0, 'a'},
2946 {"lazy", no_argument, 0, 'z'},
2947 {"zoom", required_argument, 0, 'm'},
2948 {"no-legend", no_argument, 0, 'g'},
2949 {"force-rules-legend",no_argument,0, 'F'},
2950 {"only-graph", no_argument, 0, 'j'},
2951 {"alt-y-grid", no_argument, 0, 'Y'},
2952 {"no-minor", no_argument, 0, 'I'},
2953 {"slope-mode", no_argument, 0, 'E'},
2954 {"alt-autoscale", no_argument, 0, 'A'},
2955 {"alt-autoscale-max", no_argument, 0, 'M'},
2956 {"no-gridfit", no_argument, 0, 'N'},
2957 {"units-exponent",required_argument, 0, 'X'},
2958 {"units-length",required_argument, 0, 'L'},
2959 {"step", required_argument, 0, 'S'},
2960 {"tabwidth", required_argument, 0, 'T'},
2961 {"font-render-mode", required_argument, 0, 'R'},
2962 {"font-smoothing-threshold", required_argument, 0, 'B'},
2963 {"alt-y-mrtg", no_argument, 0, 1000}, /* this has no effect it is just here to save old apps from crashing when they use it */
2964 {0,0,0,0}};
2965 int option_index = 0;
2966 int opt;
2967 int col_start,col_end;
2969 opt = getopt_long(argc, argv,
2970 "s:e:x:y:v:w:h:iu:l:rb:oc:n:m:t:f:a:I:zgjFYAMEX:L:S:T:NR:B:",
2971 long_options, &option_index);
2973 if (opt == EOF)
2974 break;
2976 switch(opt) {
2977 case 'I':
2978 im->extra_flags |= NOMINOR;
2979 break;
2980 case 'Y':
2981 im->extra_flags |= ALTYGRID;
2982 break;
2983 case 'A':
2984 im->extra_flags |= ALTAUTOSCALE;
2985 break;
2986 case 'M':
2987 im->extra_flags |= ALTAUTOSCALE_MAX;
2988 break;
2989 case 'j':
2990 im->extra_flags |= ONLY_GRAPH;
2991 break;
2992 case 'g':
2993 im->extra_flags |= NOLEGEND;
2994 break;
2995 case 'F':
2996 im->extra_flags |= FORCE_RULES_LEGEND;
2997 break;
2998 case 'X':
2999 im->unitsexponent = atoi(optarg);
3000 break;
3001 case 'L':
3002 im->unitslength = atoi(optarg);
3003 break;
3004 case 'T':
3005 im->tabwidth = atof(optarg);
3006 break;
3007 case 'S':
3008 im->step = atoi(optarg);
3009 break;
3010 case 'N':
3011 im->gridfit = 0;
3012 break;
3013 case 's':
3014 if ((parsetime_error = parsetime(optarg, &start_tv))) {
3015 rrd_set_error( "start time: %s", parsetime_error );
3016 return;
3017 }
3018 break;
3019 case 'e':
3020 if ((parsetime_error = parsetime(optarg, &end_tv))) {
3021 rrd_set_error( "end time: %s", parsetime_error );
3022 return;
3023 }
3024 break;
3025 case 'x':
3026 if(strcmp(optarg,"none") == 0){
3027 im->draw_x_grid=0;
3028 break;
3029 };
3031 if(sscanf(optarg,
3032 "%10[A-Z]:%ld:%10[A-Z]:%ld:%10[A-Z]:%ld:%ld:%n",
3033 scan_gtm,
3034 &im->xlab_user.gridst,
3035 scan_mtm,
3036 &im->xlab_user.mgridst,
3037 scan_ltm,
3038 &im->xlab_user.labst,
3039 &im->xlab_user.precis,
3040 &stroff) == 7 && stroff != 0){
3041 strncpy(im->xlab_form, optarg+stroff, sizeof(im->xlab_form) - 1);
3042 im->xlab_form[sizeof(im->xlab_form)-1] = '\0';
3043 if((int)(im->xlab_user.gridtm = tmt_conv(scan_gtm)) == -1){
3044 rrd_set_error("unknown keyword %s",scan_gtm);
3045 return;
3046 } else if ((int)(im->xlab_user.mgridtm = tmt_conv(scan_mtm)) == -1){
3047 rrd_set_error("unknown keyword %s",scan_mtm);
3048 return;
3049 } else if ((int)(im->xlab_user.labtm = tmt_conv(scan_ltm)) == -1){
3050 rrd_set_error("unknown keyword %s",scan_ltm);
3051 return;
3052 }
3053 im->xlab_user.minsec = 1;
3054 im->xlab_user.stst = im->xlab_form;
3055 } else {
3056 rrd_set_error("invalid x-grid format");
3057 return;
3058 }
3059 break;
3060 case 'y':
3062 if(strcmp(optarg,"none") == 0){
3063 im->draw_y_grid=0;
3064 break;
3065 };
3067 if(sscanf(optarg,
3068 "%lf:%d",
3069 &im->ygridstep,
3070 &im->ylabfact) == 2) {
3071 if(im->ygridstep<=0){
3072 rrd_set_error("grid step must be > 0");
3073 return;
3074 } else if (im->ylabfact < 1){
3075 rrd_set_error("label factor must be > 0");
3076 return;
3077 }
3078 } else {
3079 rrd_set_error("invalid y-grid format");
3080 return;
3081 }
3082 break;
3083 case 'v':
3084 strncpy(im->ylegend,optarg,150);
3085 im->ylegend[150]='\0';
3086 break;
3087 case 'u':
3088 im->maxval = atof(optarg);
3089 break;
3090 case 'l':
3091 im->minval = atof(optarg);
3092 break;
3093 case 'b':
3094 im->base = atol(optarg);
3095 if(im->base != 1024 && im->base != 1000 ){
3096 rrd_set_error("the only sensible value for base apart from 1000 is 1024");
3097 return;
3098 }
3099 break;
3100 case 'w':
3101 long_tmp = atol(optarg);
3102 if (long_tmp < 10) {
3103 rrd_set_error("width below 10 pixels");
3104 return;
3105 }
3106 im->xsize = long_tmp;
3107 break;
3108 case 'h':
3109 long_tmp = atol(optarg);
3110 if (long_tmp < 10) {
3111 rrd_set_error("height below 10 pixels");
3112 return;
3113 }
3114 im->ysize = long_tmp;
3115 break;
3116 case 'i':
3117 im->canvas->interlaced = 1;
3118 break;
3119 case 'r':
3120 im->rigid = 1;
3121 break;
3122 case 'f':
3123 im->imginfo = optarg;
3124 break;
3125 case 'a':
3126 if((int)(im->canvas->imgformat = if_conv(optarg)) == -1) {
3127 rrd_set_error("unsupported graphics format '%s'",optarg);
3128 return;
3129 }
3130 break;
3131 case 'z':
3132 im->lazy = 1;
3133 break;
3134 case 'E':
3135 im->slopemode = 1;
3136 break;
3138 case 'o':
3139 im->logarithmic = 1;
3140 if (isnan(im->minval))
3141 im->minval=1;
3142 break;
3143 case 'c':
3144 if(sscanf(optarg,
3145 "%10[A-Z]#%n%8lx%n",
3146 col_nam,&col_start,&color,&col_end) == 2){
3147 int ci;
3148 int col_len = col_end - col_start;
3149 switch (col_len){
3150 case 3:
3151 color = (
3152 ((color & 0xF00) * 0x110000) |
3153 ((color & 0x0F0) * 0x011000) |
3154 ((color & 0x00F) * 0x001100) |
3155 0x000000FF
3156 );
3157 break;
3158 case 4:
3159 color = (
3160 ((color & 0xF000) * 0x11000) |
3161 ((color & 0x0F00) * 0x01100) |
3162 ((color & 0x00F0) * 0x00110) |
3163 ((color & 0x000F) * 0x00011)
3164 );
3165 break;
3166 case 6:
3167 color = (color << 8) + 0xff /* shift left by 8 */;
3168 break;
3169 case 8:
3170 break;
3171 default:
3172 rrd_set_error("the color format is #RRGGBB[AA]");
3173 return;
3174 }
3175 if((ci=grc_conv(col_nam)) != -1){
3176 im->graph_col[ci]=color;
3177 } else {
3178 rrd_set_error("invalid color name '%s'",col_nam);
3179 return;
3180 }
3181 } else {
3182 rrd_set_error("invalid color def format");
3183 return;
3184 }
3185 break;
3186 case 'n':{
3187 char prop[15];
3188 double size = 1;
3189 char font[1024] = "";
3191 if(sscanf(optarg,
3192 "%10[A-Z]:%lf:%1000s",
3193 prop,&size,font) >= 2){
3194 int sindex,propidx;
3195 if((sindex=text_prop_conv(prop)) != -1){
3196 for (propidx=sindex;propidx<TEXT_PROP_LAST;propidx++){
3197 if (size > 0){
3198 im->text_prop[propidx].size=size;
3199 }
3200 if (strlen(font) > 0){
3201 strcpy(im->text_prop[propidx].font,font);
3202 }
3203 if (propidx==sindex && sindex != 0) break;
3204 }
3205 } else {
3206 rrd_set_error("invalid fonttag '%s'",prop);
3207 return;
3208 }
3209 } else {
3210 rrd_set_error("invalid text property format");
3211 return;
3212 }
3213 break;
3214 }
3215 case 'm':
3216 im->canvas->zoom = atof(optarg);
3217 if (im->canvas->zoom <= 0.0) {
3218 rrd_set_error("zoom factor must be > 0");
3219 return;
3220 }
3221 break;
3222 case 't':
3223 strncpy(im->title,optarg,150);
3224 im->title[150]='\0';
3225 break;
3227 case 'R':
3228 if ( strcmp( optarg, "normal" ) == 0 )
3229 im->canvas->aa_type = AA_NORMAL;
3230 else if ( strcmp( optarg, "light" ) == 0 )
3231 im->canvas->aa_type = AA_LIGHT;
3232 else if ( strcmp( optarg, "mono" ) == 0 )
3233 im->canvas->aa_type = AA_NONE;
3234 else
3235 {
3236 rrd_set_error("unknown font-render-mode '%s'", optarg );
3237 return;
3238 }
3239 break;
3241 case 'B':
3242 im->canvas->font_aa_threshold = atof(optarg);
3243 break;
3245 case '?':
3246 if (optopt != 0)
3247 rrd_set_error("unknown option '%c'", optopt);
3248 else
3249 rrd_set_error("unknown option '%s'",argv[optind-1]);
3250 return;
3251 }
3252 }
3254 if (optind >= argc) {
3255 rrd_set_error("missing filename");
3256 return;
3257 }
3259 if (im->logarithmic == 1 && (im->minval <= 0 || isnan(im->minval))){
3260 rrd_set_error("for a logarithmic yaxis you must specify a lower-limit > 0");
3261 return;
3262 }
3264 if (proc_start_end(&start_tv,&end_tv,&start_tmp,&end_tmp) == -1){
3265 /* error string is set in parsetime.c */
3266 return;
3267 }
3269 if (start_tmp < 3600*24*365*10){
3270 rrd_set_error("the first entry to fetch should be after 1980 (%ld)",start_tmp);
3271 return;
3272 }
3274 if (end_tmp < start_tmp) {
3275 rrd_set_error("start (%ld) should be less than end (%ld)",
3276 start_tmp, end_tmp);
3277 return;
3278 }
3280 im->start = start_tmp;
3281 im->end = end_tmp;
3282 im->step = max((long)im->step, (im->end-im->start)/im->xsize);
3283 }
3285 int
3286 rrd_graph_check_vname(image_desc_t *im, char *varname, char *err)
3287 {
3288 if ((im->gdes[im->gdes_c-1].vidx=find_var(im,varname))==-1) {
3289 rrd_set_error("Unknown variable '%s' in %s",varname,err);
3290 return -1;
3291 }
3292 return 0;
3293 }
3294 int
3295 rrd_graph_color(image_desc_t *im, char *var, char *err, int optional)
3296 {
3297 char *color;
3298 graph_desc_t *gdp=&im->gdes[im->gdes_c-1];
3300 color=strstr(var,"#");
3301 if (color==NULL) {
3302 if (optional==0) {
3303 rrd_set_error("Found no color in %s",err);
3304 return 0;
3305 }
3306 return 0;
3307 } else {
3308 int n=0;
3309 char *rest;
3310 gfx_color_t col;
3312 rest=strstr(color,":");
3313 if (rest!=NULL)
3314 n=rest-color;
3315 else
3316 n=strlen(color);
3318 switch (n) {
3319 case 7:
3320 sscanf(color,"#%6lx%n",&col,&n);
3321 col = (col << 8) + 0xff /* shift left by 8 */;
3322 if (n!=7) rrd_set_error("Color problem in %s",err);
3323 break;
3324 case 9:
3325 sscanf(color,"#%8lx%n",&col,&n);
3326 if (n==9) break;
3327 default:
3328 rrd_set_error("Color problem in %s",err);
3329 }
3330 if (rrd_test_error()) return 0;
3331 gdp->col = col;
3332 return n;
3333 }
3334 }
3337 int bad_format(char *fmt) {
3338 char *ptr;
3339 int n=0;
3340 ptr = fmt;
3341 while (*ptr != '\0')
3342 if (*ptr++ == '%') {
3344 /* line cannot end with percent char */
3345 if (*ptr == '\0') return 1;
3347 /* '%s', '%S' and '%%' are allowed */
3348 if (*ptr == 's' || *ptr == 'S' || *ptr == '%') ptr++;
3350 /* or else '% 6.2lf' and such are allowed */
3351 else {
3353 /* optional padding character */
3354 if (*ptr == ' ' || *ptr == '+' || *ptr == '-') ptr++;
3356 /* This should take care of 'm.n' with all three optional */
3357 while (*ptr >= '0' && *ptr <= '9') ptr++;
3358 if (*ptr == '.') ptr++;
3359 while (*ptr >= '0' && *ptr <= '9') ptr++;
3361 /* Either 'le', 'lf' or 'lg' must follow here */
3362 if (*ptr++ != 'l') return 1;
3363 if (*ptr == 'e' || *ptr == 'f' || *ptr == 'g') ptr++;
3364 else return 1;
3365 n++;
3366 }
3367 }
3369 return (n!=1);
3370 }
3373 int
3374 vdef_parse(gdes,str)
3375 struct graph_desc_t *gdes;
3376 char *str;
3377 {
3378 /* A VDEF currently is either "func" or "param,func"
3379 * so the parsing is rather simple. Change if needed.
3380 */
3381 double param;
3382 char func[30];
3383 int n;
3385 n=0;
3386 sscanf(str,"%le,%29[A-Z]%n",¶m,func,&n);
3387 if (n== (int)strlen(str)) { /* matched */
3388 ;
3389 } else {
3390 n=0;
3391 sscanf(str,"%29[A-Z]%n",func,&n);
3392 if (n== (int)strlen(str)) { /* matched */
3393 param=DNAN;
3394 } else {
3395 rrd_set_error("Unknown function string '%s' in VDEF '%s'"
3396 ,str
3397 ,gdes->vname
3398 );
3399 return -1;
3400 }
3401 }
3402 if (!strcmp("PERCENT",func)) gdes->vf.op = VDEF_PERCENT;
3403 else if (!strcmp("MAXIMUM",func)) gdes->vf.op = VDEF_MAXIMUM;
3404 else if (!strcmp("AVERAGE",func)) gdes->vf.op = VDEF_AVERAGE;
3405 else if (!strcmp("MINIMUM",func)) gdes->vf.op = VDEF_MINIMUM;
3406 else if (!strcmp("TOTAL", func)) gdes->vf.op = VDEF_TOTAL;
3407 else if (!strcmp("FIRST", func)) gdes->vf.op = VDEF_FIRST;
3408 else if (!strcmp("LAST", func)) gdes->vf.op = VDEF_LAST;
3409 else if (!strcmp("LSLSLOPE", func)) gdes->vf.op = VDEF_LSLSLOPE;
3410 else if (!strcmp("LSLINT", func)) gdes->vf.op = VDEF_LSLINT;
3411 else if (!strcmp("LSLCORREL",func)) gdes->vf.op = VDEF_LSLCORREL;
3412 else {
3413 rrd_set_error("Unknown function '%s' in VDEF '%s'\n"
3414 ,func
3415 ,gdes->vname
3416 );
3417 return -1;
3418 };
3420 switch (gdes->vf.op) {
3421 case VDEF_PERCENT:
3422 if (isnan(param)) { /* no parameter given */
3423 rrd_set_error("Function '%s' needs parameter in VDEF '%s'\n"
3424 ,func
3425 ,gdes->vname
3426 );
3427 return -1;
3428 };
3429 if (param>=0.0 && param<=100.0) {
3430 gdes->vf.param = param;
3431 gdes->vf.val = DNAN; /* undefined */
3432 gdes->vf.when = 0; /* undefined */
3433 } else {
3434 rrd_set_error("Parameter '%f' out of range in VDEF '%s'\n"
3435 ,param
3436 ,gdes->vname
3437 );
3438 return -1;
3439 };
3440 break;
3441 case VDEF_MAXIMUM:
3442 case VDEF_AVERAGE:
3443 case VDEF_MINIMUM:
3444 case VDEF_TOTAL:
3445 case VDEF_FIRST:
3446 case VDEF_LAST:
3447 case VDEF_LSLSLOPE:
3448 case VDEF_LSLINT:
3449 case VDEF_LSLCORREL:
3450 if (isnan(param)) {
3451 gdes->vf.param = DNAN;
3452 gdes->vf.val = DNAN;
3453 gdes->vf.when = 0;
3454 } else {
3455 rrd_set_error("Function '%s' needs no parameter in VDEF '%s'\n"
3456 ,func
3457 ,gdes->vname
3458 );
3459 return -1;
3460 };
3461 break;
3462 };
3463 return 0;
3464 }
3467 int
3468 vdef_calc(im,gdi)
3469 image_desc_t *im;
3470 int gdi;
3471 {
3472 graph_desc_t *src,*dst;
3473 rrd_value_t *data;
3474 long step,steps;
3476 dst = &im->gdes[gdi];
3477 src = &im->gdes[dst->vidx];
3478 data = src->data + src->ds;
3479 steps = (src->end - src->start) / src->step;
3481 #if 0
3482 printf("DEBUG: start == %lu, end == %lu, %lu steps\n"
3483 ,src->start
3484 ,src->end
3485 ,steps
3486 );
3487 #endif
3489 switch (dst->vf.op) {
3490 case VDEF_PERCENT: {
3491 rrd_value_t * array;
3492 int field;
3495 if ((array = malloc(steps*sizeof(double)))==NULL) {
3496 rrd_set_error("malloc VDEV_PERCENT");
3497 return -1;
3498 }
3499 for (step=0;step < steps; step++) {
3500 array[step]=data[step*src->ds_cnt];
3501 }
3502 qsort(array,step,sizeof(double),vdef_percent_compar);
3504 field = (steps-1)*dst->vf.param/100;
3505 dst->vf.val = array[field];
3506 dst->vf.when = 0; /* no time component */
3507 free(array);
3508 #if 0
3509 for(step=0;step<steps;step++)
3510 printf("DEBUG: %3li:%10.2f %c\n",step,array[step],step==field?'*':' ');
3511 #endif
3512 }
3513 break;
3514 case VDEF_MAXIMUM:
3515 step=0;
3516 while (step != steps && isnan(data[step*src->ds_cnt])) step++;
3517 if (step == steps) {
3518 dst->vf.val = DNAN;
3519 dst->vf.when = 0;
3520 } else {
3521 dst->vf.val = data[step*src->ds_cnt];
3522 dst->vf.when = src->start + (step+1)*src->step;
3523 }
3524 while (step != steps) {
3525 if (finite(data[step*src->ds_cnt])) {
3526 if (data[step*src->ds_cnt] > dst->vf.val) {
3527 dst->vf.val = data[step*src->ds_cnt];
3528 dst->vf.when = src->start + (step+1)*src->step;
3529 }
3530 }
3531 step++;
3532 }
3533 break;
3534 case VDEF_TOTAL:
3535 case VDEF_AVERAGE: {
3536 int cnt=0;
3537 double sum=0.0;
3538 for (step=0;step<steps;step++) {
3539 if (finite(data[step*src->ds_cnt])) {
3540 sum += data[step*src->ds_cnt];
3541 cnt ++;
3542 };
3543 }
3544 if (cnt) {
3545 if (dst->vf.op == VDEF_TOTAL) {
3546 dst->vf.val = sum*src->step;
3547 dst->vf.when = cnt*src->step; /* not really "when" */
3548 } else {
3549 dst->vf.val = sum/cnt;
3550 dst->vf.when = 0; /* no time component */
3551 };
3552 } else {
3553 dst->vf.val = DNAN;
3554 dst->vf.when = 0;
3555 }
3556 }
3557 break;
3558 case VDEF_MINIMUM:
3559 step=0;
3560 while (step != steps && isnan(data[step*src->ds_cnt])) step++;
3561 if (step == steps) {
3562 dst->vf.val = DNAN;
3563 dst->vf.when = 0;
3564 } else {
3565 dst->vf.val = data[step*src->ds_cnt];
3566 dst->vf.when = src->start + (step+1)*src->step;
3567 }
3568 while (step != steps) {
3569 if (finite(data[step*src->ds_cnt])) {
3570 if (data[step*src->ds_cnt] < dst->vf.val) {
3571 dst->vf.val = data[step*src->ds_cnt];
3572 dst->vf.when = src->start + (step+1)*src->step;
3573 }
3574 }
3575 step++;
3576 }
3577 break;
3578 case VDEF_FIRST:
3579 /* The time value returned here is one step before the
3580 * actual time value. This is the start of the first
3581 * non-NaN interval.
3582 */
3583 step=0;
3584 while (step != steps && isnan(data[step*src->ds_cnt])) step++;
3585 if (step == steps) { /* all entries were NaN */
3586 dst->vf.val = DNAN;
3587 dst->vf.when = 0;
3588 } else {
3589 dst->vf.val = data[step*src->ds_cnt];
3590 dst->vf.when = src->start + step*src->step;
3591 }
3592 break;
3593 case VDEF_LAST:
3594 /* The time value returned here is the
3595 * actual time value. This is the end of the last
3596 * non-NaN interval.
3597 */
3598 step=steps-1;
3599 while (step >= 0 && isnan(data[step*src->ds_cnt])) step--;
3600 if (step < 0) { /* all entries were NaN */
3601 dst->vf.val = DNAN;
3602 dst->vf.when = 0;
3603 } else {
3604 dst->vf.val = data[step*src->ds_cnt];
3605 dst->vf.when = src->start + (step+1)*src->step;
3606 }
3607 break;
3608 case VDEF_LSLSLOPE:
3609 case VDEF_LSLINT:
3610 case VDEF_LSLCORREL:{
3611 /* Bestfit line by linear least squares method */
3613 int cnt=0;
3614 double SUMx, SUMy, SUMxy, SUMxx, SUMyy, slope, y_intercept, correl ;
3615 SUMx = 0; SUMy = 0; SUMxy = 0; SUMxx = 0; SUMyy = 0;
3617 for (step=0;step<steps;step++) {
3618 if (finite(data[step*src->ds_cnt])) {
3619 cnt++;
3620 SUMx += step;
3621 SUMxx += step * step;
3622 SUMxy += step * data[step*src->ds_cnt];
3623 SUMy += data[step*src->ds_cnt];
3624 SUMyy += data[step*src->ds_cnt]*data[step*src->ds_cnt];
3625 };
3626 }
3628 slope = ( SUMx*SUMy - cnt*SUMxy ) / ( SUMx*SUMx - cnt*SUMxx );
3629 y_intercept = ( SUMy - slope*SUMx ) / cnt;
3630 correl = (SUMxy - (SUMx*SUMy)/cnt) / sqrt((SUMxx - (SUMx*SUMx)/cnt)*(SUMyy - (SUMy*SUMy)/cnt));
3632 if (cnt) {
3633 if (dst->vf.op == VDEF_LSLSLOPE) {
3634 dst->vf.val = slope;
3635 dst->vf.when = cnt*src->step;
3636 } else if (dst->vf.op == VDEF_LSLINT) {
3637 dst->vf.val = y_intercept;
3638 dst->vf.when = cnt*src->step;
3639 } else if (dst->vf.op == VDEF_LSLCORREL) {
3640 dst->vf.val = correl;
3641 dst->vf.when = cnt*src->step;
3642 };
3644 } else {
3645 dst->vf.val = DNAN;
3646 dst->vf.when = 0;
3647 }
3648 }
3649 break;
3650 }
3651 return 0;
3652 }
3654 /* NaN < -INF < finite_values < INF */
3655 int
3656 vdef_percent_compar(a,b)
3657 const void *a,*b;
3658 {
3659 /* Equality is not returned; this doesn't hurt except
3660 * (maybe) for a little performance.
3661 */
3663 /* First catch NaN values. They are smallest */
3664 if (isnan( *(double *)a )) return -1;
3665 if (isnan( *(double *)b )) return 1;
3667 /* NaN doesn't reach this part so INF and -INF are extremes.
3668 * The sign from isinf() is compatible with the sign we return
3669 */
3670 if (isinf( *(double *)a )) return isinf( *(double *)a );
3671 if (isinf( *(double *)b )) return isinf( *(double *)b );
3673 /* If we reach this, both values must be finite */
3674 if ( *(double *)a < *(double *)b ) return -1; else return 1;
3675 }