Commit | Line | Data |
---|---|---|
cdce23b3 BP |
1 | /* This file is part of the Linux Trace Toolkit viewer |
2 | * Copyright (C) 2009 Benjamin Poirier <benjamin.poirier@polymtl.ca> | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or modify | |
5 | * it under the terms of the GNU General Public License Version 2 as | |
6 | * published by the Free Software Foundation; | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, | |
9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
11 | * GNU General Public License for more details. | |
12 | * | |
13 | * You should have received a copy of the GNU General Public License | |
14 | * along with this program; if not, write to the Free Software | |
15 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, | |
16 | * MA 02111-1307, USA. | |
17 | */ | |
18 | ||
2bd4b3e4 | 19 | #define _GNU_SOURCE |
d4721e1a | 20 | #define _ISOC99_SOURCE |
2bd4b3e4 | 21 | |
cdce23b3 BP |
22 | #ifdef HAVE_CONFIG_H |
23 | #include <config.h> | |
24 | #endif | |
25 | ||
2bd4b3e4 BP |
26 | #include <arpa/inet.h> |
27 | #include <errno.h> | |
76be6fc2 | 28 | #include <math.h> |
2bd4b3e4 BP |
29 | #include <netinet/in.h> |
30 | #include <stddef.h> | |
cdce23b3 | 31 | #include <stdlib.h> |
2bd4b3e4 BP |
32 | #include <stdio.h> |
33 | #include <string.h> | |
34 | #include <sys/socket.h> | |
4ee223e5 | 35 | #include <unistd.h> |
cdce23b3 | 36 | |
2bd4b3e4 BP |
37 | #include "lookup3.h" |
38 | #include "sync_chain.h" | |
cdce23b3 BP |
39 | |
40 | #include "event_analysis_eval.h" | |
41 | ||
42 | ||
e072e1ab BP |
43 | struct WriteGraphInfo |
44 | { | |
45 | GHashTable* rttInfo; | |
46 | FILE* graphsStream; | |
47 | }; | |
48 | ||
49 | ||
cdce23b3 BP |
50 | // Functions common to all analysis modules |
51 | static void initAnalysisEval(SyncState* const syncState); | |
52 | static void destroyAnalysisEval(SyncState* const syncState); | |
53 | ||
54 | static void analyzeMessageEval(SyncState* const syncState, Message* const | |
55 | message); | |
56 | static void analyzeExchangeEval(SyncState* const syncState, Exchange* const | |
57 | exchange); | |
58 | static void analyzeBroadcastEval(SyncState* const syncState, Broadcast* const | |
59 | broadcast); | |
60 | static GArray* finalizeAnalysisEval(SyncState* const syncState); | |
61 | static void printAnalysisStatsEval(SyncState* const syncState); | |
62 | ||
63 | // Functions specific to this module | |
64 | static void registerAnalysisEval() __attribute__((constructor (102))); | |
2bd4b3e4 BP |
65 | static guint ghfRttKeyHash(gconstpointer key); |
66 | static gboolean gefRttKeyEqual(gconstpointer a, gconstpointer b); | |
67 | static void gdnDestroyRttKey(gpointer data); | |
68 | static void gdnDestroyDouble(gpointer data); | |
69 | static void readRttInfo(GHashTable* rttInfo, FILE* rttFile); | |
70 | static void positionStream(FILE* stream); | |
cdce23b3 | 71 | |
76be6fc2 BP |
72 | static void gfSum(gpointer data, gpointer userData); |
73 | static void gfSumSquares(gpointer data, gpointer userData); | |
d4721e1a | 74 | static void ghfPrintExchangeRtt(gpointer key, gpointer value, gpointer user_data); |
76be6fc2 | 75 | |
e072e1ab | 76 | static void hitBin(struct Bins* const bins, const double value); |
4ee223e5 BP |
77 | static unsigned int binNum(const double value) __attribute__((pure)); |
78 | static double binStart(const unsigned int binNum) __attribute__((pure)); | |
79 | static double binEnd(const unsigned int binNum) __attribute__((pure)); | |
80 | ||
e072e1ab BP |
81 | static AnalysisGraphEval* constructAnalysisGraphEval(const char* const |
82 | graphsDir, const struct RttKey* const rttKey); | |
83 | static void destroyAnalysisGraphEval(AnalysisGraphEval* const graph); | |
84 | static void gdnDestroyAnalysisGraphEval(gpointer data); | |
85 | static void ghfWriteGraph(gpointer key, gpointer value, gpointer user_data); | |
86 | static void dumpBinToFile(const struct Bins* const bins, FILE* const file); | |
87 | static void writeHistogram(FILE* graphsStream, const struct RttKey* rttKey, | |
88 | double* minRtt); | |
89 | ||
4ee223e5 | 90 | |
4ee223e5 | 91 | double binBase; |
cdce23b3 BP |
92 | |
93 | static AnalysisModule analysisModuleEval= { | |
94 | .name= "eval", | |
95 | .initAnalysis= &initAnalysisEval, | |
96 | .destroyAnalysis= &destroyAnalysisEval, | |
97 | .analyzeMessage= &analyzeMessageEval, | |
98 | .analyzeExchange= &analyzeExchangeEval, | |
99 | .analyzeBroadcast= &analyzeBroadcastEval, | |
100 | .finalizeAnalysis= &finalizeAnalysisEval, | |
101 | .printAnalysisStats= &printAnalysisStatsEval, | |
e072e1ab BP |
102 | .writeAnalysisGraphsPlots= NULL, |
103 | .writeAnalysisGraphsOptions= NULL, | |
cdce23b3 BP |
104 | }; |
105 | ||
2bd4b3e4 BP |
106 | static ModuleOption optionEvalRttFile= { |
107 | .longName= "eval-rtt-file", | |
108 | .hasArg= REQUIRED_ARG, | |
109 | {.arg= NULL}, | |
4ee223e5 | 110 | .optionHelp= "specify the file containing RTT information", |
2bd4b3e4 BP |
111 | .argHelp= "FILE", |
112 | }; | |
113 | ||
cdce23b3 BP |
114 | |
115 | /* | |
116 | * Analysis module registering function | |
117 | */ | |
118 | static void registerAnalysisEval() | |
119 | { | |
120 | g_queue_push_tail(&analysisModules, &analysisModuleEval); | |
2bd4b3e4 | 121 | g_queue_push_tail(&moduleOptions, &optionEvalRttFile); |
cdce23b3 BP |
122 | } |
123 | ||
124 | ||
125 | /* | |
126 | * Analysis init function | |
127 | * | |
128 | * This function is called at the beginning of a synchronization run for a set | |
129 | * of traces. | |
130 | * | |
131 | * Args: | |
132 | * syncState container for synchronization data. | |
133 | */ | |
134 | static void initAnalysisEval(SyncState* const syncState) | |
135 | { | |
136 | AnalysisDataEval* analysisData; | |
137 | unsigned int i; | |
138 | ||
139 | analysisData= malloc(sizeof(AnalysisDataEval)); | |
140 | syncState->analysisData= analysisData; | |
141 | ||
2bd4b3e4 BP |
142 | analysisData->rttInfo= g_hash_table_new_full(&ghfRttKeyHash, |
143 | &gefRttKeyEqual, &gdnDestroyRttKey, &gdnDestroyDouble); | |
144 | if (optionEvalRttFile.arg) | |
145 | { | |
146 | FILE* rttStream; | |
147 | int retval; | |
148 | ||
149 | rttStream= fopen(optionEvalRttFile.arg, "r"); | |
150 | if (rttStream == NULL) | |
151 | { | |
152 | g_error(strerror(errno)); | |
153 | } | |
154 | ||
155 | readRttInfo(analysisData->rttInfo, rttStream); | |
156 | ||
157 | retval= fclose(rttStream); | |
158 | if (retval == EOF) | |
159 | { | |
160 | g_error(strerror(errno)); | |
161 | } | |
162 | } | |
cdce23b3 BP |
163 | |
164 | if (syncState->stats) | |
165 | { | |
76be6fc2 | 166 | analysisData->stats= calloc(1, sizeof(AnalysisStatsEval)); |
cdce23b3 BP |
167 | analysisData->stats->broadcastDiffSum= 0.; |
168 | ||
76be6fc2 BP |
169 | analysisData->stats->messageStats= malloc(syncState->traceNb * |
170 | sizeof(MessageStats*)); | |
cdce23b3 BP |
171 | for (i= 0; i < syncState->traceNb; i++) |
172 | { | |
76be6fc2 BP |
173 | analysisData->stats->messageStats[i]= calloc(syncState->traceNb, |
174 | sizeof(MessageStats)); | |
cdce23b3 | 175 | } |
d4721e1a BP |
176 | |
177 | analysisData->stats->exchangeRtt= | |
178 | g_hash_table_new_full(&ghfRttKeyHash, &gefRttKeyEqual, | |
179 | &gdnDestroyRttKey, &gdnDestroyDouble); | |
cdce23b3 | 180 | } |
4ee223e5 | 181 | |
8d7d16dd | 182 | if (syncState->graphsStream) |
4ee223e5 | 183 | { |
e072e1ab BP |
184 | binBase= exp10(6. / (BIN_NB - 3)); |
185 | analysisData->graphs= g_hash_table_new_full(&ghfRttKeyHash, | |
186 | &gefRttKeyEqual, &gdnDestroyRttKey, &gdnDestroyAnalysisGraphEval); | |
4ee223e5 BP |
187 | } |
188 | } | |
189 | ||
190 | ||
191 | /* | |
e072e1ab BP |
192 | * Create and open files used to store histogram points to generate graphs. |
193 | * Create data structures to store histogram points during analysis. | |
4ee223e5 BP |
194 | * |
195 | * Args: | |
e072e1ab BP |
196 | * graphsDir: folder where to write files |
197 | * rttKey: host pair, make sure saddr < daddr | |
4ee223e5 | 198 | */ |
e072e1ab BP |
199 | static AnalysisGraphEval* constructAnalysisGraphEval(const char* const |
200 | graphsDir, const struct RttKey* const rttKey) | |
4ee223e5 | 201 | { |
4ee223e5 | 202 | int retval; |
e072e1ab | 203 | unsigned int i; |
4ee223e5 | 204 | char* cwd; |
e072e1ab BP |
205 | char name[60], saddr[16], daddr[16]; |
206 | AnalysisGraphEval* graph= calloc(1, sizeof(*graph)); | |
207 | const struct { | |
208 | size_t pointsOffset; | |
209 | const char* fileName; | |
210 | const char* host1, *host2; | |
211 | } loopValues[]= { | |
212 | {offsetof(AnalysisGraphEval, ttSendPoints), "analysis_eval_tt-%s_to_%s.data", | |
213 | saddr, daddr}, | |
214 | {offsetof(AnalysisGraphEval, ttRecvPoints), "analysis_eval_tt-%s_to_%s.data", | |
215 | daddr, saddr}, | |
216 | {offsetof(AnalysisGraphEval, hrttPoints), "analysis_eval_hrtt-%s_and_%s.data", | |
217 | saddr, daddr}, | |
218 | }; | |
219 | ||
220 | graph->ttSendBins.max= BIN_NB - 1; | |
221 | graph->ttRecvBins.max= BIN_NB - 1; | |
222 | graph->hrttBins.max= BIN_NB - 1; | |
223 | ||
224 | convertIP(saddr, rttKey->saddr); | |
225 | convertIP(daddr, rttKey->daddr); | |
226 | ||
227 | cwd= changeToGraphDir(graphsDir); | |
228 | ||
229 | for (i= 0; i < sizeof(loopValues) / sizeof(*loopValues); i++) | |
4ee223e5 | 230 | { |
e072e1ab BP |
231 | retval= snprintf(name, sizeof(name), loopValues[i].fileName, |
232 | loopValues[i].host1, loopValues[i].host2); | |
233 | if (retval > sizeof(name) - 1) | |
4ee223e5 | 234 | { |
e072e1ab | 235 | name[sizeof(name) - 1]= '\0'; |
4ee223e5 | 236 | } |
e072e1ab BP |
237 | if ((*(FILE**)((void*) graph + loopValues[i].pointsOffset)= |
238 | fopen(name, "w")) == NULL) | |
4ee223e5 | 239 | { |
e072e1ab | 240 | g_error(strerror(errno)); |
4ee223e5 BP |
241 | } |
242 | } | |
243 | ||
244 | retval= chdir(cwd); | |
245 | if (retval == -1) | |
246 | { | |
247 | g_error(strerror(errno)); | |
248 | } | |
249 | free(cwd); | |
e072e1ab BP |
250 | |
251 | return graph; | |
4ee223e5 BP |
252 | } |
253 | ||
254 | ||
255 | /* | |
e072e1ab | 256 | * Close files used to store histogram points to generate graphs. |
4ee223e5 BP |
257 | * |
258 | * Args: | |
e072e1ab BP |
259 | * graphsDir: folder where to write files |
260 | * rttKey: host pair, make sure saddr < daddr | |
4ee223e5 | 261 | */ |
e072e1ab | 262 | static void destroyAnalysisGraphEval(AnalysisGraphEval* const graph) |
4ee223e5 | 263 | { |
e072e1ab BP |
264 | unsigned int i; |
265 | int retval; | |
266 | const struct { | |
267 | size_t pointsOffset; | |
268 | } loopValues[]= { | |
269 | {offsetof(AnalysisGraphEval, ttSendPoints)}, | |
270 | {offsetof(AnalysisGraphEval, ttRecvPoints)}, | |
271 | {offsetof(AnalysisGraphEval, hrttPoints)}, | |
272 | }; | |
273 | ||
274 | for (i= 0; i < sizeof(loopValues) / sizeof(*loopValues); i++) | |
4ee223e5 | 275 | { |
e072e1ab BP |
276 | retval= fclose(*(FILE**)((void*) graph + loopValues[i].pointsOffset)); |
277 | if (retval != 0) | |
4ee223e5 | 278 | { |
e072e1ab | 279 | g_error(strerror(errno)); |
4ee223e5 BP |
280 | } |
281 | } | |
282 | } | |
283 | ||
284 | ||
e072e1ab BP |
285 | /* |
286 | * A GDestroyNotify function for g_hash_table_new_full() | |
287 | * | |
288 | * Args: | |
289 | * data: AnalysisGraphEval* | |
290 | */ | |
291 | static void gdnDestroyAnalysisGraphEval(gpointer data) | |
292 | { | |
293 | destroyAnalysisGraphEval(data); | |
294 | } | |
295 | ||
296 | ||
297 | /* | |
298 | * A GHFunc for g_hash_table_foreach() | |
299 | * | |
300 | * Args: | |
301 | * key: RttKey* where saddr < daddr | |
302 | * value: AnalysisGraphEval* | |
303 | * user_data struct WriteGraphInfo* | |
304 | */ | |
305 | static void ghfWriteGraph(gpointer key, gpointer value, gpointer user_data) | |
306 | { | |
307 | double* rtt1, * rtt2; | |
308 | struct RttKey* rttKey= key; | |
309 | struct RttKey oppositeRttKey= {.saddr= rttKey->daddr, .daddr= | |
310 | rttKey->saddr}; | |
311 | AnalysisGraphEval* graph= value; | |
312 | struct WriteGraphInfo* info= user_data; | |
313 | ||
314 | rtt1= g_hash_table_lookup(info->rttInfo, rttKey); | |
315 | rtt2= g_hash_table_lookup(info->rttInfo, &oppositeRttKey); | |
316 | ||
317 | if (rtt1 == NULL) | |
318 | { | |
319 | rtt1= rtt2; | |
320 | } | |
321 | else if (rtt2 != NULL) | |
322 | { | |
323 | rtt1= MIN(rtt1, rtt2); | |
324 | } | |
325 | ||
326 | dumpBinToFile(&graph->ttSendBins, graph->ttSendPoints); | |
327 | dumpBinToFile(&graph->ttRecvBins, graph->ttRecvPoints); | |
328 | dumpBinToFile(&graph->hrttBins, graph->hrttPoints); | |
329 | writeHistogram(info->graphsStream, rttKey, rtt1); | |
330 | } | |
331 | ||
332 | ||
4ee223e5 BP |
333 | /* |
334 | * Write the content of one bin in a histogram point file | |
335 | * | |
336 | * Args: | |
337 | * bin: array of values that make up a histogram | |
e072e1ab | 338 | * file: FILE*, write to this file |
4ee223e5 | 339 | */ |
e072e1ab | 340 | static void dumpBinToFile(const struct Bins* const bins, FILE* const file) |
4ee223e5 BP |
341 | { |
342 | unsigned int i; | |
343 | ||
e072e1ab BP |
344 | // The first and last bins are skipped, see struct Bins |
345 | for (i= 1; i < BIN_NB - 1; i++) | |
4ee223e5 | 346 | { |
e072e1ab | 347 | if (bins->bin[i] > 0) |
4ee223e5 | 348 | { |
e072e1ab BP |
349 | fprintf(file, "%20.9f %20.9f %20.9f\n", (binStart(i) + binEnd(i)) |
350 | / 2., (double) bins->bin[i] / ((binEnd(i) - binStart(i)) * | |
351 | bins->total), binEnd(i) - binStart(i)); | |
4ee223e5 BP |
352 | } |
353 | } | |
354 | } | |
355 | ||
356 | ||
357 | /* | |
e072e1ab | 358 | * Write the analysis-specific plot in the gnuplot script. |
4ee223e5 BP |
359 | * |
360 | * Args: | |
e072e1ab BP |
361 | * graphsStream: write to this file |
362 | * rttKey: must be sorted such that saddr < daddr | |
363 | * minRtt: if available, else NULL | |
4ee223e5 | 364 | */ |
e072e1ab BP |
365 | static void writeHistogram(FILE* graphsStream, const struct RttKey* rttKey, |
366 | double* minRtt) | |
4ee223e5 | 367 | { |
e072e1ab | 368 | char saddr[16], daddr[16]; |
4ee223e5 | 369 | |
e072e1ab BP |
370 | convertIP(saddr, rttKey->saddr); |
371 | convertIP(daddr, rttKey->daddr); | |
4ee223e5 | 372 | |
e072e1ab BP |
373 | fprintf(graphsStream, |
374 | "reset\n" | |
375 | "set output \"histogram-%s-%s.eps\"\n" | |
376 | "set title \"\"\n" | |
377 | "set xlabel \"Message Latency (s)\"\n" | |
378 | "set ylabel \"Proportion of messages per second\"\n", saddr, daddr); | |
4ee223e5 | 379 | |
e072e1ab | 380 | if (minRtt != NULL) |
4ee223e5 | 381 | { |
e072e1ab BP |
382 | fprintf(graphsStream, |
383 | "set arrow from %.9f, 0 rto 0, graph 1 " | |
384 | "nohead linetype 3 linewidth 3 linecolor rgb \"black\"\n", *minRtt / 2); | |
4ee223e5 | 385 | } |
4ee223e5 | 386 | |
e072e1ab BP |
387 | fprintf(graphsStream, |
388 | "plot \\\n" | |
389 | "\t\"analysis_eval_hrtt-%1$s_and_%2$s.data\" " | |
390 | "title \"RTT/2\" with linespoints linetype 1 linewidth 2 " | |
391 | "linecolor rgb \"black\" pointtype 6 pointsize 1,\\\n" | |
392 | "\t\"analysis_eval_tt-%1$s_to_%2$s.data\" " | |
393 | "title \"%1$s to %2$s\" with linespoints linetype 4 linewidth 2 " | |
394 | "linecolor rgb \"gray60\" pointtype 6 pointsize 1,\\\n" | |
395 | "\t\"analysis_eval_tt-%2$s_to_%1$s.data\" " | |
396 | "title \"%2$s to %1$s\" with linespoints linetype 4 linewidth 2 " | |
397 | "linecolor rgb \"gray30\" pointtype 6 pointsize 1\n", saddr, daddr); | |
cdce23b3 BP |
398 | } |
399 | ||
400 | ||
401 | /* | |
402 | * Analysis destroy function | |
403 | * | |
404 | * Free the analysis specific data structures | |
405 | * | |
406 | * Args: | |
407 | * syncState container for synchronization data. | |
408 | */ | |
409 | static void destroyAnalysisEval(SyncState* const syncState) | |
410 | { | |
411 | unsigned int i; | |
412 | AnalysisDataEval* analysisData; | |
413 | ||
414 | analysisData= (AnalysisDataEval*) syncState->analysisData; | |
415 | ||
416 | if (analysisData == NULL || analysisData->rttInfo == NULL) | |
417 | { | |
418 | return; | |
419 | } | |
420 | ||
2bd4b3e4 | 421 | g_hash_table_destroy(analysisData->rttInfo); |
cdce23b3 BP |
422 | analysisData->rttInfo= NULL; |
423 | ||
424 | if (syncState->stats) | |
425 | { | |
426 | for (i= 0; i < syncState->traceNb; i++) | |
427 | { | |
76be6fc2 | 428 | free(analysisData->stats->messageStats[i]); |
cdce23b3 | 429 | } |
76be6fc2 | 430 | free(analysisData->stats->messageStats); |
d4721e1a BP |
431 | |
432 | g_hash_table_destroy(analysisData->stats->exchangeRtt); | |
433 | ||
cdce23b3 BP |
434 | free(analysisData->stats); |
435 | } | |
436 | ||
8d7d16dd | 437 | if (syncState->graphsStream && analysisData->graphs) |
4ee223e5 | 438 | { |
e072e1ab | 439 | g_hash_table_destroy(analysisData->graphs); |
4ee223e5 BP |
440 | } |
441 | ||
cdce23b3 BP |
442 | free(syncState->analysisData); |
443 | syncState->analysisData= NULL; | |
444 | } | |
445 | ||
446 | ||
447 | /* | |
448 | * Perform analysis on an event pair. | |
449 | * | |
76be6fc2 BP |
450 | * Check if there is message inversion or messages that are too fast. |
451 | * | |
cdce23b3 BP |
452 | * Args: |
453 | * syncState container for synchronization data | |
454 | * message structure containing the events | |
455 | */ | |
456 | static void analyzeMessageEval(SyncState* const syncState, Message* const message) | |
457 | { | |
e072e1ab BP |
458 | AnalysisDataEval* analysisData= syncState->analysisData; |
459 | MessageStats* messageStats= | |
460 | &analysisData->stats->messageStats[message->outE->traceNum][message->inE->traceNum];; | |
d4721e1a | 461 | double* rtt; |
76be6fc2 BP |
462 | double tt; |
463 | struct RttKey rttKey; | |
464 | ||
465 | if (!syncState->stats) | |
466 | { | |
467 | return; | |
468 | } | |
cdce23b3 | 469 | |
e072e1ab | 470 | g_assert(message->inE->type == TCP); |
76be6fc2 BP |
471 | |
472 | messageStats->total++; | |
473 | ||
474 | tt= wallTimeSub(&message->inE->wallTime, &message->outE->wallTime); | |
475 | if (tt <= 0) | |
476 | { | |
477 | messageStats->inversionNb++; | |
478 | } | |
8d7d16dd | 479 | else if (syncState->graphsStream) |
4ee223e5 | 480 | { |
e072e1ab BP |
481 | struct RttKey rttKey= { |
482 | .saddr=MIN(message->inE->event.tcpEvent->segmentKey->connectionKey.saddr, | |
483 | message->inE->event.tcpEvent->segmentKey->connectionKey.daddr), | |
484 | .daddr=MAX(message->inE->event.tcpEvent->segmentKey->connectionKey.saddr, | |
485 | message->inE->event.tcpEvent->segmentKey->connectionKey.daddr), | |
486 | }; | |
487 | AnalysisGraphEval* graph= g_hash_table_lookup(analysisData->graphs, | |
488 | &rttKey); | |
489 | ||
490 | if (graph == NULL) | |
491 | { | |
492 | struct RttKey* tableKey= malloc(sizeof(*tableKey)); | |
493 | ||
494 | graph= constructAnalysisGraphEval(syncState->graphsDir, &rttKey); | |
495 | memcpy(tableKey, &rttKey, sizeof(*tableKey)); | |
496 | g_hash_table_insert(analysisData->graphs, tableKey, graph); | |
497 | } | |
498 | ||
499 | if (message->inE->event.udpEvent->datagramKey->saddr < | |
500 | message->inE->event.udpEvent->datagramKey->daddr) | |
501 | { | |
502 | hitBin(&graph->ttSendBins, tt); | |
503 | } | |
504 | else | |
505 | { | |
506 | hitBin(&graph->ttRecvBins, tt); | |
507 | } | |
4ee223e5 | 508 | } |
76be6fc2 | 509 | |
d4721e1a BP |
510 | rttKey.saddr= |
511 | message->inE->event.tcpEvent->segmentKey->connectionKey.saddr; | |
512 | rttKey.daddr= | |
513 | message->inE->event.tcpEvent->segmentKey->connectionKey.daddr; | |
514 | rtt= g_hash_table_lookup(analysisData->rttInfo, &rttKey); | |
515 | g_debug("rttInfo, looking up (%u, %u)->(%f)", rttKey.saddr, | |
516 | rttKey.daddr, rtt ? *rtt : NAN); | |
76be6fc2 | 517 | |
d4721e1a | 518 | if (rtt) |
76be6fc2 | 519 | { |
d4721e1a BP |
520 | g_debug("rttInfo, tt: %f rtt / 2: %f", tt, *rtt / 2.); |
521 | if (tt < *rtt / 2.) | |
76be6fc2 BP |
522 | { |
523 | messageStats->tooFastNb++; | |
524 | } | |
525 | } | |
526 | else | |
527 | { | |
528 | messageStats->noRTTInfoNb++; | |
529 | } | |
cdce23b3 BP |
530 | } |
531 | ||
532 | ||
533 | /* | |
534 | * Perform analysis on multiple messages | |
535 | * | |
76be6fc2 BP |
536 | * Measure the RTT |
537 | * | |
cdce23b3 BP |
538 | * Args: |
539 | * syncState container for synchronization data | |
540 | * exchange structure containing the messages | |
541 | */ | |
542 | static void analyzeExchangeEval(SyncState* const syncState, Exchange* const exchange) | |
543 | { | |
d4721e1a BP |
544 | AnalysisDataEval* analysisData= syncState->analysisData; |
545 | Message* m1= g_queue_peek_tail(exchange->acks); | |
546 | Message* m2= exchange->message; | |
547 | struct RttKey* rttKey; | |
548 | double* rtt, * exchangeRtt; | |
cdce23b3 | 549 | |
d4721e1a BP |
550 | if (!syncState->stats) |
551 | { | |
552 | return; | |
553 | } | |
554 | ||
e072e1ab BP |
555 | g_assert(m1->inE->type == TCP); |
556 | ||
d4721e1a BP |
557 | // (T2 - T1) - (T3 - T4) |
558 | rtt= malloc(sizeof(double)); | |
559 | *rtt= wallTimeSub(&m1->inE->wallTime, &m1->outE->wallTime) - | |
560 | wallTimeSub(&m2->outE->wallTime, &m2->inE->wallTime); | |
561 | ||
d4721e1a BP |
562 | rttKey= malloc(sizeof(struct RttKey)); |
563 | rttKey->saddr= | |
564 | MIN(m1->inE->event.tcpEvent->segmentKey->connectionKey.saddr, | |
565 | m1->inE->event.tcpEvent->segmentKey->connectionKey.daddr); | |
566 | rttKey->daddr= | |
567 | MAX(m1->inE->event.tcpEvent->segmentKey->connectionKey.saddr, | |
568 | m1->inE->event.tcpEvent->segmentKey->connectionKey.daddr); | |
e072e1ab BP |
569 | |
570 | if (syncState->graphsStream) | |
571 | { | |
572 | AnalysisGraphEval* graph= g_hash_table_lookup(analysisData->graphs, | |
573 | rttKey); | |
574 | ||
575 | if (graph == NULL) | |
576 | { | |
577 | struct RttKey* tableKey= malloc(sizeof(*tableKey)); | |
578 | ||
579 | graph= constructAnalysisGraphEval(syncState->graphsDir, rttKey); | |
580 | memcpy(tableKey, rttKey, sizeof(*tableKey)); | |
581 | g_hash_table_insert(analysisData->graphs, tableKey, graph); | |
582 | } | |
583 | ||
584 | hitBin(&graph->hrttBins, *rtt / 2); | |
585 | } | |
586 | ||
d4721e1a BP |
587 | exchangeRtt= g_hash_table_lookup(analysisData->stats->exchangeRtt, |
588 | rttKey); | |
589 | ||
590 | if (exchangeRtt) | |
591 | { | |
592 | if (*rtt < *exchangeRtt) | |
593 | { | |
594 | g_hash_table_replace(analysisData->stats->exchangeRtt, rttKey, rtt); | |
595 | } | |
596 | } | |
597 | else | |
598 | { | |
599 | g_hash_table_insert(analysisData->stats->exchangeRtt, rttKey, rtt); | |
600 | } | |
cdce23b3 BP |
601 | } |
602 | ||
603 | ||
604 | /* | |
605 | * Perform analysis on muliple events | |
606 | * | |
76be6fc2 BP |
607 | * Sum the broadcast differential delays |
608 | * | |
cdce23b3 BP |
609 | * Args: |
610 | * syncState container for synchronization data | |
611 | * broadcast structure containing the events | |
612 | */ | |
613 | static void analyzeBroadcastEval(SyncState* const syncState, Broadcast* const broadcast) | |
614 | { | |
615 | AnalysisDataEval* analysisData; | |
76be6fc2 BP |
616 | double sum= 0, squaresSum= 0; |
617 | double y; | |
618 | ||
619 | if (!syncState->stats) | |
620 | { | |
621 | return; | |
622 | } | |
cdce23b3 BP |
623 | |
624 | analysisData= (AnalysisDataEval*) syncState->analysisData; | |
76be6fc2 BP |
625 | |
626 | g_queue_foreach(broadcast->events, &gfSum, &sum); | |
627 | g_queue_foreach(broadcast->events, &gfSumSquares, &squaresSum); | |
628 | ||
629 | analysisData->stats->broadcastNb++; | |
630 | // Because of numerical errors, this can at times be < 0 | |
631 | y= squaresSum / g_queue_get_length(broadcast->events) - pow(sum / | |
632 | g_queue_get_length(broadcast->events), 2.); | |
633 | if (y > 0) | |
634 | { | |
635 | analysisData->stats->broadcastDiffSum+= sqrt(y); | |
636 | } | |
cdce23b3 BP |
637 | } |
638 | ||
639 | ||
640 | /* | |
641 | * Finalize the factor calculations | |
642 | * | |
643 | * Since this module does not really calculate factors, identity factors are | |
644 | * returned. | |
645 | * | |
646 | * Args: | |
647 | * syncState container for synchronization data. | |
648 | * | |
649 | * Returns: | |
d4721e1a | 650 | * Factors[traceNb] identity factors for each trace |
cdce23b3 BP |
651 | */ |
652 | static GArray* finalizeAnalysisEval(SyncState* const syncState) | |
653 | { | |
654 | GArray* factors; | |
655 | unsigned int i; | |
4ee223e5 BP |
656 | AnalysisDataEval* analysisData= syncState->analysisData; |
657 | ||
8d7d16dd | 658 | if (syncState->graphsStream && analysisData->graphs) |
4ee223e5 | 659 | { |
e072e1ab BP |
660 | g_hash_table_foreach(analysisData->graphs, &ghfWriteGraph, &(struct |
661 | WriteGraphInfo) {.rttInfo= analysisData->rttInfo, | |
662 | .graphsStream= syncState->graphsStream}); | |
663 | g_hash_table_destroy(analysisData->graphs); | |
4ee223e5 BP |
664 | analysisData->graphs= NULL; |
665 | } | |
cdce23b3 BP |
666 | |
667 | factors= g_array_sized_new(FALSE, FALSE, sizeof(Factors), | |
668 | syncState->traceNb); | |
669 | g_array_set_size(factors, syncState->traceNb); | |
670 | for (i= 0; i < syncState->traceNb; i++) | |
671 | { | |
672 | Factors* e; | |
673 | ||
674 | e= &g_array_index(factors, Factors, i); | |
675 | e->drift= 1.; | |
676 | e->offset= 0.; | |
677 | } | |
678 | ||
679 | return factors; | |
680 | } | |
681 | ||
682 | ||
683 | /* | |
684 | * Print statistics related to analysis. Must be called after | |
685 | * finalizeAnalysis. | |
686 | * | |
687 | * Args: | |
688 | * syncState container for synchronization data. | |
689 | */ | |
690 | static void printAnalysisStatsEval(SyncState* const syncState) | |
691 | { | |
692 | AnalysisDataEval* analysisData; | |
f109919b BP |
693 | unsigned int i, j, k; |
694 | unsigned int totInversion= 0, totTooFast= 0, totNoInfo= 0, totTotal= 0; | |
695 | int charNb; | |
cdce23b3 BP |
696 | |
697 | if (!syncState->stats) | |
698 | { | |
699 | return; | |
700 | } | |
701 | ||
702 | analysisData= (AnalysisDataEval*) syncState->analysisData; | |
703 | ||
704 | printf("Synchronization evaluation analysis stats:\n"); | |
705 | printf("\tsum of broadcast differential delays: %g\n", | |
706 | analysisData->stats->broadcastDiffSum); | |
76be6fc2 BP |
707 | printf("\taverage broadcast differential delays: %g\n", |
708 | analysisData->stats->broadcastDiffSum / | |
709 | analysisData->stats->broadcastNb); | |
cdce23b3 BP |
710 | |
711 | printf("\tIndividual evaluation:\n" | |
f109919b | 712 | "\t\tTrace pair Inversions Too fast No RTT info Total\n"); |
cdce23b3 BP |
713 | |
714 | for (i= 0; i < syncState->traceNb; i++) | |
715 | { | |
716 | for (j= i + 1; j < syncState->traceNb; j++) | |
717 | { | |
76be6fc2 | 718 | MessageStats* messageStats; |
f109919b BP |
719 | struct { |
720 | unsigned int t1, t2; | |
721 | } loopValues[]= { | |
722 | {i, j}, | |
723 | {j, i} | |
724 | }; | |
725 | ||
726 | for (k= 0; k < sizeof(loopValues) / sizeof(*loopValues); k++) | |
727 | { | |
728 | messageStats= | |
729 | &analysisData->stats->messageStats[loopValues[k].t1][loopValues[k].t2]; | |
730 | ||
731 | printf("\t\t%3d - %-3d ", loopValues[k].t1, loopValues[k].t2); | |
732 | printf("%u (%u%%)%n", messageStats->inversionNb, (unsigned | |
733 | int) ceil((double) messageStats->inversionNb / | |
734 | messageStats->total * 100), &charNb); | |
735 | printf("%*s", 17 - charNb > 0 ? 17 - charNb + 1: 1, " "); | |
736 | printf("%u (%u%%)%n", messageStats->tooFastNb, (unsigned int) | |
737 | ceil((double) messageStats->tooFastNb / | |
738 | messageStats->total * 100), &charNb); | |
739 | printf("%*s%-10u %u\n", 17 - charNb > 0 ? 17 - charNb + 1: | |
740 | 1, " ", messageStats->noRTTInfoNb, messageStats->total); | |
741 | ||
742 | totInversion+= messageStats->inversionNb; | |
743 | totTooFast+= messageStats->tooFastNb; | |
744 | totNoInfo+= messageStats->noRTTInfoNb; | |
745 | totTotal+= messageStats->total; | |
746 | } | |
cdce23b3 BP |
747 | } |
748 | } | |
d4721e1a | 749 | |
f109919b BP |
750 | printf("\t\t total "); |
751 | printf("%u (%u%%)%n", totInversion, (unsigned int) ceil((double) | |
752 | totInversion / totTotal * 100), &charNb); | |
753 | printf("%*s", 17 - charNb > 0 ? 17 - charNb + 1: 1, " "); | |
754 | printf("%u (%u%%)%n", totTooFast, (unsigned int) ceil((double) totTooFast | |
755 | / totTotal * 100), &charNb); | |
756 | printf("%*s%-10u %u\n", 17 - charNb > 0 ? 17 - charNb + 1: 1, " ", | |
757 | totNoInfo, totTotal); | |
758 | ||
d4721e1a BP |
759 | printf("\tRound-trip times:\n" |
760 | "\t\tHost pair RTT from exchanges RTTs from file (ms)\n"); | |
761 | g_hash_table_foreach(analysisData->stats->exchangeRtt, | |
762 | &ghfPrintExchangeRtt, analysisData->rttInfo); | |
763 | } | |
764 | ||
765 | ||
766 | /* | |
767 | * A GHFunc for g_hash_table_foreach() | |
768 | * | |
769 | * Args: | |
770 | * key: RttKey* where saddr < daddr | |
771 | * value: double*, RTT estimated from exchanges | |
772 | * user_data GHashTable* rttInfo | |
773 | */ | |
774 | static void ghfPrintExchangeRtt(gpointer key, gpointer value, gpointer user_data) | |
775 | { | |
776 | char addr1[16], addr2[16]; | |
777 | struct RttKey* rttKey1= key; | |
778 | struct RttKey rttKey2= {rttKey1->daddr, rttKey1->saddr}; | |
779 | double* fileRtt1, *fileRtt2; | |
780 | GHashTable* rttInfo= user_data; | |
781 | ||
782 | convertIP(addr1, rttKey1->saddr); | |
783 | convertIP(addr2, rttKey1->daddr); | |
784 | ||
785 | fileRtt1= g_hash_table_lookup(rttInfo, rttKey1); | |
786 | fileRtt2= g_hash_table_lookup(rttInfo, &rttKey2); | |
787 | ||
788 | printf("\t\t(%15s, %-15s) %-18.3f ", addr1, addr2, *(double*) value * 1e3); | |
789 | ||
790 | if (fileRtt1 || fileRtt2) | |
791 | { | |
792 | if (fileRtt1) | |
793 | { | |
794 | printf("%.3f", *fileRtt1 * 1e3); | |
795 | } | |
796 | if (fileRtt1 && fileRtt2) | |
797 | { | |
798 | printf(", "); | |
799 | } | |
800 | if (fileRtt2) | |
801 | { | |
802 | printf("%.3f", *fileRtt2 * 1e3); | |
803 | } | |
804 | } | |
805 | else | |
806 | { | |
807 | printf("-"); | |
808 | } | |
809 | printf("\n"); | |
cdce23b3 | 810 | } |
2bd4b3e4 BP |
811 | |
812 | ||
813 | /* | |
814 | * A GHashFunc for g_hash_table_new() | |
815 | * | |
816 | * Args: | |
817 | * key struct RttKey* | |
818 | */ | |
819 | static guint ghfRttKeyHash(gconstpointer key) | |
820 | { | |
821 | struct RttKey* rttKey; | |
822 | uint32_t a, b, c; | |
823 | ||
824 | rttKey= (struct RttKey*) key; | |
825 | ||
826 | a= rttKey->saddr; | |
827 | b= rttKey->daddr; | |
828 | c= 0; | |
829 | final(a, b, c); | |
830 | ||
831 | return c; | |
832 | } | |
833 | ||
834 | ||
835 | /* | |
836 | * A GDestroyNotify function for g_hash_table_new_full() | |
837 | * | |
838 | * Args: | |
839 | * data: struct RttKey* | |
840 | */ | |
841 | static void gdnDestroyRttKey(gpointer data) | |
842 | { | |
843 | free(data); | |
844 | } | |
845 | ||
846 | ||
847 | /* | |
848 | * A GDestroyNotify function for g_hash_table_new_full() | |
849 | * | |
850 | * Args: | |
851 | * data: double* | |
852 | */ | |
853 | static void gdnDestroyDouble(gpointer data) | |
854 | { | |
855 | free(data); | |
856 | } | |
857 | ||
858 | ||
859 | /* | |
860 | * A GEqualFunc for g_hash_table_new() | |
861 | * | |
862 | * Args: | |
863 | * a, b RttKey* | |
864 | * | |
865 | * Returns: | |
866 | * TRUE if both values are equal | |
867 | */ | |
868 | static gboolean gefRttKeyEqual(gconstpointer a, gconstpointer b) | |
869 | { | |
870 | const struct RttKey* rkA, * rkB; | |
871 | ||
872 | rkA= (struct RttKey*) a; | |
873 | rkB= (struct RttKey*) b; | |
874 | ||
875 | if (rkA->saddr == rkB->saddr && rkA->daddr == rkB->daddr) | |
876 | { | |
877 | return TRUE; | |
878 | } | |
879 | else | |
880 | { | |
881 | return FALSE; | |
882 | } | |
883 | } | |
884 | ||
885 | ||
886 | /* | |
887 | * Read a file contain minimum round trip time values and fill an array with | |
888 | * them. The file is formatted as such: | |
889 | * <host1 IP> <host2 IP> <RTT in milliseconds> | |
890 | * ip's should be in dotted quad format | |
891 | * | |
892 | * Args: | |
893 | * rttInfo: double* rttInfo[RttKey], empty table, will be filled | |
894 | * rttStream: stream from which to read | |
895 | */ | |
896 | static void readRttInfo(GHashTable* rttInfo, FILE* rttStream) | |
897 | { | |
898 | char* line= NULL; | |
899 | size_t len; | |
900 | int retval; | |
901 | ||
902 | positionStream(rttStream); | |
903 | retval= getline(&line, &len, rttStream); | |
904 | while(!feof(rttStream)) | |
905 | { | |
906 | struct RttKey* rttKey; | |
907 | char saddrDQ[20], daddrDQ[20]; | |
908 | double* rtt; | |
909 | char tmp; | |
910 | struct in_addr addr; | |
911 | unsigned int i; | |
912 | struct { | |
913 | char* dq; | |
914 | size_t offset; | |
915 | } loopValues[] = { | |
916 | {saddrDQ, offsetof(struct RttKey, saddr)}, | |
917 | {daddrDQ, offsetof(struct RttKey, daddr)} | |
918 | }; | |
919 | ||
920 | if (retval == -1 && !feof(rttStream)) | |
921 | { | |
922 | g_error(strerror(errno)); | |
923 | } | |
924 | ||
925 | if (line[retval - 1] == '\n') | |
926 | { | |
927 | line[retval - 1]= '\0'; | |
928 | } | |
929 | ||
930 | rtt= malloc(sizeof(double)); | |
931 | retval= sscanf(line, " %19s %19s %lf %c", saddrDQ, daddrDQ, rtt, | |
932 | &tmp); | |
933 | if (retval == EOF) | |
934 | { | |
935 | g_error(strerror(errno)); | |
936 | } | |
937 | else if (retval != 3) | |
938 | { | |
939 | g_error("Error parsing RTT file, line was '%s'", line); | |
940 | } | |
941 | ||
942 | rttKey= malloc(sizeof(struct RttKey)); | |
943 | for (i= 0; i < sizeof(loopValues) / sizeof(*loopValues); i++) | |
944 | { | |
945 | retval= inet_aton(loopValues[i].dq, &addr); | |
946 | if (retval == 0) | |
947 | { | |
948 | g_error("Error converting address '%s'", loopValues[i].dq); | |
949 | } | |
950 | *(uint32_t*) ((void*) rttKey + loopValues[i].offset)= | |
951 | addr.s_addr; | |
952 | } | |
953 | ||
76be6fc2 | 954 | *rtt/= 1e3; |
d4721e1a BP |
955 | g_debug("rttInfo, Inserting (%u, %u)->(%f)", rttKey->saddr, |
956 | rttKey->daddr, *rtt); | |
2bd4b3e4 BP |
957 | g_hash_table_insert(rttInfo, rttKey, rtt); |
958 | ||
959 | positionStream(rttStream); | |
960 | retval= getline(&line, &len, rttStream); | |
961 | } | |
962 | ||
963 | if (line) | |
964 | { | |
965 | free(line); | |
966 | } | |
967 | } | |
968 | ||
969 | ||
970 | /* | |
971 | * Advance stream over empty space, empty lines and lines that begin with '#' | |
972 | * | |
973 | * Args: | |
974 | * stream: stream, at exit, will be over the first non-empty character | |
975 | * of a line of be at EOF | |
976 | */ | |
977 | static void positionStream(FILE* stream) | |
978 | { | |
979 | int firstChar; | |
980 | ssize_t retval; | |
981 | char* line= NULL; | |
982 | size_t len; | |
983 | ||
984 | do | |
985 | { | |
986 | firstChar= fgetc(stream); | |
987 | if (firstChar == (int) '#') | |
988 | { | |
989 | retval= getline(&line, &len, stream); | |
990 | if (retval == -1) | |
991 | { | |
992 | if (feof(stream)) | |
993 | { | |
994 | goto outEof; | |
995 | } | |
996 | else | |
997 | { | |
998 | g_error(strerror(errno)); | |
999 | } | |
1000 | } | |
1001 | } | |
1002 | else if (firstChar == (int) '\n' || firstChar == (int) ' ' || | |
1003 | firstChar == (int) '\t') | |
1004 | {} | |
1005 | else if (firstChar == EOF) | |
1006 | { | |
1007 | goto outEof; | |
1008 | } | |
1009 | else | |
1010 | { | |
1011 | break; | |
1012 | } | |
1013 | } while (true); | |
1014 | retval= ungetc(firstChar, stream); | |
1015 | if (retval == EOF) | |
1016 | { | |
1017 | g_error("Error: ungetc()"); | |
1018 | } | |
1019 | ||
1020 | outEof: | |
1021 | if (line) | |
1022 | { | |
1023 | free(line); | |
1024 | } | |
1025 | } | |
76be6fc2 BP |
1026 | |
1027 | ||
1028 | /* | |
1029 | * A GFunc for g_queue_foreach() | |
1030 | * | |
1031 | * Args: | |
1032 | * data Event*, a UDP broadcast event | |
1033 | * user_data double*, the running sum | |
1034 | * | |
1035 | * Returns: | |
1036 | * Adds the time of the event to the sum | |
1037 | */ | |
1038 | static void gfSum(gpointer data, gpointer userData) | |
1039 | { | |
1040 | Event* event= (Event*) data; | |
1041 | ||
1042 | *(double*) userData+= event->wallTime.seconds + event->wallTime.nanosec / | |
1043 | 1e9; | |
1044 | } | |
1045 | ||
1046 | ||
1047 | /* | |
1048 | * A GFunc for g_queue_foreach() | |
1049 | * | |
1050 | * Args: | |
1051 | * data Event*, a UDP broadcast event | |
1052 | * user_data double*, the running sum | |
1053 | * | |
1054 | * Returns: | |
1055 | * Adds the square of the time of the event to the sum | |
1056 | */ | |
1057 | static void gfSumSquares(gpointer data, gpointer userData) | |
1058 | { | |
1059 | Event* event= (Event*) data; | |
1060 | ||
1061 | *(double*) userData+= pow(event->wallTime.seconds + event->wallTime.nanosec | |
1062 | / 1e9, 2.); | |
1063 | } | |
4ee223e5 BP |
1064 | |
1065 | ||
e072e1ab BP |
1066 | /* |
1067 | * Update a struct Bins according to a new value | |
1068 | * | |
1069 | * Args: | |
1070 | * bins: the structure containing bins to build a histrogram | |
1071 | * value: the new value | |
1072 | */ | |
1073 | static void hitBin(struct Bins* const bins, const double value) | |
1074 | { | |
1075 | unsigned int binN= binNum(value); | |
1076 | ||
1077 | if (binN < bins->min) | |
1078 | { | |
1079 | bins->min= binN; | |
1080 | } | |
1081 | else if (binN > bins->max) | |
1082 | { | |
1083 | bins->max= binN; | |
1084 | } | |
1085 | ||
1086 | bins->total++; | |
1087 | ||
1088 | bins->bin[binN]++; | |
1089 | } | |
1090 | ||
1091 | ||
4ee223e5 BP |
1092 | /* |
1093 | * Figure out the bin in a histogram to which a value belongs. | |
1094 | * | |
1095 | * This uses exponentially sized bins that go from 0 to infinity. | |
1096 | * | |
1097 | * Args: | |
e072e1ab BP |
1098 | * value: in the range -INFINITY to INFINITY |
1099 | * | |
1100 | * Returns: | |
1101 | * The number of the bin in a struct Bins.bin | |
4ee223e5 BP |
1102 | */ |
1103 | static unsigned int binNum(const double value) | |
1104 | { | |
e072e1ab | 1105 | if (value <= 0) |
4ee223e5 BP |
1106 | { |
1107 | return 0; | |
1108 | } | |
e072e1ab BP |
1109 | else if (value < binEnd(1)) |
1110 | { | |
1111 | return 1; | |
1112 | } | |
1113 | else if (value >= binStart(BIN_NB - 1)) | |
1114 | { | |
1115 | return BIN_NB - 1; | |
1116 | } | |
4ee223e5 BP |
1117 | else |
1118 | { | |
e072e1ab | 1119 | return floor(log(value) / log(binBase)) + BIN_NB + 1; |
4ee223e5 BP |
1120 | } |
1121 | } | |
1122 | ||
1123 | ||
1124 | /* | |
e072e1ab BP |
1125 | * Figure out the start of the interval of a bin in a histogram. See struct |
1126 | * Bins. | |
4ee223e5 BP |
1127 | * |
1128 | * This uses exponentially sized bins that go from 0 to infinity. | |
1129 | * | |
1130 | * Args: | |
1131 | * binNum: bin number | |
e072e1ab BP |
1132 | * |
1133 | * Return: | |
1134 | * The start of the interval, this value is included in the interval (except | |
1135 | * for -INFINITY, naturally) | |
4ee223e5 BP |
1136 | */ |
1137 | static double binStart(const unsigned int binNum) | |
1138 | { | |
e072e1ab | 1139 | g_assert_cmpuint(binNum, <, BIN_NB); |
4ee223e5 BP |
1140 | |
1141 | if (binNum == 0) | |
1142 | { | |
e072e1ab BP |
1143 | return -INFINITY; |
1144 | } | |
1145 | else if (binNum == 1) | |
1146 | { | |
1147 | return 0.; | |
4ee223e5 BP |
1148 | } |
1149 | else | |
1150 | { | |
e072e1ab | 1151 | return pow(binBase, (double) binNum - BIN_NB + 1); |
4ee223e5 BP |
1152 | } |
1153 | } | |
1154 | ||
1155 | ||
1156 | /* | |
e072e1ab BP |
1157 | * Figure out the end of the interval of a bin in a histogram. See struct |
1158 | * Bins. | |
4ee223e5 BP |
1159 | * |
1160 | * This uses exponentially sized bins that go from 0 to infinity. | |
1161 | * | |
1162 | * Args: | |
1163 | * binNum: bin number | |
e072e1ab BP |
1164 | * |
1165 | * Return: | |
1166 | * The end of the interval, this value is not included in the interval | |
4ee223e5 BP |
1167 | */ |
1168 | static double binEnd(const unsigned int binNum) | |
1169 | { | |
e072e1ab | 1170 | g_assert_cmpuint(binNum, <, BIN_NB); |
4ee223e5 | 1171 | |
e072e1ab | 1172 | if (binNum == 0) |
4ee223e5 | 1173 | { |
e072e1ab BP |
1174 | return 0.; |
1175 | } | |
1176 | else if (binNum < BIN_NB - 1) | |
1177 | { | |
1178 | return pow(binBase, (double) binNum - BIN_NB + 2); | |
4ee223e5 BP |
1179 | } |
1180 | else | |
1181 | { | |
1182 | return INFINITY; | |
1183 | } | |
1184 | } |