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
27 #include "data_structures.h"
32 uint32_t saddr
, daddr
;
37 unsigned int inversionNb
,
45 unsigned int broadcastNb
;
46 double broadcastStdevSum
;
48 unsigned int broadcastPairNb
;
49 double broadcastRangeMin
;
50 double broadcastRangeMax
;
52 double broadcastSumSquares
;
54 // MessageStats messageStats[traceNb][traceNb]
55 MessageStats
** messageStats
;
57 /* double* exchangeRtt[RttKey]
58 * For this table, saddr and daddr are swapped as necessary such that
60 GHashTable
* exchangeRtt
;
66 // index of min and max bins that are != 0
70 /* bin[0]: underflow ]-INFINITY..0[
72 * rest defined exponentially, see binStart()
73 * bin[BIN_NB - 1]: overflow [1..INFINITY[ */
79 /* File pointers to files where "trip times" (message latency) histogram
80 * values are output. Each host-pair has two files, one for each message
81 * direction. As for traces, the host with the smallest address is
82 * considered to be the reference for the direction of messages (ie.
83 * messages from the host with the lowest address to the host with the
84 * largest address are "sent"). */
88 struct Bins ttSendBins
;
89 struct Bins ttRecvBins
;
91 /* File pointers to files where half round trip times (evaluated from
92 * exchanges) histogram values are output. */
96 } AnalysisHistogramEval
;
100 // These are the cpu times of the first and last interactions (message or
101 // broadcast) between two traces. The times are from the trace with the
108 /* AnalysisHistogramEval* graphs[RttKey];
109 * For this table, saddr and daddr are swapped as necessary such that
111 GHashTable
* histograms
;
113 /* Bounds bounds[traceNum][traceNum]
115 * Only the lower triangular part of the matrix is allocated, that is
116 * bounds[i][j] where i > j */
119 // Extra SyncState used to overlay the chull-calculated accuracy region
121 } AnalysisGraphsEval
;
125 // double* rttInfo[RttKey]
128 AnalysisStatsEval
* stats
;
129 AnalysisGraphsEval
* graphs
;
132 void registerAnalysisEval();
This page took 0.034359 seconds and 4 git commands to generate.