- switch (rpnp[rpi].op){
- case OP_NUMBER:
- rpnstack -> s[++stptr] = rpnp[rpi].val;
- break;
- case OP_VARIABLE:
- case OP_PREV_OTHER:
- /* Sanity check: VDEFs shouldn't make it here */
- if (rpnp[rpi].ds_cnt == 0) {
- rrd_set_error("VDEF made it into rpn_calc... aborting");
- return -1;
- } else {
- /* make sure we pull the correct value from
- * the *.data array. Adjust the pointer into
- * the array acordingly. Advance the ptr one
- * row in the rra (skip over non-relevant
- * data sources)
- */
- if (rpnp[rpi].op == OP_VARIABLE) {
- rpnstack -> s[++stptr] = *(rpnp[rpi].data);
- } else {
- if ((output_idx) <= 0) {
- rpnstack -> s[++stptr] = DNAN;
- } else {
- rpnstack -> s[++stptr] = *(rpnp[rpi].data-rpnp[rpi].ds_cnt);
- }
-
- }
- if (data_idx % rpnp[rpi].step == 0){
- rpnp[rpi].data += rpnp[rpi].ds_cnt;
- }
- }
- break;
- case OP_COUNT:
- rpnstack -> s[++stptr] = (output_idx+1); /* Note: Counter starts at 1 */
- break;
- case OP_PREV:
- if ((output_idx) <= 0) {
- rpnstack -> s[++stptr] = DNAN;
- } else {
- rpnstack -> s[++stptr] = output[output_idx-1];
- }
- break;
- case OP_UNKN:
- rpnstack -> s[++stptr] = DNAN;
- break;
- case OP_INF:
- rpnstack -> s[++stptr] = DINF;
- break;
- case OP_NEGINF:
- rpnstack -> s[++stptr] = -DINF;
- break;
- case OP_NOW:
- rpnstack -> s[++stptr] = (double)time(NULL);
- break;
- case OP_TIME:
- /* HACK: this relies on the data_idx being the time,
- ** which the within-function scope is unaware of */
- rpnstack -> s[++stptr] = (double) data_idx;
- break;
- case OP_LTIME:
- rpnstack -> s[++stptr] =
- (double) tzoffset(data_idx) + (double)data_idx;
- break;
- case OP_ADD:
- stackunderflow(1);
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
- + rpnstack -> s[stptr];
- stptr--;
- break;
- case OP_SUB:
- stackunderflow(1);
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
- - rpnstack -> s[stptr];
- stptr--;
- break;
- case OP_MUL:
- stackunderflow(1);
- rpnstack -> s[stptr-1] = (rpnstack -> s[stptr-1])
- * (rpnstack -> s[stptr]);
- stptr--;
- break;
- case OP_DIV:
- stackunderflow(1);
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1]
- / rpnstack -> s[stptr];
- stptr--;
- break;
- case OP_MOD:
- stackunderflow(1);
- rpnstack -> s[stptr-1]= fmod( rpnstack -> s[stptr-1]
- ,rpnstack -> s[stptr]);
- stptr--;
- break;
- case OP_SIN:
- stackunderflow(0);
- rpnstack -> s[stptr] = sin(rpnstack -> s[stptr]);
- break;
- case OP_ATAN:
- stackunderflow(0);
- rpnstack -> s[stptr] = atan(rpnstack -> s[stptr]);
- break;
- case OP_RAD2DEG:
- stackunderflow(0);
- rpnstack -> s[stptr] = 57.29577951 * rpnstack -> s[stptr];
- break;
- case OP_DEG2RAD:
- stackunderflow(0);
- rpnstack -> s[stptr] = 0.0174532952 * rpnstack -> s[stptr];
- break;
- case OP_ATAN2:
- stackunderflow(1);
- rpnstack -> s[stptr-1]= atan2(
- rpnstack -> s[stptr-1],
- rpnstack -> s[stptr]);
- stptr--;
- break;
- case OP_COS:
- stackunderflow(0);
- rpnstack -> s[stptr] = cos(rpnstack -> s[stptr]);
- break;
- case OP_CEIL:
- stackunderflow(0);
- rpnstack -> s[stptr] = ceil(rpnstack -> s[stptr]);
- break;
- case OP_FLOOR:
- stackunderflow(0);
- rpnstack -> s[stptr] = floor(rpnstack -> s[stptr]);
- break;
- case OP_LOG:
- stackunderflow(0);
- rpnstack -> s[stptr] = log(rpnstack -> s[stptr]);
- break;
- case OP_DUP:
- stackunderflow(0);
- rpnstack -> s[stptr+1] = rpnstack -> s[stptr];
- stptr++;
- break;
- case OP_POP:
- stackunderflow(0);
- stptr--;
- break;
- case OP_EXC:
- stackunderflow(1);
- {
- double dummy;
- dummy = rpnstack -> s[stptr] ;
- rpnstack -> s[stptr] = rpnstack -> s[stptr-1];
- rpnstack -> s[stptr-1] = dummy;
- }
- break;
- case OP_EXP:
- stackunderflow(0);
- rpnstack -> s[stptr] = exp(rpnstack -> s[stptr]);
- break;
- case OP_LT:
- stackunderflow(1);
- if (isnan(rpnstack -> s[stptr-1]))
- ;
- else if (isnan(rpnstack -> s[stptr]))
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
- else
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] <
- rpnstack -> s[stptr] ? 1.0 : 0.0;
- stptr--;
- break;
- case OP_LE:
- stackunderflow(1);
- if (isnan(rpnstack -> s[stptr-1]))
- ;
- else if (isnan(rpnstack -> s[stptr]))
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
- else
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] <=
- rpnstack -> s[stptr] ? 1.0 : 0.0;
- stptr--;
- break;
- case OP_GT:
- stackunderflow(1);
- if (isnan(rpnstack -> s[stptr-1]))
- ;
- else if (isnan(rpnstack -> s[stptr]))
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
- else
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] >
- rpnstack -> s[stptr] ? 1.0 : 0.0;
- stptr--;
- break;
- case OP_GE:
- stackunderflow(1);
- if (isnan(rpnstack -> s[stptr-1]))
- ;
- else if (isnan(rpnstack -> s[stptr]))
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
- else
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] >=
- rpnstack -> s[stptr] ? 1.0 : 0.0;
- stptr--;
- break;
- case OP_NE:
- stackunderflow(1);
- if (isnan(rpnstack -> s[stptr-1]))
- ;
- else if (isnan(rpnstack -> s[stptr]))
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
- else
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] ==
- rpnstack -> s[stptr] ? 0.0 : 1.0;
- stptr--;
- break;
- case OP_EQ:
- stackunderflow(1);
- if (isnan(rpnstack -> s[stptr-1]))
- ;
- else if (isnan(rpnstack -> s[stptr]))
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr];
- else
- rpnstack -> s[stptr-1] = rpnstack -> s[stptr-1] ==
- rpnstack -> s[stptr] ? 1.0 : 0.0;
- stptr--;
- break;
- case OP_IF:
- stackunderflow(2);
- rpnstack->s[stptr-2] = rpnstack->s[stptr-2] != 0.0 ?
- rpnstack->s[stptr-1] : rpnstack->s[stptr];
- stptr--;
- stptr--;
- break;
- case OP_MIN:
- stackunderflow(1);
- if (isnan(rpnstack->s[stptr-1]))
- ;
- else if (isnan(rpnstack->s[stptr]))
- rpnstack->s[stptr-1] = rpnstack->s[stptr];
- else if (rpnstack->s[stptr-1] > rpnstack->s[stptr])
- rpnstack->s[stptr-1] = rpnstack->s[stptr];
- stptr--;
- break;
- case OP_MAX:
- stackunderflow(1);
- if (isnan(rpnstack->s[stptr-1]))
- ;
- else if (isnan(rpnstack->s[stptr]))
- rpnstack->s[stptr-1] = rpnstack->s[stptr];
- else if (rpnstack->s[stptr-1] < rpnstack->s[stptr])
- rpnstack->s[stptr-1] = rpnstack->s[stptr];
- stptr--;
- break;
- case OP_LIMIT:
- stackunderflow(2);
- if (isnan(rpnstack->s[stptr-2]))
- ;
- else if (isnan(rpnstack->s[stptr-1]))
- rpnstack->s[stptr-2] = rpnstack->s[stptr-1];
- else if (isnan(rpnstack->s[stptr]))
- rpnstack->s[stptr-2] = rpnstack->s[stptr];
- else if (rpnstack->s[stptr-2] < rpnstack->s[stptr-1])
- rpnstack->s[stptr-2] = DNAN;
- else if (rpnstack->s[stptr-2] > rpnstack->s[stptr])
- rpnstack->s[stptr-2] = DNAN;
- stptr-=2;
- break;
- case OP_UN:
- stackunderflow(0);
- rpnstack->s[stptr] = isnan(rpnstack->s[stptr]) ? 1.0 : 0.0;
- break;
- case OP_ISINF:
- stackunderflow(0);
- rpnstack->s[stptr] = isinf(rpnstack->s[stptr]) ? 1.0 : 0.0;
- break;
- case OP_SQRT:
- stackunderflow(0);
- rpnstack -> s[stptr] = sqrt(rpnstack -> s[stptr]);
- break;
- case OP_SORT:
- stackunderflow(0);
- {
- int spn = (int)rpnstack -> s[stptr--];
-
- stackunderflow(spn-1);
- qsort(rpnstack -> s + stptr-spn+1, spn, sizeof(double),
- rpn_compare_double);
- }
- break;
- case OP_REV:
- stackunderflow(0);
- {
- int spn = (int)rpnstack -> s[stptr--];
- double *p, *q;
-
- stackunderflow(spn-1);
-
- p = rpnstack -> s + stptr-spn+1;
- q = rpnstack -> s + stptr;
- while (p < q) {
- double x = *q;
-
- *q-- = *p;
- *p++ = x;
- }
- }
- break;
- case OP_TREND:
- stackunderflow(1);
- if ((rpi < 2) || (rpnp[rpi-2].op != OP_VARIABLE)) {
- rrd_set_error("malformed trend arguments");
- return -1;
- } else {
- time_t dur = (time_t)rpnstack -> s[stptr];
- time_t step = (time_t)rpnp[rpi-2].step;
-
- if (output_idx > (int)ceil((float)dur / (float)step)) {
- double accum = 0.0;
- int i = 0;
-
- do {
- accum += rpnp[rpi-2].data[rpnp[rpi-2].ds_cnt * i--];
- dur -= step;
- } while (dur > 0);
-
- rpnstack -> s[--stptr] = (accum / -i);
- } else
- rpnstack -> s[--stptr] = DNAN;
- }
- break;
- case OP_AVG:
- stackunderflow(0);
- {
- int i=(int)rpnstack -> s[stptr--];
- double sum=0;
- int count=0;
- stackunderflow(i-1);
- while(i>0) {
- double val=rpnstack -> s[stptr--];
- i--;
- if (isnan(val)) { continue; }
- count++;
- sum+=val;
- }
- /* now push the result back on stack */
- if (count>0) {
- rpnstack -> s[++stptr]=sum/count;
- } else {
- rpnstack -> s[++stptr]=DNAN;
- }