/* value_string.c * Routines for value_strings * * $Id: value_string.c 23149 2007-10-11 19:40:58Z jake $ * * Wireshark - Network traffic analyzer * By Gerald Combs * Copyright 1998 Gerald Combs * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * 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 General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #ifdef HAVE_CONFIG_H # include "config.h" #endif #include #include "to_str.h" #include "emem.h" #include "value_string.h" /* Tries to match val against each element in the value_string array vs. Returns the associated string ptr on a match. Formats val with fmt, and returns the resulting string, on failure. */ const gchar* val_to_str(guint32 val, const value_string *vs, const char *fmt) { const gchar *ret; g_assert(fmt != NULL); ret = match_strval(val, vs); if (ret != NULL) return ret; return ep_strdup_printf(fmt, val); } /* Tries to match val against each element in the value_string array vs. Returns the associated string ptr, and sets "*idx" to the index in that table, on a match, and returns NULL, and sets "*idx" to -1, on failure. */ const gchar* match_strval_idx(guint32 val, const value_string *vs, gint *idx) { gint i = 0; if(vs) { while (vs[i].strptr) { if (vs[i].value == val) { *idx = i; return(vs[i].strptr); } i++; } } *idx = -1; return NULL; } /* Like match_strval_idx(), but doesn't return the index. */ const gchar* match_strval(guint32 val, const value_string *vs) { gint ignore_me; return match_strval_idx(val, vs, &ignore_me); } /* Generate a string describing an enumerated bitfield (an N-bit field with various specific values having particular names). */ const char * decode_enumerated_bitfield(guint32 val, guint32 mask, int width, const value_string *tab, const char *fmt) { static char buf[1025]; char *p; p = decode_bitfield_value(buf, val, mask, width); g_snprintf(p, 1024-(p-buf), fmt, val_to_str(val & mask, tab, "Unknown")); return buf; } /* Generate a string describing an enumerated bitfield (an N-bit field with various specific values having particular names). */ const char * decode_enumerated_bitfield_shifted(guint32 val, guint32 mask, int width, const value_string *tab, const char *fmt) { static char buf[1025]; char *p; int shift = 0; /* Compute the number of bits we have to shift the bitfield right to extract its value. */ while ((mask & (1<> shift, tab, "Unknown")); return buf; } /* FF: ranges aware versions */ /* Tries to match val against each range in the range_string array rs. Returns the associated string ptr on a match. Formats val with fmt, and returns the resulting string, on failure. */ const gchar *rval_to_str(guint32 val, const range_string *rs, const char *fmt) { const gchar *ret = NULL; g_assert(fmt != NULL); ret = match_strrval(val, rs); if(ret != NULL) return ret; return ep_strdup_printf(fmt, val); } /* Tries to match val against each range in the range_string array rs. Returns the associated string ptr, and sets "*idx" to the index in that table, on a match, and returns NULL, and sets "*idx" to -1, on failure. */ const gchar *match_strrval_idx(guint32 val, const range_string *rs, gint *idx) { gint i = 0; if(rs) { while(rs[i].strptr) { if( (val >= rs[i].value_min) && (val <= rs[i].value_max) ) { *idx = i; return (rs[i].strptr); } i++; } } *idx = -1; return NULL; } /* Like match_strrval_idx(), but doesn't return the index. */ const gchar *match_strrval(guint32 val, const range_string *rs) { gint ignore_me = 0; return match_strrval_idx(val, rs, &ignore_me); }