93 lines
2.9 KiB
C
93 lines
2.9 KiB
C
|
/* drange.h
|
||
|
* Routines for providing general range support to the dfilter library
|
||
|
*
|
||
|
* $Id: drange.h,v 1.1 2001/02/27 19:23:28 gram Exp $
|
||
|
*
|
||
|
* Copyright (c) 2000 by Ed Warnicke <hagbard@physics.rutgers.edu>
|
||
|
*
|
||
|
* Ethereal - Network traffic analyzer
|
||
|
* By Gerald Combs
|
||
|
* Copyright 1999 Gerald Combs
|
||
|
* This program is free software; you can redistribute it and/or
|
||
|
* modify it under the terms of the GNU General Public License
|
||
|
* as published by the Free Software Foundation; either version 2
|
||
|
* of the License, or (at your option) any later version.
|
||
|
*
|
||
|
* This program is distributed in the hope that it will be useful,
|
||
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
* GNU General Public License for more details.
|
||
|
*
|
||
|
* You should have received a copy of the GNU General Public License
|
||
|
* along with this program; if not, write to the Free Software
|
||
|
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
||
|
*/
|
||
|
|
||
|
#ifndef __DRANGE_H__
|
||
|
#define __DRANGE_H__
|
||
|
|
||
|
#include <glib.h>
|
||
|
|
||
|
/* Please don't directly manipulate these structs. Please use
|
||
|
* the methods provided. If you REALLY can't do what you need to
|
||
|
* do with the methods provided please write new methods that do
|
||
|
* what you need, put them into the drange object here, and limit
|
||
|
* your direct manipulation of the drange and drange_node structs to
|
||
|
* here.
|
||
|
*/
|
||
|
|
||
|
typedef struct _drange_node {
|
||
|
gint offset;
|
||
|
gint length;
|
||
|
gboolean to_the_end;
|
||
|
} drange_node;
|
||
|
|
||
|
typedef struct _drange {
|
||
|
GSList* range_list;
|
||
|
gboolean has_total_length;
|
||
|
gint total_length;
|
||
|
gint min_offset;
|
||
|
gint max_offset;
|
||
|
} drange;
|
||
|
|
||
|
/* drange_node constructor */
|
||
|
drange_node* drange_node_new();
|
||
|
|
||
|
/* drange_node destructor */
|
||
|
void drange_node_free(drange_node* drnode);
|
||
|
|
||
|
/* Call drange_node destructor on all list items */
|
||
|
void drange_node_free_list(GSList* list);
|
||
|
|
||
|
/* drange_node accessors */
|
||
|
gint drange_node_get_offset(drange_node* drnode);
|
||
|
gint drange_node_get_length(drange_node* drnode);
|
||
|
gboolean drange_node_get_to_the_end(drange_node* drnode);
|
||
|
|
||
|
/* drange_node mutators */
|
||
|
void drange_node_set_offset(drange_node* drnode, gint offset);
|
||
|
void drange_node_set_length(drange_node* drnode, gint length);
|
||
|
void drange_node_set_to_the_end(drange_node* drnode, gboolean to_the_end);
|
||
|
|
||
|
/* drange constructor */
|
||
|
drange* drange_new();
|
||
|
drange* drange_new_from_list(GSList *list);
|
||
|
|
||
|
/* drange destructor, only use this if you used drange_new() to creat
|
||
|
* the drange
|
||
|
*/
|
||
|
void drange_free(drange* dr);
|
||
|
|
||
|
/* drange accessors */
|
||
|
gboolean drange_has_total_length(drange* dr);
|
||
|
gint drange_get_total_length(drange* dr);
|
||
|
gint drange_get_min_offset(drange* dr);
|
||
|
gint drange_get_max_offset(drange* dr);
|
||
|
|
||
|
/* drange mutators */
|
||
|
void drange_append_drange_node(drange* dr, drange_node* drnode);
|
||
|
void drange_prepend_drange_node(drange* dr, drange_node* drnode);
|
||
|
void drange_foreach_drange_node(drange* dr, GFunc func, gpointer funcdata);
|
||
|
|
||
|
#endif /* ! __DRANGE_H__ */
|