Perform trace factor reduction as a separate step

[lttv.git] / lttv / lttv / sync / event_analysis_eval.h

diff --git a/lttv/lttv/sync/event_analysis_eval.h b/lttv/lttv/sync/event_analysis_eval.h
index b02c77212e42b0436d0f49b1beae6ab9c8c8776c..dbd4ac954e870a63e4eaa3c31560f73ceedadaf3 100644 (file)
--- a/lttv/lttv/sync/event_analysis_eval.h
+++ b/lttv/lttv/sync/event_analysis_eval.h
@@ -1,25 +1,31 @@
 /* This file is part of the Linux Trace Toolkit viewer
- * Copyright (C) 2009 Benjamin Poirier <benjamin.poirier@polymtl.ca>
+ * Copyright (C) 2009, 2010 Benjamin Poirier <benjamin.poirier@polymtl.ca>
  *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License Version 2 as
- * published by the Free Software Foundation;
+ * This program is free software: you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation, either version 2.1 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.
+ * 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 Lesser 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.
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
  */
 
 #ifndef EVENT_ANALYSIS_EVAL_H
 #define EVENT_ANALYSIS_EVAL_H
 
+#ifdef HAVE_CONFIG_H
+#include <config.h>
+#endif
+
 #include <glib.h>
+#ifdef HAVE_LIBGLPK
+#include <glpk.h>
+#endif
 
 #include "data_structures.h"
 
@@ -39,8 +45,14 @@ typedef struct
 
 typedef struct
 {
-       double broadcastDiffSum;
        unsigned int broadcastNb;
+       double broadcastStdevSum;
+
+       unsigned int broadcastPairNb;
+       double broadcastRangeMin;
+       double broadcastRangeMax;
+       double broadcastSum;
+       double broadcastSumSquares;
 
        // MessageStats messageStats[traceNb][traceNb]
        MessageStats** messageStats;
@@ -49,8 +61,13 @@ typedef struct
         * For this table, saddr and daddr are swapped as necessary such that
         * saddr < daddr */
        GHashTable* exchangeRtt;
-} AnalysisStatsEval;
 
+#ifdef HAVE_LIBGLPK
+       // Only the lower triangular part of theses matrixes is used
+       AllFactors* chFactorsArray;
+       AllFactors* lpFactorsArray;
+#endif
+} AnalysisStatsEval;
 
 #define BIN_NB 1001
 struct Bins
@@ -66,7 +83,6 @@ struct Bins
        uint32_t bin[BIN_NB];
 };
 
-
 typedef struct
 {
         /* File pointers to files where "trip times" (message latency) histogram
@@ -86,18 +102,56 @@ typedef struct
        FILE* hrttPoints;
 
        struct Bins hrttBins;
-} AnalysisGraphEval;
+} AnalysisHistogramEval;
+
+typedef struct
+{
+       // These are the cpu times of the first and last interactions (message or
+       // broadcast) between two traces. The times are from the trace with the
+       // lowest traceNum.
+       uint64_t min, max;
+} Bounds;
+
+typedef struct
+{
+       /* AnalysisHistogramEval* graphs[RttKey];
+        * For this table, saddr and daddr are swapped as necessary such that
+        * saddr < daddr */
+       GHashTable* histograms;
+
+       /* Bounds bounds[traceNum][traceNum]
+        *
+        * Only the lower triangular part of the matrix is allocated, that is
+        * bounds[i][j] where i > j */
+       Bounds** bounds;
+
+#ifdef HAVE_LIBGLPK
+       /* glp_prob* lps[traceNum][traceNum]
+        *
+        * Only the lower triangular part of the matrix is allocated, that is
+        * lps[i][j] where i > j */
+       glp_prob*** lps;
+
+       /* Only the lower triangular part of the matrix is allocated, that is
+        * lpFactorsArray[i][j] where i > j */
+       AllFactors* lpFactorsArray;
+#endif
+} AnalysisGraphsEval;
 
 typedef struct
 {
        // double* rttInfo[RttKey]
        GHashTable* rttInfo;
 
+       /* The convex hull analysis is encapsulated and messages are passed to it
+        * so that it builds the convex hulls. These are reused in the linear
+        * program. */
+       struct _SyncState* chullSS;
+
        AnalysisStatsEval* stats;
-       /* AnalysisGraphsEval* graphs[RttKey];
-        * For this table, saddr and daddr are swapped as necessary such that
-        * saddr < daddr */
-       GHashTable* graphs;
+       AnalysisGraphsEval* graphs;
 } AnalysisDataEval;
 
+void registerAnalysisEval();
+
 #endif