/* 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
#endif
#include <glib.h>
-#ifdef HAVE_LIBGLPK
-#include <glpk.h>
-#endif
#include "data_structures.h"
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;
* 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
* 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;
-
- /* Factors lpFactors[traceNum][traceNum]
- *
- * Only the lower triangular part of the matrix is allocated, that is
- * lpFactorsArray[i][j] where i > j */
- FactorsCHull** lpFactorsArray;
-#endif
+ // Extra SyncState used to overlay the chull-calculated accuracy region
+ SyncState* chullSS;
} 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;
} AnalysisDataEval;