2005-10-03 18:34:21 +00:00
|
|
|
/* stream.c
|
|
|
|
*
|
|
|
|
* Definititions for handling circuit-switched protocols
|
|
|
|
* which are handled as streams, and don't have lengths
|
|
|
|
* and IDs such as are required for reassemble.h
|
|
|
|
*
|
2005-10-03 22:17:32 +00:00
|
|
|
* $Id$
|
2005-10-03 18:34:21 +00:00
|
|
|
*
|
2006-05-21 05:12:17 +00:00
|
|
|
* Wireshark - Network traffic analyzer
|
|
|
|
* By Gerald Combs <gerald@wireshark.org>
|
2005-10-03 18:34:21 +00:00
|
|
|
* 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
|
2012-06-28 22:56:06 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
2005-10-03 18:34:21 +00:00
|
|
|
*/
|
|
|
|
|
2012-09-20 01:48:30 +00:00
|
|
|
#include "config.h"
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
#include <glib.h>
|
|
|
|
#include <epan/packet.h>
|
|
|
|
#include <epan/reassemble.h>
|
|
|
|
#include <epan/stream.h>
|
|
|
|
#include <epan/tvbuff.h>
|
|
|
|
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
fragment_data *fd_head; /* the reassembled data, NULL
|
2009-10-12 21:36:54 +00:00
|
|
|
* until we add the last fragment */
|
|
|
|
guint32 pdu_number; /* Number of this PDU within the stream */
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
/* id of this pdu (globally unique) */
|
|
|
|
guint32 id;
|
|
|
|
} stream_pdu_t;
|
|
|
|
|
|
|
|
|
|
|
|
struct stream_pdu_fragment
|
|
|
|
{
|
2009-10-12 21:36:54 +00:00
|
|
|
guint32 len; /* the length of this fragment */
|
2005-10-03 18:34:21 +00:00
|
|
|
stream_pdu_t *pdu;
|
|
|
|
gboolean final_fragment;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct stream {
|
|
|
|
/* the key used to add this stream to stream_hash */
|
|
|
|
struct stream_key *key;
|
|
|
|
|
|
|
|
/* pdu to add the next fragment to, or NULL if we need to start
|
|
|
|
* a new PDU.
|
|
|
|
*/
|
|
|
|
stream_pdu_t *current_pdu;
|
|
|
|
|
|
|
|
/* number of PDUs added to this stream so far */
|
|
|
|
guint32 pdu_counter;
|
|
|
|
|
|
|
|
/* the framenumber and offset of the last fragment added;
|
|
|
|
used for sanity-checking */
|
|
|
|
guint32 lastfrag_framenum;
|
|
|
|
guint32 lastfrag_offset;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************
|
|
|
|
*
|
|
|
|
* Stream hash
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* key */
|
|
|
|
typedef struct stream_key {
|
|
|
|
/* streams can be attached to circuits or conversations, and we note
|
|
|
|
that here */
|
|
|
|
gboolean is_circuit;
|
|
|
|
union {
|
2009-10-12 21:36:54 +00:00
|
|
|
const struct circuit *circuit;
|
|
|
|
const struct conversation *conv;
|
2005-10-03 18:34:21 +00:00
|
|
|
} circ;
|
|
|
|
int p2p_dir;
|
|
|
|
} stream_key_t;
|
|
|
|
|
|
|
|
|
|
|
|
/* hash func */
|
2009-10-12 21:36:54 +00:00
|
|
|
static guint stream_hash_func(gconstpointer k)
|
2005-10-03 18:34:21 +00:00
|
|
|
{
|
|
|
|
const stream_key_t *key = (const stream_key_t *)k;
|
|
|
|
|
|
|
|
/* is_circuit is redundant to the circuit/conversation pointer */
|
2007-05-29 02:43:18 +00:00
|
|
|
return ((guint)(unsigned long)key->circ.circuit) ^ key->p2p_dir;
|
2005-10-03 18:34:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* compare func */
|
2009-10-12 21:36:54 +00:00
|
|
|
static gboolean stream_compare_func(gconstpointer a,
|
|
|
|
gconstpointer b)
|
2005-10-03 18:34:21 +00:00
|
|
|
{
|
|
|
|
const stream_key_t *key1 = (const stream_key_t *)a;
|
|
|
|
const stream_key_t *key2 = (const stream_key_t *)b;
|
|
|
|
if( key1 -> p2p_dir != key2 -> p2p_dir ||
|
2009-10-12 21:36:54 +00:00
|
|
|
key1-> is_circuit != key2 -> is_circuit )
|
|
|
|
return FALSE;
|
2009-09-06 18:25:23 +00:00
|
|
|
|
2005-10-03 18:34:21 +00:00
|
|
|
if( key1 -> is_circuit )
|
2009-10-12 21:36:54 +00:00
|
|
|
return (key1 -> circ.circuit == key2 -> circ.circuit );
|
2005-10-03 18:34:21 +00:00
|
|
|
else
|
2009-10-12 21:36:54 +00:00
|
|
|
return (key1 -> circ.conv == key2 -> circ.conv );
|
2005-10-03 18:34:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* the hash table */
|
|
|
|
static GHashTable *stream_hash;
|
|
|
|
|
|
|
|
|
2009-09-06 18:25:23 +00:00
|
|
|
/* cleanup reset function, call from stream_cleanup() */
|
|
|
|
static void cleanup_stream_hash( void ) {
|
2009-10-12 21:36:54 +00:00
|
|
|
if( stream_hash != NULL ) {
|
|
|
|
g_hash_table_destroy( stream_hash );
|
|
|
|
stream_hash = NULL;
|
|
|
|
}
|
2009-09-06 18:25:23 +00:00
|
|
|
}
|
2005-10-03 18:34:21 +00:00
|
|
|
|
2009-09-06 18:25:23 +00:00
|
|
|
/* init function, call from stream_init() */
|
|
|
|
static void init_stream_hash( void ) {
|
2010-03-25 19:05:44 +00:00
|
|
|
g_assert(stream_hash==NULL);
|
2005-10-03 22:17:32 +00:00
|
|
|
stream_hash = g_hash_table_new(stream_hash_func,
|
2009-10-12 21:36:54 +00:00
|
|
|
stream_compare_func);
|
2005-10-03 18:34:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* lookup function, returns null if not found */
|
|
|
|
static stream_t *stream_hash_lookup_circ( const struct circuit *circuit, int p2p_dir )
|
|
|
|
{
|
2005-11-11 04:35:22 +00:00
|
|
|
stream_key_t key;
|
|
|
|
key.is_circuit=TRUE;
|
|
|
|
key.circ.circuit=circuit;
|
|
|
|
key.p2p_dir=p2p_dir;
|
2005-10-03 18:34:21 +00:00
|
|
|
return (stream_t *)g_hash_table_lookup(stream_hash, &key);
|
|
|
|
}
|
|
|
|
|
|
|
|
static stream_t *stream_hash_lookup_conv( const struct conversation *conv, int p2p_dir )
|
|
|
|
{
|
2005-11-11 04:35:22 +00:00
|
|
|
stream_key_t key;
|
|
|
|
key.is_circuit=FALSE;
|
2005-10-03 18:34:21 +00:00
|
|
|
key.circ.conv = conv;
|
2005-11-11 04:35:22 +00:00
|
|
|
key.p2p_dir=p2p_dir;
|
2005-10-03 18:34:21 +00:00
|
|
|
return (stream_t *)g_hash_table_lookup(stream_hash, &key);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static stream_t *new_stream( stream_key_t *key )
|
|
|
|
{
|
|
|
|
stream_t *val;
|
2009-09-06 18:25:23 +00:00
|
|
|
|
2009-10-12 21:36:54 +00:00
|
|
|
val = se_alloc(sizeof(stream_t));
|
2005-10-03 18:34:21 +00:00
|
|
|
val -> key = key;
|
|
|
|
val -> pdu_counter = 0;
|
|
|
|
val -> current_pdu = NULL;
|
|
|
|
val -> lastfrag_framenum = 0;
|
|
|
|
val -> lastfrag_offset = 0;
|
|
|
|
g_hash_table_insert(stream_hash, key, val);
|
|
|
|
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* insert function */
|
|
|
|
static stream_t *stream_hash_insert_circ( const struct circuit *circuit, int p2p_dir )
|
|
|
|
{
|
|
|
|
stream_key_t *key;
|
|
|
|
|
2009-10-12 21:36:54 +00:00
|
|
|
key = se_alloc(sizeof(stream_key_t));
|
2005-10-03 18:34:21 +00:00
|
|
|
key->is_circuit = TRUE;
|
|
|
|
key->circ.circuit = circuit;
|
|
|
|
key->p2p_dir = p2p_dir;
|
|
|
|
|
|
|
|
return new_stream(key);
|
|
|
|
}
|
|
|
|
|
|
|
|
static stream_t *stream_hash_insert_conv( const struct conversation *conv, int p2p_dir )
|
|
|
|
{
|
|
|
|
stream_key_t *key;
|
|
|
|
|
2009-10-12 21:36:54 +00:00
|
|
|
key = se_alloc(sizeof(stream_key_t));
|
2005-10-03 18:34:21 +00:00
|
|
|
key->is_circuit = FALSE;
|
|
|
|
key->circ.conv = conv;
|
|
|
|
key->p2p_dir = p2p_dir;
|
|
|
|
|
|
|
|
return new_stream(key);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/******************************************************************************
|
|
|
|
*
|
|
|
|
* PDU data
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* pdu counter, for generating unique pdu ids */
|
|
|
|
static guint32 pdu_counter;
|
|
|
|
|
2009-09-06 18:25:23 +00:00
|
|
|
static void stream_cleanup_pdu_data(void)
|
2005-10-03 18:34:21 +00:00
|
|
|
{
|
2009-09-06 18:25:23 +00:00
|
|
|
}
|
2005-10-03 18:34:21 +00:00
|
|
|
|
2009-09-06 18:25:23 +00:00
|
|
|
static void stream_init_pdu_data(void)
|
|
|
|
{
|
2005-10-03 18:34:21 +00:00
|
|
|
pdu_counter = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* new pdu in this stream */
|
|
|
|
static stream_pdu_t *stream_new_pdu(stream_t *stream)
|
|
|
|
{
|
|
|
|
stream_pdu_t *pdu;
|
2009-10-12 21:36:54 +00:00
|
|
|
pdu = se_alloc(sizeof(stream_pdu_t));
|
2005-10-03 18:34:21 +00:00
|
|
|
pdu -> fd_head = NULL;
|
|
|
|
pdu -> pdu_number = stream -> pdu_counter++;
|
|
|
|
pdu -> id = pdu_counter++;
|
|
|
|
return pdu;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************
|
|
|
|
*
|
|
|
|
* fragment hash
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* key */
|
|
|
|
typedef struct fragment_key {
|
|
|
|
const stream_t *stream;
|
|
|
|
guint32 framenum;
|
|
|
|
guint32 offset;
|
|
|
|
} fragment_key_t;
|
|
|
|
|
|
|
|
|
|
|
|
/* hash func */
|
2009-10-12 21:36:54 +00:00
|
|
|
static guint fragment_hash_func(gconstpointer k)
|
2005-10-03 18:34:21 +00:00
|
|
|
{
|
|
|
|
const fragment_key_t *key = (const fragment_key_t *)k;
|
2007-05-29 02:43:18 +00:00
|
|
|
return ((guint)(unsigned long)key->stream) + ((guint)key -> framenum) + ((guint)key->offset);
|
2005-10-03 18:34:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* compare func */
|
2009-10-12 21:36:54 +00:00
|
|
|
static gboolean fragment_compare_func(gconstpointer a,
|
|
|
|
gconstpointer b)
|
2005-10-03 18:34:21 +00:00
|
|
|
{
|
|
|
|
const fragment_key_t *key1 = (const fragment_key_t *)a;
|
|
|
|
const fragment_key_t *key2 = (const fragment_key_t *)b;
|
|
|
|
return (key1 -> stream == key2 -> stream &&
|
2009-10-12 21:36:54 +00:00
|
|
|
key1 -> framenum == key2 -> framenum &&
|
|
|
|
key1 -> offset == key2 -> offset );
|
2005-10-03 18:34:21 +00:00
|
|
|
}
|
2009-09-06 18:25:23 +00:00
|
|
|
|
2005-10-03 18:34:21 +00:00
|
|
|
/* the hash table */
|
|
|
|
static GHashTable *fragment_hash;
|
|
|
|
|
|
|
|
|
2009-09-06 18:25:23 +00:00
|
|
|
/* cleanup function, call from stream_cleanup() */
|
|
|
|
static void cleanup_fragment_hash( void ) {
|
2009-10-12 21:36:54 +00:00
|
|
|
if( fragment_hash != NULL ) {
|
|
|
|
g_hash_table_destroy( fragment_hash );
|
|
|
|
fragment_hash = NULL;
|
|
|
|
}
|
2009-09-06 18:25:23 +00:00
|
|
|
}
|
2005-10-03 18:34:21 +00:00
|
|
|
|
2009-09-06 18:25:23 +00:00
|
|
|
/* init function, call from stream_init() */
|
|
|
|
static void init_fragment_hash( void ) {
|
2010-03-25 19:05:44 +00:00
|
|
|
g_assert(fragment_hash==NULL);
|
2005-10-03 18:34:21 +00:00
|
|
|
fragment_hash = g_hash_table_new(fragment_hash_func,
|
2009-10-12 21:36:54 +00:00
|
|
|
fragment_compare_func);
|
2005-10-03 18:34:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* lookup function, returns null if not found */
|
|
|
|
static stream_pdu_fragment_t *fragment_hash_lookup( const stream_t *stream, guint32 framenum, guint32 offset )
|
|
|
|
{
|
2005-11-11 04:35:22 +00:00
|
|
|
fragment_key_t key;
|
|
|
|
stream_pdu_fragment_t *val;
|
|
|
|
|
|
|
|
key.stream = stream;
|
|
|
|
key.framenum = framenum;
|
|
|
|
key.offset = offset;
|
|
|
|
val = g_hash_table_lookup(fragment_hash, &key);
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* insert function */
|
|
|
|
static stream_pdu_fragment_t *fragment_hash_insert( const stream_t *stream, guint32 framenum, guint32 offset,
|
2009-10-12 21:36:54 +00:00
|
|
|
guint32 length)
|
2005-10-03 18:34:21 +00:00
|
|
|
{
|
|
|
|
fragment_key_t *key;
|
|
|
|
stream_pdu_fragment_t *val;
|
|
|
|
|
2009-10-12 21:36:54 +00:00
|
|
|
key = se_alloc(sizeof(fragment_key_t));
|
2005-10-03 18:34:21 +00:00
|
|
|
key->stream = stream;
|
|
|
|
key->framenum = framenum;
|
|
|
|
key->offset = offset;
|
|
|
|
|
2009-10-12 21:36:54 +00:00
|
|
|
val = se_alloc(sizeof(stream_pdu_fragment_t));
|
2005-10-03 18:34:21 +00:00
|
|
|
val->len = length;
|
|
|
|
val->pdu = NULL;
|
|
|
|
val->final_fragment = FALSE;
|
|
|
|
|
|
|
|
g_hash_table_insert(fragment_hash, key, val);
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
/* fragmentation hash tables */
|
|
|
|
static GHashTable *stream_fragment_table = NULL;
|
|
|
|
static GHashTable *stream_reassembled_table = NULL;
|
|
|
|
|
|
|
|
/* Initialise a new stream. Call this when you first identify a distinct
|
|
|
|
* stream. */
|
|
|
|
stream_t *stream_new_circ ( const struct circuit *circuit, int p2p_dir )
|
|
|
|
{
|
|
|
|
stream_t * stream;
|
|
|
|
|
|
|
|
/* we don't want to replace the previous data if we get called twice on the
|
|
|
|
same circuit, so do a lookup first */
|
|
|
|
stream = stream_hash_lookup_circ(circuit, p2p_dir);
|
2007-02-21 06:25:13 +00:00
|
|
|
DISSECTOR_ASSERT( stream == NULL );
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
stream = stream_hash_insert_circ(circuit, p2p_dir);
|
2009-09-06 18:25:23 +00:00
|
|
|
|
2005-10-03 18:34:21 +00:00
|
|
|
return stream;
|
|
|
|
}
|
|
|
|
|
|
|
|
stream_t *stream_new_conv ( const struct conversation *conv, int p2p_dir )
|
|
|
|
{
|
|
|
|
stream_t * stream;
|
|
|
|
|
|
|
|
/* we don't want to replace the previous data if we get called twice on the
|
|
|
|
same conversation, so do a lookup first */
|
|
|
|
stream = stream_hash_lookup_conv(conv, p2p_dir);
|
2007-02-21 06:25:13 +00:00
|
|
|
DISSECTOR_ASSERT( stream == NULL );
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
stream = stream_hash_insert_conv(conv, p2p_dir);
|
|
|
|
return stream;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* retrieve a previously-created stream.
|
|
|
|
*
|
|
|
|
* Returns null if no matching stream was found.
|
|
|
|
*/
|
|
|
|
stream_t *find_stream_circ ( const struct circuit *circuit, int p2p_dir )
|
|
|
|
{
|
|
|
|
return stream_hash_lookup_circ(circuit,p2p_dir);
|
|
|
|
}
|
|
|
|
stream_t *find_stream_conv ( const struct conversation *conv, int p2p_dir )
|
|
|
|
{
|
|
|
|
return stream_hash_lookup_conv(conv,p2p_dir);
|
|
|
|
}
|
|
|
|
|
2009-09-06 18:25:23 +00:00
|
|
|
/* cleanup the stream routines */
|
2009-10-12 21:36:54 +00:00
|
|
|
/* Note: stream_cleanup must only be called when seasonal memory
|
|
|
|
* is also freed since the hash tables countain pointers to
|
|
|
|
* se_alloc'd memory.
|
|
|
|
*/
|
2009-09-06 18:25:23 +00:00
|
|
|
void stream_cleanup( void )
|
|
|
|
{
|
|
|
|
cleanup_stream_hash();
|
|
|
|
cleanup_fragment_hash();
|
|
|
|
stream_cleanup_pdu_data();
|
|
|
|
}
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
/* initialise the stream routines */
|
|
|
|
void stream_init( void )
|
|
|
|
{
|
|
|
|
init_stream_hash();
|
|
|
|
init_fragment_hash();
|
|
|
|
stream_init_pdu_data();
|
|
|
|
|
|
|
|
fragment_table_init(&stream_fragment_table);
|
|
|
|
reassembled_table_init(&stream_reassembled_table);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
stream_pdu_fragment_t *stream_find_frag( stream_t *stream, guint32 framenum, guint32 offset )
|
|
|
|
{
|
|
|
|
return fragment_hash_lookup( stream, framenum, offset );
|
|
|
|
}
|
2009-09-06 18:25:23 +00:00
|
|
|
|
2005-10-03 18:34:21 +00:00
|
|
|
stream_pdu_fragment_t *stream_add_frag( stream_t *stream, guint32 framenum, guint32 offset,
|
2009-10-12 21:36:54 +00:00
|
|
|
tvbuff_t *tvb, packet_info *pinfo, gboolean more_frags )
|
2005-10-03 18:34:21 +00:00
|
|
|
{
|
|
|
|
fragment_data *fd_head;
|
|
|
|
stream_pdu_t *pdu;
|
|
|
|
stream_pdu_fragment_t *frag_data;
|
|
|
|
|
2007-02-21 06:25:13 +00:00
|
|
|
DISSECTOR_ASSERT(stream);
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
/* check that this fragment is at the end of the stream */
|
2007-02-21 06:25:13 +00:00
|
|
|
DISSECTOR_ASSERT( framenum > stream->lastfrag_framenum ||
|
2009-10-12 21:36:54 +00:00
|
|
|
(framenum == stream->lastfrag_framenum && offset > stream->lastfrag_offset));
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
|
|
|
|
pdu = stream->current_pdu;
|
|
|
|
if( pdu == NULL ) {
|
2009-10-12 21:36:54 +00:00
|
|
|
/* start a new pdu */
|
|
|
|
pdu = stream->current_pdu = stream_new_pdu(stream);
|
2005-10-03 18:34:21 +00:00
|
|
|
}
|
2009-09-06 18:25:23 +00:00
|
|
|
|
2005-10-03 18:34:21 +00:00
|
|
|
/* add it to the reassembly tables */
|
|
|
|
fd_head = fragment_add_seq_next(tvb, 0, pinfo, pdu->id,
|
2009-10-12 21:36:54 +00:00
|
|
|
stream_fragment_table, stream_reassembled_table,
|
|
|
|
tvb_reported_length(tvb), more_frags);
|
2005-10-03 18:34:21 +00:00
|
|
|
/* add it to our hash */
|
|
|
|
frag_data = fragment_hash_insert( stream, framenum, offset, tvb_reported_length(tvb));
|
|
|
|
frag_data -> pdu = pdu;
|
|
|
|
|
|
|
|
if( fd_head != NULL ) {
|
2009-10-12 21:36:54 +00:00
|
|
|
/* if this was the last fragment, update the pdu data.
|
|
|
|
*/
|
|
|
|
pdu -> fd_head = fd_head;
|
2009-09-06 18:25:23 +00:00
|
|
|
|
2009-10-12 21:36:54 +00:00
|
|
|
/* start a new pdu next time */
|
|
|
|
stream->current_pdu = NULL;
|
2005-10-03 18:34:21 +00:00
|
|
|
|
|
|
|
frag_data -> final_fragment = TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* stashing the framenum and offset permit future sanity checks */
|
|
|
|
stream -> lastfrag_framenum = framenum;
|
|
|
|
stream -> lastfrag_offset = offset;
|
|
|
|
|
|
|
|
return frag_data;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
tvbuff_t *stream_process_reassembled(
|
|
|
|
tvbuff_t *tvb, int offset, packet_info *pinfo,
|
2008-06-25 09:12:35 +00:00
|
|
|
const char *name, const stream_pdu_fragment_t *frag,
|
2005-10-03 18:34:21 +00:00
|
|
|
const struct _fragment_items *fit,
|
|
|
|
gboolean *update_col_infop, proto_tree *tree)
|
|
|
|
{
|
|
|
|
stream_pdu_t *pdu;
|
2007-02-21 06:25:13 +00:00
|
|
|
DISSECTOR_ASSERT(frag);
|
2005-10-03 18:34:21 +00:00
|
|
|
pdu = frag->pdu;
|
|
|
|
|
|
|
|
/* we handle non-terminal fragments ourselves, because
|
|
|
|
reassemble.c messes them up */
|
|
|
|
if(!frag->final_fragment) {
|
|
|
|
if (pdu->fd_head != NULL && fit->hf_reassembled_in != NULL) {
|
|
|
|
proto_tree_add_uint(tree,
|
|
|
|
*(fit->hf_reassembled_in), tvb,
|
|
|
|
0, 0, pdu->fd_head->reassembled_in);
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return process_reassembled_data(tvb, offset, pinfo, name, pdu->fd_head,
|
|
|
|
fit, update_col_infop, tree);
|
|
|
|
}
|
2009-09-06 18:25:23 +00:00
|
|
|
|
2005-10-03 18:34:21 +00:00
|
|
|
guint32 stream_get_frag_length( const stream_pdu_fragment_t *frag)
|
|
|
|
{
|
2007-02-21 06:25:13 +00:00
|
|
|
DISSECTOR_ASSERT( frag );
|
2005-10-03 18:34:21 +00:00
|
|
|
return frag->len;
|
|
|
|
}
|
|
|
|
|
|
|
|
fragment_data *stream_get_frag_data( const stream_pdu_fragment_t *frag)
|
|
|
|
{
|
2007-02-21 06:25:13 +00:00
|
|
|
DISSECTOR_ASSERT( frag );
|
2005-10-03 18:34:21 +00:00
|
|
|
return frag->pdu->fd_head;
|
|
|
|
}
|
|
|
|
|
|
|
|
guint32 stream_get_pdu_no( const stream_pdu_fragment_t *frag)
|
|
|
|
{
|
2007-02-21 06:25:13 +00:00
|
|
|
DISSECTOR_ASSERT( frag );
|
2005-10-03 18:34:21 +00:00
|
|
|
return frag->pdu->pdu_number;
|
|
|
|
}
|