2000-07-28 20:03:59 +00:00
|
|
|
/* ptvcursor.h
|
2002-08-28 21:04:11 +00:00
|
|
|
*
|
2000-07-28 20:03:59 +00:00
|
|
|
* Proto Tree TVBuff cursor
|
2001-11-13 23:55:44 +00:00
|
|
|
* Gilbert Ramirez <gram@alumni.rice.edu>
|
2000-07-28 20:03:59 +00:00
|
|
|
*
|
2004-07-18 00:24:25 +00:00
|
|
|
* $Id$
|
2000-07-28 20:03:59 +00:00
|
|
|
*
|
2006-05-21 05:12:17 +00:00
|
|
|
* Wireshark - Network traffic analyzer
|
|
|
|
* By Gerald Combs <gerald@wireshark.org>
|
2000-07-28 20:03:59 +00:00
|
|
|
* Copyright 2000 Gerald Combs
|
2002-08-28 21:04:11 +00:00
|
|
|
*
|
2000-07-28 20:03:59 +00:00
|
|
|
* 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.
|
2002-08-28 21:04:11 +00:00
|
|
|
*
|
2000-07-28 20:03:59 +00:00
|
|
|
* 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.
|
2002-08-28 21:04:11 +00:00
|
|
|
*
|
2000-07-28 20:03:59 +00:00
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2000-08-11 13:37:21 +00:00
|
|
|
#ifndef __PTVCURSOR_H__
|
|
|
|
#define __PTVCURSOR_H__
|
|
|
|
|
2000-07-28 20:03:59 +00:00
|
|
|
#include <glib.h>
|
2002-01-21 07:37:49 +00:00
|
|
|
#include <epan/packet.h>
|
2000-07-28 20:03:59 +00:00
|
|
|
|
2007-03-30 00:21:39 +00:00
|
|
|
#define SUBTREE_UNDEFINED_LENGTH -1
|
|
|
|
|
2000-07-28 20:03:59 +00:00
|
|
|
typedef struct ptvcursor ptvcursor_t;
|
|
|
|
|
|
|
|
/* Allocates an initializes a ptvcursor_t with 3 variables:
|
2008-05-20 06:28:12 +00:00
|
|
|
* proto_tree, tvbuff, and offset. */
|
2000-07-28 20:03:59 +00:00
|
|
|
ptvcursor_t*
|
2008-05-20 06:28:12 +00:00
|
|
|
ptvcursor_new(proto_tree* tree, tvbuff_t* tvb, gint offset);
|
2000-07-28 20:03:59 +00:00
|
|
|
|
|
|
|
/* Gets data from tvbuff, adds it to proto_tree, increments offset,
|
|
|
|
* and returns proto_item* */
|
|
|
|
proto_item*
|
2008-05-20 06:28:12 +00:00
|
|
|
ptvcursor_add(ptvcursor_t* ptvc, int hf, gint length, gboolean endianness);
|
2000-07-28 20:03:59 +00:00
|
|
|
|
2002-01-10 04:44:34 +00:00
|
|
|
|
|
|
|
/* Gets data from tvbuff, adds it to proto_tree, *DOES NOT* increment
|
|
|
|
* offset, and returns proto_item* */
|
|
|
|
proto_item*
|
2008-05-20 06:28:12 +00:00
|
|
|
ptvcursor_add_no_advance(ptvcursor_t* ptvc, int hf, gint length, gboolean endianness);
|
2002-01-10 04:44:34 +00:00
|
|
|
|
2002-05-09 23:50:34 +00:00
|
|
|
/* Advance the ptvcursor's offset within its tvbuff without
|
|
|
|
* adding anything to the proto_tree. */
|
|
|
|
void
|
|
|
|
ptvcursor_advance(ptvcursor_t* ptvc, gint length);
|
|
|
|
|
2000-07-28 20:03:59 +00:00
|
|
|
/* Frees memory for ptvcursor_t, but nothing deeper than that. */
|
|
|
|
void
|
2008-05-20 06:28:12 +00:00
|
|
|
ptvcursor_free(ptvcursor_t* ptvc);
|
2000-07-28 20:03:59 +00:00
|
|
|
|
2002-01-10 04:44:34 +00:00
|
|
|
/* Returns tvbuff. */
|
|
|
|
tvbuff_t*
|
2008-05-20 06:28:12 +00:00
|
|
|
ptvcursor_tvbuff(ptvcursor_t* ptvc);
|
2002-01-10 04:44:34 +00:00
|
|
|
|
|
|
|
/* Returns current offset. */
|
|
|
|
gint
|
2008-05-20 06:28:12 +00:00
|
|
|
ptvcursor_current_offset(ptvcursor_t* ptvc);
|
2002-01-10 04:44:34 +00:00
|
|
|
|
2002-05-09 23:50:34 +00:00
|
|
|
/* Returns the proto_tree* */
|
|
|
|
proto_tree*
|
|
|
|
ptvcursor_tree(ptvcursor_t* ptvc);
|
|
|
|
|
|
|
|
/* Sets a new proto_tree* for the ptvcursor_t */
|
|
|
|
void
|
2008-05-20 06:28:12 +00:00
|
|
|
ptvcursor_set_tree(ptvcursor_t* ptvc, proto_tree* tree);
|
2002-05-09 23:50:34 +00:00
|
|
|
|
2007-03-30 00:21:39 +00:00
|
|
|
/* push a subtree in the tree stack of the cursor */
|
2008-05-20 06:28:12 +00:00
|
|
|
proto_tree*
|
|
|
|
ptvcursor_push_subtree(ptvcursor_t* ptvc, proto_item* it, gint ett_subtree);
|
2007-03-30 00:21:39 +00:00
|
|
|
|
|
|
|
/* pop a subtree in the tree stack of the cursor */
|
2008-05-20 06:28:12 +00:00
|
|
|
void
|
|
|
|
ptvcursor_pop_subtree(ptvcursor_t* ptvc);
|
2007-03-30 00:21:39 +00:00
|
|
|
|
|
|
|
/* Add an item to the tree and create a subtree
|
|
|
|
* If the length is unknown, length may be defined as SUBTREE_UNDEFINED_LENGTH.
|
|
|
|
* In this case, when the subtree will be closed, the parent item length will
|
|
|
|
* be equal to the advancement of the cursor since the creation of the subtree.
|
|
|
|
*/
|
2008-05-20 06:28:12 +00:00
|
|
|
proto_tree*
|
|
|
|
ptvcursor_add_with_subtree(ptvcursor_t* ptvc, int hfindex, gint length,
|
|
|
|
gboolean little_endian, gint ett_subtree);
|
2007-03-30 00:21:39 +00:00
|
|
|
|
|
|
|
/* Add a text node to the tree and create a subtree
|
|
|
|
* If the length is unknown, length may be defined as SUBTREE_UNDEFINED_LENGTH.
|
|
|
|
* In this case, when the subtree will be closed, the item length will be equal
|
|
|
|
* to the advancement of the cursor since the creation of the subtree.
|
|
|
|
*/
|
2008-05-20 06:28:12 +00:00
|
|
|
proto_tree*
|
|
|
|
ptvcursor_add_text_with_subtree(ptvcursor_t* ptvc, gint length,
|
|
|
|
gint ett_subtree, const char* format, ...);
|
2007-03-30 00:21:39 +00:00
|
|
|
|
|
|
|
/* Creates a subtree and adds it to the cursor as the working tree but does not
|
|
|
|
* save the old working tree */
|
2008-05-20 06:28:12 +00:00
|
|
|
proto_tree*
|
|
|
|
ptvcursor_set_subtree(ptvcursor_t* ptvc, proto_item* it, gint ett_subtree);
|
2007-03-30 00:21:39 +00:00
|
|
|
|
2000-07-28 20:03:59 +00:00
|
|
|
#endif /* __PTVCURSOR_H__ */
|