1 /*****************************************************************************
2 * RRDtool 1.4.2 Copyright by Tobi Oetiker, 1997-2009
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 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 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 else {
909 rrd_set_error("found extra data on update argument: %s",p+1);
910 return -1;
911 }
912 }
913 }
915 if (i != tmpl_cnt) {
916 rrd_set_error("expected %lu data source readings (got %lu) from %s",
917 tmpl_cnt - 1, i - 1, input);
918 return -1;
919 }
921 if (get_time_from_reading(rrd, timesyntax, updvals,
922 current_time, current_time_usec,
923 version) == -1) {
924 return -1;
925 }
926 return 0;
927 }
929 /*
930 * Parse the time in a DS string, store it in current_time and
931 * current_time_usec and verify that it's later than the last
932 * update for this DS.
933 *
934 * Returns 0 on success, -1 on error.
935 */
936 static int get_time_from_reading(
937 rrd_t *rrd,
938 char timesyntax,
939 char **updvals,
940 time_t *current_time,
941 unsigned long *current_time_usec,
942 int version)
943 {
944 double tmp;
945 char *parsetime_error = NULL;
946 char *old_locale;
947 rrd_time_value_t ds_tv;
948 struct timeval tmp_time; /* used for time conversion */
950 /* get the time from the reading ... handle N */
951 if (timesyntax == '@') { /* at-style */
952 if ((parsetime_error = rrd_parsetime(updvals[0], &ds_tv))) {
953 rrd_set_error("ds time: %s: %s", updvals[0], parsetime_error);
954 return -1;
955 }
956 if (ds_tv.type == RELATIVE_TO_END_TIME ||
957 ds_tv.type == RELATIVE_TO_START_TIME) {
958 rrd_set_error("specifying time relative to the 'start' "
959 "or 'end' makes no sense here: %s", updvals[0]);
960 return -1;
961 }
962 *current_time = mktime(&ds_tv.tm) +ds_tv.offset;
963 *current_time_usec = 0; /* FIXME: how to handle usecs here ? */
964 } else if (strcmp(updvals[0], "N") == 0) {
965 gettimeofday(&tmp_time, 0);
966 normalize_time(&tmp_time);
967 *current_time = tmp_time.tv_sec;
968 *current_time_usec = tmp_time.tv_usec;
969 } else {
970 old_locale = setlocale(LC_NUMERIC, "C");
971 errno = 0;
972 tmp = strtod(updvals[0], 0);
973 if (errno > 0) {
974 rrd_set_error("converting '%s' to float: %s",
975 updvals[0], rrd_strerror(errno));
976 return -1;
977 };
978 setlocale(LC_NUMERIC, old_locale);
979 if (tmp < 0.0){
980 gettimeofday(&tmp_time, 0);
981 tmp = (double)tmp_time.tv_sec + (double)tmp_time.tv_usec * 1e-6f + tmp;
982 }
984 *current_time = floor(tmp);
985 *current_time_usec = (long) ((tmp - (double) *current_time) * 1e6f);
986 }
987 /* dont do any correction for old version RRDs */
988 if (version < 3)
989 *current_time_usec = 0;
991 if (*current_time < rrd->live_head->last_up ||
992 (*current_time == rrd->live_head->last_up &&
993 (long) *current_time_usec <= (long) rrd->live_head->last_up_usec)) {
994 rrd_set_error("illegal attempt to update using time %ld when "
995 "last update time is %ld (minimum one second step)",
996 *current_time, rrd->live_head->last_up);
997 return -1;
998 }
999 return 0;
1000 }
1002 /*
1003 * Update pdp_new by interpreting the updvals according to the DS type
1004 * (COUNTER, GAUGE, etc.).
1005 *
1006 * Returns 0 on success, -1 on error.
1007 */
1008 static int update_pdp_prep(
1009 rrd_t *rrd,
1010 char **updvals,
1011 rrd_value_t *pdp_new,
1012 double interval)
1013 {
1014 unsigned long ds_idx;
1015 int ii;
1016 char *endptr; /* used in the conversion */
1017 double rate;
1018 char *old_locale;
1019 enum dst_en dst_idx;
1021 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1022 dst_idx = dst_conv(rrd->ds_def[ds_idx].dst);
1024 /* make sure we do not build diffs with old last_ds values */
1025 if (rrd->ds_def[ds_idx].par[DS_mrhb_cnt].u_cnt < interval) {
1026 strncpy(rrd->pdp_prep[ds_idx].last_ds, "U", LAST_DS_LEN - 1);
1027 rrd->pdp_prep[ds_idx].last_ds[LAST_DS_LEN - 1] = '\0';
1028 }
1030 /* NOTE: DST_CDEF should never enter this if block, because
1031 * updvals[ds_idx+1][0] is initialized to 'U'; unless the caller
1032 * accidently specified a value for the DST_CDEF. To handle this case,
1033 * an extra check is required. */
1035 if ((updvals[ds_idx + 1][0] != 'U') &&
1036 (dst_idx != DST_CDEF) &&
1037 rrd->ds_def[ds_idx].par[DS_mrhb_cnt].u_cnt >= interval) {
1038 rate = DNAN;
1040 /* pdp_new contains rate * time ... eg the bytes transferred during
1041 * the interval. Doing it this way saves a lot of math operations
1042 */
1043 switch (dst_idx) {
1044 case DST_COUNTER:
1045 case DST_DERIVE:
1046 /* Check if this is a valid integer. `U' is already handled in
1047 * another branch. */
1048 for (ii = 0; updvals[ds_idx + 1][ii] != 0; ii++) {
1049 if ((ii == 0) && (dst_idx == DST_DERIVE)
1050 && (updvals[ds_idx + 1][ii] == '-'))
1051 continue;
1053 if ((updvals[ds_idx + 1][ii] < '0')
1054 || (updvals[ds_idx + 1][ii] > '9')) {
1055 rrd_set_error("not a simple %s integer: '%s'",
1056 (dst_idx == DST_DERIVE) ? "signed" : "unsigned",
1057 updvals[ds_idx + 1]);
1058 return -1;
1059 }
1060 } /* for (ii = 0; updvals[ds_idx + 1][ii] != 0; ii++) */
1062 if (rrd->pdp_prep[ds_idx].last_ds[0] != 'U') {
1063 pdp_new[ds_idx] =
1064 rrd_diff(updvals[ds_idx + 1],
1065 rrd->pdp_prep[ds_idx].last_ds);
1066 if (dst_idx == DST_COUNTER) {
1067 /* simple overflow catcher. This will fail
1068 * terribly for non 32 or 64 bit counters
1069 * ... are there any others in SNMP land?
1070 */
1071 if (pdp_new[ds_idx] < (double) 0.0)
1072 pdp_new[ds_idx] += (double) 4294967296.0; /* 2^32 */
1073 if (pdp_new[ds_idx] < (double) 0.0)
1074 pdp_new[ds_idx] += (double) 18446744069414584320.0; /* 2^64-2^32 */
1075 }
1076 rate = pdp_new[ds_idx] / interval;
1077 } else {
1078 pdp_new[ds_idx] = DNAN;
1079 }
1080 break;
1081 case DST_ABSOLUTE:
1082 old_locale = setlocale(LC_NUMERIC, "C");
1083 errno = 0;
1084 pdp_new[ds_idx] = strtod(updvals[ds_idx + 1], &endptr);
1085 if (errno > 0) {
1086 rrd_set_error("converting '%s' to float: %s",
1087 updvals[ds_idx + 1], rrd_strerror(errno));
1088 return -1;
1089 };
1090 setlocale(LC_NUMERIC, old_locale);
1091 if (endptr[0] != '\0') {
1092 rrd_set_error
1093 ("conversion of '%s' to float not complete: tail '%s'",
1094 updvals[ds_idx + 1], endptr);
1095 return -1;
1096 }
1097 rate = pdp_new[ds_idx] / interval;
1098 break;
1099 case DST_GAUGE:
1100 old_locale = setlocale(LC_NUMERIC, "C");
1101 errno = 0;
1102 pdp_new[ds_idx] =
1103 strtod(updvals[ds_idx + 1], &endptr) * interval;
1104 if (errno) {
1105 rrd_set_error("converting '%s' to float: %s",
1106 updvals[ds_idx + 1], rrd_strerror(errno));
1107 return -1;
1108 };
1109 setlocale(LC_NUMERIC, old_locale);
1110 if (endptr[0] != '\0') {
1111 rrd_set_error
1112 ("conversion of '%s' to float not complete: tail '%s'",
1113 updvals[ds_idx + 1], endptr);
1114 return -1;
1115 }
1116 rate = pdp_new[ds_idx] / interval;
1117 break;
1118 default:
1119 rrd_set_error("rrd contains unknown DS type : '%s'",
1120 rrd->ds_def[ds_idx].dst);
1121 return -1;
1122 }
1123 /* break out of this for loop if the error string is set */
1124 if (rrd_test_error()) {
1125 return -1;
1126 }
1127 /* make sure pdp_temp is neither too large or too small
1128 * if any of these occur it becomes unknown ...
1129 * sorry folks ... */
1130 if (!isnan(rate) &&
1131 ((!isnan(rrd->ds_def[ds_idx].par[DS_max_val].u_val) &&
1132 rate > rrd->ds_def[ds_idx].par[DS_max_val].u_val) ||
1133 (!isnan(rrd->ds_def[ds_idx].par[DS_min_val].u_val) &&
1134 rate < rrd->ds_def[ds_idx].par[DS_min_val].u_val))) {
1135 pdp_new[ds_idx] = DNAN;
1136 }
1137 } else {
1138 /* no news is news all the same */
1139 pdp_new[ds_idx] = DNAN;
1140 }
1143 /* make a copy of the command line argument for the next run */
1144 #ifdef DEBUG
1145 fprintf(stderr, "prep ds[%lu]\t"
1146 "last_arg '%s'\t"
1147 "this_arg '%s'\t"
1148 "pdp_new %10.2f\n",
1149 ds_idx, rrd->pdp_prep[ds_idx].last_ds, updvals[ds_idx + 1],
1150 pdp_new[ds_idx]);
1151 #endif
1152 strncpy(rrd->pdp_prep[ds_idx].last_ds, updvals[ds_idx + 1],
1153 LAST_DS_LEN - 1);
1154 rrd->pdp_prep[ds_idx].last_ds[LAST_DS_LEN - 1] = '\0';
1155 }
1156 return 0;
1157 }
1159 /*
1160 * How many PDP steps have elapsed since the last update? Returns the answer,
1161 * and stores the time between the last update and the last PDP in pre_time,
1162 * and the time between the last PDP and the current time in post_int.
1163 */
1164 static int calculate_elapsed_steps(
1165 rrd_t *rrd,
1166 unsigned long current_time,
1167 unsigned long current_time_usec,
1168 double interval,
1169 double *pre_int,
1170 double *post_int,
1171 unsigned long *proc_pdp_cnt)
1172 {
1173 unsigned long proc_pdp_st; /* which pdp_st was the last to be processed */
1174 unsigned long occu_pdp_st; /* when was the pdp_st before the last update
1175 * time */
1176 unsigned long proc_pdp_age; /* how old was the data in the pdp prep area
1177 * when it was last updated */
1178 unsigned long occu_pdp_age; /* how long ago was the last pdp_step time */
1180 /* when was the current pdp started */
1181 proc_pdp_age = rrd->live_head->last_up % rrd->stat_head->pdp_step;
1182 proc_pdp_st = rrd->live_head->last_up - proc_pdp_age;
1184 /* when did the last pdp_st occur */
1185 occu_pdp_age = current_time % rrd->stat_head->pdp_step;
1186 occu_pdp_st = current_time - occu_pdp_age;
1188 if (occu_pdp_st > proc_pdp_st) {
1189 /* OK we passed the pdp_st moment */
1190 *pre_int = (long) occu_pdp_st - rrd->live_head->last_up; /* how much of the input data
1191 * occurred before the latest
1192 * pdp_st moment*/
1193 *pre_int -= ((double) rrd->live_head->last_up_usec) / 1e6f; /* adjust usecs */
1194 *post_int = occu_pdp_age; /* how much after it */
1195 *post_int += ((double) current_time_usec) / 1e6f; /* adjust usecs */
1196 } else {
1197 *pre_int = interval;
1198 *post_int = 0;
1199 }
1201 *proc_pdp_cnt = proc_pdp_st / rrd->stat_head->pdp_step;
1203 #ifdef DEBUG
1204 printf("proc_pdp_age %lu\t"
1205 "proc_pdp_st %lu\t"
1206 "occu_pfp_age %lu\t"
1207 "occu_pdp_st %lu\t"
1208 "int %lf\t"
1209 "pre_int %lf\t"
1210 "post_int %lf\n", proc_pdp_age, proc_pdp_st,
1211 occu_pdp_age, occu_pdp_st, interval, *pre_int, *post_int);
1212 #endif
1214 /* compute the number of elapsed pdp_st moments */
1215 return (occu_pdp_st - proc_pdp_st) / rrd->stat_head->pdp_step;
1216 }
1218 /*
1219 * Increment the PDP values by the values in pdp_new, or else initialize them.
1220 */
1221 static void simple_update(
1222 rrd_t *rrd,
1223 double interval,
1224 rrd_value_t *pdp_new)
1225 {
1226 int i;
1228 for (i = 0; i < (signed) rrd->stat_head->ds_cnt; i++) {
1229 if (isnan(pdp_new[i])) {
1230 /* this is not really accurate if we use subsecond data arrival time
1231 should have thought of it when going subsecond resolution ...
1232 sorry next format change we will have it! */
1233 rrd->pdp_prep[i].scratch[PDP_unkn_sec_cnt].u_cnt +=
1234 floor(interval);
1235 } else {
1236 if (isnan(rrd->pdp_prep[i].scratch[PDP_val].u_val)) {
1237 rrd->pdp_prep[i].scratch[PDP_val].u_val = pdp_new[i];
1238 } else {
1239 rrd->pdp_prep[i].scratch[PDP_val].u_val += pdp_new[i];
1240 }
1241 }
1242 #ifdef DEBUG
1243 fprintf(stderr,
1244 "NO PDP ds[%i]\t"
1245 "value %10.2f\t"
1246 "unkn_sec %5lu\n",
1247 i,
1248 rrd->pdp_prep[i].scratch[PDP_val].u_val,
1249 rrd->pdp_prep[i].scratch[PDP_unkn_sec_cnt].u_cnt);
1250 #endif
1251 }
1252 }
1254 /*
1255 * Call process_pdp_st for each DS.
1256 *
1257 * Returns 0 on success, -1 on error.
1258 */
1259 static int process_all_pdp_st(
1260 rrd_t *rrd,
1261 double interval,
1262 double pre_int,
1263 double post_int,
1264 unsigned long elapsed_pdp_st,
1265 rrd_value_t *pdp_new,
1266 rrd_value_t *pdp_temp)
1267 {
1268 unsigned long ds_idx;
1270 /* in pdp_prep[].scratch[PDP_val].u_val we have collected
1271 rate*seconds which occurred up to the last run.
1272 pdp_new[] contains rate*seconds from the latest run.
1273 pdp_temp[] will contain the rate for cdp */
1275 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1276 if (process_pdp_st(rrd, ds_idx, interval, pre_int, post_int,
1277 elapsed_pdp_st * rrd->stat_head->pdp_step,
1278 pdp_new, pdp_temp) == -1) {
1279 return -1;
1280 }
1281 #ifdef DEBUG
1282 fprintf(stderr, "PDP UPD ds[%lu]\t"
1283 "elapsed_pdp_st %lu\t"
1284 "pdp_temp %10.2f\t"
1285 "new_prep %10.2f\t"
1286 "new_unkn_sec %5lu\n",
1287 ds_idx,
1288 elapsed_pdp_st,
1289 pdp_temp[ds_idx],
1290 rrd->pdp_prep[ds_idx].scratch[PDP_val].u_val,
1291 rrd->pdp_prep[ds_idx].scratch[PDP_unkn_sec_cnt].u_cnt);
1292 #endif
1293 }
1294 return 0;
1295 }
1297 /*
1298 * Process an update that occurs after one of the PDP moments.
1299 * Increments the PDP value, sets NAN if time greater than the
1300 * heartbeats have elapsed, processes CDEFs.
1301 *
1302 * Returns 0 on success, -1 on error.
1303 */
1304 static int process_pdp_st(
1305 rrd_t *rrd,
1306 unsigned long ds_idx,
1307 double interval,
1308 double pre_int,
1309 double post_int,
1310 long diff_pdp_st, /* number of seconds in full steps passed since last update */
1311 rrd_value_t *pdp_new,
1312 rrd_value_t *pdp_temp)
1313 {
1314 int i;
1316 /* update pdp_prep to the current pdp_st. */
1317 double pre_unknown = 0.0;
1318 unival *scratch = rrd->pdp_prep[ds_idx].scratch;
1319 unsigned long mrhb = rrd->ds_def[ds_idx].par[DS_mrhb_cnt].u_cnt;
1321 rpnstack_t rpnstack; /* used for COMPUTE DS */
1323 rpnstack_init(&rpnstack);
1326 if (isnan(pdp_new[ds_idx])) {
1327 /* a final bit of unknown to be added before calculation
1328 we use a temporary variable for this so that we
1329 don't have to turn integer lines before using the value */
1330 pre_unknown = pre_int;
1331 } else {
1332 if (isnan(scratch[PDP_val].u_val)) {
1333 scratch[PDP_val].u_val = 0;
1334 }
1335 scratch[PDP_val].u_val += pdp_new[ds_idx] / interval * pre_int;
1336 }
1338 /* if too much of the pdp_prep is unknown we dump it */
1339 /* if the interval is larger thatn mrhb we get NAN */
1340 if ((interval > mrhb) ||
1341 (rrd->stat_head->pdp_step / 2.0 <
1342 (signed) scratch[PDP_unkn_sec_cnt].u_cnt)) {
1343 pdp_temp[ds_idx] = DNAN;
1344 } else {
1345 pdp_temp[ds_idx] = scratch[PDP_val].u_val /
1346 ((double) (diff_pdp_st - scratch[PDP_unkn_sec_cnt].u_cnt) -
1347 pre_unknown);
1348 }
1350 /* process CDEF data sources; remember each CDEF DS can
1351 * only reference other DS with a lower index number */
1352 if (dst_conv(rrd->ds_def[ds_idx].dst) == DST_CDEF) {
1353 rpnp_t *rpnp;
1355 rpnp =
1356 rpn_expand((rpn_cdefds_t *) &(rrd->ds_def[ds_idx].par[DS_cdef]));
1357 /* substitute data values for OP_VARIABLE nodes */
1358 for (i = 0; rpnp[i].op != OP_END; i++) {
1359 if (rpnp[i].op == OP_VARIABLE) {
1360 rpnp[i].op = OP_NUMBER;
1361 rpnp[i].val = pdp_temp[rpnp[i].ptr];
1362 }
1363 }
1364 /* run the rpn calculator */
1365 if (rpn_calc(rpnp, &rpnstack, 0, pdp_temp, ds_idx) == -1) {
1366 free(rpnp);
1367 rpnstack_free(&rpnstack);
1368 return -1;
1369 }
1370 }
1372 /* make pdp_prep ready for the next run */
1373 if (isnan(pdp_new[ds_idx])) {
1374 /* this is not realy accurate if we use subsecond data arival time
1375 should have thought of it when going subsecond resolution ...
1376 sorry next format change we will have it! */
1377 scratch[PDP_unkn_sec_cnt].u_cnt = floor(post_int);
1378 scratch[PDP_val].u_val = DNAN;
1379 } else {
1380 scratch[PDP_unkn_sec_cnt].u_cnt = 0;
1381 scratch[PDP_val].u_val = pdp_new[ds_idx] / interval * post_int;
1382 }
1383 rpnstack_free(&rpnstack);
1384 return 0;
1385 }
1387 /*
1388 * Iterate over all the RRAs for a given DS and:
1389 * 1. Decide whether to schedule a smooth later
1390 * 2. Decide whether to skip updating SEASONAL and DEVSEASONAL
1391 * 3. Update the CDP
1392 *
1393 * Returns 0 on success, -1 on error
1394 */
1395 static int update_all_cdp_prep(
1396 rrd_t *rrd,
1397 unsigned long *rra_step_cnt,
1398 unsigned long rra_begin,
1399 rrd_file_t *rrd_file,
1400 unsigned long elapsed_pdp_st,
1401 unsigned long proc_pdp_cnt,
1402 rrd_value_t **last_seasonal_coef,
1403 rrd_value_t **seasonal_coef,
1404 rrd_value_t *pdp_temp,
1405 unsigned long *skip_update,
1406 int *schedule_smooth)
1407 {
1408 unsigned long rra_idx;
1410 /* index into the CDP scratch array */
1411 enum cf_en current_cf;
1412 unsigned long rra_start;
1414 /* number of rows to be updated in an RRA for a data value. */
1415 unsigned long start_pdp_offset;
1417 rra_start = rra_begin;
1418 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1419 current_cf = cf_conv(rrd->rra_def[rra_idx].cf_nam);
1420 start_pdp_offset =
1421 rrd->rra_def[rra_idx].pdp_cnt -
1422 proc_pdp_cnt % rrd->rra_def[rra_idx].pdp_cnt;
1423 skip_update[rra_idx] = 0;
1424 if (start_pdp_offset <= elapsed_pdp_st) {
1425 rra_step_cnt[rra_idx] = (elapsed_pdp_st - start_pdp_offset) /
1426 rrd->rra_def[rra_idx].pdp_cnt + 1;
1427 } else {
1428 rra_step_cnt[rra_idx] = 0;
1429 }
1431 if (current_cf == CF_SEASONAL || current_cf == CF_DEVSEASONAL) {
1432 /* If this is a bulk update, we need to skip ahead in the seasonal arrays
1433 * so that they will be correct for the next observed value; note that for
1434 * the bulk update itself, no update will occur to DEVSEASONAL or SEASONAL;
1435 * futhermore, HWPREDICT and DEVPREDICT will be set to DNAN. */
1436 if (rra_step_cnt[rra_idx] > 1) {
1437 skip_update[rra_idx] = 1;
1438 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1439 elapsed_pdp_st, last_seasonal_coef);
1440 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1441 elapsed_pdp_st + 1, seasonal_coef);
1442 }
1443 /* periodically run a smoother for seasonal effects */
1444 if (do_schedule_smooth(rrd, rra_idx, elapsed_pdp_st)) {
1445 #ifdef DEBUG
1446 fprintf(stderr,
1447 "schedule_smooth: cur_row %lu, elapsed_pdp_st %lu, smooth idx %lu\n",
1448 rrd->rra_ptr[rra_idx].cur_row, elapsed_pdp_st,
1449 rrd->rra_def[rra_idx].par[RRA_seasonal_smooth_idx].
1450 u_cnt);
1451 #endif
1452 *schedule_smooth = 1;
1453 }
1454 }
1455 if (rrd_test_error())
1456 return -1;
1458 if (update_cdp_prep
1459 (rrd, elapsed_pdp_st, start_pdp_offset, rra_step_cnt, rra_idx,
1460 pdp_temp, *last_seasonal_coef, *seasonal_coef,
1461 current_cf) == -1) {
1462 return -1;
1463 }
1464 rra_start +=
1465 rrd->rra_def[rra_idx].row_cnt * rrd->stat_head->ds_cnt *
1466 sizeof(rrd_value_t);
1467 }
1468 return 0;
1469 }
1471 /*
1472 * Are we due for a smooth? Also increments our position in the burn-in cycle.
1473 */
1474 static int do_schedule_smooth(
1475 rrd_t *rrd,
1476 unsigned long rra_idx,
1477 unsigned long elapsed_pdp_st)
1478 {
1479 unsigned long cdp_idx = rra_idx * (rrd->stat_head->ds_cnt);
1480 unsigned long cur_row = rrd->rra_ptr[rra_idx].cur_row;
1481 unsigned long row_cnt = rrd->rra_def[rra_idx].row_cnt;
1482 unsigned long seasonal_smooth_idx =
1483 rrd->rra_def[rra_idx].par[RRA_seasonal_smooth_idx].u_cnt;
1484 unsigned long *init_seasonal =
1485 &(rrd->cdp_prep[cdp_idx].scratch[CDP_init_seasonal].u_cnt);
1487 /* Need to use first cdp parameter buffer to track burnin (burnin requires
1488 * a specific smoothing schedule). The CDP_init_seasonal parameter is
1489 * really an RRA level, not a data source within RRA level parameter, but
1490 * the rra_def is read only for rrd_update (not flushed to disk). */
1491 if (*init_seasonal > BURNIN_CYCLES) {
1492 /* someone has no doubt invented a trick to deal with this wrap around,
1493 * but at least this code is clear. */
1494 if (seasonal_smooth_idx > cur_row) {
1495 /* here elapsed_pdp_st = rra_step_cnt[rra_idx] because of 1-1 mapping
1496 * between PDP and CDP */
1497 return (cur_row + elapsed_pdp_st >= seasonal_smooth_idx);
1498 }
1499 /* can't rely on negative numbers because we are working with
1500 * unsigned values */
1501 return (cur_row + elapsed_pdp_st >= row_cnt
1502 && cur_row + elapsed_pdp_st >= row_cnt + seasonal_smooth_idx);
1503 }
1504 /* mark off one of the burn-in cycles */
1505 return (cur_row + elapsed_pdp_st >= row_cnt && ++(*init_seasonal));
1506 }
1508 /*
1509 * For a given RRA, iterate over the data sources and call the appropriate
1510 * consolidation function.
1511 *
1512 * Returns 0 on success, -1 on error.
1513 */
1514 static int update_cdp_prep(
1515 rrd_t *rrd,
1516 unsigned long elapsed_pdp_st,
1517 unsigned long start_pdp_offset,
1518 unsigned long *rra_step_cnt,
1519 int rra_idx,
1520 rrd_value_t *pdp_temp,
1521 rrd_value_t *last_seasonal_coef,
1522 rrd_value_t *seasonal_coef,
1523 int current_cf)
1524 {
1525 unsigned long ds_idx, cdp_idx;
1527 /* update CDP_PREP areas */
1528 /* loop over data soures within each RRA */
1529 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1531 cdp_idx = rra_idx * rrd->stat_head->ds_cnt + ds_idx;
1533 if (rrd->rra_def[rra_idx].pdp_cnt > 1) {
1534 update_cdp(rrd->cdp_prep[cdp_idx].scratch, current_cf,
1535 pdp_temp[ds_idx], rra_step_cnt[rra_idx],
1536 elapsed_pdp_st, start_pdp_offset,
1537 rrd->rra_def[rra_idx].pdp_cnt,
1538 rrd->rra_def[rra_idx].par[RRA_cdp_xff_val].u_val,
1539 rra_idx, ds_idx);
1540 } else {
1541 /* Nothing to consolidate if there's one PDP per CDP. However, if
1542 * we've missed some PDPs, let's update null counters etc. */
1543 if (elapsed_pdp_st > 2) {
1544 reset_cdp(rrd, elapsed_pdp_st, pdp_temp, last_seasonal_coef,
1545 seasonal_coef, rra_idx, ds_idx, cdp_idx,
1546 current_cf);
1547 }
1548 }
1550 if (rrd_test_error())
1551 return -1;
1552 } /* endif data sources loop */
1553 return 0;
1554 }
1556 /*
1557 * Given the new reading (pdp_temp_val), update or initialize the CDP value,
1558 * primary value, secondary value, and # of unknowns.
1559 */
1560 static void update_cdp(
1561 unival *scratch,
1562 int current_cf,
1563 rrd_value_t pdp_temp_val,
1564 unsigned long rra_step_cnt,
1565 unsigned long elapsed_pdp_st,
1566 unsigned long start_pdp_offset,
1567 unsigned long pdp_cnt,
1568 rrd_value_t xff,
1569 int i,
1570 int ii)
1571 {
1572 /* shorthand variables */
1573 rrd_value_t *cdp_val = &scratch[CDP_val].u_val;
1574 rrd_value_t *cdp_primary_val = &scratch[CDP_primary_val].u_val;
1575 rrd_value_t *cdp_secondary_val = &scratch[CDP_secondary_val].u_val;
1576 unsigned long *cdp_unkn_pdp_cnt = &scratch[CDP_unkn_pdp_cnt].u_cnt;
1578 if (rra_step_cnt) {
1579 /* If we are in this block, as least 1 CDP value will be written to
1580 * disk, this is the CDP_primary_val entry. If more than 1 value needs
1581 * to be written, then the "fill in" value is the CDP_secondary_val
1582 * entry. */
1583 if (isnan(pdp_temp_val)) {
1584 *cdp_unkn_pdp_cnt += start_pdp_offset;
1585 *cdp_secondary_val = DNAN;
1586 } else {
1587 /* CDP_secondary value is the RRA "fill in" value for intermediary
1588 * CDP data entries. No matter the CF, the value is the same because
1589 * the average, max, min, and last of a list of identical values is
1590 * the same, namely, the value itself. */
1591 *cdp_secondary_val = pdp_temp_val;
1592 }
1594 if (*cdp_unkn_pdp_cnt > pdp_cnt * xff) {
1595 *cdp_primary_val = DNAN;
1596 if (current_cf == CF_AVERAGE) {
1597 *cdp_val =
1598 initialize_average_carry_over(pdp_temp_val,
1599 elapsed_pdp_st,
1600 start_pdp_offset, pdp_cnt);
1601 } else {
1602 *cdp_val = pdp_temp_val;
1603 }
1604 } else {
1605 initialize_cdp_val(scratch, current_cf, pdp_temp_val,
1606 elapsed_pdp_st, start_pdp_offset, pdp_cnt);
1607 } /* endif meets xff value requirement for a valid value */
1608 /* initialize carry over CDP_unkn_pdp_cnt, this must after CDP_primary_val
1609 * is set because CDP_unkn_pdp_cnt is required to compute that value. */
1610 if (isnan(pdp_temp_val))
1611 *cdp_unkn_pdp_cnt = (elapsed_pdp_st - start_pdp_offset) % pdp_cnt;
1612 else
1613 *cdp_unkn_pdp_cnt = 0;
1614 } else { /* rra_step_cnt[i] == 0 */
1616 #ifdef DEBUG
1617 if (isnan(*cdp_val)) {
1618 fprintf(stderr, "schedule CDP_val update, RRA %d DS %d, DNAN\n",
1619 i, ii);
1620 } else {
1621 fprintf(stderr, "schedule CDP_val update, RRA %d DS %d, %10.2f\n",
1622 i, ii, *cdp_val);
1623 }
1624 #endif
1625 if (isnan(pdp_temp_val)) {
1626 *cdp_unkn_pdp_cnt += elapsed_pdp_st;
1627 } else {
1628 *cdp_val =
1629 calculate_cdp_val(*cdp_val, pdp_temp_val, elapsed_pdp_st,
1630 current_cf, i, ii);
1631 }
1632 }
1633 }
1635 /*
1636 * Set the CDP_primary_val and CDP_val to the appropriate initial value based
1637 * on the type of consolidation function.
1638 */
1639 static void initialize_cdp_val(
1640 unival *scratch,
1641 int current_cf,
1642 rrd_value_t pdp_temp_val,
1643 unsigned long elapsed_pdp_st,
1644 unsigned long start_pdp_offset,
1645 unsigned long pdp_cnt)
1646 {
1647 rrd_value_t cum_val, cur_val;
1649 switch (current_cf) {
1650 case CF_AVERAGE:
1651 cum_val = IFDNAN(scratch[CDP_val].u_val, 0.0);
1652 cur_val = IFDNAN(pdp_temp_val, 0.0);
1653 scratch[CDP_primary_val].u_val =
1654 (cum_val + cur_val * start_pdp_offset) /
1655 (pdp_cnt - scratch[CDP_unkn_pdp_cnt].u_cnt);
1656 scratch[CDP_val].u_val =
1657 initialize_average_carry_over(pdp_temp_val, elapsed_pdp_st,
1658 start_pdp_offset, pdp_cnt);
1659 break;
1660 case CF_MAXIMUM:
1661 cum_val = IFDNAN(scratch[CDP_val].u_val, -DINF);
1662 cur_val = IFDNAN(pdp_temp_val, -DINF);
1663 #if 0
1664 #ifdef DEBUG
1665 if (isnan(scratch[CDP_val].u_val) && isnan(pdp_temp)) {
1666 fprintf(stderr,
1667 "RRA %lu, DS %lu, both CDP_val and pdp_temp are DNAN!",
1668 i, ii);
1669 exit(-1);
1670 }
1671 #endif
1672 #endif
1673 if (cur_val > cum_val)
1674 scratch[CDP_primary_val].u_val = cur_val;
1675 else
1676 scratch[CDP_primary_val].u_val = cum_val;
1677 /* initialize carry over value */
1678 scratch[CDP_val].u_val = pdp_temp_val;
1679 break;
1680 case CF_MINIMUM:
1681 cum_val = IFDNAN(scratch[CDP_val].u_val, DINF);
1682 cur_val = IFDNAN(pdp_temp_val, DINF);
1683 #if 0
1684 #ifdef DEBUG
1685 if (isnan(scratch[CDP_val].u_val) && isnan(pdp_temp)) {
1686 fprintf(stderr,
1687 "RRA %lu, DS %lu, both CDP_val and pdp_temp are DNAN!", i,
1688 ii);
1689 exit(-1);
1690 }
1691 #endif
1692 #endif
1693 if (cur_val < cum_val)
1694 scratch[CDP_primary_val].u_val = cur_val;
1695 else
1696 scratch[CDP_primary_val].u_val = cum_val;
1697 /* initialize carry over value */
1698 scratch[CDP_val].u_val = pdp_temp_val;
1699 break;
1700 case CF_LAST:
1701 default:
1702 scratch[CDP_primary_val].u_val = pdp_temp_val;
1703 /* initialize carry over value */
1704 scratch[CDP_val].u_val = pdp_temp_val;
1705 break;
1706 }
1707 }
1709 /*
1710 * Update the consolidation function for Holt-Winters functions as
1711 * well as other functions that don't actually consolidate multiple
1712 * PDPs.
1713 */
1714 static void reset_cdp(
1715 rrd_t *rrd,
1716 unsigned long elapsed_pdp_st,
1717 rrd_value_t *pdp_temp,
1718 rrd_value_t *last_seasonal_coef,
1719 rrd_value_t *seasonal_coef,
1720 int rra_idx,
1721 int ds_idx,
1722 int cdp_idx,
1723 enum cf_en current_cf)
1724 {
1725 unival *scratch = rrd->cdp_prep[cdp_idx].scratch;
1727 switch (current_cf) {
1728 case CF_AVERAGE:
1729 default:
1730 scratch[CDP_primary_val].u_val = pdp_temp[ds_idx];
1731 scratch[CDP_secondary_val].u_val = pdp_temp[ds_idx];
1732 break;
1733 case CF_SEASONAL:
1734 case CF_DEVSEASONAL:
1735 /* need to update cached seasonal values, so they are consistent
1736 * with the bulk update */
1737 /* WARNING: code relies on the fact that CDP_hw_last_seasonal and
1738 * CDP_last_deviation are the same. */
1739 scratch[CDP_hw_last_seasonal].u_val = last_seasonal_coef[ds_idx];
1740 scratch[CDP_hw_seasonal].u_val = seasonal_coef[ds_idx];
1741 break;
1742 case CF_HWPREDICT:
1743 case CF_MHWPREDICT:
1744 /* need to update the null_count and last_null_count.
1745 * even do this for non-DNAN pdp_temp because the
1746 * algorithm is not learning from batch updates. */
1747 scratch[CDP_null_count].u_cnt += elapsed_pdp_st;
1748 scratch[CDP_last_null_count].u_cnt += elapsed_pdp_st - 1;
1749 /* fall through */
1750 case CF_DEVPREDICT:
1751 scratch[CDP_primary_val].u_val = DNAN;
1752 scratch[CDP_secondary_val].u_val = DNAN;
1753 break;
1754 case CF_FAILURES:
1755 /* do not count missed bulk values as failures */
1756 scratch[CDP_primary_val].u_val = 0;
1757 scratch[CDP_secondary_val].u_val = 0;
1758 /* need to reset violations buffer.
1759 * could do this more carefully, but for now, just
1760 * assume a bulk update wipes away all violations. */
1761 erase_violations(rrd, cdp_idx, rra_idx);
1762 break;
1763 }
1764 }
1766 static rrd_value_t initialize_average_carry_over(
1767 rrd_value_t pdp_temp_val,
1768 unsigned long elapsed_pdp_st,
1769 unsigned long start_pdp_offset,
1770 unsigned long pdp_cnt)
1771 {
1772 /* initialize carry over value */
1773 if (isnan(pdp_temp_val)) {
1774 return DNAN;
1775 }
1776 return pdp_temp_val * ((elapsed_pdp_st - start_pdp_offset) % pdp_cnt);
1777 }
1779 /*
1780 * Update or initialize a CDP value based on the consolidation
1781 * function.
1782 *
1783 * Returns the new value.
1784 */
1785 static rrd_value_t calculate_cdp_val(
1786 rrd_value_t cdp_val,
1787 rrd_value_t pdp_temp_val,
1788 unsigned long elapsed_pdp_st,
1789 int current_cf,
1790 #ifdef DEBUG
1791 int i,
1792 int ii
1793 #else
1794 int UNUSED(i),
1795 int UNUSED(ii)
1796 #endif
1797 )
1798 {
1799 if (isnan(cdp_val)) {
1800 if (current_cf == CF_AVERAGE) {
1801 pdp_temp_val *= elapsed_pdp_st;
1802 }
1803 #ifdef DEBUG
1804 fprintf(stderr, "Initialize CDP_val for RRA %d DS %d: %10.2f\n",
1805 i, ii, pdp_temp_val);
1806 #endif
1807 return pdp_temp_val;
1808 }
1809 if (current_cf == CF_AVERAGE)
1810 return cdp_val + pdp_temp_val * elapsed_pdp_st;
1811 if (current_cf == CF_MINIMUM)
1812 return (pdp_temp_val < cdp_val) ? pdp_temp_val : cdp_val;
1813 if (current_cf == CF_MAXIMUM)
1814 return (pdp_temp_val > cdp_val) ? pdp_temp_val : cdp_val;
1816 return pdp_temp_val;
1817 }
1819 /*
1820 * For each RRA, update the seasonal values and then call update_aberrant_CF
1821 * for each data source.
1822 *
1823 * Return 0 on success, -1 on error.
1824 */
1825 static int update_aberrant_cdps(
1826 rrd_t *rrd,
1827 rrd_file_t *rrd_file,
1828 unsigned long rra_begin,
1829 unsigned long elapsed_pdp_st,
1830 rrd_value_t *pdp_temp,
1831 rrd_value_t **seasonal_coef)
1832 {
1833 unsigned long rra_idx, ds_idx, j;
1835 /* number of PDP steps since the last update that
1836 * are assigned to the first CDP to be generated
1837 * since the last update. */
1838 unsigned short scratch_idx;
1839 unsigned long rra_start;
1840 enum cf_en current_cf;
1842 /* this loop is only entered if elapsed_pdp_st < 3 */
1843 for (j = elapsed_pdp_st, scratch_idx = CDP_primary_val;
1844 j > 0 && j < 3; j--, scratch_idx = CDP_secondary_val) {
1845 rra_start = rra_begin;
1846 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1847 if (rrd->rra_def[rra_idx].pdp_cnt == 1) {
1848 current_cf = cf_conv(rrd->rra_def[rra_idx].cf_nam);
1849 if (current_cf == CF_SEASONAL || current_cf == CF_DEVSEASONAL) {
1850 if (scratch_idx == CDP_primary_val) {
1851 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1852 elapsed_pdp_st + 1, seasonal_coef);
1853 } else {
1854 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1855 elapsed_pdp_st + 2, seasonal_coef);
1856 }
1857 }
1858 if (rrd_test_error())
1859 return -1;
1860 /* loop over data soures within each RRA */
1861 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1862 update_aberrant_CF(rrd, pdp_temp[ds_idx], current_cf,
1863 rra_idx * (rrd->stat_head->ds_cnt) +
1864 ds_idx, rra_idx, ds_idx, scratch_idx,
1865 *seasonal_coef);
1866 }
1867 }
1868 rra_start += rrd->rra_def[rra_idx].row_cnt
1869 * rrd->stat_head->ds_cnt * sizeof(rrd_value_t);
1870 }
1871 }
1872 return 0;
1873 }
1875 /*
1876 * Move sequentially through the file, writing one RRA at a time. Note this
1877 * architecture divorces the computation of CDP with flushing updated RRA
1878 * entries to disk.
1879 *
1880 * Return 0 on success, -1 on error.
1881 */
1882 static int write_to_rras(
1883 rrd_t *rrd,
1884 rrd_file_t *rrd_file,
1885 unsigned long *rra_step_cnt,
1886 unsigned long rra_begin,
1887 time_t current_time,
1888 unsigned long *skip_update,
1889 rrd_info_t ** pcdp_summary)
1890 {
1891 unsigned long rra_idx;
1892 unsigned long rra_start;
1893 time_t rra_time = 0; /* time of update for a RRA */
1895 unsigned long ds_cnt = rrd->stat_head->ds_cnt;
1897 /* Ready to write to disk */
1898 rra_start = rra_begin;
1900 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1901 rra_def_t *rra_def = &rrd->rra_def[rra_idx];
1902 rra_ptr_t *rra_ptr = &rrd->rra_ptr[rra_idx];
1904 /* for cdp_prep */
1905 unsigned short scratch_idx;
1906 unsigned long step_subtract;
1908 for (scratch_idx = CDP_primary_val,
1909 step_subtract = 1;
1910 rra_step_cnt[rra_idx] > 0;
1911 rra_step_cnt[rra_idx]--,
1912 scratch_idx = CDP_secondary_val,
1913 step_subtract = 2) {
1915 size_t rra_pos_new;
1916 #ifdef DEBUG
1917 fprintf(stderr, " -- RRA Preseek %ld\n", rrd_file->pos);
1918 #endif
1919 /* increment, with wrap-around */
1920 if (++rra_ptr->cur_row >= rra_def->row_cnt)
1921 rra_ptr->cur_row = 0;
1923 /* we know what our position should be */
1924 rra_pos_new = rra_start
1925 + ds_cnt * rra_ptr->cur_row * sizeof(rrd_value_t);
1927 /* re-seek if the position is wrong or we wrapped around */
1928 if ((size_t)rra_pos_new != rrd_file->pos) {
1929 if (rrd_seek(rrd_file, rra_pos_new, SEEK_SET) != 0) {
1930 rrd_set_error("seek error in rrd");
1931 return -1;
1932 }
1933 }
1934 #ifdef DEBUG
1935 fprintf(stderr, " -- RRA Postseek %ld\n", rrd_file->pos);
1936 #endif
1938 if (skip_update[rra_idx])
1939 continue;
1941 if (*pcdp_summary != NULL) {
1942 unsigned long step_time = rra_def->pdp_cnt * rrd->stat_head->pdp_step;
1944 rra_time = (current_time - current_time % step_time)
1945 - ((rra_step_cnt[rra_idx] - step_subtract) * step_time);
1946 }
1948 if (write_RRA_row
1949 (rrd_file, rrd, rra_idx, scratch_idx,
1950 pcdp_summary, rra_time) == -1)
1951 return -1;
1953 rrd_notify_row(rrd_file, rra_idx, rra_pos_new, rra_time);
1954 }
1956 rra_start += rra_def->row_cnt * ds_cnt * sizeof(rrd_value_t);
1957 } /* RRA LOOP */
1959 return 0;
1960 }
1962 /*
1963 * Write out one row of values (one value per DS) to the archive.
1964 *
1965 * Returns 0 on success, -1 on error.
1966 */
1967 static int write_RRA_row(
1968 rrd_file_t *rrd_file,
1969 rrd_t *rrd,
1970 unsigned long rra_idx,
1971 unsigned short CDP_scratch_idx,
1972 rrd_info_t ** pcdp_summary,
1973 time_t rra_time)
1974 {
1975 unsigned long ds_idx, cdp_idx;
1976 rrd_infoval_t iv;
1978 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1979 /* compute the cdp index */
1980 cdp_idx = rra_idx * (rrd->stat_head->ds_cnt) + ds_idx;
1981 #ifdef DEBUG
1982 fprintf(stderr, " -- RRA WRITE VALUE %e, at %ld CF:%s\n",
1983 rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].u_val,
1984 rrd_file->pos, rrd->rra_def[rra_idx].cf_nam);
1985 #endif
1986 if (*pcdp_summary != NULL) {
1987 iv.u_val = rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].u_val;
1988 /* append info to the return hash */
1989 *pcdp_summary = rrd_info_push(*pcdp_summary,
1990 sprintf_alloc
1991 ("[%lli]RRA[%s][%lu]DS[%s]",
1992 (long long)rra_time,
1993 rrd->rra_def[rra_idx].cf_nam,
1994 rrd->rra_def[rra_idx].pdp_cnt,
1995 rrd->ds_def[ds_idx].ds_nam),
1996 RD_I_VAL, iv);
1997 }
1998 errno = 0;
1999 if (rrd_write(rrd_file,
2000 &(rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].
2001 u_val), sizeof(rrd_value_t)) != sizeof(rrd_value_t)) {
2002 rrd_set_error("writing rrd: %s", rrd_strerror(errno));
2003 return -1;
2004 }
2005 }
2006 return 0;
2007 }
2009 /*
2010 * Call apply_smoother for all DEVSEASONAL and SEASONAL RRAs.
2011 *
2012 * Returns 0 on success, -1 otherwise
2013 */
2014 static int smooth_all_rras(
2015 rrd_t *rrd,
2016 rrd_file_t *rrd_file,
2017 unsigned long rra_begin)
2018 {
2019 unsigned long rra_start = rra_begin;
2020 unsigned long rra_idx;
2022 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; ++rra_idx) {
2023 if (cf_conv(rrd->rra_def[rra_idx].cf_nam) == CF_DEVSEASONAL ||
2024 cf_conv(rrd->rra_def[rra_idx].cf_nam) == CF_SEASONAL) {
2025 #ifdef DEBUG
2026 fprintf(stderr, "Running smoother for rra %lu\n", rra_idx);
2027 #endif
2028 apply_smoother(rrd, rra_idx, rra_start, rrd_file);
2029 if (rrd_test_error())
2030 return -1;
2031 }
2032 rra_start += rrd->rra_def[rra_idx].row_cnt
2033 * rrd->stat_head->ds_cnt * sizeof(rrd_value_t);
2034 }
2035 return 0;
2036 }
2038 #ifndef HAVE_MMAP
2039 /*
2040 * Flush changes to disk (unless we're using mmap)
2041 *
2042 * Returns 0 on success, -1 otherwise
2043 */
2044 static int write_changes_to_disk(
2045 rrd_t *rrd,
2046 rrd_file_t *rrd_file,
2047 int version)
2048 {
2049 /* we just need to write back the live header portion now */
2050 if (rrd_seek(rrd_file, (sizeof(stat_head_t)
2051 + sizeof(ds_def_t) * rrd->stat_head->ds_cnt
2052 + sizeof(rra_def_t) * rrd->stat_head->rra_cnt),
2053 SEEK_SET) != 0) {
2054 rrd_set_error("seek rrd for live header writeback");
2055 return -1;
2056 }
2057 if (version >= 3) {
2058 if (rrd_write(rrd_file, rrd->live_head,
2059 sizeof(live_head_t) * 1) != sizeof(live_head_t) * 1) {
2060 rrd_set_error("rrd_write live_head to rrd");
2061 return -1;
2062 }
2063 } else {
2064 if (rrd_write(rrd_file, rrd->legacy_last_up,
2065 sizeof(time_t) * 1) != sizeof(time_t) * 1) {
2066 rrd_set_error("rrd_write live_head to rrd");
2067 return -1;
2068 }
2069 }
2072 if (rrd_write(rrd_file, rrd->pdp_prep,
2073 sizeof(pdp_prep_t) * rrd->stat_head->ds_cnt)
2074 != (ssize_t) (sizeof(pdp_prep_t) * rrd->stat_head->ds_cnt)) {
2075 rrd_set_error("rrd_write pdp_prep to rrd");
2076 return -1;
2077 }
2079 if (rrd_write(rrd_file, rrd->cdp_prep,
2080 sizeof(cdp_prep_t) * rrd->stat_head->rra_cnt *
2081 rrd->stat_head->ds_cnt)
2082 != (ssize_t) (sizeof(cdp_prep_t) * rrd->stat_head->rra_cnt *
2083 rrd->stat_head->ds_cnt)) {
2085 rrd_set_error("rrd_write cdp_prep to rrd");
2086 return -1;
2087 }
2089 if (rrd_write(rrd_file, rrd->rra_ptr,
2090 sizeof(rra_ptr_t) * rrd->stat_head->rra_cnt)
2091 != (ssize_t) (sizeof(rra_ptr_t) * rrd->stat_head->rra_cnt)) {
2092 rrd_set_error("rrd_write rra_ptr to rrd");
2093 return -1;
2094 }
2095 return 0;
2096 }
2097 #endif