X-Git-Url: http://git.liburcu.org/?a=blobdiff_plain;f=lttv%2Flttv%2Fsync%2Fevent_analysis_eval.h;h=c0b02d0daa53d5277b8050000e0d1a1f4d71c127;hb=66eaf2eba602c331d08677dbb59ec3f9e40f0ccc;hp=120bdc67c46a9c12162b9601806fda4ac2c00eb9;hpb=4ee223e50270f894ec866b07c00ad49dff666173;p=lttv.git

diff --git a/lttv/lttv/sync/event_analysis_eval.h b/lttv/lttv/sync/event_analysis_eval.h
index 120bdc67..c0b02d0d 100644
--- a/lttv/lttv/sync/event_analysis_eval.h
+++ b/lttv/lttv/sync/event_analysis_eval.h
@@ -19,7 +19,14 @@
 #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"
 
@@ -42,47 +49,94 @@ typedef struct
 	double broadcastDiffSum;
 	unsigned int broadcastNb;
 
+	// MessageStats messageStats[traceNb][traceNb]
 	MessageStats** messageStats;
+
 	/* double* exchangeRtt[RttKey]
 	 * For this table, saddr and daddr are swapped as necessary such that
 	 * saddr < daddr */
 	GHashTable* exchangeRtt;
+
+#ifdef HAVE_LIBGLPK
+	/* FactorsCHull** chFactorsArray[traceNum][traceNum]
+	 * FactorsCHull** lpFactorsArray[traceNum][traceNum]
+	 *
+	 * As usual, only the lower triangular part of theses matrixes is
+	 * allocated */
+	FactorsCHull** chFactorsArray;
+	FactorsCHull** lpFactorsArray;
+#endif
 } AnalysisStatsEval;
 
+#define BIN_NB 1001
+struct Bins
+{
+	// index of min and max bins that are != 0
+	uint32_t min, max;
+	// sum of all bins
+	uint32_t total;
+	/* bin[0]: underflow ]-INFINITY..0[
+	 * bin[1]: [0..1e-6[
+	 * rest defined exponentially, see binStart()
+	 * bin[BIN_NB - 1]: overflow [1..INFINITY[ */
+	uint32_t bin[BIN_NB];
+};
+
 typedef struct
 {
-	/* FILE* ttPoints[row][col] where
-	 *   row= outE->traceNum
-	 *   col= inE->traceNum
+	 /* File pointers to files where "trip times" (message latency) histogram
+	  * values are output. Each host-pair has two files, one for each message
+	  * direction. As for traces, the host with the smallest address is
+	  * considered to be the reference for the direction of messages (ie.
+	  * messages from the host with the lowest address to the host with the
+	  * largest address are "sent"). */
+	FILE* ttSendPoints;
+	FILE* ttRecvPoints;
+
+	struct Bins ttSendBins;
+	struct Bins ttRecvBins;
+
+	/* File pointers to files where half round trip times (evaluated from
+	 * exchanges) histogram values are output. */
+	FILE* hrttPoints;
+
+	struct Bins hrttBins;
+} 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]
 	 *
-	 * This array contains file pointers to files where "trip times" (message
-	 * latency) histogram values are outputted. Each trace-pair has two files,
-	 * one for each message direction. The elements on the diagonal are not
-	 * initialized.
-	 */
-	FILE*** ttPoints;
-
-	// uint32_t ttBinsArray[row][col][binNum];
-	// Row and col have the same structure as ttPoints
-	uint32_t*** ttBinsArray;
-	// uint32_t ttBinsTotal[row][col];
-	// Row and col have the same structure as ttPoints
-	uint32_t** ttBinsTotal;
-
-	/* FILE* hrttPoints[traceNum][traceNum] where
-	 *   row > col, other elements are not initialized
+	 * Only the lower triangular part of the matrix is allocated, that is
+	 * lps[i][j] where i > j */
+	glp_prob*** lps;
+
+	/* Factors lpFactors[traceNum][traceNum]
 	 *
-	 * This array contains file pointers to files where half round trip times
-	 * (evaluated from exchanges) histogram values are outputted.
-	 */
-	FILE*** hrttPoints;
-
-	// uint32_t hrttBinsArray[row][col][binNum];
-	// Row and col have the same structure as hrttPoints
-	uint32_t*** hrttBinsArray;
-	// uint32_t hrttBinsTotal[row][col];
-	// Row and col have the same structure as hrttPoints
-	uint32_t** hrttBinsTotal;
+	 * Only the lower triangular part of the matrix is allocated, that is
+	 * lpFactorsArray[i][j] where i > j */
+	FactorsCHull** lpFactorsArray;
+#endif
 } AnalysisGraphsEval;
 
 typedef struct
@@ -90,6 +144,11 @@ 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;
 } AnalysisDataEval;