1 /*****************************************************************************
2 * RRDtool 1.4.3 Copyright by Tobi Oetiker, 1997-2010
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 start_pdp_offset,
216 unsigned long pdp_cnt);
218 static void reset_cdp(
219 rrd_t *rrd,
220 unsigned long elapsed_pdp_st,
221 rrd_value_t *pdp_temp,
222 rrd_value_t *last_seasonal_coef,
223 rrd_value_t *seasonal_coef,
224 int rra_idx,
225 int ds_idx,
226 int cdp_idx,
227 enum cf_en current_cf);
229 static rrd_value_t initialize_carry_over(
230 rrd_value_t pdp_temp_val,
231 int current_cf,
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 if(rpnp == NULL) {
1358 rpnstack_free(&rpnstack);
1359 return -1;
1360 }
1361 /* substitute data values for OP_VARIABLE nodes */
1362 for (i = 0; rpnp[i].op != OP_END; i++) {
1363 if (rpnp[i].op == OP_VARIABLE) {
1364 rpnp[i].op = OP_NUMBER;
1365 rpnp[i].val = pdp_temp[rpnp[i].ptr];
1366 }
1367 }
1368 /* run the rpn calculator */
1369 if (rpn_calc(rpnp, &rpnstack, 0, pdp_temp, ds_idx) == -1) {
1370 free(rpnp);
1371 rpnstack_free(&rpnstack);
1372 return -1;
1373 }
1374 free(rpnp);
1375 }
1377 /* make pdp_prep ready for the next run */
1378 if (isnan(pdp_new[ds_idx])) {
1379 /* this is not realy accurate if we use subsecond data arival time
1380 should have thought of it when going subsecond resolution ...
1381 sorry next format change we will have it! */
1382 scratch[PDP_unkn_sec_cnt].u_cnt = floor(post_int);
1383 scratch[PDP_val].u_val = DNAN;
1384 } else {
1385 scratch[PDP_unkn_sec_cnt].u_cnt = 0;
1386 scratch[PDP_val].u_val = pdp_new[ds_idx] / interval * post_int;
1387 }
1388 rpnstack_free(&rpnstack);
1389 return 0;
1390 }
1392 /*
1393 * Iterate over all the RRAs for a given DS and:
1394 * 1. Decide whether to schedule a smooth later
1395 * 2. Decide whether to skip updating SEASONAL and DEVSEASONAL
1396 * 3. Update the CDP
1397 *
1398 * Returns 0 on success, -1 on error
1399 */
1400 static int update_all_cdp_prep(
1401 rrd_t *rrd,
1402 unsigned long *rra_step_cnt,
1403 unsigned long rra_begin,
1404 rrd_file_t *rrd_file,
1405 unsigned long elapsed_pdp_st,
1406 unsigned long proc_pdp_cnt,
1407 rrd_value_t **last_seasonal_coef,
1408 rrd_value_t **seasonal_coef,
1409 rrd_value_t *pdp_temp,
1410 unsigned long *skip_update,
1411 int *schedule_smooth)
1412 {
1413 unsigned long rra_idx;
1415 /* index into the CDP scratch array */
1416 enum cf_en current_cf;
1417 unsigned long rra_start;
1419 /* number of rows to be updated in an RRA for a data value. */
1420 unsigned long start_pdp_offset;
1422 rra_start = rra_begin;
1423 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1424 current_cf = cf_conv(rrd->rra_def[rra_idx].cf_nam);
1425 start_pdp_offset =
1426 rrd->rra_def[rra_idx].pdp_cnt -
1427 proc_pdp_cnt % rrd->rra_def[rra_idx].pdp_cnt;
1428 skip_update[rra_idx] = 0;
1429 if (start_pdp_offset <= elapsed_pdp_st) {
1430 rra_step_cnt[rra_idx] = (elapsed_pdp_st - start_pdp_offset) /
1431 rrd->rra_def[rra_idx].pdp_cnt + 1;
1432 } else {
1433 rra_step_cnt[rra_idx] = 0;
1434 }
1436 if (current_cf == CF_SEASONAL || current_cf == CF_DEVSEASONAL) {
1437 /* If this is a bulk update, we need to skip ahead in the seasonal arrays
1438 * so that they will be correct for the next observed value; note that for
1439 * the bulk update itself, no update will occur to DEVSEASONAL or SEASONAL;
1440 * futhermore, HWPREDICT and DEVPREDICT will be set to DNAN. */
1441 if (rra_step_cnt[rra_idx] > 1) {
1442 skip_update[rra_idx] = 1;
1443 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1444 elapsed_pdp_st, last_seasonal_coef);
1445 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1446 elapsed_pdp_st + 1, seasonal_coef);
1447 }
1448 /* periodically run a smoother for seasonal effects */
1449 if (do_schedule_smooth(rrd, rra_idx, elapsed_pdp_st)) {
1450 #ifdef DEBUG
1451 fprintf(stderr,
1452 "schedule_smooth: cur_row %lu, elapsed_pdp_st %lu, smooth idx %lu\n",
1453 rrd->rra_ptr[rra_idx].cur_row, elapsed_pdp_st,
1454 rrd->rra_def[rra_idx].par[RRA_seasonal_smooth_idx].
1455 u_cnt);
1456 #endif
1457 *schedule_smooth = 1;
1458 }
1459 }
1460 if (rrd_test_error())
1461 return -1;
1463 if (update_cdp_prep
1464 (rrd, elapsed_pdp_st, start_pdp_offset, rra_step_cnt, rra_idx,
1465 pdp_temp, *last_seasonal_coef, *seasonal_coef,
1466 current_cf) == -1) {
1467 return -1;
1468 }
1469 rra_start +=
1470 rrd->rra_def[rra_idx].row_cnt * rrd->stat_head->ds_cnt *
1471 sizeof(rrd_value_t);
1472 }
1473 return 0;
1474 }
1476 /*
1477 * Are we due for a smooth? Also increments our position in the burn-in cycle.
1478 */
1479 static int do_schedule_smooth(
1480 rrd_t *rrd,
1481 unsigned long rra_idx,
1482 unsigned long elapsed_pdp_st)
1483 {
1484 unsigned long cdp_idx = rra_idx * (rrd->stat_head->ds_cnt);
1485 unsigned long cur_row = rrd->rra_ptr[rra_idx].cur_row;
1486 unsigned long row_cnt = rrd->rra_def[rra_idx].row_cnt;
1487 unsigned long seasonal_smooth_idx =
1488 rrd->rra_def[rra_idx].par[RRA_seasonal_smooth_idx].u_cnt;
1489 unsigned long *init_seasonal =
1490 &(rrd->cdp_prep[cdp_idx].scratch[CDP_init_seasonal].u_cnt);
1492 /* Need to use first cdp parameter buffer to track burnin (burnin requires
1493 * a specific smoothing schedule). The CDP_init_seasonal parameter is
1494 * really an RRA level, not a data source within RRA level parameter, but
1495 * the rra_def is read only for rrd_update (not flushed to disk). */
1496 if (*init_seasonal > BURNIN_CYCLES) {
1497 /* someone has no doubt invented a trick to deal with this wrap around,
1498 * but at least this code is clear. */
1499 if (seasonal_smooth_idx > cur_row) {
1500 /* here elapsed_pdp_st = rra_step_cnt[rra_idx] because of 1-1 mapping
1501 * between PDP and CDP */
1502 return (cur_row + elapsed_pdp_st >= seasonal_smooth_idx);
1503 }
1504 /* can't rely on negative numbers because we are working with
1505 * unsigned values */
1506 return (cur_row + elapsed_pdp_st >= row_cnt
1507 && cur_row + elapsed_pdp_st >= row_cnt + seasonal_smooth_idx);
1508 }
1509 /* mark off one of the burn-in cycles */
1510 return (cur_row + elapsed_pdp_st >= row_cnt && ++(*init_seasonal));
1511 }
1513 /*
1514 * For a given RRA, iterate over the data sources and call the appropriate
1515 * consolidation function.
1516 *
1517 * Returns 0 on success, -1 on error.
1518 */
1519 static int update_cdp_prep(
1520 rrd_t *rrd,
1521 unsigned long elapsed_pdp_st,
1522 unsigned long start_pdp_offset,
1523 unsigned long *rra_step_cnt,
1524 int rra_idx,
1525 rrd_value_t *pdp_temp,
1526 rrd_value_t *last_seasonal_coef,
1527 rrd_value_t *seasonal_coef,
1528 int current_cf)
1529 {
1530 unsigned long ds_idx, cdp_idx;
1532 /* update CDP_PREP areas */
1533 /* loop over data soures within each RRA */
1534 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1536 cdp_idx = rra_idx * rrd->stat_head->ds_cnt + ds_idx;
1538 if (rrd->rra_def[rra_idx].pdp_cnt > 1) {
1539 update_cdp(rrd->cdp_prep[cdp_idx].scratch, current_cf,
1540 pdp_temp[ds_idx], rra_step_cnt[rra_idx],
1541 elapsed_pdp_st, start_pdp_offset,
1542 rrd->rra_def[rra_idx].pdp_cnt,
1543 rrd->rra_def[rra_idx].par[RRA_cdp_xff_val].u_val,
1544 rra_idx, ds_idx);
1545 } else {
1546 /* Nothing to consolidate if there's one PDP per CDP. However, if
1547 * we've missed some PDPs, let's update null counters etc. */
1548 if (elapsed_pdp_st > 2) {
1549 reset_cdp(rrd, elapsed_pdp_st, pdp_temp, last_seasonal_coef,
1550 seasonal_coef, rra_idx, ds_idx, cdp_idx,
1551 current_cf);
1552 }
1553 }
1555 if (rrd_test_error())
1556 return -1;
1557 } /* endif data sources loop */
1558 return 0;
1559 }
1561 /*
1562 * Given the new reading (pdp_temp_val), update or initialize the CDP value,
1563 * primary value, secondary value, and # of unknowns.
1564 */
1565 static void update_cdp(
1566 unival *scratch,
1567 int current_cf,
1568 rrd_value_t pdp_temp_val,
1569 unsigned long rra_step_cnt,
1570 unsigned long elapsed_pdp_st,
1571 unsigned long start_pdp_offset,
1572 unsigned long pdp_cnt,
1573 rrd_value_t xff,
1574 int i,
1575 int ii)
1576 {
1577 /* shorthand variables */
1578 rrd_value_t *cdp_val = &scratch[CDP_val].u_val;
1579 rrd_value_t *cdp_primary_val = &scratch[CDP_primary_val].u_val;
1580 rrd_value_t *cdp_secondary_val = &scratch[CDP_secondary_val].u_val;
1581 unsigned long *cdp_unkn_pdp_cnt = &scratch[CDP_unkn_pdp_cnt].u_cnt;
1583 if (rra_step_cnt) {
1584 /* If we are in this block, as least 1 CDP value will be written to
1585 * disk, this is the CDP_primary_val entry. If more than 1 value needs
1586 * to be written, then the "fill in" value is the CDP_secondary_val
1587 * entry. */
1588 if (isnan(pdp_temp_val)) {
1589 *cdp_unkn_pdp_cnt += start_pdp_offset;
1590 *cdp_secondary_val = DNAN;
1591 } else {
1592 /* CDP_secondary value is the RRA "fill in" value for intermediary
1593 * CDP data entries. No matter the CF, the value is the same because
1594 * the average, max, min, and last of a list of identical values is
1595 * the same, namely, the value itself. */
1596 *cdp_secondary_val = pdp_temp_val;
1597 }
1599 if (*cdp_unkn_pdp_cnt > pdp_cnt * xff) {
1600 *cdp_primary_val = DNAN;
1601 } else {
1602 initialize_cdp_val(scratch, current_cf, pdp_temp_val,
1603 start_pdp_offset, pdp_cnt);
1604 }
1605 *cdp_val =
1606 initialize_carry_over(pdp_temp_val,current_cf,
1607 elapsed_pdp_st,
1608 start_pdp_offset, pdp_cnt);
1609 /* endif meets xff value requirement for a valid value */
1610 /* initialize carry over CDP_unkn_pdp_cnt, this must after CDP_primary_val
1611 * is set because CDP_unkn_pdp_cnt is required to compute that value. */
1612 if (isnan(pdp_temp_val))
1613 *cdp_unkn_pdp_cnt = (elapsed_pdp_st - start_pdp_offset) % pdp_cnt;
1614 else
1615 *cdp_unkn_pdp_cnt = 0;
1616 } else { /* rra_step_cnt[i] == 0 */
1618 #ifdef DEBUG
1619 if (isnan(*cdp_val)) {
1620 fprintf(stderr, "schedule CDP_val update, RRA %d DS %d, DNAN\n",
1621 i, ii);
1622 } else {
1623 fprintf(stderr, "schedule CDP_val update, RRA %d DS %d, %10.2f\n",
1624 i, ii, *cdp_val);
1625 }
1626 #endif
1627 if (isnan(pdp_temp_val)) {
1628 *cdp_unkn_pdp_cnt += elapsed_pdp_st;
1629 } else {
1630 *cdp_val =
1631 calculate_cdp_val(*cdp_val, pdp_temp_val, elapsed_pdp_st,
1632 current_cf, i, ii);
1633 }
1634 }
1635 }
1637 /*
1638 * Set the CDP_primary_val and CDP_val to the appropriate initial value based
1639 * on the type of consolidation function.
1640 */
1641 static void initialize_cdp_val(
1642 unival *scratch,
1643 int current_cf,
1644 rrd_value_t pdp_temp_val,
1645 unsigned long start_pdp_offset,
1646 unsigned long pdp_cnt)
1647 {
1648 rrd_value_t cum_val, cur_val;
1650 switch (current_cf) {
1651 case CF_AVERAGE:
1652 cum_val = IFDNAN(scratch[CDP_val].u_val, 0.0);
1653 cur_val = IFDNAN(pdp_temp_val, 0.0);
1654 scratch[CDP_primary_val].u_val =
1655 (cum_val + cur_val * start_pdp_offset) /
1656 (pdp_cnt - scratch[CDP_unkn_pdp_cnt].u_cnt);
1657 break;
1658 case CF_MAXIMUM:
1659 cum_val = IFDNAN(scratch[CDP_val].u_val, -DINF);
1660 cur_val = IFDNAN(pdp_temp_val, -DINF);
1662 #if 0
1663 #ifdef DEBUG
1664 if (isnan(scratch[CDP_val].u_val) && isnan(pdp_temp)) {
1665 fprintf(stderr,
1666 "RRA %lu, DS %lu, both CDP_val and pdp_temp are DNAN!",
1667 i, ii);
1668 exit(-1);
1669 }
1670 #endif
1671 #endif
1672 if (cur_val > cum_val)
1673 scratch[CDP_primary_val].u_val = cur_val;
1674 else
1675 scratch[CDP_primary_val].u_val = cum_val;
1676 break;
1677 case CF_MINIMUM:
1678 cum_val = IFDNAN(scratch[CDP_val].u_val, DINF);
1679 cur_val = IFDNAN(pdp_temp_val, DINF);
1680 #if 0
1681 #ifdef DEBUG
1682 if (isnan(scratch[CDP_val].u_val) && isnan(pdp_temp)) {
1683 fprintf(stderr,
1684 "RRA %lu, DS %lu, both CDP_val and pdp_temp are DNAN!", i,
1685 ii);
1686 exit(-1);
1687 }
1688 #endif
1689 #endif
1690 if (cur_val < cum_val)
1691 scratch[CDP_primary_val].u_val = cur_val;
1692 else
1693 scratch[CDP_primary_val].u_val = cum_val;
1694 break;
1695 case CF_LAST:
1696 default:
1697 scratch[CDP_primary_val].u_val = pdp_temp_val;
1698 break;
1699 }
1700 }
1702 /*
1703 * Update the consolidation function for Holt-Winters functions as
1704 * well as other functions that don't actually consolidate multiple
1705 * PDPs.
1706 */
1707 static void reset_cdp(
1708 rrd_t *rrd,
1709 unsigned long elapsed_pdp_st,
1710 rrd_value_t *pdp_temp,
1711 rrd_value_t *last_seasonal_coef,
1712 rrd_value_t *seasonal_coef,
1713 int rra_idx,
1714 int ds_idx,
1715 int cdp_idx,
1716 enum cf_en current_cf)
1717 {
1718 unival *scratch = rrd->cdp_prep[cdp_idx].scratch;
1720 switch (current_cf) {
1721 case CF_AVERAGE:
1722 default:
1723 scratch[CDP_primary_val].u_val = pdp_temp[ds_idx];
1724 scratch[CDP_secondary_val].u_val = pdp_temp[ds_idx];
1725 break;
1726 case CF_SEASONAL:
1727 case CF_DEVSEASONAL:
1728 /* need to update cached seasonal values, so they are consistent
1729 * with the bulk update */
1730 /* WARNING: code relies on the fact that CDP_hw_last_seasonal and
1731 * CDP_last_deviation are the same. */
1732 scratch[CDP_hw_last_seasonal].u_val = last_seasonal_coef[ds_idx];
1733 scratch[CDP_hw_seasonal].u_val = seasonal_coef[ds_idx];
1734 break;
1735 case CF_HWPREDICT:
1736 case CF_MHWPREDICT:
1737 /* need to update the null_count and last_null_count.
1738 * even do this for non-DNAN pdp_temp because the
1739 * algorithm is not learning from batch updates. */
1740 scratch[CDP_null_count].u_cnt += elapsed_pdp_st;
1741 scratch[CDP_last_null_count].u_cnt += elapsed_pdp_st - 1;
1742 /* fall through */
1743 case CF_DEVPREDICT:
1744 scratch[CDP_primary_val].u_val = DNAN;
1745 scratch[CDP_secondary_val].u_val = DNAN;
1746 break;
1747 case CF_FAILURES:
1748 /* do not count missed bulk values as failures */
1749 scratch[CDP_primary_val].u_val = 0;
1750 scratch[CDP_secondary_val].u_val = 0;
1751 /* need to reset violations buffer.
1752 * could do this more carefully, but for now, just
1753 * assume a bulk update wipes away all violations. */
1754 erase_violations(rrd, cdp_idx, rra_idx);
1755 break;
1756 }
1757 }
1759 static rrd_value_t initialize_carry_over(
1760 rrd_value_t pdp_temp_val,
1761 int current_cf,
1762 unsigned long elapsed_pdp_st,
1763 unsigned long start_pdp_offset,
1764 unsigned long pdp_cnt)
1765 {
1766 unsigned long pdp_into_cdp_cnt = ((elapsed_pdp_st - start_pdp_offset) % pdp_cnt);
1767 if ( pdp_into_cdp_cnt == 0 || isnan(pdp_temp_val)){
1768 switch (current_cf) {
1769 case CF_MAXIMUM:
1770 return -DINF;
1771 case CF_MINIMUM:
1772 return DINF;
1773 case CF_AVERAGE:
1774 return 0;
1775 default:
1776 return DNAN;
1777 }
1778 }
1779 else {
1780 switch (current_cf) {
1781 case CF_AVERAGE:
1782 return pdp_temp_val * pdp_into_cdp_cnt ;
1783 default:
1784 return pdp_temp_val;
1785 }
1786 }
1787 }
1789 /*
1790 * Update or initialize a CDP value based on the consolidation
1791 * function.
1792 *
1793 * Returns the new value.
1794 */
1795 static rrd_value_t calculate_cdp_val(
1796 rrd_value_t cdp_val,
1797 rrd_value_t pdp_temp_val,
1798 unsigned long elapsed_pdp_st,
1799 int current_cf,
1800 #ifdef DEBUG
1801 int i,
1802 int ii
1803 #else
1804 int UNUSED(i),
1805 int UNUSED(ii)
1806 #endif
1807 )
1808 {
1809 if (isnan(cdp_val)) {
1810 if (current_cf == CF_AVERAGE) {
1811 pdp_temp_val *= elapsed_pdp_st;
1812 }
1813 #ifdef DEBUG
1814 fprintf(stderr, "Initialize CDP_val for RRA %d DS %d: %10.2f\n",
1815 i, ii, pdp_temp_val);
1816 #endif
1817 return pdp_temp_val;
1818 }
1819 if (current_cf == CF_AVERAGE)
1820 return cdp_val + pdp_temp_val * elapsed_pdp_st;
1821 if (current_cf == CF_MINIMUM)
1822 return (pdp_temp_val < cdp_val) ? pdp_temp_val : cdp_val;
1823 if (current_cf == CF_MAXIMUM)
1824 return (pdp_temp_val > cdp_val) ? pdp_temp_val : cdp_val;
1826 return pdp_temp_val;
1827 }
1829 /*
1830 * For each RRA, update the seasonal values and then call update_aberrant_CF
1831 * for each data source.
1832 *
1833 * Return 0 on success, -1 on error.
1834 */
1835 static int update_aberrant_cdps(
1836 rrd_t *rrd,
1837 rrd_file_t *rrd_file,
1838 unsigned long rra_begin,
1839 unsigned long elapsed_pdp_st,
1840 rrd_value_t *pdp_temp,
1841 rrd_value_t **seasonal_coef)
1842 {
1843 unsigned long rra_idx, ds_idx, j;
1845 /* number of PDP steps since the last update that
1846 * are assigned to the first CDP to be generated
1847 * since the last update. */
1848 unsigned short scratch_idx;
1849 unsigned long rra_start;
1850 enum cf_en current_cf;
1852 /* this loop is only entered if elapsed_pdp_st < 3 */
1853 for (j = elapsed_pdp_st, scratch_idx = CDP_primary_val;
1854 j > 0 && j < 3; j--, scratch_idx = CDP_secondary_val) {
1855 rra_start = rra_begin;
1856 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1857 if (rrd->rra_def[rra_idx].pdp_cnt == 1) {
1858 current_cf = cf_conv(rrd->rra_def[rra_idx].cf_nam);
1859 if (current_cf == CF_SEASONAL || current_cf == CF_DEVSEASONAL) {
1860 if (scratch_idx == CDP_primary_val) {
1861 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1862 elapsed_pdp_st + 1, seasonal_coef);
1863 } else {
1864 lookup_seasonal(rrd, rra_idx, rra_start, rrd_file,
1865 elapsed_pdp_st + 2, seasonal_coef);
1866 }
1867 }
1868 if (rrd_test_error())
1869 return -1;
1870 /* loop over data soures within each RRA */
1871 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1872 update_aberrant_CF(rrd, pdp_temp[ds_idx], current_cf,
1873 rra_idx * (rrd->stat_head->ds_cnt) +
1874 ds_idx, rra_idx, ds_idx, scratch_idx,
1875 *seasonal_coef);
1876 }
1877 }
1878 rra_start += rrd->rra_def[rra_idx].row_cnt
1879 * rrd->stat_head->ds_cnt * sizeof(rrd_value_t);
1880 }
1881 }
1882 return 0;
1883 }
1885 /*
1886 * Move sequentially through the file, writing one RRA at a time. Note this
1887 * architecture divorces the computation of CDP with flushing updated RRA
1888 * entries to disk.
1889 *
1890 * Return 0 on success, -1 on error.
1891 */
1892 static int write_to_rras(
1893 rrd_t *rrd,
1894 rrd_file_t *rrd_file,
1895 unsigned long *rra_step_cnt,
1896 unsigned long rra_begin,
1897 time_t current_time,
1898 unsigned long *skip_update,
1899 rrd_info_t ** pcdp_summary)
1900 {
1901 unsigned long rra_idx;
1902 unsigned long rra_start;
1903 time_t rra_time = 0; /* time of update for a RRA */
1905 unsigned long ds_cnt = rrd->stat_head->ds_cnt;
1907 /* Ready to write to disk */
1908 rra_start = rra_begin;
1910 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; rra_idx++) {
1911 rra_def_t *rra_def = &rrd->rra_def[rra_idx];
1912 rra_ptr_t *rra_ptr = &rrd->rra_ptr[rra_idx];
1914 /* for cdp_prep */
1915 unsigned short scratch_idx;
1916 unsigned long step_subtract;
1918 for (scratch_idx = CDP_primary_val,
1919 step_subtract = 1;
1920 rra_step_cnt[rra_idx] > 0;
1921 rra_step_cnt[rra_idx]--,
1922 scratch_idx = CDP_secondary_val,
1923 step_subtract = 2) {
1925 size_t rra_pos_new;
1926 #ifdef DEBUG
1927 fprintf(stderr, " -- RRA Preseek %ld\n", rrd_file->pos);
1928 #endif
1929 /* increment, with wrap-around */
1930 if (++rra_ptr->cur_row >= rra_def->row_cnt)
1931 rra_ptr->cur_row = 0;
1933 /* we know what our position should be */
1934 rra_pos_new = rra_start
1935 + ds_cnt * rra_ptr->cur_row * sizeof(rrd_value_t);
1937 /* re-seek if the position is wrong or we wrapped around */
1938 if ((size_t)rra_pos_new != rrd_file->pos) {
1939 if (rrd_seek(rrd_file, rra_pos_new, SEEK_SET) != 0) {
1940 rrd_set_error("seek error in rrd");
1941 return -1;
1942 }
1943 }
1944 #ifdef DEBUG
1945 fprintf(stderr, " -- RRA Postseek %ld\n", rrd_file->pos);
1946 #endif
1948 if (skip_update[rra_idx])
1949 continue;
1951 if (*pcdp_summary != NULL) {
1952 unsigned long step_time = rra_def->pdp_cnt * rrd->stat_head->pdp_step;
1954 rra_time = (current_time - current_time % step_time)
1955 - ((rra_step_cnt[rra_idx] - step_subtract) * step_time);
1956 }
1958 if (write_RRA_row
1959 (rrd_file, rrd, rra_idx, scratch_idx,
1960 pcdp_summary, rra_time) == -1)
1961 return -1;
1963 rrd_notify_row(rrd_file, rra_idx, rra_pos_new, rra_time);
1964 }
1966 rra_start += rra_def->row_cnt * ds_cnt * sizeof(rrd_value_t);
1967 } /* RRA LOOP */
1969 return 0;
1970 }
1972 /*
1973 * Write out one row of values (one value per DS) to the archive.
1974 *
1975 * Returns 0 on success, -1 on error.
1976 */
1977 static int write_RRA_row(
1978 rrd_file_t *rrd_file,
1979 rrd_t *rrd,
1980 unsigned long rra_idx,
1981 unsigned short CDP_scratch_idx,
1982 rrd_info_t ** pcdp_summary,
1983 time_t rra_time)
1984 {
1985 unsigned long ds_idx, cdp_idx;
1986 rrd_infoval_t iv;
1988 for (ds_idx = 0; ds_idx < rrd->stat_head->ds_cnt; ds_idx++) {
1989 /* compute the cdp index */
1990 cdp_idx = rra_idx * (rrd->stat_head->ds_cnt) + ds_idx;
1991 #ifdef DEBUG
1992 fprintf(stderr, " -- RRA WRITE VALUE %e, at %ld CF:%s\n",
1993 rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].u_val,
1994 rrd_file->pos, rrd->rra_def[rra_idx].cf_nam);
1995 #endif
1996 if (*pcdp_summary != NULL) {
1997 iv.u_val = rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].u_val;
1998 /* append info to the return hash */
1999 *pcdp_summary = rrd_info_push(*pcdp_summary,
2000 sprintf_alloc
2001 ("[%lli]RRA[%s][%lu]DS[%s]",
2002 (long long)rra_time,
2003 rrd->rra_def[rra_idx].cf_nam,
2004 rrd->rra_def[rra_idx].pdp_cnt,
2005 rrd->ds_def[ds_idx].ds_nam),
2006 RD_I_VAL, iv);
2007 }
2008 errno = 0;
2009 if (rrd_write(rrd_file,
2010 &(rrd->cdp_prep[cdp_idx].scratch[CDP_scratch_idx].
2011 u_val), sizeof(rrd_value_t)) != sizeof(rrd_value_t)) {
2012 rrd_set_error("writing rrd: %s", rrd_strerror(errno));
2013 return -1;
2014 }
2015 }
2016 return 0;
2017 }
2019 /*
2020 * Call apply_smoother for all DEVSEASONAL and SEASONAL RRAs.
2021 *
2022 * Returns 0 on success, -1 otherwise
2023 */
2024 static int smooth_all_rras(
2025 rrd_t *rrd,
2026 rrd_file_t *rrd_file,
2027 unsigned long rra_begin)
2028 {
2029 unsigned long rra_start = rra_begin;
2030 unsigned long rra_idx;
2032 for (rra_idx = 0; rra_idx < rrd->stat_head->rra_cnt; ++rra_idx) {
2033 if (cf_conv(rrd->rra_def[rra_idx].cf_nam) == CF_DEVSEASONAL ||
2034 cf_conv(rrd->rra_def[rra_idx].cf_nam) == CF_SEASONAL) {
2035 #ifdef DEBUG
2036 fprintf(stderr, "Running smoother for rra %lu\n", rra_idx);
2037 #endif
2038 apply_smoother(rrd, rra_idx, rra_start, rrd_file);
2039 if (rrd_test_error())
2040 return -1;
2041 }
2042 rra_start += rrd->rra_def[rra_idx].row_cnt
2043 * rrd->stat_head->ds_cnt * sizeof(rrd_value_t);
2044 }
2045 return 0;
2046 }
2048 #ifndef HAVE_MMAP
2049 /*
2050 * Flush changes to disk (unless we're using mmap)
2051 *
2052 * Returns 0 on success, -1 otherwise
2053 */
2054 static int write_changes_to_disk(
2055 rrd_t *rrd,
2056 rrd_file_t *rrd_file,
2057 int version)
2058 {
2059 /* we just need to write back the live header portion now */
2060 if (rrd_seek(rrd_file, (sizeof(stat_head_t)
2061 + sizeof(ds_def_t) * rrd->stat_head->ds_cnt
2062 + sizeof(rra_def_t) * rrd->stat_head->rra_cnt),
2063 SEEK_SET) != 0) {
2064 rrd_set_error("seek rrd for live header writeback");
2065 return -1;
2066 }
2067 if (version >= 3) {
2068 if (rrd_write(rrd_file, rrd->live_head,
2069 sizeof(live_head_t) * 1) != sizeof(live_head_t) * 1) {
2070 rrd_set_error("rrd_write live_head to rrd");
2071 return -1;
2072 }
2073 } else {
2074 if (rrd_write(rrd_file, rrd->legacy_last_up,
2075 sizeof(time_t) * 1) != sizeof(time_t) * 1) {
2076 rrd_set_error("rrd_write live_head to rrd");
2077 return -1;
2078 }
2079 }
2082 if (rrd_write(rrd_file, rrd->pdp_prep,
2083 sizeof(pdp_prep_t) * rrd->stat_head->ds_cnt)
2084 != (ssize_t) (sizeof(pdp_prep_t) * rrd->stat_head->ds_cnt)) {
2085 rrd_set_error("rrd_write pdp_prep to rrd");
2086 return -1;
2087 }
2089 if (rrd_write(rrd_file, rrd->cdp_prep,
2090 sizeof(cdp_prep_t) * rrd->stat_head->rra_cnt *
2091 rrd->stat_head->ds_cnt)
2092 != (ssize_t) (sizeof(cdp_prep_t) * rrd->stat_head->rra_cnt *
2093 rrd->stat_head->ds_cnt)) {
2095 rrd_set_error("rrd_write cdp_prep to rrd");
2096 return -1;
2097 }
2099 if (rrd_write(rrd_file, rrd->rra_ptr,
2100 sizeof(rra_ptr_t) * rrd->stat_head->rra_cnt)
2101 != (ssize_t) (sizeof(rra_ptr_t) * rrd->stat_head->rra_cnt)) {
2102 rrd_set_error("rrd_write rra_ptr to rrd");
2103 return -1;
2104 }
2105 return 0;
2106 }
2107 #endif