/* acconfig.h
* #ifdefs to be controlled by "configure"
*
- * $Id: acconfig.h,v 1.2 2001/10/28 01:27:59 guy Exp $
+ * $Id: acconfig.h,v 1.3 2002/08/28 20:40:43 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
/* atalk-utils.c
* Routines for Appletalk utilities (DDP, currently).
*
- * $Id: atalk-utils.c,v 1.2 2002/06/28 20:13:03 guy Exp $
+ * $Id: atalk-utils.c,v 1.3 2002/08/28 20:40:44 jmayer Exp $
*
* Simon Wilkinson <sxw@dcs.ed.ac.uk>
*
* 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.
/* atalk-utils.h
* Definitions for Appletalk utilities (DDP, currently).
*
- * $Id: atalk-utils.h,v 1.2 2002/06/28 20:13:03 guy Exp $
+ * $Id: atalk-utils.h,v 1.3 2002/08/28 20:40:44 jmayer Exp $
*
* 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.
/* bitswap.c
* Table of bit-swapped values of bytes
*
- * $Id: bitswap.c,v 1.1 2000/11/15 09:37:51 guy Exp $
+ * $Id: bitswap.c,v 1.2 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
/* bitswap.h
* Macro to bitswap a byte by looking it up in a table
*
- * $Id: bitswap.h,v 1.1 2000/11/15 09:37:51 guy Exp $
+ * $Id: bitswap.h,v 1.2 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
/* column-utils.c
* Routines for column utilities.
*
- * $Id: column-utils.c,v 1.17 2002/08/02 21:29:39 jmayer Exp $
+ * $Id: column-utils.c,v 1.18 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
#include "packet_info.h"
#include "pint.h"
#include "resolv.h"
-#include "ipv6-utils.h"
+#include "ipv6-utils.h"
#include "osi-utils.h"
/* Allocate all the data structures for constructing column data, given
#if 0
/*
- * This function does not appear to be used anywhere...
+ * This function does not appear to be used anywhere...
*/
gboolean
col_get_writable(column_info *cinfo)
void
col_set_str(column_info *cinfo, gint el, gchar* str) {
int i;
-
+
for (i = 0; i < cinfo->num_cols; i++) {
if (cinfo->fmt_matx[i][el])
cinfo->col_data[i] = str;
max_len = COL_MAX_INFO_LEN;
else
max_len = COL_MAX_LEN;
-
+
va_start(ap, format);
for (i = 0; i < cinfo->num_cols; i++) {
if (cinfo->fmt_matx[i][el]) {
va_list ap;
int i;
size_t len, max_len;
-
+
if (el == COL_INFO)
max_len = COL_MAX_INFO_LEN;
else
max_len = COL_MAX_LEN;
-
+
va_start(ap, format);
for (i = 0; i < cinfo->num_cols; i++) {
if (cinfo->fmt_matx[i][el]) {
char orig_buf[COL_BUF_MAX_LEN];
char *orig;
size_t max_len;
-
+
if (el == COL_INFO)
max_len = COL_MAX_INFO_LEN;
else
max_len = COL_MAX_LEN;
-
+
va_start(ap, format);
for (i = 0; i < cinfo->num_cols; i++) {
if (cinfo->fmt_matx[i][el]) {
max_len = COL_MAX_INFO_LEN;
else
max_len = COL_MAX_LEN;
-
+
for (i = 0; i < cinfo->num_cols; i++) {
if (cinfo->fmt_matx[i][el]) {
strncpy(cinfo->col_buf[i], str, max_len);
max_len = COL_MAX_INFO_LEN;
else
max_len = COL_MAX_LEN;
-
+
for (i = 0; i < cinfo->num_cols; i++) {
if (cinfo->fmt_matx[i][el]) {
if (cinfo->col_data[i] != cinfo->col_buf[i]) {
else
snprintf(pinfo->cinfo->col_buf[col], COL_MAX_LEN, "%u", port);
break;
-
+
case PT_TCP:
if (is_res)
strncpy(pinfo->cinfo->col_buf[col], get_tcp_port(port), COL_MAX_LEN);
/* column-utils.h
* Definitions for column utility structures and routines
*
- * $Id: column-utils.h,v 1.6 2002/01/29 08:44:49 guy Exp $
+ * $Id: column-utils.h,v 1.7 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* column.h
* Definitions for column structures and routines
*
- * $Id: column_info.h,v 1.2 2002/01/11 08:21:00 guy Exp $
+ * $Id: column_info.h,v 1.3 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
/* conversation.c
* Routines for building lists of packets that are part of a "conversation"
*
- * $Id: conversation.c,v 1.19 2002/08/02 21:29:39 jmayer Exp $
+ * $Id: conversation.c,v 1.20 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
static GMemChunk *conversation_key_chunk = NULL;
static GMemChunk *conversation_chunk = NULL;
-#ifdef __NOT_USED__
+#ifdef __NOT_USED__
typedef struct conversation_key {
struct conversation_key *next;
address addr1;
* Compute the hash value for two given address/port pairs if the match
* is to be exact.
*/
-static guint
+static guint
conversation_hash_exact(gconstpointer v)
{
conversation_key *key = (conversation_key *)v;
/*
* The addresses or the ports don't match.
- */
+ */
return 0;
}
* Compute the hash value for two given address/port pairs if the match
* has a wildcard address 2.
*/
-static guint
+static guint
conversation_hash_no_addr2(gconstpointer v)
{
conversation_key *key = (conversation_key *)v;
/*
* The addresses or the ports don't match.
- */
+ */
return 0;
}
* Compute the hash value for two given address/port pairs if the match
* has a wildcard port 2.
*/
-static guint
+static guint
conversation_hash_no_port2(gconstpointer v)
{
conversation_key *key = (conversation_key *)v;
/*
* The addresses or the ports don't match.
- */
+ */
return 0;
}
* Compute the hash value for two given address/port pairs if the match
* has a wildcard address 2 and port 2.
*/
-static guint
+static guint
conversation_hash_no_addr2_or_port2(gconstpointer v)
{
conversation_key *key = (conversation_key *)v;
/*
* The addresses or the ports don't match.
- */
+ */
return 0;
}
g_hash_table_insert(conversation_hashtable_exact,
conv->key_ptr, conv);
}
-}
+}
/*
* Set the address 2 value in a key. Remove the original from
key.port2 = port2;
return g_hash_table_lookup(hashtable, &key);
}
-
+
/*
* Given two address/port pairs for a packet, search for a conversation
* oriented protocols, the endpoints of a connection
* have only one address each, i.e. you don't get
* packets in a given direction coming from more than
- * one address.)
+ * one address.)
*/
if (!(options & NO_ADDR_B) && ptype != PT_UDP)
conversation_set_addr2(conversation, addr_b);
conversation = find_conversation(addr_a, addr_b, ptype, port_a,
port_b, 0);
-
+
if (conversation != NULL) {
if (conversation->dissector_handle == NULL){
pinfo->can_desegment=saved_can_desegment;
/* conversation.h
* Routines for building lists of packets that are part of a "conversation"
*
- * $Id: conversation.h,v 1.9 2001/11/27 07:13:32 guy Exp $
+ * $Id: conversation.h,v 1.10 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
#ifndef __CONVERSATION_H__
#define __CONVERSATION_H__
-/*
+/*
* Flags to pass to "conversation_new()" to indicate that the address 2
* and/or port 2 values for the conversation should be wildcards.
*/
#define NO_ADDR2 0x01
#define NO_PORT2 0x02
-/*
+/*
* Flags to pass to "find_conversation()" to indicate that the address B
* and/or port B search arguments are wildcards.
*/
/*
- * $Id: dfilter-int.h,v 1.6 2002/04/29 07:55:32 guy Exp $
+ * $Id: dfilter-int.h,v 1.7 2002/08/28 20:40:55 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: dfilter.c,v 1.10 2002/05/09 23:50:30 gram Exp $
+ * $Id: dfilter.c,v 1.11 2002/08/28 20:40:55 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/* Create bytecode */
dfw_gencode(dfw);
-
+
/* Tuck away the bytecode in the dfilter_t */
dfilter = dfilter_new();
dfilter->insns = dfw->insns;
proto_tree_prime_hfid(tree, df->interesting_fields[i]);
}
}
-
+
void
dfilter_dump(dfilter_t *df)
/*
- * $Id: dfilter.h,v 1.5 2002/05/09 23:50:30 gram Exp $
+ * $Id: dfilter.h,v 1.6 2002/08/28 20:40:55 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: dfvm.c,v 1.7 2002/05/09 23:50:30 gram Exp $
+ * $Id: dfvm.c,v 1.8 2002/08/28 20:40:55 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: dfvm.h,v 1.6 2002/05/09 23:50:30 gram Exp $
+ * $Id: dfvm.h,v 1.7 2002/08/28 20:40:55 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
ANY_LT,
ANY_LE,
MK_RANGE
-
+
} dfvm_opcode_t;
typedef struct {
/* drange.c
* Routines for providing general range support to the dfilter library
*
- * $Id: drange.c,v 1.3 2002/03/02 20:48:11 guy Exp $
- *
+ * $Id: drange.c,v 1.4 2002/08/28 20:40:55 jmayer Exp $
+ *
* Copyright (c) 2000 by Ed Warnicke <hagbard@physics.rutgers.edu>
*
* Ethereal - Network traffic analyzer
g_free(drnode);
}
-/* drange_node accessors */
+/* drange_node accessors */
gint
drange_node_get_start_offset(drange_node* drnode)
{
return new_drange;
}
-
+
static void
drange_node_free_wrapper(gpointer data, gpointer userdata _U_)
{
gint drange_get_total_length(drange* dr) { return dr->total_length; }
gint drange_get_min_start_offset(drange* dr) { return dr->min_start_offset; }
gint drange_get_max_start_offset(drange* dr) { return dr->max_start_offset; }
-
+
static void
update_drange_with_node(drange *dr, drange_node *drnode)
{
if(drnode != NULL){
dr->range_list = g_slist_prepend(dr->range_list,drnode);
update_drange_with_node(dr, drnode);
- }
+ }
}
void
if(drnode != NULL){
dr->range_list = g_slist_append(dr->range_list,drnode);
update_drange_with_node(dr, drnode);
- }
+ }
}
void
/* drange.h
* Routines for providing general range support to the dfilter library
*
- * $Id: drange.h,v 1.2 2001/03/02 17:04:23 gram Exp $
- *
+ * $Id: drange.h,v 1.3 2002/08/28 20:40:55 jmayer Exp $
+ *
* Copyright (c) 2000 by Ed Warnicke <hagbard@physics.rutgers.edu>
*
* Ethereal - Network traffic analyzer
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
-#ifndef __DRANGE_H__
+#ifndef __DRANGE_H__
#define __DRANGE_H__
#include <glib.h>
-/* Please don't directly manipulate these structs. Please use
- * the methods provided. If you REALLY can't do what you need to
- * do with the methods provided please write new methods that do
- * what you need, put them into the drange object here, and limit
- * your direct manipulation of the drange and drange_node structs to
+/* Please don't directly manipulate these structs. Please use
+ * the methods provided. If you REALLY can't do what you need to
+ * do with the methods provided please write new methods that do
+ * what you need, put them into the drange object here, and limit
+ * your direct manipulation of the drange and drange_node structs to
* here.
*/
/* Call drange_node destructor on all list items */
void drange_node_free_list(GSList* list);
-/* drange_node accessors */
+/* drange_node accessors */
gint drange_node_get_start_offset(drange_node* drnode);
gint drange_node_get_length(drange_node* drnode);
gint drange_node_get_end_offset(drange_node* drnode);
drange* drange_new();
drange* drange_new_from_list(GSList *list);
-/* drange destructor, only use this if you used drange_new() to creat
+/* drange destructor, only use this if you used drange_new() to creat
* the drange
*/
void drange_free(drange* dr);
/*
- * $Id: gencode.c,v 1.6 2002/03/02 20:48:11 guy Exp $
+ * $Id: gencode.c,v 1.7 2002/08/28 20:40:55 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
int i;
int *fields;
} hash_key_iterator;
-
+
static void
get_hash_key(gpointer key, gpointer value _U_, gpointer user_data)
{
hki.fields = g_new(int, num_fields);
hki.i = 0;
-
+
g_hash_table_foreach(dfw->interesting_fields, get_hash_key, &hki);
*caller_num_fields = num_fields;
return hki.fields;
-/* $Id: glib-util.c,v 1.1 2001/02/01 20:21:18 gram Exp $ */
+/* $Id: glib-util.c,v 1.2 2002/08/28 20:40:55 jmayer Exp $ */
#include <string.h>
#include <glib.h>
newstring[abs_len] = 0;
return newstring;
-}
+}
/*
- * $Id: semcheck.c,v 1.12 2002/08/24 19:45:26 guy Exp $
+ * $Id: semcheck.c,v 1.13 2002/08/28 20:40:55 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
default:
return FALSE;
}
-
+
case FT_STRING:
case FT_STRINGZ:
case FT_UINT_STRING:
case FT_INT24:
case FT_INT32:
break;
-
+
case FT_NUM_TYPES:
g_assert_not_reached();
}
case FT_INT32:
case FT_INT64:
return FALSE;
-
+
case FT_NUM_TYPES:
g_assert_not_reached();
}
type1 = stnode_type_id(st_arg1);
type2 = stnode_type_id(st_arg2);
-
+
if (type2 == STTYPE_FIELD) {
hfinfo2 = stnode_data(st_arg2);
ftype2 = hfinfo2->type;
/*
- * $Id: semcheck.h,v 1.2 2001/02/01 20:31:18 gram Exp $
+ * $Id: semcheck.h,v 1.3 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: sttype-integer.c,v 1.1 2001/02/27 19:23:28 gram Exp $
+ * $Id: sttype-integer.c,v 1.2 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: sttype-pointer.c,v 1.2 2001/02/01 20:31:18 gram Exp $
+ * $Id: sttype-pointer.c,v 1.3 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: sttype-range.c,v 1.4 2002/01/21 07:37:37 guy Exp $
+ * $Id: sttype-range.c,v 1.5 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: sttype-range.h,v 1.3 2001/02/27 19:23:28 gram Exp $
+ * $Id: sttype-range.h,v 1.4 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: sttype-string.c,v 1.2 2001/02/01 20:31:18 gram Exp $
+ * $Id: sttype-string.c,v 1.3 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: sttype-test.c,v 1.2 2001/02/01 20:31:18 gram Exp $
+ * $Id: sttype-test.c,v 1.3 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: sttype-test.h,v 1.2 2001/02/01 20:31:18 gram Exp $
+ * $Id: sttype-test.h,v 1.3 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: syntax-tree.c,v 1.4 2001/10/26 17:29:11 gram Exp $
+ * $Id: syntax-tree.c,v 1.5 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: syntax-tree.h,v 1.3 2001/02/27 19:23:28 gram Exp $
+ * $Id: syntax-tree.h,v 1.4 2002/08/28 20:40:56 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
assert_magic(value, magicnum); \
return value->attr; \
}
-
+
#define STTYPE_ACCESSOR_PROTOTYPE(ret,type,attr) \
ret \
CONCAT(CONCAT(CONCAT(sttype_,type),_),attr) (stnode_t *node);
/* epan.h
*
- * $Id: epan.h,v 1.12 2001/12/18 19:09:03 gram Exp $
+ * $Id: epan.h,v 1.13 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal Protocol Analyzer Library
*
* Copyright (c) 2001 by Gerald Combs <gerald@ethereal.com>
- *
+ *
* 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.
/* epan_dissect.h
*
- * $Id: epan_dissect.h,v 1.1 2001/12/18 19:09:03 gram Exp $
+ * $Id: epan_dissect.h,v 1.2 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal Protocol Analyzer Library
*
* Copyright (c) 2001 by Gerald Combs <gerald@ethereal.com>
- *
+ *
* 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.
* This source code may be translated into executable form and incorporated
* into proprietary software; there is no requirement for such software to
* contain a copyright notice related to this source.
- * $Id: except.c,v 1.2 2001/07/27 16:20:39 gram Exp $
+ * $Id: except.c,v 1.3 2002/08/28 20:40:44 jmayer Exp $
* $Name: $
*/
#define XCEPT_BUFFER_SIZE 1024
#ifdef KAZLIB_RCSID
-static const char rcsid[] = "$Id: except.c,v 1.2 2001/07/27 16:20:39 gram Exp $";
+static const char rcsid[] = "$Id: except.c,v 1.3 2002/08/28 20:40:44 jmayer Exp $";
#endif
#define group except_group
int uh_ok = (pthread_key_create(&uh_key, 0) == 0);
int alloc_ok = (pthread_key_create(&alloc_key, 0) == 0);
int dealloc_ok = (pthread_key_create(&dealloc_key, 0) == 0);
-
+
if (!top_ok || !uh_ok || !alloc_ok || !dealloc_ok) {
retval = 0;
init_counter = 0;
struct except_catch *catcher = top->info.catcher;
const except_id_t *pi = catcher->id;
size_t i;
-
+
assert (top->type == XCEPT_CATCHER);
except_free(catcher->obj.dyndata);
* into proprietary software; there is no requirement for such software to
* contain a copyright notice related to this source.
*
- * $Id: except.h,v 1.3 2002/08/14 19:18:15 guy Exp $
+ * $Id: except.h,v 1.4 2002/08/28 20:40:44 jmayer Exp $
* $Name: $
*/
struct except_stacknode *except_down;
enum except_stacktype except_type;
union {
- struct except_catch *except_catcher;
+ struct except_catch *except_catcher;
struct except_cleanup *except_cleanup;
} except_info;
};
#endif
/*
- * void except_cleanup_push(void (*)(void *), void *);
+ * void except_cleanup_push(void (*)(void *), void *);
* void except_cleanup_pop(int);
* void except_checked_cleanup_pop(void (*)(void *), int);
* void except_try_push(const except_id_t [], size_t, except_t **);
if (E) \
except_cl.except_func(except_cl.except_context); \
}
-
+
#define except_try_push(ID, NUM, PPE) \
{ \
struct except_stacknode except_sn; \
#define except_try_pop() \
except_free(except_ch.except_obj.except_dyndata); \
except_pop(); \
- }
+ }
#endif
/* filesystem.c
* Filesystem utility routines
*
- * $Id: filesystem.c,v 1.19 2002/08/02 21:29:39 jmayer Exp $
+ * $Id: filesystem.c,v 1.20 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* filesystem.h
* Filesystem utility definitions
*
- * $Id: filesystem.h,v 1.11 2002/06/23 21:33:09 guy Exp $
+ * $Id: filesystem.h,v 1.12 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* frame_data.c
* Routines for packet disassembly
*
- * $Id: frame_data.c,v 1.2 2002/08/02 21:29:39 jmayer Exp $
+ * $Id: frame_data.c,v 1.3 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
static GMemChunk *frame_proto_data_area = NULL;
-/*
- * Free up any space allocated for frame proto data areas and then
+/*
+ * Free up any space allocated for frame proto data areas and then
* allocate a new area.
*
* We can free the area, as the structures it contains are pointed to by
register_init_routine(&packet_init_protocol);
}
-void
+void
frame_data_cleanup(void)
{
/* this function intentionally left blank :) */
p_add_proto_data(frame_data *fd, int proto, void *proto_data)
{
frame_proto_data *p1 = g_mem_chunk_alloc(frame_proto_data_area);
-
+
g_assert(p1 != NULL);
p1 -> proto = proto;
/* frame_data.h
* Definitions for frame_data structures and routines
*
- * $Id: frame_data.h,v 1.6 2002/08/14 19:18:15 guy Exp $
+ * $Id: frame_data.h,v 1.7 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
-/*
- * $Id: ftype-bytes.c,v 1.12 2002/05/10 02:44:08 gram Exp $
+/*
+ * $Id: ftype-bytes.c,v 1.13 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
{
return (c == '-' || c == ':' || c == '.');
}
-
+
static gboolean
val_from_string(fvalue_t *fv, char *s, LogFunc logfunc)
{
if (a->len < b->len) {
return FALSE;
}
-
+
return (memcmp(a->data, b->data, a->len) > 0);
}
if (a->len < b->len) {
return FALSE;
}
-
+
return (memcmp(a->data, b->data, a->len) >= 0);
}
if (a->len > b->len) {
return FALSE;
}
-
+
return (memcmp(a->data, b->data, a->len) < 0);
}
if (a->len > b->len) {
return FALSE;
}
-
+
return (memcmp(a->data, b->data, a->len) <= 0);
}
if (a->len < b->len) {
return FALSE;
}
-
+
if ((a->data[0] & 0x80) == 0) {
/*
* "a" is positive.
if (a->len < b->len) {
return FALSE;
}
-
+
if ((a->data[0] & 0x80) == 0) {
/*
* "a" is positive.
if (a->len > b->len) {
return FALSE;
}
-
+
if (a->data[0] & 0x80) {
/*
* "a" is negative.
if (a->len > b->len) {
return FALSE;
}
-
+
if (a->data[0] & 0x80) {
/*
* "a" is negative.
/*
- * $Id: ftype-double.c,v 1.6 2002/08/24 19:45:28 guy Exp $
+ * $Id: ftype-double.c,v 1.7 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: ftype-integer.c,v 1.9 2002/07/17 00:42:54 guy Exp $
+ * $Id: ftype-integer.c,v 1.10 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: ftype-ipv4.c,v 1.8 2002/02/05 22:50:17 guy Exp $
+ * $Id: ftype-ipv4.c,v 1.9 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: ftype-none.c,v 1.3 2001/07/13 00:55:56 guy Exp $
+ * $Id: ftype-none.c,v 1.4 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
/*
- * $Id: ftype-string.c,v 1.6 2002/03/02 20:48:13 guy Exp $
+ * $Id: ftype-string.c,v 1.7 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: ftype-time.c,v 1.16 2002/02/05 22:50:17 guy Exp $
+ * $Id: ftype-time.c,v 1.17 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: ftype-tvbuff.c,v 1.6 2002/01/21 07:37:39 guy Exp $
+ * $Id: ftype-tvbuff.c,v 1.7 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: ftypes-int.h,v 1.5 2002/01/21 07:37:39 guy Exp $
+ * $Id: ftypes-int.h,v 1.6 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/*
- * $Id: ftypes.c,v 1.6 2002/02/05 22:50:17 guy Exp $
+ * $Id: ftypes.c,v 1.7 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
/* ftypes.h
* Definitions for field types
*
- * $Id: ftypes.h,v 1.13 2002/08/24 19:45:28 guy Exp $
+ * $Id: ftypes.h,v 1.14 2002/08/28 20:41:00 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 2001 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.
*
* Useful macro for use during development.
*
- * $Id: gdebug.h,v 1.2 2001/02/01 20:31:17 gram Exp $
+ * $Id: gdebug.h,v 1.3 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 2001 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.
#include "inet_aton.h"
-/*
+/*
* Check whether "cp" is a valid ascii representation
* of an Internet address and convert to a binary address.
* Returns 1 if the address is valid, 0 if not.
continue;
}
if (base == 16 && isascii(c) && isxdigit(c)) {
- val = (val << 4) +
+ val = (val << 4) +
(c + 10 - (islower(c) ? 'a' : 'A'));
cp++;
continue;
/* inet_aton.h
*
- * $Id: inet_aton.h,v 1.1 2000/10/14 04:31:26 gram Exp $
+ * $Id: inet_aton.h,v 1.2 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
#endif
#if defined(LIBC_SCCS) && !defined(lint)
-static char rcsid[] = "$Id: inet_ntop.c,v 1.5 2002/08/04 00:45:59 jmayer Exp $";
+static char rcsid[] = "$Id: inet_ntop.c,v 1.6 2002/08/28 20:40:44 jmayer Exp $";
#endif /* LIBC_SCCS and not lint */
#ifdef HAVE_SYS_PARAM_H
tp += sprintf(tp, "%x", words[i]);
}
/* Was it a trailing run of 0x00's? */
- if (best.base != -1 && (best.base + best.len) ==
+ if (best.base != -1 && (best.base + best.len) ==
(NS_IN6ADDRSZ / NS_INT16SZ))
*tp++ = ':';
*tp++ = '\0';
/* inet_v6defs.h
*
- * $Id: inet_v6defs.h,v 1.1 2000/10/14 04:31:26 gram Exp $
+ * $Id: inet_v6defs.h,v 1.2 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
* Routines for handling of 64-bit integers
* 2001 Ronnie Sahlberg
*
- * $Id: int-64bit.c,v 1.2 2002/03/02 20:48:10 guy Exp $
+ * $Id: int-64bit.c,v 1.3 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
#include <string.h>
#include "int-64bit.h"
-/* all functions take the 64bit integer parameter as a
+/* all functions take the 64bit integer parameter as a
pointer to a 64bit integer in network order.
that is ptr[0] is the most significant byte and
ptr[7] is the least significant byte.
-*/
+*/
#define U64STRLEN 21
/* convert an unsigned 64 bit integer into a string
- it is important that this function is efficient
+ it is important that this function is efficient
since it will be used for every 64bit integer in
any capture.
It is much less important that the inverse: atou64
- be efficient since it is only called when
+ be efficient since it is only called when
diplayfilters are entered.
"neg" should be 1 if the number should have a "-" put in
since othevise the signed char in acc will
owerflow/wrap, but we dont need to do it
for every iteration. its enough if we
- do it halfway through and at the end
+ do it halfway through and at the end
and we will prevent any overflow.
*/
if((i%4)==0){
for(j=0;j<U64STRLEN-1;j++){
if(acc[j]>9){
int x;
- x=acc[j]/10;
+ x=acc[j]/10;
acc[j+1]+=x;
acc[j]-=x*10;
}
/* clear the residual string and copy the
original to it (subtracting '0')
- */
+ */
for(i=0;i<U64STRLEN;i++){
res[i]=0;
}
res[i]=u64str[len]-'0';
}
- /* go through all bits and subtract their
+ /* go through all bits and subtract their
value */
for(i=63;i>=0;i--){
if(revcmp(u64val[i], res, U64STRLEN)<=0){
if((h>='A')&&(h<='F')){
return h+10-'A';
}
-
+
if((h>='a')&&(h<='f')){
return h+10-'a';
}
for(i=0;i<len;i++){
str[15-i]=u64str[len+1-i];
}
-
+
for(i=0;i<8;i++){
u64int[i]=(ntoh(str[i*2])<<4)
/* int-64bit.h
- * Handling of 64-bit integers
+ * Handling of 64-bit integers
*
- * $Id: int-64bit.h,v 1.1 2001/11/22 03:07:06 hagbard Exp $
+ * $Id: int-64bit.h,v 1.2 2002/08/28 20:40:44 jmayer Exp $
*
* 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.
*
* Gilbert Ramirez <gram@alumni.rice.edu>
*
- * $Id: ipv4.c,v 1.3 2002/08/02 21:29:39 jmayer Exp $
+ * $Id: ipv4.c,v 1.4 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
*
* Gilbert Ramirez <gram@alumni.rice.edu>
*
- * $Id: ipv4.h,v 1.3 2001/11/13 23:55:37 gram Exp $
+ * $Id: ipv4.h,v 1.4 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
/* ipv6-utils.h
- * Definitions for IPv6 packet disassembly
+ * Definitions for IPv6 packet disassembly
*
- * $Id: ipv6-utils.h,v 1.1 2001/04/01 07:06:23 hagbard Exp $
+ * $Id: ipv6-utils.h,v 1.2 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 1998 Gerald Combs
*
* MobileIPv6 support added by Tomislav Borosa <tomislav.borosa@siemens.hr>
- *
+ *
* 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.
/* nstime.h
* Definition of data structure to hold time values with nanosecond resolution
*
- * $Id: nstime.h,v 1.1 2001/09/14 07:33:04 guy Exp $
+ * $Id: nstime.h,v 1.2 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
* Routines for ISO/OSI network and transport protocol packet disassembly
* Main entrance point and common functions
*
- * $Id: osi-utils.c,v 1.7 2002/08/02 21:29:39 jmayer Exp $
+ * $Id: osi-utils.c,v 1.8 2002/08/28 20:40:44 jmayer Exp $
* Laurent Deniel <deniel@worldnet.fr>
* Ralf Schneider <Ralf.Schneider@t-online.de>
*
* By Gerald Combs <gerald@zing.org>
* 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.
}
if ( ( length == RFC1237_NSAP_LEN ) || ( length == RFC1237_NSAP_LEN + 1 ) ) {
cur += sprintf( cur, "%s", print_area( buffer, RFC1237_FULLAREA_LEN ) );
- cur += sprintf( cur, "%s", print_system_id( buffer + RFC1237_FULLAREA_LEN,
+ cur += sprintf( cur, "%s", print_system_id( buffer + RFC1237_FULLAREA_LEN,
RFC1237_SYSTEMID_LEN ) );
- cur += sprintf( cur, "[%02x]",
+ cur += sprintf( cur, "[%02x]",
buffer[ RFC1237_FULLAREA_LEN + RFC1237_SYSTEMID_LEN ] );
if ( length == RFC1237_NSAP_LEN + 1 ) {
cur += sprintf( cur, "-%02x", buffer[ length -1 ] );
gchar *print_system_id( const guint8 *buffer, int length ) {
int tmp;
- gchar *cur;
- static gchar str[MAX_SYSTEMID_LEN * 3 + 5]; /* Don't trust exact matching */
-
+ gchar *cur;
+ static gchar str[MAX_SYSTEMID_LEN * 3 + 5]; /* Don't trust exact matching */
+
if ( ( length <= 0 ) || ( length > MAX_SYSTEMID_LEN ) ) {
sprintf( str, "<Invalid length of SYSTEM ID>");
return( str );
- }
-
+ }
+
cur = str;
if ( ( 6 == length ) || ( 7 == length ) ) { /* Special case, print as MAC */
cur += sprintf(cur, "%02x%02x.%02x%02x.%02x%02x", buffer[0], buffer[1],
/* to do : all real area decoding now: NET is assumed if id len is 1 more byte
* and take away all these stupid resource consuming local statics
*/
-
+
static gchar str[MAX_AREA_LEN * 3 + 20]; /* reserve space for nice layout */
gchar *cur;
int tmp = 0;
sprintf( str, "<Invalid length of AREA>");
return( str );
}
-
- if ( ( ( NSAP_IDI_ISODCC == *buffer )
+
+ if ( ( ( NSAP_IDI_ISODCC == *buffer )
|| ( NSAP_IDI_GOSIP2 == *buffer )
)
- &&
- ( ( RFC1237_FULLAREA_LEN == length )
+ &&
+ ( ( RFC1237_FULLAREA_LEN == length )
|| ( RFC1237_FULLAREA_LEN + 1 == length )
- )
+ )
) { /* AFI is good and length is long enough */
-
+
if ( length > RFC1237_FULLAREA_LEN + 1 ) { /* Special Case Designated IS */
sprintf( str, "<Invalid length of AREA for DCC / GOSIP AFI>");
return( str );
}
-
- cur += sprintf( cur, "[%02x|%02x:%02x][%02x|%02x:%02x:%02x|%02x:%02x]",
- buffer[0], buffer[1], buffer[2], buffer[3], buffer[4],
+
+ cur += sprintf( cur, "[%02x|%02x:%02x][%02x|%02x:%02x:%02x|%02x:%02x]",
+ buffer[0], buffer[1], buffer[2], buffer[3], buffer[4],
buffer[5], buffer[6], buffer[7], buffer[8] );
cur += sprintf( cur, "[%02x:%02x|%02x:%02x]",
buffer[9], buffer[10], buffer[11], buffer[12] );
buffer[2] );
return( str );
}
- if ( 4 < length ) {
+ if ( 4 < length ) {
while ( tmp < length / 4 ) { /* 16/4==4 > four Octets left to print */
cur += sprintf( cur, "%02x", buffer[tmp++] );
cur += sprintf( cur, "%02x", buffer[tmp++] );
sprintf( --cur, "-%02x", buffer[tmp] );
}
else {
- for ( ; tmp < length; ) { /* print the rest without dot */
+ for ( ; tmp < length; ) { /* print the rest without dot */
cur += sprintf( cur, "%02x", buffer[tmp++] );
}
- }
+ }
}
return( str );
}
/* osi-utils.h
*
- * $Id: osi-utils.h,v 1.3 2001/04/02 10:41:19 guy Exp $
+ * $Id: osi-utils.h,v 1.4 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
/* OSI Global defines, common for all OSI protocols */
-#define MAX_NSAP_LEN 30
-#define MAX_SYSTEMID_LEN 15
-#define MAX_AREA_LEN 30
+#define MAX_NSAP_LEN 30
+#define MAX_SYSTEMID_LEN 15
+#define MAX_AREA_LEN 30
#define RFC1237_NSAP_LEN 20
#define RFC1237_FULLAREA_LEN 13
/* packet.c
* Routines for packet disassembly
*
- * $Id: packet.c,v 1.77 2002/08/24 10:41:40 guy Exp $
+ * $Id: packet.c,v 1.78 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
static dissector_handle_t frame_handle = NULL;
static dissector_handle_t data_handle = NULL;
-const true_false_string flags_set_truth = {
+const true_false_string flags_set_truth = {
"Set",
"Not set"
};
* we return TRUE.
*/
return ret != 0;
- }
+ }
return FALSE;
}
handle->is_new = FALSE;
handle->dissector.old = dissector;
handle->proto_index = proto;
-
+
g_hash_table_insert(registered_dissectors, (gpointer)name,
(gpointer) handle);
}
handle->is_new = TRUE;
handle->dissector.new = dissector;
handle->proto_index = proto;
-
+
g_hash_table_insert(registered_dissectors, (gpointer)name,
(gpointer) handle);
}
/* packet.h
* Definitions for packet disassembly structures and routines
*
- * $Id: packet.h,v 1.59 2002/08/21 21:25:21 tpot Exp $
+ * $Id: packet.h,v 1.60 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* packet_info.h
* Definitions for packet info structures and routines
*
- * $Id: packet_info.h,v 1.18 2002/08/22 18:53:54 guy Exp $
+ * $Id: packet_info.h,v 1.19 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
* Definitions for extracting and translating integers safely and portably
* via pointers.
*
- * $Id: pint.h,v 1.5 2002/08/02 21:29:39 jmayer Exp $
+ * $Id: pint.h,v 1.6 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
(guint32)*((guint8 *)(p)+0)<<0)
-
+
/* Macros to byte-swap 32-bit and 16-bit quantities. */
#define BSWAP32(x) \
((((x)&0xFF000000)>>24) | \
/* plugins.c
* plugin routines
*
- * $Id: plugins.c,v 1.58 2002/08/14 19:18:15 guy Exp $
+ * $Id: plugins.c,v 1.59 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 1999 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.
#include <string.h>
#include <stdlib.h>
-#include <errno.h>
+#include <errno.h>
#ifdef HAVE_SYS_STAT_H
#include <sys/stat.h>
/* plugins.h
* definitions for plugins structures
*
- * $Id: plugins.h,v 1.8 2001/03/31 22:36:21 hagbard Exp $
+ * $Id: plugins.h,v 1.9 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* Copyright 1999 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.
/* proto.c
* Routines for protocol tree
*
- * $Id: proto.c,v 1.73 2002/08/24 19:45:24 guy Exp $
+ * $Id: proto.c,v 1.74 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* Add a text-only node to the proto_tree (va_list version) */
proto_item *
-proto_tree_add_text_valist(proto_tree *tree, tvbuff_t *tvb, gint start,
+proto_tree_add_text_valist(proto_tree *tree, tvbuff_t *tvb, gint start,
gint length, const char *format, va_list ap)
{
proto_item *pi;
return pi;
}
-
+
static void
proto_tree_set_protocol_tvb(field_info *fi, tvbuff_t *tvb)
{
proto_item_set_len(proto_item *pi, gint length)
{
field_info *fi;
-
+
if (pi == NULL)
return;
fi = PITEM_FINFO(pi);
return (proto_tree*) g_node_new(pnode);
}
-
+
/* "prime" a proto_tree with a single hfid that a dfilter
* is interested in. */
void
find_protocol_by_id(int proto_id)
{
GList *list_entry;
-
+
list_entry = g_list_find_custom(protocols, &proto_id, compare_proto_id);
if (list_entry == NULL)
return NULL;
return list_entry->data;
}
-static gint compare_filter_name(gconstpointer proto_arg,
+static gint compare_filter_name(gconstpointer proto_arg,
gconstpointer filter_name)
{
const protocol_t *protocol = proto_arg;
protocol_t *protocol;
list_entry = g_list_find_custom(protocols, filter_name,
- compare_filter_name);
+ compare_filter_name);
if (list_entry == NULL)
return -1;
protocol = list_entry->data;
return protocol->can_disable;
}
-void
+void
proto_set_decoding(int proto_id, gboolean enabled)
{
protocol_t *protocol;
protocol->is_enabled = enabled;
}
-void
+void
proto_set_cant_disable(int proto_id)
{
protocol_t *protocol;
bytes = fvalue_get(fi->value);
if (bytes) {
snprintf(label_str, ITEM_LABEL_LENGTH,
- "%s: %s", hfinfo->name,
+ "%s: %s", hfinfo->name,
bytes_to_str(bytes, fvalue_length(fi->value)));
}
else {
get_hostname6((struct e_in6_addr *)bytes),
ip6_to_str((struct e_in6_addr*)bytes));
break;
-
+
case FT_STRING:
case FT_STRINGZ:
case FT_UINT_STRING:
/* XXX - bytes_to_str_punct() will truncate long strings with '...' */
bytes_to_str_punct(fvalue_get(finfo->value),
fvalue_length(finfo->value),':'));
- break;
+ break;
default:
c = pd + finfo->start;
/* proto.h
* Definitions for protocol display
*
- * $Id: proto.h,v 1.35 2002/08/24 19:45:24 guy Exp $
+ * $Id: proto.h,v 1.36 2002/08/28 20:40:44 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* Each GNode (proto_tree, proto_item) points to one of
* these. */
typedef struct {
- field_info *finfo;
+ field_info *finfo;
tree_data_t *tree_data;
} proto_node;
/* Creates new proto_tree root */
extern proto_tree* proto_tree_create_root(void);
-/* Mark a field/protocol ID as "interesting". */
+/* Mark a field/protocol ID as "interesting". */
extern void
proto_tree_prime_hfid(proto_tree *tree, int hfid);
/* resolv.c
* Routines for network object lookup
*
- * $Id: resolv.c,v 1.24 2002/08/02 21:29:40 jmayer Exp $
+ * $Id: resolv.c,v 1.25 2002/08/28 20:40:45 jmayer Exp $
*
* Laurent Deniel <deniel@worldnet.fr>
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* first resolving call */
/*
- * Local function definitions
+ * Local function definitions
*/
static guchar *serv_name_lookup(guint port, port_type proto)
/*NOTREACHED*/
break;
} /* proto */
-
+
hash_idx = HASH_PORT(port);
tp = table[hash_idx];
if( tp == NULL ) {
tp = table[hash_idx] = (hashname_t *)g_malloc(sizeof(hashname_t));
- } else {
+ } else {
while(1) {
if( tp->addr == port ) {
return tp->name;
tp = tp->next;
}
}
-
+
/* fill in a new entry */
tp->addr = port;
tp->next = NULL;
- if (!(g_resolv_flags & RESOLV_TRANSPORT) ||
+ if (!(g_resolv_flags & RESOLV_TRANSPORT) ||
(servp = getservbyport(g_htons(port), serv_proto)) == NULL) {
/* unknown port */
sprintf(tp->name, "%d", port);
if( tp == NULL ) {
tp = host_table[hash_idx] = (hashname_t *)g_malloc(sizeof(hashname_t));
- } else {
+ } else {
while(1) {
if( tp->addr == addr ) {
if (tp->is_dummy_entry)
tp = tp->next;
}
}
-
+
/* fill in a new entry */
tp->addr = addr;
tp->next = NULL;
*/
if (addr != 0 && (g_resolv_flags & RESOLV_NETWORK)) {
#ifdef AVOID_DNS_TIMEOUT
-
+
/* Quick hack to avoid DNS/YP timeout */
-
+
if (!setjmp(hostname_env)) {
signal(SIGALRM, abort_network_query);
alarm(DNS_TIMEOUT);
if (g_resolv_flags & RESOLV_NETWORK) {
#ifdef AVOID_DNS_TIMEOUT
-
+
/* Quick hack to avoid DNS/YP timeout */
-
+
if (!setjmp(hostname_env)) {
signal(SIGALRM, abort_network_query);
alarm(DNS_TIMEOUT);
/* unknown host or DNS timeout */
#endif /* INET6 */
*found = FALSE;
- sprintf(name, "%s", ip6_to_str(addr));
+ sprintf(name, "%s", ip6_to_str(addr));
return (name);
}
return -1;
if (*buf == NULL) {
- if (*size == 0)
+ if (*size == 0)
*size = BUFSIZ;
-
+
if ((*buf = g_malloc(*size)) == NULL)
return -1;
}
if (feof(fp))
return -1;
-
+
len = 0;
while ((c = getc(fp)) != EOF && c != '\n') {
if (len+1 >= *size) {
if (len == 0 && c == EOF)
return -1;
-
+
(*buf)[len] = '\0';
-
+
return len;
} /* fgetline */
* Ethernet / manufacturer resolution
*
* The following functions implement ethernet address resolution and
- * ethers files parsing (see ethers(4)).
+ * ethers files parsing (see ethers(4)).
*
- * The manuf file has the same format as ethers(4) except that names are
- * truncated to MAXMANUFLEN-1 characters and that an address contains
+ * The manuf file has the same format as ethers(4) except that names are
+ * truncated to MAXMANUFLEN-1 characters and that an address contains
* only 3 bytes (instead of 6).
*
* Notes:
*
- * I decide to not use the existing functions (see ethers(3) on some
+ * I decide to not use the existing functions (see ethers(3) on some
* operating systems) for the following reasons:
* - performance gains (use of hash tables and some other enhancements),
* - use of two ethers files (system-wide and per user),
gchar *cp;
int a0, a1, a2, a3, a4, a5;
-
+
if ((cp = strchr(line, '#')))
*cp = '\0';
-
+
if ((cp = strtok(line, " \t\n")) == NULL)
return -1;
static ether_t *get_ethent(int six_bytes)
{
-
+
static ether_t eth;
static int size = 0;
static char *buf = NULL;
-
- if (eth_p == NULL)
+
+ if (eth_p == NULL)
return NULL;
while (fgetline(&buf, &size, eth_p) >= 0) {
return ð
}
}
-
+
return NULL;
} /* get_ethent */
static ether_t *get_ethbyname(const guchar *name)
{
ether_t *eth;
-
+
set_ethent(g_ethers_path);
while ((eth = get_ethent(1)) && strncmp(name, eth->name, MAXNAMELEN) != 0)
if (eth == NULL) {
end_ethent();
-
+
set_ethent(g_pethers_path);
while ((eth = get_ethent(1)) && strncmp(name, eth->name, MAXNAMELEN) != 0)
{
ether_t *eth;
-
+
set_ethent(g_ethers_path);
while ((eth = get_ethent(1)) && memcmp(addr, eth->addr, 6) != 0)
if (eth == NULL) {
end_ethent();
-
+
set_ethent(g_pethers_path);
-
+
while ((eth = get_ethent(1)) && memcmp(addr, eth->addr, 6) != 0)
;
-
+
end_ethent();
}
if( tp == NULL ) {
tp = manuf_table[hash_idx] = (hashmanuf_t *)g_malloc(sizeof(hashmanuf_t));
- } else {
+ } else {
while(1) {
if (tp->next == NULL) {
tp->next = (hashmanuf_t *)g_malloc(sizeof(hashmanuf_t));
tp = tp->next;
}
}
-
+
memcpy(tp->addr, addr, sizeof(tp->addr));
strncpy(tp->name, name, MAXMANUFLEN);
tp->name[MAXMANUFLEN-1] = '\0';
hash_idx = HASH_ETH_MANUF(addr);
tp = manuf_table[hash_idx];
-
+
while(tp != NULL) {
if (memcmp(tp->addr, addr, sizeof(tp->addr)) == 0) {
return tp;
}
tp = tp->next;
}
-
+
return NULL;
} /* manuf_name_lookup */
strlen(ENAME_MANUF) + 2);
sprintf(manuf_path, "%s" G_DIR_SEPARATOR_S "%s", get_datafile_dir(),
ENAME_MANUF);
-
+
/* Read it and initialize the hash table */
set_ethent(manuf_path);
if( tp == NULL ) {
tp = eth_table[hash_idx] = (hashether_t *)g_malloc(sizeof(hashether_t));
- } else {
+ } else {
while(1) {
if (memcmp(tp->addr, addr, sizeof(tp->addr)) == 0) {
/* address already known */
tp = tp->next;
}
}
-
+
memcpy(tp->addr, addr, sizeof(tp->addr));
strncpy(tp->name, name, MAXNAMELEN);
tp->name[MAXNAMELEN-1] = '\0';
if( tp == NULL ) {
tp = eth_table[hash_idx] = (hashether_t *)g_malloc(sizeof(hashether_t));
- } else {
+ } else {
while(1) {
if (memcmp(tp->addr, addr, sizeof(tp->addr)) == 0) {
return tp->name;
tp = tp->next;
}
}
-
+
/* fill in a new entry */
memcpy(tp->addr, addr, sizeof(tp->addr));
if ((manufp = manuf_name_lookup(addr)) == NULL)
sprintf(tp->name, "%s", ether_to_str((guint8 *)addr));
else
- sprintf(tp->name, "%s_%02x:%02x:%02x",
+ sprintf(tp->name, "%s_%02x:%02x:%02x",
manufp->name, addr[3], addr[4], addr[5]);
tp->is_dummy_entry = TRUE;
gchar *cp;
guint32 a, a0, a1, a2, a3;
gboolean found_single_number = FALSE;
-
+
if ((cp = strchr(line, '#')))
*cp = '\0';
-
+
if ((cp = strtok(line, " \t\n")) == NULL)
return -1;
static ipxnet_t *get_ipxnetent(void)
{
-
+
static ipxnet_t ipxnet;
static int size = 0;
static char *buf = NULL;
-
- if (ipxnet_p == NULL)
+
+ if (ipxnet_p == NULL)
return NULL;
while (fgetline(&buf, &size, ipxnet_p) >= 0) {
return &ipxnet;
}
}
-
+
return NULL;
} /* get_ipxnetent */
static ipxnet_t *get_ipxnetbyname(const guchar *name)
{
ipxnet_t *ipxnet;
-
+
set_ipxnetent(g_ipxnets_path);
while ((ipxnet = get_ipxnetent()) && strncmp(name, ipxnet->name, MAXNAMELEN) != 0)
if (ipxnet == NULL) {
end_ipxnetent();
-
+
set_ipxnetent(g_pipxnets_path);
while ((ipxnet = get_ipxnetent()) && strncmp(name, ipxnet->name, MAXNAMELEN) != 0)
{
ipxnet_t *ipxnet;
-
+
set_ipxnetent(g_ipxnets_path);
while ((ipxnet = get_ipxnetent()) && (addr != ipxnet->addr) ) ;
if (ipxnet == NULL) {
end_ipxnetent();
-
+
set_ipxnetent(g_pipxnets_path);
-
+
while ((ipxnet = get_ipxnetent()) && (addr != ipxnet->addr) )
;
-
+
end_ipxnetent();
}
if( tp == NULL ) {
tp = ipxnet_table[hash_idx] = (hashipxnet_t *)g_malloc(sizeof(hashipxnet_t));
- } else {
+ } else {
while(1) {
if (tp->next == NULL) {
tp->next = (hashipxnet_t *)g_malloc(sizeof(hashipxnet_t));
tp = tp->next;
}
}
-
+
tp->addr = addr;
strncpy(tp->name, name, MAXNAMELEN);
tp->name[MAXNAMELEN-1] = '\0';
if( tp == NULL ) {
tp = ipxnet_table[hash_idx] = (hashipxnet_t *)g_malloc(sizeof(hashipxnet_t));
- } else {
+ } else {
while(1) {
if (tp->addr == addr) {
return tp->name;
tp = tp->next;
}
}
-
+
/* fill in a new entry */
tp->addr = addr;
} /* ipxnet_addr_lookup */
-/*
+/*
* External Functions
*/
-extern guchar *get_hostname(guint addr)
+extern guchar *get_hostname(guint addr)
{
gboolean found;
if( tp == NULL ) {
tp = host_table[hash_idx] = (hashname_t *)g_malloc(sizeof(hashname_t));
- } else {
+ } else {
while(1) {
if (tp->addr == addr) {
/* address already known */
tp = tp->next;
}
}
-
+
strncpy(tp->name, name, MAXNAMELEN);
tp->name[MAXNAMELEN-1] = '\0';
tp->addr = addr;
if (!(g_resolv_flags & RESOLV_TRANSPORT)) {
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
sprintf(cur, "%u", port);
} /* get_udp_port */
-extern guchar *get_tcp_port(guint port)
+extern guchar *get_tcp_port(guint port)
{
static gchar str[3][MAXNAMELEN];
static gchar *cur;
if (!(g_resolv_flags & RESOLV_TRANSPORT)) {
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
sprintf(cur, "%u", port);
} /* get_tcp_port */
-extern guchar *get_sctp_port(guint port)
+extern guchar *get_sctp_port(guint port)
{
static gchar str[3][MAXNAMELEN];
static gchar *cur;
if (!(g_resolv_flags & RESOLV_TRANSPORT)) {
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
sprintf(cur, "%u", port);
* ether-related function called */
if (!(g_resolv_flags & RESOLV_MAC))
return NULL;
-
+
if (!eth_resolution_initialized) {
initialize_ethers();
eth_resolution_initialized = 1;
(void) eth_name_lookup(addr);
return get_ether_name_if_known(addr); /* a well-placed goto would suffice */
}
- else {
+ else {
while(1) {
if (memcmp(tp->addr, addr, sizeof(tp->addr)) == 0) {
if (!tp->is_dummy_entry) {
if ((host = host_name_lookup(ip, &found)) == NULL)
return;
-
+
/* ok, we can add this entry in the ethers hashtable */
if (found)
if (!(g_resolv_flags & RESOLV_MAC) || ((manufp = manuf_name_lookup(addr)) == NULL)) {
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
sprintf(cur, "%02x:%02x:%02x", addr[0], addr[1], addr[2]);
return cur;
}
-
+
return manufp->name;
} /* get_manuf_name */
/* resolv.h
* Definitions for network object lookup
*
- * $Id: resolv.h,v 1.8 2002/01/13 20:35:10 guy Exp $
+ * $Id: resolv.h,v 1.9 2002/08/28 20:40:45 jmayer Exp $
*
* Laurent Deniel <deniel@worldnet.fr>
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
* Routines for SNA
* Gilbert Ramirez <gram@alumni.rice.edu>
*
- * $Id: sna-utils.c,v 1.3 2001/11/13 23:55:37 gram Exp $
+ * $Id: sna-utils.c,v 1.4 2002/08/28 20:40:45 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
/* sna-utils.h
* Definitions for SNA dissection.
*
- * $Id: sna-utils.h,v 1.2 2001/04/01 07:06:24 hagbard Exp $
+ * $Id: sna-utils.h,v 1.3 2002/08/28 20:40:45 jmayer Exp $
*
* 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.
/* strutil.c
* String utility routines
*
- * $Id: strutil.c,v 1.8 2002/08/02 21:29:40 jmayer Exp $
+ * $Id: strutil.c,v 1.9 2002/08/28 20:40:45 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
int token_len;
tokenp = linep;
-
+
/*
* Search for a blank, a CR or an LF, or the end of the buffer.
*/
return bytes_to_str_punct(bd,bd_len,'\0');
}
-/* Turn an array of bytes into a string showing the bytes in hex with
+/* Turn an array of bytes into a string showing the bytes in hex with
* punct as a bytes separator.
*/
gchar *
/* strutil.h
* String utility definitions
*
- * $Id: strutil.h,v 1.8 2002/08/02 21:29:40 jmayer Exp $
+ * $Id: strutil.h,v 1.9 2002/08/28 20:40:45 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* timestamp.h
* Defines for packet timestamps
*
- * $Id: timestamp.h,v 1.1 2001/04/01 06:11:25 hagbard Exp $
+ * $Id: timestamp.h,v 1.2 2002/08/28 20:40:45 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
/* to_str.c
* Routines for utilities to convert various other types to strings.
*
- * $Id: to_str.c,v 1.16 2002/08/03 19:35:16 guy Exp $
+ * $Id: to_str.c,v 1.17 2002/08/28 20:40:45 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
p = &cur[18];
cur = &str[2][0];
} else if (cur == &str[2][0]) {
cur = &str[3][0];
- } else {
+ } else {
cur = &str[0][0];
}
ip_to_str_buf(ad, cur);
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
p = &cur[12];
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
/* to_str.h
* Definitions for utilities to convert various other types to strings.
*
- * $Id: to_str.h,v 1.7 2002/08/02 21:29:40 jmayer Exp $
+ * $Id: to_str.h,v 1.8 2002/08/28 20:40:45 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
NSECS /* nanoseconds */
} time_res_t;
-/*
+/*
* These are utility functions which convert various types to strings,
- * but for which no more specific module applies.
+ * but for which no more specific module applies.
*/
extern gchar* ether_to_str(const guint8 *);
*
* tvbtest : tvbtest.o tvbuff.o except.o
*
- * $Id: tvbtest.c,v 1.2 2001/11/13 23:55:37 gram Exp $
+ * $Id: tvbtest.c,v 1.3 2002/08/28 20:40:45 jmayer Exp $
*
* Copyright (c) 2000 by Gilbert Ramirez <gram@alumni.rice.edu>
- *
+ *
* 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.
/* 4 composites */
printf("Making Composite 5\n");
tvb_comp[5] = tvb_new_composite();
- comp_length[5] = comp_length[0] +
+ comp_length[5] = comp_length[0] +
comp_length[1] +
comp_length[2] +
comp_length[3];
/* tvbuff.c
*
* Testy, Virtual(-izable) Buffer of guint8*'s
- *
+ *
* "Testy" -- the buffer gets mad when an attempt to access data
* beyond the bounds of the buffer. An exception is thrown.
*
* the data of a backing tvbuff, or can be a composite of
* other tvbuffs.
*
- * $Id: tvbuff.c,v 1.39 2002/08/02 21:29:40 jmayer Exp $
+ * $Id: tvbuff.c,v 1.40 2002/08/28 20:40:45 jmayer Exp $
*
* Copyright (c) 2000 by Gilbert Ramirez <gram@alumni.rice.edu>
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
}
-
+
const guint8*
tvb_get_ptr(tvbuff_t *tvb, gint offset, gint length)
{
}
return format_text(ptr, len);
-
+
}
/* Looks for a stringz (NUL-terminated string) in tvbuff and copies
*next_offset = eob_offset;
break;
}
-
+
if (is_quoted) {
/*
* We're processing a quoted string.
/* tvbuff.h
*
* Testy, Virtual(-izable) Buffer of guint8*'s
- *
+ *
* "Testy" -- the buffer gets mad when an attempt is made to access data
* beyond the bounds of the buffer. An exception is thrown.
*
* the data of a backing tvbuff, or can be a composite of
* other tvbuffs.
*
- * $Id: tvbuff.h,v 1.28 2002/07/17 06:55:24 guy Exp $
+ * $Id: tvbuff.h,v 1.29 2002/08/28 20:40:45 jmayer Exp $
*
* Copyright (c) 2000 by Gilbert Ramirez <gram@alumni.rice.edu>
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
/* value_string.c
* Routines for value_strings
*
- * $Id: value_string.c,v 1.3 2001/09/14 07:23:33 guy Exp $
+ * $Id: value_string.c,v 1.4 2002/08/28 20:40:45 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
return ret;
if (cur == &str[0][0]) {
cur = &str[1][0];
- } else if (cur == &str[1][0]) {
+ } else if (cur == &str[1][0]) {
cur = &str[2][0];
- } else {
+ } else {
cur = &str[0][0];
}
snprintf(cur, 64, fmt, val);
gchar*
match_strval(guint32 val, const value_string *vs) {
gint i = 0;
-
+
while (vs[i].strptr) {
if (vs[i].value == val)
return(vs[i].strptr);
/* value_string.h
* Definitions for value_string structures and routines
*
- * $Id: value_string.h,v 1.2 2001/11/04 03:55:52 guy Exp $
+ * $Id: value_string.h,v 1.3 2002/08/28 20:40:45 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
* 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.
* Routines for docsis dissection
* Copyright 2002, Anand V. Narwani <anarwani@cisco.com>
*
- * $Id: packet-docsis.c,v 1.7 2002/08/20 22:44:25 guy Exp $
+ * $Id: packet-docsis.c,v 1.8 2002/08/28 20:38:59 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
/* This code is based on the DOCSIS 1.1 specification available at:
* http://www.cablemodem.com/specifications.html
- *
- * DOCSIS Captures can be facilitated using the Cable Monitor Feature
+ *
+ * DOCSIS Captures can be facilitated using the Cable Monitor Feature
* available on Cisco Cable Modem Termination Systems :
* http://www.cisco.com/univercd/cc/td/doc/product/cable/cab_rout/cmtsfg/ufg_cmon.htm
*
* This dissector depends on the presence of a DOCSIS enapsulation type.
* There is no simple way to distinguish DOCSIS Frames from Ethernet frames,
- * since the frames are copied from the RF interface on the CMTS to
+ * since the frames are copied from the RF interface on the CMTS to
* a Fast Ethernet interface; Thus a preference was needed to enable
* the DOCSIS encapsulation type.
*/
FALSE);
proto_tree_add_item (ehdr_tree, hf_docsis_mini_slots, tvb, pos + 4,
1, FALSE);
- if (isfrag)
+ if (isfrag)
{
proto_tree_add_item (ehdr_tree, hf_docsis_frag_rsvd, tvb, pos+5,
1, FALSE);
tvbuff_t *next_tvb, *mgt_tvb;
guint16 pdulen, captured_length, framelen;
gboolean isfrag = FALSE;
-
+
/* Set up structures needed to add the protocol subtree and manage it */
proto_item *ti;
proto_tree *docsis_tree;
}
}
- if ((fctype == FCTYPE_PACKET) && (pdulen == 0))
+ if ((fctype == FCTYPE_PACKET) && (pdulen == 0))
{
if (concatlen > 0)
{
/* Don't do anything for a Request Frame */
break;
case 0x03:
- /* For Fragmentation Frames simply dissect using the data
+ /* For Fragmentation Frames simply dissect using the data
* dissector as we don't handle them yet
*/
mgt_tvb = tvb_new_subset (tvb, hdrlen, captured_length, pdulen);
}
break;
case 0x1c:
- /* call the docsis dissector on the same frame
+ /* call the docsis dissector on the same frame
* to dissect DOCSIS frames within the concatenated
- * frame. concatpos and concatlen are declared
- * static and are decremented and incremented
+ * frame. concatpos and concatlen are declared
+ * static and are decremented and incremented
* respectively when the inner
* docsis frames are dissected. */
while (concatlen > 0)
/* packet-docsis.h
*
- * $Id: packet-docsis.h,v 1.2 2002/08/02 22:04:13 jmayer Exp $
+ * $Id: packet-docsis.h,v 1.3 2002/08/28 20:38:59 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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.
proto_tree_add_item_hidden(map_tree, hf_docsis_map_sid, tvb, pos, 4, FALSE);
proto_tree_add_item_hidden(map_tree, hf_docsis_map_iuc, tvb, pos, 4, FALSE);
proto_tree_add_item_hidden(map_tree, hf_docsis_map_offset, tvb, pos, 4, FALSE);
- if (sid == 0x3FFF)
+ if (sid == 0x3FFF)
proto_tree_add_uint_format (map_tree, hf_docsis_map_ie, tvb, pos, 4,
ie, "SID = 0x%x (All CM's), IUC = %s, Offset = %u",
sid, val_to_str (iuc, iuc_vals, "%s"),
/* This module will dissect the Appendix C TLV's. Please see:
* http://www.cablemodem.com/specifications.html
*
- * The main dissector is dissect_tlv. This routine will dissect
+ * The main dissector is dissect_tlv. This routine will dissect
* top level TLV's and call sub-dissectors for the sub-TLV's.
*/
proto_item *svc_unavail_it;
proto_tree *svc_unavail_tree;
- svc_unavail_it = proto_tree_add_item (tree,
- hf_docsis_tlv_svc_unavail,
+ svc_unavail_it = proto_tree_add_item (tree,
+ hf_docsis_tlv_svc_unavail,
tvb, pos, length, FALSE);
svc_unavail_tree = proto_item_add_subtree(svc_unavail_it, ett_docsis_tlv_svc_unavail );
- proto_tree_add_item (svc_unavail_tree,
+ proto_tree_add_item (svc_unavail_tree,
hf_docsis_tlv_svc_unavail_classid, tvb,
pos, 1, FALSE);
- proto_tree_add_item (svc_unavail_tree,
+ proto_tree_add_item (svc_unavail_tree,
hf_docsis_tlv_svc_unavail_type, tvb,
pos+1, 1, FALSE);
- proto_tree_add_item (svc_unavail_tree,
+ proto_tree_add_item (svc_unavail_tree,
hf_docsis_tlv_svc_unavail_code, tvb,
pos+2, 1, FALSE);
guint8 type, length;
guint16 pos = start;
- snmpv3_it = proto_tree_add_item (tree,
- hf_docsis_tlv_snmpv3_kick,
+ snmpv3_it = proto_tree_add_item (tree,
+ hf_docsis_tlv_snmpv3_kick,
tvb, start, len, FALSE);
snmpv3_tree = proto_item_add_subtree(snmpv3_it, ett_docsis_tlv_snmpv3_kick);
-
+
while (pos < (start + len)) {
type = tvb_get_guint8 (tvb, pos++);
length = tvb_get_guint8 (tvb, pos++);
switch (type) {
case SNMPV3_SEC_NAME:
- proto_tree_add_item (snmpv3_tree,
+ proto_tree_add_item (snmpv3_tree,
hf_docsis_tlv_snmpv3_kick_name, tvb,
pos, length, FALSE);
break;
case SNMPV3_MGR_PUB_NUM:
- proto_tree_add_item (snmpv3_tree,
+ proto_tree_add_item (snmpv3_tree,
hf_docsis_tlv_snmpv3_kick_publicnum, tvb,
pos, length, FALSE);
break;
{
case TLV_DOWN_FREQ:
/* This is ugly. There are multiple type 1 TLV's that may appear
- * in the TLV data, the problem is that they are dependent on
+ * in the TLV data, the problem is that they are dependent on
* message type. */
if (length == 4)
proto_tree_add_item (tlv_tree, hf_docsis_tlv_down_freq, tvb,
length, FALSE);
break;
case TLV_SNMP_WRITE_CTRL:
- proto_tree_add_item (tlv_tree, hf_docsis_tlv_snmp_access, tvb,
+ proto_tree_add_item (tlv_tree, hf_docsis_tlv_snmp_access, tvb,
pos, length, FALSE);
break;
case TLV_SNMP_OBJECT:
- proto_tree_add_item (tlv_tree, hf_docsis_tlv_snmp_obj, tvb,
+ proto_tree_add_item (tlv_tree, hf_docsis_tlv_snmp_obj, tvb,
pos, length, FALSE);
break;
case TLV_MODEM_IP:
}
break;
case TLV_SVC_UNAVAIL:
- if (length == 3)
+ if (length == 3)
{
dissect_svc_unavail(tvb, tlv_tree, pos, length);
}
dissect_phs (tvb, tlv_tree, pos, length);
break;
case TLV_HMAC_DIGEST:
- if (length == 20)
+ if (length == 20)
{
proto_tree_add_item (tlv_tree,
hf_docsis_tlv_hmac_digest, tvb,
tvb, pos, length, FALSE);
break;
case TLV_SUBS_MGMT_CPE:
- if ((length % 4) == 0)
+ if ((length % 4) == 0)
{
proto_tree_add_item (tlv_tree, hf_docsis_tlv_subs_mgmt_ip_table,
tvb, pos, length, FALSE);
- for (x = 0; x < length; x+=4)
+ for (x = 0; x < length; x+=4)
{
- proto_tree_add_item (tlv_tree,
+ proto_tree_add_item (tlv_tree,
hf_docsis_tlv_subs_mgmt_ip_entry,
tvb, pos + x, 4, FALSE);
}
- }
+ }
else
- {
+ {
THROW (ReportedBoundsError);
}
break;
case TLV_SUBS_MGMT_FLTR:
- proto_tree_add_item (tlv_tree,
+ proto_tree_add_item (tlv_tree,
hf_docsis_tlv_subs_mgmt_filter_grps,
tvb, pos, length, FALSE);
break;
#define TLV_VENDOR_SPEC 43
#define TLV_END 255
-/* Define DOCSIS 1.0 Class Of Service Configuration Types
+/* Define DOCSIS 1.0 Class Of Service Configuration Types
* These are subtypes of TLV_COS (4)
*/
#define COS_CLASSID 1
#define SFW_MAX_DOWN_LAT 14
/* Define Service Flow Error sub-subtypes
- * These are subtypes of
+ * These are subtypes of
* SFW_ERRORS ([24/25].5)
*/
#define SFW_ERR_PARAM 1
* By Gerald Combs
* Copyright 1999 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.
/* Struct prototype declaration Start */
-
+
/* Struct prototype declaration End */
-
+
/* Union prototype declaration Start */
-
+
/* Union prototype declaration End */
-
+
/* Initialise the protocol and subtree pointers */
/*
* IDL Operations Start
*/
-
-
+
+
static const char CosEventComm_PushConsumer_push_op[] = "push" ;
static const char CosEventComm_PushConsumer_disconnect_push_consumer_op[] = "disconnect_push_consumer" ;
static const char CosEventComm_PushSupplier_disconnect_push_supplier_op[] = "disconnect_push_supplier" ;
/*
* IDL Operations End
*/
-
+
/* Begin Exception (containing members) String Declare */
-
+
/* End Exception (containing members) String Declare */
/*
* IDL Attributes Start
*/
-
-
+
+
/*
* IDL Attributes End
*/
-
+
/*
* IDL Enums Start
*/
-
-
+
+
/*
* IDL Enums End
*/
-
-
+
+
/* Begin Exception Helper Functions */
-
+
/* End Exception Helper Functions */
* Main delegator for exception handling
*
*/
-
+
static gboolean decode_user_exception(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header _U_, gchar *operation _U_ ) {
-
+
gboolean be _U_; /* big endianess */
-
+
return FALSE; /* user exception not found */
}
-
+
/* Begin Attribute Helper Functions */
-
+
/* End Attribute Helper Functions */
/*
* IDL:omg.org/CosEventComm/PushConsumer/push:1.0
*/
-
+
static void decode_CosEventComm_PushConsumer_push(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
get_CDR_any(tvb,tree,offset,stream_is_big_endian, boundary, header);
-
-
+
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosEventComm/PushConsumer/disconnect_push_consumer:1.0
*/
-
+
static void decode_CosEventComm_PushConsumer_disconnect_push_consumer(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosEventComm/PushSupplier/disconnect_push_supplier:1.0
*/
-
+
static void decode_CosEventComm_PushSupplier_disconnect_push_supplier(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosEventComm/PullSupplier/pull:1.0
*/
-
+
static void decode_CosEventComm_PullSupplier_pull(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
+
get_CDR_any(tvb,tree,offset,stream_is_big_endian, boundary, header);
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosEventComm/PullSupplier/try_pull:1.0
*/
-
+
static void decode_CosEventComm_PullSupplier_try_pull(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint8 u_octet1;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
+
get_CDR_any(tvb,tree,offset,stream_is_big_endian, boundary, header);
-
-
+
+
u_octet1 = get_CDR_boolean(tvb,offset);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-1,1,"has_event = %u",u_octet1);
}
-
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosEventComm/PullSupplier/disconnect_pull_supplier:1.0
*/
-
+
static void decode_CosEventComm_PullSupplier_disconnect_pull_supplier(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosEventComm/PullConsumer/disconnect_pull_consumer:1.0
*/
-
+
static void decode_CosEventComm_PullConsumer_disconnect_pull_consumer(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
static gboolean dissect_coseventcomm(tvbuff_t *tvb, packet_info *pinfo, proto_tree *ptree, int *offset, MessageHeader *header, gchar *operation, gchar *idlname _U_) {
proto_item *ti = NULL;
proto_tree *tree = NULL; /* init later, inside if(tree) */
-
+
gboolean be; /* big endianess */
if (check_col(pinfo->cinfo, COL_PROTOCOL))
col_set_str(pinfo->cinfo, COL_PROTOCOL, "COSEVENTCOMM");
-/*
- * Do not clear COL_INFO, as nothing is being written there by
+/*
+ * Do not clear COL_INFO, as nothing is being written there by
* this dissector yet. So leave it as is from the GIOP dissector.
- * TODO: add something useful to COL_INFO
+ * TODO: add something useful to COL_INFO
* if (check_col(pinfo->cinfo, COL_INFO))
* col_clear(pinfo->cinfo, COL_INFO);
*/
if (ptree) {
ti = proto_tree_add_item(ptree, proto_coseventcomm, tvb, *offset, tvb_length(tvb) - *offset, FALSE);
tree = proto_item_add_subtree(ti, ett_coseventcomm);
- }
+ }
be = is_big_endian(header); /* get endianess - TODO use passed in stream_is_big_endian instead ? */
}
-
+
switch(header->message_type) {
-
+
case Request:
case Reply:
-
-
+
+
if (!strcmp(operation, CosEventComm_PushConsumer_push_op )) {
decode_CosEventComm_PushConsumer_push(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosEventComm_PushConsumer_disconnect_push_consumer_op )) {
decode_CosEventComm_PushConsumer_disconnect_push_consumer(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosEventComm_PushSupplier_disconnect_push_supplier_op )) {
decode_CosEventComm_PushSupplier_disconnect_push_supplier(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosEventComm_PullSupplier_pull_op )) {
decode_CosEventComm_PullSupplier_pull(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosEventComm_PullSupplier_try_pull_op )) {
decode_CosEventComm_PullSupplier_try_pull(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosEventComm_PullSupplier_disconnect_pull_supplier_op )) {
decode_CosEventComm_PullSupplier_disconnect_pull_supplier(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosEventComm_PullConsumer_disconnect_pull_consumer_op )) {
decode_CosEventComm_PullConsumer_disconnect_pull_consumer(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
-
+
+
break;
-
+
case CancelRequest:
case LocateRequest:
case LocateReply:
case MessageError:
case Fragment:
return FALSE; /* not handled yet */
-
+
default:
return FALSE; /* not handled yet */
-
+
} /* switch */
-
-
+
+
return FALSE;
static hf_register_info hf[] = {
/* no fields yet */
-
+
};
#endif
};
/* Register the protocol name and description */
-
+
proto_coseventcomm = proto_register_protocol("Coseventcomm Dissector Using GIOP API" , "COSEVENTCOMM", "giop-coseventcomm" );
#if 0
proto_register_field_array(proto_coseventcomm, hf, array_length(hf));
#endif
proto_register_subtree_array(ett,array_length(ett));
-
+
}
void proto_register_handoff_giop_coseventcomm(void) {
-
+
#if 0
-
+
/* Register for Explicit Dissection */
-
+
register_giop_user_module(dissect_coseventcomm, "COSEVENTCOMM", "CosEventComm/PullConsumer", proto_coseventcomm ); /* explicit dissector */
-
+
#endif
-
-
-
+
+
+
#if 0
-
+
/* Register for Explicit Dissection */
-
+
register_giop_user_module(dissect_coseventcomm, "COSEVENTCOMM", "CosEventComm/PushSupplier", proto_coseventcomm ); /* explicit dissector */
-
+
#endif
-
-
-
+
+
+
#if 0
-
+
/* Register for Explicit Dissection */
-
+
register_giop_user_module(dissect_coseventcomm, "COSEVENTCOMM", "CosEventComm/PushConsumer", proto_coseventcomm ); /* explicit dissector */
-
+
#endif
-
-
-
+
+
+
#if 0
-
+
/* Register for Explicit Dissection */
-
+
register_giop_user_module(dissect_coseventcomm, "COSEVENTCOMM", "CosEventComm/PullSupplier", proto_coseventcomm ); /* explicit dissector */
-
+
#endif
-
-
-
-
+
+
+
+
/* Register for Heuristic Dissection */
-
- register_giop_user(dissect_coseventcomm, "COSEVENTCOMM" ,proto_coseventcomm); /* heuristic dissector */
-
-
+
+ register_giop_user(dissect_coseventcomm, "COSEVENTCOMM" ,proto_coseventcomm); /* heuristic dissector */
+
+
}
* By Gerald Combs
* Copyright 1999 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.
/* Struct prototype declaration Start */
-
-
+
+
/* Struct = IDL:omg.org/CosNaming/NameComponent:1.0 */
static void decode_CosNaming_NameComponent_st(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, int *offset, MessageHeader *header, gchar *operation);
-
+
/* Struct = IDL:omg.org/CosNaming/Binding:1.0 */
static void decode_CosNaming_Binding_st(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree, int *offset, MessageHeader *header, gchar *operation);
/* Struct prototype declaration End */
-
+
/* Union prototype declaration Start */
-
+
/* Union prototype declaration End */
-
+
/* Initialise the protocol and subtree pointers */
/*
* IDL Operations Start
*/
-
-
+
+
static const char CosNaming_NamingContext_bind_op[] = "bind" ;
static const char CosNaming_NamingContext_rebind_op[] = "rebind" ;
static const char CosNaming_NamingContext_bind_context_op[] = "bind_context" ;
/*
* IDL Operations End
*/
-
+
/* Begin Exception (containing members) String Declare */
-static const char user_exception_CosNaming_NamingContext_NotFound[] = "IDL:omg.org/CosNaming/NamingContext/NotFound:1.0" ;
-static const char user_exception_CosNaming_NamingContext_CannotProceed[] = "IDL:omg.org/CosNaming/NamingContext/CannotProceed:1.0" ;
-
+static const char user_exception_CosNaming_NamingContext_NotFound[] = "IDL:omg.org/CosNaming/NamingContext/NotFound:1.0" ;
+static const char user_exception_CosNaming_NamingContext_CannotProceed[] = "IDL:omg.org/CosNaming/NamingContext/CannotProceed:1.0" ;
+
/* End Exception (containing members) String Declare */
/*
* IDL Attributes Start
*/
-
-
+
+
/*
* IDL Attributes End
*/
-
+
/*
* IDL Enums Start
*/
-
-
+
+
/*
* Enum = IDL:omg.org/CosNaming/BindingType:1.0
*/
-
-
+
+
static const value_string CosNaming_BindingType[] = {
- { 0, "nobject" },
- { 1, "ncontext" },
+ { 0, "nobject" },
+ { 1, "ncontext" },
{ 0, NULL },
};
-
+
/*
* Enum = IDL:omg.org/CosNaming/NamingContext/NotFoundReason:1.0
*/
-
-
+
+
static const value_string CosNaming_NamingContext_NotFoundReason[] = {
- { 0, "missing_node" },
- { 1, "not_context" },
- { 2, "not_object" },
+ { 0, "missing_node" },
+ { 1, "not_context" },
+ { 2, "not_object" },
{ 0, NULL },
};
-
+
/*
* IDL Enums End
*/
-
-
+
+
/* Begin Exception Helper Functions */
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4;
guint32 u_octet4_loop_NotFound_rest_of_name;
guint32 i_NotFound_rest_of_name;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header); /* get stream endianess */
-
-
-
+
+
+
u_octet4 = get_CDR_enum(tvb,offset,stream_is_big_endian, boundary);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-4,4,"Enum value = %u (%s)",u_octet4,val_to_str(u_octet4,CosNaming_NamingContext_NotFoundReason,"Unknown Enum Value"));
}
-
+
u_octet4_loop_NotFound_rest_of_name = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of NotFound_rest_of_name = %u",u_octet4_loop_NotFound_rest_of_name);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of NotFound_rest_of_name = %u",u_octet4_loop_NotFound_rest_of_name);
}
-
+
for (i_NotFound_rest_of_name=0; i_NotFound_rest_of_name < u_octet4_loop_NotFound_rest_of_name; i_NotFound_rest_of_name++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
}
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_CannotProceed_rest_of_name;
guint32 i_CannotProceed_rest_of_name;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header); /* get stream endianess */
-
-
+
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
u_octet4_loop_CannotProceed_rest_of_name = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of CannotProceed_rest_of_name = %u",u_octet4_loop_CannotProceed_rest_of_name);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of CannotProceed_rest_of_name = %u",u_octet4_loop_CannotProceed_rest_of_name);
}
-
+
for (i_CannotProceed_rest_of_name=0; i_CannotProceed_rest_of_name < u_octet4_loop_CannotProceed_rest_of_name; i_CannotProceed_rest_of_name++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
}
-
+
/* End Exception Helper Functions */
* Main delegator for exception handling
*
*/
-
+
static gboolean decode_user_exception(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header _U_, gchar *operation _U_ ) {
-
+
gboolean be _U_; /* big endianess */
-
+
if (!strcmp(header->exception_id, user_exception_CosNaming_NamingContext_NotFound )) {
decode_ex_CosNaming_NamingContext_NotFound(tvb, pinfo, tree, offset, header, operation); /* IDL:omg.org/CosNaming/NamingContext/NotFound:1.0 */
return TRUE;
}
-
-
+
+
if (!strcmp(header->exception_id, user_exception_CosNaming_NamingContext_CannotProceed )) {
decode_ex_CosNaming_NamingContext_CannotProceed(tvb, pinfo, tree, offset, header, operation); /* IDL:omg.org/CosNaming/NamingContext/CannotProceed:1.0 */
return TRUE;
}
-
-
+
+
return FALSE; /* user exception not found */
}
-
+
/* Begin Attribute Helper Functions */
-
+
/* End Attribute Helper Functions */
/*
* IDL:omg.org/CosNaming/NamingContext/bind:1.0
*/
-
+
static void decode_CosNaming_NamingContext_bind(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_n;
guint32 i_n;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4_loop_n = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
}
-
+
for (i_n=0; i_n < u_octet4_loop_n; i_n++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/NamingContext/rebind:1.0
*/
-
+
static void decode_CosNaming_NamingContext_rebind(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_n;
guint32 i_n;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4_loop_n = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
}
-
+
for (i_n=0; i_n < u_octet4_loop_n; i_n++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/NamingContext/bind_context:1.0
*/
-
+
static void decode_CosNaming_NamingContext_bind_context(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_n;
guint32 i_n;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4_loop_n = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
}
-
+
for (i_n=0; i_n < u_octet4_loop_n; i_n++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/NamingContext/rebind_context:1.0
*/
-
+
static void decode_CosNaming_NamingContext_rebind_context(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_n;
guint32 i_n;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4_loop_n = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
}
-
+
for (i_n=0; i_n < u_octet4_loop_n; i_n++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
- default:
-
- /* Unknown GIOP Message */
-
- g_warning("Unknown GIOP Message");
-
-
+
break;
-
-
- } /* switch(header->message_type) */
-
-}
+
+ default:
+
+ /* Unknown GIOP Message */
+
+ g_warning("Unknown GIOP Message");
+
+
+ break;
+
+
+ } /* switch(header->message_type) */
+
+}
/*
* IDL:omg.org/CosNaming/NamingContext/resolve:1.0
*/
-
+
static void decode_CosNaming_NamingContext_resolve(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_n;
guint32 i_n;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4_loop_n = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
}
-
+
for (i_n=0; i_n < u_octet4_loop_n; i_n++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/NamingContext/unbind:1.0
*/
-
+
static void decode_CosNaming_NamingContext_unbind(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_n;
guint32 i_n;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4_loop_n = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
}
-
+
for (i_n=0; i_n < u_octet4_loop_n; i_n++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/NamingContext/new_context:1.0
*/
-
+
static void decode_CosNaming_NamingContext_new_context(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/NamingContext/bind_new_context:1.0
*/
-
+
static void decode_CosNaming_NamingContext_bind_new_context(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_n;
guint32 i_n;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4_loop_n = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of n = %u",u_octet4_loop_n);
}
-
+
for (i_n=0; i_n < u_octet4_loop_n; i_n++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/NamingContext/destroy:1.0
*/
-
+
static void decode_CosNaming_NamingContext_destroy(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/NamingContext/list:1.0
*/
-
+
static void decode_CosNaming_NamingContext_list(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4;
guint32 u_octet4_loop_bl;
guint32 i_bl;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4 = get_CDR_ulong(tvb,offset,stream_is_big_endian, boundary);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-4,4,"how_many = %u",u_octet4);
}
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
u_octet4_loop_bl = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of bl = %u",u_octet4_loop_bl);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of bl = %u",u_octet4_loop_bl);
}
-
+
for (i_bl=0; i_bl < u_octet4_loop_bl; i_bl++) {
-
+
/* Begin struct "CosNaming_Binding" */
-
-
-
+
+
+
decode_CosNaming_Binding_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_Binding" */
-
+
}
-
+
get_CDR_object(tvb, pinfo, tree, offset, stream_is_big_endian, boundary);
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/BindingIterator/next_one:1.0
*/
-
+
static void decode_CosNaming_BindingIterator_next_one(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint8 u_octet1;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
+
u_octet1 = get_CDR_boolean(tvb,offset);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-1,1,"Operation_Return_Value = %u",u_octet1);
}
-
+
/* Begin struct "CosNaming_Binding" */
-
-
-
+
+
+
decode_CosNaming_Binding_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_Binding" */
-
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/BindingIterator/next_n:1.0
*/
-
+
static void decode_CosNaming_BindingIterator_next_n(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4;
guint8 u_octet1;
guint32 u_octet4_loop_bl;
guint32 i_bl;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
u_octet4 = get_CDR_ulong(tvb,offset,stream_is_big_endian, boundary);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-4,4,"how_many = %u",u_octet4);
}
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
+
u_octet1 = get_CDR_boolean(tvb,offset);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-1,1,"Operation_Return_Value = %u",u_octet1);
}
-
+
u_octet4_loop_bl = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of bl = %u",u_octet4_loop_bl);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of bl = %u",u_octet4_loop_bl);
}
-
+
for (i_bl=0; i_bl < u_octet4_loop_bl; i_bl++) {
-
+
/* Begin struct "CosNaming_Binding" */
-
-
-
+
+
+
decode_CosNaming_Binding_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_Binding" */
-
+
}
-
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
/*
* IDL:omg.org/CosNaming/BindingIterator/destroy:1.0
*/
-
+
static void decode_CosNaming_BindingIterator_destroy(tvbuff_t *tvb _U_, packet_info *pinfo _U_, proto_tree *tree _U_, int *offset _U_, MessageHeader *header, gchar *operation _U_) {
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
-
+
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header);
-
+
switch(header->message_type) {
-
+
case Request:
-
+
break;
-
+
case Reply:
-
+
switch(header->rep_status) {
-
+
case NO_EXCEPTION:
-
-
+
+
/* Function returns void */
-
-
+
+
break;
-
+
case USER_EXCEPTION:
-
+
break;
-
+
default:
-
+
/* Unknown Exception */
-
+
g_warning("Unknown Exception ");
-
-
-
+
+
+
break;
-
-
+
+
} /* switch(header->message_type) */
-
- break;
-
+
+ break;
+
default:
-
+
/* Unknown GIOP Message */
-
+
g_warning("Unknown GIOP Message");
-
-
+
+
break;
-
-
- } /* switch(header->message_type) */
-
+
+
+ } /* switch(header->message_type) */
+
}
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4;
gchar *seq = NULL;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header); /* get stream endianess */
-
-
+
+
u_octet4 = get_CDR_string(tvb, &seq, offset, stream_is_big_endian, boundary);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-4-u_octet4,4,"length = %u",u_octet4);
if (u_octet4 > 0)
proto_tree_add_text(tree,tvb,*offset-u_octet4,u_octet4,"NameComponent_id = %s",seq);
-
+
}
-
+
g_free(seq); /* free buffer */
seq = NULL;
-
+
u_octet4 = get_CDR_string(tvb, &seq, offset, stream_is_big_endian, boundary);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-4-u_octet4,4,"length = %u",u_octet4);
if (u_octet4 > 0)
proto_tree_add_text(tree,tvb,*offset-u_octet4,u_octet4,"NameComponent_kind = %s",seq);
-
+
}
-
+
g_free(seq); /* free buffer */
seq = NULL;
-
+
}
gboolean stream_is_big_endian; /* big endianess */
-
+
/* Operation specific Variable declarations Begin */
-
+
guint32 u_octet4_loop_Binding_binding_name;
guint32 i_Binding_binding_name;
guint32 u_octet4;
-
+
/* Operation specific Variable declarations End */
-
-
+
+
stream_is_big_endian = is_big_endian(header); /* get stream endianess */
-
-
+
+
u_octet4_loop_Binding_binding_name = get_CDR_ulong(tvb, offset, stream_is_big_endian, boundary);
if (tree) {
- proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of Binding_binding_name = %u",u_octet4_loop_Binding_binding_name);
+ proto_tree_add_text(tree,tvb,*offset-4, 4 ,"Seq length of Binding_binding_name = %u",u_octet4_loop_Binding_binding_name);
}
-
+
for (i_Binding_binding_name=0; i_Binding_binding_name < u_octet4_loop_Binding_binding_name; i_Binding_binding_name++) {
-
+
/* Begin struct "CosNaming_NameComponent" */
-
-
-
+
+
+
decode_CosNaming_NameComponent_st(tvb, pinfo, tree, offset, header, operation);
-
-
+
+
/* End struct "CosNaming_NameComponent" */
-
+
}
-
-
+
+
u_octet4 = get_CDR_enum(tvb,offset,stream_is_big_endian, boundary);
if (tree) {
proto_tree_add_text(tree,tvb,*offset-4,4,"Enum value = %u (%s)",u_octet4,val_to_str(u_octet4,CosNaming_BindingType,"Unknown Enum Value"));
}
-
+
}
static gboolean dissect_cosnaming(tvbuff_t *tvb, packet_info *pinfo, proto_tree *ptree, int *offset, MessageHeader *header, gchar *operation, gchar *idlname _U_) {
proto_item *ti = NULL;
proto_tree *tree = NULL; /* init later, inside if(tree) */
-
+
gboolean be; /* big endianess */
if (check_col(pinfo->cinfo, COL_PROTOCOL))
col_set_str(pinfo->cinfo, COL_PROTOCOL, "COSNAMING");
-/*
- * Do not clear COL_INFO, as nothing is being written there by
+/*
+ * Do not clear COL_INFO, as nothing is being written there by
* this dissector yet. So leave it as is from the GIOP dissector.
- * TODO: add something useful to COL_INFO
+ * TODO: add something useful to COL_INFO
* if (check_col(pinfo->cinfo, COL_INFO))
* col_clear(pinfo->cinfo, COL_INFO);
*/
if (ptree) {
ti = proto_tree_add_item(ptree, proto_cosnaming, tvb, *offset, tvb_length(tvb) - *offset, FALSE);
tree = proto_item_add_subtree(ti, ett_cosnaming);
- }
+ }
be = is_big_endian(header); /* get endianess - TODO use passed in stream_is_big_endian instead ? */
}
-
+
switch(header->message_type) {
-
+
case Request:
case Reply:
-
-
+
+
if (!strcmp(operation, CosNaming_NamingContext_bind_op )) {
decode_CosNaming_NamingContext_bind(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_rebind_op )) {
decode_CosNaming_NamingContext_rebind(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_bind_context_op )) {
decode_CosNaming_NamingContext_bind_context(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_rebind_context_op )) {
decode_CosNaming_NamingContext_rebind_context(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_resolve_op )) {
decode_CosNaming_NamingContext_resolve(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_unbind_op )) {
decode_CosNaming_NamingContext_unbind(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_new_context_op )) {
decode_CosNaming_NamingContext_new_context(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_bind_new_context_op )) {
decode_CosNaming_NamingContext_bind_new_context(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_destroy_op )) {
decode_CosNaming_NamingContext_destroy(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_NamingContext_list_op )) {
decode_CosNaming_NamingContext_list(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_BindingIterator_next_one_op )) {
decode_CosNaming_BindingIterator_next_one(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_BindingIterator_next_n_op )) {
decode_CosNaming_BindingIterator_next_n(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
+
if (!strcmp(operation, CosNaming_BindingIterator_destroy_op )) {
decode_CosNaming_BindingIterator_destroy(tvb, pinfo, tree, offset, header, operation);
return TRUE;
}
-
-
+
+
break;
-
+
case CancelRequest:
case LocateRequest:
case LocateReply:
case MessageError:
case Fragment:
return FALSE; /* not handled yet */
-
+
default:
return FALSE; /* not handled yet */
-
+
} /* switch */
-
-
+
+
return FALSE;
static hf_register_info hf[] = {
/* no fields yet */
-
+
};
#endif
};
/* Register the protocol name and description */
-
+
proto_cosnaming = proto_register_protocol("Cosnaming Dissector Using GIOP API" , "COSNAMING", "giop-cosnaming" );
#if 0
proto_register_field_array(proto_cosnaming, hf, array_length(hf));
#endif
proto_register_subtree_array(ett,array_length(ett));
-
+
}
void proto_register_handoff_giop_cosnaming(void) {
-
+
#if 0
-
+
/* Register for Explicit Dissection */
-
+
register_giop_user_module(dissect_cosnaming, "COSNAMING", "CosNaming/NamingContext", proto_cosnaming ); /* explicit dissector */
-
+
#endif
-
-
-
+
+
+
#if 0
-
+
/* Register for Explicit Dissection */
-
+
register_giop_user_module(dissect_cosnaming, "COSNAMING", "CosNaming/BindingIterator", proto_cosnaming ); /* explicit dissector */
-
+
#endif
-
-
-
-
+
+
+
+
/* Register for Heuristic Dissection */
-
- register_giop_user(dissect_cosnaming, "COSNAMING" ,proto_cosnaming); /* heuristic dissector */
-
-
+
+ register_giop_user(dissect_cosnaming, "COSNAMING" ,proto_cosnaming); /* heuristic dissector */
+
+
}
* By Steve Limkemann <stevelim@dgtech.com>
* Copyright 1998 Steve Limkemann
*
- * $Id: packet-gryphon.c,v 1.34 2002/08/02 22:04:20 jmayer Exp $
+ * $Id: packet-gryphon.c,v 1.35 2002/08/28 20:39:05 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* Copyright 1998
- *
+ *
* 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.
#ifndef G_HAVE_GINT64
#error "Sorry, this won't compile without 64-bit integer support"
-#endif
+#endif
/*
* See
{RESP_NO_SUCH_JOB, "No such job"},
{0, NULL},
};
-
+
static const value_string filter_data_types[] = {
{FILTER_DATA_TYPE_HEADER_FRAME, "frame header"},
{FILTER_DATA_TYPE_HEADER, "data message header"},
proto_tree_add_text (pt, tvb, offset, 4, "Command: %s", cmds[i].strptr);
offset += 4;
msglen -= 4;
-
+
resp = tvb_get_ntohl (tvb, offset);
proto_tree_add_text (pt, tvb, offset, 4, "Status: %s",
val_to_str(resp, responses, "Unknown (0x%08x)"));
cmd_init(tvbuff_t *tvb, int offset, proto_tree *pt)
{
char *ptr;
-
+
if (tvb_get_guint8(tvb, offset) == 0)
ptr = "Always initialize";
else
eventnum(tvbuff_t *tvb, int offset, proto_tree *pt)
{
guint8 event = tvb_get_guint8(tvb, offset);
-
+
if (event)
proto_tree_add_text(pt, tvb, offset, 1, "Event number: %u", event);
else
} ts;
unsigned int timestamp;
unsigned char date[45];
-
+
ts.lng[1] = tvb_get_ntohl(tvb, offset);
ts.lng[0] = tvb_get_ntohl(tvb, offset + 4);
timestamp = ts.lnglng / 100000L;
int flag = tvb_get_ntohl(tvb, offset);
int length, padding;
unsigned char mode[30];
-
+
length = tvb_get_guint8(tvb, offset+4) + tvb_get_guint8(tvb, offset+5)
+ tvb_get_ntohs(tvb, offset+6);
if (flag)
{
int handles = tvb_get_guint8(tvb, offset);
int i, padding;
-
+
proto_tree_add_text(pt, tvb, offset, 1, "Number of filter handles: %d", handles);
for (i = 1; i <= handles; i++){
proto_tree_add_text(pt, tvb, offset+i, 1, "Handle %d: %u", i,
dfiltmode(tvbuff_t *tvb, int offset, proto_tree *pt)
{
unsigned char mode;
-
+
mode = tvb_get_guint8(tvb, offset);
proto_tree_add_text(pt, tvb, offset, 1, "Filter mode: %s",
val_to_str(mode, dmodes, "Unknown (%u)"));
filtmode(tvbuff_t *tvb, int offset, proto_tree *pt)
{
unsigned char mode;
-
+
mode = tvb_get_guint8(tvb, offset);
proto_tree_add_text(pt, tvb, offset, 1, "Filter mode: %s",
val_to_str(mode, dmodes, "Unknown (%u)"));
unsigned int i;
proto_tree *tree;
proto_item *item;
-
+
msglen = tvb_reported_length_remaining(tvb, offset);
i = 1;
while (msglen != 0) {
int size;
int number;
int index;
-
+
proto_tree_add_text(pt, tvb, offset, 4, "Set Speed IOCTL");
proto_tree_add_text(pt, tvb, offset+4, 4, "Get Speed IOCTL");
size = tvb_get_guint8(tvb, offset+8);
cmd_sort(tvbuff_t *tvb, int offset, proto_tree *pt)
{
char *which;
-
+
which = tvb_get_guint8(tvb, offset) ?
"Sort into blocks of up to 16 messages" :
"Do not sort messages";
cmd_optimize(tvbuff_t *tvb, int offset, proto_tree *pt)
{
char *which;
-
- which = tvb_get_guint8(tvb, offset) ?
+
+ which = tvb_get_guint8(tvb, offset) ?
"Optimize for latency (Nagle algorithm disabled)" :
"Optimize for throughput (Nagle algorithm enabled)";
proto_tree_add_text(pt, tvb, offset, 1, "Set optimization: %s", which);
int devices;
int i;
unsigned int x;
-
+
static const value_string protocol_types[] = {
{GDUMMY * 256 + GDGDMARKONE, "Dummy device driver"},
{GCAN * 256 + G82527, "CAN, 82527 subtype"},
int save_offset;
unsigned int i, x, length;
unsigned char def_chan = tvb_get_guint8(tvb, offset-9);
-
+
msglen = tvb_reported_length_remaining(tvb, offset);
x = tvb_get_ntohl(tvb, offset);
if (x == 0xFFFFFFFF)
{
int handles = tvb_get_guint8(tvb, offset);
int i, padding;
-
+
proto_tree_add_text(pt, tvb, offset, 1, "Number of response handles: %d", handles);
for (i = 1; i <= handles; i++){
proto_tree_add_text(pt, tvb, offset+i, 1, "Handle %d: %u", i,
proto_item *item;
proto_tree *tree;
guint8 flags;
-
+
flags = tvb_get_guint8(tvb, offset);
item = proto_tree_add_text(pt, tvb, offset, 1, "Flags: 0x%02x", flags);
tree = proto_item_add_subtree (item, ett_gryphon_flags);
{
int msglen;
unsigned int length;
-
+
msglen = tvb_reported_length_remaining(tvb, offset);
proto_tree_add_text(pt, tvb, offset, 2, "Block number: %u",
tvb_get_ntohs(tvb, offset));
proto_item *item;
proto_tree *tree;
unsigned int i, count;
-
+
count = tvb_get_guint8(tvb, offset);
proto_tree_add_text(pt, tvb, offset, 1, "Number of programs in this response: %u", count);
proto_tree_add_text(pt, tvb, offset+1, 1, "reserved");
{
char string[120];
gint length;
-
+
offset = cmd_delete(tvb, offset, pt);
length = tvb_get_nstringz0(tvb, offset, 120, string) + 1;
proto_tree_add_text(pt, tvb, offset, length, "Arguments: %s", string);
proto_item *item;
proto_tree *tree;
unsigned int i, copies, length;
-
+
copies = tvb_get_guint8(tvb, offset);
item = proto_tree_add_text(pt, tvb, offset, 1, "Number of running copies: %u", copies);
tree = proto_item_add_subtree (item, ett_gryphon_pgm_status);
proto_tree *tree;
unsigned int i, size, padding, option, option_length, option_value;
unsigned char *string, *string1;
-
+
msglen = tvb_reported_length_remaining(tvb, offset);
item = proto_tree_add_text(pt, tvb, offset, 1, "Handle: %u",
tvb_get_guint8(tvb, offset));
{
int msglen;
guchar *which;
-
+
msglen = tvb_reported_length_remaining(tvb, offset);
if (tvb_get_guint8(tvb, offset) == 0)
which = "First group of names";
else
which = "Subsequent group of names";
-
+
proto_tree_add_text(pt, tvb, offset, 1, "%s", which);
proto_tree_add_text(pt, tvb, offset+1, msglen-1, "Directory: %.*s",
msglen-1, tvb_get_ptr(tvb, offset+1, msglen-1));
{
int msglen;
guchar *flag;
-
+
msglen = tvb_reported_length_remaining(tvb, offset);
flag = tvb_get_guint8(tvb, offset) ? "Yes": "No";
proto_tree_add_text(pt, tvb, offset, 1, "More filenames to return: %s", flag);
{
guchar *desc;
guint8 assemble_flag;
-
+
if (tvb_get_guint8(tvb, offset))
desc = "Register with gusdt";
else
desc = "Unregister with gusdt";
proto_tree_add_text(pt, tvb, offset, 1, "%s", desc);
-
+
if (tvb_get_guint8(tvb, offset+1))
desc = "Echo long transmit messages back to the client";
else
desc = "Do not echo long transmit messages back to the client";
proto_tree_add_text(pt, tvb, offset+1, 1, "%s", desc);
-
+
assemble_flag = tvb_get_guint8(tvb, offset+2);
if (assemble_flag == 2)
desc = "Assemble long received messages but do not send them to the client";
else
desc = "Do not assemble long received messages on behalf of the client";
proto_tree_add_text(pt, tvb, offset+2, 1, "%s", desc);
-
+
offset += 4;
return offset;
}
{
unsigned int type, operator;
int length, padding;
-
+
proto_tree_add_text(pt, tvb, offset, 2, "Filter field starts at byte %u",
tvb_get_ntohs(tvb, offset));
length = tvb_get_ntohs(tvb, offset+2);
val_to_str(operator, operators, "Unknown (%u)"));
proto_tree_add_text(pt, tvb, offset+6, 2, "reserved");
offset += 8;
-
+
if (operator == BIT_FIELD_CHECK) {
proto_tree_add_text(pt, tvb, offset, length, "Pattern");
proto_tree_add_text(pt, tvb, offset+length, length, "Mask");
{
char *mode, line[50];
int x, y, seconds;
-
+
x = tvb_get_ntohl(tvb, offset);
y = tvb_get_ntohl(tvb, offset+4);
switch (x) {
/* packet-gryphon.c
* Definitions for Gryphon packet disassembly structures and routines
*
- * $Id: packet-gryphon.h,v 1.6 2002/05/01 06:56:16 guy Exp $
+ * $Id: packet-gryphon.h,v 1.7 2002/08/28 20:39:05 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* By Steve Limkemann <stevelim@dgtech.com>
* Copyright 1998 Steve Limkemann
- *
+ *
* 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.
#define GHONSLEEP 0x11600001
#define GHONSILENCE 0x11600002
-#define GKWPSETPTIMES 0x11700011
-#define GKWPSETWTIMES 0x11700010
-#define GKWPDOWAKEUP 0x11700008
-#define GKWPGETBITTIME 0x11700101
-#define GKWPSETBITTIME 0x11700102
-#define GKWPSETNODEADDR 0x11700104
-#define GKWPGETNODETYPE 0x11700105
-#define GKWPSETNODETYPE 0x11700106
-#define GKWPSETWAKETYPE 0x11700108
-#define GKWPSETTARGADDR 0x1170010a
-#define GKWPSETKEYBYTES 0x1170010c
-#define GKWPSETSTARTREQ 0x1170010e
+#define GKWPSETPTIMES 0x11700011
+#define GKWPSETWTIMES 0x11700010
+#define GKWPDOWAKEUP 0x11700008
+#define GKWPGETBITTIME 0x11700101
+#define GKWPSETBITTIME 0x11700102
+#define GKWPSETNODEADDR 0x11700104
+#define GKWPGETNODETYPE 0x11700105
+#define GKWPSETNODETYPE 0x11700106
+#define GKWPSETWAKETYPE 0x11700108
+#define GKWPSETTARGADDR 0x1170010a
+#define GKWPSETKEYBYTES 0x1170010c
+#define GKWPSETSTARTREQ 0x1170010e
#define GKWPSETSTARTRESP 0x11700110
#define GKWPSETPROTOCOL 0x11700112
#define GKWPGETLASTKEYBYTES 0x11700201
* Routines for mgcp packet disassembly
* RFC 2705
*
- * $Id: packet-mgcp.c,v 1.34 2002/08/02 22:04:22 jmayer Exp $
- *
+ * $Id: packet-mgcp.c,v 1.35 2002/08/28 20:39:07 jmayer Exp $
+ *
* Copyright (c) 2000 by Ed Warnicke <hagbard@physics.rutgers.edu>
*
* Ethereal - Network traffic analyzer
static int hf_mgcp_param_invalid = -1;
static int hf_mgcp_messagecount = -1;
-/*
+/*
* Define the trees for mgcp
* We need one for MGCP itself and one for the MGCP paramters
*/
static int ett_mgcp_param = -1;
-/*
- * Here are the global variables associated with
+/*
+ * Here are the global variables associated with
* the various user definable characteristics of the dissection
*
* MGCP has two kinds of "agents", gateways and callagents. Callagents
* control gateways in a master/slave sort of arrangement. Since gateways
- * and callagents have different well known ports and could both
- * operate under either udp or tcp we have rather a lot of port info to
+ * and callagents have different well known ports and could both
+ * operate under either udp or tcp we have rather a lot of port info to
* specify.
*
* global_mgcp_raw_text determines whether we are going to display
static gboolean global_mgcp_message_count = FALSE;
/*
- * Variables to allow for proper deletion of dissector registration when
- * the user changes port from the gui.
+ * Variables to allow for proper deletion of dissector registration when
+ * the user changes port from the gui.
*/
static int gateway_tcp_port = 0;
static int gateway_udp_port = 0;
} mgcp_type_t;
/* Some basic utility functions that are specific to this dissector */
-static gboolean is_mgcp_verb(tvbuff_t *tvb, gint offset, gint maxlength);
+static gboolean is_mgcp_verb(tvbuff_t *tvb, gint offset, gint maxlength);
static gboolean is_mgcp_rspcode(tvbuff_t *tvb, gint offset, gint maxlength);
-static gint tvb_parse_param(tvbuff_t *tvb, gint offset, gint maxlength,
+static gint tvb_parse_param(tvbuff_t *tvb, gint offset, gint maxlength,
int** hf);
-/*
- * The various functions that either dissect some
- * subpart of MGCP. These aren't really proto dissectors but they
+/*
+ * The various functions that either dissect some
+ * subpart of MGCP. These aren't really proto dissectors but they
* are written in the same style.
- */
-static void dissect_mgcp_message(tvbuff_t *tvb, packet_info *pinfo,
+ */
+static void dissect_mgcp_message(tvbuff_t *tvb, packet_info *pinfo,
proto_tree *tree,proto_tree *mgcp_tree, proto_tree *ti);
-static void dissect_mgcp_firstline(tvbuff_t *tvb,
+static void dissect_mgcp_firstline(tvbuff_t *tvb,
proto_tree *tree);
-static void dissect_mgcp_params(tvbuff_t *tvb,
+static void dissect_mgcp_params(tvbuff_t *tvb,
proto_tree *tree);
static void mgcp_raw_text_add(tvbuff_t *tvb,
proto_tree *tree);
-/*
- * Some functions which should be moved to a library
- * as I think that people may find them of general usefulness.
+/*
+ * Some functions which should be moved to a library
+ * as I think that people may find them of general usefulness.
*/
static gint tvb_skip_wsp(tvbuff_t* tvb, gint offset, gint maxlength);
static gint tvb_find_null_line(tvbuff_t* tvb, gint offset, gint len,
- gint* next_offset);
-static gint tvb_find_dot_line(tvbuff_t* tvb, gint offset,
+ gint* next_offset);
+static gint tvb_find_dot_line(tvbuff_t* tvb, gint offset,
gint len, gint* next_offset);
static gboolean is_rfc2234_alpha(guint8 c);
num_messages = 0;
mgcp_tree = NULL;
ti = NULL;
-
+
/*
* Set the columns now, so that they'll be set correctly if we throw
* an exception. We can set them later as well....
if (check_col(pinfo->cinfo, COL_INFO))
col_clear(pinfo->cinfo, COL_INFO);
- /*
- * Check to see whether we're really dealing with MGCP by looking
+ /*
+ * Check to see whether we're really dealing with MGCP by looking
* for a valid MGCP verb or response code. This isn't infallible,
* but its cheap and its better than nothing.
*/
if(is_mgcp_verb(tvb,0,tvb_len) || is_mgcp_rspcode(tvb,0,tvb_len)){
/* Build the info tree if we've been given a root */
- if (tree || global_mgcp_message_count == TRUE) {
- /*
- * Loop through however many mgcp messages may be stuck in
+ if (tree || global_mgcp_message_count == TRUE) {
+ /*
+ * Loop through however many mgcp messages may be stuck in
* this packet using piggybacking
*/
do{
sectionlen = tvb_find_dot_line(tvb, tvb_sectionbegin, -1,
&tvb_sectionend);
if( sectionlen != -1){
- dissect_mgcp_message(tvb_new_subset(tvb, tvb_sectionbegin,
+ dissect_mgcp_message(tvb_new_subset(tvb, tvb_sectionbegin,
sectionlen, -1),
pinfo, tree, mgcp_tree,ti);
tvb_sectionbegin = tvb_sectionend;
}
} while(tvb_sectionend < tvb_len );
if(mgcp_tree){
- proto_tree_add_uint_hidden(mgcp_tree, hf_mgcp_messagecount, tvb,
- 0 ,0 , num_messages);
+ proto_tree_add_uint_hidden(mgcp_tree, hf_mgcp_messagecount, tvb,
+ 0 ,0 , num_messages);
}
- }
+ }
- /*
- * Add our column information we do this after dissecting SDP
+ /*
+ * Add our column information we do this after dissecting SDP
* in order to prevent the column info changing to reflect the SDP.
*/
tvb_sectionbegin = 0;
col_add_str(pinfo->cinfo, COL_PROTOCOL, "MGCP");
}
}
-
+
if (check_col(pinfo->cinfo, COL_INFO) ){
sectionlen = tvb_find_line_end(tvb, tvb_sectionbegin,-1,
&tvb_sectionend,FALSE);
- col_add_fstr(pinfo->cinfo, COL_INFO, "%s",
+ col_add_fstr(pinfo->cinfo, COL_INFO, "%s",
tvb_format_text(tvb,tvb_sectionbegin,sectionlen));
- }
- }
+ }
+ }
}
-static void
-dissect_mgcp_message(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree,
+static void
+dissect_mgcp_message(tvbuff_t *tvb, packet_info *pinfo, proto_tree *tree,
proto_tree *mgcp_tree, proto_tree *ti){
/* Declare variables */
tvb_len = tvb_length(tvb);
tvb_current_len = tvb_len;
- /*
- * Check to see whether we're really dealing with MGCP by looking
+ /*
+ * Check to see whether we're really dealing with MGCP by looking
* for a valid MGCP verb or response code. This isn't infallible,
* but its cheap and its better than nothing.
*/
if(is_mgcp_verb(tvb,0,tvb_len) || is_mgcp_rspcode(tvb,0,tvb_len)){
-
+
/* Build the info tree if we've been given a root */
- if (tree && mgcp_tree) {
-
+ if (tree && mgcp_tree) {
+
/* dissect first line */
tvb_sectionbegin = 0;
tvb_current_len = tvb_len;
sectionlen = tvb_find_line_end(tvb,0,-1,&tvb_sectionend,FALSE);
if( sectionlen > 0){
dissect_mgcp_firstline(tvb_new_subset(tvb, tvb_sectionbegin,
- sectionlen,-1),
+ sectionlen,-1),
mgcp_tree);
}
tvb_sectionbegin = tvb_sectionend;
if(tvb_sectionbegin < tvb_len){
sectionlen = tvb_find_null_line(tvb, tvb_sectionbegin, -1,
&tvb_sectionend);
- dissect_mgcp_params(tvb_new_subset(tvb, tvb_sectionbegin,
+ dissect_mgcp_params(tvb_new_subset(tvb, tvb_sectionbegin,
sectionlen, -1),
mgcp_tree);
tvb_sectionbegin = tvb_sectionend;
}
-
- /* set the mgcp payload length correctly so we don't include the
+
+ /* set the mgcp payload length correctly so we don't include the
* encapsulated SDP
*/
sectionlen = tvb_sectionend;
}
/* dissect sdp payload */
- if( tvb_sectionend < tvb_len && global_mgcp_dissect_tree == TRUE){
- next_tvb = tvb_new_subset(tvb, tvb_sectionend, -1, -1);
+ if( tvb_sectionend < tvb_len && global_mgcp_dissect_tree == TRUE){
+ next_tvb = tvb_new_subset(tvb, tvb_sectionend, -1, -1);
call_dissector(sdp_handle, next_tvb, pinfo, tree);
}
}
}
-/*
- * Add the raw text of the message to the dissect tree if appropriate
+/*
+ * Add the raw text of the message to the dissect tree if appropriate
* preferences are specified.
*/
do {
tvb_find_line_end(tvb,tvb_linebegin,-1,&tvb_lineend,FALSE);
linelen = tvb_lineend - tvb_linebegin;
- proto_tree_add_text(tree, tvb, tvb_linebegin, linelen,
- "%s", tvb_format_text(tvb,tvb_linebegin,
+ proto_tree_add_text(tree, tvb, tvb_linebegin, linelen,
+ "%s", tvb_format_text(tvb,tvb_linebegin,
linelen));
tvb_linebegin = tvb_lineend;
} while ( tvb_lineend < tvb_len );
/* Register all the bits needed with the filtering engine */
-void
+void
proto_register_mgcp(void)
{
static hf_register_info hf[] = {
{ &hf_mgcp_req,
- { "Request", "mgcp.req", FT_BOOLEAN, BASE_NONE, NULL, 0x0,
+ { "Request", "mgcp.req", FT_BOOLEAN, BASE_NONE, NULL, 0x0,
"True if MGCP request", HFILL }},
{ &hf_mgcp_rsp,
- { "Response", "mgcp.rsp", FT_BOOLEAN, BASE_NONE, NULL, 0x0,
+ { "Response", "mgcp.rsp", FT_BOOLEAN, BASE_NONE, NULL, 0x0,
"TRUE if MGCP response", HFILL }},
{ &hf_mgcp_req_verb,
- { "Verb", "mgcp.req.verb", FT_STRING, BASE_DEC, NULL, 0x0,
+ { "Verb", "mgcp.req.verb", FT_STRING, BASE_DEC, NULL, 0x0,
"Name of the verb", HFILL }},
{ &hf_mgcp_req_endpoint,
{ "Endpoint", "mgcp.req.endpoint", FT_STRING, BASE_DEC, NULL, 0x0,
{ &hf_mgcp_transid,
{ "Transaction ID", "mgcp.transid", FT_STRING, BASE_DEC, NULL, 0x0,
"Transaction ID of this message", HFILL }},
- { &hf_mgcp_version,
+ { &hf_mgcp_version,
{ "Version", "mgcp.version", FT_STRING, BASE_DEC, NULL, 0x0,
"MGCP Version", HFILL }},
- { &hf_mgcp_rsp_rspcode,
+ { &hf_mgcp_rsp_rspcode,
{ "Response Code", "mgcp.rsp.rspcode", FT_STRING, BASE_DEC, NULL, 0x0,
"Response Code", HFILL }},
{ &hf_mgcp_rsp_rspstring,
- { "Response String", "mgcp.rsp.rspstring", FT_STRING, BASE_DEC, NULL,
+ { "Response String", "mgcp.rsp.rspstring", FT_STRING, BASE_DEC, NULL,
0x0, "Response String", HFILL }},
{ &hf_mgcp_param_rspack,
{ "ResponseAck (K)", "mgcp.param.rspack", FT_STRING, BASE_DEC, NULL,
0x0, "Response Ack", HFILL }},
{ &hf_mgcp_param_bearerinfo,
- { "BearerInformation (B)", "mgcp.param.bearerinfo", FT_STRING, BASE_DEC,
+ { "BearerInformation (B)", "mgcp.param.bearerinfo", FT_STRING, BASE_DEC,
NULL, 0x0, "Bearer Information", HFILL }},
{ &hf_mgcp_param_callid,
{ "CallId (C)", "mgcp.param.callid", FT_STRING, BASE_DEC, NULL, 0x0,
"Call Id", HFILL }},
{ &hf_mgcp_param_connectionid,
- {"ConnectionIdentifier (I)", "mgcp.param.connectionid", FT_STRING,
+ {"ConnectionIdentifier (I)", "mgcp.param.connectionid", FT_STRING,
BASE_DEC, NULL, 0x0, "Connection Identifier", HFILL }},
{ &hf_mgcp_param_secondconnectionid,
- { "SecondConnectionID (I2)", "mgcp.param.secondconnectionid", FT_STRING,
+ { "SecondConnectionID (I2)", "mgcp.param.secondconnectionid", FT_STRING,
BASE_DEC, NULL, 0x0, "Second Connection Identifier", HFILL }},
{ &hf_mgcp_param_notifiedentity,
{ "NotifiedEntity (N)", "mgcp.param.notifiedentity", FT_STRING, BASE_DEC,
{ "RequestIdentifier (X)", "mgcp.param.requestid", FT_STRING, BASE_DEC,
NULL, 0x0, "Request Identifier", HFILL }},
{ &hf_mgcp_param_localconnoptions,
- { "LocalConnectionOptions (L)", "mgcp.param.localconnectionoptions",
+ { "LocalConnectionOptions (L)", "mgcp.param.localconnectionoptions",
FT_STRING, BASE_DEC, NULL, 0x0, "Local Connection Options", HFILL }},
{ &hf_mgcp_param_connectionmode,
{ "ConnectionMode (M)", "mgcp.param.connectionmode", FT_STRING, BASE_DEC,
{ &hf_mgcp_param_signalreq,
{ "SignalRequests (S)", "mgcp.param.signalreq", FT_STRING, BASE_DEC,
NULL, 0x0, "Signal Request", HFILL }},
- { &hf_mgcp_param_restartmethod,
+ { &hf_mgcp_param_restartmethod,
{ "RestartMethod (RM)", "mgcp.param.restartmethod", FT_STRING, BASE_DEC,
NULL, 0x0, "Restart Method", HFILL }},
{ &hf_mgcp_param_restartdelay,
{ "RestartDelay (RD)", "mgcp.param.restartdelay", FT_STRING, BASE_DEC,
NULL, 0x0, "Restart Delay", HFILL }},
- { &hf_mgcp_param_digitmap,
+ { &hf_mgcp_param_digitmap,
{ "DigitMap (D)", "mgcp.param.digitmap", FT_STRING, BASE_DEC, NULL, 0x0,
"Digit Map", HFILL }},
- { &hf_mgcp_param_observedevent,
- { "ObservedEvents (O)", "mgcp.param.observedevents", FT_STRING,
+ { &hf_mgcp_param_observedevent,
+ { "ObservedEvents (O)", "mgcp.param.observedevents", FT_STRING,
BASE_DEC, NULL, 0x0, "Observed Events", HFILL }},
{ &hf_mgcp_param_connectionparam,
- { "ConnectionParameters (P)", "mgcp.param.connectionparam", FT_STRING,
+ { "ConnectionParameters (P)", "mgcp.param.connectionparam", FT_STRING,
BASE_DEC, NULL, 0x0, "Connection Parameters", HFILL }},
{ &hf_mgcp_param_reasoncode,
{ "ReasonCode (E)", "mgcp.param.reasoncode", FT_STRING, BASE_DEC,
{ "SecondEndpointID (Z2)", "mgcp.param.secondendpointid", FT_STRING,
BASE_DEC, NULL, 0x0, "Second Endpoing ID", HFILL }},
{ &hf_mgcp_param_reqinfo,
- { "RequestedInfo (F)", "mgcp.param.reqinfo", FT_STRING, BASE_DEC,
+ { "RequestedInfo (F)", "mgcp.param.reqinfo", FT_STRING, BASE_DEC,
NULL, 0x0,"Requested Info", HFILL }},
- { &hf_mgcp_param_quarantinehandling,
+ { &hf_mgcp_param_quarantinehandling,
{ "QuarantineHandling (Q)", "mgcp.param.quarantinehandling", FT_STRING,
BASE_DEC, NULL, 0x0, "Quarantine Handling", HFILL }},
{ &hf_mgcp_param_detectedevents,
{ "Capabilities (A)", "mgcp.param.capabilities", FT_STRING, BASE_DEC,
NULL, 0x0, "Capabilities", HFILL }},
{ &hf_mgcp_param_extention,
- { "Extention Parameter (X-*)", "mgcp.param.extention", FT_STRING,
+ { "Extention Parameter (X-*)", "mgcp.param.extention", FT_STRING,
BASE_DEC, NULL, 0x0, "Extension Parameter", HFILL }},
{ &hf_mgcp_param_invalid,
- { "Invalid Parameter", "mgcp.param.invalid", FT_STRING,
+ { "Invalid Parameter", "mgcp.param.invalid", FT_STRING,
BASE_DEC, NULL, 0x0, "Invalid Parameter", HFILL }},
- { &hf_mgcp_messagecount,
- { "MGCP Message Count", "mgcp.messagecount", FT_UINT32,
+ { &hf_mgcp_messagecount,
+ { "MGCP Message Count", "mgcp.messagecount", FT_UINT32,
BASE_DEC, NULL, 0x0, "Number of MGCP message in a packet", HFILL }},
/* Add more fields here */
};
&ett_mgcp,
&ett_mgcp_param,
};
- module_t *mgcp_module;
+ module_t *mgcp_module;
proto_mgcp = proto_register_protocol("Media Gateway Control Protocol",
"MGCP", "mgcp");
mgcp_module = prefs_register_protocol(proto_mgcp, proto_reg_handoff_mgcp);
- prefs_register_uint_preference(mgcp_module, "tcp.gateway_port",
+ prefs_register_uint_preference(mgcp_module, "tcp.gateway_port",
"MGCP Gateway TCP Port",
"Set the UDP port for gateway messages "
"(if other than the default of 2427)",
10, &global_mgcp_gateway_tcp_port);
- prefs_register_uint_preference(mgcp_module, "udp.gateway_port",
+ prefs_register_uint_preference(mgcp_module, "udp.gateway_port",
"MGCP Gateway UDP Port",
"Set the TCP port for gateway messages "
"(if other than the default of 2427)",
10, &global_mgcp_gateway_udp_port);
- prefs_register_uint_preference(mgcp_module, "tcp.callagent_port",
+ prefs_register_uint_preference(mgcp_module, "tcp.callagent_port",
"MGCP Callagent TCP Port",
"Set the TCP port for callagent messages "
"(if other than the default of 2727)",
10, &global_mgcp_callagent_tcp_port);
- prefs_register_uint_preference(mgcp_module, "udp.callagent_port",
+ prefs_register_uint_preference(mgcp_module, "udp.callagent_port",
"MGCP Callagent UDP Port",
"Set the UDP port for callagent messages "
"(if other than the default of 2727)",
10, &global_mgcp_callagent_udp_port);
- prefs_register_bool_preference(mgcp_module, "display_raw_text",
- "Display raw text for MGCP message",
+ prefs_register_bool_preference(mgcp_module, "display_raw_text",
+ "Display raw text for MGCP message",
"Specifies that the raw text of the "
"MGCP message should be displayed "
"instead of (or in addition to) the "
"dissection tree",
&global_mgcp_raw_text);
- prefs_register_bool_preference(mgcp_module, "display_dissect_tree",
- "Display tree dissection for MGCP message",
+ prefs_register_bool_preference(mgcp_module, "display_dissect_tree",
+ "Display tree dissection for MGCP message",
"Specifies that the dissection tree of the "
"MGCP message should be displayed "
"instead of (or in addition to) the "
"raw text",
&global_mgcp_dissect_tree);
- prefs_register_bool_preference(mgcp_module, "display_mgcp_message_count",
- "Display the number of MGCP messages",
+ prefs_register_bool_preference(mgcp_module, "display_mgcp_message_count",
+ "Display the number of MGCP messages",
"Display the number of MGCP messages "
"found in a packet in the protocol column.",
&global_mgcp_message_count);
}
-/*
- * is_mgcp_verb - A function for determining whether there is a
+/*
+ * is_mgcp_verb - A function for determining whether there is a
* MGCP verb at offset in tvb
*
* Parameter:
* tvb - The tvbuff in which we are looking for an MGCP verb
* offset - The offset in tvb at which we are looking for a MGCP verb
- * maxlength - The maximum distance from offset we may look for the
- * characters that make up a MGCP verb.
+ * maxlength - The maximum distance from offset we may look for the
+ * characters that make up a MGCP verb.
*
* Return: TRUE if there is an MGCP verb at offset in tvb, otherwise FALSE
*/
returnvalue = TRUE;
}
}
- if( returnvalue && maxlength >= 5 &&
+ if( returnvalue && maxlength >= 5 &&
(word[0] = tvb_get_guint8(tvb,4)) != ' ' && word[0] != '\t'){
returnvalue = FALSE;
}
}
/*
- * is_mgcp_rspcode - A function for determining whether something which
- * looks roughly like a MGCP response code is at
+ * is_mgcp_rspcode - A function for determining whether something which
+ * looks roughly like a MGCP response code is at
* offset in tvb
*
* Parameters:
* tvb - The tvbuff in which we are looking for an MGCP response code
* offset - The offset in tvb at which we are looking for a MGCP response code
- * maxlength - The maximum distance from offset we may look for the
- * characters that make up a MGCP response code.
+ * maxlength - The maximum distance from offset we may look for the
+ * characters that make up a MGCP response code.
*
- * Return: TRUE if there is an MGCP response code at offset in tvb,
+ * Return: TRUE if there is an MGCP response code at offset in tvb,
* otherwise FALSE
*/
static gboolean is_mgcp_rspcode(tvbuff_t *tvb, gint offset, gint maxlength){
int returnvalue = FALSE;
guint8 word[4];
- if(maxlength >= 3){
+ if(maxlength >= 3){
tvb_get_nstringz0(tvb,offset,3,word);
if( isdigit(word[0]) &&
isdigit(word[1]) &&
- isdigit(word[2])){
+ isdigit(word[2])){
returnvalue = TRUE;
}
}
- if( returnvalue && maxlength >= 4 &&
+ if( returnvalue && maxlength >= 4 &&
(word[0] = tvb_get_guint8(tvb,3)) != ' ' && word[0] != '\t'){
returnvalue = FALSE;
}
}
/*
- * is_rfc2234_alpha - Indicates whether the character c is an alphabetical
- * character. This function is used instead of
+ * is_rfc2234_alpha - Indicates whether the character c is an alphabetical
+ * character. This function is used instead of
* isalpha because isalpha may deviate from the rfc2234
* definition of ALPHA in some locales.
- *
+ *
* Parameter:
* c - The character being checked for being an alphabetical character.
*
}
return returnvalue;
}
-
+
/*
* tvb_parse_param - Parse the MGCP param into a type and a value.
*
* Parameters:
* tvb - The tvbuff containing the MGCP param we are to parse.
- * offset - The offset in tvb at which we will begin looking for a
+ * offset - The offset in tvb at which we will begin looking for a
* MGCP parameter to parse.
* len - The maximum distance from offset in tvb that we can look for
* an MGCP parameter to parse.
- * hf - The place to write a pointer to the integer representing the
+ * hf - The place to write a pointer to the integer representing the
* header field associated with the MGCP parameter parsed.
*
- * Returns: The offset in tvb where the value of the MGCP parameter
+ * Returns: The offset in tvb where the value of the MGCP parameter
* begins.
*/
static gint tvb_parse_param(tvbuff_t* tvb, gint offset, gint len, int** hf){
break;
case 'I':
tvb_current_offset++;
- if(len > (tvb_current_offset - offset) &&
- (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
+ if(len > (tvb_current_offset - offset) &&
+ (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
*hf = &hf_mgcp_param_connectionid;
tvb_current_offset--;
}
break;
case 'X':
tvb_current_offset++;
- if(len > (tvb_current_offset - offset) &&
+ if(len > (tvb_current_offset - offset) &&
(tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
*hf = &hf_mgcp_param_requestid;
}
else if(len > (tvb_current_offset - offset) && (
- (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == '-' ||
+ (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == '-' ||
tempchar == '+')){
tvb_current_offset++;
for(counter = 1;(counter <= 6) && (len > (counter + tvb_current_offset
- offset))
- && ( is_rfc2234_alpha(tempchar =
+ && ( is_rfc2234_alpha(tempchar =
tvb_get_guint8(tvb,
tvb_current_offset+counter))
|| isdigit(tempchar));counter++);
tvb_current_offset += counter;
*hf = &hf_mgcp_param_extention;
}
- }
+ }
tvb_current_offset--;
break;
case 'L':
break;
case 'R':
tvb_current_offset++;
- if(len > (tvb_current_offset - offset) &&
- (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
+ if(len > (tvb_current_offset - offset) &&
+ (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
*hf = &hf_mgcp_param_reqevents;
tvb_current_offset--;
}
break;
case 'E':
tvb_current_offset++;
- if(len > (tvb_current_offset - offset) &&
- (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
+ if(len > (tvb_current_offset - offset) &&
+ (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
*hf = &hf_mgcp_param_reasoncode;
tvb_current_offset--;
}
break;
case 'Z':
tvb_current_offset++;
- if(len > (tvb_current_offset - offset) &&
- (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
+ if(len > (tvb_current_offset - offset) &&
+ (tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
*hf = &hf_mgcp_param_specificendpoint;
tvb_current_offset--;
}
*hf = &hf_mgcp_param_invalid;
break;
}
-
+
tvb_current_offset++;
- if(*hf != NULL && len > (tvb_current_offset - offset) &&
+ if(*hf != NULL && len > (tvb_current_offset - offset) &&
(tempchar = tvb_get_guint8(tvb,tvb_current_offset)) == ':'){
tvb_current_offset++;
tvb_current_offset = tvb_skip_wsp(tvb,tvb_current_offset,
}
-/*
+/*
* dissect_mgcp_firstline - Dissects the firstline of an MGCP message.
- * Adds the appropriate headers fields to
- * tree for the dissection of the first line
+ * Adds the appropriate headers fields to
+ * tree for the dissection of the first line
* of an MGCP message.
- *
+ *
* Parameters:
- * tvb - The tvb containing the first line of an MGCP message. This
- * tvb is presumed to ONLY contain the first line of the MGCP
+ * tvb - The tvb containing the first line of an MGCP message. This
+ * tvb is presumed to ONLY contain the first line of the MGCP
* message.
- * pinfo - The packet info for the packet. This is not really used
- * by this function but is passed through so as to retain the
+ * pinfo - The packet info for the packet. This is not really used
+ * by this function but is passed through so as to retain the
* style of a dissector.
- * tree - The tree from which to hang the structured information parsed
+ * tree - The tree from which to hang the structured information parsed
* from the first line of the MGCP message.
*/
-static void dissect_mgcp_firstline(tvbuff_t *tvb,
+static void dissect_mgcp_firstline(tvbuff_t *tvb,
proto_tree *tree){
gint tvb_current_offset,tvb_previous_offset,tvb_len,tvb_current_len;
gint tokennum, tokenlen;
if(tvb_current_offset == -1){
tvb_current_offset = tvb_len;
tokenlen = tvb_current_len;
- }
+ }
else{
tokenlen = tvb_current_offset - tvb_previous_offset;
}
if(tokennum == 0){
if(is_mgcp_verb(tvb,tvb_previous_offset,tvb_current_len)){
mgcp_type = MGCP_REQUEST;
- my_proto_tree_add_string(tree,hf_mgcp_req_verb, tvb,
- tvb_previous_offset, tokenlen,
+ my_proto_tree_add_string(tree,hf_mgcp_req_verb, tvb,
+ tvb_previous_offset, tokenlen,
tvb_format_text(tvb,tvb_previous_offset
,tokenlen));
}
}
if(tokennum == 1){
my_proto_tree_add_string(tree,hf_mgcp_transid, tvb,
- tvb_previous_offset, tokenlen,
+ tvb_previous_offset, tokenlen,
tvb_format_text(tvb,tvb_previous_offset,
tokenlen));
}
}
else if(mgcp_type == MGCP_RESPONSE){
if(tvb_current_offset < tvb_len){
- tokenlen = tvb_find_line_end(tvb, tvb_previous_offset,
+ tokenlen = tvb_find_line_end(tvb, tvb_previous_offset,
-1,&tvb_current_offset,FALSE);
}
else{
}
if( (tokennum == 3 && mgcp_type == MGCP_REQUEST) ){
if(tvb_current_offset < tvb_len ){
- tokenlen = tvb_find_line_end(tvb, tvb_previous_offset,
+ tokenlen = tvb_find_line_end(tvb, tvb_previous_offset,
-1,&tvb_current_offset,FALSE);
}
else{
tvb_current_len);
}
tokennum++;
- } while( tvb_current_offset < tvb_len && tvb_previous_offset < tvb_len
+ } while( tvb_current_offset < tvb_len && tvb_previous_offset < tvb_len
&& tokennum <= 3);
switch (mgcp_type){
case MGCP_RESPONSE:
}
}
-/*
+/*
* dissect_mgcp_params - Dissects the parameters of an MGCP message.
- * Adds the appropriate headers fields to
- * tree for the dissection of the parameters
+ * Adds the appropriate headers fields to
+ * tree for the dissection of the parameters
* of an MGCP message.
- *
+ *
* Parameters:
- * tvb - The tvb containing the parameters of an MGCP message. This
- * tvb is presumed to ONLY contain the part of the MGCP
+ * tvb - The tvb containing the parameters of an MGCP message. This
+ * tvb is presumed to ONLY contain the part of the MGCP
* message which contains the MGCP parameters.
- * pinfo - The packet info for the packet. This is not really used
- * by this function but is passed through so as to retain the
+ * pinfo - The packet info for the packet. This is not really used
+ * by this function but is passed through so as to retain the
* style of a dissector.
- * tree - The tree from which to hang the structured information parsed
+ * tree - The tree from which to hang the structured information parsed
* from the parameters of the MGCP message.
*/
static void dissect_mgcp_params(tvbuff_t *tvb, proto_tree *tree){
if(tree){
if(global_mgcp_dissect_tree){
my_proto_tree_add_string = proto_tree_add_string;
- mgcp_param_ti = proto_tree_add_item(tree, proto_mgcp, tvb,
+ mgcp_param_ti = proto_tree_add_item(tree, proto_mgcp, tvb,
tvb_linebegin, tvb_len, FALSE);
proto_item_set_text(mgcp_param_ti, "Parameters");
mgcp_param_tree = proto_item_add_subtree(mgcp_param_ti, ett_mgcp_param);
/* Parse the parameters */
while(tvb_lineend < tvb_len){
linelen = tvb_find_line_end(tvb, tvb_linebegin, -1,&tvb_lineend,FALSE);
- tvb_tokenbegin = tvb_parse_param(tvb, tvb_linebegin, linelen,
+ tvb_tokenbegin = tvb_parse_param(tvb, tvb_linebegin, linelen,
&my_param);
if( my_param != NULL ){
tokenlen = tvb_find_line_end(tvb,tvb_tokenbegin,-1,&tvb_lineend,FALSE);
my_proto_tree_add_string(mgcp_param_tree,*my_param, tvb,
- tvb_linebegin, linelen,
+ tvb_linebegin, linelen,
tvb_format_text(tvb,tvb_tokenbegin,
tokenlen));
}
tvb_linebegin = tvb_lineend;
- }
+ }
}
-}
-
+}
+
/*
- * tvb_skip_wsp - Returns the position in tvb of the first non-whitespace
+ * tvb_skip_wsp - Returns the position in tvb of the first non-whitespace
* character following offset or offset + maxlength -1 whichever
* is smaller.
*
- * Parameters:
+ * Parameters:
* tvb - The tvbuff in which we are skipping whitespace.
* offset - The offset in tvb from which we begin trying to skip whitespace.
- * maxlength - The maximum distance from offset that we may try to skip
+ * maxlength - The maximum distance from offset that we may try to skip
* whitespace.
*
- * Returns: The position in tvb of the first non-whitespace
+ * Returns: The position in tvb of the first non-whitespace
* character following offset or offset + maxlength -1 whichever
* is smaller.
*/
if(end >= tvb_len){
end = tvb_len;
}
- for(counter = offset; counter < end &&
- ((tempchar = tvb_get_guint8(tvb,counter)) == ' ' ||
+ for(counter = offset; counter < end &&
+ ((tempchar = tvb_get_guint8(tvb,counter)) == ' ' ||
tempchar == '\t');counter++);
return (counter);
}
/*
* tvb_find_null_line - Returns the length from offset to the first null
- * line found (a null line is a line that begins
+ * line found (a null line is a line that begins
* with a CR or LF. The offset to the first character
* after the null line is written into the gint pointed
* to by next_offset.
*
- * Parameters:
+ * Parameters:
* tvb - The tvbuff in which we are looking for a null line.
- * offset - The offset in tvb at which we will begin looking for
+ * offset - The offset in tvb at which we will begin looking for
* a null line.
- * len - The maximum distance from offset in tvb that we will look for
+ * len - The maximum distance from offset in tvb that we will look for
* a null line. If it is -1 we will look to the end of the buffer.
*
- * next_offset - The location to write the offset of first character
- * FOLLOWING the null line.
+ * next_offset - The location to write the offset of first character
+ * FOLLOWING the null line.
*
- * Returns: The length from offset to the first character BEFORE
+ * Returns: The length from offset to the first character BEFORE
* the null line..
*/
-static gint tvb_find_null_line(tvbuff_t* tvb, gint offset,
+static gint tvb_find_null_line(tvbuff_t* tvb, gint offset,
gint len, gint* next_offset){
gint tvb_lineend,tvb_current_len,tvb_linebegin,maxoffset;
guint tempchar;
tvb_linebegin = offset;
tvb_lineend = tvb_linebegin;
- /* Simple setup to allow for the traditional -1 search to the end
- * of the tvbuff
+ /* Simple setup to allow for the traditional -1 search to the end
+ * of the tvbuff
*/
if(len != -1){
tvb_current_len = len;
- }
+ }
else{
tvb_current_len = tvb_length_remaining(tvb,offset);
}
tvb_current_len = tvb_length_remaining(tvb,tvb_linebegin);
tvb_find_line_end(tvb, tvb_linebegin, tvb_current_len, &tvb_lineend,FALSE);
tempchar = tvb_get_guint8(tvb,tvb_linebegin);
- }
+ }
while( tempchar != '\r' && tempchar != '\n' &&
tvb_lineend <= maxoffset);
}
/*
- * tvb_find_dot_line - Returns the length from offset to the first line
- * containing only a dot (.) character. A line
- * containing only a dot is used to indicate a
- * separation between multiple MGCP messages
+ * tvb_find_dot_line - Returns the length from offset to the first line
+ * containing only a dot (.) character. A line
+ * containing only a dot is used to indicate a
+ * separation between multiple MGCP messages
* piggybacked in the same UDP packet.
*
- * Parameters:
+ * Parameters:
* tvb - The tvbuff in which we are looking for a dot line.
- * offset - The offset in tvb at which we will begin looking for
+ * offset - The offset in tvb at which we will begin looking for
* a dot line.
- * len - The maximum distance from offset in tvb that we will look for
+ * len - The maximum distance from offset in tvb that we will look for
* a dot line. If it is -1 we will look to the end of the buffer.
*
- * next_offset - The location to write the offset of first character
- * FOLLOWING the dot line.
+ * next_offset - The location to write the offset of first character
+ * FOLLOWING the dot line.
*
- * Returns: The length from offset to the first character BEFORE
- * the dot line or -1 if the character at offset is a .
+ * Returns: The length from offset to the first character BEFORE
+ * the dot line or -1 if the character at offset is a .
* followed by a newline or a carriage return.
*/
-static gint tvb_find_dot_line(tvbuff_t* tvb, gint offset,
+static gint tvb_find_dot_line(tvbuff_t* tvb, gint offset,
gint len, gint* next_offset){
gint tvb_current_offset, tvb_current_len, maxoffset,tvb_len;
guint8 tempchar;
if(len == -1){
maxoffset = ( tvb_len - 1 );
}
- else {
+ else {
maxoffset = (len - 1 ) + offset;
}
tvb_current_offset = offset -1;
tvb_current_offset = tvb_find_guint8(tvb, tvb_current_offset+1,
tvb_current_len, '.');
tvb_current_len = maxoffset - tvb_current_offset + 1;
- /*
+ /*
* if we didn't find a . then break out of the loop
*/
if(tvb_current_offset == -1){
break;
}
/* do we have and characters following the . ? */
- if( tvb_current_offset < maxoffset ) {
+ if( tvb_current_offset < maxoffset ) {
tempchar = tvb_get_guint8(tvb,tvb_current_offset+1);
- /*
- * are the characters that follow the dot a newline or carriage return ?
+ /*
+ * are the characters that follow the dot a newline or carriage return ?
*/
if(tempchar == '\r' || tempchar == '\n'){
/*
else {
tempchar = tvb_get_guint8(tvb,tvb_current_offset-1);
/*
- * are the characters that follow the dot a newline or a carriage
+ * are the characters that follow the dot a newline or a carriage
* return ?
*/
if(tempchar == '\r' || tempchar == '\n'){
break;
}
}
- }
+ }
} while (tvb_current_offset < maxoffset);
- /*
- * so now we either have the tvb_current_offset of a . in a dot line
+ /*
+ * so now we either have the tvb_current_offset of a . in a dot line
* or a tvb_current_offset of -1
*/
if(tvb_current_offset == -1){
if( tvb_current_offset == offset ){
tvb_current_len = -1;
- }
+ }
else {
tvb_current_len = tvb_current_offset - offset;
}
- return tvb_current_len;
+ return tvb_current_len;
}
/* Start the functions we need for the plugin stuff */
/* plugin_api.c
* Routines for Ethereal plugins.
*
- * $Id: plugin_api.c,v 1.41 2002/08/14 19:18:20 guy Exp $
+ * $Id: plugin_api.c,v 1.42 2002/08/28 20:38:57 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* Copyright 2000 by Gilbert Ramirez <gram@alumni.rice.edu>
- *
+ *
* 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.
p_register_giop_user = pat->p_register_giop_user;
p_is_big_endian = pat->p_is_big_endian;
p_get_CDR_encap_info = pat->p_get_CDR_encap_info;
-
+
p_get_CDR_any = pat->p_get_CDR_any;
p_get_CDR_boolean = pat->p_get_CDR_boolean;
p_get_CDR_char = pat->p_get_CDR_char;
p_decode_enumerated_bitfield = pat->p_decode_enumerated_bitfield;
p_register_dissector_table = pat->p_register_dissector_table;
p_except_throw = pat->p_except_throw;
- p_dissector_try_port = pat->p_dissector_try_port;
+ p_dissector_try_port = pat->p_dissector_try_port;
- p_conversation_add_proto_data = pat->p_conversation_add_proto_data;
- p_conversation_get_proto_data = pat->p_conversation_get_proto_data;
- p_conversation_delete_proto_data = pat->p_conversation_delete_proto_data;
- p_p_add_proto_data = pat->p_p_add_proto_data;
- p_p_get_proto_data = pat->p_p_get_proto_data;
+ p_conversation_add_proto_data = pat->p_conversation_add_proto_data;
+ p_conversation_get_proto_data = pat->p_conversation_get_proto_data;
+ p_conversation_delete_proto_data = pat->p_conversation_delete_proto_data;
+ p_p_add_proto_data = pat->p_p_add_proto_data;
+ p_p_get_proto_data = pat->p_p_get_proto_data;
}
/* plugin_api.h
* Routines for Ethereal plugins.
*
- * $Id: plugin_api.h,v 1.42 2002/08/14 19:18:20 guy Exp $
+ * $Id: plugin_api.h,v 1.43 2002/08/28 20:38:57 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* Copyright 2000 by Gilbert Ramirez <gram@alumni.rice.edu>
- *
+ *
* 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.
* Declarations of a list of "p_" names; included in various places
* to declare them as variables or as function members.
*
- * $Id: plugin_api_decls.h,v 1.4 2002/08/14 19:18:20 guy Exp $
+ * $Id: plugin_api_decls.h,v 1.5 2002/08/28 20:38:57 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* Copyright 2000 by Gilbert Ramirez <gram@alumni.rice.edu>
- *
+ *
* 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.
/* plugin_api_defs.h
* Define the variables that hold pointers to plugin API functions
*
- * $Id: plugin_api_defs.h,v 1.14 2002/05/05 00:16:36 guy Exp $
+ * $Id: plugin_api_defs.h,v 1.15 2002/08/28 20:38:58 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* Copyright 2000 by Gilbert Ramirez <gram@alumni.rice.edu>
- *
+ *
* 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.
/* plugin_table.h
* Table of exported addresses for Ethereal plugins.
*
- * $Id: plugin_table.h,v 1.52 2002/08/14 19:18:20 guy Exp $
+ * $Id: plugin_table.h,v 1.53 2002/08/28 20:38:58 jmayer Exp $
*
* Ethereal - Network traffic analyzer
* Copyright 2000 by Gilbert Ramirez <gram@alumni.rice.edu>
- *
+ *
* 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.
typedef gchar* (*addr_match_strval)(guint32, const value_string*);
typedef gchar* (*addr_val_to_str)(guint32, const value_string *, const char *);
-typedef conversation_t *(*addr_conversation_new)(address *, address *,
+typedef conversation_t *(*addr_conversation_new)(address *, address *,
port_type, guint32, guint32, guint);
-typedef conversation_t *(*addr_find_conversation)(address *, address *,
+typedef conversation_t *(*addr_find_conversation)(address *, address *,
port_type, guint32, guint32, guint);
typedef void (*addr_conversation_set_dissector)(conversation_t *,
dissector_handle_t);
git.samba.org / metze / wireshark / wip.git / commitdiff