ba2b21d7a27d408f37a68f76922a0f1d6a8a1454
1 /*****************************************************************************
2 *
3 * Library for check_disk
4 *
5 * License: GPL
6 * Copyright (c) 1999-2007 Nagios Plugins Development Team
7 *
8 * Last Modified: $Date$
9 *
10 * Description:
11 *
12 * This file contains utilities for check_disk. These are tested by libtap
13 *
14 *
15 * This program is free software: you can redistribute it and/or modify
16 * it under the terms of the GNU General Public License as published by
17 * the Free Software Foundation, either version 3 of the License, or
18 * (at your option) any later version.
19 *
20 * This program is distributed in the hope that it will be useful,
21 * but WITHOUT ANY WARRANTY; without even the implied warranty of
22 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23 * GNU General Public License for more details.
24 *
25 * You should have received a copy of the GNU General Public License
26 * along with this program. If not, see <http://www.gnu.org/licenses/>.
27 *
28 * $Id$
29 *
30 *****************************************************************************/
32 #include "common.h"
33 #include "utils_disk.h"
35 void
36 np_add_name (struct name_list **list, const char *name)
37 {
38 struct name_list *new_entry;
39 new_entry = (struct name_list *) malloc (sizeof *new_entry);
40 new_entry->name = (char *) name;
41 new_entry->next = *list;
42 *list = new_entry;
43 }
45 /* Initialises a new parameter at the end of list */
46 struct parameter_list *
47 np_add_parameter(struct parameter_list **list, const char *name)
48 {
49 struct parameter_list *current = *list;
50 struct parameter_list *new_path;
51 new_path = (struct parameter_list *) malloc (sizeof *new_path);
52 new_path->name = (char *) name;
53 new_path->best_match = NULL;
54 new_path->name_next = NULL;
55 new_path->freespace_bytes = NULL;
56 new_path->freespace_units = NULL;
57 new_path->freespace_percent = NULL;
58 new_path->usedspace_bytes = NULL;
59 new_path->usedspace_units = NULL;
60 new_path->usedspace_percent = NULL;
61 new_path->usedinodes_percent = NULL;
62 new_path->freeinodes_percent = NULL;
63 new_path->group = NULL;
65 if (current == NULL) {
66 *list = new_path;
67 } else {
68 while (current->name_next) {
69 current = current->name_next;
70 }
71 current->name_next = new_path;
72 }
73 return new_path;
74 }
76 /* Delete a given parameter from list and return pointer to next element*/
77 struct parameter_list *
78 np_del_parameter(struct parameter_list *item, struct parameter_list *prev)
79 {
80 struct parameter_list *next;
82 if (item->name_next)
83 next = item->name_next;
84 else
85 next = NULL;
87 free(item);
88 if (prev)
89 prev->name_next = next;
91 return next;
92 }
95 /* returns a pointer to the struct found in the list */
96 struct parameter_list *
97 np_find_parameter(struct parameter_list *list, const char *name)
98 {
99 struct parameter_list *temp_list;
100 for (temp_list = list; temp_list; temp_list = temp_list->name_next) {
101 if (! strcmp(temp_list->name, name))
102 return temp_list;
103 }
105 return NULL;
106 }
108 void
109 np_set_best_match(struct parameter_list *desired, struct mount_entry *mount_list, int exact)
110 {
111 struct parameter_list *d;
112 for (d = desired; d; d= d->name_next) {
113 if (! d->best_match) {
114 struct mount_entry *me;
115 size_t name_len = strlen(d->name);
116 size_t best_match_len = 0;
117 struct mount_entry *best_match = NULL;
119 /* set best match if path name exactly matches a mounted device name */
120 for (me = mount_list; me; me = me->me_next) {
121 if (strcmp(me->me_devname, d->name)==0)
122 best_match = me;
123 }
125 /* set best match by directory name if no match was found by devname */
126 if (! best_match) {
127 for (me = mount_list; me; me = me->me_next) {
128 size_t len = strlen (me->me_mountdir);
129 if ((exact == FALSE && (best_match_len <= len && len <= name_len &&
130 (len == 1 || strncmp (me->me_mountdir, d->name, len) == 0)))
131 || (exact == TRUE && strcmp(me->me_mountdir, d->name)==0))
132 {
133 best_match = me;
134 best_match_len = len;
135 }
136 }
137 }
139 if (best_match) {
140 d->best_match = best_match;
141 } else {
142 d->best_match = NULL; /* Not sure why this is needed as it should be null on initialisation */
143 }
144 }
145 }
146 }
148 /* Returns TRUE if name is in list */
149 int
150 np_find_name (struct name_list *list, const char *name)
151 {
152 const struct name_list *n;
154 if (list == NULL || name == NULL) {
155 return FALSE;
156 }
157 for (n = list; n; n = n->next) {
158 if (!strcmp(name, n->name)) {
159 return TRUE;
160 }
161 }
162 return FALSE;
163 }
165 int
166 np_seen_name(struct name_list *list, const char *name)
167 {
168 const struct name_list *s;
169 for (s = list; s; s=s->next) {
170 if (!strcmp(s->name, name)) {
171 return TRUE;
172 }
173 }
174 return FALSE;
175 }
177 int
178 np_regex_match_mount_entry (struct mount_entry* me, regex_t* re)
179 {
180 if (regexec(re, me->me_devname, (size_t) 0, NULL, 0) == 0 ||
181 regexec(re, me->me_mountdir, (size_t) 0, NULL, 0) == 0 ) {
182 return TRUE;
183 } else {
184 return FALSE;
185 }
186 }