2 * Routines for calculating statistics based on protocol.
4 * $Id: proto_hier_stats.c,v 1.22 2004/01/21 22:00:28 ulfl Exp $
6 * Ethereal - Network traffic analyzer
7 * By Gerald Combs <gerald@ethereal.com>
8 * Copyright 1998 Gerald Combs
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public License
12 * as published by the Free Software Foundation; either version 2
13 * of the License, or (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
30 #include "proto_hier_stats.h"
31 #include "progress_dlg.h"
32 #include "simple_dialog.h"
33 #include <epan/epan_dissect.h>
39 /* Update the progress bar this many times when scanning the packet list. */
40 #define N_PROGBAR_UPDATES 100
42 #define STAT_NODE_STATS(n) ((ph_stats_node_t*)(n)->data)
43 #define STAT_NODE_HFINFO(n) (STAT_NODE_STATS(n)->hfinfo)
46 find_stat_node(GNode *parent_stat_node, header_field_info *needle_hfinfo)
48 GNode *needle_stat_node;
49 header_field_info *hfinfo;
50 ph_stats_node_t *stats;
52 needle_stat_node = g_node_first_child(parent_stat_node);
54 while (needle_stat_node) {
55 hfinfo = STAT_NODE_HFINFO(needle_stat_node);
56 if (hfinfo && hfinfo->id == needle_hfinfo->id) {
57 return needle_stat_node;
59 needle_stat_node = g_node_next_sibling(needle_stat_node);
62 /* None found. Create one. */
63 stats = g_new(ph_stats_node_t, 1);
65 /* Intialize counters */
66 stats->hfinfo = needle_hfinfo;
67 stats->num_pkts_total = 0;
68 stats->num_pkts_last = 0;
69 stats->num_bytes_total = 0;
70 stats->num_bytes_last = 0;
72 needle_stat_node = g_node_new(stats);
73 g_node_append(parent_stat_node, needle_stat_node);
74 return needle_stat_node;
79 process_node(proto_node *ptree_node, GNode *parent_stat_node, ph_stats_t *ps, guint pkt_len)
82 ph_stats_node_t *stats;
83 proto_node *proto_sibling_node;
86 finfo = PITEM_FINFO(ptree_node);
89 stat_node = find_stat_node(parent_stat_node, finfo->hfinfo);
91 /* Assert that the finfo is related to a protocol, not a field. */
92 g_assert(finfo->hfinfo->parent == -1);
94 stats = STAT_NODE_STATS(stat_node);
95 stats->num_pkts_total++;
96 stats->num_bytes_total += pkt_len;
98 proto_sibling_node = ptree_node->next;
100 if (proto_sibling_node) {
101 process_node(proto_sibling_node, stat_node, ps, pkt_len);
104 stats->num_pkts_last++;
105 stats->num_bytes_last += pkt_len;
112 process_tree(proto_tree *protocol_tree, ph_stats_t* ps, guint pkt_len)
114 proto_node *ptree_node;
116 ptree_node = ((proto_node *)protocol_tree)->first_child;
121 process_node(ptree_node, ps->stats_tree, ps, pkt_len);
125 process_frame(frame_data *frame, column_info *cinfo, ph_stats_t* ps)
128 union wtap_pseudo_header phdr;
129 guint8 pd[WTAP_MAX_PACKET_SIZE];
132 /* Load the frame from the capture file */
133 if (!wtap_seek_read(cfile.wth, frame->file_off, &phdr, pd,
134 frame->cap_len, &err)) {
135 simple_dialog(ESD_TYPE_CRIT, NULL,
136 file_read_error_message(err), cfile.filename);
137 return FALSE; /* failure */
140 /* Dissect the frame */
141 edt = epan_dissect_new(TRUE, FALSE);
142 epan_dissect_run(edt, &phdr, pd, frame, cinfo);
144 /* Get stats from this protocol tree */
145 process_tree(edt->tree, ps, frame->pkt_len);
147 /* Free our memory. */
148 epan_dissect_free(edt);
150 return TRUE; /* success */
160 guint tot_packets, tot_bytes;
161 progdlg_t *progbar = NULL;
166 gchar status_str[100];
167 int progbar_nextstep;
170 /* Initialize the data */
171 ps = g_new(ph_stats_t, 1);
174 ps->stats_tree = g_node_new(NULL);
176 /* Update the progress bar when it gets to this value. */
177 progbar_nextstep = 0;
178 /* When we reach the value that triggers a progress bar update,
179 bump that value by this amount. */
180 progbar_quantum = cfile.count/N_PROGBAR_UPDATES;
181 /* Count of packets at which we've looked. */
185 g_get_current_time(&start_time);
190 for (frame = cfile.plist; frame != NULL; frame = frame->next) {
191 /* Update the progress bar, but do it only N_PROGBAR_UPDATES
192 times; when we update it, we have to run the GTK+ main
193 loop to get it to repaint what's pending, and doing so
194 may involve an "ioctl()" to see if there's any pending
195 input from an X server, and doing that for every packet
196 can be costly, especially on a big file. */
197 if (count >= progbar_nextstep) {
198 /* let's not divide by zero. I should never be started
199 * with count == 0, so let's assert that
201 g_assert(cfile.count > 0);
203 prog_val = (gfloat) count / cfile.count;
206 /* Create the progress bar if necessary */
207 progbar = delayed_create_progress_dlg(
208 "Computing", "protocol hierarchy statistics",
209 &stop_flag, &start_time, prog_val);
211 if (progbar != NULL) {
212 g_snprintf(status_str, sizeof(status_str),
213 "%4u of %u frames", count, cfile.count);
214 update_progress_dlg(progbar, prog_val, status_str);
217 progbar_nextstep += progbar_quantum;
221 /* Well, the user decided to abort the statistics.
222 computation process Just stop. */
226 /* Skip frames that are hidden due to the display filter.
227 XXX - should the progress bar count only packets that
228 passed the display filter? If so, it should
229 probably do so for other loops (see "file.c") that
230 look only at those packets. */
231 if (frame->flags.passed_dfilter) {
232 if (!process_frame(frame, &cfile.cinfo, ps)) {
234 * Give up, and set "stop_flag" so we
235 * just abort rather than popping up
236 * the statistics window.
243 tot_bytes += frame->pkt_len;
249 /* We're done calculating the statistics; destroy the progress bar
250 if it was created. */
252 destroy_progress_dlg(progbar);
256 * We quit in the middle; throw away the statistics
257 * and return NULL, so our caller doesn't pop up a
258 * window with the incomplete statistics.
264 ps->tot_packets = tot_packets;
265 ps->tot_bytes = tot_bytes;
271 stat_node_free(GNode *node, gpointer data _U_)
273 ph_stats_node_t *stats = node->data;
282 ph_stats_free(ph_stats_t *ps)
285 if (ps->stats_tree) {
286 g_node_traverse(ps->stats_tree, G_IN_ORDER,
288 stat_node_free, NULL);
289 g_node_destroy(ps->stats_tree);