1 /****************************************************************************
2 * RRDtool 1.0.28 Copyright Tobias Oetiker, 1997 - 2002
3 ****************************************************************************
4 * rrd_rpncalc.c RPN calculator functions
5 ****************************************************************************/
8 #include "rrd_rpncalc.h"
11 short addop2str(enum op_en op, enum op_en op_type, char *op_str,
12 char **result_str, unsigned short *offset);
13 int tzoffset(time_t); /* used to implement LTIME */
15 short rpn_compact(rpnp_t *rpnp, rpn_cdefds_t **rpnc, short *count)
19 /* count the number of rpn nodes */
20 while(rpnp[*count].op != OP_END) (*count)++;
21 if (++(*count) > DS_CDEF_MAX_RPN_NODES) {
22 rrd_set_error("Maximum %d RPN nodes permitted",
23 DS_CDEF_MAX_RPN_NODES);
28 *rpnc = (rpn_cdefds_t *) calloc(*count,sizeof(rpn_cdefds_t));
29 for (i = 0; rpnp[i].op != OP_END; i++)
31 (*rpnc)[i].op = (char) rpnp[i].op;
32 if (rpnp[i].op == OP_NUMBER) {
33 /* rpnp.val is a double, rpnc.val is a short */
34 double temp = floor(rpnp[i].val);
35 if (temp < SHRT_MIN || temp > SHRT_MAX) {
37 "constants must be integers in the interval (%d, %d)",
42 (*rpnc)[i].val = (short) temp;
43 } else if (rpnp[i].op == OP_VARIABLE) {
44 (*rpnc)[i].val = (short) rpnp[i].ptr;
47 /* terminate the sequence */
48 (*rpnc)[(*count) - 1].op = OP_END;
52 rpnp_t * rpn_expand(rpn_cdefds_t *rpnc)
57 /* DS_CDEF_MAX_RPN_NODES is small, so at the expense of some wasted
58 * memory we avoid any reallocs */
59 rpnp = (rpnp_t *) calloc(DS_CDEF_MAX_RPN_NODES,sizeof(rpnp_t));
60 if (rpnp == NULL) return NULL;
61 for (i = 0; rpnc[i].op != OP_END; ++i)
63 rpnp[i].op = (long) rpnc[i].op;
64 if (rpnp[i].op == OP_NUMBER) {
65 rpnp[i].val = (double) rpnc[i].val;
66 } else if (rpnp[i].op == OP_VARIABLE) {
67 rpnp[i].ptr = (long) rpnc[i].val;
70 /* terminate the sequence */
75 /* rpn_compact2str: convert a compact sequence of RPN operator nodes back
76 * into a CDEF string. This function is used by rrd_dump.
78 * rpnc: an array of compact RPN operator nodes
79 * ds_def: a pointer to the data source definition section of an RRD header
80 * for lookup of data source names by index
81 * str: out string, memory is allocated by the function, must be freed by the
83 void rpn_compact2str(rpn_cdefds_t *rpnc,ds_def_t *ds_def,char **str)
85 unsigned short i,offset = 0;
86 char buffer[7]; /* short as a string */
88 for (i = 0; rpnc[i].op != OP_END; i++)
90 if (i > 0) (*str)[offset++] = ',';
92 #define add_op(VV,VVV) \
93 if (addop2str(rpnc[i].op, VV, VVV, str, &offset) == 1) continue;
95 if (rpnc[i].op == OP_NUMBER) {
96 /* convert a short into a string */
98 _itoa(rpnc[i].val,buffer,10);
100 sprintf(buffer,"%d",rpnc[i].val);
102 add_op(OP_NUMBER,buffer)
105 if (rpnc[i].op == OP_VARIABLE) {
106 char *ds_name = ds_def[rpnc[i].val].ds_nam;
107 add_op(OP_VARIABLE, ds_name)
111 #define add_op(VV,VVV) \
112 if (addop2str(rpnc[i].op, VV, #VVV, str, &offset) == 1) continue;
122 add_op(OP_FLOOR,FLOOR)
136 add_op(OP_LIMIT,LIMIT)
139 add_op(OP_NEGINF,NEGINF)
143 add_op(OP_ISINF,ISINF)
145 add_op(OP_LTIME,LTIME)
150 (*str)[offset] = '\0';
154 short addop2str(enum op_en op, enum op_en op_type, char *op_str,
155 char **result_str, unsigned short *offset)
159 op_len = strlen(op_str);
160 *result_str = (char *) rrd_realloc(*result_str,
161 (op_len + 1 + *offset)*sizeof(char));
162 if (*result_str == NULL) {
163 rrd_set_error("failed to alloc memory in addop2str");
166 strncpy(&((*result_str)[*offset]),op_str,op_len);
173 void parseCDEF_DS(char *def,rrd_t *rrd, int ds_idx)
176 rpn_cdefds_t *rpnc = NULL;
179 rpnp = rpn_parse((void*) rrd, def, &lookup_DS);
181 rrd_set_error("failed to parse computed data source %s", def);
184 /* Check for OP nodes not permitted in COMPUTE DS.
185 * Moved this check from within rpn_compact() because it really is
186 * COMPUTE DS specific. This is less efficient, but creation doesn't
187 * occur too often. */
188 for (i = 0; rpnp[i].op != OP_END; i++) {
189 if (rpnp[i].op == OP_TIME || rpnp[i].op == OP_LTIME ||
190 rpnp[i].op == OP_PREV)
193 "operators time, ltime and prev not supported with DS COMPUTE");
198 if (rpn_compact(rpnp,&rpnc,&count) == -1) {
202 /* copy the compact rpn representation over the ds_def par array */
203 memcpy((void*) &(rrd -> ds_def[ds_idx].par[DS_cdef]),
204 (void*) rpnc, count*sizeof(rpn_cdefds_t));
209 /* lookup a data source name in the rrd struct and return the index,
210 * should use ds_match() here except:
211 * (1) need a void * pointer to the rrd
212 * (2) error handling is left to the caller
214 long lookup_DS(void *rrd_vptr,char *ds_name)
219 rrd = (rrd_t *) rrd_vptr;
221 for (i = 0; i < rrd -> stat_head -> ds_cnt; ++i)
223 if(strcmp(ds_name,rrd -> ds_def[i].ds_nam) == 0)
226 /* the caller handles a bad data source name in the rpn string */
230 /* rpn_parse : parse a string and generate a rpnp array; modified
231 * str2rpn() originally included in rrd_graph.c
233 * key_hash: a transparent argument passed to lookup(); conceptually this
234 * is a hash object for lookup of a numeric key given a variable name
235 * expr: the string RPN expression, including variable names
236 * lookup(): a function that retrieves a numeric key given a variable name
239 rpn_parse(void *key_hash,char *expr,long (*lookup)(void *,char*)){
248 if ((rpnp = (rpnp_t *) rrd_realloc(rpnp, (++steps + 2)*
249 sizeof(rpnp_t)))==NULL){
253 else if((sscanf(expr,"%lf%n",&rpnp[steps].val,&pos) == 1) && (expr[pos] == ',')){
254 rpnp[steps].op = OP_NUMBER;
258 #define match_op(VV,VVV) \
259 else if (strncmp(expr, #VVV, strlen(#VVV))==0){ \
260 rpnp[steps].op = VV; \
261 expr+=strlen(#VVV); \
272 match_op(OP_FLOOR,FLOOR)
273 match_op(OP_CEIL,CEIL)
286 match_op(OP_LIMIT,LIMIT)
287 /* order is important here ! .. match longest first */
288 match_op(OP_UNKN,UNKN)
290 match_op(OP_NEGINF,NEGINF)
292 match_op(OP_PREV,PREV)
294 match_op(OP_ISINF,ISINF)
296 match_op(OP_LTIME,LTIME)
297 match_op(OP_TIME,TIME)
302 else if ((sscanf(expr,"%29[_A-Za-z0-9]%n",
304 && ((rpnp[steps].ptr = (*lookup)(key_hash,vname)) != -1)){
305 rpnp[steps].op = OP_VARIABLE;
322 rpnp[steps+1].op = OP_END;
327 rpnstack_init(rpnstack_t *rpnstack)
329 rpnstack -> s = NULL;
330 rpnstack -> dc_stacksize = 0;
331 rpnstack -> dc_stackblock = 100;
335 rpnstack_free(rpnstack_t *rpnstack)
337 if (rpnstack -> s != NULL)
339 rpnstack -> dc_stacksize = 0;
342 /* rpn_calc: run the RPN calculator; also performs variable substitution;
343 * moved and modified from data_calc() originally included in rrd_graph.c
345 * rpnp : an array of RPN operators (including variable references)
346 * rpnstack : the initialized stack
347 * data_idx : when data_idx is a multiple of rpnp.step, the rpnp.data pointer
348 * is advanced by rpnp.ds_cnt; used only for variable substitution
349 * output : an array of output values; OP_PREV assumes this array contains
350 * the "previous" value at index position output_idx-1; the definition of
351 * "previous" depends on the calling environment
352 * output_idx : an index into the output array in which to store the output
353 * of the RPN calculator
354 * returns: -1 if the computation failed (also calls rrd_set_error)
358 rpn_calc(rpnp_t *rpnp, rpnstack_t *rpnstack, long data_idx,
359 rrd_value_t *output, int output_idx)
364 /* process each op from the rpn in turn */
365 for (rpi=0; rpnp[rpi].op != OP_END; rpi++){
366 /* allocate or grow the stack */
367 if (stptr + 5 > rpnstack -> dc_stacksize){
368 /* could move this to a separate function */
369 rpnstack -> dc_stacksize += rpnstack -> dc_stackblock;
370 rpnstack -> s = rrd_realloc(rpnstack -> s,
371 (rpnstack -> dc_stacksize)*sizeof(*(rpnstack -> s)));
372 if (rpnstack -> s == NULL){
373 rrd_set_error("RPN stack overflow");
378 #define stackunderflow(MINSIZE) \
380 rrd_set_error("RPN stack underflow"); \
384 switch (rpnp[rpi].op){
386 rpnstack -> s[++stptr] = rpnp[rpi].val;
389 /* Sanity check: VDEFs shouldn't make it here */
390 if (rpnp[rpi].ds_cnt == 0) {
391 rrd_set_error("VDEF made it into rpn_calc... aborting");
394 /* make sure we pull the correct value from
395 * the *.data array. Adjust the pointer into
396 * the array acordingly. Advance the ptr one
397 * row in the rra (skip over non-relevant
400 rpnstack -> s[++stptr] = *(rpnp[rpi].data);
401 if (data_idx % rpnp[rpi].step == 0){
402 rpnp[rpi].data += rpnp[rpi].ds_cnt;
407 if ((output_idx-1) <= 0) {
408 rpnstack -> s[++stptr] = DNAN;
410 rpnstack -> s[++stptr] = output[output_idx-1];
414 rpnstack -> s[++stptr] = DNAN;
417 rpnstack -> s[++stptr] = DINF;
420 rpnstack -> s[++stptr] = -DINF;
423 rpnstack -> s[++stptr] = (double)time(NULL);
426 /* HACK: this relies on the data_idx being the time,
427 ** which the within-function scope is unaware of */
428 rpnstack -> s[++stptr] = (double) data_idx;
431 rpnstack -> s[++stptr] =
432 (double) tzoffset(data_idx) + (double)data_idx;
436 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
437 + rpnstack -> s[stptr];
442 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
443 - rpnstack -> s[stptr];
448 rpnstack -> s[stptr-1] = (rpnstack -> s[stptr-1])
449 * (rpnstack -> s[stptr]);
454 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
455 / rpnstack -> s[stptr];
460 rpnstack -> s[stptr-1]= fmod( rpnstack -> s[stptr-1]
461 ,rpnstack -> s[stptr]);
466 rpnstack -> s[stptr] = sin(rpnstack -> s[stptr]);
470 rpnstack -> s[stptr] = cos(rpnstack -> s[stptr]);
474 rpnstack -> s[stptr] = ceil(rpnstack -> s[stptr]);
478 rpnstack -> s[stptr] = floor(rpnstack -> s[stptr]);
482 rpnstack -> s[stptr] = log(rpnstack -> s[stptr]);
486 rpnstack -> s[stptr+1] = rpnstack -> s[stptr];
497 dummy = rpnstack -> s[stptr] ;
498 rpnstack -> s[stptr] = rpnstack -> s[stptr-1];
499 rpnstack -> s[stptr-1] = dummy;
504 rpnstack -> s[stptr] = exp(rpnstack -> s[stptr]);
508 if (isnan(rpnstack -> s[stptr-1]))
510 else if (isnan(rpnstack -> s[stptr]))
511 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
513 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] <
514 rpnstack -> s[stptr] ? 1.0 : 0.0;
519 if (isnan(rpnstack -> s[stptr-1]))
521 else if (isnan(rpnstack -> s[stptr]))
522 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
524 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] <=
525 rpnstack -> s[stptr] ? 1.0 : 0.0;
530 if (isnan(rpnstack -> s[stptr-1]))
532 else if (isnan(rpnstack -> s[stptr]))
533 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
535 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] >
536 rpnstack -> s[stptr] ? 1.0 : 0.0;
541 if (isnan(rpnstack -> s[stptr-1]))
543 else if (isnan(rpnstack -> s[stptr]))
544 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
546 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] >=
547 rpnstack -> s[stptr] ? 1.0 : 0.0;
552 if (isnan(rpnstack -> s[stptr-1]))
554 else if (isnan(rpnstack -> s[stptr]))
555 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
557 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] ==
558 rpnstack -> s[stptr] ? 0.0 : 1.0;
563 if (isnan(rpnstack -> s[stptr-1]))
565 else if (isnan(rpnstack -> s[stptr]))
566 rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
568 rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] ==
569 rpnstack -> s[stptr] ? 1.0 : 0.0;
574 rpnstack->s[stptr-2] = rpnstack->s[stptr-2] != 0.0 ?
575 rpnstack->s[stptr-1] : rpnstack->s[stptr];
581 if (isnan(rpnstack->s[stptr-1]))
583 else if (isnan(rpnstack->s[stptr]))
584 rpnstack->s[stptr-1] = rpnstack->s[stptr];
585 else if (rpnstack->s[stptr-1] > rpnstack->s[stptr])
586 rpnstack->s[stptr-1] = rpnstack->s[stptr];
591 if (isnan(rpnstack->s[stptr-1]))
593 else if (isnan(rpnstack->s[stptr]))
594 rpnstack->s[stptr-1] = rpnstack->s[stptr];
595 else if (rpnstack->s[stptr-1] < rpnstack->s[stptr])
596 rpnstack->s[stptr-1] = rpnstack->s[stptr];
601 if (isnan(rpnstack->s[stptr-2]))
603 else if (isnan(rpnstack->s[stptr-1]))
604 rpnstack->s[stptr-2] = rpnstack->s[stptr-1];
605 else if (isnan(rpnstack->s[stptr]))
606 rpnstack->s[stptr-2] = rpnstack->s[stptr];
607 else if (rpnstack->s[stptr-2] < rpnstack->s[stptr-1])
608 rpnstack->s[stptr-2] = DNAN;
609 else if (rpnstack->s[stptr-2] > rpnstack->s[stptr])
610 rpnstack->s[stptr-2] = DNAN;
615 rpnstack->s[stptr] = isnan(rpnstack->s[stptr]) ? 1.0 : 0.0;
619 rpnstack->s[stptr] = isinf(rpnstack->s[stptr]) ? 1.0 : 0.0;
624 #undef stackunderflow
627 rrd_set_error("RPN final stack size != 1");
631 output[output_idx] = rpnstack->s[0];
635 /* figure out what the local timezone offset for any point in
636 time was. Return it in seconds */
638 tzoffset( time_t now ){
639 int gm_sec, gm_min, gm_hour, gm_yday, gm_year,
640 l_sec, l_min, l_hour, l_yday, l_year;
646 gm_hour = t->tm_hour;
647 gm_yday = t->tm_yday;
648 gm_year = t->tm_year;
655 off = (l_sec-gm_sec)+(l_min-gm_min)*60+(l_hour-gm_hour)*3600;
656 if ( l_yday > gm_yday || l_year > gm_year){
658 } else if ( l_yday < gm_yday || l_year < gm_year){