aboutsummaryrefslogtreecommitdiffstats
path: root/gtk/service_response_time_table.c
diff options
context:
space:
mode:
authorRonnie Sahlberg <ronnie_sahlberg@ozemail.com.au>2003-06-21 01:42:46 +0000
committerRonnie Sahlberg <ronnie_sahlberg@ozemail.com.au>2003-06-21 01:42:46 +0000
commitdea1a0a6e46299b799395a0e40fef7beb9839858 (patch)
tree27280932b0a12e10a02acb2ddd18086105e4c1fe /gtk/service_response_time_table.c
parent8d241c2d68ebb33ba0546587118299c1abe3a6ce (diff)
Break out the code for the ahndling of the Service Response Time (formerly known as RoundTripTime) table and change the table into a scrollable
CList. As a first conversion to use the helper routines, convert DCERPC SRT statistics to use the new interface. This prevents some interfaces (SAMR/LSA) that contains a huge number of procedures from creating a huge table that does not fir on the screen. Later changes to the helpers may be to make the different columns sortable or to hide those procedures that has not been seen in the capture. svn path=/trunk/; revision=7903
Diffstat (limited to 'gtk/service_response_time_table.c')
-rw-r--r--gtk/service_response_time_table.c234
1 files changed, 234 insertions, 0 deletions
diff --git a/gtk/service_response_time_table.c b/gtk/service_response_time_table.c
new file mode 100644
index 0000000000..2b89f80098
--- /dev/null
+++ b/gtk/service_response_time_table.c
@@ -0,0 +1,234 @@
+/* service_response_time_table.c
+ * service_response_time_table 2003 Ronnie Sahlberg
+ * Helper routines common to all service response time statistics
+ * tap.
+ *
+ * $Id: service_response_time_table.c,v 1.1 2003/06/21 01:42:45 sahlberg Exp $
+ *
+ * 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.
+ */
+
+#ifdef HAVE_CONFIG_H
+# include "config.h"
+#endif
+
+#include <gtk/gtk.h>
+#include "epan/packet_info.h"
+#include "service_response_time_table.h"
+
+
+void
+init_srt_table(srt_stat_table *rst, int num_procs, GtkWidget *vbox)
+{
+ int i, j;
+ char *title[] = { "Index", "Procedure", "Calls", "Min SRT", "Max SRT", "Avg SRT" };
+
+ rst->scrolled_window=gtk_scrolled_window_new(NULL, NULL);
+ gtk_scrolled_window_set_policy(GTK_SCROLLED_WINDOW(rst->scrolled_window), GTK_POLICY_AUTOMATIC, GTK_POLICY_ALWAYS);
+ gtk_box_pack_start(GTK_BOX(vbox), rst->scrolled_window, TRUE, TRUE, 0);
+ gtk_widget_show(rst->scrolled_window);
+
+
+ rst->table=(GtkCList *)gtk_clist_new_with_titles(6, title);
+
+ /*XXX instead of this we should probably have some code to
+ dynamically adjust the width of the columns */
+ gtk_clist_set_column_width(rst->table, 0, 32);
+ gtk_clist_set_column_width(rst->table, 1, 160);
+ gtk_clist_set_column_width(rst->table, 2, 50);
+ gtk_clist_set_column_width(rst->table, 3, 60);
+ gtk_clist_set_column_width(rst->table, 4, 60);
+ gtk_clist_set_column_width(rst->table, 5, 60);
+
+ gtk_clist_set_shadow_type(rst->table, GTK_SHADOW_IN);
+ gtk_clist_column_titles_show(rst->table);
+ gtk_container_add(GTK_CONTAINER(rst->scrolled_window), (GtkWidget *)rst->table);
+ gtk_widget_show((GtkWidget *)rst->table);
+
+ rst->num_procs=num_procs;
+ rst->procedures=g_malloc(sizeof(srt_procedure_t)*num_procs);
+ for(i=0;i<num_procs;i++){
+ rst->procedures[i].num=0;
+ rst->procedures[i].min.secs=0;
+ rst->procedures[i].min.nsecs=0;
+ rst->procedures[i].max.secs=0;
+ rst->procedures[i].max.nsecs=0;
+ rst->procedures[i].tot.secs=0;
+ rst->procedures[i].tot.nsecs=0;
+ for(j=0;j<6;j++){
+ rst->procedures[i].entries[j]=NULL;
+ }
+ }
+}
+
+void
+init_srt_table_row(srt_stat_table *rst, int index, char *procedure)
+{
+ char str[10];
+
+
+ sprintf(str,"%d",index);
+ rst->procedures[index].entries[0]=g_strdup(str);
+
+ rst->procedures[index].entries[1]=g_strdup(procedure);
+
+ rst->procedures[index].entries[2]=g_strdup("0");
+ rst->procedures[index].entries[3]=g_strdup("0");
+ rst->procedures[index].entries[4]=g_strdup("0");
+ rst->procedures[index].entries[5]=g_strdup("0");
+
+ gtk_clist_append(rst->table, rst->procedures[index].entries);
+}
+
+void
+add_srt_table_data(srt_stat_table *rst, int index, nstime_t *req_time, packet_info *pinfo)
+{
+ srt_procedure_t *rp;
+ nstime_t delta;
+
+ rp=&rst->procedures[index];
+
+ /* calculate time delta between request and reply */
+ delta.secs=pinfo->fd->abs_secs-req_time->secs;
+ delta.nsecs=pinfo->fd->abs_usecs*1000-req_time->nsecs;
+ if(delta.nsecs<0){
+ delta.nsecs+=1000000000;
+ delta.secs--;
+ }
+
+ if((rp->max.secs==0)
+ && (rp->max.nsecs==0) ){
+ rp->max.secs=delta.secs;
+ rp->max.nsecs=delta.nsecs;
+ }
+
+ if((rp->min.secs==0)
+ && (rp->min.nsecs==0) ){
+ rp->min.secs=delta.secs;
+ rp->min.nsecs=delta.nsecs;
+ }
+
+ if( (delta.secs<rp->min.secs)
+ ||( (delta.secs==rp->min.secs)
+ &&(delta.nsecs<rp->min.nsecs) ) ){
+ rp->min.secs=delta.secs;
+ rp->min.nsecs=delta.nsecs;
+ }
+
+ if( (delta.secs>rp->max.secs)
+ ||( (delta.secs==rp->max.secs)
+ &&(delta.nsecs>rp->max.nsecs) ) ){
+ rp->max.secs=delta.secs;
+ rp->max.nsecs=delta.nsecs;
+ }
+
+ rp->tot.secs += delta.secs;
+ rp->tot.nsecs += delta.nsecs;
+ if(rp->tot.nsecs>1000000000){
+ rp->tot.nsecs-=1000000000;
+ rp->tot.secs++;
+ }
+ rp->num++;
+}
+
+void
+draw_srt_table_data(srt_stat_table *rst)
+{
+ int i;
+#ifdef G_HAVE_UINT64
+ guint64 td;
+#else
+ guint32 td;
+#endif
+ char str[256], *strp;
+
+ for(i=0;i<rst->num_procs;i++){
+ /* scale it to units of 10us.*/
+ /* for long captures with a large tot time, this can overflow on 32bit */
+ td=(int)rst->procedures[i].tot.secs;
+ td=td*100000+(int)rst->procedures[i].tot.nsecs/10000;
+ if(rst->procedures[i].num){
+ td/=rst->procedures[i].num;
+ } else {
+ td=0;
+ }
+
+ sprintf(str,"%d", rst->procedures[i].num);
+ strp=g_strdup(str);
+ gtk_clist_set_text(rst->table, i, 2, strp);
+ g_free(rst->procedures[i].entries[2]);
+ rst->procedures[i].entries[2]=strp;
+
+
+ sprintf(str,"%3d.%05d", (int)rst->procedures[i].min.secs,rst->procedures[i].min.nsecs/10000);
+ strp=g_strdup(str);
+ gtk_clist_set_text(rst->table, i, 3, strp);
+ g_free(rst->procedures[i].entries[3]);
+ rst->procedures[i].entries[3]=strp;
+
+
+ sprintf(str,"%3d.%05d", (int)rst->procedures[i].max.secs,rst->procedures[i].max.nsecs/10000);
+ strp=g_strdup(str);
+ gtk_clist_set_text(rst->table, i, 4, strp);
+ g_free(rst->procedures[i].entries[4]);
+ rst->procedures[i].entries[4]=strp;
+
+ sprintf(str,"%3d.%05d", td/100000, td%100000);
+ strp=g_strdup(str);
+ gtk_clist_set_text(rst->table, i, 5, strp);
+ g_free(rst->procedures[i].entries[5]);
+ rst->procedures[i].entries[5]=strp;
+ }
+}
+
+
+void
+reset_srt_table_data(srt_stat_table *rst)
+{
+ int i;
+
+ for(i=0;i<rst->num_procs;i++){
+ rst->procedures[i].num=0;
+ rst->procedures[i].min.secs=0;
+ rst->procedures[i].min.nsecs=0;
+ rst->procedures[i].max.secs=0;
+ rst->procedures[i].max.nsecs=0;
+ rst->procedures[i].tot.secs=0;
+ rst->procedures[i].tot.nsecs=0;
+ }
+}
+
+void
+free_srt_table_data(srt_stat_table *rst)
+{
+ int i,j;
+
+ for(i=0;i<rst->num_procs;i++){
+ for(j=0;j<6;j++){
+ if(rst->procedures[i].entries[j]){
+ g_free(rst->procedures[i].entries[j]);
+ rst->procedures[i].entries[j]=NULL;
+ }
+ }
+ }
+ g_free(rst->procedures);
+ rst->procedures=NULL;
+ rst->num_procs=0;
+}
+