702 lines
19 KiB
C
702 lines
19 KiB
C
/* conversation.c
|
|
* Routines for building lists of packets that are part of a "conversation"
|
|
*
|
|
* $Id: conversation.c,v 1.10 2001/06/10 09:50:20 guy 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.
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
# include "config.h"
|
|
#endif
|
|
|
|
#include <stdio.h>
|
|
|
|
#ifdef HAVE_SYS_TYPES_H
|
|
# include <sys/types.h>
|
|
#endif
|
|
|
|
#ifdef HAVE_NETINET_IN_H
|
|
# include <netinet/in.h>
|
|
#endif
|
|
|
|
#include <string.h>
|
|
#include <glib.h>
|
|
#include "packet.h"
|
|
#include "conversation.h"
|
|
|
|
/*
|
|
* Hash table for conversations with no wildcards.
|
|
*/
|
|
static GHashTable *conversation_hashtable_exact = NULL;
|
|
|
|
/*
|
|
* Hash table for conversations with one wildcard address.
|
|
*/
|
|
static GHashTable *conversation_hashtable_no_addr2 = NULL;
|
|
|
|
/*
|
|
* Hash table for conversations with one wildcard port.
|
|
*/
|
|
static GHashTable *conversation_hashtable_no_port2 = NULL;
|
|
|
|
/*
|
|
* Hash table for conversations with one wildcard address and port.
|
|
*/
|
|
static GHashTable *conversation_hashtable_no_addr2_or_port2 = NULL;
|
|
|
|
static GMemChunk *conversation_key_chunk = NULL;
|
|
static GMemChunk *conversation_chunk = NULL;
|
|
|
|
#ifdef __NOT_USED__
|
|
typedef struct conversation_key {
|
|
struct conversation_key *next;
|
|
address addr1;
|
|
address addr2;
|
|
port_type ptype;
|
|
guint32 port1;
|
|
guint32 port2;
|
|
} conversation_key;
|
|
#endif
|
|
/*
|
|
* Linked list of conversation keys, so we can, before freeing them all,
|
|
* free the address data allocations associated with them.
|
|
*/
|
|
static conversation_key *conversation_keys;
|
|
|
|
static guint32 new_index;
|
|
|
|
static int conversation_init_count = 200;
|
|
|
|
/*
|
|
* Compute the hash value for two given address/port pairs if the match
|
|
* is to be exact.
|
|
*/
|
|
static guint
|
|
conversation_hash_exact(gconstpointer v)
|
|
{
|
|
conversation_key *key = (conversation_key *)v;
|
|
guint hash_val;
|
|
int i;
|
|
|
|
hash_val = 0;
|
|
for (i = 0; i < key->addr1.len; i++)
|
|
hash_val += key->addr1.data[i];
|
|
|
|
hash_val += key->port1;
|
|
|
|
for (i = 0; i < key->addr2.len; i++)
|
|
hash_val += key->addr2.data[i];
|
|
|
|
hash_val += key->port2;
|
|
|
|
return hash_val;
|
|
}
|
|
|
|
/*
|
|
* Compare two conversation keys for an exact match.
|
|
*/
|
|
static gint
|
|
conversation_match_exact(gconstpointer v, gconstpointer w)
|
|
{
|
|
conversation_key *v1 = (conversation_key *)v;
|
|
conversation_key *v2 = (conversation_key *)w;
|
|
|
|
if (v1->ptype != v2->ptype)
|
|
return 0; /* different types of port */
|
|
|
|
/*
|
|
* Are the first and second port 1 values the same, the first and
|
|
* second port 2 values the same, the first and second address
|
|
* 1 values the same, and the first and second address 2 values
|
|
* the same?
|
|
*/
|
|
if (v1->port1 == v2->port1 &&
|
|
v1->port2 == v2->port2 &&
|
|
ADDRESSES_EQUAL(&v1->addr1, &v2->addr1) &&
|
|
ADDRESSES_EQUAL(&v1->addr2, &v2->addr2)) {
|
|
/*
|
|
* Yes. It's the same conversation, and the two
|
|
* address/port pairs are going in the same direction.
|
|
*/
|
|
return 1;
|
|
}
|
|
|
|
/*
|
|
* Is the first port 2 the same as the second port 1, the first
|
|
* port 1 the same as the second port 2, the first address 2
|
|
* the same as the second address 1, and the first address 1
|
|
* the same as the second address 2?
|
|
*/
|
|
if (v1->port2 == v2->port1 &&
|
|
v1->port1 == v2->port2 &&
|
|
ADDRESSES_EQUAL(&v1->addr2, &v2->addr1) &&
|
|
ADDRESSES_EQUAL(&v1->addr1, &v2->addr2)) {
|
|
/*
|
|
* Yes. It's the same conversation, and the two
|
|
* address/port pairs are going in opposite directions.
|
|
*/
|
|
return 1;
|
|
}
|
|
|
|
/*
|
|
* 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
|
|
conversation_hash_no_addr2(gconstpointer v)
|
|
{
|
|
conversation_key *key = (conversation_key *)v;
|
|
guint hash_val;
|
|
int i;
|
|
|
|
hash_val = 0;
|
|
for (i = 0; i < key->addr1.len; i++)
|
|
hash_val += key->addr1.data[i];
|
|
|
|
hash_val += key->port1;
|
|
|
|
hash_val += key->port2;
|
|
|
|
return hash_val;
|
|
}
|
|
|
|
/*
|
|
* Compare two conversation keys, except for the address 2 value.
|
|
* We don't check both directions of the conversation - the routine
|
|
* doing the hash lookup has to do two searches, as the hash key
|
|
* will be different for the two directions.
|
|
*/
|
|
static gint
|
|
conversation_match_no_addr2(gconstpointer v, gconstpointer w)
|
|
{
|
|
conversation_key *v1 = (conversation_key *)v;
|
|
conversation_key *v2 = (conversation_key *)w;
|
|
|
|
if (v1->ptype != v2->ptype)
|
|
return 0; /* different types of port */
|
|
|
|
/*
|
|
* Are the first and second port 1 values the same, the first and
|
|
* second port 2 valuess the same, and the first and second
|
|
* address 1 values the same?
|
|
*/
|
|
if (v1->port1 == v2->port1 &&
|
|
v1->port2 == v2->port2 &&
|
|
ADDRESSES_EQUAL(&v1->addr1, &v2->addr1)) {
|
|
/*
|
|
* Yes. It's the same conversation, and the two
|
|
* address/port pairs are going in the same direction.
|
|
*/
|
|
return 1;
|
|
}
|
|
|
|
/*
|
|
* 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
|
|
conversation_hash_no_port2(gconstpointer v)
|
|
{
|
|
conversation_key *key = (conversation_key *)v;
|
|
guint hash_val;
|
|
int i;
|
|
|
|
hash_val = 0;
|
|
for (i = 0; i < key->addr1.len; i++)
|
|
hash_val += key->addr1.data[i];
|
|
|
|
hash_val += key->port1;
|
|
|
|
for (i = 0; i < key->addr2.len; i++)
|
|
hash_val += key->addr2.data[i];
|
|
|
|
return hash_val;
|
|
}
|
|
|
|
/*
|
|
* Compare two conversation keys, except for the port 2 value.
|
|
* We don't check both directions of the conversation - the routine
|
|
* doing the hash lookup has to do two searches, as the hash key
|
|
* will be different for the two directions.
|
|
*/
|
|
static gint
|
|
conversation_match_no_port2(gconstpointer v, gconstpointer w)
|
|
{
|
|
conversation_key *v1 = (conversation_key *)v;
|
|
conversation_key *v2 = (conversation_key *)w;
|
|
|
|
if (v1->ptype != v2->ptype)
|
|
return 0; /* different types of port */
|
|
|
|
/*
|
|
* Are the first and second port 1 values the same, the first and
|
|
* second address 1 values the same, and the first and second
|
|
* address 2 values the same?
|
|
*/
|
|
if (v1->port1 == v2->port1 &&
|
|
ADDRESSES_EQUAL(&v1->addr1, &v2->addr1) &&
|
|
ADDRESSES_EQUAL(&v1->addr2, &v2->addr2)) {
|
|
/*
|
|
* Yes. It's the same conversation, and the two
|
|
* address/port pairs are going in the same direction.
|
|
*/
|
|
return 1;
|
|
}
|
|
|
|
/*
|
|
* 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
|
|
conversation_hash_no_addr2_or_port2(gconstpointer v)
|
|
{
|
|
conversation_key *key = (conversation_key *)v;
|
|
guint hash_val;
|
|
int i;
|
|
|
|
hash_val = 0;
|
|
for (i = 0; i < key->addr1.len; i++)
|
|
hash_val += key->addr1.data[i];
|
|
|
|
hash_val += key->port1;
|
|
|
|
return hash_val;
|
|
}
|
|
|
|
/*
|
|
* Compare the address 1 and port 1 in the two conversation keys.
|
|
* We don't check both directions of the conversation - the routine
|
|
* doing the hash lookup has to do two searches, as the hash key
|
|
* will be different for the two directions.
|
|
*/
|
|
static gint
|
|
conversation_match_no_addr2_or_port2(gconstpointer v, gconstpointer w)
|
|
{
|
|
conversation_key *v1 = (conversation_key *)v;
|
|
conversation_key *v2 = (conversation_key *)w;
|
|
|
|
if (v1->ptype != v2->ptype)
|
|
return 0; /* different types of port */
|
|
|
|
/*
|
|
* Are the first and second port 1 values the same and the first
|
|
* and second address 1 values the same?
|
|
*/
|
|
if (v1->port1 == v2->port1 &&
|
|
ADDRESSES_EQUAL(&v1->addr1, &v2->addr1)) {
|
|
/*
|
|
* Yes. It's the same conversation, and the two
|
|
* address/port pairs are going in the same direction.
|
|
*/
|
|
return 1;
|
|
}
|
|
|
|
/*
|
|
* The addresses or the ports don't match.
|
|
*/
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Initialize some variables every time a file is loaded or re-loaded.
|
|
* Destroy all existing conversations, and create a new hash table
|
|
* for the conversations in the new file.
|
|
*/
|
|
void
|
|
conversation_init(void)
|
|
{
|
|
conversation_key *key;
|
|
|
|
/*
|
|
* Free the addresses associated with the conversation keys.
|
|
*/
|
|
for (key = conversation_keys; key != NULL; key = key->next) {
|
|
/*
|
|
* Grr. I guess the theory here is that freeing
|
|
* something sure as heck modifies it, so you
|
|
* want to ban attempts to free it, but, alas,
|
|
* if we make the "data" field of an "address"
|
|
* structure not a "const", the compiler whines if
|
|
* we try to make it point into the data for a packet,
|
|
* as that's a "const" array (and should be, as dissectors
|
|
* shouldn't trash it).
|
|
*
|
|
* So we cast the complaint into oblivion, and rely on
|
|
* the fact that these addresses are known to have had
|
|
* their data mallocated, i.e. they don't point into,
|
|
* say, the middle of the data for a packet.
|
|
*/
|
|
g_free((gpointer)key->addr1.data);
|
|
g_free((gpointer)key->addr2.data);
|
|
}
|
|
conversation_keys = NULL;
|
|
if (conversation_hashtable_exact != NULL)
|
|
g_hash_table_destroy(conversation_hashtable_exact);
|
|
if (conversation_hashtable_no_addr2 != NULL)
|
|
g_hash_table_destroy(conversation_hashtable_no_addr2);
|
|
if (conversation_hashtable_no_port2 != NULL)
|
|
g_hash_table_destroy(conversation_hashtable_no_port2);
|
|
if (conversation_hashtable_no_addr2_or_port2 != NULL)
|
|
g_hash_table_destroy(conversation_hashtable_no_addr2_or_port2);
|
|
if (conversation_key_chunk != NULL)
|
|
g_mem_chunk_destroy(conversation_key_chunk);
|
|
if (conversation_chunk != NULL)
|
|
g_mem_chunk_destroy(conversation_chunk);
|
|
|
|
conversation_hashtable_exact =
|
|
g_hash_table_new(conversation_hash_exact,
|
|
conversation_match_exact);
|
|
conversation_hashtable_no_addr2 =
|
|
g_hash_table_new(conversation_hash_no_addr2,
|
|
conversation_match_no_addr2);
|
|
conversation_hashtable_no_port2 =
|
|
g_hash_table_new(conversation_hash_no_port2,
|
|
conversation_match_no_port2);
|
|
conversation_hashtable_no_addr2_or_port2 =
|
|
g_hash_table_new(conversation_hash_no_addr2_or_port2,
|
|
conversation_match_no_addr2_or_port2);
|
|
conversation_key_chunk = g_mem_chunk_new("conversation_key_chunk",
|
|
sizeof(conversation_key),
|
|
conversation_init_count * sizeof(struct conversation_key),
|
|
G_ALLOC_AND_FREE);
|
|
conversation_chunk = g_mem_chunk_new("conversation_chunk",
|
|
sizeof(conversation_t),
|
|
conversation_init_count * sizeof(conversation_t),
|
|
G_ALLOC_AND_FREE);
|
|
|
|
/*
|
|
* Start the conversation indices over at 0.
|
|
*/
|
|
new_index = 0;
|
|
}
|
|
|
|
/*
|
|
* Given two address/port pairs for a packet, create a new conversation
|
|
* to contain packets between those address/port pairs.
|
|
*
|
|
* The options field is used to specify whether the address 2 value
|
|
* and/or port 2 value are not given and any value is acceptable
|
|
* when searching for this conversation.
|
|
*/
|
|
conversation_t *
|
|
conversation_new(address *addr1, address *addr2, port_type ptype,
|
|
guint32 port1, guint32 port2, void *data, guint options)
|
|
{
|
|
conversation_t *conversation;
|
|
conversation_key *new_key;
|
|
|
|
new_key = g_mem_chunk_alloc(conversation_key_chunk);
|
|
new_key->next = conversation_keys;
|
|
conversation_keys = new_key;
|
|
COPY_ADDRESS(&new_key->addr1, addr1);
|
|
COPY_ADDRESS(&new_key->addr2, addr2);
|
|
new_key->ptype = ptype;
|
|
new_key->port1 = port1;
|
|
new_key->port2 = port2;
|
|
|
|
conversation = g_mem_chunk_alloc(conversation_chunk);
|
|
conversation->index = new_index;
|
|
conversation->data = data;
|
|
|
|
/* clear dissector pointer */
|
|
conversation->dissector.new_d = NULL;
|
|
|
|
/* set the options and key pointer */
|
|
conversation->options = options;
|
|
conversation->key_ptr = new_key;
|
|
|
|
new_index++;
|
|
|
|
if (options & NO_ADDR2) {
|
|
if (options & NO_PORT2) {
|
|
g_hash_table_insert(conversation_hashtable_no_addr2_or_port2,
|
|
new_key, conversation);
|
|
} else {
|
|
g_hash_table_insert(conversation_hashtable_no_addr2,
|
|
new_key, conversation);
|
|
}
|
|
} else {
|
|
if (options & NO_PORT2) {
|
|
g_hash_table_insert(conversation_hashtable_no_port2,
|
|
new_key, conversation);
|
|
} else {
|
|
g_hash_table_insert(conversation_hashtable_exact,
|
|
new_key, conversation);
|
|
}
|
|
}
|
|
return conversation;
|
|
}
|
|
|
|
/*
|
|
* Set the port 2 value in a key. Remove the original from table,
|
|
* update the options and port values, insert the updated key.
|
|
*/
|
|
void
|
|
conversation_set_port2(conversation_t *conv, guint32 port)
|
|
{
|
|
/*
|
|
* If the port 2 value is wildcarded, don't set it.
|
|
*/
|
|
if (!(conv->options & NO_PORT2))
|
|
return;
|
|
|
|
if (conv->options & NO_ADDR2) {
|
|
g_hash_table_remove(conversation_hashtable_no_addr2_or_port2,
|
|
conv->key_ptr);
|
|
} else {
|
|
g_hash_table_remove(conversation_hashtable_no_port2,
|
|
conv->key_ptr);
|
|
}
|
|
conv->options &= ~NO_PORT2;
|
|
conv->key_ptr->port2 = port;
|
|
if (conv->options & NO_ADDR2) {
|
|
g_hash_table_insert(conversation_hashtable_no_addr2,
|
|
conv->key_ptr, conv);
|
|
} else {
|
|
g_hash_table_insert(conversation_hashtable_exact,
|
|
conv->key_ptr, conv);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Set the address 2 value in a key. Remove the original from
|
|
* table, update the options and port values, insert the updated key.
|
|
*/
|
|
void
|
|
conversation_set_addr2(conversation_t *conv, address *addr)
|
|
{
|
|
/*
|
|
* If the address 2 value is wildcarded, don't set it.
|
|
*/
|
|
if (!(conv->options & NO_ADDR2))
|
|
return;
|
|
|
|
if (conv->options & NO_PORT2) {
|
|
g_hash_table_remove(conversation_hashtable_no_addr2_or_port2,
|
|
conv->key_ptr);
|
|
} else {
|
|
g_hash_table_remove(conversation_hashtable_no_addr2,
|
|
conv->key_ptr);
|
|
}
|
|
conv->options &= ~NO_ADDR2;
|
|
COPY_ADDRESS(&conv->key_ptr->addr2, addr);
|
|
if (conv->options & NO_PORT2) {
|
|
g_hash_table_insert(conversation_hashtable_no_port2,
|
|
conv->key_ptr, conv);
|
|
} else {
|
|
g_hash_table_insert(conversation_hashtable_exact,
|
|
conv->key_ptr, conv);
|
|
}
|
|
}
|
|
|
|
static conversation_t *
|
|
conversation_match(GHashTable *hashtable, address *addr1, address *addr2,
|
|
port_type ptype, guint32 port1, guint32 port2)
|
|
{
|
|
conversation_key key;
|
|
|
|
/*
|
|
* We don't make a copy of the address data, we just copy the
|
|
* pointer to it, as "key" disappears when we return.
|
|
*/
|
|
key.addr1 = *addr1;
|
|
key.addr2 = *addr2;
|
|
key.ptype = ptype;
|
|
key.port1 = port1;
|
|
key.port2 = port2;
|
|
return g_hash_table_lookup(hashtable, &key);
|
|
}
|
|
|
|
/*
|
|
* Given two address/port pairs for a packet, search for a conversation
|
|
* containing packets between those address/port pairs. Returns NULL if
|
|
* not found. If the NO_ADDR_B and/or NO_PORT_B flags are set in the
|
|
* conversation options field, that value will not be used.
|
|
*/
|
|
conversation_t *
|
|
find_conversation(address *addr_a, address *addr_b, port_type ptype,
|
|
guint32 port_a, guint32 port_b, guint options)
|
|
{
|
|
conversation_t *conversation;
|
|
|
|
if (options & NO_ADDR_B) {
|
|
if (options & NO_PORT_B) {
|
|
/*
|
|
* Wildcard the address and port - first try looking
|
|
* for a conversation with the specified address 1
|
|
* and port 1, then try looking for one with an
|
|
* address 1 and port 1 that's the specified
|
|
* address *2* and port *2* (this packet may be
|
|
* going in the opposite direction from the first
|
|
* packet in the conversation).
|
|
*/
|
|
conversation =
|
|
conversation_match(conversation_hashtable_no_addr2_or_port2,
|
|
addr_a, addr_b, ptype, port_a, port_b);
|
|
if (conversation != NULL)
|
|
return conversation;
|
|
return conversation_match(conversation_hashtable_no_addr2_or_port2,
|
|
addr_b, addr_a, ptype, port_b, port_a);
|
|
} else {
|
|
/*
|
|
* Wildcard the address - first try looking for a
|
|
* conversation with the specified address 1 and
|
|
* port 1 and the specified port 2, then try looking
|
|
* for one with an address 1 and port 1 that's
|
|
* the specified address *2* and port *2* and
|
|
* a port 2 that's the specified port *1* (this
|
|
* packet may be going in the opposite direction
|
|
* from the first packet in the conversation).
|
|
*/
|
|
conversation =
|
|
conversation_match(conversation_hashtable_no_addr2,
|
|
addr_a, addr_b, ptype, port_a, port_b);
|
|
if (conversation != NULL)
|
|
return conversation;
|
|
return conversation_match(conversation_hashtable_no_addr2,
|
|
addr_b, addr_a, ptype, port_b, port_a);
|
|
}
|
|
} else {
|
|
if (options & NO_PORT_B) {
|
|
/*
|
|
* Wildcard the port - first try looking for a
|
|
* conversation with the specified address 1 and
|
|
* port 1 and the specified address 2, then try
|
|
* looking for one with an address 1 and port 1
|
|
* that's the specified address *2* and port *2*
|
|
* and an address 2 that's the specified address
|
|
* *1* (this packet may be going in the opposite
|
|
* direction from the first packet in the conversation).
|
|
*/
|
|
conversation =
|
|
conversation_match(conversation_hashtable_no_port2,
|
|
addr_a, addr_b, ptype, port_a, port_b);
|
|
if (conversation != NULL)
|
|
return conversation;
|
|
return conversation_match(conversation_hashtable_no_port2,
|
|
addr_b, addr_a, ptype, port_b, port_a);
|
|
} else {
|
|
/*
|
|
* Search for an exact match. That search checks both
|
|
* directions.
|
|
*/
|
|
return conversation_match(conversation_hashtable_exact,
|
|
addr_a, addr_b, ptype, port_a, port_b);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Set the dissector for a conversation.
|
|
*/
|
|
void
|
|
old_conversation_set_dissector(conversation_t *conversation,
|
|
old_dissector_t dissector)
|
|
{
|
|
conversation->is_old_dissector = TRUE;
|
|
conversation->dissector.old_d = dissector;
|
|
}
|
|
|
|
void
|
|
conversation_set_dissector(conversation_t *conversation,
|
|
dissector_t dissector)
|
|
{
|
|
conversation->is_old_dissector = FALSE;
|
|
conversation->dissector.new_d = dissector;
|
|
}
|
|
|
|
/*
|
|
* Given two address/port pairs for a packet, search for a conversation
|
|
* dissector.
|
|
* If found, call it and return TRUE, otherwise return FALSE.
|
|
*
|
|
* Will search for a exact match (addr_a/port_a and addr_b/port_b), then search
|
|
* for wild card matches: try to match any address 2 with the specified port 2
|
|
* first (addr_a/port_a and {any}/addr_b), then try to match any port 2 with the
|
|
* specified address 2 (addr_a/port_a and addr_b/{any}), then try to match any
|
|
* address 2 and any port 2 (addr_a/port_a and {any}/{any}).
|
|
*/
|
|
gboolean
|
|
try_conversation_dissector(address *addr_a, address *addr_b, port_type ptype,
|
|
guint32 port_a, guint32 port_b, tvbuff_t *tvb, packet_info *pinfo,
|
|
proto_tree *tree)
|
|
{
|
|
conversation_t *conversation;
|
|
const guint8 *pd;
|
|
int offset;
|
|
|
|
conversation = find_conversation(addr_a, addr_b, ptype, port_a, port_b,
|
|
0);
|
|
|
|
if (conversation == NULL)
|
|
conversation = find_conversation(addr_a, addr_b, ptype, port_a,
|
|
port_b, NO_ADDR_B);
|
|
|
|
if (conversation == NULL)
|
|
conversation = find_conversation(addr_a, addr_b, ptype, port_a,
|
|
port_b, NO_PORT_B);
|
|
|
|
if (conversation == NULL)
|
|
conversation = find_conversation(addr_a, addr_b, ptype, port_a,
|
|
port_b, NO_PORT_B | NO_ADDR_B);
|
|
|
|
if (conversation != NULL) {
|
|
if (conversation->is_old_dissector) {
|
|
if (conversation->dissector.old_d == NULL)
|
|
return FALSE;
|
|
|
|
/*
|
|
* New dissector calling old dissector; use
|
|
* "tvb_compat()" to remap.
|
|
*
|
|
* "is_old_dissector" won't be set unless
|
|
* "dissector.old_d" is set.
|
|
*/
|
|
tvb_compat(tvb, &pd, &offset);
|
|
(*conversation->dissector.old_d)(pd, offset, pinfo->fd,
|
|
tree);
|
|
} else {
|
|
if (conversation->dissector.new_d == NULL)
|
|
return FALSE;
|
|
(*conversation->dissector.new_d)(tvb, pinfo, tree);
|
|
}
|
|
return TRUE;
|
|
}
|
|
return FALSE;
|
|
}
|