6 * User Accessible Tables
7 * Mantain an array of user accessible data strucures
9 * (c) 2007, Luis E. Garcia Ontanon <luis.ontanon@gmail.com>
11 * Wireshark - Network traffic analyzer
12 * By Gerald Combs <gerald@wireshark.org>
13 * Copyright 2001 Gerald Combs
15 * This program is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU General Public License
17 * as published by the Free Software Foundation; either version 2
18 * of the License, or (at your option) any later version.
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.
25 * You should have received a copy of the GNU General Public License
26 * along with this program; if not, write to the Free Software
27 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
41 #include <epan/emem.h>
42 #include <epan/report_err.h>
43 #include <epan/filesystem.h>
44 #include <epan/packet.h>
48 static GPtrArray* all_uats = NULL;
51 all_uats = g_ptr_array_new();
54 uat_t* uat_new(const char* name,
61 uat_copy_cb_t copy_cb,
62 uat_update_cb_t update_cb,
63 uat_free_cb_t free_cb,
64 uat_field_t* flds_array) {
65 uat_t* uat = g_malloc(sizeof(uat_t));
69 all_uats = g_ptr_array_new();
71 g_ptr_array_add(all_uats,uat);
73 g_assert(name && size && filename && data_ptr && numitems_ptr);
75 uat->name = g_strdup(name);
76 uat->record_size = size;
77 uat->filename = g_strdup(filename);
78 uat->user_ptr = data_ptr;
79 uat->nrows_p = numitems_ptr;
80 uat->copy_cb = copy_cb;
81 uat->update_cb = update_cb;
82 uat->free_cb = free_cb;
83 uat->fields = flds_array;
84 uat->user_data = g_array_new(FALSE,FALSE,uat->record_size);
89 uat->category = category;
91 for (i=0;flds_array[i].name;i++) {
92 fld_data_t* f = g_malloc(sizeof(fld_data_t));
98 flds_array[i].priv = f;
110 void* uat_add_record(uat_t* uat, const void* data) {
113 g_array_append_vals (uat->user_data, data, 1);
115 rec = uat->user_data->data + (uat->record_size * (uat->user_data->len-1));
118 uat->copy_cb(rec, data, uat->record_size);
126 void uat_swap(uat_t* uat, guint a, guint b) {
127 guint s = uat->record_size;
128 void* tmp = ep_alloc(s);
130 g_assert( a < uat->user_data->len && b < uat->user_data->len );
134 memcpy(tmp, UAT_INDEX_PTR(uat,a), s);
135 memcpy(UAT_INDEX_PTR(uat,a), UAT_INDEX_PTR(uat,b), s);
136 memcpy(UAT_INDEX_PTR(uat,b), tmp, s);
140 void uat_remove_record_idx(uat_t* uat, guint idx) {
142 g_assert( idx < uat->user_data->len );
145 uat->free_cb(UAT_INDEX_PTR(uat,idx));
148 g_array_remove_index(uat->user_data, idx);
154 gchar* uat_get_actual_filename(uat_t* uat, gboolean for_writing) {
155 gchar* pers_fname = get_persconffile_path(uat->filename,for_writing);
157 if (! for_writing ) {
158 gchar* data_fname = get_datafile_path(uat->filename);
160 if (file_exists(data_fname)) {
165 if ((! file_exists(pers_fname) ) && (! for_writing ) ) {
172 static void putfld(FILE* fp, void* rec, uat_field_t* f) {
176 f->cb.tostr(rec,&fld_ptr,&fld_len,f->cbdata.tostr,f->fld_data);
180 case PT_TXTMOD_STRING: {
185 for(i=0;i<fld_len;i++) {
188 if (c == '"' || c == '\\' || ! isprint(c) ) {
189 fprintf(fp,"\\x%.2x",c);
198 case PT_TXTMOD_HEXBYTES: {
201 for(i=0;i<fld_len;i++) {
202 fprintf(fp,"%.2x",((guint8*)fld_ptr)[i]);
208 g_assert_not_reached();
212 gboolean uat_save(uat_t* uat, char** error) {
214 gchar* fname = uat_get_actual_filename(uat,TRUE);
217 if (! fname ) return FALSE;
219 fp = fopen(fname,"w");
222 *error = ep_strdup_printf("uat_save: error opening '%s': %s",fname,strerror(errno));
228 fprintf(fp,"# This file is automatically generated, DO NOT MODIFY.\n");
230 for ( i = 0 ; i < uat->user_data->len ; i++ ) {
231 void* rec = uat->user_data->data + (uat->record_size * i);
238 for( j=0 ; j < uat->ncols ; j++ ) {
239 putfld(fp, rec, &(f[j]));
240 fputs((j == uat->ncols - 1) ? "\n" : "," ,fp);
247 uat->changed = FALSE;
252 void uat_destroy(uat_t* uat) {
253 /* XXX still missing a destructor */
254 g_ptr_array_remove(all_uats,uat);
258 void uat_clear(uat_t* uat) {
261 for ( i = 0 ; i < uat->user_data->len ; i++ ) {
263 uat->free_cb(UAT_INDEX_PTR(uat,i));
267 g_array_set_size(uat->user_data,0);
269 *((uat)->user_ptr) = NULL;
270 *((uat)->nrows_p) = 0;
273 void* uat_dup(uat_t* uat, guint* len_p) {
274 guint size = (uat->record_size * uat->user_data->len);
276 return size ? g_memdup(uat->user_data->data,size) : NULL ;
279 void* uat_se_dup(uat_t* uat, guint* len_p) {
280 guint size = (uat->record_size * uat->user_data->len);
282 return size ? se_memdup(uat->user_data->data,size) : NULL ;
285 void uat_cleanup(void) {
286 while( all_uats->len ) {
287 uat_destroy((uat_t*)all_uats->pdata);
290 g_ptr_array_free(all_uats,TRUE);
294 void uat_foreach_table(uat_cb_t cb,void* user_data) {
297 for (i=0; i < all_uats->len; i++)
298 cb(g_ptr_array_index(all_uats,i), user_data);
303 void uat_load_all(void) {
307 for (i=0; i < all_uats->len; i++) {
308 uat_t* u = g_ptr_array_index(all_uats,i);
314 report_failure("Error loading table '%s': %s",u->name,err);
320 gboolean uat_fld_chk_str(void* u1 _U_, const char* strptr, unsigned len _U_, void* u2 _U_, void* u3 _U_, char** err) {
321 if (strptr == NULL) {
322 *err = "NULL pointer";
330 gboolean uat_fld_chk_proto(void* u1 _U_, const char* strptr, unsigned len, void* u2 _U_, void* u3 _U_, char** err) {
332 char* name = ep_strndup(strptr,len);
336 if (find_dissector(name)) {
340 *err = "dissector not found";
349 gboolean uat_fld_chk_num_dec(void* u1 _U_, const char* strptr, unsigned len, void* u2 _U_, void* u3 _U_, char** err) {
350 char* str = ep_strndup(strptr,len);
351 long i = strtol(str,&str,10);
353 if ( ( i == 0) && (errno == ERANGE || errno == EINVAL) ) {
354 *err = strerror(errno);
362 gboolean uat_fld_chk_num_hex(void* u1 _U_, const char* strptr, unsigned len, void* u2 _U_, void* u3 _U_, char** err) {
363 char* str = ep_strndup(strptr,len);
364 long i = strtol(str,&str,16);
366 if ( ( i == 0) && (errno == ERANGE || errno == EINVAL) ) {
367 *err = strerror(errno);
375 gboolean uat_fld_chk_enum(void* u1 _U_, const char* strptr, unsigned len, void* v, void* u3 _U_, char** err) {
376 char* str = ep_strndup(strptr,len);
378 value_string* vs = v;
380 for(i=0;vs[i].strptr;i++) {
381 if (g_str_equal(vs[i].strptr,str)) {
387 *err = ep_strdup_printf("invalid value: %s",str);
391 static int xton(char d) {
403 case 'a': case 'A': return 10;
404 case 'b': case 'B': return 11;
405 case 'c': case 'C': return 12;
406 case 'd': case 'D': return 13;
407 case 'e': case 'E': return 14;
408 case 'f': case 'F': return 15;
413 char* uat_unbinstring(const char* si, guint in_len, guint* len_p) {
415 guint len = in_len/2;
426 int d1 = xton(*(si++));
427 int d0 = xton(*(si++));
429 buf[i++] = (d1 * 16) + d0;
437 char* uat_unesc(const char* si, guint in_len, guint* len_p) {
438 char* buf = g_malloc0(in_len);
442 const char* in_end = si+in_len;
444 for (s = (void*)si; s < in_end; s++) {
448 case 'a': *(p++) = '\a'; len++; break;
449 case 'b': *(p++) = '\b'; len++; break;
450 case 'e': *(p++) = '\033' /* '\e' is non ANSI-C */; len++; printf("."); break;
451 case 'f': *(p++) = '\f'; len++; break;
452 case 'n': *(p++) = '\n'; len++; break;
453 case 'r': *(p++) = '\r'; len++; break;
454 case 't': *(p++) = '\t'; len++; break;
455 case 'v': *(p++) = '\v'; len++; break;
473 if ( s[1] >= '0' && s[1] <= '7' ) {
477 if ( s[1] >= '0' && s[1] <= '7' ) {
483 c = (64 * c2) + (8 * c1) + c0;
484 *(p++) = (char) (c > 255 ? 255 : c);
494 if (isxdigit(c1) && isxdigit(c0)) {
495 *(p++) = (xton(c1) * 0x10) + xton(c0);
515 if (len_p) *len_p = len;
519 char* uat_undquote(const char* si, guint in_len, guint* len_p) {
520 return uat_unesc(si+1,in_len-2,len_p);
524 char* uat_esc(const char* buf, guint len) {
525 const guint8* end = ((guint8*)buf)+len;
526 char* out = ep_alloc0((4*len)+1);
530 for (b = (void*)buf; b < end; b++) {
534 g_snprintf(s,5,"\\x%.2x",((guint)*b));
543 CHK_STR_IS_DEF(isprint)
544 CHK_STR_IS_DEF(isalpha)
545 CHK_STR_IS_DEF(isalnum)
546 CHK_STR_IS_DEF(isdigit)
547 CHK_STR_IS_DEF(isxdigit)