1 /*****************************************************************************
2 * RRDtool 1.3.2 Copyright by Tobi Oetiker, 1997-2008
3 * Copyright by Florian Forster, 2008
4 *****************************************************************************
5 * rrd_update.c RRD Update Function
6 *****************************************************************************
7 * $Id$
8 *****************************************************************************/
10 #include "rrd_tool.h"
12 #if defined(_WIN32) && !defined(__CYGWIN__) && !defined(__CYGWIN32__)
13 #include <sys/locking.h>
14 #include <sys/stat.h>
15 #include <io.h>
16 #endif
18 #include <locale.h>
20 #include "rrd_hw.h"
21 #include "rrd_rpncalc.h"
23 #include "rrd_is_thread_safe.h"
24 #include "unused.h"
26 #include "rrd_client.h"
28 #if defined(_WIN32) && !defined(__CYGWIN__) && !defined(__CYGWIN32__)
29 /*
30 * WIN32 does not have gettimeofday and struct timeval. This is a quick and dirty
31 * replacement.
32 */
33 #include <sys/timeb.h>
35 #ifndef __MINGW32__
36 struct timeval {
37 time_t tv_sec; /* seconds */
38 long tv_usec; /* microseconds */
39 };
40 #endif
42 struct __timezone {
43 int tz_minuteswest; /* minutes W of Greenwich */
44 int tz_dsttime; /* type of dst correction */
45 };
47 static int gettimeofday(
48 struct timeval *t,
49 struct __timezone *tz)
50 {
52 struct _timeb current_time;
54 _ftime(¤t_time);
56 t->tv_sec = current_time.time;
57 t->tv_usec = current_time.millitm * 1000;
59 return 0;
60 }
62 #endif
64 /* FUNCTION PROTOTYPES */
66 int rrd_update_r(
67 const char *filename,
68 const char *tmplt,
69 int argc,
70 const char **argv);
71 int _rrd_update(
72 const char *filename,
73 const char *tmplt,
74 int argc,
75 const char **argv,
76 rrd_info_t *);
78 static int allocate_data_structures(
79 rrd_t *rrd,
80 char ***updvals,
81 rrd_value_t **pdp_temp,
82 const char *tmplt,
83 long **tmpl_idx,
84 unsigned long *tmpl_cnt,
85 unsigned long **rra_step_cnt,
86 unsigned long **skip_update,
87 rrd_value_t **pdp_new);
89 static int parse_template(
90 rrd_t *rrd,
91 const char *tmplt,
92 unsigned long *tmpl_cnt,
93 long *tmpl_idx);
95 static int process_arg(
96 char *step_start,
97 rrd_t *rrd,
98 rrd_file_t *rrd_file,
99 unsigned long rra_begin,
100 time_t *current_time,
101 unsigned long *current_time_usec,
102 rrd_value_t *pdp_temp,
103 rrd_value_t *pdp_new,
104 unsigned long *rra_step_cnt,
105 char **updvals,
106 long *tmpl_idx,
107 unsigned long tmpl_cnt,
108 rrd_info_t ** pcdp_summary,
109 int version,
110 unsigned long *skip_update,
111 int *schedule_smooth);
113 static int parse_ds(
114 rrd_t *rrd,
115 char **updvals,
116 long *tmpl_idx,
117 char *input,
118 unsigned long tmpl_cnt,
119 time_t *current_time,
120 unsigned long *current_time_usec,
121 int version);
123 static int get_time_from_reading(
124 rrd_t *rrd,
125 char timesyntax,
126 char **updvals,
127 time_t *current_time,
128 unsigned long *current_time_usec,
129 int version);
131 static int update_pdp_prep(
132 rrd_t *rrd,
133 char **updvals,
134 rrd_value_t *pdp_new,
135 double interval);
137 static int calculate_elapsed_steps(
138 rrd_t *rrd,
139 unsigned long current_time,
140 unsigned long current_time_usec,
141 double interval,
142 double *pre_int,
143 double *post_int,
144 unsigned long *proc_pdp_cnt);
146 static void simple_update(
147 rrd_t *rrd,
148 double interval,
149 rrd_value_t *pdp_new);
151 static int process_all_pdp_st(
152 rrd_t *rrd,
153 double interval,
154 double pre_int,
155 double post_int,
156 unsigned long elapsed_pdp_st,
157 rrd_value_t *pdp_new,
158 rrd_value_t *pdp_temp);
160 static int process_pdp_st(
161 rrd_t *rrd,
162 unsigned long ds_idx,
163 double interval,
164 double pre_int,
165 double post_int,
166 long diff_pdp_st,
167 rrd_value_t *pdp_new,
168 rrd_value_t *pdp_temp);
170 static int update_all_cdp_prep(
171 rrd_t *rrd,
172 unsigned long *rra_step_cnt,
173 unsigned long rra_begin,
174 rrd_file_t *rrd_file,
175 unsigned long elapsed_pdp_st,
176 unsigned long proc_pdp_cnt,
177 rrd_value_t **last_seasonal_coef,
178 rrd_value_t **seasonal_coef,
179 rrd_value_t *pdp_temp,
180 unsigned long *skip_update,
181 int *schedule_smooth);
183 static int do_schedule_smooth(
184 rrd_t *rrd,
185 unsigned long rra_idx,
186 unsigned long elapsed_pdp_st);
188 static int update_cdp_prep(
189 rrd_t *rrd,
190 unsigned long elapsed_pdp_st,
191 unsigned long start_pdp_offset,
192 unsigned long *rra_step_cnt,
193 int rra_idx,
194 rrd_value_t *pdp_temp,
195 rrd_value_t *last_seasonal_coef,
196 rrd_value_t *seasonal_coef,
197 int current_cf);
199 static void update_cdp(
200 unival *scratch,
201 int current_cf,
202 rrd_value_t pdp_temp_val,
203 unsigned long rra_step_cnt,
204 unsigned long elapsed_pdp_st,
205 unsigned long start_pdp_offset,
206 unsigned long pdp_cnt,
207 rrd_value_t xff,
208 int i,
209 int ii);
211 static void initialize_cdp_val(
212 unival *scratch,
213 int current_cf,
214 rrd_value_t pdp_temp_val,
215 unsigned long elapsed_pdp_st,
216 unsigned long start_pdp_offset,
217 unsigned long pdp_cnt);
219 static void reset_cdp(
220 rrd_t *rrd,
221 unsigned long elapsed_pdp_st,
222 rrd_value_t *pdp_temp,
223 rrd_value_t *last_seasonal_coef,
224 rrd_value_t *seasonal_coef,
225 int rra_idx,
226 int ds_idx,
227 int cdp_idx,
228 enum cf_en current_cf);
230 static rrd_value_t initialize_average_carry_over(
231 rrd_value_t pdp_temp_val,
232 unsigned long elapsed_pdp_st,
233 unsigned long start_pdp_offset,
234 unsigned long pdp_cnt);
236 static rrd_value_t calculate_cdp_val(
237 rrd_value_t cdp_val,
238 rrd_value_t pdp_temp_val,
239 unsigned long elapsed_pdp_st,
240 int current_cf,
241 int i,
242 int ii);
244 static int update_aberrant_cdps(
245 rrd_t *rrd,
246 rrd_file_t *rrd_file,
247 unsigned long rra_begin,
248 unsigned long elapsed_pdp_st,
249 rrd_value_t *pdp_temp,
250 rrd_value_t **seasonal_coef);
252 static int write_to_rras(
253 rrd_t *rrd,
254 rrd_file_t *rrd_file,
255 unsigned long *rra_step_cnt,
256 unsigned long rra_begin,
257 time_t current_time,
258 unsigned long *skip_update,
259 rrd_info_t ** pcdp_summary);
261 static int write_RRA_row(
262 rrd_file_t *rrd_file,
263 rrd_t *rrd,
264 unsigned long rra_idx,
265 unsigned short CDP_scratch_idx,
266 rrd_info_t ** pcdp_summary,
267 time_t rra_time);
269 static int smooth_all_rras(
270 rrd_t *rrd,
271 rrd_file_t *rrd_file,
272 unsigned long rra_begin);
274 #ifndef HAVE_MMAP
275 static int write_changes_to_disk(
276 rrd_t *rrd,
277 rrd_file_t *rrd_file,
278 int version);
279 #endif
281 /*
282 * normalize time as returned by gettimeofday. usec part must
283 * be always >= 0
284 */
285 static inline void normalize_time(
286 struct timeval *t)
287 {
288 if (t->tv_usec < 0) {
289 t->tv_sec--;
290 t->tv_usec += 1e6L;
291 }
292 }
294 /*
295 * Sets current_time and current_time_usec based on the current time.
296 * current_time_usec is set to 0 if the version number is 1 or 2.
297 */
298 static inline void initialize_time(
299 time_t *current_time,
300 unsigned long *current_time_usec,
301 int version)
302 {
303 struct timeval tmp_time; /* used for time conversion */
305 gettimeofday(&tmp_time, 0);
306 normalize_time(&tmp_time);
307 *current_time = tmp_time.tv_sec;
308 if (version >= 3) {
309 *current_time_usec = tmp_time.tv_usec;
310 } else {
311 *current_time_usec = 0;
312 }
313 }
315 #define IFDNAN(X,Y) (isnan(X) ? (Y) : (X));
317 rrd_info_t *rrd_update_v(
318 int argc,
319 char **argv)
320 {
321 char *tmplt = NULL;
322 rrd_info_t *result = NULL;
323 rrd_infoval_t rc;
324 char *opt_daemon = NULL;
325 struct option long_options[] = {
326 {"template", required_argument, 0, 't'},
327 {0, 0, 0, 0}
328 };
330 rc.u_int = -1;
331 optind = 0;
332 opterr = 0; /* initialize getopt */
334 while (1) {
335 int option_index = 0;
336 int opt;
338 opt = getopt_long(argc, argv, "t:", long_options, &option_index);
340 if (opt == EOF)
341 break;
343 switch (opt) {
344 case 't':
345 tmplt = optarg;
346 break;
348 case '?':
349 rrd_set_error("unknown option '%s'", argv[optind - 1]);
350 goto end_tag;
351 }
352 }
354 opt_daemon = getenv (ENV_RRDCACHED_ADDRESS);
355 if (opt_daemon != NULL) {
356 rrd_set_error ("The \"%s\" environment variable is defined, "
357 "but \"%s\" cannot work with rrdcached. Either unset "
358 "the environment variable or use \"update\" instead.",
359 ENV_RRDCACHED_ADDRESS, argv[0]);
360 goto end_tag;
361 }
363 /* need at least 2 arguments: filename, data. */
364 if (argc - optind < 2) {
365 rrd_set_error("Not enough arguments");
366 goto end_tag;
367 }
368 rc.u_int = 0;
369 result = rrd_info_push(NULL, sprintf_alloc("return_value"), RD_I_INT, rc);
370 rc.u_int = _rrd_update(argv[optind], tmplt,
371 argc - optind - 1,
372 (const char **) (argv + optind + 1), result);
373 result->value.u_int = rc.u_int;
374 end_tag:
375 return result;
376 }
378 int rrd_update(
379 int argc,
380 char **argv)
381 {
382 struct option long_options[] = {
383 {"template", required_argument, 0, 't'},
384 {"daemon", required_argument, 0, 'd'},
385 {0, 0, 0, 0}
386 };
387 int option_index = 0;
388 int opt;
389 char *tmplt = NULL;
390 int rc = -1;
391 char *opt_daemon = NULL;
393 optind = 0;
394 opterr = 0; /* initialize getopt */
396 while (1) {
397 opt = getopt_long(argc, argv, "t:d:", long_options, &option_index);
399 if (opt == EOF)
400 break;
402 switch (opt) {
403 case 't':
404 tmplt = strdup(optarg);
405 break;
407 case 'd':
408 if (opt_daemon != NULL)
409 free (opt_daemon);
410 opt_daemon = strdup (optarg);
411 if (opt_daemon == NULL)
412 {
413 rrd_set_error("strdup failed.");
414 goto out;
415 }
416 break;
418 case '?':
419 rrd_set_error("unknown option '%s'", argv[optind - 1]);
420 goto out;
421 }
422 }
424 /* need at least 2 arguments: filename, data. */
425 if (argc - optind < 2) {
426 rrd_set_error("Not enough arguments");
427 goto out;
428 }
430 { /* try to connect to rrdcached */
431 int status = rrdc_connect(opt_daemon);
432 if (status != 0) return status;
433 }
435 if ((tmplt != NULL) && rrdc_is_connected(opt_daemon))
436 {
437 rrd_set_error("The caching daemon cannot be used together with "
438 "templates yet.");
439 goto out;
440 }
442 if (! rrdc_is_connected(opt_daemon))
443 {
444 rc = rrd_update_r(argv[optind], tmplt,
445 argc - optind - 1, (const char **) (argv + optind + 1));
446 }
447 else /* we are connected */
448 {
449 rc = rrdc_update (argv[optind], /* file */
450 argc - optind - 1, /* values_num */
451 (const char *const *) (argv + optind + 1)); /* values */
452 if (rc > 0)
453 rrd_set_error("Failed sending the values to rrdcached: %s",
454 rrd_strerror (rc));
455 }
457 out:
458 if (tmplt != NULL)
459 {
460 free(tmplt);
461 tmplt = NULL;
462 }
463 if (opt_daemon != NULL)
464 {
465 free (opt_daemon);
466 opt_daemon = NULL;
467 }
468 return rc;
469 }
471 int rrd_update_r(
472 const char *filename,
473 const char *tmplt,
474 int argc,
475 const char **argv)
476 {
477 return _rrd_update(filename, tmplt, argc, argv, NULL);
478 }
480 int _rrd_update(
481 const char *filename,
482 const char *tmplt,
483 int argc,
484 const char **argv,
485 rrd_info_t * pcdp_summary)
486 {
488 int arg_i = 2;
490 unsigned long rra_begin; /* byte pointer to the rra
491 * area in the rrd file. this
492 * pointer never changes value */
493 rrd_value_t *pdp_new; /* prepare the incoming data to be added
494 * to the existing entry */
495 rrd_value_t *pdp_temp; /* prepare the pdp values to be added
496 * to the cdp values */
498 long *tmpl_idx; /* index representing the settings
499 * transported by the tmplt index */
500 unsigned long tmpl_cnt = 2; /* time and data */
501 rrd_t rrd;
502 time_t current_time = 0;
503 unsigned long current_time_usec = 0; /* microseconds part of current time */
504 char **updvals;
505 int schedule_smooth = 0;
507 /* number of elapsed PDP steps since last update */
508 unsigned long *rra_step_cnt = NULL;
510 int version; /* rrd version */
511 rrd_file_t *rrd_file;
512 char *arg_copy; /* for processing the argv */
513 unsigned long *skip_update; /* RRAs to advance but not write */
515 /* need at least 1 arguments: data. */
516 if (argc < 1) {
517 rrd_set_error("Not enough arguments");
518 goto err_out;
519 }
521 rrd_init(&rrd);
522 if ((rrd_file = rrd_open(filename, &rrd, RRD_READWRITE)) == NULL) {
523 goto err_free;
524 }
525 /* We are now at the beginning of the rra's */
526 rra_begin = rrd_file->header_len;
528 version = atoi(rrd.stat_head->version);
530 initialize_time(¤t_time, ¤t_time_usec, version);
532 /* get exclusive lock to whole file.
533 * lock gets removed when we close the file.
534 */
535 if (rrd_lock(rrd_file) != 0) {
536 rrd_set_error("could not lock RRD");
537 goto err_close;
538 }
540 if (allocate_data_structures(&rrd, &updvals,
541 &pdp_temp, tmplt, &tmpl_idx, &tmpl_cnt,
542 &rra_step_cnt, &skip_update,
543 &pdp_new) == -1) {
544 goto err_close;
545 }
547 /* loop through the arguments. */
548 for (arg_i = 0; arg_i < argc; arg_i++) {
549 if ((arg_copy = strdup(argv[arg_i])) == NULL) {
550 rrd_set_error("failed duplication argv entry");
551 break;
552 }
553 if (process_arg(arg_copy, &rrd, rrd_file, rra_begin,
554 ¤t_time, ¤t_time_usec, pdp_temp, pdp_new,
555 rra_step_cnt, updvals, tmpl_idx, tmpl_cnt,
556 &pcdp_summary, version, skip_update,
557 &schedule_smooth) == -1) {
558 if (rrd_test_error()) { /* Should have error string always here */
559 char *save_error;
561 /* Prepend file name to error message */
562 if ((save_error = strdup(rrd_get_error())) != NULL) {
563 rrd_set_error("%s: %s", filename, save_error);
564 free(save_error);
565 }
566 }
567 free(arg_copy);
568 break;
569 }
570 free(arg_copy);
571 }
573 free(rra_step_cnt);
575 /* if we got here and if there is an error and if the file has not been
576 * written to, then close things up and return. */
577 if (rrd_test_error()) {
578 goto err_free_structures;
579 }
580 #ifndef HAVE_MMAP
581 if (write_changes_to_disk(&rrd, rrd_file, version) == -1) {
582 goto err_free_structures;
583 }
584 #endif
586 /* calling the smoothing code here guarantees at most one smoothing
587 * operation per rrd_update call. Unfortunately, it is possible with bulk
588 * updates, or a long-delayed update for smoothing to occur off-schedule.
589 * This really isn't critical except during the burn-in cycles. */
590 if (schedule_smooth) {
591 smooth_all_rras(&rrd, rrd_file, rra_begin);
592 }
594 /* rrd_dontneed(rrd_file,&rrd); */
595 rrd_free(&rrd);
596 rrd_close(rrd_file);
598 free(pdp_new);
599 free(tmpl_idx);
600 free(pdp_temp);
601 free(skip_update);
602 free(updvals);
603 return 0;
605 err_free_structures:
606 free(pdp_new);
607 free(tmpl_idx);
608 free(pdp_temp);
609 free(skip_update);
610 free(updvals);
611 err_close:
612 rrd_close(rrd_file);
613 err_free:
614 rrd_free(&rrd);
615 err_out:
616 return -1;
617 }
619 /*
620 * Allocate some important arrays used, and initialize the template.
621 *
622 * When it returns, either all of the structures are allocated
623 * or none of them are.
624 *
625 * Returns 0 on success, -1 on error.
626 */
627 static int allocate_data_structures(
628 rrd_t *rrd,
629 char ***updvals,
630 rrd_value_t **pdp_temp,
631 const char *tmplt,
632 long **tmpl_idx,
633 unsigned long *tmpl_cnt,
634 unsigned long **rra_step_cnt,
635 unsigned long **skip_update,
636 rrd_value_t **pdp_new)
637 {
638 unsigned i, ii;
639 if ((*updvals = (char **) malloc(sizeof(char *)
640 * (rrd->stat_head->ds_cnt + 1))) == NULL) {
641 rrd_set_error("allocating updvals pointer array.");
642 return -1;
643 }
644 if ((*pdp_temp = (rrd_value_t *) malloc(sizeof(rrd_value_t)
645 * rrd->stat_head->ds_cnt)) ==
646 NULL) {
647 rrd_set_error("allocating pdp_temp.");
648 goto err_free_updvals;
649 }
650 if ((*skip_update = (unsigned long *) malloc(sizeof(unsigned long)
651 *
652 rrd->stat_head->rra_cnt)) ==
653 NULL) {
654 rrd_set_error("allocating skip_update.");
655 goto err_free_pdp_temp;
656 }
657 if ((*tmpl_idx = (long *) malloc(sizeof(unsigned long)
658 * (rrd->stat_head->ds_cnt + 1))) == NULL) {
659 rrd_set_error("allocating tmpl_idx.");
660 goto err_free_skip_update;
661 }
662 if ((*rra_step_cnt = (unsigned long *) malloc(sizeof(unsigned long)
663 *
664 (rrd->stat_head->
665 rra_cnt))) == NULL) {
666 rrd_set_error("allocating rra_step_cnt.");
667 goto err_free_tmpl_idx;
668 }
670 /* initialize tmplt redirector */
671 /* default config example (assume DS 1 is a CDEF DS)
672 tmpl_idx[0] -> 0; (time)
673 tmpl_idx[1] -> 1; (DS 0)
674 tmpl_idx[2] -> 3; (DS 2)
675 tmpl_idx[3] -> 4; (DS 3) */
676 (*tmpl_idx)[0] = 0; /* time */
677 for (i = 1, ii = 1; i <= rrd->stat_head->ds_cnt; i++) {
678 if (dst_conv(rrd->ds_def[i - 1].dst) != DST_CDEF)
679 (*tmpl_idx)[ii++] = i;
680 }
681 *tmpl_cnt = ii;
683 if (tmplt != NULL) {
684 if (parse_template(rrd, tmplt, tmpl_cnt, *tmpl_idx) == -1) {
685 goto err_free_rra_step_cnt;
686 }
687 }
689 if ((*pdp_new = (rrd_value_t *) malloc(sizeof(rrd_value_t)
690 * rrd->stat_head->ds_cnt)) == NULL) {
691 rrd_set_error("allocating pdp_new.");
692 goto err_free_rra_step_cnt;
693 }
695 return 0;
697 err_free_rra_step_cnt:
698 free(*rra_step_cnt);
699 err_free_tmpl_idx:
700 free(*tmpl_idx);
701 err_free_skip_update:
702 free(*skip_update);
703 err_free_pdp_temp:
704 free(*pdp_temp);
705 err_free_updvals:
706 free(*updvals);
707 return -1;
708 }
710 /*
711 * Parses tmplt and puts an ordered list of DS's into tmpl_idx.
712 *
713 * Returns 0 on success.
714 */
715 static int parse_template(
716 rrd_t *rrd,
717 const char *tmplt,
718 unsigned long *tmpl_cnt,
719 long *tmpl_idx)
720 {
721 char *dsname, *tmplt_copy;
722 unsigned int tmpl_len, i;
723 int ret = 0;
725 *tmpl_cnt = 1; /* the first entry is the time */
727 /* we should work on a writeable copy here */
728 if ((tmplt_copy = strdup(tmplt)) == NULL) {
729 rrd_set_error("error copying tmplt '%s'", tmplt);
730 ret = -1;
731 goto out;
732 }
734 dsname = tmplt_copy;
735 tmpl_len = strlen(tmplt_copy);
736 for (i = 0; i <= tmpl_len; i++) {
737 if (tmplt_copy[i] == ':' || tmplt_copy[i] == '\0') {
738 tmplt_copy[i] = '\0';
739 if (*tmpl_cnt > rrd->stat_head->ds_cnt) {
740 rrd_set_error("tmplt contains more DS definitions than RRD");
741 ret = -1;
742 goto out_free_tmpl_copy;
743 }
744 if ((tmpl_idx[(*tmpl_cnt)++] = ds_match(rrd, dsname) + 1) == 0) {
745 rrd_set_error("unknown DS name '%s'", dsname);
746 ret = -1;
747 goto out_free_tmpl_copy;
748 }
749 /* go to the next entry on the tmplt_copy */
750 if (i < tmpl_len)
751 dsname = &tmplt_copy[i + 1];
752 }
753 }
754 out_free_tmpl_copy:
755 free(tmplt_copy);
756 out:
757 return ret;
758 }
760 /*
761 * Parse an update string, updates the primary data points (PDPs)
762 * and consolidated data points (CDPs), and writes changes to the RRAs.
763 *
764 * Returns 0 on success, -1 on error.
765 */
766 static int process_arg(
767 char *step_start,
768 rrd_t *rrd,
769 rrd_file_t *rrd_file,
770 unsigned long rra_begin,
771 time_t *current_time,
772 unsigned long *current_time_usec,
773 rrd_value_t *pdp_temp,
774 rrd_value_t *pdp_new,
775 unsigned long *rra_step_cnt,
776 char **updvals,
777 long *tmpl_idx,
778 unsigned long tmpl_cnt,
779 rrd_info_t ** pcdp_summary,
780 int version,
781 unsigned long *skip_update,
782 int *schedule_smooth)
783 {
784 rrd_value_t *seasonal_coef = NULL, *last_seasonal_coef = NULL;
786 /* a vector of future Holt-Winters seasonal coefs */
787 unsigned long elapsed_pdp_st;
789 double interval, pre_int, post_int; /* interval between this and
790 * the last run */
791 unsigned long proc_pdp_cnt;
793 if (parse_ds(rrd, updvals, tmpl_idx, step_start, tmpl_cnt,
794 current_time, current_time_usec, version) == -1) {
795 return -1;
796 }
798 interval = (double) (*current_time - rrd->live_head->last_up)
799 + (double) ((long) *current_time_usec -
800 (long) rrd->live_head->last_up_usec) / 1e6f;
802 /* process the data sources and update the pdp_prep
803 * area accordingly */
804 if (update_pdp_prep(rrd, updvals, pdp_new, interval) == -1) {
805 return -1;
806 }
808 elapsed_pdp_st = calculate_elapsed_steps(rrd,
809 *current_time,
810 *current_time_usec, interval,
811 &pre_int, &post_int,
812 &proc_pdp_cnt);
814 /* has a pdp_st moment occurred since the last run ? */
815 if (elapsed_pdp_st == 0) {
816 /* no we have not passed a pdp_st moment. therefore update is simple */
817 simple_update(rrd, interval, pdp_new);
818 } else {
819 /* an pdp_st has occurred. */
820 if (process_all_pdp_st(rrd, interval,
821 pre_int, post_int,
822 elapsed_pdp_st, pdp_new, pdp_temp) == -1) {
823 return -1;
824 }
825 if (update_all_cdp_prep(rrd, rra_step_cnt,
826 rra_begin, rrd_file,
827 elapsed_pdp_st,
828 proc_pdp_cnt,
829 &last_seasonal_coef,
830 &seasonal_coef,
831 pdp_temp,
832 skip_update, schedule_smooth) == -1) {
833 goto err_free_coefficients;
834 }
835 if (update_aberrant_cdps(rrd, rrd_file, rra_begin,
836 elapsed_pdp_st, pdp_temp,
837 &seasonal_coef) == -1) {
838 goto err_free_coefficients;
839 }
840 if (write_to_rras(rrd, rrd_file, rra_step_cnt, rra_begin,
841 *current_time, skip_update,
842 pcdp_summary) == -1) {
843 goto err_free_coefficients;
844 }
845 } /* endif a pdp_st has occurred */
846 rrd->live_head->last_up = *current_time;
847 rrd->live_head->last_up_usec = *current_time_usec;
849 if (version < 3) {
850 *rrd->legacy_last_up = rrd->live_head->last_up;
851 }
852 free(seasonal_coef);
853 free(last_seasonal_coef);
854 return 0;
856 err_free_coefficients:
857 free(seasonal_coef);
858 free(last_seasonal_coef);
859 return -1;
860 }
862 /*
863 * Parse a DS string (time + colon-separated values), storing the
864 * results in current_time, current_time_usec, and updvals.
865 *
866 * Returns 0 on success, -1 on error.
867 */
868 static int parse_ds(
869 rrd_t *rrd,
870 char **updvals,
871 long *tmpl_idx,
872 char *input,
873 unsigned long tmpl_cnt,
874 time_t *current_time,
875 unsigned long *current_time_usec,
876 int version)
877 {
878 char *p;
879 unsigned long i;
880 char timesyntax;
882 updvals[0] = input;
883 /* initialize all ds input to unknown except the first one
884 which has always got to be set */
885 for (i = 1; i <= rrd->stat_head->ds_cnt; i++)
886 updvals[i] = "U";
888 /* separate all ds elements; first must be examined separately
889 due to alternate time syntax */
890 if ((p = strchr(input, '@')) != NULL) {
891 timesyntax = '@';
892 } else if ((p = strchr(input, ':')) != NULL) {
893 timesyntax = ':';
894 } else {
895 rrd_set_error("expected timestamp not found in data source from %s",
896 input);
897 return -1;
898 }
899 *p = '\0';
900 i = 1;
901 updvals[tmpl_idx[i++]] = p + 1;
902 while (*(++p)) {
903 if (*p == ':') {
904 *p = '\0';
905 if (i < tmpl_cnt) {
906 updvals[tmpl_idx[i++]] = p + 1;
907 }
908 }
909 }
911 if (i != tmpl_cnt) {
912 rrd_set_error("expected %lu data source readings (got %lu) from %s",
913 tmpl_cnt - 1, i, input);
914 return -1;
915 }
917 if (get_time_from_reading(rrd, timesyntax, updvals,
918 current_time, current_time_usec,
919 version) == -1) {
920 return -1;
921 }
922 return 0;
923 }
925 /*
926 * Parse the time in a DS string, store it in current_time and
927 * current_time_usec and verify that it's later than the last
928 * update for this DS.
929 *
930 * Returns 0 on success, -1 on error.
931 */
932 static int get_time_from_reading(
933 rrd_t *rrd,
934 char timesyntax,
935 char **updvals,
936 time_t *current_time,
937 unsigned long *current_time_usec,
938 int version)
939 {
940 double tmp;
941 char *parsetime_error = NULL;
942 char *old_locale;
943 rrd_time_value_t ds_tv;
944 struct timeval tmp_time; /* used for time conversion */
946 /* get the time from the reading ... handle N */
947 if (timesyntax == '@') { /* at-style */
948 if ((parsetime_error = rrd_parsetime(updvals[0], &ds_tv))) {
949 rrd_set_error("ds time: %s: %s", updvals[0], parsetime_error);
950 return -1;
951 }
952 if (ds_tv.type == RELATIVE_TO_END_TIME ||
953 ds_tv.type == RELATIVE_TO_START_TIME) {
954 rrd_set_error("specifying time relative to the 'start' "
955 "or 'end' makes no sense here: %s", updvals[0]);
956 return -1;
957 }
958 *current_time = mktime(&ds_tv.tm) +ds_tv.offset;
959 *current_time_usec = 0; /* FIXME: how to handle usecs here ? */
960 } else if (strcmp(updvals[0], "N") == 0) {
961 gettimeofday(&tmp_time, 0);
962 normalize_time(&tmp_time);
963 *current_time = tmp_time.tv_sec;
964 *current_time_usec = tmp_time.tv_usec;
965 } else {
966 old_locale = setlocale(LC_NUMERIC, "C");
967 tmp = strtod(updvals[0], 0);
968 setlocale(LC_NUMERIC, old_locale);
969 *current_time = floor(tmp);
970 *current_time_usec = (long) ((tmp - (double) *current_time) * 1e6f);
971 }
972 /* dont do any correction for old version RRDs */
973 if (version < 3)
974 *current_time_usec = 0;
976 if (*current_time < rrd->live_head->last_up ||
977 (*current_time == rrd->live_head->last_up &&
978 (long) *current_time_usec <= (long) rrd->live_head->last_up_usec)) {
979 rrd_set_error("illegal attempt to update using time %ld when "
980 "last update time is %ld (minimum one second step)",
981 *current_time, rrd->live_head->last_up);
982 return -1;
983 }
984 return 0;
985 }
987 /*
988 * Update pdp_new by interpreting the updvals according to the DS type
989 * (COUNTER, GAUGE, etc.).
990 *
991 * Returns 0 on success, -1 on error.
992 */
993 static int update_pdp_prep(
994 rrd_t *rrd,
995 char **updvals,
996 rrd_value_t *pdp_new,
997 double interval)
998 {
999 unsigned long ds_idx;
1000 int ii;
1001 char *endptr; /* used in the conversion */
1002 double rate;
1003 char *old_locale;
1004 enum dst_en dst_idx;
1006 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1007 dst_idx = dst_conv(rrd->ds_def[ds_idx].dst);
1009 /* make sure we do not build diffs with old last_ds values */
1010 if (rrd->ds_def[ds_idx].par[DS_mrhb_cnt].u_cnt < interval) {
1011 strncpy(rrd->pdp_prep[ds_idx].last_ds, "U", LAST_DS_LEN - 1);
1012 rrd->pdp_prep[ds_idx].last_ds[LAST_DS_LEN - 1] = '\0';
1013 }
1015 /* NOTE: DST_CDEF should never enter this if block, because
1016 * updvals[ds_idx+1][0] is initialized to 'U'; unless the caller
1017 * accidently specified a value for the DST_CDEF. To handle this case,
1018 * an extra check is required. */
1020 if ((updvals[ds_idx + 1][0] != 'U') &&
1021 (dst_idx != DST_CDEF) &&
1022 rrd->ds_def[ds_idx].par[DS_mrhb_cnt].u_cnt >= interval) {
1023 rate = DNAN;
1025 /* pdp_new contains rate * time ... eg the bytes transferred during
1026 * the interval. Doing it this way saves a lot of math operations
1027 */
1028 switch (dst_idx) {
1029 case DST_COUNTER:
1030 case DST_DERIVE:
1031 for (ii = 0; updvals[ds_idx + 1][ii] != '\0'; ii++) {
1032 if ((updvals[ds_idx + 1][ii] < '0'
1033 || updvals[ds_idx + 1][ii] > '9')
1034 && (ii != 0 && updvals[ds_idx + 1][ii] != '-')) {
1035 rrd_set_error("not a simple integer: '%s'",
1036 updvals[ds_idx + 1]);
1037 return -1;
1038 }
1039 }
1040 if (rrd->pdp_prep[ds_idx].last_ds[0] != 'U') {
1041 pdp_new[ds_idx] =
1042 rrd_diff(updvals[ds_idx + 1],
1043 rrd->pdp_prep[ds_idx].last_ds);
1044 if (dst_idx == DST_COUNTER) {
1045 /* simple overflow catcher. This will fail
1046 * terribly for non 32 or 64 bit counters
1047 * ... are there any others in SNMP land?
1048 */
1049 if (pdp_new[ds_idx] < (double) 0.0)
1050 pdp_new[ds_idx] += (double) 4294967296.0; /* 2^32 */
1051 if (pdp_new[ds_idx] < (double) 0.0)
1052 pdp_new[ds_idx] += (double) 18446744069414584320.0; /* 2^64-2^32 */
1053 }
1054 rate = pdp_new[ds_idx] / interval;
1055 } else {
1056 pdp_new[ds_idx] = DNAN;
1057 }
1058 break;
1059 case DST_ABSOLUTE:
1060 old_locale = setlocale(LC_NUMERIC, "C");
1061 errno = 0;
1062 pdp_new[ds_idx] = strtod(updvals[ds_idx + 1], &endptr);
1063 setlocale(LC_NUMERIC, old_locale);
1064 if (errno > 0) {
1065 rrd_set_error("converting '%s' to float: %s",
1066 updvals[ds_idx + 1], rrd_strerror(errno));
1067 return -1;
1068 };
1069 if (endptr[0] != '\0') {
1070 rrd_set_error
1071 ("conversion of '%s' to float not complete: tail '%s'",
1072 updvals[ds_idx + 1], endptr);
1073 return -1;
1074 }
1075 rate = pdp_new[ds_idx] / interval;
1076 break;
1077 case DST_GAUGE:
1078 errno = 0;
1079 old_locale = setlocale(LC_NUMERIC, "C");
1080 pdp_new[ds_idx] =
1081 strtod(updvals[ds_idx + 1], &endptr) * interval;
1082 setlocale(LC_NUMERIC, old_locale);
1083 if (errno) {
1084 rrd_set_error("converting '%s' to float: %s",
1085 updvals[ds_idx + 1], rrd_strerror(errno));
1086 return -1;
1087 };
1088 if (endptr[0] != '\0') {
1089 rrd_set_error
1090 ("conversion of '%s' to float not complete: tail '%s'",
1091 updvals[ds_idx + 1], endptr);
1092 return -1;
1093 }
1094 rate = pdp_new[ds_idx] / interval;
1095 break;
1096 default:
1097 rrd_set_error("rrd contains unknown DS type : '%s'",
1098 rrd->ds_def[ds_idx].dst);
1099 return -1;
1100 }
1101 /* break out of this for loop if the error string is set */
1102 if (rrd_test_error()) {
1103 return -1;
1104 }
1105 /* make sure pdp_temp is neither too large or too small
1106 * if any of these occur it becomes unknown ...
1107 * sorry folks ... */
1108 if (!isnan(rate) &&
1109 ((!isnan(rrd->ds_def[ds_idx].par[DS_max_val].u_val) &&
1110 rate > rrd->ds_def[ds_idx].par[DS_max_val].u_val) ||
1111 (!isnan(rrd->ds_def[ds_idx].par[DS_min_val].u_val) &&
1112 rate < rrd->ds_def[ds_idx].par[DS_min_val].u_val))) {
1113 pdp_new[ds_idx] = DNAN;
1114 }
1115 } else {
1116 /* no news is news all the same */
1117 pdp_new[ds_idx] = DNAN;
1118 }
1121 /* make a copy of the command line argument for the next run */
1122 #ifdef DEBUG
1123 fprintf(stderr, "prep ds[%lu]\t"
1124 "last_arg '%s'\t"
1125 "this_arg '%s'\t"
1126 "pdp_new %10.2f\n",
1127 ds_idx, rrd->pdp_prep[ds_idx].last_ds, updvals[ds_idx + 1],
1128 pdp_new[ds_idx]);
1129 #endif
1130 strncpy(rrd->pdp_prep[ds_idx].last_ds, updvals[ds_idx + 1],
1131 LAST_DS_LEN - 1);
1132 rrd->pdp_prep[ds_idx].last_ds[LAST_DS_LEN - 1] = '\0';
1133 }
1134 return 0;
1135 }
1137 /*
1138 * How many PDP steps have elapsed since the last update? Returns the answer,
1139 * and stores the time between the last update and the last PDP in pre_time,
1140 * and the time between the last PDP and the current time in post_int.
1141 */
1142 static int calculate_elapsed_steps(
1143 rrd_t *rrd,
1144 unsigned long current_time,
1145 unsigned long current_time_usec,
1146 double interval,
1147 double *pre_int,
1148 double *post_int,
1149 unsigned long *proc_pdp_cnt)
1150 {
1151 unsigned long proc_pdp_st; /* which pdp_st was the last to be processed */
1152 unsigned long occu_pdp_st; /* when was the pdp_st before the last update
1153 * time */
1154 unsigned long proc_pdp_age; /* how old was the data in the pdp prep area
1155 * when it was last updated */
1156 unsigned long occu_pdp_age; /* how long ago was the last pdp_step time */
1158 /* when was the current pdp started */
1159 proc_pdp_age = rrd->live_head->last_up % rrd->stat_head->pdp_step;
1160 proc_pdp_st = rrd->live_head->last_up - proc_pdp_age;
1162 /* when did the last pdp_st occur */
1163 occu_pdp_age = current_time % rrd->stat_head->pdp_step;
1164 occu_pdp_st = current_time - occu_pdp_age;
1166 if (occu_pdp_st > proc_pdp_st) {
1167 /* OK we passed the pdp_st moment */
1168 *pre_int = (long) occu_pdp_st - rrd->live_head->last_up; /* how much of the input data
1169 * occurred before the latest
1170 * pdp_st moment*/
1171 *pre_int -= ((double) rrd->live_head->last_up_usec) / 1e6f; /* adjust usecs */
1172 *post_int = occu_pdp_age; /* how much after it */
1173 *post_int += ((double) current_time_usec) / 1e6f; /* adjust usecs */
1174 } else {
1175 *pre_int = interval;
1176 *post_int = 0;
1177 }
1179 *proc_pdp_cnt = proc_pdp_st / rrd->stat_head->pdp_step;
1181 #ifdef DEBUG
1182 printf("proc_pdp_age %lu\t"
1183 "proc_pdp_st %lu\t"
1184 "occu_pfp_age %lu\t"
1185 "occu_pdp_st %lu\t"
1186 "int %lf\t"
1187 "pre_int %lf\t"
1188 "post_int %lf\n", proc_pdp_age, proc_pdp_st,
1189 occu_pdp_age, occu_pdp_st, interval, *pre_int, *post_int);
1190 #endif
1192 /* compute the number of elapsed pdp_st moments */
1193 return (occu_pdp_st - proc_pdp_st) / rrd->stat_head->pdp_step;
1194 }
1196 /*
1197 * Increment the PDP values by the values in pdp_new, or else initialize them.
1198 */
1199 static void simple_update(
1200 rrd_t *rrd,
1201 double interval,
1202 rrd_value_t *pdp_new)
1203 {
1204 int i;
1206 for (i = 0; i < (signed) rrd->stat_head->ds_cnt; i++) {
1207 if (isnan(pdp_new[i])) {
1208 /* this is not really accurate if we use subsecond data arrival time
1209 should have thought of it when going subsecond resolution ...
1210 sorry next format change we will have it! */
1211 rrd->pdp_prep[i].scratch[PDP_unkn_sec_cnt].u_cnt +=
1212 floor(interval);
1213 } else {
1214 if (isnan(rrd->pdp_prep[i].scratch[PDP_val].u_val)) {
1215 rrd->pdp_prep[i].scratch[PDP_val].u_val = pdp_new[i];
1216 } else {
1217 rrd->pdp_prep[i].scratch[PDP_val].u_val += pdp_new[i];
1218 }
1219 }
1220 #ifdef DEBUG
1221 fprintf(stderr,
1222 "NO PDP ds[%i]\t"
1223 "value %10.2f\t"
1224 "unkn_sec %5lu\n",
1225 i,
1226 rrd->pdp_prep[i].scratch[PDP_val].u_val,
1227 rrd->pdp_prep[i].scratch[PDP_unkn_sec_cnt].u_cnt);
1228 #endif
1229 }
1230 }
1232 /*
1233 * Call process_pdp_st for each DS.
1234 *
1235 * Returns 0 on success, -1 on error.
1236 */
1237 static int process_all_pdp_st(
1238 rrd_t *rrd,
1239 double interval,
1240 double pre_int,
1241 double post_int,
1242 unsigned long elapsed_pdp_st,
1243 rrd_value_t *pdp_new,
1244 rrd_value_t *pdp_temp)
1245 {
1246 unsigned long ds_idx;
1248 /* in pdp_prep[].scratch[PDP_val].u_val we have collected
1249 rate*seconds which occurred up to the last run.
1250 pdp_new[] contains rate*seconds from the latest run.
1251 pdp_temp[] will contain the rate for cdp */
1253 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1254 if (process_pdp_st(rrd, ds_idx, interval, pre_int, post_int,
1255 elapsed_pdp_st * rrd->stat_head->pdp_step,
1256 pdp_new, pdp_temp) == -1) {
1257 return -1;
1258 }
1259 #ifdef DEBUG
1260 fprintf(stderr, "PDP UPD ds[%lu]\t"
1261 "elapsed_pdp_st %lu\t"
1262 "pdp_temp %10.2f\t"
1263 "new_prep %10.2f\t"
1264 "new_unkn_sec %5lu\n",
1265 ds_idx,
1266 elapsed_pdp_st,
1267 pdp_temp[ds_idx],
1268 rrd->pdp_prep[ds_idx].scratch[PDP_val].u_val,
1269 rrd->pdp_prep[ds_idx].scratch[PDP_unkn_sec_cnt].u_cnt);
1270 #endif
1271 }
1272 return 0;
1273 }
1275 /*
1276 * Process an update that occurs after one of the PDP moments.
1277 * Increments the PDP value, sets NAN if time greater than the
1278 * heartbeats have elapsed, processes CDEFs.
1279 *
1280 * Returns 0 on success, -1 on error.
1281 */
1282 static int process_pdp_st(
1283 rrd_t *rrd,
1284 unsigned long ds_idx,
1285 double interval,
1286 double pre_int,
1287 double post_int,
1288 long diff_pdp_st, /* number of seconds in full steps passed since last update */
1289 rrd_value_t *pdp_new,
1290 rrd_value_t *pdp_temp)
1291 {
1292 int i;
1294 /* update pdp_prep to the current pdp_st. */
1295 double pre_unknown = 0.0;
1296 unival *scratch = rrd->pdp_prep[ds_idx].scratch;
1297 unsigned long mrhb = rrd->ds_def[ds_idx].par[DS_mrhb_cnt].u_cnt;
1299 rpnstack_t rpnstack; /* used for COMPUTE DS */
1301 rpnstack_init(&rpnstack);
1304 if (isnan(pdp_new[ds_idx])) {
1305 /* a final bit of unknown to be added before calculation
1306 we use a temporary variable for this so that we
1307 don't have to turn integer lines before using the value */
1308 pre_unknown = pre_int;
1309 } else {
1310 if (isnan(scratch[PDP_val].u_val)) {
1311 scratch[PDP_val].u_val = 0;
1312 }
1313 scratch[PDP_val].u_val += pdp_new[ds_idx] / interval * pre_int;
1314 }
1316 /* if too much of the pdp_prep is unknown we dump it */
1317 /* if the interval is larger thatn mrhb we get NAN */
1318 if ((interval > mrhb) ||
1319 (rrd->stat_head->pdp_step / 2.0 <
1320 (signed) scratch[PDP_unkn_sec_cnt].u_cnt)) {
1321 pdp_temp[ds_idx] = DNAN;
1322 } else {
1323 pdp_temp[ds_idx] = scratch[PDP_val].u_val /
1324 ((double) (diff_pdp_st - scratch[PDP_unkn_sec_cnt].u_cnt) -
1325 pre_unknown);
1326 }
1328 /* process CDEF data sources; remember each CDEF DS can
1329 * only reference other DS with a lower index number */
1330 if (dst_conv(rrd->ds_def[ds_idx].dst) == DST_CDEF) {
1331 rpnp_t *rpnp;
1333 rpnp =
1334 rpn_expand((rpn_cdefds_t *) &(rrd->ds_def[ds_idx].par[DS_cdef]));
1335 /* substitute data values for OP_VARIABLE nodes */
1336 for (i = 0; rpnp[i].op != OP_END; i++) {
1337 if (rpnp[i].op == OP_VARIABLE) {
1338 rpnp[i].op = OP_NUMBER;
1339 rpnp[i].val = pdp_temp[rpnp[i].ptr];
1340 }
1341 }
1342 /* run the rpn calculator */
1343 if (rpn_calc(rpnp, &rpnstack, 0, pdp_temp, ds_idx) == -1) {
1344 free(rpnp);
1345 rpnstack_free(&rpnstack);
1346 return -1;
1347 }
1348 }
1350 /* make pdp_prep ready for the next run */
1351 if (isnan(pdp_new[ds_idx])) {
1352 /* this is not realy accurate if we use subsecond data arival time
1353 should have thought of it when going subsecond resolution ...
1354 sorry next format change we will have it! */
1355 scratch[PDP_unkn_sec_cnt].u_cnt = floor(post_int);
1356 scratch[PDP_val].u_val = DNAN;
1357 } else {
1358 scratch[PDP_unkn_sec_cnt].u_cnt = 0;
1359 scratch[PDP_val].u_val = pdp_new[ds_idx] / interval * post_int;
1360 }
1361 rpnstack_free(&rpnstack);
1362 return 0;
1363 }
1365 /*
1366 * Iterate over all the RRAs for a given DS and:
1367 * 1. Decide whether to schedule a smooth later
1368 * 2. Decide whether to skip updating SEASONAL and DEVSEASONAL
1369 * 3. Update the CDP
1370 *
1371 * Returns 0 on success, -1 on error
1372 */
1373 static int update_all_cdp_prep(
1374 rrd_t *rrd,
1375 unsigned long *rra_step_cnt,
1376 unsigned long rra_begin,
1377 rrd_file_t *rrd_file,
1378 unsigned long elapsed_pdp_st,
1379 unsigned long proc_pdp_cnt,
1380 rrd_value_t **last_seasonal_coef,
1381 rrd_value_t **seasonal_coef,
1382 rrd_value_t *pdp_temp,
1383 unsigned long *skip_update,
1384 int *schedule_smooth)
1385 {
1386 unsigned long rra_idx;
1388 /* index into the CDP scratch array */
1389 enum cf_en current_cf;
1390 unsigned long rra_start;
1392 /* number of rows to be updated in an RRA for a data value. */
1393 unsigned long start_pdp_offset;
1395 rra_start = rra_begin;
1396 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1397 current_cf = cf_conv(rrd->rra_def[rra_idx].cf_nam);
1398 start_pdp_offset =
1399 rrd->rra_def[rra_idx].pdp_cnt -
1400 proc_pdp_cnt % rrd->rra_def[rra_idx].pdp_cnt;
1401 skip_update[rra_idx] = 0;
1402 if (start_pdp_offset <= elapsed_pdp_st) {
1403 rra_step_cnt[rra_idx] = (elapsed_pdp_st - start_pdp_offset) /
1404 rrd->rra_def[rra_idx].pdp_cnt + 1;
1405 } else {
1406 rra_step_cnt[rra_idx] = 0;
1407 }
1409 if (current_cf == CF_SEASONAL || current_cf == CF_DEVSEASONAL) {
1410 /* If this is a bulk update, we need to skip ahead in the seasonal arrays
1411 * so that they will be correct for the next observed value; note that for
1412 * the bulk update itself, no update will occur to DEVSEASONAL or SEASONAL;
1413 * futhermore, HWPREDICT and DEVPREDICT will be set to DNAN. */
1414 if (rra_step_cnt[rra_idx] > 1) {
1415 skip_update[rra_idx] = 1;
1416 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1417 elapsed_pdp_st, last_seasonal_coef);
1418 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1419 elapsed_pdp_st + 1, seasonal_coef);
1420 }
1421 /* periodically run a smoother for seasonal effects */
1422 if (do_schedule_smooth(rrd, rra_idx, elapsed_pdp_st)) {
1423 #ifdef DEBUG
1424 fprintf(stderr,
1425 "schedule_smooth: cur_row %lu, elapsed_pdp_st %lu, smooth idx %lu\n",
1426 rrd->rra_ptr[rra_idx].cur_row, elapsed_pdp_st,
1427 rrd->rra_def[rra_idx].par[RRA_seasonal_smooth_idx].
1428 u_cnt);
1429 #endif
1430 *schedule_smooth = 1;
1431 }
1432 }
1433 if (rrd_test_error())
1434 return -1;
1436 if (update_cdp_prep
1437 (rrd, elapsed_pdp_st, start_pdp_offset, rra_step_cnt, rra_idx,
1438 pdp_temp, *last_seasonal_coef, *seasonal_coef,
1439 current_cf) == -1) {
1440 return -1;
1441 }
1442 rra_start +=
1443 rrd->rra_def[rra_idx].row_cnt * rrd->stat_head->ds_cnt *
1444 sizeof(rrd_value_t);
1445 }
1446 return 0;
1447 }
1449 /*
1450 * Are we due for a smooth? Also increments our position in the burn-in cycle.
1451 */
1452 static int do_schedule_smooth(
1453 rrd_t *rrd,
1454 unsigned long rra_idx,
1455 unsigned long elapsed_pdp_st)
1456 {
1457 unsigned long cdp_idx = rra_idx * (rrd->stat_head->ds_cnt);
1458 unsigned long cur_row = rrd->rra_ptr[rra_idx].cur_row;
1459 unsigned long row_cnt = rrd->rra_def[rra_idx].row_cnt;
1460 unsigned long seasonal_smooth_idx =
1461 rrd->rra_def[rra_idx].par[RRA_seasonal_smooth_idx].u_cnt;
1462 unsigned long *init_seasonal =
1463 &(rrd->cdp_prep[cdp_idx].scratch[CDP_init_seasonal].u_cnt);
1465 /* Need to use first cdp parameter buffer to track burnin (burnin requires
1466 * a specific smoothing schedule). The CDP_init_seasonal parameter is
1467 * really an RRA level, not a data source within RRA level parameter, but
1468 * the rra_def is read only for rrd_update (not flushed to disk). */
1469 if (*init_seasonal > BURNIN_CYCLES) {
1470 /* someone has no doubt invented a trick to deal with this wrap around,
1471 * but at least this code is clear. */
1472 if (seasonal_smooth_idx > cur_row) {
1473 /* here elapsed_pdp_st = rra_step_cnt[rra_idx] because of 1-1 mapping
1474 * between PDP and CDP */
1475 return (cur_row + elapsed_pdp_st >= seasonal_smooth_idx);
1476 }
1477 /* can't rely on negative numbers because we are working with
1478 * unsigned values */
1479 return (cur_row + elapsed_pdp_st >= row_cnt
1480 && cur_row + elapsed_pdp_st >= row_cnt + seasonal_smooth_idx);
1481 }
1482 /* mark off one of the burn-in cycles */
1483 return (cur_row + elapsed_pdp_st >= row_cnt && ++(*init_seasonal));
1484 }
1486 /*
1487 * For a given RRA, iterate over the data sources and call the appropriate
1488 * consolidation function.
1489 *
1490 * Returns 0 on success, -1 on error.
1491 */
1492 static int update_cdp_prep(
1493 rrd_t *rrd,
1494 unsigned long elapsed_pdp_st,
1495 unsigned long start_pdp_offset,
1496 unsigned long *rra_step_cnt,
1497 int rra_idx,
1498 rrd_value_t *pdp_temp,
1499 rrd_value_t *last_seasonal_coef,
1500 rrd_value_t *seasonal_coef,
1501 int current_cf)
1502 {
1503 unsigned long ds_idx, cdp_idx;
1505 /* update CDP_PREP areas */
1506 /* loop over data soures within each RRA */
1507 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1509 cdp_idx = rra_idx * rrd->stat_head->ds_cnt + ds_idx;
1511 if (rrd->rra_def[rra_idx].pdp_cnt > 1) {
1512 update_cdp(rrd->cdp_prep[cdp_idx].scratch, current_cf,
1513 pdp_temp[ds_idx], rra_step_cnt[rra_idx],
1514 elapsed_pdp_st, start_pdp_offset,
1515 rrd->rra_def[rra_idx].pdp_cnt,
1516 rrd->rra_def[rra_idx].par[RRA_cdp_xff_val].u_val,
1517 rra_idx, ds_idx);
1518 } else {
1519 /* Nothing to consolidate if there's one PDP per CDP. However, if
1520 * we've missed some PDPs, let's update null counters etc. */
1521 if (elapsed_pdp_st > 2) {
1522 reset_cdp(rrd, elapsed_pdp_st, pdp_temp, last_seasonal_coef,
1523 seasonal_coef, rra_idx, ds_idx, cdp_idx,
1524 current_cf);
1525 }
1526 }
1528 if (rrd_test_error())
1529 return -1;
1530 } /* endif data sources loop */
1531 return 0;
1532 }
1534 /*
1535 * Given the new reading (pdp_temp_val), update or initialize the CDP value,
1536 * primary value, secondary value, and # of unknowns.
1537 */
1538 static void update_cdp(
1539 unival *scratch,
1540 int current_cf,
1541 rrd_value_t pdp_temp_val,
1542 unsigned long rra_step_cnt,
1543 unsigned long elapsed_pdp_st,
1544 unsigned long start_pdp_offset,
1545 unsigned long pdp_cnt,
1546 rrd_value_t xff,
1547 int i,
1548 int ii)
1549 {
1550 /* shorthand variables */
1551 rrd_value_t *cdp_val = &scratch[CDP_val].u_val;
1552 rrd_value_t *cdp_primary_val = &scratch[CDP_primary_val].u_val;
1553 rrd_value_t *cdp_secondary_val = &scratch[CDP_secondary_val].u_val;
1554 unsigned long *cdp_unkn_pdp_cnt = &scratch[CDP_unkn_pdp_cnt].u_cnt;
1556 if (rra_step_cnt) {
1557 /* If we are in this block, as least 1 CDP value will be written to
1558 * disk, this is the CDP_primary_val entry. If more than 1 value needs
1559 * to be written, then the "fill in" value is the CDP_secondary_val
1560 * entry. */
1561 if (isnan(pdp_temp_val)) {
1562 *cdp_unkn_pdp_cnt += start_pdp_offset;
1563 *cdp_secondary_val = DNAN;
1564 } else {
1565 /* CDP_secondary value is the RRA "fill in" value for intermediary
1566 * CDP data entries. No matter the CF, the value is the same because
1567 * the average, max, min, and last of a list of identical values is
1568 * the same, namely, the value itself. */
1569 *cdp_secondary_val = pdp_temp_val;
1570 }
1572 if (*cdp_unkn_pdp_cnt > pdp_cnt * xff) {
1573 *cdp_primary_val = DNAN;
1574 if (current_cf == CF_AVERAGE) {
1575 *cdp_val =
1576 initialize_average_carry_over(pdp_temp_val,
1577 elapsed_pdp_st,
1578 start_pdp_offset, pdp_cnt);
1579 } else {
1580 *cdp_val = pdp_temp_val;
1581 }
1582 } else {
1583 initialize_cdp_val(scratch, current_cf, pdp_temp_val,
1584 elapsed_pdp_st, start_pdp_offset, pdp_cnt);
1585 } /* endif meets xff value requirement for a valid value */
1586 /* initialize carry over CDP_unkn_pdp_cnt, this must after CDP_primary_val
1587 * is set because CDP_unkn_pdp_cnt is required to compute that value. */
1588 if (isnan(pdp_temp_val))
1589 *cdp_unkn_pdp_cnt = (elapsed_pdp_st - start_pdp_offset) % pdp_cnt;
1590 else
1591 *cdp_unkn_pdp_cnt = 0;
1592 } else { /* rra_step_cnt[i] == 0 */
1594 #ifdef DEBUG
1595 if (isnan(*cdp_val)) {
1596 fprintf(stderr, "schedule CDP_val update, RRA %d DS %d, DNAN\n",
1597 i, ii);
1598 } else {
1599 fprintf(stderr, "schedule CDP_val update, RRA %d DS %d, %10.2f\n",
1600 i, ii, *cdp_val);
1601 }
1602 #endif
1603 if (isnan(pdp_temp_val)) {
1604 *cdp_unkn_pdp_cnt += elapsed_pdp_st;
1605 } else {
1606 *cdp_val =
1607 calculate_cdp_val(*cdp_val, pdp_temp_val, elapsed_pdp_st,
1608 current_cf, i, ii);
1609 }
1610 }
1611 }
1613 /*
1614 * Set the CDP_primary_val and CDP_val to the appropriate initial value based
1615 * on the type of consolidation function.
1616 */
1617 static void initialize_cdp_val(
1618 unival *scratch,
1619 int current_cf,
1620 rrd_value_t pdp_temp_val,
1621 unsigned long elapsed_pdp_st,
1622 unsigned long start_pdp_offset,
1623 unsigned long pdp_cnt)
1624 {
1625 rrd_value_t cum_val, cur_val;
1627 switch (current_cf) {
1628 case CF_AVERAGE:
1629 cum_val = IFDNAN(scratch[CDP_val].u_val, 0.0);
1630 cur_val = IFDNAN(pdp_temp_val, 0.0);
1631 scratch[CDP_primary_val].u_val =
1632 (cum_val + cur_val * start_pdp_offset) /
1633 (pdp_cnt - scratch[CDP_unkn_pdp_cnt].u_cnt);
1634 scratch[CDP_val].u_val =
1635 initialize_average_carry_over(pdp_temp_val, elapsed_pdp_st,
1636 start_pdp_offset, pdp_cnt);
1637 break;
1638 case CF_MAXIMUM:
1639 cum_val = IFDNAN(scratch[CDP_val].u_val, -DINF);
1640 cur_val = IFDNAN(pdp_temp_val, -DINF);
1641 #if 0
1642 #ifdef DEBUG
1643 if (isnan(scratch[CDP_val].u_val) && isnan(pdp_temp)) {
1644 fprintf(stderr,
1645 "RRA %lu, DS %lu, both CDP_val and pdp_temp are DNAN!",
1646 i, ii);
1647 exit(-1);
1648 }
1649 #endif
1650 #endif
1651 if (cur_val > cum_val)
1652 scratch[CDP_primary_val].u_val = cur_val;
1653 else
1654 scratch[CDP_primary_val].u_val = cum_val;
1655 /* initialize carry over value */
1656 scratch[CDP_val].u_val = pdp_temp_val;
1657 break;
1658 case CF_MINIMUM:
1659 cum_val = IFDNAN(scratch[CDP_val].u_val, DINF);
1660 cur_val = IFDNAN(pdp_temp_val, DINF);
1661 #if 0
1662 #ifdef DEBUG
1663 if (isnan(scratch[CDP_val].u_val) && isnan(pdp_temp)) {
1664 fprintf(stderr,
1665 "RRA %lu, DS %lu, both CDP_val and pdp_temp are DNAN!", i,
1666 ii);
1667 exit(-1);
1668 }
1669 #endif
1670 #endif
1671 if (cur_val < cum_val)
1672 scratch[CDP_primary_val].u_val = cur_val;
1673 else
1674 scratch[CDP_primary_val].u_val = cum_val;
1675 /* initialize carry over value */
1676 scratch[CDP_val].u_val = pdp_temp_val;
1677 break;
1678 case CF_LAST:
1679 default:
1680 scratch[CDP_primary_val].u_val = pdp_temp_val;
1681 /* initialize carry over value */
1682 scratch[CDP_val].u_val = pdp_temp_val;
1683 break;
1684 }
1685 }
1687 /*
1688 * Update the consolidation function for Holt-Winters functions as
1689 * well as other functions that don't actually consolidate multiple
1690 * PDPs.
1691 */
1692 static void reset_cdp(
1693 rrd_t *rrd,
1694 unsigned long elapsed_pdp_st,
1695 rrd_value_t *pdp_temp,
1696 rrd_value_t *last_seasonal_coef,
1697 rrd_value_t *seasonal_coef,
1698 int rra_idx,
1699 int ds_idx,
1700 int cdp_idx,
1701 enum cf_en current_cf)
1702 {
1703 unival *scratch = rrd->cdp_prep[cdp_idx].scratch;
1705 switch (current_cf) {
1706 case CF_AVERAGE:
1707 default:
1708 scratch[CDP_primary_val].u_val = pdp_temp[ds_idx];
1709 scratch[CDP_secondary_val].u_val = pdp_temp[ds_idx];
1710 break;
1711 case CF_SEASONAL:
1712 case CF_DEVSEASONAL:
1713 /* need to update cached seasonal values, so they are consistent
1714 * with the bulk update */
1715 /* WARNING: code relies on the fact that CDP_hw_last_seasonal and
1716 * CDP_last_deviation are the same. */
1717 scratch[CDP_hw_last_seasonal].u_val = last_seasonal_coef[ds_idx];
1718 scratch[CDP_hw_seasonal].u_val = seasonal_coef[ds_idx];
1719 break;
1720 case CF_HWPREDICT:
1721 case CF_MHWPREDICT:
1722 /* need to update the null_count and last_null_count.
1723 * even do this for non-DNAN pdp_temp because the
1724 * algorithm is not learning from batch updates. */
1725 scratch[CDP_null_count].u_cnt += elapsed_pdp_st;
1726 scratch[CDP_last_null_count].u_cnt += elapsed_pdp_st - 1;
1727 /* fall through */
1728 case CF_DEVPREDICT:
1729 scratch[CDP_primary_val].u_val = DNAN;
1730 scratch[CDP_secondary_val].u_val = DNAN;
1731 break;
1732 case CF_FAILURES:
1733 /* do not count missed bulk values as failures */
1734 scratch[CDP_primary_val].u_val = 0;
1735 scratch[CDP_secondary_val].u_val = 0;
1736 /* need to reset violations buffer.
1737 * could do this more carefully, but for now, just
1738 * assume a bulk update wipes away all violations. */
1739 erase_violations(rrd, cdp_idx, rra_idx);
1740 break;
1741 }
1742 }
1744 static rrd_value_t initialize_average_carry_over(
1745 rrd_value_t pdp_temp_val,
1746 unsigned long elapsed_pdp_st,
1747 unsigned long start_pdp_offset,
1748 unsigned long pdp_cnt)
1749 {
1750 /* initialize carry over value */
1751 if (isnan(pdp_temp_val)) {
1752 return DNAN;
1753 }
1754 return pdp_temp_val * ((elapsed_pdp_st - start_pdp_offset) % pdp_cnt);
1755 }
1757 /*
1758 * Update or initialize a CDP value based on the consolidation
1759 * function.
1760 *
1761 * Returns the new value.
1762 */
1763 static rrd_value_t calculate_cdp_val(
1764 rrd_value_t cdp_val,
1765 rrd_value_t pdp_temp_val,
1766 unsigned long elapsed_pdp_st,
1767 int current_cf,
1768 #ifdef DEBUG
1769 int i,
1770 int ii
1771 #else
1772 int UNUSED(i),
1773 int UNUSED(ii)
1774 #endif
1775 )
1776 {
1777 if (isnan(cdp_val)) {
1778 if (current_cf == CF_AVERAGE) {
1779 pdp_temp_val *= elapsed_pdp_st;
1780 }
1781 #ifdef DEBUG
1782 fprintf(stderr, "Initialize CDP_val for RRA %d DS %d: %10.2f\n",
1783 i, ii, pdp_temp_val);
1784 #endif
1785 return pdp_temp_val;
1786 }
1787 if (current_cf == CF_AVERAGE)
1788 return cdp_val + pdp_temp_val * elapsed_pdp_st;
1789 if (current_cf == CF_MINIMUM)
1790 return (pdp_temp_val < cdp_val) ? pdp_temp_val : cdp_val;
1791 if (current_cf == CF_MAXIMUM)
1792 return (pdp_temp_val > cdp_val) ? pdp_temp_val : cdp_val;
1794 return pdp_temp_val;
1795 }
1797 /*
1798 * For each RRA, update the seasonal values and then call update_aberrant_CF
1799 * for each data source.
1800 *
1801 * Return 0 on success, -1 on error.
1802 */
1803 static int update_aberrant_cdps(
1804 rrd_t *rrd,
1805 rrd_file_t *rrd_file,
1806 unsigned long rra_begin,
1807 unsigned long elapsed_pdp_st,
1808 rrd_value_t *pdp_temp,
1809 rrd_value_t **seasonal_coef)
1810 {
1811 unsigned long rra_idx, ds_idx, j;
1813 /* number of PDP steps since the last update that
1814 * are assigned to the first CDP to be generated
1815 * since the last update. */
1816 unsigned short scratch_idx;
1817 unsigned long rra_start;
1818 enum cf_en current_cf;
1820 /* this loop is only entered if elapsed_pdp_st < 3 */
1821 for (j = elapsed_pdp_st, scratch_idx = CDP_primary_val;
1822 j > 0 && j < 3; j--, scratch_idx = CDP_secondary_val) {
1823 rra_start = rra_begin;
1824 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1825 if (rrd->rra_def[rra_idx].pdp_cnt == 1) {
1826 current_cf = cf_conv(rrd->rra_def[rra_idx].cf_nam);
1827 if (current_cf == CF_SEASONAL || current_cf == CF_DEVSEASONAL) {
1828 if (scratch_idx == CDP_primary_val) {
1829 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1830 elapsed_pdp_st + 1, seasonal_coef);
1831 } else {
1832 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1833 elapsed_pdp_st + 2, seasonal_coef);
1834 }
1835 }
1836 if (rrd_test_error())
1837 return -1;
1838 /* loop over data soures within each RRA */
1839 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1840 update_aberrant_CF(rrd, pdp_temp[ds_idx], current_cf,
1841 rra_idx * (rrd->stat_head->ds_cnt) +
1842 ds_idx, rra_idx, ds_idx, scratch_idx,
1843 *seasonal_coef);
1844 }
1845 }
1846 rra_start += rrd->rra_def[rra_idx].row_cnt
1847 * rrd->stat_head->ds_cnt * sizeof(rrd_value_t);
1848 }
1849 }
1850 return 0;
1851 }
1853 /*
1854 * Move sequentially through the file, writing one RRA at a time. Note this
1855 * architecture divorces the computation of CDP with flushing updated RRA
1856 * entries to disk.
1857 *
1858 * Return 0 on success, -1 on error.
1859 */
1860 static int write_to_rras(
1861 rrd_t *rrd,
1862 rrd_file_t *rrd_file,
1863 unsigned long *rra_step_cnt,
1864 unsigned long rra_begin,
1865 time_t current_time,
1866 unsigned long *skip_update,
1867 rrd_info_t ** pcdp_summary)
1868 {
1869 unsigned long rra_idx;
1870 unsigned long rra_start;
1871 time_t rra_time = 0; /* time of update for a RRA */
1873 unsigned long ds_cnt = rrd->stat_head->ds_cnt;
1875 /* Ready to write to disk */
1876 rra_start = rra_begin;
1878 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1879 rra_def_t *rra_def = &rrd->rra_def[rra_idx];
1880 rra_ptr_t *rra_ptr = &rrd->rra_ptr[rra_idx];
1882 /* for cdp_prep */
1883 unsigned short scratch_idx;
1884 unsigned long step_subtract;
1886 for (scratch_idx = CDP_primary_val,
1887 step_subtract = 1;
1888 rra_step_cnt[rra_idx] > 0;
1889 rra_step_cnt[rra_idx]--,
1890 scratch_idx = CDP_secondary_val,
1891 step_subtract = 2) {
1893 off_t rra_pos_new;
1894 #ifdef DEBUG
1895 fprintf(stderr, " -- RRA Preseek %ld\n", rrd_file->pos);
1896 #endif
1897 /* increment, with wrap-around */
1898 if (++rra_ptr->cur_row >= rra_def->row_cnt)
1899 rra_ptr->cur_row = 0;
1901 /* we know what our position should be */
1902 rra_pos_new = rra_start
1903 + ds_cnt * rra_ptr->cur_row * sizeof(rrd_value_t);
1905 /* re-seek if the position is wrong or we wrapped around */
1906 if ((size_t)rra_pos_new != rrd_file->pos) {
1907 if (rrd_seek(rrd_file, rra_pos_new, SEEK_SET) != 0) {
1908 rrd_set_error("seek error in rrd");
1909 return -1;
1910 }
1911 }
1912 #ifdef DEBUG
1913 fprintf(stderr, " -- RRA Postseek %ld\n", rrd_file->pos);
1914 #endif
1916 if (skip_update[rra_idx])
1917 continue;
1919 if (*pcdp_summary != NULL) {
1920 unsigned long step_time = rra_def->pdp_cnt * rrd->stat_head->pdp_step;
1922 rra_time = (current_time - current_time % step_time)
1923 - ((rra_step_cnt[rra_idx] - step_subtract) * step_time);
1924 }
1926 if (write_RRA_row
1927 (rrd_file, rrd, rra_idx, scratch_idx,
1928 pcdp_summary, rra_time) == -1)
1929 return -1;
1931 rrd_notify_row(rrd_file, rra_idx, rra_pos_new, rra_time);
1932 }
1934 rra_start += rra_def->row_cnt * ds_cnt * sizeof(rrd_value_t);
1935 } /* RRA LOOP */
1937 return 0;
1938 }
1940 /*
1941 * Write out one row of values (one value per DS) to the archive.
1942 *
1943 * Returns 0 on success, -1 on error.
1944 */
1945 static int write_RRA_row(
1946 rrd_file_t *rrd_file,
1947 rrd_t *rrd,
1948 unsigned long rra_idx,
1949 unsigned short CDP_scratch_idx,
1950 rrd_info_t ** pcdp_summary,
1951 time_t rra_time)
1952 {
1953 unsigned long ds_idx, cdp_idx;
1954 rrd_infoval_t iv;
1956 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1957 /* compute the cdp index */
1958 cdp_idx = rra_idx * (rrd->stat_head->ds_cnt) + ds_idx;
1959 #ifdef DEBUG
1960 fprintf(stderr, " -- RRA WRITE VALUE %e, at %ld CF:%s\n",
1961 rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].u_val,
1962 rrd_file->pos, rrd->rra_def[rra_idx].cf_nam);
1963 #endif
1964 if (*pcdp_summary != NULL) {
1965 iv.u_val = rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].u_val;
1966 /* append info to the return hash */
1967 *pcdp_summary = rrd_info_push(*pcdp_summary,
1968 sprintf_alloc
1969 ("[%lli]RRA[%s][%lu]DS[%s]",
1970 (long long)rra_time,
1971 rrd->rra_def[rra_idx].cf_nam,
1972 rrd->rra_def[rra_idx].pdp_cnt,
1973 rrd->ds_def[ds_idx].ds_nam),
1974 RD_I_VAL, iv);
1975 }
1976 if (rrd_write(rrd_file,
1977 &(rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].
1978 u_val), sizeof(rrd_value_t)) != sizeof(rrd_value_t)) {
1979 rrd_set_error("writing rrd: %s", rrd_strerror(errno));
1980 return -1;
1981 }
1982 }
1983 return 0;
1984 }
1986 /*
1987 * Call apply_smoother for all DEVSEASONAL and SEASONAL RRAs.
1988 *
1989 * Returns 0 on success, -1 otherwise
1990 */
1991 static int smooth_all_rras(
1992 rrd_t *rrd,
1993 rrd_file_t *rrd_file,
1994 unsigned long rra_begin)
1995 {
1996 unsigned long rra_start = rra_begin;
1997 unsigned long rra_idx;
1999 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; ++rra_idx) {
2000 if (cf_conv(rrd->rra_def[rra_idx].cf_nam) == CF_DEVSEASONAL ||
2001 cf_conv(rrd->rra_def[rra_idx].cf_nam) == CF_SEASONAL) {
2002 #ifdef DEBUG
2003 fprintf(stderr, "Running smoother for rra %lu\n", rra_idx);
2004 #endif
2005 apply_smoother(rrd, rra_idx, rra_start, rrd_file);
2006 if (rrd_test_error())
2007 return -1;
2008 }
2009 rra_start += rrd->rra_def[rra_idx].row_cnt
2010 * rrd->stat_head->ds_cnt * sizeof(rrd_value_t);
2011 }
2012 return 0;
2013 }
2015 #ifndef HAVE_MMAP
2016 /*
2017 * Flush changes to disk (unless we're using mmap)
2018 *
2019 * Returns 0 on success, -1 otherwise
2020 */
2021 static int write_changes_to_disk(
2022 rrd_t *rrd,
2023 rrd_file_t *rrd_file,
2024 int version)
2025 {
2026 /* we just need to write back the live header portion now */
2027 if (rrd_seek(rrd_file, (sizeof(stat_head_t)
2028 + sizeof(ds_def_t) * rrd->stat_head->ds_cnt
2029 + sizeof(rra_def_t) * rrd->stat_head->rra_cnt),
2030 SEEK_SET) != 0) {
2031 rrd_set_error("seek rrd for live header writeback");
2032 return -1;
2033 }
2034 if (version >= 3) {
2035 if (rrd_write(rrd_file, rrd->live_head,
2036 sizeof(live_head_t) * 1) != sizeof(live_head_t) * 1) {
2037 rrd_set_error("rrd_write live_head to rrd");
2038 return -1;
2039 }
2040 } else {
2041 if (rrd_write(rrd_file, rrd->legacy_last_up,
2042 sizeof(time_t) * 1) != sizeof(time_t) * 1) {
2043 rrd_set_error("rrd_write live_head to rrd");
2044 return -1;
2045 }
2046 }
2049 if (rrd_write(rrd_file, rrd->pdp_prep,
2050 sizeof(pdp_prep_t) * rrd->stat_head->ds_cnt)
2051 != (ssize_t) (sizeof(pdp_prep_t) * rrd->stat_head->ds_cnt)) {
2052 rrd_set_error("rrd_write pdp_prep to rrd");
2053 return -1;
2054 }
2056 if (rrd_write(rrd_file, rrd->cdp_prep,
2057 sizeof(cdp_prep_t) * rrd->stat_head->rra_cnt *
2058 rrd->stat_head->ds_cnt)
2059 != (ssize_t) (sizeof(cdp_prep_t) * rrd->stat_head->rra_cnt *
2060 rrd->stat_head->ds_cnt)) {
2062 rrd_set_error("rrd_write cdp_prep to rrd");
2063 return -1;
2064 }
2066 if (rrd_write(rrd_file, rrd->rra_ptr,
2067 sizeof(rra_ptr_t) * rrd->stat_head->rra_cnt)
2068 != (ssize_t) (sizeof(rra_ptr_t) * rrd->stat_head->rra_cnt)) {
2069 rrd_set_error("rrd_write rra_ptr to rrd");
2070 return -1;
2071 }
2072 return 0;
2073 }
2074 #endif