2011-02-28 09:43:22 +00:00
|
|
|
/* packet-csn1.c
|
|
|
|
* Routines for CSN1 dissection in wireshark.
|
2011-03-23 09:14:50 +00:00
|
|
|
* By Vincent Helfre, based on original code by Jari Sassi
|
|
|
|
* with the gracious authorization of STE
|
2011-02-28 09:43:22 +00:00
|
|
|
* Copyright (c) 2011 ST-Ericsson
|
|
|
|
*
|
|
|
|
* $Id$
|
|
|
|
*
|
|
|
|
* Wireshark - Network traffic analyzer
|
|
|
|
* By Gerald Combs <gerald@wireshark.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
|
2012-06-28 22:56:06 +00:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
2011-02-28 09:43:22 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include "config.h"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <glib.h>
|
|
|
|
#include <epan/packet.h>
|
|
|
|
#include "packet-csn1.h"
|
|
|
|
|
|
|
|
#define pvDATA(_pv, _offset) ((void*) ((unsigned char*)_pv + _offset))
|
|
|
|
#define pui8DATA(_pv, _offset) ((guint8*) pvDATA(_pv, _offset))
|
|
|
|
#define pui16DATA(_pv, _offset) ((guint16*) pvDATA(_pv, _offset))
|
|
|
|
#define pui32DATA(_pv, _offset) ((guint32*) pvDATA(_pv, _offset))
|
|
|
|
|
|
|
|
/* used to tag existence of next element in variable length lists */
|
2011-02-28 23:50:01 +00:00
|
|
|
#define STANDARD_TAG 1
|
2011-02-28 09:43:22 +00:00
|
|
|
#define REVERSED_TAG 0
|
|
|
|
|
2012-02-23 08:57:40 +00:00
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
static const unsigned char ixBitsTab[] = {0, 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5};
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
|
|
|
|
/* Returns no_of_bits (up to 8) masked with 0x2B */
|
2011-02-28 23:50:01 +00:00
|
|
|
static guint8
|
|
|
|
tvb_get_masked_bits8(tvbuff_t *tvb, gint bit_offset, const gint no_of_bits)
|
2011-02-28 09:43:22 +00:00
|
|
|
{
|
|
|
|
static const guint8 maskBits[] = {0x00, 0x01, 0x03, 0x07, 0x0F, 0x1F, 0x3F, 0x7F, 0xFF};
|
|
|
|
gint byte_offset = bit_offset >> 3; /* divide by 8 */
|
|
|
|
gint relative_bit_offset = bit_offset & 0x07; /* modulo 8 */
|
|
|
|
guint8 result;
|
|
|
|
gint bit_shift = 8 - relative_bit_offset - (gint) no_of_bits;
|
|
|
|
|
|
|
|
if (bit_shift >= 0)
|
|
|
|
{
|
|
|
|
result = (0x2B ^ tvb_get_guint8(tvb, byte_offset)) >> bit_shift;
|
|
|
|
result &= maskBits[no_of_bits];
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
guint8 hight_part = (0x2B ^ tvb_get_guint8(tvb, byte_offset)) & maskBits[8 - relative_bit_offset];
|
|
|
|
hight_part = (guint8) (hight_part << (-bit_shift));
|
|
|
|
result = (0x2B ^ tvb_get_guint8(tvb, byte_offset+1)) >> (8 + bit_shift);
|
|
|
|
result |= hight_part;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* ================================================================================================
|
|
|
|
* set initial/start values in help data structure used for packing/unpacking operation
|
|
|
|
* ================================================================================================
|
|
|
|
*/
|
2011-02-28 23:50:01 +00:00
|
|
|
void
|
|
|
|
csnStreamInit(csnStream_t* ar, gint bit_offset, gint remaining_bits_len)
|
2011-02-28 09:43:22 +00:00
|
|
|
{
|
|
|
|
ar->remaining_bits_len = remaining_bits_len;
|
|
|
|
ar->bit_offset = bit_offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char* ErrCodes[] =
|
|
|
|
{
|
|
|
|
"General 0",
|
|
|
|
"General -1",
|
|
|
|
"DATA_NOT VALID",
|
|
|
|
"IN SCRIPT",
|
|
|
|
"INVALID UNION INDEX",
|
|
|
|
"NEED_MORE BITS TO UNPACK",
|
|
|
|
"ILLEGAL BIT VALUE",
|
|
|
|
"Internal",
|
|
|
|
"STREAM_NOT_SUPPORTED",
|
|
|
|
"MESSAGE_TOO_LONG"
|
|
|
|
};
|
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
static gint16
|
2012-06-04 11:44:52 +00:00
|
|
|
ProcessError(proto_tree *tree, tvbuff_t *tvb, gint bit_offset, const unsigned char* sz, gint16 err, const CSN_DESCR* pDescr)
|
2011-02-28 09:43:22 +00:00
|
|
|
{
|
|
|
|
gint16 i = MIN(-err, ((gint16) ElementsOf(ErrCodes)-1));
|
2011-04-12 21:00:26 +00:00
|
|
|
if (i >= 0)
|
2011-02-28 09:43:22 +00:00
|
|
|
{
|
2011-04-12 21:00:26 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "ERROR %s %s (%s)", sz, ErrCodes[i], pDescr?pDescr->sz:"-");
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "ERROR %s (%s)", sz, pDescr?pDescr->sz:"-");
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2011-02-28 14:54:22 +00:00
|
|
|
#if 0
|
2011-02-28 09:43:22 +00:00
|
|
|
static const char* CSN_DESCR_type[]=
|
|
|
|
{
|
|
|
|
"CSN_END",
|
|
|
|
"CSN_BIT",
|
|
|
|
"CSN_UINT",
|
|
|
|
"CSN_TYPE",
|
|
|
|
"CSN_CHOICE",
|
|
|
|
"CSN_UNION",
|
|
|
|
"CSN_UNION_LH",
|
|
|
|
"CSN_UINT_ARRAY",
|
|
|
|
"CSN_TYPE_ARRAY",
|
|
|
|
"CSN_BITMAP",
|
|
|
|
"CSN_VARIABLE_BITMAP",
|
|
|
|
"CSN_VARIABLE_BITMAP_1",
|
|
|
|
"CSN_LEFT_ALIGNED_VAR_BMP",
|
|
|
|
"CSN_LEFT_ALIGNED_VAR_BMP_1",
|
|
|
|
"CSN_VARIABLE_ARRAY",
|
|
|
|
"CSN_VARIABLE_TARRAY",
|
|
|
|
"CSN_VARIABLE_TARRAY_OFFSET",
|
|
|
|
"CSN_RECURSIVE_ARRAY",
|
|
|
|
"CSN_RECURSIVE_TARRAY",
|
|
|
|
"CSN_RECURSIVE_TARRAY_1",
|
|
|
|
"CSN_RECURSIVE_TARRAY_2",
|
|
|
|
"CSN_EXIST",
|
|
|
|
"CSN_EXIST_LH",
|
|
|
|
"CSN_NEXT_EXIST",
|
|
|
|
"CSN_NEXT_EXIST_LH",
|
|
|
|
"CSN_NULL",
|
|
|
|
"CSN_FIXED",
|
|
|
|
"CSN_CALLBACK",
|
|
|
|
"CSN_UINT_OFFSET",
|
|
|
|
"CSN_UINT_LH",
|
|
|
|
"CSN_SERIALIZE",
|
|
|
|
"CSN_TRAP_ERROR"
|
|
|
|
"CSN_???"
|
|
|
|
};
|
2011-02-28 14:54:22 +00:00
|
|
|
#endif
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* ================================================================================================
|
|
|
|
* Return TRUE if tag in bit stream indicates existence of next list element,
|
|
|
|
* otherwise return FALSE.
|
|
|
|
* Will work for tag values equal to both 0 and 1.
|
|
|
|
* ================================================================================================
|
|
|
|
*/
|
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
static gboolean
|
2011-03-23 09:14:50 +00:00
|
|
|
existNextElement(tvbuff_t *tvb, gint bit_offset, guint8 Tag)
|
2011-02-28 09:43:22 +00:00
|
|
|
{
|
|
|
|
guint8 res = tvb_get_bits8(tvb, bit_offset, 1);
|
2011-03-23 09:14:50 +00:00
|
|
|
if (Tag == STANDARD_TAG)
|
2011-02-28 09:43:22 +00:00
|
|
|
{
|
|
|
|
return (res > 0);
|
|
|
|
}
|
|
|
|
return (res == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
gint16
|
|
|
|
csnStreamDissector(proto_tree *tree, csnStream_t* ar, const CSN_DESCR* pDescr, tvbuff_t *tvb, void* data, int ett_csn1)
|
2011-02-28 09:43:22 +00:00
|
|
|
{
|
|
|
|
gint remaining_bits_len = ar->remaining_bits_len;
|
|
|
|
gint bit_offset = ar->bit_offset;
|
2012-01-21 21:45:33 +00:00
|
|
|
guint8* pui8 = NULL;
|
2011-02-28 09:43:22 +00:00
|
|
|
guint16* pui16;
|
|
|
|
guint32* pui32;
|
2011-03-23 09:14:50 +00:00
|
|
|
guint8 Tag = STANDARD_TAG;
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
if (remaining_bits_len <= 0)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
do
|
|
|
|
{
|
|
|
|
switch (pDescr->type)
|
|
|
|
{
|
|
|
|
case CSN_BIT:
|
|
|
|
{
|
|
|
|
if (remaining_bits_len > 0)
|
|
|
|
{
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
2011-08-09 15:43:42 +00:00
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
*pui8 = tvb_get_bits8(tvb, bit_offset, 1);
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s %s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
/* end add the bit value to protocol tree */
|
|
|
|
}
|
2012-01-21 20:26:46 +00:00
|
|
|
else if(pDescr->may_be_null)
|
|
|
|
{
|
|
|
|
*pui8 = 0;
|
|
|
|
proto_tree_add_text(tree, tvb, 0, 0, "[NULL data]: %s Not Present", pDescr->sz);
|
|
|
|
}
|
2011-07-22 08:10:25 +00:00
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
2011-02-28 09:43:22 +00:00
|
|
|
|
2011-07-22 08:10:25 +00:00
|
|
|
pDescr++;
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len--;
|
|
|
|
bit_offset++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_NULL:
|
|
|
|
{ /* Empty member! */
|
2012-09-07 07:43:13 +00:00
|
|
|
bit_offset += pDescr->i;
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_UINT:
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
|
|
|
|
|
|
|
if (remaining_bits_len >= no_of_bits)
|
|
|
|
{
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
guint8 ui8 = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
*pui8 = ui8;
|
2012-01-23 18:54:02 +00:00
|
|
|
proto_tree_add_bits_item(tree, *(pDescr->serialize.hf_ptr), tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 16)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
guint16 ui16 = tvb_get_bits16(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
pui16 = pui16DATA(data, pDescr->offset);
|
|
|
|
*pui16 = ui16;
|
2011-10-24 19:57:53 +00:00
|
|
|
proto_tree_add_bits_item(tree, *(pDescr->serialize.hf_ptr), tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 32)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
guint32 ui32 = tvb_get_bits32(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
pui32 = pui32DATA(data, pDescr->offset);
|
|
|
|
*pui32 = ui32;
|
2011-10-24 19:57:53 +00:00
|
|
|
proto_tree_add_bits_item(tree, *(pDescr->serialize.hf_ptr), tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
2012-01-21 20:26:46 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
|
|
|
bit_offset += no_of_bits;
|
|
|
|
}
|
|
|
|
else if(pDescr->may_be_null)
|
|
|
|
{
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
*pui8 = 0;
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 16)
|
|
|
|
{
|
|
|
|
pui16 = pui16DATA(data, pDescr->offset);
|
|
|
|
*pui16 = 0;
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 32)
|
|
|
|
{
|
|
|
|
pui32 = pui32DATA(data, pDescr->offset);
|
|
|
|
*pui32 = 0;
|
|
|
|
}
|
|
|
|
proto_tree_add_text(tree, tvb, 0, 0, "[NULL data]: %s Not Present", pDescr->sz);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2012-01-21 20:26:46 +00:00
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_UINT_OFFSET:
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
|
|
|
|
|
|
|
if (remaining_bits_len >= no_of_bits)
|
|
|
|
{
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
guint8 ui8 = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui8 = ui8 + (guint8)pDescr->descr.value;
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s (%d)",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, ui8),
|
2012-01-21 20:26:46 +00:00
|
|
|
pDescr->sz, ui8);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 16)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
guint16 ui16 = tvb_get_bits16(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
pui16 = pui16DATA(data, pDescr->offset);
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui16 = ui16 + (guint16)pDescr->descr.value;
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s (%d)",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, ui16),
|
2012-01-21 20:26:46 +00:00
|
|
|
pDescr->sz, ui16);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 32)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
guint32 ui32 = tvb_get_bits32(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
pui32 = pui32DATA(data, pDescr->offset);
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui32 = ui32 + (guint16)pDescr->descr.value;
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s (%d)",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, ui32),
|
2012-01-21 20:26:46 +00:00
|
|
|
pDescr->sz, ui32);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
remaining_bits_len -= no_of_bits;
|
|
|
|
bit_offset += no_of_bits;
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_UINT_LH:
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
if (remaining_bits_len >= no_of_bits)
|
|
|
|
{
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
guint8 ui8 = tvb_get_masked_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
*pui8 = ui8;
|
2011-10-24 19:57:53 +00:00
|
|
|
proto_tree_add_bits_item(tree, *(pDescr->serialize.hf_ptr), tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{/* Maybe we should support more than 8 bits ? */
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
remaining_bits_len -= no_of_bits;
|
|
|
|
bit_offset += no_of_bits;
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2012-02-29 20:38:39 +00:00
|
|
|
case CSN_SPLIT_BITS:
|
|
|
|
{
|
|
|
|
guint8 no_of_value_bits = (guint8) pDescr->i;
|
|
|
|
guint64 value;
|
|
|
|
|
2012-03-01 07:01:15 +00:00
|
|
|
proto_tree_add_split_bits_item_ret_val(tree, *pDescr->serialize.hf_ptr, tvb, bit_offset, pDescr->descr.crumb_spec, &value);
|
2012-02-29 20:38:39 +00:00
|
|
|
if (no_of_value_bits <= 8)
|
|
|
|
{
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
*pui8 = (guint8)value;
|
|
|
|
}
|
|
|
|
else if (no_of_value_bits <= 16)
|
|
|
|
{
|
|
|
|
pui16 = pui16DATA(data, pDescr->offset);
|
|
|
|
*pui16 = (guint16)value;
|
|
|
|
}
|
|
|
|
else if (no_of_value_bits <= 32)
|
|
|
|
{
|
|
|
|
pui32 = pui32DATA(data, pDescr->offset);
|
|
|
|
*pui32 = (guint32)value;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_SPLIT_BITS_CRUMB:
|
|
|
|
{
|
|
|
|
if (remaining_bits_len >= pDescr->descr.crumb_spec[pDescr->i].crumb_bit_length)
|
|
|
|
{
|
2012-04-24 18:27:06 +00:00
|
|
|
proto_tree_add_split_bits_crumb(tree, *pDescr->serialize.hf_ptr, tvb, bit_offset,
|
2012-02-29 20:38:39 +00:00
|
|
|
pDescr->descr.crumb_spec, pDescr->i);
|
|
|
|
|
|
|
|
remaining_bits_len -= pDescr->descr.crumb_spec[pDescr->i].crumb_bit_length;
|
|
|
|
bit_offset += pDescr->descr.crumb_spec[pDescr->i].crumb_bit_length;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
case CSN_UINT_ARRAY:
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
2011-02-28 13:55:47 +00:00
|
|
|
guint16 nCount = (guint16)pDescr->descr.value; /* nCount supplied by value i.e. M_UINT_ARRAY(...) */
|
2011-02-28 09:43:22 +00:00
|
|
|
int i =0;
|
|
|
|
|
2011-02-28 15:42:58 +00:00
|
|
|
if (pDescr->serialize.value != 0)
|
2011-02-28 09:43:22 +00:00
|
|
|
{ /* nCount specified by a reference to field holding value i.e. M_VAR_UINT_ARRAY(...) */
|
|
|
|
nCount = *pui16DATA(data, nCount);
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
if (remaining_bits_len >= no_of_bits)
|
|
|
|
{
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
do
|
|
|
|
{
|
|
|
|
*pui8++ = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s[%d]",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits8(tvb, bit_offset, no_of_bits)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz,
|
|
|
|
i++);
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset += no_of_bits;
|
|
|
|
} while (--nCount > 0);
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 16)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector NOTIMPLEMENTED", 999, pDescr);
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 32)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector NOTIMPLEMENTED", 999, pDescr);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_VARIABLE_TARRAY_OFFSET:
|
|
|
|
case CSN_VARIABLE_TARRAY:
|
|
|
|
case CSN_TYPE_ARRAY:
|
|
|
|
{
|
|
|
|
gint16 Status;
|
|
|
|
csnStream_t arT = *ar;
|
|
|
|
gint16 nCount = pDescr->i;
|
2011-02-28 15:42:58 +00:00
|
|
|
guint16 nSize = (guint16)(gint32)pDescr->serialize.value;
|
2011-02-28 09:43:22 +00:00
|
|
|
int i =0;
|
|
|
|
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
if (pDescr->type == CSN_VARIABLE_TARRAY)
|
|
|
|
{ /* Count specified in field */
|
2011-02-28 23:50:01 +00:00
|
|
|
nCount = *pui8DATA(data, pDescr->i);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else if (pDescr->type == CSN_VARIABLE_TARRAY_OFFSET)
|
|
|
|
{ /* Count specified in field */
|
|
|
|
nCount = *pui8DATA(data, pDescr->i);
|
2012-01-23 18:54:02 +00:00
|
|
|
/* nCount--; the 1 offset is already taken into account in CSN_UINT_OFFSET */
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
while (nCount > 0)
|
2011-02-28 23:50:01 +00:00
|
|
|
{ /* resulting array of length 0 is possible
|
2011-02-28 09:43:22 +00:00
|
|
|
* but no bits shall be read from bitstream
|
|
|
|
*/
|
|
|
|
proto_item *ti;
|
|
|
|
proto_tree *test_tree;
|
|
|
|
|
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s[%d]",pDescr->sz, i++);
|
|
|
|
test_tree = proto_item_add_subtree(ti, ett_csn1);
|
|
|
|
|
|
|
|
csnStreamInit(&arT, bit_offset, remaining_bits_len);
|
2012-06-14 15:50:24 +00:00
|
|
|
Status = csnStreamDissector(test_tree, &arT, (const CSN_DESCR*)pDescr->descr.ptr, tvb, pui8, ett_csn1);
|
2011-02-28 09:43:22 +00:00
|
|
|
if (Status >= 0)
|
|
|
|
{
|
|
|
|
pui8 += nSize;
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_item_set_len(ti,((arT.bit_offset-1)>>3) - (bit_offset>>3)+1);
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len = arT.remaining_bits_len;
|
|
|
|
bit_offset = arT.bit_offset;
|
|
|
|
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return Status;
|
|
|
|
}
|
|
|
|
nCount--;
|
|
|
|
}
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_BITMAP:
|
|
|
|
{ /* bitmap with given length. The result is left aligned! */
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i; /* length of bitmap */
|
|
|
|
|
|
|
|
if (no_of_bits > 0)
|
|
|
|
{
|
2011-08-09 15:43:42 +00:00
|
|
|
|
2011-07-07 07:44:25 +00:00
|
|
|
if (no_of_bits <= 32)
|
|
|
|
{
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s",
|
2011-10-24 19:57:53 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits32(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
2011-07-07 07:44:25 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 64)
|
|
|
|
{
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s",
|
2011-10-24 19:57:53 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits64(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN)),
|
2011-07-07 07:44:25 +00:00
|
|
|
pDescr->sz);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2012-01-23 18:54:02 +00:00
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector NOT IMPLEMENTED", 999, pDescr);
|
2011-08-09 15:43:42 +00:00
|
|
|
}
|
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
|
|
|
DISSECTOR_ASSERT(remaining_bits_len >= 0);
|
|
|
|
bit_offset += no_of_bits;
|
|
|
|
}
|
|
|
|
/* bitmap was successfully extracted or it was empty */
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_TYPE:
|
|
|
|
{
|
|
|
|
gint16 Status;
|
|
|
|
csnStream_t arT = *ar;
|
|
|
|
proto_item *ti;
|
|
|
|
proto_tree *test_tree;
|
|
|
|
|
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s", pDescr->sz);
|
|
|
|
test_tree = proto_item_add_subtree(ti, ett_csn1);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
csnStreamInit(&arT, bit_offset, remaining_bits_len);
|
2012-06-14 15:50:24 +00:00
|
|
|
Status = csnStreamDissector(test_tree, &arT, (const CSN_DESCR*)pDescr->descr.ptr, tvb, pvDATA(data, pDescr->offset), ett_csn1);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
if (Status >= 0)
|
|
|
|
{
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_item_set_len(ti,((arT.bit_offset-1)>>3) - (bit_offset>>3)+1);
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len = arT.remaining_bits_len;
|
|
|
|
bit_offset = arT.bit_offset;
|
|
|
|
pDescr++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Has already been processed: ProcessError("csnStreamDissector", Status, pDescr); */
|
|
|
|
return Status;
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_CHOICE:
|
|
|
|
{
|
|
|
|
gint16 count = pDescr->i;
|
|
|
|
guint8 i = 0;
|
2011-02-28 13:55:47 +00:00
|
|
|
CSN_ChoiceElement_t* pChoice = (CSN_ChoiceElement_t*) pDescr->descr.ptr;
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
while (count > 0)
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = pChoice->bits;
|
|
|
|
guint8 value = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
|
|
|
|
if (value == pChoice->value)
|
|
|
|
{
|
|
|
|
CSN_DESCR descr[2];
|
|
|
|
gint16 Status;
|
|
|
|
csnStream_t arT = *ar;
|
2012-02-05 08:14:09 +00:00
|
|
|
proto_item *ti = NULL;
|
2011-02-28 09:43:22 +00:00
|
|
|
proto_tree *test_tree;
|
|
|
|
|
|
|
|
descr[0] = pChoice->descr;
|
2011-09-25 22:01:50 +00:00
|
|
|
memset(&descr[1], 0x00, sizeof(CSN_DESCR));
|
2011-09-09 17:29:20 +00:00
|
|
|
descr[1].type = CSN_END;
|
2011-02-28 09:43:22 +00:00
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
*pui8 = i;
|
|
|
|
|
2012-02-05 08:14:09 +00:00
|
|
|
if (pDescr->sz) {
|
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s Choice: %s (%d)",
|
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits8(tvb, bit_offset, no_of_bits)),
|
|
|
|
pDescr->sz, value);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!pChoice->keep_bits) {
|
|
|
|
bit_offset += no_of_bits;
|
|
|
|
remaining_bits_len -= no_of_bits;
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2012-02-05 08:14:09 +00:00
|
|
|
if (pDescr->sz) {
|
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s", pDescr->sz);
|
|
|
|
test_tree = proto_item_add_subtree(ti, ett_csn1);
|
|
|
|
} else {
|
2012-04-24 18:27:06 +00:00
|
|
|
test_tree = tree;
|
2012-02-05 08:14:09 +00:00
|
|
|
}
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
csnStreamInit(&arT, bit_offset, remaining_bits_len);
|
2012-06-14 15:50:24 +00:00
|
|
|
Status = csnStreamDissector(test_tree, &arT, (const CSN_DESCR*)descr, tvb, data, ett_csn1);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
if (Status >= 0)
|
|
|
|
{
|
2012-02-05 08:14:09 +00:00
|
|
|
if (ti)
|
|
|
|
proto_item_set_len(ti,((arT.bit_offset-1)>>3) - (bit_offset>>3)+1);
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len = arT.remaining_bits_len;
|
|
|
|
bit_offset = arT.bit_offset;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return Status;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
count--;
|
|
|
|
pChoice++;
|
|
|
|
i++;
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_SERIALIZE:
|
|
|
|
{
|
2011-02-28 15:42:58 +00:00
|
|
|
StreamSerializeFcn_t serialize = pDescr->serialize.fcn;
|
2011-02-28 09:43:22 +00:00
|
|
|
csnStream_t arT = *ar;
|
2012-01-21 20:26:46 +00:00
|
|
|
guint length_len = pDescr->i;
|
2011-02-28 09:43:22 +00:00
|
|
|
gint16 Status = -1;
|
|
|
|
proto_item *ti;
|
|
|
|
proto_tree *test_tree;
|
2012-02-05 08:14:09 +00:00
|
|
|
guint8 length = 0;
|
|
|
|
|
|
|
|
if (length_len) {
|
|
|
|
length = tvb_get_bits8(tvb, bit_offset, length_len);
|
|
|
|
|
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+length_len-1)>>3)-(bit_offset>>3)+1, "%s %s length: %d",
|
|
|
|
decode_bits_in_field(bit_offset, length_len, length),
|
|
|
|
pDescr->sz, length);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
2012-02-05 08:14:09 +00:00
|
|
|
bit_offset += length_len;
|
|
|
|
remaining_bits_len -= length_len;
|
2011-02-28 09:43:22 +00:00
|
|
|
|
2012-02-05 08:14:09 +00:00
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+length-1)>>3)-(bit_offset>>3) + 1, "%s", pDescr->sz);
|
|
|
|
} else {
|
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s", pDescr->sz);
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
test_tree = proto_item_add_subtree(ti, ett_csn1);
|
|
|
|
|
2012-02-05 08:14:09 +00:00
|
|
|
csnStreamInit(&arT, bit_offset, length > 0 ? length : remaining_bits_len);
|
2011-02-28 09:43:22 +00:00
|
|
|
Status = serialize(test_tree, &arT, tvb, pvDATA(data, pDescr->offset), ett_csn1);
|
|
|
|
|
|
|
|
if (Status >= 0)
|
|
|
|
{
|
2012-02-05 08:14:09 +00:00
|
|
|
if (length > 0) {
|
|
|
|
remaining_bits_len -= length;
|
|
|
|
bit_offset += length;
|
|
|
|
} else {
|
|
|
|
proto_item_set_len(ti,((arT.bit_offset - bit_offset)>>3)+1);
|
|
|
|
remaining_bits_len = arT.remaining_bits_len;
|
|
|
|
bit_offset = arT.bit_offset;
|
|
|
|
}
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Has already been processed: */
|
|
|
|
return Status;
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_UNION_LH:
|
|
|
|
case CSN_UNION:
|
|
|
|
{
|
|
|
|
gint16 Bits;
|
2012-06-14 15:50:24 +00:00
|
|
|
guint8 t_index;
|
2011-02-28 09:43:22 +00:00
|
|
|
gint16 count = pDescr->i;
|
|
|
|
const CSN_DESCR* pDescrNext = pDescr;
|
|
|
|
|
|
|
|
pDescrNext += count + 1; /* now this is next after the union */
|
|
|
|
if ((count <= 0) || (count > 16))
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_INVALID_UNION_INDEX, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now get the bits to extract the index */
|
|
|
|
Bits = ixBitsTab[count];
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+Bits-1)>>3)-(bit_offset>>3)+1, "%s Union:%s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, Bits, tvb_get_bits8(tvb, bit_offset, Bits)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
2012-06-14 15:50:24 +00:00
|
|
|
t_index = 0;
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
while (Bits > 0)
|
|
|
|
{
|
2012-06-14 15:50:24 +00:00
|
|
|
t_index <<= 1;
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
if (CSN_UNION_LH == pDescr->type)
|
|
|
|
{
|
2012-06-14 15:50:24 +00:00
|
|
|
t_index |= tvb_get_masked_bits8(tvb, bit_offset, 1);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2012-06-14 15:50:24 +00:00
|
|
|
t_index |= tvb_get_bits8(tvb, bit_offset, 1);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
remaining_bits_len--;
|
|
|
|
bit_offset++;
|
|
|
|
Bits--;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Assign UnionType */
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
2012-06-14 15:50:24 +00:00
|
|
|
*pui8 = t_index;
|
2011-02-28 09:43:22 +00:00
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
/* script index to continue on, limited in case we do not have a power of 2 */
|
2012-06-14 15:50:24 +00:00
|
|
|
pDescr += (MIN(t_index + 1, count));
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
|
|
|
|
switch (pDescr->type)
|
|
|
|
{ /* get the right element of the union based on computed index */
|
|
|
|
|
|
|
|
case CSN_BIT:
|
|
|
|
{
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s %s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
|
|
|
|
|
|
|
*pui8 = 0x00;
|
|
|
|
if (tvb_get_bits8(tvb, bit_offset, 1) > 0)
|
|
|
|
{
|
|
|
|
*pui8 = 0x01;
|
|
|
|
}
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len --;
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset++;
|
2011-08-30 18:34:19 +00:00
|
|
|
pDescr++;
|
2011-02-28 09:43:22 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_NULL:
|
|
|
|
{ /* Empty member! */
|
2012-09-07 07:43:13 +00:00
|
|
|
bit_offset += pDescr->i;
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_UINT:
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
|
|
|
if (remaining_bits_len >= no_of_bits)
|
|
|
|
{
|
2012-02-05 08:14:09 +00:00
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
guint8 ui8 = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
*pui8 = ui8;
|
|
|
|
proto_tree_add_bits_item(tree, *(pDescr->serialize.hf_ptr), tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
|
|
|
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 16)
|
|
|
|
{
|
|
|
|
guint16 ui16 = tvb_get_bits16(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
|
|
|
pui16 = pui16DATA(data, pDescr->offset);
|
|
|
|
*pui16 = ui16;
|
|
|
|
proto_tree_add_bits_item(tree, *(pDescr->serialize.hf_ptr), tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 32)
|
|
|
|
{
|
|
|
|
guint32 ui32 = tvb_get_bits32(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
|
|
|
pui32 = pui32DATA(data, pDescr->offset);
|
|
|
|
*pui32 = ui32;
|
|
|
|
proto_tree_add_bits_item(tree, *(pDescr->serialize.hf_ptr), tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset += no_of_bits;
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_UINT_OFFSET:
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
|
|
|
|
|
|
|
if (remaining_bits_len >= no_of_bits)
|
|
|
|
{
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
guint8 ui8 = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui8 = ui8 + (guint8)pDescr->descr.value;
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s (%d)",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, ui8),
|
2012-01-21 20:26:46 +00:00
|
|
|
pDescr->sz, ui8);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 16)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
guint16 ui16 = tvb_get_bits16(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
pui16 = pui16DATA(data, pDescr->offset);
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui16 = ui16 + (guint16)pDescr->descr.value;
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s (%d)",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, ui16),
|
2012-01-21 20:26:46 +00:00
|
|
|
pDescr->sz, ui16);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 32)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
guint32 ui32 = tvb_get_bits32(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
pui32 = pui32DATA(data, pDescr->offset);
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui32 = ui32 + (guint16)pDescr->descr.value;
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s (%d)",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, ui32),
|
2012-01-21 20:26:46 +00:00
|
|
|
pDescr->sz, ui32);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset += no_of_bits;
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_UINT_LH:
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
|
|
|
|
|
|
|
if (remaining_bits_len >= no_of_bits)
|
|
|
|
{
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
guint8 ui8 = tvb_get_masked_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
*pui8 = ui8;
|
2011-10-24 19:57:53 +00:00
|
|
|
proto_tree_add_bits_item(tree, *(pDescr->serialize.hf_ptr), tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{ /* Maybe we should support more than 8 bits ? */
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset += no_of_bits;
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_UINT_ARRAY:
|
|
|
|
{
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
2011-02-28 13:55:47 +00:00
|
|
|
guint16 nCount = (guint16)pDescr->descr.value; /* nCount supplied by value i.e. M_UINT_ARRAY(...) */
|
2011-02-28 09:43:22 +00:00
|
|
|
gint i = 0;
|
|
|
|
|
2011-02-28 15:42:58 +00:00
|
|
|
if (pDescr->serialize.value != 0)
|
2011-02-28 09:43:22 +00:00
|
|
|
{ /* nCount specified by a reference to field holding value i.e. M_VAR_UINT_ARRAY(...) */
|
|
|
|
nCount = *pui16DATA(data, nCount);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (remaining_bits_len >= no_of_bits)
|
|
|
|
{
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
while (nCount > 0)
|
|
|
|
{
|
|
|
|
*pui8 = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s[%d]",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, *pui8),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz,
|
|
|
|
i++);
|
|
|
|
pui8++;
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset += no_of_bits;
|
|
|
|
nCount--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 16)
|
|
|
|
{
|
|
|
|
pui16 = pui16DATA(data, pDescr->offset);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
while (nCount > 0)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
*pui16 = tvb_get_bits16(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s[%d]",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, *pui16),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz,
|
|
|
|
i++);
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset += no_of_bits;
|
|
|
|
nCount--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 32)
|
|
|
|
{ /* not supported */
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector NOT IMPLEMENTED", 999, pDescr);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_GENERAL, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_VARIABLE_TARRAY_OFFSET:
|
|
|
|
case CSN_VARIABLE_TARRAY:
|
|
|
|
case CSN_TYPE_ARRAY:
|
|
|
|
{
|
|
|
|
gint16 Status;
|
|
|
|
csnStream_t arT = *ar;
|
|
|
|
guint16 nCount = (guint16) pDescr->i;
|
2011-02-28 15:42:58 +00:00
|
|
|
guint16 nSize = (guint16)(guint32)pDescr->serialize.value;
|
2011-02-28 09:43:22 +00:00
|
|
|
gint i = 0;
|
|
|
|
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
if (CSN_VARIABLE_TARRAY == pDescr->type)
|
|
|
|
{ /* Count specified in field */
|
|
|
|
nCount = *pui8DATA(data, pDescr->i);
|
|
|
|
}
|
|
|
|
else if (CSN_VARIABLE_TARRAY_OFFSET == pDescr->type)
|
|
|
|
{ /* Count specified in field */
|
|
|
|
nCount = *pui8DATA(data, pDescr->i);
|
|
|
|
nCount--; /* Offset 1 */
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
while (nCount--) /* Changed to handle length = 0. */
|
|
|
|
{
|
|
|
|
proto_item *ti;
|
|
|
|
proto_tree *test_tree;
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s[%d]",pDescr->sz, i++);
|
|
|
|
test_tree = proto_item_add_subtree(ti, ett_csn1);
|
|
|
|
|
|
|
|
csnStreamInit(&arT, bit_offset, remaining_bits_len);
|
2012-06-14 15:50:24 +00:00
|
|
|
Status = csnStreamDissector(test_tree, &arT, (const CSN_DESCR *)pDescr->descr.ptr, tvb, pui8, ett_csn1);
|
2011-02-28 09:43:22 +00:00
|
|
|
if (Status >= 0)
|
|
|
|
{
|
|
|
|
pui8 += nSize;
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_item_set_len(ti,((arT.bit_offset-1)>>3) - (bit_offset>>3)+1);
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len = arT.remaining_bits_len;
|
|
|
|
bit_offset = arT.bit_offset;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return Status;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_BITMAP:
|
|
|
|
{ /* bitmap with given length. The result is left aligned! */
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i; /* length of bitmap */
|
|
|
|
|
|
|
|
if (no_of_bits > 0)
|
|
|
|
{ /* a non empty bitmap */
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits8(tvb, bit_offset, no_of_bits)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
|
|
|
remaining_bits_len -= no_of_bits;
|
2012-01-23 18:54:02 +00:00
|
|
|
bit_offset += no_of_bits;
|
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
if (remaining_bits_len < 0)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
/* bitmap was successfully extracted or it was empty */
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_TYPE:
|
|
|
|
{
|
|
|
|
gint16 Status;
|
|
|
|
csnStream_t arT = *ar;
|
|
|
|
proto_item *ti;
|
|
|
|
proto_tree *test_tree;
|
|
|
|
|
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s",pDescr->sz);
|
|
|
|
test_tree = proto_item_add_subtree(ti, ett_csn1);
|
|
|
|
|
|
|
|
csnStreamInit(&arT, bit_offset, remaining_bits_len);
|
2012-06-14 15:50:24 +00:00
|
|
|
Status = csnStreamDissector(test_tree, &arT, (const CSN_DESCR *)pDescr->descr.ptr, tvb, pvDATA(data, pDescr->offset), ett_csn1);
|
2011-02-28 09:43:22 +00:00
|
|
|
if (Status >= 0)
|
|
|
|
{
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_item_set_len(ti,((arT.bit_offset-1)>>3) - (bit_offset>>3)+1);
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len = arT.remaining_bits_len;
|
|
|
|
bit_offset = arT.bit_offset;
|
|
|
|
pDescr++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{ /* return error code Has already been processed: */
|
|
|
|
return Status;
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
default:
|
|
|
|
{ /* descriptions of union elements other than above are illegal */
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_IN_SCRIPT, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pDescr = pDescrNext;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_EXIST:
|
|
|
|
case CSN_EXIST_LH:
|
|
|
|
{
|
|
|
|
guint8 fExist;
|
|
|
|
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "Exist:%s",pDescr->sz);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
if (CSN_EXIST_LH == pDescr->type)
|
|
|
|
{
|
|
|
|
fExist = tvb_get_masked_bits8(tvb, bit_offset, 1);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
fExist = tvb_get_bits8(tvb, bit_offset, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
*pui8 = fExist;
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len --;
|
|
|
|
bit_offset++;
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr++;
|
|
|
|
|
|
|
|
if (!fExist)
|
|
|
|
{
|
|
|
|
ar->remaining_bits_len = remaining_bits_len;
|
|
|
|
ar->bit_offset = bit_offset;
|
|
|
|
return remaining_bits_len;
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_NEXT_EXIST:
|
|
|
|
{
|
|
|
|
guint8 fExist;
|
|
|
|
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
|
|
|
|
/* this if-statement represents the M_NEXT_EXIST_OR_NULL description element */
|
2012-01-21 20:26:46 +00:00
|
|
|
if ((pDescr->may_be_null) && (remaining_bits_len == 0))
|
2011-02-28 09:43:22 +00:00
|
|
|
{ /* no more bits to decode is fine here - end of message detected and allowed */
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
/* Skip i entries + this entry */
|
|
|
|
pDescr += pDescr->i + 1;
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
/* Set the data member to "not exist" */
|
|
|
|
*pui8 = 0;
|
|
|
|
break;
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
/* the "regular" M_NEXT_EXIST description element */
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s %s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
|
|
|
|
|
|
|
fExist = 0x00;
|
|
|
|
if (tvb_get_bits8(tvb, bit_offset, 1))
|
|
|
|
{
|
|
|
|
fExist = 0x01;
|
|
|
|
}
|
|
|
|
|
|
|
|
*pui8 = fExist;
|
|
|
|
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len --;
|
|
|
|
bit_offset++;
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
if (fExist == 0)
|
|
|
|
{ /* Skip 'i' entries */
|
|
|
|
pDescr += pDescr->i;
|
|
|
|
}
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_NEXT_EXIST_LH:
|
|
|
|
{
|
|
|
|
guint8 fExist;
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
|
|
|
|
/* this if-statement represents the M_NEXT_EXIST_OR_NULL_LH description element */
|
2011-02-28 13:55:47 +00:00
|
|
|
if ((pDescr->descr.ptr != NULL) && (remaining_bits_len == 0))
|
2011-02-28 09:43:22 +00:00
|
|
|
{ /* no more bits to decode is fine here - end of message detected and allowed */
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
/* skip 'i' entries + this entry */
|
|
|
|
pDescr += pDescr->i + 1;
|
|
|
|
|
|
|
|
/* set the data member to "not exist" */
|
|
|
|
*pui8 = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* the "regular" M_NEXT_EXIST_LH description element */
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s %s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
|
|
|
|
|
|
|
fExist = tvb_get_masked_bits8(tvb, bit_offset, 1);
|
|
|
|
|
|
|
|
*pui8++ = fExist;
|
|
|
|
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len --;
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset++;
|
|
|
|
|
|
|
|
if (fExist == 0)
|
|
|
|
{ /* Skip 'i' entries */
|
|
|
|
pDescr += pDescr->i;
|
|
|
|
}
|
|
|
|
pDescr++;
|
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_VARIABLE_BITMAP_1:
|
|
|
|
{ /* Bitmap from here and to the end of message */
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui8DATA(data, (gint16)pDescr->descr.value) = (guint8) remaining_bits_len; /* length of bitmap == remaining bits */
|
2011-02-28 09:43:22 +00:00
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
/*no break -
|
2011-02-28 09:43:22 +00:00
|
|
|
* with a length set we have a regular variable length bitmap so we continue */
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_VARIABLE_BITMAP:
|
|
|
|
{ /* {CSN_VARIABLE_BITMAP, 0, offsetof(_STRUCT, _ElementCountField), offsetof(_STRUCT, _MEMBER), #_MEMBER}
|
|
|
|
* <N: bit (5)> <bitmap: bit(N + offset)>
|
|
|
|
* Bit array with length (in bits) specified in parameter (pDescr->descr)
|
|
|
|
* The result is right aligned!
|
|
|
|
*/
|
2011-02-28 13:55:47 +00:00
|
|
|
gint16 no_of_bits = *pui8DATA(data, (gint16)pDescr->descr.value);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
no_of_bits += pDescr->i; /* adjusted by offset */
|
|
|
|
|
|
|
|
if (no_of_bits > 0)
|
|
|
|
{
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s",
|
2011-02-28 09:43:22 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)));
|
|
|
|
|
|
|
|
if (remaining_bits_len < 0)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
{ /* extract bits */
|
2012-06-14 15:50:24 +00:00
|
|
|
guint8* t_pui8 = pui8DATA(data, pDescr->offset);
|
2011-02-28 09:43:22 +00:00
|
|
|
gint16 nB1 = no_of_bits & 0x07;/* no_of_bits Mod 8 */
|
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
if (nB1 > 0)
|
2011-02-28 09:43:22 +00:00
|
|
|
{ /* take care of the first byte - it will be right aligned */
|
2012-06-14 15:50:24 +00:00
|
|
|
*t_pui8++ = tvb_get_bits8(tvb, bit_offset, nB1);
|
2011-02-28 09:43:22 +00:00
|
|
|
no_of_bits -= nB1;
|
|
|
|
bit_offset += nB1; /* (nB1 is no_of_bits Mod 8) */
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= nB1;
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* remaining no_of_bits is a multiple of 8 or 0 */
|
|
|
|
while (no_of_bits > 0)
|
|
|
|
{
|
2012-06-14 15:50:24 +00:00
|
|
|
*t_pui8++ = tvb_get_bits8(tvb, bit_offset, 8);
|
2011-02-28 09:43:22 +00:00
|
|
|
no_of_bits -= 8;
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= 8;
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_LEFT_ALIGNED_VAR_BMP_1:
|
|
|
|
{ /* Bitmap from here and to the end of message */
|
|
|
|
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui8DATA(data, (gint16)pDescr->descr.value) = (guint8) remaining_bits_len; /* length of bitmap == remaining bits */
|
2011-02-28 23:50:01 +00:00
|
|
|
|
|
|
|
/* no break -
|
2011-02-28 09:43:22 +00:00
|
|
|
* with a length set we have a regular left aligned variable length bitmap so we continue
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_LEFT_ALIGNED_VAR_BMP:
|
|
|
|
{ /* {CSN_LEFT_ALIGNED_VAR_BMP, _OFFSET, (void*)offsetof(_STRUCT, _ElementCountField), offsetof(_STRUCT, _MEMBER), #_MEMBER}
|
|
|
|
* <N: bit (5)> <bitmap: bit(N + offset)>
|
|
|
|
* bit array with length (in bits) specified in parameter (pDescr->descr)
|
|
|
|
*/
|
2011-02-28 13:55:47 +00:00
|
|
|
gint16 no_of_bits = *pui8DATA(data, (gint16)pDescr->descr.value);/* Size of bitmap */
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
no_of_bits += pDescr->i;/* size adjusted by offset */
|
|
|
|
|
|
|
|
if (no_of_bits > 0)
|
2011-08-26 15:25:14 +00:00
|
|
|
{
|
|
|
|
if (no_of_bits <= 32)
|
|
|
|
{
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s",
|
2012-01-05 07:17:38 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
2011-08-26 15:25:14 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 64)
|
|
|
|
{
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s",
|
2011-10-24 19:57:53 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits64(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN)),
|
2011-08-26 15:25:14 +00:00
|
|
|
pDescr->sz);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %u bits",
|
2011-08-26 15:25:14 +00:00
|
|
|
pDescr->sz, no_of_bits);
|
|
|
|
}
|
2012-01-21 20:26:46 +00:00
|
|
|
bit_offset += no_of_bits;
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
|
|
|
|
|
|
|
if (remaining_bits_len < 0)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* bitmap was successfully extracted or it was empty */
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2012-01-21 20:26:46 +00:00
|
|
|
|
|
|
|
case CSN_PADDING_BITS:
|
|
|
|
{ /* Padding from here and to the end of message */
|
|
|
|
|
|
|
|
if (remaining_bits_len > 0)
|
|
|
|
{
|
|
|
|
proto_item *ti = proto_tree_add_text(tree, tvb, bit_offset>>3, -1, "Padding Bits");
|
|
|
|
proto_tree *padding_tree = proto_item_add_subtree(ti, ett_csn1);
|
|
|
|
while (remaining_bits_len > 0)
|
|
|
|
{
|
|
|
|
guint8 bits_to_handle = remaining_bits_len + (bit_offset%8);
|
|
|
|
if (bits_to_handle > 32)
|
|
|
|
{
|
|
|
|
bits_to_handle = 32 - (bit_offset%8);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
bits_to_handle -= (bit_offset%8);
|
|
|
|
}
|
|
|
|
proto_tree_add_text(padding_tree, tvb, bit_offset>>3, ((bit_offset+bits_to_handle-1)>>3)-(bit_offset>>3)+1, "%s %s",
|
|
|
|
decode_bits_in_field(bit_offset, bits_to_handle, tvb_get_bits(tvb, bit_offset, bits_to_handle, ENC_BIG_ENDIAN)),
|
|
|
|
pDescr->sz);
|
|
|
|
bit_offset += bits_to_handle;
|
|
|
|
remaining_bits_len -= bits_to_handle;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (remaining_bits_len < 0)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Padding was successfully extracted or it was empty */
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
case CSN_VARIABLE_ARRAY:
|
|
|
|
{ /* {int type; int i; void* descr; int offset; const char* sz; } CSN_DESCR;
|
|
|
|
* {CSN_VARIABLE_ARRAY, _OFFSET, (void*)offsetof(_STRUCT, _ElementCountField), offsetof(_STRUCT, _MEMBER), #_MEMBER}
|
|
|
|
* Array with length specified in parameter:
|
|
|
|
* <count: bit (x)>
|
|
|
|
* <list: octet(count + offset)>
|
|
|
|
*/
|
2011-02-28 13:55:47 +00:00
|
|
|
gint16 count = *pui8DATA(data, (gint16)pDescr->descr.value);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
count += pDescr->i; /* Adjusted by offset */
|
|
|
|
|
|
|
|
if (count > 0)
|
|
|
|
{
|
|
|
|
if (remaining_bits_len < 0)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
|
|
|
|
while (count > 0)
|
|
|
|
{
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s %s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 8, tvb_get_bits8(tvb, bit_offset, 8)),
|
|
|
|
pDescr->sz);
|
2011-02-28 09:43:22 +00:00
|
|
|
*pui8++ = tvb_get_bits8(tvb, bit_offset, 8);
|
|
|
|
bit_offset += 8;
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= 8;
|
2011-02-28 09:43:22 +00:00
|
|
|
count--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_RECURSIVE_ARRAY:
|
2011-02-28 23:50:01 +00:00
|
|
|
{ /* Recursive way to specify an array: <list> ::= {1 <number: bit (4)> <list> | 0}
|
2011-02-28 09:43:22 +00:00
|
|
|
* or more generally: <list> ::= { <tag> <element> <list> | <EndTag> }
|
|
|
|
* where <element> ::= bit(value)
|
|
|
|
* <tag> ::= 0 | 1
|
|
|
|
* <EndTag> ::= reversed tag i.e. tag == 1 -> EndTag == 0 and vice versa
|
|
|
|
* {CSN_RECURSIVE_ARRAY, _BITS, (void*)offsetof(_STRUCT, _ElementCountField), offsetof(_STRUCT, _MEMBER), #_MEMBER}
|
|
|
|
* REMARK: recursive way to specify an array but an iterative implementation!
|
|
|
|
*/
|
|
|
|
gint16 no_of_bits = pDescr->i;
|
|
|
|
guint8 ElementCount = 0;
|
|
|
|
|
|
|
|
pui8 = pui8DATA(data, pDescr->offset);
|
|
|
|
|
|
|
|
while (existNextElement(tvb, bit_offset, Tag))
|
|
|
|
{ /* tag control shows existence of next list elements */
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s Exist:%s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
|
|
|
bit_offset++;
|
|
|
|
remaining_bits_len--;
|
|
|
|
|
|
|
|
/* extract and store no_of_bits long element from bitstream */
|
|
|
|
*pui8++ = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
ElementCount++;
|
|
|
|
|
|
|
|
if (remaining_bits_len < 0)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits8(tvb, bit_offset, no_of_bits)),
|
|
|
|
pDescr->sz);
|
2011-02-28 09:43:22 +00:00
|
|
|
bit_offset += no_of_bits;
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len -= no_of_bits;
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s Exist:%s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
|
|
|
|
|
|
|
/* existNextElement() returned FALSE, 1 bit consumed */
|
|
|
|
bit_offset++;
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len--;
|
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
/* Store the counted number of elements of the array */
|
2011-02-28 13:55:47 +00:00
|
|
|
*pui8DATA(data, (gint16)pDescr->descr.value) = ElementCount;
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_RECURSIVE_TARRAY:
|
|
|
|
{ /* Recursive way to specify an array of type: <lists> ::= { 1 <type> } ** 0 ;
|
|
|
|
* M_REC_TARRAY(_STRUCT, _MEMBER, _MEMBER_TYPE, _ElementCountField)
|
|
|
|
* {t, offsetof(_STRUCT, _ElementCountField), (void*)CSNDESCR_##_MEMBER_TYPE, offsetof(_STRUCT, _MEMBER), #_MEMBER, (StreamSerializeFcn_t)sizeof(_MEMBER_TYPE)}
|
|
|
|
*/
|
2011-02-28 15:42:58 +00:00
|
|
|
gint16 nSizeElement = (gint16)(gint32)pDescr->serialize.value;
|
2011-02-28 09:43:22 +00:00
|
|
|
guint8 ElementCount = 0;
|
|
|
|
|
|
|
|
while (existNextElement(tvb, bit_offset, Tag))
|
|
|
|
{ /* tag control shows existence of next list elements */
|
2011-03-26 05:39:45 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s Exist:%s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)),
|
2011-02-28 09:43:22 +00:00
|
|
|
pDescr->sz);
|
|
|
|
|
|
|
|
/* existNextElement() returned TRUE, 1 bit consumed */
|
|
|
|
bit_offset++;
|
|
|
|
remaining_bits_len--;
|
|
|
|
ElementCount++;
|
|
|
|
|
|
|
|
{ /* unpack the following data structure */
|
|
|
|
csnStream_t arT = *ar;
|
|
|
|
gint16 Status;
|
|
|
|
proto_item *ti;
|
|
|
|
proto_tree *test_tree;
|
|
|
|
|
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s",pDescr->sz);
|
|
|
|
test_tree = proto_item_add_subtree(ti, ett_csn1);
|
|
|
|
|
|
|
|
csnStreamInit(&arT, bit_offset, remaining_bits_len);
|
2012-06-14 15:50:24 +00:00
|
|
|
Status = csnStreamDissector(test_tree, &arT, (const CSN_DESCR *)pDescr->descr.ptr, tvb, pvDATA(data, pDescr->offset), ett_csn1);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
if (Status >= 0)
|
|
|
|
{ /* successful completion */
|
|
|
|
pui8 += nSizeElement; /* -> to next data element */
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_item_set_len(ti,((arT.bit_offset-1)>>3) - (bit_offset>>3)+1);
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len = arT.remaining_bits_len;
|
|
|
|
bit_offset = arT.bit_offset;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{ /* something went awry */
|
|
|
|
return Status;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (remaining_bits_len < 0)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
2011-02-28 23:50:01 +00:00
|
|
|
}
|
2011-02-28 09:43:22 +00:00
|
|
|
|
2011-07-26 03:52:29 +00:00
|
|
|
/* existNextElement() returned FALSE, 1 bit consumed */
|
|
|
|
bit_offset++;
|
2012-01-23 18:54:02 +00:00
|
|
|
remaining_bits_len --;
|
2011-07-26 03:52:29 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
/* Store the counted number of elements of the array */
|
|
|
|
*pui8DATA(data, (gint16)(gint32)pDescr->i) = ElementCount;
|
|
|
|
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
case CSN_RECURSIVE_TARRAY_2:
|
2011-02-28 09:43:22 +00:00
|
|
|
{ /* Recursive way to specify an array of type: <list> ::= <type> { 0 <type> } ** 1 ; */
|
|
|
|
|
|
|
|
Tag = REVERSED_TAG;
|
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
/* NO break -
|
2011-02-28 09:43:22 +00:00
|
|
|
* handling is exactly the same as for CSN_RECURSIVE_TARRAY_1 so we continue
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
|
2011-02-28 23:50:01 +00:00
|
|
|
case CSN_RECURSIVE_TARRAY_1:
|
2011-02-28 09:43:22 +00:00
|
|
|
{ /* Recursive way to specify an array of type: <lists> ::= <type> { 1 <type> } ** 0 ;
|
|
|
|
* M_REC_TARRAY(_STRUCT, _MEMBER, _MEMBER_TYPE, _ElementCountField)
|
|
|
|
* {t, offsetof(_STRUCT, _ElementCountField), (void*)CSNDESCR_##_MEMBER_TYPE, offsetof(_STRUCT, _MEMBER), #_MEMBER, (StreamSerializeFcn_t)sizeof(_MEMBER_TYPE)}
|
|
|
|
*/
|
2011-02-28 15:42:58 +00:00
|
|
|
gint16 nSizeElement = (gint16)(gint32)pDescr->serialize.value;
|
2011-02-28 09:43:22 +00:00
|
|
|
guint8 ElementCount = 0;
|
|
|
|
csnStream_t arT = *ar;
|
|
|
|
gboolean EndOfList = FALSE;
|
|
|
|
gint16 Status;
|
|
|
|
proto_item *ti;
|
|
|
|
proto_tree *test_tree;
|
|
|
|
|
|
|
|
|
|
|
|
do
|
|
|
|
{ /* get data element */
|
|
|
|
ElementCount++;
|
|
|
|
|
2012-01-21 20:26:46 +00:00
|
|
|
ti = proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s[%d]",pDescr->sz, ElementCount-1);
|
2011-02-28 09:43:22 +00:00
|
|
|
test_tree = proto_item_add_subtree(ti, ett_csn1);
|
2011-02-28 23:50:01 +00:00
|
|
|
|
2011-02-28 09:43:22 +00:00
|
|
|
csnStreamInit(&arT, bit_offset, remaining_bits_len);
|
2012-06-14 15:50:24 +00:00
|
|
|
Status = csnStreamDissector(test_tree, &arT, (const CSN_DESCR *)pDescr->descr.ptr, tvb, pvDATA(data, pDescr->offset), ett_csn1);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
if (Status >= 0)
|
|
|
|
{ /* successful completion */
|
|
|
|
pui8 += nSizeElement; /* -> to next */
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_item_set_len(ti,((arT.bit_offset-1)>>3) - (bit_offset>>3)+1);
|
2011-02-28 09:43:22 +00:00
|
|
|
remaining_bits_len = arT.remaining_bits_len;
|
|
|
|
bit_offset = arT.bit_offset;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{ /* something went awry */
|
|
|
|
return Status;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (remaining_bits_len < 0)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* control of next element's tag */
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, 1, "%s Exist:%s[%d]",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, 1, tvb_get_bits8(tvb, bit_offset, 1)),
|
2012-01-21 20:26:46 +00:00
|
|
|
pDescr->sz, ElementCount);
|
2011-02-28 09:43:22 +00:00
|
|
|
EndOfList = !(existNextElement(tvb, bit_offset, Tag));
|
|
|
|
|
|
|
|
bit_offset++;
|
|
|
|
remaining_bits_len--; /* 1 bit consumed (tag) */
|
|
|
|
} while (!EndOfList);
|
|
|
|
|
|
|
|
|
|
|
|
/* Store the count of the array */
|
|
|
|
*pui8DATA(data, pDescr->i) = ElementCount;
|
|
|
|
Tag = STANDARD_TAG; /* in case it was set to "reversed" */
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_FIXED:
|
|
|
|
{ /* Verify the fixed bits */
|
|
|
|
guint8 no_of_bits = (guint8) pDescr->i;
|
|
|
|
guint32 ui32;
|
|
|
|
|
|
|
|
if (no_of_bits <= 8)
|
|
|
|
{
|
|
|
|
ui32 = tvb_get_bits8(tvb, bit_offset, no_of_bits);
|
|
|
|
}
|
|
|
|
else if (no_of_bits <= 16)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
ui32 = tvb_get_bits16(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
|
|
|
else if (no_of_bits <= 32)
|
|
|
|
{
|
2011-10-24 19:57:53 +00:00
|
|
|
ui32 = tvb_get_bits32(tvb, bit_offset, no_of_bits, ENC_BIG_ENDIAN);
|
2011-02-28 09:43:22 +00:00
|
|
|
}
|
2011-02-28 14:54:22 +00:00
|
|
|
else
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"no_of_bits > 32", -1, pDescr);
|
|
|
|
}
|
2011-02-28 09:43:22 +00:00
|
|
|
if (ui32 != (unsigned)(gint32)pDescr->offset)
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector FIXED value does not match", -1, pDescr);
|
|
|
|
}
|
2012-01-21 20:26:46 +00:00
|
|
|
proto_tree_add_text(tree, tvb, bit_offset>>3, ((bit_offset+no_of_bits-1)>>3)-(bit_offset>>3)+1, "%s %s",
|
2011-02-28 23:50:01 +00:00
|
|
|
decode_bits_in_field(bit_offset, no_of_bits, tvb_get_bits8(tvb, bit_offset, no_of_bits)),
|
|
|
|
pDescr->sz);
|
2011-02-28 09:43:22 +00:00
|
|
|
|
|
|
|
remaining_bits_len -= no_of_bits;
|
|
|
|
bit_offset += no_of_bits;
|
|
|
|
pDescr++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_CALLBACK:
|
|
|
|
{
|
2012-02-23 08:57:40 +00:00
|
|
|
guint16 no_of_bits;
|
|
|
|
DissectorCallbackFcn_t callback = (DissectorCallbackFcn_t)pDescr->descr.ptr;
|
|
|
|
|
|
|
|
no_of_bits = callback(tree, tvb, pvDATA(data, pDescr->i), pvDATA(data, pDescr->offset), bit_offset, ett_csn1);
|
|
|
|
bit_offset += no_of_bits;
|
2012-04-24 18:27:06 +00:00
|
|
|
|
2012-02-23 08:57:40 +00:00
|
|
|
pDescr++;
|
2011-02-28 09:43:22 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_TRAP_ERROR:
|
|
|
|
{
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", pDescr->i, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
case CSN_END:
|
|
|
|
{
|
|
|
|
ar->remaining_bits_len = remaining_bits_len;
|
|
|
|
ar->bit_offset = bit_offset;
|
|
|
|
return remaining_bits_len;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
{
|
|
|
|
DISSECTOR_ASSERT(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
} while (remaining_bits_len >= 0);
|
|
|
|
|
|
|
|
return ProcessError(tree, tvb, bit_offset,"csnStreamDissector", CSN_ERROR_NEED_MORE_BITS_TO_UNPACK, pDescr);
|
|
|
|
}
|
|
|
|
|
|
|
|
|