X-Git-Url: https://git.octo.it/?a=blobdiff_plain;f=src%2Futils_cache.c;h=824b7c80bcf6d64abd506991855aaea9bd7e4633;hb=d3fc6d0831a63af2e96300f488a9f8f5fc3183fb;hp=0d6961e7372a1d6d949e1d0ca45520616ff7f0ad;hpb=89783745dc59079eab34e0c52de6e5e972f50eb2;p=collectd.git diff --git a/src/utils_cache.c b/src/utils_cache.c index 0d6961e7..824b7c80 100644 --- a/src/utils_cache.c +++ b/src/utils_cache.c @@ -1,6 +1,6 @@ /** * collectd - src/utils_cache.c - * Copyright (C) 2007 Florian octo Forster + * Copyright (C) 2007,2008 Florian octo Forster * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License as published by the @@ -56,6 +56,43 @@ static int cache_compare (const cache_entry_t *a, const cache_entry_t *b) return (strcmp (a->name, b->name)); } /* int cache_compare */ +static cache_entry_t *cache_alloc (int values_num) +{ + cache_entry_t *ce; + + ce = (cache_entry_t *) malloc (sizeof (cache_entry_t)); + if (ce == NULL) + { + ERROR ("utils_cache: cache_alloc: malloc failed."); + return (NULL); + } + memset (ce, '\0', sizeof (cache_entry_t)); + ce->values_num = values_num; + + ce->values_gauge = (gauge_t *) calloc (values_num, sizeof (gauge_t)); + ce->values_counter = (counter_t *) calloc (values_num, sizeof (counter_t)); + if ((ce->values_gauge == NULL) || (ce->values_counter == NULL)) + { + sfree (ce->values_gauge); + sfree (ce->values_counter); + sfree (ce); + ERROR ("utils_cache: cache_alloc: calloc failed."); + return (NULL); + } + + return (ce); +} /* cache_entry_t *cache_alloc */ + +static void cache_free (cache_entry_t *ce) +{ + if (ce == NULL) + return; + + sfree (ce->values_gauge); + sfree (ce->values_counter); + sfree (ce); +} /* void cache_free */ + static int uc_send_notification (const char *name) { cache_entry_t *ce = NULL; @@ -119,18 +156,72 @@ static int uc_send_notification (const char *name) return (-1); } - snprintf (n.message, sizeof (n.message), + ssnprintf (n.message, sizeof (n.message), "%s has not been updated for %i seconds.", name, (int) (n.time - ce->last_update)); pthread_mutex_unlock (&cache_lock); - n.message[sizeof (n.message) - 1] = '\0'; plugin_dispatch_notification (&n); return (0); } /* int uc_send_notification */ +static int uc_insert (const data_set_t *ds, const value_list_t *vl, + const char *key) +{ + int i; + char *key_copy; + cache_entry_t *ce; + + /* `cache_lock' has been locked by `uc_update' */ + + key_copy = strdup (key); + if (key_copy == NULL) + { + ERROR ("uc_insert: strdup failed."); + return (-1); + } + + ce = cache_alloc (ds->ds_num); + if (ce == NULL) + { + sfree (key_copy); + ERROR ("uc_insert: cache_alloc (%i) failed.", ds->ds_num); + return (-1); + } + + sstrncpy (ce->name, key, sizeof (ce->name)); + + for (i = 0; i < ds->ds_num; i++) + { + if (ds->ds[i].type == DS_TYPE_COUNTER) + { + ce->values_gauge[i] = NAN; + ce->values_counter[i] = vl->values[i].counter; + } + else /* if (ds->ds[i].type == DS_TYPE_GAUGE) */ + { + ce->values_gauge[i] = vl->values[i].gauge; + } + } /* for (i) */ + + ce->last_time = vl->time; + ce->last_update = time (NULL); + ce->interval = vl->interval; + ce->state = STATE_OKAY; + + if (c_avl_insert (cache_tree, key_copy, ce) != 0) + { + sfree (key_copy); + ERROR ("uc_insert: c_avl_insert failed."); + return (-1); + } + + DEBUG ("uc_insert: Added %s to the cache.", key); + return (0); +} /* int uc_insert */ + int uc_init (void) { if (cache_tree == NULL) @@ -171,6 +262,7 @@ int uc_check_timeout (void) { ERROR ("uc_purge: realloc failed."); c_avl_iterator_destroy (iter); + pthread_mutex_unlock (&cache_lock); return (-1); } @@ -199,23 +291,45 @@ int uc_check_timeout (void) else if (status == 0) /* ``service'' is uninteresting */ { ce = NULL; - DEBUG ("uc_check_timeout: %s is missing but ``uninteresting''", keys[i]); - status = c_avl_remove (cache_tree, keys[i], (void *) &key, (void *) &ce); + DEBUG ("uc_check_timeout: %s is missing but ``uninteresting''", + keys[i]); + status = c_avl_remove (cache_tree, keys[i], + (void *) &key, (void *) &ce); if (status != 0) { ERROR ("uc_check_timeout: c_avl_remove (%s) failed.", keys[i]); } sfree (keys[i]); - sfree (ce); + sfree (key); + cache_free (ce); } - else /* (status > 0); ``service'' is interesting */ + else if (status == 1) /* persist */ { - /* - * `keys[i]' is not freed and set to NULL, so that the for-loop below - * will send out notifications. There's nothing else to do here. - */ - DEBUG ("uc_check_timeout: %s is missing and ``interesting''", keys[i]); - ce->state = STATE_ERROR; + DEBUG ("uc_check_timeout: %s is missing, sending notification.", + keys[i]); + ce->state = STATE_MISSING; + } + else if (status == 2) /* do not persist */ + { + if (ce->state == STATE_MISSING) + { + DEBUG ("uc_check_timeout: %s is missing but " + "notification has already been sent.", + keys[i]); + sfree (keys[i]); + } + else /* (ce->state != STATE_MISSING) */ + { + DEBUG ("uc_check_timeout: %s is missing, sending one notification.", + keys[i]); + ce->state = STATE_MISSING; + } + } + else + { + WARNING ("uc_check_timeout: ut_check_interesting (%s) returned " + "invalid status %i.", + keys[i], status); } } /* for (keys[i]) */ @@ -242,173 +356,159 @@ int uc_update (const data_set_t *ds, const value_list_t *vl) char name[6 * DATA_MAX_NAME_LEN]; cache_entry_t *ce = NULL; int send_okay_notification = 0; + time_t update_delay = 0; + notification_t n; + int status; + int i; if (FORMAT_VL (name, sizeof (name), vl, ds) != 0) { - ERROR ("uc_insert: FORMAT_VL failed."); + ERROR ("uc_update: FORMAT_VL failed."); return (-1); } pthread_mutex_lock (&cache_lock); - if (c_avl_get (cache_tree, name, (void *) &ce) == 0) + status = c_avl_get (cache_tree, name, (void *) &ce); + if (status != 0) /* entry does not yet exist */ { - int i; + status = uc_insert (ds, vl, name); + pthread_mutex_unlock (&cache_lock); + return (status); + } - assert (ce != NULL); - assert (ce->values_num == ds->ds_num); + assert (ce != NULL); + assert (ce->values_num == ds->ds_num); - if (ce->last_time >= vl->time) - { - pthread_mutex_unlock (&cache_lock); - NOTICE ("uc_insert: Value too old: name = %s; value time = %u; " - "last cache update = %u;", - name, (unsigned int) vl->time, (unsigned int) ce->last_time); - return (-1); - } + if (ce->last_time >= vl->time) + { + pthread_mutex_unlock (&cache_lock); + NOTICE ("uc_update: Value too old: name = %s; value time = %u; " + "last cache update = %u;", + name, (unsigned int) vl->time, (unsigned int) ce->last_time); + return (-1); + } - if ((ce->last_time + ce->interval) < vl->time) - { - send_okay_notification = vl->time - ce->last_time; - ce->state = STATE_OKAY; - } + /* Send a notification (after the lock has been released) if we switch the + * state from something else to `okay'. */ + if (ce->state == STATE_MISSING) + { + send_okay_notification = 1; + ce->state = STATE_OKAY; + update_delay = time (NULL) - ce->last_update; + } - for (i = 0; i < ds->ds_num; i++) + for (i = 0; i < ds->ds_num; i++) + { + if (ds->ds[i].type == DS_TYPE_COUNTER) { - if (ds->ds[i].type == DS_TYPE_COUNTER) + counter_t diff; + + /* check if the counter has wrapped around */ + if (vl->values[i].counter < ce->values_counter[i]) { - counter_t diff; - - /* check if the counter has wrapped around */ - if (vl->values[i].counter < ce->values_counter[i]) - { - if (ce->values_counter[i] <= 4294967295U) - diff = (4294967295U - ce->values_counter[i]) - + vl->values[i].counter; - else - diff = (18446744073709551615ULL - ce->values_counter[i]) - + vl->values[i].counter; - } - else /* counter has NOT wrapped around */ - { - diff = vl->values[i].counter - ce->values_counter[i]; - } - - ce->values_gauge[i] = ((double) diff) - / ((double) (vl->time - ce->last_time)); - ce->values_counter[i] = vl->values[i].counter; + if (ce->values_counter[i] <= 4294967295U) + diff = (4294967295U - ce->values_counter[i]) + + vl->values[i].counter; + else + diff = (18446744073709551615ULL - ce->values_counter[i]) + + vl->values[i].counter; } - else /* if (ds->ds[i].type == DS_TYPE_GAUGE) */ + else /* counter has NOT wrapped around */ { - ce->values_gauge[i] = vl->values[i].gauge; + diff = vl->values[i].counter - ce->values_counter[i]; } - DEBUG ("uc_insert: %s: ds[%i] = %lf", name, i, ce->values_gauge[i]); - } /* for (i) */ - ce->last_time = vl->time; - ce->last_update = time (NULL); - ce->interval = vl->interval; - } - else /* key is not found */ - { - int i; - size_t ce_size = sizeof (cache_entry_t) - + ds->ds_num * (sizeof (counter_t) + sizeof (gauge_t)); - char *key; - - key = strdup (name); - if (key == NULL) - { - pthread_mutex_unlock (&cache_lock); - ERROR ("uc_insert: strdup failed."); - return (-1); + ce->values_gauge[i] = ((double) diff) + / ((double) (vl->time - ce->last_time)); + ce->values_counter[i] = vl->values[i].counter; } - - ce = (cache_entry_t *) malloc (ce_size); - if (ce == NULL) + else /* if (ds->ds[i].type == DS_TYPE_GAUGE) */ { - pthread_mutex_unlock (&cache_lock); - ERROR ("uc_insert: malloc (%u) failed.", (unsigned int) ce_size); - return (-1); + ce->values_gauge[i] = vl->values[i].gauge; } + DEBUG ("uc_update: %s: ds[%i] = %lf", name, i, ce->values_gauge[i]); + } /* for (i) */ - memset (ce, '\0', ce_size); + ce->last_time = vl->time; + ce->last_update = time (NULL); + ce->interval = vl->interval; - strncpy (ce->name, name, sizeof (ce->name)); - ce->name[sizeof (ce->name) - 1] = '\0'; + pthread_mutex_unlock (&cache_lock); - ce->values_num = ds->ds_num; - ce->values_gauge = (gauge_t *) (ce + 1); - ce->values_counter = (counter_t *) (ce->values_gauge + ce->values_num); + if (send_okay_notification == 0) + return (0); - for (i = 0; i < ds->ds_num; i++) - { - if (ds->ds[i].type == DS_TYPE_COUNTER) - { - ce->values_gauge[i] = NAN; - ce->values_counter[i] = vl->values[i].counter; - } - else /* if (ds->ds[i].type == DS_TYPE_GAUGE) */ - { - ce->values_gauge[i] = vl->values[i].gauge; - } - } /* for (i) */ + /* Do not send okay notifications for uninteresting values, i. e. values for + * which no threshold is configured. */ + status = ut_check_interesting (name); + if (status <= 0) + return (0); - ce->last_time = vl->time; - ce->last_update = time (NULL); - ce->interval = vl->interval; - ce->state = STATE_OKAY; + /* Initialize the notification */ + memset (&n, '\0', sizeof (n)); + NOTIFICATION_INIT_VL (&n, vl, ds); - if (c_avl_insert (cache_tree, key, ce) != 0) - { - pthread_mutex_unlock (&cache_lock); - ERROR ("uc_insert: c_avl_insert failed."); - return (-1); - } + n.severity = NOTIF_OKAY; + n.time = vl->time; - DEBUG ("uc_insert: Added %s to the cache.", name); - } /* if (key is not found) */ + ssnprintf (n.message, sizeof (n.message), + "Received a value for %s. It was missing for %u seconds.", + name, (unsigned int) update_delay); - pthread_mutex_unlock (&cache_lock); + plugin_dispatch_notification (&n); - /* Do not send okay notifications for uninteresting values, i. e. values for - * which no threshold is configured. */ - if (send_okay_notification > 0) - { - int status; + return (0); +} /* int uc_update */ - status = ut_check_interesting (name); - if (status <= 0) - send_okay_notification = 0; - } +int uc_get_rate_by_name (const char *name, gauge_t **ret_values, size_t *ret_values_num) +{ + gauge_t *ret = NULL; + size_t ret_num = 0; + cache_entry_t *ce = NULL; + int status = 0; - if (send_okay_notification > 0) - { - notification_t n; - memset (&n, '\0', sizeof (n)); + pthread_mutex_lock (&cache_lock); - /* Copy the associative members */ - NOTIFICATION_INIT_VL (&n, vl, ds); + if (c_avl_get (cache_tree, name, (void *) &ce) == 0) + { + assert (ce != NULL); - n.severity = NOTIF_OKAY; - n.time = vl->time; + ret_num = ce->values_num; + ret = (gauge_t *) malloc (ret_num * sizeof (gauge_t)); + if (ret == NULL) + { + ERROR ("utils_cache: uc_get_rate_by_name: malloc failed."); + status = -1; + } + else + { + memcpy (ret, ce->values_gauge, ret_num * sizeof (gauge_t)); + } + } + else + { + DEBUG ("utils_cache: uc_get_rate_by_name: No such value: %s", name); + status = -1; + } - snprintf (n.message, sizeof (n.message), - "Received a value for %s. It was missing for %i seconds.", - name, send_okay_notification); - n.message[sizeof (n.message) - 1] = '\0'; + pthread_mutex_unlock (&cache_lock); - plugin_dispatch_notification (&n); + if (status == 0) + { + *ret_values = ret; + *ret_values_num = ret_num; } - return (0); -} /* int uc_insert */ + return (status); +} /* gauge_t *uc_get_rate_by_name */ gauge_t *uc_get_rate (const data_set_t *ds, const value_list_t *vl) { char name[6 * DATA_MAX_NAME_LEN]; gauge_t *ret = NULL; - cache_entry_t *ce = NULL; + size_t ret_num = 0; + int status; if (FORMAT_VL (name, sizeof (name), vl, ds) != 0) { @@ -416,28 +516,99 @@ gauge_t *uc_get_rate (const data_set_t *ds, const value_list_t *vl) return (NULL); } + status = uc_get_rate_by_name (name, &ret, &ret_num); + if (status != 0) + return (NULL); + + /* This is important - the caller has no other way of knowing how many + * values are returned. */ + if (ret_num != ds->ds_num) + { + ERROR ("utils_cache: uc_get_rate: ds[%s] has %i values, " + "but uc_get_rate_by_name returned %zu.", + ds->type, ds->ds_num, ret_num); + sfree (ret); + return (NULL); + } + + return (ret); +} /* gauge_t *uc_get_rate */ + +int uc_get_names (char ***ret_names, time_t **ret_times, size_t *ret_number) +{ + c_avl_iterator_t *iter; + char *key; + cache_entry_t *value; + + char **names = NULL; + time_t *times = NULL; + size_t number = 0; + + int status = 0; + + if ((ret_names == NULL) || (ret_number == NULL)) + return (-1); + pthread_mutex_lock (&cache_lock); - if (c_avl_get (cache_tree, name, (void *) &ce) == 0) + iter = c_avl_get_iterator (cache_tree); + while (c_avl_iterator_next (iter, (void *) &key, (void *) &value) == 0) { - assert (ce != NULL); - assert (ce->values_num == ds->ds_num); + char **temp; - ret = (gauge_t *) malloc (ce->values_num * sizeof (gauge_t)); - if (ret == NULL) + if (ret_times != NULL) { - ERROR ("uc_get_rate: malloc failed."); + time_t *tmp_times; + + tmp_times = (time_t *) realloc (times, sizeof (time_t) * (number + 1)); + if (tmp_times == NULL) + { + status = -1; + break; + } + times = tmp_times; + times[number] = value->last_time; } - else + + temp = (char **) realloc (names, sizeof (char *) * (number + 1)); + if (temp == NULL) { - memcpy (ret, ce->values_gauge, ce->values_num * sizeof (gauge_t)); + status = -1; + break; } - } + names = temp; + names[number] = strdup (key); + if (names[number] == NULL) + { + status = -1; + break; + } + number++; + } /* while (c_avl_iterator_next) */ + c_avl_iterator_destroy (iter); pthread_mutex_unlock (&cache_lock); - return (ret); -} /* gauge_t *uc_get_rate */ + if (status != 0) + { + size_t i; + + for (i = 0; i < number; i++) + { + sfree (names[i]); + } + sfree (names); + + return (-1); + } + + *ret_names = names; + if (ret_times != NULL) + *ret_times = times; + *ret_number = number; + + return (0); +} /* int uc_get_names */ int uc_get_state (const data_set_t *ds, const value_list_t *vl) { @@ -470,11 +641,6 @@ int uc_set_state (const data_set_t *ds, const value_list_t *vl, int state) cache_entry_t *ce = NULL; int ret = -1; - if (state < STATE_OKAY) - state = STATE_OKAY; - if (state > STATE_ERROR) - state = STATE_ERROR; - if (FORMAT_VL (name, sizeof (name), vl, ds) != 0) { ERROR ("uc_get_state: FORMAT_VL failed.");