1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
|
/* drange.h
* Routines for providing general range support to the dfilter library
*
* $Id: drange.h,v 1.3 2002/08/28 20:40:55 jmayer 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 enum {
UNINITIALIZED,
LENGTH,
OFFSET,
TO_THE_END
} drange_node_end_t;
typedef struct _drange_node {
gint start_offset;
gint length;
gint end_offset;
drange_node_end_t ending;
} drange_node;
typedef struct _drange {
GSList* range_list;
gboolean has_total_length;
gint total_length;
gint min_start_offset;
gint max_start_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_start_offset(drange_node* drnode);
gint drange_node_get_length(drange_node* drnode);
gint drange_node_get_end_offset(drange_node* drnode);
drange_node_end_t drange_node_get_ending(drange_node* drnode);
/* drange_node mutators */
void drange_node_set_start_offset(drange_node* drnode, gint offset);
void drange_node_set_length(drange_node* drnode, gint length);
void drange_node_set_end_offset(drange_node* drnode, gint offset);
void drange_node_set_to_the_end(drange_node* drnode);
/* 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_start_offset(drange* dr);
gint drange_get_max_start_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__ */
|
