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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
/* stats_tree_priv.h
* implementor's API for stats_tree
* 2005, Luis E. G. Ontanon
*
* $Id$
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@ethereal.com>
* 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
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef __STATS_TREE_PRIV_H
#define __STATS_TREE_PRIV_H
#include "stats_tree.h"
#define INDENT_MAX 32
#define NUM_BUF_SIZE 32
/* implementations should define this to contain its own node related data
* as well as some operations on it */
typedef struct _st_node_pres st_node_pres;
/* implementations should define this to contain its own dynamic tree related data
* as well as some operations on it */
typedef struct _tree_pres tree_pres;
/* implementations should define this to contain its own static tree related data
* as well as some operations on it */
typedef struct _tree_cfg_pres tree_cfg_pres;
typedef struct _stat_node stat_node;
typedef struct _stats_tree_cfg stats_tree_cfg;
typedef struct _range_pair {
gint floor;
gint ceil;
} range_pair_t;
struct _stat_node {
gchar* name;
int id;
/* the counter it keeps */
gint counter;
/* children nodes by name */
GHashTable* hash;
/* the owner of this node */
stats_tree* st;
/* relatives */
stat_node* parent;
stat_node* children;
stat_node* next;
/* used to check if value is within range */
range_pair_t* rng;
/* node presentation data */
st_node_pres* pr;
};
struct _stats_tree {
/* the "class" from which it's derived */
stats_tree_cfg* cfg;
char* filter;
/* times */
double start;
double elapsed;
/* used to lookup named parents:
* key: parent node name
* value: parent node
*/
GHashTable* names;
/* used for quicker lookups of parent nodes */
GPtrArray* parents;
/*
* tree representation
* to be defined (if needed) by the implementations
*/
tree_pres* pr;
/* every tree in nature has one */
stat_node root;
};
struct _stats_tree_cfg {
guint8* abbr;
guint8* name;
guint8* tapname;
gboolean in_use;
/* dissector defined callbacks */
stat_tree_packet_cb packet;
stat_tree_init_cb init;
stat_tree_cleanup_cb cleanup;
/*
* node presentation callbacks
*/
/* last to be called at node creation */
void (*setup_node_pr)(stat_node*);
/* last to be called at node destruction */
void (*free_node_pr)(stat_node*);
/* to be called for every node in the tree */
void (*draw_node)(stat_node*);
void (*reset_node)(stat_node*);
/*
* tree presentation callbacks
*/
tree_cfg_pres* pr;
tree_pres* (*new_tree_pr)(stats_tree*);
void (*free_tree_pr)(stats_tree*);
void (*draw_tree)(stats_tree*);
void (*reset_tree)(stats_tree*);
};
/* guess what, this is it! */
extern void stats_tree_presentation(void (*registry_iterator)(gpointer,gpointer,gpointer),
void (*setup_node_pr)(stat_node*),
void (*free_node_pr)(stat_node*),
void (*draw_node)(stat_node*),
void (*reset_node)(stat_node*),
tree_pres* (*new_tree_pr)(stats_tree*),
void (*free_tree_pr)(stats_tree*),
void (*draw_tree)(stats_tree*),
void (*reset_tree)(stats_tree*),
void* data);
extern stats_tree* stats_tree_new(stats_tree_cfg* cfg, tree_pres* pr, char* filter);
/* callback for taps */
extern int stats_tree_packet(void*, packet_info*, epan_dissect_t*, const void *);
/* callback for reset */
extern void stats_tree_reset(void* p_st);
/* callback for clear */
extern void stats_tree_reinit(void* p_st);
/* callback for destoy */
extern void stats_tree_free(stats_tree* st);
/* given an optarg splits the abbr part
and returns a newly allocated buffer containing it */
extern guint8* stats_tree_get_abbr(const guint8* optarg);
/* obtains a stats tree from the registry given its abbr */
extern stats_tree_cfg* stats_tree_get_cfg_by_abbr(guint8* abbr);
/* extracts node data as strings from a stat_node into
the buffers given by value, rate and precent
if NULL they are ignored */
extern void stats_tree_get_strs_from_node(const stat_node* node,
guint8* value,
guint8* rate,
guint8* percent);
/* populates the given GString with a tree representation of a branch given by node,
using indent spaces as indentation */
extern void stats_tree_branch_to_str(const stat_node* node,
GString* s,
guint indent);
/* used to calcuate the size of the indentation and the longest string */
extern guint stats_tree_branch_max_namelen(const stat_node* node, guint indent);
/* a text representation of a node,
if buffer is NULL returns a newly allocated string */
extern guint8* stats_tree_node_to_str(const stat_node* node,
guint8* buffer, guint len);
#endif /* __STATS_TREE_PRIV_H */
|
