1 /****************************************************************************
2 * RRDtool 1.2.15 Copyright by Tobi Oetiker, 1997-2006
3 ****************************************************************************
4 * rrd_rpncalc.c RPN calculator functions
5 ****************************************************************************/
8 #include "rrd_rpncalc.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)
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);
29 *rpnc = (rpn_cdefds_t *) calloc(*count,sizeof(rpn_cdefds_t));
30 for (i = 0; rpnp[i].op != OP_END; i++)
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) {
38 "constants must be integers in the interval (%d, %d)",
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;
49 /* terminate the sequence */
50 (*rpnc)[(*count) - 1].op = OP_END;
54 rpnp_t * rpn_expand(rpn_cdefds_t *rpnc)
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)
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;
73 /* terminate the sequence */
78 /* rpn_compact2str: convert a compact sequence of RPN operator nodes back
79 * into a CDEF string. This function is used by rrd_dump.
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
86 void rpn_compact2str(rpn_cdefds_t *rpnc,ds_def_t *ds_def,char **str)
88 unsigned short i,offset = 0;
89 char buffer[7]; /* short as a string */
91 for (i = 0; rpnc[i].op != OP_END; i++)
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);
103 sprintf(buffer,"%d",rpnc[i].val);
105 add_op(OP_NUMBER,buffer)
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)
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)
120 #define add_op(VV,VVV) \
121 if (addop2str(rpnc[i].op, VV, #VVV, str, &offset) == 1) continue;
131 add_op(OP_FLOOR,FLOOR)
145 add_op(OP_LIMIT,LIMIT)
148 add_op(OP_NEGINF,NEGINF)
152 add_op(OP_ISINF,ISINF)
154 add_op(OP_LTIME,LTIME)
156 add_op(OP_ATAN2,ATAN2)
161 add_op(OP_TREND,TREND)
162 add_op(OP_RAD2DEG,RAD2DEG)
163 add_op(OP_DEG2RAD,DEG2RAD)
167 (*str)[offset] = '\0';
171 short addop2str(enum op_en op, enum op_en op_type, char *op_str,
172 char **result_str, unsigned short *offset)
176 op_len = strlen(op_str);
177 *result_str = (char *) rrd_realloc(*result_str,
178 (op_len + 1 + *offset)*sizeof(char));
179 if (*result_str == NULL) {
180 rrd_set_error("failed to alloc memory in addop2str");
183 strncpy(&((*result_str)[*offset]),op_str,op_len);
190 void parseCDEF_DS(char *def,rrd_t *rrd, int ds_idx)
193 rpn_cdefds_t *rpnc = NULL;
196 rpnp = rpn_parse((void*) rrd, def, &lookup_DS);
198 rrd_set_error("failed to parse computed data source");
201 /* Check for OP nodes not permitted in COMPUTE DS.
202 * Moved this check from within rpn_compact() because it really is
203 * COMPUTE DS specific. This is less efficient, but creation doesn't
204 * occur too often. */
205 for (i = 0; rpnp[i].op != OP_END; i++) {
206 if (rpnp[i].op == OP_TIME || rpnp[i].op == OP_LTIME ||
207 rpnp[i].op == OP_PREV || rpnp[i].op == OP_COUNT)
210 "operators time, ltime, prev and count not supported with DS COMPUTE");
215 if (rpn_compact(rpnp,&rpnc,&count) == -1) {
219 /* copy the compact rpn representation over the ds_def par array */
220 memcpy((void*) &(rrd -> ds_def[ds_idx].par[DS_cdef]),
221 (void*) rpnc, count*sizeof(rpn_cdefds_t));
226 /* lookup a data source name in the rrd struct and return the index,
227 * should use ds_match() here except:
228 * (1) need a void * pointer to the rrd
229 * (2) error handling is left to the caller
231 long lookup_DS(void *rrd_vptr,char *ds_name)
236 rrd = (rrd_t *) rrd_vptr;
238 for (i = 0; i < rrd -> stat_head -> ds_cnt; ++i)
240 if(strcmp(ds_name,rrd -> ds_def[i].ds_nam) == 0)
243 /* the caller handles a bad data source name in the rpn string */
247 /* rpn_parse : parse a string and generate a rpnp array; modified
248 * str2rpn() originally included in rrd_graph.c
250 * key_hash: a transparent argument passed to lookup(); conceptually this
251 * is a hash object for lookup of a numeric key given a variable name
252 * expr: the string RPN expression, including variable names
253 * lookup(): a function that retrieves a numeric key given a variable name
256 rpn_parse(void *key_hash,const char *const expr_const,long (*lookup)(void *,char*)){
261 char vname[MAX_VNAME_LEN+10];
264 expr=(char *)expr_const;
267 if ((rpnp = (rpnp_t *) rrd_realloc(rpnp, (++steps + 2)*
268 sizeof(rpnp_t)))==NULL){
272 else if((sscanf(expr,"%lf%n",&rpnp[steps].val,&pos) == 1) && (expr[pos] == ',')){
273 rpnp[steps].op = OP_NUMBER;
277 #define match_op(VV,VVV) \
278 else if (strncmp(expr, #VVV, strlen(#VVV))==0 && ( expr[strlen(#VVV)] == ',' || expr[strlen(#VVV)] == '\0' )){ \
279 rpnp[steps].op = VV; \
280 expr+=strlen(#VVV); \
284 #define match_op_param(VV,VVV) \
285 else if (sscanf(expr, #VVV "(" DEF_NAM_FMT ")",vname) == 1) { \
287 if ((length = strlen(#VVV)+strlen(vname)+2, \
288 expr[length] == ',' || expr[length] == '\0') ) { \
289 rpnp[steps].op = VV; \
290 rpnp[steps].ptr = (*lookup)(key_hash,vname); \
291 if (rpnp[steps].ptr < 0) { \
294 } else expr+=length; \
306 match_op(OP_FLOOR,FLOOR)
307 match_op(OP_CEIL,CEIL)
312 match_op(OP_LTIME,LTIME)
321 match_op(OP_LIMIT,LIMIT)
322 /* order is important here ! .. match longest first */
323 match_op(OP_UNKN,UNKN)
325 match_op(OP_NEGINF,NEGINF)
327 match_op(OP_COUNT,COUNT)
328 match_op_param(OP_PREV_OTHER,PREV)
329 match_op(OP_PREV,PREV)
331 match_op(OP_ISINF,ISINF)
333 match_op(OP_TIME,TIME)
334 match_op(OP_ATAN2,ATAN2)
335 match_op(OP_ATAN,ATAN)
336 match_op(OP_SQRT,SQRT)
337 match_op(OP_SORT,SORT)
339 match_op(OP_TREND,TREND)
340 match_op(OP_RAD2DEG,RAD2DEG)
341 match_op(OP_DEG2RAD,DEG2RAD)
346 else if ((sscanf(expr, DEF_NAM_FMT "%n",
348 && ((rpnp[steps].ptr = (*lookup)(key_hash,vname)) != -1)){
349 rpnp[steps].op = OP_VARIABLE;
366 rpnp[steps+1].op = OP_END;
371 rpnstack_init(rpnstack_t *rpnstack)
373 rpnstack -> s = NULL;
374 rpnstack -> dc_stacksize = 0;
375 rpnstack -> dc_stackblock = 100;
379 rpnstack_free(rpnstack_t *rpnstack)
381 if (rpnstack -> s != NULL)
383 rpnstack -> dc_stacksize = 0;
387 rpn_compare_double(const void *x, const void *y)
389 double diff = *((const double *)x) - *((const double *)y);
391 return (diff < 0) ? -1 : (diff > 0) ? 1 : 0;
394 /* rpn_calc: run the RPN calculator; also performs variable substitution;
395 * moved and modified from data_calc() originally included in rrd_graph.c
397 * rpnp : an array of RPN operators (including variable references)
398 * rpnstack : the initialized stack
399 * data_idx : when data_idx is a multiple of rpnp.step, the rpnp.data pointer
400 * is advanced by rpnp.ds_cnt; used only for variable substitution
401 * output : an array of output values; OP_PREV assumes this array contains
402 * the "previous" value at index position output_idx-1; the definition of
403 * "previous" depends on the calling environment
404 * output_idx : an index into the output array in which to store the output
405 * of the RPN calculator
406 * returns: -1 if the computation failed (also calls rrd_set_error)
410 rpn_calc(rpnp_t *rpnp, rpnstack_t *rpnstack, long data_idx,
411 rrd_value_t *output, int output_idx)
416 /* process each op from the rpn in turn */
417 for (rpi=0; rpnp[rpi].op != OP_END; rpi++){
418 /* allocate or grow the stack */
419 if (stptr + 5 > rpnstack -> dc_stacksize){
420 /* could move this to a separate function */
421 rpnstack -> dc_stacksize += rpnstack -> dc_stackblock;
422 rpnstack -> s = rrd_realloc(rpnstack -> s,
423 (rpnstack -> dc_stacksize)*sizeof(*(rpnstack -> s)));
424 if (rpnstack -> s == NULL){
425 rrd_set_error("RPN stack overflow");
430 #define stackunderflow(MINSIZE) \
432 rrd_set_error("RPN stack underflow"); \
436 switch (rpnp[rpi].op){
438 rpnstack -> s[++stptr] = rpnp[rpi].val;
442 /* Sanity check: VDEFs shouldn't make it here */
443 if (rpnp[rpi].ds_cnt == 0) {
444 rrd_set_error("VDEF made it into rpn_calc... aborting");
447 /* make sure we pull the correct value from
448 * the *.data array. Adjust the pointer into
449 * the array acordingly. Advance the ptr one
450 * row in the rra (skip over non-relevant
453 if (rpnp[rpi].op == OP_VARIABLE) {
454 rpnstack -> s[++stptr] = *(rpnp[rpi].data);
456 if ((output_idx) <= 0) {
457 rpnstack -> s[++stptr] = DNAN;
459 rpnstack -> s[++stptr] = *(rpnp[rpi].data-rpnp[rpi].ds_cnt);
463 if (data_idx % rpnp[rpi].step == 0){
464 rpnp[rpi].data += rpnp[rpi].ds_cnt;
469 rpnstack -> s[++stptr] = (output_idx+1); /* Note: Counter starts at 1 */
472 if ((output_idx) <= 0) {
473 rpnstack -> s[++stptr] = DNAN;
475 rpnstack -> s[++stptr] = output[output_idx-1];
479 rpnstack -> s[++stptr] = DNAN;
482 rpnstack -> s[++stptr] = DINF;
485 rpnstack -> s[++stptr] = -DINF;
488 rpnstack -> s[++stptr] = (double)time(NULL);
491 /* HACK: this relies on the data_idx being the time,
492 ** which the within-function scope is unaware of */
493 rpnstack -> s[++stptr] = (double) data_idx;
496 rpnstack -> s[++stptr] =
497 (double) tzoffset(data_idx) + (double)data_idx;
501 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
502 + rpnstack -> s[stptr];
507 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
508 - rpnstack -> s[stptr];
513 rpnstack -> s[stptr-1] = (rpnstack -> s[stptr-1])
514 * (rpnstack -> s[stptr]);
519 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
520 / rpnstack -> s[stptr];
525 rpnstack -> s[stptr-1]= fmod( rpnstack -> s[stptr-1]
526 ,rpnstack -> s[stptr]);
531 rpnstack -> s[stptr] = sin(rpnstack -> s[stptr]);
535 rpnstack -> s[stptr] = atan(rpnstack -> s[stptr]);
539 rpnstack -> s[stptr] = 57.29577951 * rpnstack -> s[stptr];
543 rpnstack -> s[stptr] = 0.0174532952 * rpnstack -> s[stptr];
547 rpnstack -> s[stptr-1]= atan2(
548 rpnstack -> s[stptr-1],
549 rpnstack -> s[stptr]);
554 rpnstack -> s[stptr] = cos(rpnstack -> s[stptr]);
558 rpnstack -> s[stptr] = ceil(rpnstack -> s[stptr]);
562 rpnstack -> s[stptr] = floor(rpnstack -> s[stptr]);
566 rpnstack -> s[stptr] = log(rpnstack -> s[stptr]);
570 rpnstack -> s[stptr+1] = rpnstack -> s[stptr];
581 dummy = rpnstack -> s[stptr] ;
582 rpnstack -> s[stptr] = rpnstack -> s[stptr-1];
583 rpnstack -> s[stptr-1] = dummy;
588 rpnstack -> s[stptr] = exp(rpnstack -> s[stptr]);
592 if (isnan(rpnstack -> s[stptr-1]))
594 else if (isnan(rpnstack -> s[stptr]))
595 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
597 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] <
598 rpnstack -> s[stptr] ? 1.0 : 0.0;
603 if (isnan(rpnstack -> s[stptr-1]))
605 else if (isnan(rpnstack -> s[stptr]))
606 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
608 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] <=
609 rpnstack -> s[stptr] ? 1.0 : 0.0;
614 if (isnan(rpnstack -> s[stptr-1]))
616 else if (isnan(rpnstack -> s[stptr]))
617 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
619 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] >
620 rpnstack -> s[stptr] ? 1.0 : 0.0;
625 if (isnan(rpnstack -> s[stptr-1]))
627 else if (isnan(rpnstack -> s[stptr]))
628 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
630 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] >=
631 rpnstack -> s[stptr] ? 1.0 : 0.0;
636 if (isnan(rpnstack -> s[stptr-1]))
638 else if (isnan(rpnstack -> s[stptr]))
639 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
641 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] ==
642 rpnstack -> s[stptr] ? 0.0 : 1.0;
647 if (isnan(rpnstack -> s[stptr-1]))
649 else if (isnan(rpnstack -> s[stptr]))
650 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
652 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] ==
653 rpnstack -> s[stptr] ? 1.0 : 0.0;
658 rpnstack->s[stptr-2] = rpnstack->s[stptr-2] != 0.0 ?
659 rpnstack->s[stptr-1] : rpnstack->s[stptr];
665 if (isnan(rpnstack->s[stptr-1]))
667 else if (isnan(rpnstack->s[stptr]))
668 rpnstack->s[stptr-1] = rpnstack->s[stptr];
669 else if (rpnstack->s[stptr-1] > rpnstack->s[stptr])
670 rpnstack->s[stptr-1] = rpnstack->s[stptr];
675 if (isnan(rpnstack->s[stptr-1]))
677 else if (isnan(rpnstack->s[stptr]))
678 rpnstack->s[stptr-1] = rpnstack->s[stptr];
679 else if (rpnstack->s[stptr-1] < rpnstack->s[stptr])
680 rpnstack->s[stptr-1] = rpnstack->s[stptr];
685 if (isnan(rpnstack->s[stptr-2]))
687 else if (isnan(rpnstack->s[stptr-1]))
688 rpnstack->s[stptr-2] = rpnstack->s[stptr-1];
689 else if (isnan(rpnstack->s[stptr]))
690 rpnstack->s[stptr-2] = rpnstack->s[stptr];
691 else if (rpnstack->s[stptr-2] < rpnstack->s[stptr-1])
692 rpnstack->s[stptr-2] = DNAN;
693 else if (rpnstack->s[stptr-2] > rpnstack->s[stptr])
694 rpnstack->s[stptr-2] = DNAN;
699 rpnstack->s[stptr] = isnan(rpnstack->s[stptr]) ? 1.0 : 0.0;
703 rpnstack->s[stptr] = isinf(rpnstack->s[stptr]) ? 1.0 : 0.0;
707 rpnstack -> s[stptr] = sqrt(rpnstack -> s[stptr]);
712 int spn = (int)rpnstack -> s[stptr--];
714 stackunderflow(spn-1);
715 qsort(rpnstack -> s + stptr-spn+1, spn, sizeof(double),
722 int spn = (int)rpnstack -> s[stptr--];
725 stackunderflow(spn-1);
727 p = rpnstack -> s + stptr-spn+1;
728 q = rpnstack -> s + stptr;
739 if ((rpi < 2) || (rpnp[rpi-2].op != OP_VARIABLE)) {
740 rrd_set_error("malformed trend arguments");
743 time_t dur = (time_t)rpnstack -> s[stptr];
744 time_t step = (time_t)rpnp[rpi-2].step;
746 if (output_idx > (int)ceil((float)dur / (float)step)) {
751 accum += rpnp[rpi-2].data[rpnp[rpi-2].ds_cnt * i--];
755 rpnstack -> s[--stptr] = (accum / -i);
757 rpnstack -> s[--stptr] = DNAN;
763 int i=rpnstack -> s[stptr--];
768 double val=rpnstack -> s[stptr--];
770 if (isnan(val)) { continue; }
774 // now push the result bavk on stack
776 rpnstack -> s[++stptr]=sum/count;
778 rpnstack -> s[++stptr]=DNAN;
785 #undef stackunderflow
788 rrd_set_error("RPN final stack size != 1");
792 output[output_idx] = rpnstack->s[0];
796 /* figure out what the local timezone offset for any point in
797 time was. Return it in seconds */
799 tzoffset( time_t now ){
800 int gm_sec, gm_min, gm_hour, gm_yday, gm_year,
801 l_sec, l_min, l_hour, l_yday, l_year;
810 localtime_r(&now, &t);
816 off = (l_sec-gm_sec)+(l_min-gm_min)*60+(l_hour-gm_hour)*3600;
817 if ( l_yday > gm_yday || l_year > gm_year){
819 } else if ( l_yday < gm_yday || l_year < gm_year){