1 /* This file is part of the Linux Trace Toolkit viewer
2 * Copyright (C) 2009, 2010 Benjamin Poirier <benjamin.poirier@polymtl.ca>
4 * This program is free software: you can redistribute it and/or modify it
5 * under the terms of the GNU Lesser General Public License as published by
6 * the Free Software Foundation, either version 2.1 of the License, or (at
7 * your option) any later version.
9 * This program is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
12 * License for more details.
14 * You should have received a copy of the GNU Lesser General Public License
15 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 #ifndef EVENT_ANALYSIS_EVAL_H
19 #define EVENT_ANALYSIS_EVAL_H
30 #include "data_structures.h"
35 uint32_t saddr
, daddr
;
40 unsigned int inversionNb
,
48 unsigned int broadcastNb
;
49 double broadcastStdevSum
;
51 unsigned int broadcastPairNb
;
52 double broadcastRangeMin
;
53 double broadcastRangeMax
;
55 double broadcastSumSquares
;
57 // MessageStats messageStats[traceNb][traceNb]
58 MessageStats
** messageStats
;
60 /* double* exchangeRtt[RttKey]
61 * For this table, saddr and daddr are swapped as necessary such that
63 GHashTable
* exchangeRtt
;
66 /* FactorsCHull** chFactorsArray[traceNum][traceNum]
67 * FactorsCHull** lpFactorsArray[traceNum][traceNum]
69 * As usual, only the lower triangular part of theses matrixes is
71 FactorsCHull
** chFactorsArray
;
72 FactorsCHull
** lpFactorsArray
;
79 // index of min and max bins that are != 0
83 /* bin[0]: underflow ]-INFINITY..0[
85 * rest defined exponentially, see binStart()
86 * bin[BIN_NB - 1]: overflow [1..INFINITY[ */
92 /* File pointers to files where "trip times" (message latency) histogram
93 * values are output. Each host-pair has two files, one for each message
94 * direction. As for traces, the host with the smallest address is
95 * considered to be the reference for the direction of messages (ie.
96 * messages from the host with the lowest address to the host with the
97 * largest address are "sent"). */
101 struct Bins ttSendBins
;
102 struct Bins ttRecvBins
;
104 /* File pointers to files where half round trip times (evaluated from
105 * exchanges) histogram values are output. */
108 struct Bins hrttBins
;
109 } AnalysisHistogramEval
;
113 // These are the cpu times of the first and last interactions (message or
114 // broadcast) between two traces. The times are from the trace with the
121 /* AnalysisHistogramEval* graphs[RttKey];
122 * For this table, saddr and daddr are swapped as necessary such that
124 GHashTable
* histograms
;
126 /* Bounds bounds[traceNum][traceNum]
128 * Only the lower triangular part of the matrix is allocated, that is
129 * bounds[i][j] where i > j */
133 /* glp_prob* lps[traceNum][traceNum]
135 * Only the lower triangular part of the matrix is allocated, that is
136 * lps[i][j] where i > j */
139 /* Factors lpFactors[traceNum][traceNum]
141 * Only the lower triangular part of the matrix is allocated, that is
142 * lpFactorsArray[i][j] where i > j */
143 FactorsCHull
** lpFactorsArray
;
145 } AnalysisGraphsEval
;
149 // double* rttInfo[RttKey]
152 /* The convex hull analysis is encapsulated and messages are passed to it
153 * so that it builds the convex hulls. These are reused in the linear
155 struct _SyncState
* chullSS
;
157 AnalysisStatsEval
* stats
;
158 AnalysisGraphsEval
* graphs
;
161 void registerAnalysisEval();
This page took 0.033817 seconds and 5 git commands to generate.