X-Git-Url: https://git.octo.it/?p=collection4.git;a=blobdiff_plain;f=src%2Fgraph.c;h=c6fb44446849f6fe0def7a2e2bc02bc7852a2cc9;hp=6b898595f36ed703bc3854b3df34a2dcf25ac6d2;hb=6997bcaa3a362fd4c48a0909e0b88a4e1db5bf6a;hpb=5e630d84e5baa7b105ff83f81555c1e62f5a68ba diff --git a/src/graph.c b/src/graph.c index 6b89859..c6fb444 100644 --- a/src/graph.c +++ b/src/graph.c @@ -1,3 +1,26 @@ +/** + * collection4 - graph.c + * Copyright (C) 2010 Florian octo Forster + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation; either + * version 2.1 of the License, or (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public + * License along with this program; if not, write to the Free Software + * Foundation, Inc., 51 Franklin Street, Fifth Floor, + * Boston, MA 02110-1301 USA + * + * Authors: + * Florian octo Forster + **/ + #include #include #include @@ -8,8 +31,9 @@ #include #include "graph.h" -#include "graph_list.h" #include "graph_ident.h" +#include "graph_instance.h" +#include "graph_list.h" #include "graph_def.h" #include "graph_config.h" #include "common.h" @@ -32,20 +56,13 @@ struct graph_config_s /* {{{ */ graph_def_t *defs; - graph_instance_t *instances; + graph_instance_t **instances; + size_t instances_num; }; /* }}} struct graph_config_s */ /* * Private functions */ -static graph_instance_t *graph_find_instance (graph_config_t *cfg, /* {{{ */ - const graph_ident_t *ident) -{ - if ((cfg == NULL) || (ident == NULL)) - return (NULL); - - return (inst_find_matching (cfg->instances, ident)); -} /* }}} graph_instance_t *graph_find_instance */ /* * Config functions @@ -117,6 +134,8 @@ graph_config_t *graph_create (const graph_ident_t *selector) /* {{{ */ void graph_destroy (graph_config_t *cfg) /* {{{ */ { + size_t i; + if (cfg == NULL) return; @@ -126,7 +145,10 @@ void graph_destroy (graph_config_t *cfg) /* {{{ */ free (cfg->vertical_label); def_destroy (cfg->defs); - inst_destroy (cfg->instances); + + for (i = 0; i < cfg->instances_num; i++) + inst_destroy (cfg->instances[i]); + free (cfg->instances); } /* }}} void graph_destroy */ int graph_config_add (const oconfig_item_t *ci) /* {{{ */ @@ -170,17 +192,23 @@ int graph_add_file (graph_config_t *cfg, const graph_ident_t *file) /* {{{ */ { graph_instance_t *inst; - inst = graph_find_instance (cfg, file); + inst = graph_inst_find_matching (cfg, file); if (inst == NULL) { + graph_instance_t **tmp; + + tmp = realloc (cfg->instances, + sizeof (*cfg->instances) * (cfg->instances_num + 1)); + if (tmp == NULL) + return (ENOMEM); + cfg->instances = tmp; + inst = inst_create (cfg, file); if (inst == NULL) return (ENOMEM); - if (cfg->instances == NULL) - cfg->instances = inst; - else - inst_append (cfg->instances, inst); + cfg->instances[cfg->instances_num] = inst; + cfg->instances_num++; } return (inst_add_file (inst, file)); @@ -212,7 +240,7 @@ int graph_get_params (graph_config_t *cfg, /* {{{ */ #define COPY_FIELD(field) do { \ const char *str = ident_get_##field (cfg->select); \ char uri_str[1024]; \ - uri_escape (uri_str, str, sizeof (uri_str)); \ + uri_escape_copy (uri_str, str, sizeof (uri_str)); \ strlcat (buffer, #field, buffer_size); \ strlcat (buffer, "=", buffer_size); \ strlcat (buffer, uri_str, buffer_size); \ @@ -241,14 +269,6 @@ graph_ident_t *graph_get_selector (graph_config_t *cfg) /* {{{ */ return (ident_clone (cfg->select)); } /* }}} graph_ident_t *graph_get_selector */ -graph_instance_t *graph_get_instances (graph_config_t *cfg) /* {{{ */ -{ - if (cfg == NULL) - return (NULL); - - return (cfg->instances); -} /* }}} graph_instance_t *graph_get_instances */ - graph_def_t *graph_get_defs (graph_config_t *cfg) /* {{{ */ { if (cfg == NULL) @@ -259,6 +279,8 @@ graph_def_t *graph_get_defs (graph_config_t *cfg) /* {{{ */ int graph_add_def (graph_config_t *cfg, graph_def_t *def) /* {{{ */ { + graph_def_t *tmp; + if ((cfg == NULL) || (def == NULL)) return (EINVAL); @@ -268,54 +290,191 @@ int graph_add_def (graph_config_t *cfg, graph_def_t *def) /* {{{ */ return (0); } - return (def_append (cfg->defs, def)); + /* Insert in reverse order. This makes the order in the config file and the + * order of the DEFs in the graph more natural. Really. */ + tmp = cfg->defs; + cfg->defs = def; + return (def_append (cfg->defs, tmp)); } /* }}} int graph_add_def */ -_Bool graph_matches (graph_config_t *cfg, const graph_ident_t *ident) /* {{{ */ +_Bool graph_ident_matches (graph_config_t *cfg, const graph_ident_t *ident) /* {{{ */ { +#if C4_DEBUG if ((cfg == NULL) || (ident == NULL)) return (0); +#endif return (ident_matches (cfg->select, ident)); -} /* }}} _Bool graph_matches */ +} /* }}} _Bool graph_ident_matches */ -struct graph_search_data_s +_Bool graph_matches_ident (graph_config_t *cfg, /* {{{ */ + const graph_ident_t *selector) { - graph_config_t *cfg; - graph_inst_callback_t callback; - void *user_data; -}; -typedef struct graph_search_data_s graph_search_data_t; +#if C4_DEBUG + if ((cfg == NULL) || (selector == NULL)) + return (0); +#endif -static int graph_search_submit (graph_instance_t *inst, /* {{{ */ - void *user_data) + return (ident_matches (selector, cfg->select)); +} /* }}} _Bool graph_matches_ident */ + +_Bool graph_matches_field (graph_config_t *cfg, /* {{{ */ + graph_ident_field_t field, const char *field_value) { - graph_search_data_t *data = user_data; + const char *selector_value; - if ((inst == NULL) || (data == NULL)) - return (EINVAL); + if ((cfg == NULL) || (field_value == NULL)) + return (0); - return ((*data->callback) (data->cfg, inst, data->user_data)); -} /* }}} int graph_search_submit */ + selector_value = ident_get_field (cfg->select, field); + if (selector_value == NULL) + return (0); + + if (IS_ALL (selector_value) || IS_ANY (selector_value)) + return (1); + else if (strcasecmp (selector_value, field_value) == 0) + return (1); + + return (0); +} /* }}} _Bool graph_matches_field */ int graph_inst_foreach (graph_config_t *cfg, /* {{{ */ inst_callback_t cb, void *user_data) { - return (inst_foreach (cfg->instances, cb, user_data)); + size_t i; + int status; + + for (i = 0; i < cfg->instances_num; i++) + { + status = (*cb) (cfg->instances[i], user_data); + if (status != 0) + return (status); + } + + return (0); } /* }}} int graph_inst_foreach */ -int graph_search (graph_config_t *cfg, const char *term, /* {{{ */ - graph_inst_callback_t callback, +graph_instance_t *graph_inst_find_exact (graph_config_t *cfg, /* {{{ */ + graph_ident_t *ident) +{ + size_t i; + + if ((cfg == NULL) || (ident == NULL)) + return (NULL); + + for (i = 0; i < cfg->instances_num; i++) + if (inst_compare_ident (cfg->instances[i], ident) == 0) + return (cfg->instances[i]); + + return (NULL); +} /* }}} graph_instance_t *graph_inst_find_exact */ + +graph_instance_t *graph_inst_find_matching (graph_config_t *cfg, /* {{{ */ + const graph_ident_t *ident) +{ + size_t i; + + if ((cfg == NULL) || (ident == NULL)) + return (NULL); + + for (i = 0; i < cfg->instances_num; i++) + if (inst_ident_matches (cfg->instances[i], ident)) + return (cfg->instances[i]); + + return (NULL); +} /* }}} graph_instance_t *graph_inst_find_matching */ + +int graph_inst_find_all_matching (graph_config_t *cfg, /* {{{ */ + const graph_ident_t *ident, + graph_inst_callback_t callback, void *user_data) +{ + size_t i; + + if ((cfg == NULL) || (ident == NULL) || (callback == NULL)) + return (EINVAL); + + for (i = 0; i < cfg->instances_num; i++) + { + int status; + + if (!inst_matches_ident (cfg->instances[i], ident)) + continue; + + status = (*callback) (cfg, cfg->instances[i], user_data); + if (status != 0) + return (status); + } + + return (0); +} /* }}} int graph_inst_find_all_matching */ + +/* When this function is called from graph_list, it will already have checked + * that the selector of the graph matches the field selections contained in + * the search_info_t. So if the graphs title matches, this means that the + * field selections and the search term(s) apply to the graph in general; thus + * we return all instances. Otherwise, use the somewhat expensive + * "search_graph_inst_matches" function to look for matching instances. */ +int graph_search_inst (graph_config_t *cfg, search_info_t *si, /* {{{ */ + graph_inst_callback_t cb, + void *user_data) +{ + char title[1024]; + int status; + size_t i; + + if ((cfg == NULL) || (si == NULL) || (cb == NULL)) + return (EINVAL); + + status = graph_get_title (cfg, title, sizeof (title)); + if (status != 0) + { + fprintf (stderr, "graph_search_inst: graph_get_title failed\n"); + return (status); + } + strtolower (title); + + if (search_graph_title_matches (si, title)) + { + /* The title of the graph matches, so return all instances. */ + for (i = 0; i < cfg->instances_num; i++) + { + status = (*cb) (cfg, cfg->instances[i], user_data); + if (status != 0) + return (status); + } + } + else + { + /* The title doesn't match, so use the more expensive + * "search_graph_inst_matches" to look for matching instances. Since part + * of the terms may match the title and other terms may match the + * instance, the title must be passed along to that function again. */ + for (i = 0; i < cfg->instances_num; i++) + { + if (search_graph_inst_matches (si, cfg, cfg->instances[i], title)) + { + status = (*cb) (cfg, cfg->instances[i], user_data); + if (status != 0) + return (status); + } + } + } + + return (0); +} /* }}} int graph_search_inst */ + +int graph_search_inst_string (graph_config_t *cfg, const char *term, /* {{{ */ + graph_inst_callback_t cb, void *user_data) { - graph_search_data_t data = { cfg, callback, user_data }; char buffer[1024]; int status; + size_t i; status = graph_get_title (cfg, buffer, sizeof (buffer)); if (status != 0) { - fprintf (stderr, "graph_search: graph_get_title failed\n"); + fprintf (stderr, "graph_search_inst_string: graph_get_title failed\n"); return (status); } @@ -323,20 +482,65 @@ int graph_search (graph_config_t *cfg, const char *term, /* {{{ */ if (strstr (buffer, term) != NULL) { - status = inst_foreach (cfg->instances, graph_search_submit, &data); - if (status != 0) - return (status); + for (i = 0; i < cfg->instances_num; i++) + { + status = (*cb) (cfg, cfg->instances[i], user_data); + if (status != 0) + return (status); + } } else { - status = inst_search (cfg, cfg->instances, term, - graph_search_submit, &data); + for (i = 0; i < cfg->instances_num; i++) + { + if (inst_matches_string (cfg, cfg->instances[i], term)) + { + status = (*cb) (cfg, cfg->instances[i], user_data); + if (status != 0) + return (status); + } + } + } + + return (0); +} /* }}} int graph_search_inst_string */ + +int graph_inst_search_field (graph_config_t *cfg, /* {{{ */ + graph_ident_field_t field, const char *field_value, + graph_inst_callback_t callback, void *user_data) +{ + size_t i; + const char *selector_field; + _Bool need_check_instances = 0; + + if ((cfg == NULL) || (field_value == NULL) || (callback == NULL)) + return (EINVAL); + + if (!graph_matches_field (cfg, field, field_value)) + return (0); + + selector_field = ident_get_field (cfg->select, field); + if (selector_field == NULL) + return (-1); + + if (IS_ALL (selector_field) || IS_ANY (selector_field)) + need_check_instances = 1; + + for (i = 0; i < cfg->instances_num; i++) + { + int status; + + if (need_check_instances + && !inst_matches_field (cfg->instances[i], field, field_value)) + continue; + + status = (*callback) (cfg, cfg->instances[i], user_data); if (status != 0) return (status); } return (0); -} /* }}} int graph_search */ +} /* }}} int graph_inst_search_field */ int graph_compare (graph_config_t *cfg, const graph_ident_t *ident) /* {{{ */ { @@ -346,39 +550,72 @@ int graph_compare (graph_config_t *cfg, const graph_ident_t *ident) /* {{{ */ return (ident_compare (cfg->select, ident)); } /* }}} int graph_compare */ +static int graph_sort_instances_cb (const void *v0, const void *v1) /* {{{ */ +{ + return (inst_compare (*(graph_instance_t * const *) v0, + *(graph_instance_t * const *) v1)); +} /* }}} int graph_sort_instances_cb */ + +size_t graph_num_instances (graph_config_t *cfg) /* {{{ */ +{ + if (cfg == NULL) + return ((size_t) -1); + + return (cfg->instances_num); +} /* }}} size_t graph_num_instances */ + +int graph_sort_instances (graph_config_t *cfg) /* {{{ */ +{ + if (cfg == NULL) + return (EINVAL); + + if (cfg->instances_num < 2) + return (0); + + qsort (cfg->instances, cfg->instances_num, sizeof (*cfg->instances), + graph_sort_instances_cb); + + return (0); +} /* }}} int graph_sort_instances */ + int graph_clear_instances (graph_config_t *cfg) /* {{{ */ { + size_t i; + if (cfg == NULL) return (EINVAL); - inst_destroy (cfg->instances); + for (i = 0; i < cfg->instances_num; i++) + inst_destroy (cfg->instances[i]); + free (cfg->instances); cfg->instances = NULL; + cfg->instances_num = 0; return (0); } /* }}} int graph_clear_instances */ int graph_get_rrdargs (graph_config_t *cfg, graph_instance_t *inst, /* {{{ */ - str_array_t *args) + rrd_args_t *args) { if ((cfg == NULL) || (inst == NULL) || (args == NULL)) return (EINVAL); if (cfg->title != NULL) { - array_append (args, "-t"); - array_append (args, cfg->title); + array_append (args->options, "-t"); + array_append (args->options, cfg->title); } if (cfg->vertical_label != NULL) { - array_append (args, "-v"); - array_append (args, cfg->vertical_label); + array_append (args->options, "-v"); + array_append (args->options, cfg->vertical_label); } if (cfg->show_zero) { - array_append (args, "-l"); - array_append (args, "0"); + array_append (args->options, "-l"); + array_append (args->options, "0"); } return (0);