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