1 /****************************************************************************
2 * RRDtool 1.0.28 Copyright Tobias Oetiker, 1997 - 2002
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 #ifdef WIN32
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_ATAN,ATAN)
158 #undef add_op
159 }
160 (*str)[offset] = '\0';
162 }
164 short addop2str(enum op_en op, enum op_en op_type, char *op_str,
165 char **result_str, unsigned short *offset)
166 {
167 if (op == op_type) {
168 short op_len;
169 op_len = strlen(op_str);
170 *result_str = (char *) rrd_realloc(*result_str,
171 (op_len + 1 + *offset)*sizeof(char));
172 if (*result_str == NULL) {
173 rrd_set_error("failed to alloc memory in addop2str");
174 return -1;
175 }
176 strncpy(&((*result_str)[*offset]),op_str,op_len);
177 *offset += op_len;
178 return 1;
179 }
180 return 0;
181 }
183 void parseCDEF_DS(char *def,rrd_t *rrd, int ds_idx)
184 {
185 rpnp_t *rpnp = NULL;
186 rpn_cdefds_t *rpnc = NULL;
187 short count, i;
189 rpnp = rpn_parse((void*) rrd, def, &lookup_DS);
190 if (rpnp == NULL) {
191 rrd_set_error("failed to parse computed data source %s", def);
192 return;
193 }
194 /* Check for OP nodes not permitted in COMPUTE DS.
195 * Moved this check from within rpn_compact() because it really is
196 * COMPUTE DS specific. This is less efficient, but creation doesn't
197 * occur too often. */
198 for (i = 0; rpnp[i].op != OP_END; i++) {
199 if (rpnp[i].op == OP_TIME || rpnp[i].op == OP_LTIME ||
200 rpnp[i].op == OP_PREV || rpnp[i].op == OP_COUNT)
201 {
202 rrd_set_error(
203 "operators time, ltime, prev and count not supported with DS COMPUTE");
204 free(rpnp);
205 return;
206 }
207 }
208 if (rpn_compact(rpnp,&rpnc,&count) == -1) {
209 free(rpnp);
210 return;
211 }
212 /* copy the compact rpn representation over the ds_def par array */
213 memcpy((void*) &(rrd -> ds_def[ds_idx].par[DS_cdef]),
214 (void*) rpnc, count*sizeof(rpn_cdefds_t));
215 free(rpnp);
216 free(rpnc);
217 }
219 /* lookup a data source name in the rrd struct and return the index,
220 * should use ds_match() here except:
221 * (1) need a void * pointer to the rrd
222 * (2) error handling is left to the caller
223 */
224 long lookup_DS(void *rrd_vptr,char *ds_name)
225 {
226 unsigned int i;
227 rrd_t *rrd;
229 rrd = (rrd_t *) rrd_vptr;
231 for (i = 0; i < rrd -> stat_head -> ds_cnt; ++i)
232 {
233 if(strcmp(ds_name,rrd -> ds_def[i].ds_nam) == 0)
234 return i;
235 }
236 /* the caller handles a bad data source name in the rpn string */
237 return -1;
238 }
240 /* rpn_parse : parse a string and generate a rpnp array; modified
241 * str2rpn() originally included in rrd_graph.c
242 * arguments:
243 * key_hash: a transparent argument passed to lookup(); conceptually this
244 * is a hash object for lookup of a numeric key given a variable name
245 * expr: the string RPN expression, including variable names
246 * lookup(): a function that retrieves a numeric key given a variable name
247 */
248 rpnp_t *
249 rpn_parse(void *key_hash,char *expr,long (*lookup)(void *,char*)){
250 int pos=0;
251 long steps=-1;
252 rpnp_t *rpnp;
253 char vname[30];
255 rpnp=NULL;
257 while(*expr){
258 if ((rpnp = (rpnp_t *) rrd_realloc(rpnp, (++steps + 2)*
259 sizeof(rpnp_t)))==NULL){
260 return NULL;
261 }
263 else if((sscanf(expr,"%lf%n",&rpnp[steps].val,&pos) == 1) && (expr[pos] == ',')){
264 rpnp[steps].op = OP_NUMBER;
265 expr+=pos;
266 }
268 #define match_op(VV,VVV) \
269 else if (strncmp(expr, #VVV, strlen(#VVV))==0){ \
270 rpnp[steps].op = VV; \
271 expr+=strlen(#VVV); \
272 }
275 #define match_op_param(VV,VVV) \
276 else if (sscanf(expr, #VVV "(" DEF_NAM_FMT ")",vname) == 1) { \
277 int length = 0; \
278 if ((length = strlen(#VVV)+strlen(vname)+2, \
279 expr[length] == ',' || expr[length] == '\0') ) { \
280 rpnp[steps].op = VV; \
281 rpnp[steps].ptr = (*lookup)(key_hash,vname); \
282 if (rpnp[steps].ptr < 0) { \
283 free(rpnp); \
284 return NULL; \
285 } else expr+=length; \
286 } \
287 }
289 match_op(OP_ADD,+)
290 match_op(OP_SUB,-)
291 match_op(OP_MUL,*)
292 match_op(OP_DIV,/)
293 match_op(OP_MOD,%)
294 match_op(OP_SIN,SIN)
295 match_op(OP_COS,COS)
296 match_op(OP_LOG,LOG)
297 match_op(OP_FLOOR,FLOOR)
298 match_op(OP_CEIL,CEIL)
299 match_op(OP_EXP,EXP)
300 match_op(OP_DUP,DUP)
301 match_op(OP_EXC,EXC)
302 match_op(OP_POP,POP)
303 match_op(OP_LTIME,LTIME)
304 match_op(OP_LT,LT)
305 match_op(OP_LE,LE)
306 match_op(OP_GT,GT)
307 match_op(OP_GE,GE)
308 match_op(OP_EQ,EQ)
309 match_op(OP_IF,IF)
310 match_op(OP_MIN,MIN)
311 match_op(OP_MAX,MAX)
312 match_op(OP_LIMIT,LIMIT)
313 /* order is important here ! .. match longest first */
314 match_op(OP_UNKN,UNKN)
315 match_op(OP_UN,UN)
316 match_op(OP_NEGINF,NEGINF)
317 match_op(OP_NE,NE)
318 match_op(OP_COUNT,COUNT)
319 match_op_param(OP_PREV_OTHER,PREV)
320 match_op(OP_PREV,PREV)
321 match_op(OP_INF,INF)
322 match_op(OP_ISINF,ISINF)
323 match_op(OP_NOW,NOW)
324 match_op(OP_TIME,TIME)
325 match_op(OP_ATAN,ATAN)
327 #undef match_op
330 else if ((sscanf(expr, DEF_NAM_FMT "%n",
331 vname,&pos) == 1)
332 && ((rpnp[steps].ptr = (*lookup)(key_hash,vname)) != -1)){
333 rpnp[steps].op = OP_VARIABLE;
334 expr+=pos;
335 }
337 else {
338 free(rpnp);
339 return NULL;
340 }
341 if (*expr == 0)
342 break;
343 if (*expr == ',')
344 expr++;
345 else {
346 free(rpnp);
347 return NULL;
348 }
349 }
350 rpnp[steps+1].op = OP_END;
351 return rpnp;
352 }
354 void
355 rpnstack_init(rpnstack_t *rpnstack)
356 {
357 rpnstack -> s = NULL;
358 rpnstack -> dc_stacksize = 0;
359 rpnstack -> dc_stackblock = 100;
360 }
362 void
363 rpnstack_free(rpnstack_t *rpnstack)
364 {
365 if (rpnstack -> s != NULL)
366 free(rpnstack -> s);
367 rpnstack -> dc_stacksize = 0;
368 }
370 /* rpn_calc: run the RPN calculator; also performs variable substitution;
371 * moved and modified from data_calc() originally included in rrd_graph.c
372 * arguments:
373 * rpnp : an array of RPN operators (including variable references)
374 * rpnstack : the initialized stack
375 * data_idx : when data_idx is a multiple of rpnp.step, the rpnp.data pointer
376 * is advanced by rpnp.ds_cnt; used only for variable substitution
377 * output : an array of output values; OP_PREV assumes this array contains
378 * the "previous" value at index position output_idx-1; the definition of
379 * "previous" depends on the calling environment
380 * output_idx : an index into the output array in which to store the output
381 * of the RPN calculator
382 * returns: -1 if the computation failed (also calls rrd_set_error)
383 * 0 on success
384 */
385 short
386 rpn_calc(rpnp_t *rpnp, rpnstack_t *rpnstack, long data_idx,
387 rrd_value_t *output, int output_idx)
388 {
389 int rpi;
390 long stptr = -1;
392 /* process each op from the rpn in turn */
393 for (rpi=0; rpnp[rpi].op != OP_END; rpi++){
394 /* allocate or grow the stack */
395 if (stptr + 5 > rpnstack -> dc_stacksize){
396 /* could move this to a separate function */
397 rpnstack -> dc_stacksize += rpnstack -> dc_stackblock;
398 rpnstack -> s = rrd_realloc(rpnstack -> s,
399 (rpnstack -> dc_stacksize)*sizeof(*(rpnstack -> s)));
400 if (rpnstack -> s == NULL){
401 rrd_set_error("RPN stack overflow");
402 return -1;
403 }
404 }
406 #define stackunderflow(MINSIZE) \
407 if(stptr<MINSIZE){ \
408 rrd_set_error("RPN stack underflow"); \
409 return -1; \
410 }
412 switch (rpnp[rpi].op){
413 case OP_NUMBER:
414 rpnstack -> s[++stptr] = rpnp[rpi].val;
415 break;
416 case OP_VARIABLE:
417 /* Sanity check: VDEFs shouldn't make it here */
418 if (rpnp[rpi].ds_cnt == 0) {
419 rrd_set_error("VDEF made it into rpn_calc... aborting");
420 return -1;
421 } else {
422 /* make sure we pull the correct value from
423 * the *.data array. Adjust the pointer into
424 * the array acordingly. Advance the ptr one
425 * row in the rra (skip over non-relevant
426 * data sources)
427 */
428 rpnstack -> s[++stptr] = *(rpnp[rpi].data);
429 if (data_idx % rpnp[rpi].step == 0){
430 rpnp[rpi].data += rpnp[rpi].ds_cnt;
431 }
432 }
433 break;
434 case OP_COUNT:
435 rpnstack -> s[++stptr] = (output_idx+1); /* Note: Counter starts at 1 */
436 break;
437 case OP_PREV:
438 if ((output_idx) <= 0) {
439 rpnstack -> s[++stptr] = DNAN;
440 } else {
441 rpnstack -> s[++stptr] = output[output_idx-1];
442 }
443 break;
444 case OP_PREV_OTHER:
445 if ((output_idx) <= 0) {
446 rpnstack -> s[++stptr] = DNAN;
447 } else {
448 rpnstack -> s[++stptr] = rpnp[rpnp[rpi].ptr].data[output_idx-1];
449 }
450 break;
451 case OP_UNKN:
452 rpnstack -> s[++stptr] = DNAN;
453 break;
454 case OP_INF:
455 rpnstack -> s[++stptr] = DINF;
456 break;
457 case OP_NEGINF:
458 rpnstack -> s[++stptr] = -DINF;
459 break;
460 case OP_NOW:
461 rpnstack -> s[++stptr] = (double)time(NULL);
462 break;
463 case OP_TIME:
464 /* HACK: this relies on the data_idx being the time,
465 ** which the within-function scope is unaware of */
466 rpnstack -> s[++stptr] = (double) data_idx;
467 break;
468 case OP_LTIME:
469 rpnstack -> s[++stptr] =
470 (double) tzoffset(data_idx) + (double)data_idx;
471 break;
472 case OP_ADD:
473 stackunderflow(1);
474 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
475 + rpnstack -> s[stptr];
476 stptr--;
477 break;
478 case OP_SUB:
479 stackunderflow(1);
480 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
481 - rpnstack -> s[stptr];
482 stptr--;
483 break;
484 case OP_MUL:
485 stackunderflow(1);
486 rpnstack -> s[stptr-1] = (rpnstack -> s[stptr-1])
487 * (rpnstack -> s[stptr]);
488 stptr--;
489 break;
490 case OP_DIV:
491 stackunderflow(1);
492 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
493 / rpnstack -> s[stptr];
494 stptr--;
495 break;
496 case OP_MOD:
497 stackunderflow(1);
498 rpnstack -> s[stptr-1]= fmod( rpnstack -> s[stptr-1]
499 ,rpnstack -> s[stptr]);
500 stptr--;
501 break;
502 case OP_SIN:
503 stackunderflow(0);
504 rpnstack -> s[stptr] = sin(rpnstack -> s[stptr]);
505 break;
506 case OP_ATAN:
507 stackunderflow(0);
508 rpnstack -> s[stptr] = atan(rpnstack -> s[stptr]);
509 break;
510 case OP_COS:
511 stackunderflow(0);
512 rpnstack -> s[stptr] = cos(rpnstack -> s[stptr]);
513 break;
514 case OP_CEIL:
515 stackunderflow(0);
516 rpnstack -> s[stptr] = ceil(rpnstack -> s[stptr]);
517 break;
518 case OP_FLOOR:
519 stackunderflow(0);
520 rpnstack -> s[stptr] = floor(rpnstack -> s[stptr]);
521 break;
522 case OP_LOG:
523 stackunderflow(0);
524 rpnstack -> s[stptr] = log(rpnstack -> s[stptr]);
525 break;
526 case OP_DUP:
527 stackunderflow(0);
528 rpnstack -> s[stptr+1] = rpnstack -> s[stptr];
529 stptr++;
530 break;
531 case OP_POP:
532 stackunderflow(0);
533 stptr--;
534 break;
535 case OP_EXC:
536 stackunderflow(1);
537 {
538 double dummy;
539 dummy = rpnstack -> s[stptr] ;
540 rpnstack -> s[stptr] = rpnstack -> s[stptr-1];
541 rpnstack -> s[stptr-1] = dummy;
542 }
543 break;
544 case OP_EXP:
545 stackunderflow(0);
546 rpnstack -> s[stptr] = exp(rpnstack -> s[stptr]);
547 break;
548 case OP_LT:
549 stackunderflow(1);
550 if (isnan(rpnstack -> s[stptr-1]))
551 ;
552 else if (isnan(rpnstack -> s[stptr]))
553 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
554 else
555 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] <
556 rpnstack -> s[stptr] ? 1.0 : 0.0;
557 stptr--;
558 break;
559 case OP_LE:
560 stackunderflow(1);
561 if (isnan(rpnstack -> s[stptr-1]))
562 ;
563 else if (isnan(rpnstack -> s[stptr]))
564 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
565 else
566 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] <=
567 rpnstack -> s[stptr] ? 1.0 : 0.0;
568 stptr--;
569 break;
570 case OP_GT:
571 stackunderflow(1);
572 if (isnan(rpnstack -> s[stptr-1]))
573 ;
574 else if (isnan(rpnstack -> s[stptr]))
575 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
576 else
577 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] >
578 rpnstack -> s[stptr] ? 1.0 : 0.0;
579 stptr--;
580 break;
581 case OP_GE:
582 stackunderflow(1);
583 if (isnan(rpnstack -> s[stptr-1]))
584 ;
585 else if (isnan(rpnstack -> s[stptr]))
586 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
587 else
588 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] >=
589 rpnstack -> s[stptr] ? 1.0 : 0.0;
590 stptr--;
591 break;
592 case OP_NE:
593 stackunderflow(1);
594 if (isnan(rpnstack -> s[stptr-1]))
595 ;
596 else if (isnan(rpnstack -> s[stptr]))
597 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
598 else
599 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] ==
600 rpnstack -> s[stptr] ? 0.0 : 1.0;
601 stptr--;
602 break;
603 case OP_EQ:
604 stackunderflow(1);
605 if (isnan(rpnstack -> s[stptr-1]))
606 ;
607 else if (isnan(rpnstack -> s[stptr]))
608 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
609 else
610 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] ==
611 rpnstack -> s[stptr] ? 1.0 : 0.0;
612 stptr--;
613 break;
614 case OP_IF:
615 stackunderflow(2);
616 rpnstack->s[stptr-2] = rpnstack->s[stptr-2] != 0.0 ?
617 rpnstack->s[stptr-1] : rpnstack->s[stptr];
618 stptr--;
619 stptr--;
620 break;
621 case OP_MIN:
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 if (rpnstack->s[stptr-1] > rpnstack->s[stptr])
628 rpnstack->s[stptr-1] = rpnstack->s[stptr];
629 stptr--;
630 break;
631 case OP_MAX:
632 stackunderflow(1);
633 if (isnan(rpnstack->s[stptr-1]))
634 ;
635 else if (isnan(rpnstack->s[stptr]))
636 rpnstack->s[stptr-1] = rpnstack->s[stptr];
637 else if (rpnstack->s[stptr-1] < rpnstack->s[stptr])
638 rpnstack->s[stptr-1] = rpnstack->s[stptr];
639 stptr--;
640 break;
641 case OP_LIMIT:
642 stackunderflow(2);
643 if (isnan(rpnstack->s[stptr-2]))
644 ;
645 else if (isnan(rpnstack->s[stptr-1]))
646 rpnstack->s[stptr-2] = rpnstack->s[stptr-1];
647 else if (isnan(rpnstack->s[stptr]))
648 rpnstack->s[stptr-2] = rpnstack->s[stptr];
649 else if (rpnstack->s[stptr-2] < rpnstack->s[stptr-1])
650 rpnstack->s[stptr-2] = DNAN;
651 else if (rpnstack->s[stptr-2] > rpnstack->s[stptr])
652 rpnstack->s[stptr-2] = DNAN;
653 stptr-=2;
654 break;
655 case OP_UN:
656 stackunderflow(0);
657 rpnstack->s[stptr] = isnan(rpnstack->s[stptr]) ? 1.0 : 0.0;
658 break;
659 case OP_ISINF:
660 stackunderflow(0);
661 rpnstack->s[stptr] = isinf(rpnstack->s[stptr]) ? 1.0 : 0.0;
662 break;
663 case OP_END:
664 break;
665 }
666 #undef stackunderflow
667 }
668 if(stptr!=0){
669 rrd_set_error("RPN final stack size != 1");
670 return -1;
671 }
673 output[output_idx] = rpnstack->s[0];
674 return 0;
675 }
677 /* figure out what the local timezone offset for any point in
678 time was. Return it in seconds */
679 int
680 tzoffset( time_t now ){
681 int gm_sec, gm_min, gm_hour, gm_yday, gm_year,
682 l_sec, l_min, l_hour, l_yday, l_year;
683 struct tm t;
684 int off;
685 gmtime_r(&now, &t);
686 gm_sec = t.tm_sec;
687 gm_min = t.tm_min;
688 gm_hour = t.tm_hour;
689 gm_yday = t.tm_yday;
690 gm_year = t.tm_year;
691 localtime_r(&now, &t);
692 l_sec = t.tm_sec;
693 l_min = t.tm_min;
694 l_hour = t.tm_hour;
695 l_yday = t.tm_yday;
696 l_year = t.tm_year;
697 off = (l_sec-gm_sec)+(l_min-gm_min)*60+(l_hour-gm_hour)*3600;
698 if ( l_yday > gm_yday || l_year > gm_year){
699 off += 24*3600;
700 } else if ( l_yday < gm_yday || l_year < gm_year){
701 off -= 24*3600;
702 }
703 return off;
704 }