cf91fdf16b
a protocol tree; the column values. This includes stats-tree listeners. Have the routines to build the packet list, and to retap packets, honor those requirements. This means that cf_retap_packets() no longer needs an argument to specify whether to construct the column values or not, so get rid of that argument. This also means that there's no need for a tap to have a fake filter to ensure that the protocol tree will be built, so don't set up a fake "frame" filter. While we're at it, clean up some cases where "no filter" was represented as a null string rather than a null pointer. Have a routine to return an indication of the number of tap listeners with filters; use that rather than the global num_tap_filters. Clean up some indentation and some gboolean vs. gint items. svn path=/trunk/; revision=28645
207 lines
5.4 KiB
C
207 lines
5.4 KiB
C
/* stats_tree_priv.h
|
|
* implementor's API for stats_tree
|
|
* 2005, Luis E. G. Ontanon
|
|
*
|
|
* $Id$
|
|
*
|
|
* Wireshark - Network traffic analyzer
|
|
* By Gerald Combs <gerald@wireshark.org>
|
|
* 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 {
|
|
gchar* abbr;
|
|
gchar* name;
|
|
gchar* tapname;
|
|
register_stat_group_t stat_group;
|
|
|
|
gboolean in_use;
|
|
|
|
/* dissector defined callbacks */
|
|
stat_tree_packet_cb packet;
|
|
stat_tree_init_cb init;
|
|
stat_tree_cleanup_cb cleanup;
|
|
|
|
/* tap listener flags for the per-packet callback */
|
|
guint flags;
|
|
|
|
/*
|
|
* 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 gchar *stats_tree_get_abbr(const gchar *optarg);
|
|
|
|
/* obtains a stats tree from the registry given its abbr */
|
|
extern stats_tree_cfg *stats_tree_get_cfg_by_abbr(gchar *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,
|
|
gchar *value,
|
|
gchar *rate,
|
|
gchar *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 gchar *stats_tree_node_to_str(const stat_node *node,
|
|
gchar *buffer, guint len);
|
|
|
|
#endif /* __STATS_TREE_PRIV_H */
|