2 * Implementation for condition handler.
6 * Wireshark - Network traffic analyzer
7 * By Gerald Combs <gerald@wireshark.org>
8 * Copyright 1998 Gerald Combs
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public License
12 * as published by the Free Software Foundation; either version 2
13 * of the License, or (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
30 #include "conditions.h"
32 /* container for condition classes */
33 static GHashTable *classes = NULL;
35 /* condition data structure declaration */
40 _cnd_reset reset_func;
43 /* structure used to store class functions in GHashTable */
44 typedef struct _cnd_class{
45 _cnd_constr constr_func;
46 _cnd_destr destr_func;
48 _cnd_reset reset_func;
51 /* helper function prototypes */
52 static void _cnd_init(void);
53 static void _cnd_find_hash_key_for_class_id(gpointer, gpointer, gpointer);
55 condition *cnd_new(const char *class_id, ...) {
57 condition *cnd = NULL;
58 condition *cnd_ref = NULL;
59 _cnd_class *cls = NULL;
62 /* check if hash table is already initialized */
65 /* get class structure for this id */
66 if ((cls = (_cnd_class *)g_hash_table_lookup(classes, class_id)) == NULL) {
67 g_warning("cnd_new: Couldn't find class ID \"%s\"", class_id);
71 /* initialize the basic structure */
72 if ((cnd_ref = (condition *)g_malloc(sizeof(condition))) == NULL)
74 cnd_ref->user_data = NULL;
75 cnd_ref->eval_func = cls->eval_func;
76 cnd_ref->reset_func = cls->reset_func;
78 cnd_ref->class_id = g_strdup(class_id);
80 /* perform class specific initialization */
81 va_start(ap, class_id);
82 cnd = (cls->constr_func)(cnd_ref, ap);
85 /* check for successful construction */
93 void cnd_delete(condition *cnd) {
94 _cnd_class *cls = NULL;
96 /* check for valid pointer */
100 class_id = cnd->class_id;
101 /* check if hash table is already initialized */
103 /* get the condition class */
104 cls = (_cnd_class *)g_hash_table_lookup(classes, class_id);
105 /* call class specific destructor */
107 (cls->destr_func)(cnd);
109 g_free(cnd->class_id);
110 /* free basic structure */
112 } /* END cnd_delete() */
114 gboolean cnd_eval(condition *cnd, ...) {
116 gboolean ret_val = FALSE;
120 /* call specific handler */
122 ret_val = (cnd->eval_func)(cnd, ap);
125 } /* END cnd_eval() */
127 void cnd_reset(condition *cnd) {
129 (cnd->reset_func)(cnd);
130 } /* END cnd_reset() */
132 void* cnd_get_user_data(condition *cnd) {
133 return cnd->user_data;
134 } /* END cnd_get_user_data() */
136 void cnd_set_user_data(condition *cnd, void *user_data) {
137 cnd->user_data = user_data;
138 } /* END cnd_set_user_data() */
140 gboolean cnd_register_class(const char *class_id,
141 _cnd_constr constr_func,
142 _cnd_destr destr_func,
144 _cnd_reset reset_func) {
146 _cnd_class *cls = NULL;
147 /* check for valid parameters */
148 if ((constr_func == NULL) || (destr_func == NULL) ||
149 (eval_func == NULL) || (reset_func == NULL) || (class_id == NULL))
151 /* check if hash table is already initialized */
153 /* check for unique class id */
154 if (g_hash_table_lookup(classes, class_id) != NULL) {
155 g_warning("cnd_register_class: Duplicate class ID \"%s\"", class_id);
158 /* GHashTable keys need to be persistent for the lifetime of the hash
159 table. Allocate memory and copy the class id which we use as key. */
160 key = g_strdup(class_id);
161 /* initialize class structure */
162 if ((cls = (_cnd_class*)g_malloc(sizeof(_cnd_class))) == NULL) {
166 cls->constr_func = constr_func;
167 cls->destr_func = destr_func;
168 cls->eval_func = eval_func;
169 cls->reset_func = reset_func;
170 /* insert new class */
171 g_hash_table_insert(classes, key, cls);
173 } /* END cnd_register_class() */
175 static char *pkey = NULL;
176 void cnd_unregister_class(const char* class_id) {
177 const char *key = (const char*)class_id;
178 _cnd_class *cls = NULL;
179 /* check if hash table is already initialized */
181 /* find the key for this class id and store it in 'pkey' */
182 g_hash_table_foreach(classes,
183 _cnd_find_hash_key_for_class_id,
185 /* find the class structure for this class id */
186 cls = (_cnd_class*)g_hash_table_lookup(classes, class_id);
187 /* remove constructor from hash table */
188 g_hash_table_remove(classes, class_id);
194 } /* END cnd_unregister_class() */
197 * Initialize hash table.
199 static void _cnd_init(void) {
202 /* create hash table, we use strings as keys */
203 classes = g_hash_table_new(g_str_hash, g_str_equal);
204 } /* END _cnd_init() */
207 * Callback for function 'g_hash_table_foreach()'.
208 * We don't keep references to hash table keys. Keys have memory allocated
209 * which must be freed when they are not used anymore. This function finds
210 * the reference to a key corresponding to a particular class id. The reference
211 * to the key is stored in a global variable.
213 void _cnd_find_hash_key_for_class_id(gpointer key,
215 gpointer user_data) {
216 char *class_id = (char *)user_data;
217 char *key_value = (char *)key;
218 if (strcmp(class_id, key_value) == 0)
220 } /* END _cnd_find_hash_key_for_class_id() */
228 * indent-tabs-mode: nil
231 * ex: set shiftwidth=2 tabstop=8 expandtab:
232 * :indentSize=2:tabSize=8:noTabs=true: