1 /****************************************************************************
2 * RRDtool 1.3.9 Copyright by Tobi Oetiker, 1997-2009
3 ****************************************************************************
4 * rrd_rpncalc.c RPN calculator functions
5 ****************************************************************************/
7 #include "rrd_tool.h"
8 #include "rrd_rpncalc.h"
9 // #include "rrd_graph.h"
10 #include <limits.h>
11 #include <locale.h>
13 #ifdef WIN32
14 #include <stdlib.h>
15 #endif
17 short addop2str(
18 enum op_en op,
19 enum op_en op_type,
20 char *op_str,
21 char **result_str,
22 unsigned short *offset);
23 int tzoffset(
24 time_t); /* used to implement LTIME */
26 short rpn_compact(
27 rpnp_t *rpnp,
28 rpn_cdefds_t **rpnc,
29 short *count)
30 {
31 short i;
33 *count = 0;
34 /* count the number of rpn nodes */
35 while (rpnp[*count].op != OP_END)
36 (*count)++;
37 if (++(*count) > DS_CDEF_MAX_RPN_NODES) {
38 rrd_set_error("Maximum %d RPN nodes permitted",
39 DS_CDEF_MAX_RPN_NODES);
40 return -1;
41 }
43 /* allocate memory */
44 *rpnc = (rpn_cdefds_t *) calloc(*count, sizeof(rpn_cdefds_t));
45 for (i = 0; rpnp[i].op != OP_END; i++) {
46 (*rpnc)[i].op = (char) rpnp[i].op;
47 if (rpnp[i].op == OP_NUMBER) {
48 /* rpnp.val is a double, rpnc.val is a short */
49 double temp = floor(rpnp[i].val);
51 if (temp < SHRT_MIN || temp > SHRT_MAX) {
52 rrd_set_error
53 ("constants must be integers in the interval (%d, %d)",
54 SHRT_MIN, SHRT_MAX);
55 free(*rpnc);
56 return -1;
57 }
58 (*rpnc)[i].val = (short) temp;
59 } else if (rpnp[i].op == OP_VARIABLE || rpnp[i].op == OP_PREV_OTHER) {
60 (*rpnc)[i].val = (short) rpnp[i].ptr;
61 }
62 }
63 /* terminate the sequence */
64 (*rpnc)[(*count) - 1].op = OP_END;
65 return 0;
66 }
68 rpnp_t *rpn_expand(
69 rpn_cdefds_t *rpnc)
70 {
71 short i;
72 rpnp_t *rpnp;
74 /* DS_CDEF_MAX_RPN_NODES is small, so at the expense of some wasted
75 * memory we avoid any reallocs */
76 rpnp = (rpnp_t *) calloc(DS_CDEF_MAX_RPN_NODES, sizeof(rpnp_t));
77 if (rpnp == NULL) {
78 rrd_set_error("failed allocating rpnp array");
79 return NULL;
80 }
81 for (i = 0; rpnc[i].op != OP_END; ++i) {
82 rpnp[i].op = (enum op_en) rpnc[i].op;
83 if (rpnp[i].op == OP_NUMBER) {
84 rpnp[i].val = (double) rpnc[i].val;
85 } else if (rpnp[i].op == OP_VARIABLE || rpnp[i].op == OP_PREV_OTHER) {
86 rpnp[i].ptr = (long) rpnc[i].val;
87 }
88 }
89 /* terminate the sequence */
90 rpnp[i].op = OP_END;
91 return rpnp;
92 }
94 /* rpn_compact2str: convert a compact sequence of RPN operator nodes back
95 * into a CDEF string. This function is used by rrd_dump.
96 * arguments:
97 * rpnc: an array of compact RPN operator nodes
98 * ds_def: a pointer to the data source definition section of an RRD header
99 * for lookup of data source names by index
100 * str: out string, memory is allocated by the function, must be freed by the
101 * the caller */
102 void rpn_compact2str(
103 rpn_cdefds_t *rpnc,
104 ds_def_t *ds_def,
105 char **str)
106 {
107 unsigned short i, offset = 0;
108 char buffer[7]; /* short as a string */
110 for (i = 0; rpnc[i].op != OP_END; i++) {
111 if (i > 0)
112 (*str)[offset++] = ',';
114 #define add_op(VV,VVV) \
115 if (addop2str((enum op_en)(rpnc[i].op), VV, VVV, str, &offset) == 1) continue;
117 if (rpnc[i].op == OP_NUMBER) {
118 /* convert a short into a string */
119 #if defined(_WIN32) && !defined(__CYGWIN__) && !defined(__CYGWIN32__)
120 _itoa(rpnc[i].val, buffer, 10);
121 #else
122 sprintf(buffer, "%d", rpnc[i].val);
123 #endif
124 add_op(OP_NUMBER, buffer)
125 }
127 if (rpnc[i].op == OP_VARIABLE) {
128 char *ds_name = ds_def[rpnc[i].val].ds_nam;
130 add_op(OP_VARIABLE, ds_name)
131 }
133 if (rpnc[i].op == OP_PREV_OTHER) {
134 char *ds_name = ds_def[rpnc[i].val].ds_nam;
136 add_op(OP_VARIABLE, ds_name)
137 }
138 #undef add_op
140 #define add_op(VV,VVV) \
141 if (addop2str((enum op_en)rpnc[i].op, VV, #VVV, str, &offset) == 1) continue;
143 add_op(OP_ADD, +)
144 add_op(OP_SUB, -)
145 add_op(OP_MUL, *)
146 add_op(OP_DIV, /)
147 add_op(OP_MOD, %)
148 add_op(OP_SIN, SIN)
149 add_op(OP_COS, COS)
150 add_op(OP_LOG, LOG)
151 add_op(OP_FLOOR, FLOOR)
152 add_op(OP_CEIL, CEIL)
153 add_op(OP_EXP, EXP)
154 add_op(OP_DUP, DUP)
155 add_op(OP_EXC, EXC)
156 add_op(OP_POP, POP)
157 add_op(OP_LT, LT)
158 add_op(OP_LE, LE)
159 add_op(OP_GT, GT)
160 add_op(OP_GE, GE)
161 add_op(OP_EQ, EQ)
162 add_op(OP_IF, IF)
163 add_op(OP_MIN, MIN)
164 add_op(OP_MAX, MAX)
165 add_op(OP_LIMIT, LIMIT)
166 add_op(OP_UNKN, UNKN)
167 add_op(OP_UN, UN)
168 add_op(OP_NEGINF, NEGINF)
169 add_op(OP_NE, NE)
170 add_op(OP_PREV, PREV)
171 add_op(OP_INF, INF)
172 add_op(OP_ISINF, ISINF)
173 add_op(OP_NOW, NOW)
174 add_op(OP_LTIME, LTIME)
175 add_op(OP_TIME, TIME)
176 add_op(OP_ATAN2, ATAN2)
177 add_op(OP_ATAN, ATAN)
178 add_op(OP_SQRT, SQRT)
179 add_op(OP_SORT, SORT)
180 add_op(OP_REV, REV)
181 add_op(OP_TREND, TREND)
182 add_op(OP_TRENDNAN, TRENDNAN)
183 add_op(OP_RAD2DEG, RAD2DEG)
184 add_op(OP_DEG2RAD, DEG2RAD)
185 add_op(OP_AVG, AVG)
186 add_op(OP_ABS, ABS)
187 add_op(OP_ADDNAN, ADDNAN)
188 #undef add_op
189 }
190 (*str)[offset] = '\0';
192 }
194 short addop2str(
195 enum op_en op,
196 enum op_en op_type,
197 char *op_str,
198 char **result_str,
199 unsigned short *offset)
200 {
201 if (op == op_type) {
202 short op_len;
204 op_len = strlen(op_str);
205 *result_str = (char *) rrd_realloc(*result_str,
206 (op_len + 1 +
207 *offset) * sizeof(char));
208 if (*result_str == NULL) {
209 rrd_set_error("failed to alloc memory in addop2str");
210 return -1;
211 }
212 strncpy(&((*result_str)[*offset]), op_str, op_len);
213 *offset += op_len;
214 return 1;
215 }
216 return 0;
217 }
219 void parseCDEF_DS(
220 const char *def,
221 rrd_t *rrd,
222 int ds_idx)
223 {
224 rpnp_t *rpnp = NULL;
225 rpn_cdefds_t *rpnc = NULL;
226 short count, i;
228 rpnp = rpn_parse((void *) rrd, def, &lookup_DS);
229 if (rpnp == NULL) {
230 rrd_set_error("failed to parse computed data source");
231 return;
232 }
233 /* Check for OP nodes not permitted in COMPUTE DS.
234 * Moved this check from within rpn_compact() because it really is
235 * COMPUTE DS specific. This is less efficient, but creation doesn't
236 * occur too often. */
237 for (i = 0; rpnp[i].op != OP_END; i++) {
238 if (rpnp[i].op == OP_TIME || rpnp[i].op == OP_LTIME ||
239 rpnp[i].op == OP_PREV || rpnp[i].op == OP_COUNT) {
240 rrd_set_error
241 ("operators time, ltime, prev and count not supported with DS COMPUTE");
242 free(rpnp);
243 return;
244 }
245 }
246 if (rpn_compact(rpnp, &rpnc, &count) == -1) {
247 free(rpnp);
248 return;
249 }
250 /* copy the compact rpn representation over the ds_def par array */
251 memcpy((void *) &(rrd->ds_def[ds_idx].par[DS_cdef]),
252 (void *) rpnc, count * sizeof(rpn_cdefds_t));
253 free(rpnp);
254 free(rpnc);
255 }
257 /* lookup a data source name in the rrd struct and return the index,
258 * should use ds_match() here except:
259 * (1) need a void * pointer to the rrd
260 * (2) error handling is left to the caller
261 */
262 long lookup_DS(
263 void *rrd_vptr,
264 char *ds_name)
265 {
266 unsigned int i;
267 rrd_t *rrd;
269 rrd = (rrd_t *) rrd_vptr;
271 for (i = 0; i < rrd->stat_head->ds_cnt; ++i) {
272 if (strcmp(ds_name, rrd->ds_def[i].ds_nam) == 0)
273 return i;
274 }
275 /* the caller handles a bad data source name in the rpn string */
276 return -1;
277 }
279 /* rpn_parse : parse a string and generate a rpnp array; modified
280 * str2rpn() originally included in rrd_graph.c
281 * arguments:
282 * key_hash: a transparent argument passed to lookup(); conceptually this
283 * is a hash object for lookup of a numeric key given a variable name
284 * expr: the string RPN expression, including variable names
285 * lookup(): a function that retrieves a numeric key given a variable name
286 */
287 rpnp_t *rpn_parse(
288 void *key_hash,
289 const char *const expr_const,
290 long (*lookup) (void *,
291 char *))
292 {
293 int pos = 0;
294 char *expr;
295 long steps = -1;
296 rpnp_t *rpnp;
297 char vname[MAX_VNAME_LEN + 10];
298 char *old_locale;
300 old_locale = setlocale(LC_NUMERIC, "C");
302 rpnp = NULL;
303 expr = (char *) expr_const;
305 while (*expr) {
306 if ((rpnp = (rpnp_t *) rrd_realloc(rpnp, (++steps + 2) *
307 sizeof(rpnp_t))) == NULL) {
308 setlocale(LC_NUMERIC, old_locale);
309 return NULL;
310 }
312 else if ((sscanf(expr, "%lf%n", &rpnp[steps].val, &pos) == 1)
313 && (expr[pos] == ',')) {
314 rpnp[steps].op = OP_NUMBER;
315 expr += pos;
316 }
317 #define match_op(VV,VVV) \
318 else if (strncmp(expr, #VVV, strlen(#VVV))==0 && ( expr[strlen(#VVV)] == ',' || expr[strlen(#VVV)] == '\0' )){ \
319 rpnp[steps].op = VV; \
320 expr+=strlen(#VVV); \
321 }
323 #define match_op_param(VV,VVV) \
324 else if (sscanf(expr, #VVV "(" DEF_NAM_FMT ")",vname) == 1) { \
325 int length = 0; \
326 if ((length = strlen(#VVV)+strlen(vname)+2, \
327 expr[length] == ',' || expr[length] == '\0') ) { \
328 rpnp[steps].op = VV; \
329 rpnp[steps].ptr = (*lookup)(key_hash,vname); \
330 if (rpnp[steps].ptr < 0) { \
331 free(rpnp); \
332 return NULL; \
333 } else expr+=length; \
334 } \
335 }
337 match_op(OP_ADD, +)
338 match_op(OP_SUB, -)
339 match_op(OP_MUL, *)
340 match_op(OP_DIV, /)
341 match_op(OP_MOD, %)
342 match_op(OP_SIN, SIN)
343 match_op(OP_COS, COS)
344 match_op(OP_LOG, LOG)
345 match_op(OP_FLOOR, FLOOR)
346 match_op(OP_CEIL, CEIL)
347 match_op(OP_EXP, EXP)
348 match_op(OP_DUP, DUP)
349 match_op(OP_EXC, EXC)
350 match_op(OP_POP, POP)
351 match_op(OP_LTIME, LTIME)
352 match_op(OP_LT, LT)
353 match_op(OP_LE, LE)
354 match_op(OP_GT, GT)
355 match_op(OP_GE, GE)
356 match_op(OP_EQ, EQ)
357 match_op(OP_IF, IF)
358 match_op(OP_MIN, MIN)
359 match_op(OP_MAX, MAX)
360 match_op(OP_LIMIT, LIMIT)
361 /* order is important here ! .. match longest first */
362 match_op(OP_UNKN, UNKN)
363 match_op(OP_UN, UN)
364 match_op(OP_NEGINF, NEGINF)
365 match_op(OP_NE, NE)
366 match_op(OP_COUNT, COUNT)
367 match_op_param(OP_PREV_OTHER, PREV)
368 match_op(OP_PREV, PREV)
369 match_op(OP_INF, INF)
370 match_op(OP_ISINF, ISINF)
371 match_op(OP_NOW, NOW)
372 match_op(OP_TIME, TIME)
373 match_op(OP_ATAN2, ATAN2)
374 match_op(OP_ATAN, ATAN)
375 match_op(OP_SQRT, SQRT)
376 match_op(OP_SORT, SORT)
377 match_op(OP_REV, REV)
378 match_op(OP_TREND, TREND)
379 match_op(OP_TRENDNAN, TRENDNAN)
380 match_op(OP_RAD2DEG, RAD2DEG)
381 match_op(OP_DEG2RAD, DEG2RAD)
382 match_op(OP_AVG, AVG)
383 match_op(OP_ABS, ABS)
384 match_op(OP_ADDNAN, ADDNAN)
385 #undef match_op
386 else if ((sscanf(expr, DEF_NAM_FMT "%n", vname, &pos) == 1)
387 && ((rpnp[steps].ptr = (*lookup) (key_hash, vname)) !=
388 -1)) {
389 rpnp[steps].op = OP_VARIABLE;
390 expr += pos;
391 }
393 else {
394 setlocale(LC_NUMERIC, old_locale);
395 free(rpnp);
396 return NULL;
397 }
399 if (*expr == 0)
400 break;
401 if (*expr == ',')
402 expr++;
403 else {
404 setlocale(LC_NUMERIC, old_locale);
405 free(rpnp);
406 return NULL;
407 }
408 }
409 rpnp[steps + 1].op = OP_END;
410 setlocale(LC_NUMERIC, old_locale);
411 return rpnp;
412 }
414 void rpnstack_init(
415 rpnstack_t *rpnstack)
416 {
417 rpnstack->s = NULL;
418 rpnstack->dc_stacksize = 0;
419 rpnstack->dc_stackblock = 100;
420 }
422 void rpnstack_free(
423 rpnstack_t *rpnstack)
424 {
425 if (rpnstack->s != NULL)
426 free(rpnstack->s);
427 rpnstack->dc_stacksize = 0;
428 }
430 static int rpn_compare_double(
431 const void *x,
432 const void *y)
433 {
434 double diff = *((const double *) x) - *((const double *) y);
436 return (diff < 0) ? -1 : (diff > 0) ? 1 : 0;
437 }
439 /* rpn_calc: run the RPN calculator; also performs variable substitution;
440 * moved and modified from data_calc() originally included in rrd_graph.c
441 * arguments:
442 * rpnp : an array of RPN operators (including variable references)
443 * rpnstack : the initialized stack
444 * data_idx : when data_idx is a multiple of rpnp.step, the rpnp.data pointer
445 * is advanced by rpnp.ds_cnt; used only for variable substitution
446 * output : an array of output values; OP_PREV assumes this array contains
447 * the "previous" value at index position output_idx-1; the definition of
448 * "previous" depends on the calling environment
449 * output_idx : an index into the output array in which to store the output
450 * of the RPN calculator
451 * returns: -1 if the computation failed (also calls rrd_set_error)
452 * 0 on success
453 */
454 short rpn_calc(
455 rpnp_t *rpnp,
456 rpnstack_t *rpnstack,
457 long data_idx,
458 rrd_value_t *output,
459 int output_idx)
460 {
461 int rpi;
462 long stptr = -1;
464 /* process each op from the rpn in turn */
465 for (rpi = 0; rpnp[rpi].op != OP_END; rpi++) {
466 /* allocate or grow the stack */
467 if (stptr + 5 > rpnstack->dc_stacksize) {
468 /* could move this to a separate function */
469 rpnstack->dc_stacksize += rpnstack->dc_stackblock;
470 rpnstack->s = (double*)(rrd_realloc(rpnstack->s,
471 (rpnstack->dc_stacksize) *
472 sizeof(*(rpnstack->s))));
473 if (rpnstack->s == NULL) {
474 rrd_set_error("RPN stack overflow");
475 return -1;
476 }
477 }
478 #define stackunderflow(MINSIZE) \
479 if(stptr<MINSIZE){ \
480 rrd_set_error("RPN stack underflow"); \
481 return -1; \
482 }
484 switch (rpnp[rpi].op) {
485 case OP_NUMBER:
486 rpnstack->s[++stptr] = rpnp[rpi].val;
487 break;
488 case OP_VARIABLE:
489 case OP_PREV_OTHER:
490 /* Sanity check: VDEFs shouldn't make it here */
491 if (rpnp[rpi].ds_cnt == 0) {
492 rrd_set_error("VDEF made it into rpn_calc... aborting");
493 return -1;
494 } else {
495 /* make sure we pull the correct value from
496 * the *.data array. Adjust the pointer into
497 * the array acordingly. Advance the ptr one
498 * row in the rra (skip over non-relevant
499 * data sources)
500 */
501 if (rpnp[rpi].op == OP_VARIABLE) {
502 rpnstack->s[++stptr] = *(rpnp[rpi].data);
503 } else {
504 if ((output_idx) <= 0) {
505 rpnstack->s[++stptr] = DNAN;
506 } else {
507 rpnstack->s[++stptr] =
508 *(rpnp[rpi].data - rpnp[rpi].ds_cnt);
509 }
511 }
512 if (data_idx % rpnp[rpi].step == 0) {
513 rpnp[rpi].data += rpnp[rpi].ds_cnt;
514 }
515 }
516 break;
517 case OP_COUNT:
518 rpnstack->s[++stptr] = (output_idx + 1); /* Note: Counter starts at 1 */
519 break;
520 case OP_PREV:
521 if ((output_idx) <= 0) {
522 rpnstack->s[++stptr] = DNAN;
523 } else {
524 rpnstack->s[++stptr] = output[output_idx - 1];
525 }
526 break;
527 case OP_UNKN:
528 rpnstack->s[++stptr] = DNAN;
529 break;
530 case OP_INF:
531 rpnstack->s[++stptr] = DINF;
532 break;
533 case OP_NEGINF:
534 rpnstack->s[++stptr] = -DINF;
535 break;
536 case OP_NOW:
537 rpnstack->s[++stptr] = (double) time(NULL);
538 break;
539 case OP_TIME:
540 /* HACK: this relies on the data_idx being the time,
541 ** which the within-function scope is unaware of */
542 rpnstack->s[++stptr] = (double) data_idx;
543 break;
544 case OP_LTIME:
545 rpnstack->s[++stptr] =
546 (double) tzoffset(data_idx) + (double) data_idx;
547 break;
548 case OP_ADD:
549 stackunderflow(1);
550 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1]
551 + rpnstack->s[stptr];
552 stptr--;
553 break;
554 case OP_ADDNAN:
555 stackunderflow(1);
556 if (isnan(rpnstack->s[stptr - 1])) {
557 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
558 } else if (isnan(rpnstack->s[stptr])) {
559 /* NOOP */
560 /* rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1]; */
561 } else {
562 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1]
563 + rpnstack->s[stptr];
564 }
566 stptr--;
567 break;
568 case OP_SUB:
569 stackunderflow(1);
570 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1]
571 - rpnstack->s[stptr];
572 stptr--;
573 break;
574 case OP_MUL:
575 stackunderflow(1);
576 rpnstack->s[stptr - 1] = (rpnstack->s[stptr - 1])
577 * (rpnstack->s[stptr]);
578 stptr--;
579 break;
580 case OP_DIV:
581 stackunderflow(1);
582 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1]
583 / rpnstack->s[stptr];
584 stptr--;
585 break;
586 case OP_MOD:
587 stackunderflow(1);
588 rpnstack->s[stptr - 1] = fmod(rpnstack->s[stptr - 1]
589 , rpnstack->s[stptr]);
590 stptr--;
591 break;
592 case OP_SIN:
593 stackunderflow(0);
594 rpnstack->s[stptr] = sin(rpnstack->s[stptr]);
595 break;
596 case OP_ATAN:
597 stackunderflow(0);
598 rpnstack->s[stptr] = atan(rpnstack->s[stptr]);
599 break;
600 case OP_RAD2DEG:
601 stackunderflow(0);
602 rpnstack->s[stptr] = 57.29577951 * rpnstack->s[stptr];
603 break;
604 case OP_DEG2RAD:
605 stackunderflow(0);
606 rpnstack->s[stptr] = 0.0174532952 * rpnstack->s[stptr];
607 break;
608 case OP_ATAN2:
609 stackunderflow(1);
610 rpnstack->s[stptr - 1] = atan2(rpnstack->s[stptr - 1],
611 rpnstack->s[stptr]);
612 stptr--;
613 break;
614 case OP_COS:
615 stackunderflow(0);
616 rpnstack->s[stptr] = cos(rpnstack->s[stptr]);
617 break;
618 case OP_CEIL:
619 stackunderflow(0);
620 rpnstack->s[stptr] = ceil(rpnstack->s[stptr]);
621 break;
622 case OP_FLOOR:
623 stackunderflow(0);
624 rpnstack->s[stptr] = floor(rpnstack->s[stptr]);
625 break;
626 case OP_LOG:
627 stackunderflow(0);
628 rpnstack->s[stptr] = log(rpnstack->s[stptr]);
629 break;
630 case OP_DUP:
631 stackunderflow(0);
632 rpnstack->s[stptr + 1] = rpnstack->s[stptr];
633 stptr++;
634 break;
635 case OP_POP:
636 stackunderflow(0);
637 stptr--;
638 break;
639 case OP_EXC:
640 stackunderflow(1);
641 {
642 double dummy;
644 dummy = rpnstack->s[stptr];
645 rpnstack->s[stptr] = rpnstack->s[stptr - 1];
646 rpnstack->s[stptr - 1] = dummy;
647 }
648 break;
649 case OP_EXP:
650 stackunderflow(0);
651 rpnstack->s[stptr] = exp(rpnstack->s[stptr]);
652 break;
653 case OP_LT:
654 stackunderflow(1);
655 if (isnan(rpnstack->s[stptr - 1]));
656 else if (isnan(rpnstack->s[stptr]))
657 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
658 else
659 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1] <
660 rpnstack->s[stptr] ? 1.0 : 0.0;
661 stptr--;
662 break;
663 case OP_LE:
664 stackunderflow(1);
665 if (isnan(rpnstack->s[stptr - 1]));
666 else if (isnan(rpnstack->s[stptr]))
667 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
668 else
669 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1] <=
670 rpnstack->s[stptr] ? 1.0 : 0.0;
671 stptr--;
672 break;
673 case OP_GT:
674 stackunderflow(1);
675 if (isnan(rpnstack->s[stptr - 1]));
676 else if (isnan(rpnstack->s[stptr]))
677 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
678 else
679 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1] >
680 rpnstack->s[stptr] ? 1.0 : 0.0;
681 stptr--;
682 break;
683 case OP_GE:
684 stackunderflow(1);
685 if (isnan(rpnstack->s[stptr - 1]));
686 else if (isnan(rpnstack->s[stptr]))
687 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
688 else
689 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1] >=
690 rpnstack->s[stptr] ? 1.0 : 0.0;
691 stptr--;
692 break;
693 case OP_NE:
694 stackunderflow(1);
695 if (isnan(rpnstack->s[stptr - 1]));
696 else if (isnan(rpnstack->s[stptr]))
697 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
698 else
699 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1] ==
700 rpnstack->s[stptr] ? 0.0 : 1.0;
701 stptr--;
702 break;
703 case OP_EQ:
704 stackunderflow(1);
705 if (isnan(rpnstack->s[stptr - 1]));
706 else if (isnan(rpnstack->s[stptr]))
707 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
708 else
709 rpnstack->s[stptr - 1] = rpnstack->s[stptr - 1] ==
710 rpnstack->s[stptr] ? 1.0 : 0.0;
711 stptr--;
712 break;
713 case OP_IF:
714 stackunderflow(2);
715 rpnstack->s[stptr - 2] = (isnan(rpnstack->s[stptr - 2])
716 || rpnstack->s[stptr - 2] ==
717 0.0) ? rpnstack->s[stptr] : rpnstack->
718 s[stptr - 1];
719 stptr--;
720 stptr--;
721 break;
722 case OP_MIN:
723 stackunderflow(1);
724 if (isnan(rpnstack->s[stptr - 1]));
725 else if (isnan(rpnstack->s[stptr]))
726 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
727 else if (rpnstack->s[stptr - 1] > rpnstack->s[stptr])
728 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
729 stptr--;
730 break;
731 case OP_MAX:
732 stackunderflow(1);
733 if (isnan(rpnstack->s[stptr - 1]));
734 else if (isnan(rpnstack->s[stptr]))
735 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
736 else if (rpnstack->s[stptr - 1] < rpnstack->s[stptr])
737 rpnstack->s[stptr - 1] = rpnstack->s[stptr];
738 stptr--;
739 break;
740 case OP_LIMIT:
741 stackunderflow(2);
742 if (isnan(rpnstack->s[stptr - 2]));
743 else if (isnan(rpnstack->s[stptr - 1]))
744 rpnstack->s[stptr - 2] = rpnstack->s[stptr - 1];
745 else if (isnan(rpnstack->s[stptr]))
746 rpnstack->s[stptr - 2] = rpnstack->s[stptr];
747 else if (rpnstack->s[stptr - 2] < rpnstack->s[stptr - 1])
748 rpnstack->s[stptr - 2] = DNAN;
749 else if (rpnstack->s[stptr - 2] > rpnstack->s[stptr])
750 rpnstack->s[stptr - 2] = DNAN;
751 stptr -= 2;
752 break;
753 case OP_UN:
754 stackunderflow(0);
755 rpnstack->s[stptr] = isnan(rpnstack->s[stptr]) ? 1.0 : 0.0;
756 break;
757 case OP_ISINF:
758 stackunderflow(0);
759 rpnstack->s[stptr] = isinf(rpnstack->s[stptr]) ? 1.0 : 0.0;
760 break;
761 case OP_SQRT:
762 stackunderflow(0);
763 rpnstack->s[stptr] = sqrt(rpnstack->s[stptr]);
764 break;
765 case OP_SORT:
766 stackunderflow(0);
767 {
768 int spn = (int) rpnstack->s[stptr--];
770 stackunderflow(spn - 1);
771 qsort(rpnstack->s + stptr - spn + 1, spn, sizeof(double),
772 rpn_compare_double);
773 }
774 break;
775 case OP_REV:
776 stackunderflow(0);
777 {
778 int spn = (int) rpnstack->s[stptr--];
779 double *p, *q;
781 stackunderflow(spn - 1);
783 p = rpnstack->s + stptr - spn + 1;
784 q = rpnstack->s + stptr;
785 while (p < q) {
786 double x = *q;
788 *q-- = *p;
789 *p++ = x;
790 }
791 }
792 break;
793 case OP_TREND:
794 case OP_TRENDNAN:
795 stackunderflow(1);
796 if ((rpi < 2) || (rpnp[rpi - 2].op != OP_VARIABLE)) {
797 rrd_set_error("malformed trend arguments");
798 return -1;
799 } else {
800 time_t dur = (time_t) rpnstack->s[stptr];
801 time_t step = (time_t) rpnp[rpi - 2].step;
803 if (output_idx > (int) ceil((float) dur / (float) step)) {
804 int ignorenan = (rpnp[rpi].op == OP_TREND);
805 double accum = 0.0;
806 int i = 0;
807 int count = 0;
809 do {
810 double val =
811 rpnp[rpi - 2].data[rpnp[rpi - 2].ds_cnt * i--];
812 if (ignorenan || !isnan(val)) {
813 accum += val;
814 ++count;
815 }
817 dur -= step;
818 } while (dur > 0);
820 rpnstack->s[--stptr] =
821 (count == 0) ? DNAN : (accum / count);
822 } else
823 rpnstack->s[--stptr] = DNAN;
824 }
825 break;
826 case OP_AVG:
827 stackunderflow(0);
828 {
829 int i = (int) rpnstack->s[stptr--];
830 double sum = 0;
831 int count = 0;
833 stackunderflow(i - 1);
834 while (i > 0) {
835 double val = rpnstack->s[stptr--];
837 i--;
838 if (isnan(val)) {
839 continue;
840 }
841 count++;
842 sum += val;
843 }
844 /* now push the result back on stack */
845 if (count > 0) {
846 rpnstack->s[++stptr] = sum / count;
847 } else {
848 rpnstack->s[++stptr] = DNAN;
849 }
850 }
851 break;
852 case OP_ABS:
853 stackunderflow(0);
854 rpnstack->s[stptr] = fabs(rpnstack->s[stptr]);
855 break;
856 case OP_END:
857 break;
858 }
859 #undef stackunderflow
860 }
861 if (stptr != 0) {
862 rrd_set_error("RPN final stack size != 1");
863 return -1;
864 }
866 output[output_idx] = rpnstack->s[0];
867 return 0;
868 }
870 /* figure out what the local timezone offset for any point in
871 time was. Return it in seconds */
872 int tzoffset(
873 time_t now)
874 {
875 int gm_sec, gm_min, gm_hour, gm_yday, gm_year,
876 l_sec, l_min, l_hour, l_yday, l_year;
877 struct tm t;
878 int off;
880 gmtime_r(&now, &t);
881 gm_sec = t.tm_sec;
882 gm_min = t.tm_min;
883 gm_hour = t.tm_hour;
884 gm_yday = t.tm_yday;
885 gm_year = t.tm_year;
886 localtime_r(&now, &t);
887 l_sec = t.tm_sec;
888 l_min = t.tm_min;
889 l_hour = t.tm_hour;
890 l_yday = t.tm_yday;
891 l_year = t.tm_year;
892 off =
893 (l_sec - gm_sec) + (l_min - gm_min) * 60 + (l_hour - gm_hour) * 3600;
894 if (l_yday > gm_yday || l_year > gm_year) {
895 off += 24 * 3600;
896 } else if (l_yday < gm_yday || l_year < gm_year) {
897 off -= 24 * 3600;
898 }
899 return off;
900 }