2 * implementor's API for stats_tree
3 * 2005, Luis E. G. Ontanon
7 * Wireshark - Network traffic analyzer
8 * By Gerald Combs <gerald@wireshark.org>
9 * Copyright 1998 Gerald Combs
11 * This program is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU General Public License
13 * as published by the Free Software Foundation; either version 2
14 * of the License, or (at your option) any later version.
16 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 * GNU General Public License for more details.
21 * You should have received a copy of the GNU General Public License
22 * along with this program; if not, write to the Free Software
23 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
26 #ifndef __STATS_TREE_PRIV_H
27 #define __STATS_TREE_PRIV_H
29 #include "stats_tree.h"
32 #define NUM_BUF_SIZE 32
34 /* implementations should define this to contain its own node related data
35 * as well as some operations on it */
36 typedef struct _st_node_pres st_node_pres;
38 /* implementations should define this to contain its own dynamic tree related data
39 * as well as some operations on it */
40 typedef struct _tree_pres tree_pres;
42 /* implementations should define this to contain its own static tree related data
43 * as well as some operations on it */
44 typedef struct _tree_cfg_pres tree_cfg_pres;
47 typedef struct _stat_node stat_node;
48 typedef struct _stats_tree_cfg stats_tree_cfg;
50 typedef struct _range_pair {
59 /* the counter it keeps */
62 /* children nodes by name */
65 /* the owner of this node */
73 /* used to check if value is within range */
76 /* node presentation data */
81 /* the "class" from which it's derived */
90 /* used to lookup named parents:
91 * key: parent node name
96 /* used for quicker lookups of parent nodes */
100 * tree representation
101 * to be defined (if needed) by the implementations
105 /* every tree in nature has one */
109 struct _stats_tree_cfg {
113 register_stat_group_t stat_group;
117 /* dissector defined callbacks */
118 stat_tree_packet_cb packet;
119 stat_tree_init_cb init;
120 stat_tree_cleanup_cb cleanup;
123 * node presentation callbacks
126 /* last to be called at node creation */
127 void (*setup_node_pr)(stat_node*);
129 /* last to be called at node destruction */
130 void (*free_node_pr)(stat_node*);
132 /* to be called for every node in the tree */
133 void (*draw_node)(stat_node*);
134 void (*reset_node)(stat_node*);
137 * tree presentation callbacks
142 tree_pres *(*new_tree_pr)(stats_tree*);
143 void (*free_tree_pr)(stats_tree*);
144 void (*draw_tree)(stats_tree*);
145 void (*reset_tree)(stats_tree*);
148 /* guess what, this is it! */
149 extern void stats_tree_presentation(void (*registry_iterator)(gpointer,gpointer,gpointer),
150 void (*setup_node_pr)(stat_node*),
151 void (*free_node_pr)(stat_node*),
152 void (*draw_node)(stat_node*),
153 void (*reset_node)(stat_node*),
154 tree_pres *(*new_tree_pr)(stats_tree*),
155 void (*free_tree_pr)(stats_tree*),
156 void (*draw_tree)(stats_tree*),
157 void (*reset_tree)(stats_tree*),
160 extern stats_tree *stats_tree_new(stats_tree_cfg *cfg, tree_pres *pr, char *filter);
162 /* callback for taps */
163 extern int stats_tree_packet(void*, packet_info*, epan_dissect_t*, const void *);
165 /* callback for reset */
166 extern void stats_tree_reset(void *p_st);
168 /* callback for clear */
169 extern void stats_tree_reinit(void *p_st);
171 /* callback for destoy */
172 extern void stats_tree_free(stats_tree *st);
174 /* given an optarg splits the abbr part
175 and returns a newly allocated buffer containing it */
176 extern gchar *stats_tree_get_abbr(const gchar *optarg);
178 /* obtains a stats tree from the registry given its abbr */
179 extern stats_tree_cfg *stats_tree_get_cfg_by_abbr(gchar *abbr);
181 /* extracts node data as strings from a stat_node into
182 the buffers given by value, rate and precent
183 if NULL they are ignored */
184 extern void stats_tree_get_strs_from_node(const stat_node *node,
189 /* populates the given GString with a tree representation of a branch given by node,
190 using indent spaces as indentation */
191 extern void stats_tree_branch_to_str(const stat_node *node,
195 /* used to calcuate the size of the indentation and the longest string */
196 extern guint stats_tree_branch_max_namelen(const stat_node *node, guint indent);
198 /* a text representation of a node,
199 if buffer is NULL returns a newly allocated string */
200 extern gchar *stats_tree_node_to_str(const stat_node *node,
201 gchar *buffer, guint len);
203 #endif /* __STATS_TREE_PRIV_H */