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.
32 #include "conditions.h"
34 /* container for condition classes */
35 static GHashTable* classes = NULL;
37 /* condition data structure declaration */
42 _cnd_reset reset_func;
45 /* structure used to store class functions in GHashTable */
46 typedef struct _cnd_class{
47 _cnd_constr constr_func;
48 _cnd_destr destr_func;
50 _cnd_reset reset_func;
53 /* helper function prototypes */
54 static void _cnd_init(void);
55 static void _cnd_find_hash_key_for_class_id(gpointer, gpointer, gpointer);
57 condition* cnd_new(const char* class_id, ...){
59 condition *cnd = NULL, *cnd_ref = NULL;
60 _cnd_class *cls = NULL;
63 /* check if hash table is already initialized */
66 /* get class structure for this id */
67 if((cls = (_cnd_class*)g_hash_table_lookup(classes, class_id)) == NULL) {
68 g_warning("cnd_new: Couldn't find class ID \"%s\"", class_id);
72 /* initialize the basic structure */
73 if((cnd_ref = (condition*)g_malloc(sizeof(condition))) == NULL) return 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 */
97 if(cnd == NULL) return;
99 class_id = cnd->class_id;
100 /* check if hash table is already initialized */
102 /* get the condition class */
103 cls = (_cnd_class*)g_hash_table_lookup(classes, class_id);
104 /* call class specific destructor */
105 if(cls != NULL) (cls->destr_func)(cnd);
107 g_free(cnd->class_id);
108 /* free basic structure */
110 } /* END cnd_delete() */
112 gboolean cnd_eval(condition *cnd, ...){
114 gboolean ret_val = FALSE;
116 if(cnd == NULL) return FALSE;
117 /* call specific handler */
119 ret_val = (cnd->eval_func)(cnd, ap);
122 } /* END cnd_eval() */
124 void cnd_reset(condition *cnd){
125 if(cnd != NULL) (cnd->reset_func)(cnd);
126 } /* END cnd_reset() */
128 void* cnd_get_user_data(condition *cnd){
129 return cnd->user_data;
130 } /* END cnd_get_user_data() */
132 void cnd_set_user_data(condition *cnd, void* user_data){
133 cnd->user_data = user_data;
134 } /* END cnd_set_user_data() */
136 gboolean cnd_register_class(const char* class_id,
137 _cnd_constr constr_func,
138 _cnd_destr destr_func,
140 _cnd_reset reset_func){
142 _cnd_class *cls = NULL;
143 /* check for valid parameters */
144 if((constr_func == NULL) || (destr_func == NULL) ||
145 (eval_func == NULL) || (reset_func == NULL) || (class_id == NULL))
147 /* check if hash table is already initialized */
149 /* check for unique class id */
150 if(g_hash_table_lookup(classes, class_id) != NULL) {
151 g_warning("cnd_register_class: Duplicate class ID \"%s\"", class_id);
154 /* GHashTable keys need to be persistent for the lifetime of the hash
155 table. Allocate memory and copy the class id which we use as key. */
156 key = g_strdup(class_id);
157 /* initialize class structure */
158 if((cls = (_cnd_class*)g_malloc(sizeof(_cnd_class))) == NULL){
162 cls->constr_func = constr_func;
163 cls->destr_func = destr_func;
164 cls->eval_func = eval_func;
165 cls->reset_func = reset_func;
166 /* insert new class */
167 g_hash_table_insert(classes, key, cls);
169 } /* END cnd_register_class() */
171 static char* pkey = NULL;
172 void cnd_unregister_class(const char* class_id){
173 const char *key = (const char*)class_id;
174 _cnd_class *cls = NULL;
175 /* check if hash table is already initialized */
177 /* find the key for this class id and store it in 'pkey' */
178 g_hash_table_foreach(classes,
179 _cnd_find_hash_key_for_class_id,
181 /* find the class structure for this class id */
182 cls = (_cnd_class*)g_hash_table_lookup(classes, class_id);
183 /* remove constructor from hash table */
184 g_hash_table_remove(classes, class_id);
190 } /* END cnd_unregister_class() */
193 * Initialize hash table.
195 static void _cnd_init(void){
196 if(classes != NULL) return;
197 /* create hash table, we use strings as keys */
198 classes = g_hash_table_new(g_str_hash, g_str_equal);
199 } /* END _cnd_init() */
202 * Callback for function 'g_hash_table_foreach()'.
203 * We don't keep references to hash table keys. Keys have memory allocated
204 * which must be freed when they are not used anymore. This function finds
205 * the reference to a key corresponding to a particular class id. The reference
206 * to the key is stored in a global variable.
208 void _cnd_find_hash_key_for_class_id(gpointer key,
211 char* class_id = (char*)user_data;
212 char* key_value = (char*)key;
213 if(strcmp(class_id, key_value) == 0) pkey = key_value;
214 } /* END _cnd_find_hash_key_for_class_id() */
222 * indent-tabs-mode: nil
225 * ex: set shiftwidth=2 tabstop=8 expandtab:
226 * :indentSize=2:tabSize=8:noTabs=true: