2 * collectd - src/utils_cache.c
3 * Copyright (C) 2007,2008 Florian octo Forster
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License as published by the
7 * Free Software Foundation; only version 2 of the License is applicable.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
14 * You should have received a copy of the GNU General Public License along
15 * with this program; if not, write to the Free Software Foundation, Inc.,
16 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 * Florian octo Forster <octo at verplant.org>
25 #include "utils_avltree.h"
26 #include "utils_cache.h"
27 #include "utils_threshold.h"
32 typedef struct cache_entry_s
34 char name[6 * DATA_MAX_NAME_LEN];
36 gauge_t *values_gauge;
37 counter_t *values_counter;
38 /* Time contained in the package
39 * (for calculating rates) */
41 /* Time according to the local clock
42 * (for purging old entries) */
44 /* Interval in which the data is collected
45 * (for purding old entries) */
50 static c_avl_tree_t *cache_tree = NULL;
51 static pthread_mutex_t cache_lock = PTHREAD_MUTEX_INITIALIZER;
53 static int cache_compare (const cache_entry_t *a, const cache_entry_t *b)
55 assert ((a != NULL) && (b != NULL));
56 return (strcmp (a->name, b->name));
57 } /* int cache_compare */
59 static cache_entry_t *cache_alloc (int values_num)
63 ce = (cache_entry_t *) malloc (sizeof (cache_entry_t));
66 ERROR ("utils_cache: cache_alloc: malloc failed.");
69 memset (ce, '\0', sizeof (cache_entry_t));
70 ce->values_num = values_num;
72 ce->values_gauge = (gauge_t *) calloc (values_num, sizeof (gauge_t));
73 ce->values_counter = (counter_t *) calloc (values_num, sizeof (counter_t));
74 if ((ce->values_gauge == NULL) || (ce->values_counter == NULL))
76 sfree (ce->values_gauge);
77 sfree (ce->values_counter);
79 ERROR ("utils_cache: cache_alloc: calloc failed.");
84 } /* cache_entry_t *cache_alloc */
86 static void cache_free (cache_entry_t *ce)
91 sfree (ce->values_gauge);
92 sfree (ce->values_counter);
94 } /* void cache_free */
96 static int uc_send_notification (const char *name)
98 cache_entry_t *ce = NULL;
104 char *plugin_instance;
110 name_copy = strdup (name);
111 if (name_copy == NULL)
113 ERROR ("uc_send_notification: strdup failed.");
117 status = parse_identifier (name_copy, &host,
118 &plugin, &plugin_instance,
119 &type, &type_instance);
122 ERROR ("uc_send_notification: Cannot parse name `%s'", name);
126 /* Copy the associative members */
127 notification_init (&n, NOTIF_FAILURE, /* host = */ NULL,
128 host, plugin, plugin_instance, type, type_instance);
131 name_copy = host = plugin = plugin_instance = type = type_instance = NULL;
133 pthread_mutex_lock (&cache_lock);
136 * Set the time _after_ getting the lock because we don't know how long
137 * acquiring the lock takes and we will use this time later to decide
138 * whether or not the state is OKAY.
140 n.time = time (NULL);
142 status = c_avl_get (cache_tree, name, (void *) &ce);
145 pthread_mutex_unlock (&cache_lock);
150 /* Check if the entry has been updated in the meantime */
151 if ((n.time - ce->last_update) < (2 * ce->interval))
153 ce->state = STATE_OKAY;
154 pthread_mutex_unlock (&cache_lock);
159 ssnprintf (n.message, sizeof (n.message),
160 "%s has not been updated for %i seconds.", name,
161 (int) (n.time - ce->last_update));
163 pthread_mutex_unlock (&cache_lock);
165 plugin_dispatch_notification (&n);
168 } /* int uc_send_notification */
170 static int uc_insert (const data_set_t *ds, const value_list_t *vl,
177 /* `cache_lock' has been locked by `uc_update' */
179 key_copy = strdup (key);
180 if (key_copy == NULL)
182 ERROR ("uc_insert: strdup failed.");
186 ce = cache_alloc (ds->ds_num);
190 ERROR ("uc_insert: cache_alloc (%i) failed.", ds->ds_num);
194 sstrncpy (ce->name, key, sizeof (ce->name));
196 for (i = 0; i < ds->ds_num; i++)
198 if (ds->ds[i].type == DS_TYPE_COUNTER)
200 ce->values_gauge[i] = NAN;
201 ce->values_counter[i] = vl->values[i].counter;
203 else /* if (ds->ds[i].type == DS_TYPE_GAUGE) */
205 ce->values_gauge[i] = vl->values[i].gauge;
209 ce->last_time = vl->time;
210 ce->last_update = time (NULL);
211 ce->interval = vl->interval;
212 ce->state = STATE_OKAY;
214 if (c_avl_insert (cache_tree, key_copy, ce) != 0)
217 ERROR ("uc_insert: c_avl_insert failed.");
221 DEBUG ("uc_insert: Added %s to the cache.", key);
223 } /* int uc_insert */
227 if (cache_tree == NULL)
228 cache_tree = c_avl_create ((int (*) (const void *, const void *))
234 int uc_check_timeout (void)
243 c_avl_iterator_t *iter;
246 pthread_mutex_lock (&cache_lock);
250 /* Build a list of entries to be flushed */
251 iter = c_avl_get_iterator (cache_tree);
252 while (c_avl_iterator_next (iter, (void *) &key, (void *) &ce) == 0)
254 /* If entry has not been updated, add to `keys' array */
255 if ((now - ce->last_update) >= (2 * ce->interval))
259 tmp = (char **) realloc ((void *) keys,
260 (keys_len + 1) * sizeof (char *));
263 ERROR ("uc_check_timeout: realloc failed.");
264 c_avl_iterator_destroy (iter);
266 pthread_mutex_unlock (&cache_lock);
271 keys[keys_len] = strdup (key);
272 if (keys[keys_len] == NULL)
274 ERROR ("uc_check_timeout: strdup failed.");
279 } /* while (c_avl_iterator_next) */
283 for (i = 0; i < keys_len; i++)
287 status = ut_check_interesting (keys[i]);
291 ERROR ("uc_check_timeout: ut_check_interesting failed.");
295 else if (status == 0) /* ``service'' is uninteresting */
297 DEBUG ("uc_check_timeout: %s is missing but ``uninteresting''",
300 status = c_avl_remove (cache_tree, keys[i],
301 (void *) &key, (void *) &ce);
304 ERROR ("uc_check_timeout: c_avl_remove (%s) failed.", keys[i]);
313 /* If we get here, the value is ``interesting''. Query the record from the
314 * cache and update the state field. */
315 if (c_avl_get (cache_tree, keys[i], (void *) &ce) != 0)
317 ERROR ("uc_check_timeout: cannot get data for %s from cache", keys[i]);
318 /* Do not free `keys[i]' so a notification is sent further down. */
323 if (status == 2) /* persist */
325 DEBUG ("uc_check_timeout: %s is missing, sending notification.",
327 ce->state = STATE_MISSING;
328 /* Do not free `keys[i]' so a notification is sent further down. */
330 else if (status == 1) /* do not persist */
332 if (ce->state == STATE_MISSING)
334 DEBUG ("uc_check_timeout: %s is missing but "
335 "notification has already been sent.",
337 /* Set `keys[i]' to NULL to no notification is sent. */
340 else /* (ce->state != STATE_MISSING) */
342 DEBUG ("uc_check_timeout: %s is missing, sending one notification.",
344 ce->state = STATE_MISSING;
345 /* Do not free `keys[i]' so a notification is sent further down. */
350 WARNING ("uc_check_timeout: ut_check_interesting (%s) returned "
351 "invalid status %i.",
356 /* Make really sure the next iteration doesn't work with this pointer.
357 * There have been too many bugs in the past.. :/ -- octo */
359 } /* for (keys[i]) */
361 c_avl_iterator_destroy (iter);
363 pthread_mutex_unlock (&cache_lock);
365 for (i = 0; i < keys_len; i++)
370 uc_send_notification (keys[i]);
377 } /* int uc_check_timeout */
379 int uc_update (const data_set_t *ds, const value_list_t *vl)
381 char name[6 * DATA_MAX_NAME_LEN];
382 cache_entry_t *ce = NULL;
383 int send_okay_notification = 0;
384 time_t update_delay = 0;
389 if (FORMAT_VL (name, sizeof (name), vl, ds) != 0)
391 ERROR ("uc_update: FORMAT_VL failed.");
395 pthread_mutex_lock (&cache_lock);
397 status = c_avl_get (cache_tree, name, (void *) &ce);
398 if (status != 0) /* entry does not yet exist */
400 status = uc_insert (ds, vl, name);
401 pthread_mutex_unlock (&cache_lock);
406 assert (ce->values_num == ds->ds_num);
408 if (ce->last_time >= vl->time)
410 pthread_mutex_unlock (&cache_lock);
411 NOTICE ("uc_update: Value too old: name = %s; value time = %u; "
412 "last cache update = %u;",
413 name, (unsigned int) vl->time, (unsigned int) ce->last_time);
417 /* Send a notification (after the lock has been released) if we switch the
418 * state from something else to `okay'. */
419 if (ce->state == STATE_MISSING)
421 send_okay_notification = 1;
422 ce->state = STATE_OKAY;
423 update_delay = time (NULL) - ce->last_update;
426 for (i = 0; i < ds->ds_num; i++)
428 if (ds->ds[i].type == DS_TYPE_COUNTER)
432 /* check if the counter has wrapped around */
433 if (vl->values[i].counter < ce->values_counter[i])
435 if (ce->values_counter[i] <= 4294967295U)
436 diff = (4294967295U - ce->values_counter[i])
437 + vl->values[i].counter;
439 diff = (18446744073709551615ULL - ce->values_counter[i])
440 + vl->values[i].counter;
442 else /* counter has NOT wrapped around */
444 diff = vl->values[i].counter - ce->values_counter[i];
447 ce->values_gauge[i] = ((double) diff)
448 / ((double) (vl->time - ce->last_time));
449 ce->values_counter[i] = vl->values[i].counter;
451 else /* if (ds->ds[i].type == DS_TYPE_GAUGE) */
453 ce->values_gauge[i] = vl->values[i].gauge;
455 DEBUG ("uc_update: %s: ds[%i] = %lf", name, i, ce->values_gauge[i]);
458 ce->last_time = vl->time;
459 ce->last_update = time (NULL);
460 ce->interval = vl->interval;
462 pthread_mutex_unlock (&cache_lock);
464 if (send_okay_notification == 0)
467 /* Do not send okay notifications for uninteresting values, i. e. values for
468 * which no threshold is configured. */
469 status = ut_check_interesting (name);
473 /* Initialize the notification */
474 memset (&n, '\0', sizeof (n));
475 NOTIFICATION_INIT_VL (&n, vl, ds);
477 n.severity = NOTIF_OKAY;
480 ssnprintf (n.message, sizeof (n.message),
481 "Received a value for %s. It was missing for %u seconds.",
482 name, (unsigned int) update_delay);
484 plugin_dispatch_notification (&n);
487 } /* int uc_update */
489 int uc_get_rate_by_name (const char *name, gauge_t **ret_values, size_t *ret_values_num)
493 cache_entry_t *ce = NULL;
496 pthread_mutex_lock (&cache_lock);
498 if (c_avl_get (cache_tree, name, (void *) &ce) == 0)
502 /* remove missing values from getval */
503 if (ce->state == STATE_MISSING)
509 ret_num = ce->values_num;
510 ret = (gauge_t *) malloc (ret_num * sizeof (gauge_t));
513 ERROR ("utils_cache: uc_get_rate_by_name: malloc failed.");
518 memcpy (ret, ce->values_gauge, ret_num * sizeof (gauge_t));
524 DEBUG ("utils_cache: uc_get_rate_by_name: No such value: %s", name);
528 pthread_mutex_unlock (&cache_lock);
533 *ret_values_num = ret_num;
537 } /* gauge_t *uc_get_rate_by_name */
539 gauge_t *uc_get_rate (const data_set_t *ds, const value_list_t *vl)
541 char name[6 * DATA_MAX_NAME_LEN];
546 if (FORMAT_VL (name, sizeof (name), vl, ds) != 0)
548 ERROR ("utils_cache: uc_get_rate: FORMAT_VL failed.");
552 status = uc_get_rate_by_name (name, &ret, &ret_num);
556 /* This is important - the caller has no other way of knowing how many
557 * values are returned. */
558 if (ret_num != (size_t) ds->ds_num)
560 ERROR ("utils_cache: uc_get_rate: ds[%s] has %i values, "
561 "but uc_get_rate_by_name returned %zu.",
562 ds->type, ds->ds_num, ret_num);
568 } /* gauge_t *uc_get_rate */
570 int uc_get_names (char ***ret_names, time_t **ret_times, size_t *ret_number)
572 c_avl_iterator_t *iter;
574 cache_entry_t *value;
577 time_t *times = NULL;
582 if ((ret_names == NULL) || (ret_number == NULL))
585 pthread_mutex_lock (&cache_lock);
587 iter = c_avl_get_iterator (cache_tree);
588 while (c_avl_iterator_next (iter, (void *) &key, (void *) &value) == 0)
592 /* remove missing values when list values */
593 if (value->state == STATE_MISSING)
596 if (ret_times != NULL)
600 tmp_times = (time_t *) realloc (times, sizeof (time_t) * (number + 1));
601 if (tmp_times == NULL)
607 times[number] = value->last_time;
610 temp = (char **) realloc (names, sizeof (char *) * (number + 1));
617 names[number] = strdup (key);
618 if (names[number] == NULL)
624 } /* while (c_avl_iterator_next) */
626 c_avl_iterator_destroy (iter);
627 pthread_mutex_unlock (&cache_lock);
633 for (i = 0; i < number; i++)
643 if (ret_times != NULL)
645 *ret_number = number;
648 } /* int uc_get_names */
650 int uc_get_state (const data_set_t *ds, const value_list_t *vl)
652 char name[6 * DATA_MAX_NAME_LEN];
653 cache_entry_t *ce = NULL;
654 int ret = STATE_ERROR;
656 if (FORMAT_VL (name, sizeof (name), vl, ds) != 0)
658 ERROR ("uc_get_state: FORMAT_VL failed.");
659 return (STATE_ERROR);
662 pthread_mutex_lock (&cache_lock);
664 if (c_avl_get (cache_tree, name, (void *) &ce) == 0)
670 pthread_mutex_unlock (&cache_lock);
673 } /* int uc_get_state */
675 int uc_set_state (const data_set_t *ds, const value_list_t *vl, int state)
677 char name[6 * DATA_MAX_NAME_LEN];
678 cache_entry_t *ce = NULL;
681 if (FORMAT_VL (name, sizeof (name), vl, ds) != 0)
683 ERROR ("uc_get_state: FORMAT_VL failed.");
684 return (STATE_ERROR);
687 pthread_mutex_lock (&cache_lock);
689 if (c_avl_get (cache_tree, name, (void *) &ce) == 0)
696 pthread_mutex_unlock (&cache_lock);
699 } /* int uc_set_state */
700 /* vim: set sw=2 ts=8 sts=2 tw=78 : */