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/>.
19 #define _ISOC99_SOURCE
25 #include <arpa/inet.h>
28 #include <netinet/in.h>
33 #include <sys/socket.h>
37 #include "sync_chain.h"
38 #include "event_analysis_chull.h"
40 #include "event_analysis_eval.h"
43 struct WriteHistogramInfo
54 GArray
* iArray
, * jArray
, * aArray
;
58 // Functions common to all analysis modules
59 static void initAnalysisEval(SyncState
* const syncState
);
60 static void destroyAnalysisEval(SyncState
* const syncState
);
62 static void analyzeMessageEval(SyncState
* const syncState
, Message
* const
64 static void analyzeExchangeEval(SyncState
* const syncState
, Exchange
* const
66 static void analyzeBroadcastEval(SyncState
* const syncState
, Broadcast
* const
68 static GArray
* finalizeAnalysisEval(SyncState
* const syncState
);
69 static void printAnalysisStatsEval(SyncState
* const syncState
);
70 static void writeAnalysisTraceTimeBackPlotsEval(SyncState
* const syncState
,
71 const unsigned int i
, const unsigned int j
);
72 static void writeAnalysisTraceTimeForePlotsEval(SyncState
* const syncState
,
73 const unsigned int i
, const unsigned int j
);
74 static void writeAnalysisTraceTraceBackPlotsEval(SyncState
* const syncState
,
75 const unsigned int i
, const unsigned int j
);
76 static void writeAnalysisTraceTraceForePlotsEval(SyncState
* const syncState
,
77 const unsigned int i
, const unsigned int j
);
79 // Functions specific to this module
80 static guint
ghfRttKeyHash(gconstpointer key
);
81 static gboolean
gefRttKeyEqual(gconstpointer a
, gconstpointer b
);
82 static void gdnDestroyRttKey(gpointer data
);
83 static void gdnDestroyDouble(gpointer data
);
84 static void readRttInfo(GHashTable
* rttInfo
, FILE* rttFile
);
85 static void positionStream(FILE* stream
);
87 static void gfSum(gpointer data
, gpointer userData
);
88 static void gfSumSquares(gpointer data
, gpointer userData
);
89 static void ghfPrintExchangeRtt(gpointer key
, gpointer value
, gpointer
92 static void hitBin(struct Bins
* const bins
, const double value
);
93 static unsigned int binNum(const double value
) __attribute__((pure
));
94 static double binStart(const unsigned int binNum
) __attribute__((pure
));
95 static double binEnd(const unsigned int binNum
) __attribute__((pure
));
96 static uint32_t normalTotal(struct Bins
* const bins
) __attribute__((const));
98 static AnalysisHistogramEval
* constructAnalysisHistogramEval(const char* const
99 graphsDir
, const struct RttKey
* const rttKey
);
100 static void destroyAnalysisHistogramEval(AnalysisHistogramEval
* const
102 static void gdnDestroyAnalysisHistogramEval(gpointer data
);
103 static void ghfWriteHistogram(gpointer key
, gpointer value
, gpointer
105 static void dumpBinToFile(const struct Bins
* const bins
, FILE* const file
);
106 static void writeHistogram(FILE* graphsStream
, const struct RttKey
* rttKey
,
107 double* minRtt
, AnalysisHistogramEval
* const histogram
);
109 static void updateBounds(Bounds
** const bounds
, Event
* const e1
, Event
* const
112 static void finalizeAnalysisEvalLP(SyncState
* const syncState
);
113 // The next group of functions is only needed when computing synchronization
116 static glp_prob
* lpCreateProblem(GQueue
* const lowerHull
, GQueue
* const
118 static void gfLPAddRow(gpointer data
, gpointer user_data
);
119 static Factors
* calculateFactors(glp_prob
* const lp
, const int direction
);
120 static void calculateCompleteFactors(glp_prob
* const lp
, FactorsCHull
*
122 static FactorsCHull
** createAllFactors(const unsigned int traceNb
);
126 // initialized in registerAnalysisEval()
129 static AnalysisModule analysisModuleEval
= {
131 .initAnalysis
= &initAnalysisEval
,
132 .destroyAnalysis
= &destroyAnalysisEval
,
133 .analyzeMessage
= &analyzeMessageEval
,
134 .analyzeExchange
= &analyzeExchangeEval
,
135 .analyzeBroadcast
= &analyzeBroadcastEval
,
136 .finalizeAnalysis
= &finalizeAnalysisEval
,
137 .printAnalysisStats
= &printAnalysisStatsEval
,
139 .writeTraceTimeBackPlots
= &writeAnalysisTraceTimeBackPlotsEval
,
140 .writeTraceTimeForePlots
= &writeAnalysisTraceTimeForePlotsEval
,
141 .writeTraceTraceBackPlots
= &writeAnalysisTraceTraceBackPlotsEval
,
142 .writeTraceTraceForePlots
= &writeAnalysisTraceTraceForePlotsEval
,
146 static ModuleOption optionEvalRttFile
= {
147 .longName
= "eval-rtt-file",
148 .hasArg
= REQUIRED_ARG
,
149 .optionHelp
= "specify the file containing RTT information",
155 * Analysis module registering function
157 void registerAnalysisEval()
159 binBase
= exp10(6. / (BIN_NB
- 3));
161 g_queue_push_tail(&analysisModules
, &analysisModuleEval
);
162 g_queue_push_tail(&moduleOptions
, &optionEvalRttFile
);
167 * Analysis init function
169 * This function is called at the beginning of a synchronization run for a set
173 * syncState container for synchronization data.
175 static void initAnalysisEval(SyncState
* const syncState
)
177 AnalysisDataEval
* analysisData
;
180 analysisData
= malloc(sizeof(AnalysisDataEval
));
181 syncState
->analysisData
= analysisData
;
183 analysisData
->rttInfo
= g_hash_table_new_full(&ghfRttKeyHash
,
184 &gefRttKeyEqual
, &gdnDestroyRttKey
, &gdnDestroyDouble
);
185 if (optionEvalRttFile
.arg
)
190 rttStream
= fopen(optionEvalRttFile
.arg
, "r");
191 if (rttStream
== NULL
)
193 g_error(strerror(errno
));
196 readRttInfo(analysisData
->rttInfo
, rttStream
);
198 retval
= fclose(rttStream
);
201 g_error(strerror(errno
));
205 if (syncState
->stats
)
207 analysisData
->stats
= calloc(1, sizeof(AnalysisStatsEval
));
208 analysisData
->stats
->broadcastRangeMin
= INFINITY
;
209 analysisData
->stats
->broadcastRangeMax
= -INFINITY
;
211 analysisData
->stats
->messageStats
= malloc(syncState
->traceNb
*
212 sizeof(MessageStats
*));
213 for (i
= 0; i
< syncState
->traceNb
; i
++)
215 analysisData
->stats
->messageStats
[i
]= calloc(syncState
->traceNb
,
216 sizeof(MessageStats
));
219 analysisData
->stats
->exchangeRtt
=
220 g_hash_table_new_full(&ghfRttKeyHash
, &gefRttKeyEqual
,
221 &gdnDestroyRttKey
, &gdnDestroyDouble
);
224 analysisData
->stats
->chFactorsArray
= NULL
;
225 analysisData
->stats
->lpFactorsArray
= NULL
;
229 if (syncState
->graphsStream
)
231 AnalysisGraphsEval
* graphs
= malloc(sizeof(AnalysisGraphsEval
));
233 analysisData
->graphs
= graphs
;
235 graphs
->histograms
= g_hash_table_new_full(&ghfRttKeyHash
,
236 &gefRttKeyEqual
, &gdnDestroyRttKey
,
237 &gdnDestroyAnalysisHistogramEval
);
239 graphs
->bounds
= malloc(syncState
->traceNb
* sizeof(Bounds
*));
240 for (i
= 0; i
< syncState
->traceNb
; i
++)
242 graphs
->bounds
[i
]= malloc(i
* sizeof(Bounds
));
243 for (j
= 0; j
< i
; j
++)
245 graphs
->bounds
[i
][j
].min
= UINT64_MAX
;
246 graphs
->bounds
[i
][j
].max
= 0;
252 graphs
->lpFactorsArray
= NULL
;
256 if (syncState
->stats
|| syncState
->graphsStream
)
260 analysisData
->chullSS
= malloc(sizeof(SyncState
));
261 memcpy(analysisData
->chullSS
, syncState
, sizeof(SyncState
));
262 analysisData
->chullSS
->stats
= false;
263 analysisData
->chullSS
->analysisData
= NULL
;
264 result
= g_queue_find_custom(&analysisModules
, "chull",
265 &gcfCompareAnalysis
);
266 analysisData
->chullSS
->analysisModule
= (AnalysisModule
*) result
->data
;
267 analysisData
->chullSS
->analysisModule
->initAnalysis(analysisData
->chullSS
);
273 * Create and open files used to store histogram points to generate graphs.
274 * Create data structures to store histogram points during analysis.
277 * graphsDir: folder where to write files
278 * rttKey: host pair, make sure saddr < daddr
280 static AnalysisHistogramEval
* constructAnalysisHistogramEval(const char* const
281 graphsDir
, const struct RttKey
* const rttKey
)
286 char name
[60], saddr
[16], daddr
[16];
287 AnalysisHistogramEval
* histogram
= calloc(1, sizeof(*histogram
));
290 const char* fileName
;
291 const char* host1
, *host2
;
293 {offsetof(AnalysisHistogramEval
, ttSendPoints
),
294 "analysis_eval_tt-%s_to_%s.data", saddr
, daddr
},
295 {offsetof(AnalysisHistogramEval
, ttRecvPoints
),
296 "analysis_eval_tt-%s_to_%s.data", daddr
, saddr
},
297 {offsetof(AnalysisHistogramEval
, hrttPoints
),
298 "analysis_eval_hrtt-%s_and_%s.data", saddr
, daddr
},
301 histogram
->ttSendBins
.min
= BIN_NB
- 1;
302 histogram
->ttRecvBins
.min
= BIN_NB
- 1;
303 histogram
->hrttBins
.min
= BIN_NB
- 1;
305 convertIP(saddr
, rttKey
->saddr
);
306 convertIP(daddr
, rttKey
->daddr
);
308 cwd
= changeToGraphsDir(graphsDir
);
310 for (i
= 0; i
< sizeof(loopValues
) / sizeof(*loopValues
); i
++)
312 retval
= snprintf(name
, sizeof(name
), loopValues
[i
].fileName
,
313 loopValues
[i
].host1
, loopValues
[i
].host2
);
314 if (retval
> sizeof(name
) - 1)
316 name
[sizeof(name
) - 1]= '\0';
318 if ((*(FILE**)((void*) histogram
+ loopValues
[i
].pointsOffset
)=
319 fopen(name
, "w")) == NULL
)
321 g_error(strerror(errno
));
328 g_error(strerror(errno
));
337 * Close files used to store histogram points to generate graphs.
340 * graphsDir: folder where to write files
341 * rttKey: host pair, make sure saddr < daddr
343 static void destroyAnalysisHistogramEval(AnalysisHistogramEval
* const
351 {offsetof(AnalysisHistogramEval
, ttSendPoints
)},
352 {offsetof(AnalysisHistogramEval
, ttRecvPoints
)},
353 {offsetof(AnalysisHistogramEval
, hrttPoints
)},
356 for (i
= 0; i
< sizeof(loopValues
) / sizeof(*loopValues
); i
++)
358 retval
= fclose(*(FILE**)((void*) histogram
+ loopValues
[i
].pointsOffset
));
361 g_error(strerror(errno
));
370 * A GDestroyNotify function for g_hash_table_new_full()
373 * data: AnalysisHistogramEval*
375 static void gdnDestroyAnalysisHistogramEval(gpointer data
)
377 destroyAnalysisHistogramEval(data
);
382 * A GHFunc for g_hash_table_foreach()
385 * key: RttKey* where saddr < daddr
386 * value: AnalysisHistogramEval*
387 * user_data struct WriteHistogramInfo*
389 static void ghfWriteHistogram(gpointer key
, gpointer value
, gpointer user_data
)
391 double* rtt1
, * rtt2
;
392 struct RttKey
* rttKey
= key
;
393 struct RttKey oppositeRttKey
= {.saddr
= rttKey
->daddr
, .daddr
=
395 AnalysisHistogramEval
* histogram
= value
;
396 struct WriteHistogramInfo
* info
= user_data
;
398 rtt1
= g_hash_table_lookup(info
->rttInfo
, rttKey
);
399 rtt2
= g_hash_table_lookup(info
->rttInfo
, &oppositeRttKey
);
405 else if (rtt2
!= NULL
)
407 rtt1
= MIN(rtt1
, rtt2
);
410 dumpBinToFile(&histogram
->ttSendBins
, histogram
->ttSendPoints
);
411 dumpBinToFile(&histogram
->ttRecvBins
, histogram
->ttRecvPoints
);
412 dumpBinToFile(&histogram
->hrttBins
, histogram
->hrttPoints
);
413 writeHistogram(info
->graphsStream
, rttKey
, rtt1
, histogram
);
418 * Write the content of one bin in a histogram point file
421 * bin: array of values that make up a histogram
422 * file: FILE*, write to this file
424 static void dumpBinToFile(const struct Bins
* const bins
, FILE* const file
)
428 // The first and last bins are skipped, see struct Bins
429 for (i
= 1; i
< BIN_NB
- 1; i
++)
431 if (bins
->bin
[i
] > 0)
433 fprintf(file
, "%20.9f %20.9f %20.9f\n", (binStart(i
) + binEnd(i
))
434 / 2., (double) bins
->bin
[i
] / ((binEnd(i
) - binStart(i
)) *
435 bins
->total
), binEnd(i
) - binStart(i
));
442 * Write the analysis-specific plot in the gnuplot script.
445 * graphsStream: write to this file
446 * rttKey: must be sorted such that saddr < daddr
447 * minRtt: if available, else NULL
448 * histogram: struct that contains the bins for the pair of traces
449 * identified by rttKey
451 static void writeHistogram(FILE* graphsStream
, const struct RttKey
* rttKey
,
452 double* minRtt
, AnalysisHistogramEval
* const histogram
)
454 char saddr
[16], daddr
[16];
456 convertIP(saddr
, rttKey
->saddr
);
457 convertIP(daddr
, rttKey
->daddr
);
459 fprintf(graphsStream
,
461 "set output \"histogram-%s-%s.eps\"\n"
463 "set xlabel \"Message Latency (s)\"\n"
464 "set ylabel \"Proportion of messages per second\"\n", saddr
, daddr
);
468 fprintf(graphsStream
,
469 "set arrow from %.9f, 0 rto 0, graph 1 "
470 "nohead linetype 3 linewidth 3 linecolor rgb \"black\"\n", *minRtt
474 if (normalTotal(&histogram
->ttSendBins
) ||
475 normalTotal(&histogram
->ttRecvBins
) ||
476 normalTotal(&histogram
->hrttBins
))
478 fprintf(graphsStream
, "plot \\\n");
480 if (normalTotal(&histogram
->hrttBins
))
482 fprintf(graphsStream
,
483 "\t\"analysis_eval_hrtt-%s_and_%s.data\" "
484 "title \"RTT/2\" with linespoints linetype 1 linewidth 2 "
485 "linecolor rgb \"black\" pointtype 6 pointsize 1,\\\n",
489 if (normalTotal(&histogram
->ttSendBins
))
491 fprintf(graphsStream
,
492 "\t\"analysis_eval_tt-%1$s_to_%2$s.data\" "
493 "title \"%1$s to %2$s\" with linespoints linetype 4 linewidth 2 "
494 "linecolor rgb \"gray60\" pointtype 6 pointsize 1,\\\n",
498 if (normalTotal(&histogram
->ttRecvBins
))
500 fprintf(graphsStream
,
501 "\t\"analysis_eval_tt-%1$s_to_%2$s.data\" "
502 "title \"%1$s to %2$s\" with linespoints linetype 4 linewidth 2 "
503 "linecolor rgb \"gray30\" pointtype 6 pointsize 1,\\\n",
507 // Remove the ",\\\n" from the last graph plot line
508 if (ftruncate(fileno(graphsStream
), ftell(graphsStream
) - 3) == -1)
510 g_error(strerror(errno
));
512 if (fseek(graphsStream
, 0, SEEK_END
) == -1)
514 g_error(strerror(errno
));
516 fprintf(graphsStream
, "\n");
522 * Analysis destroy function
524 * Free the analysis specific data structures
527 * syncState container for synchronization data.
529 static void destroyAnalysisEval(SyncState
* const syncState
)
532 AnalysisDataEval
* analysisData
;
534 analysisData
= (AnalysisDataEval
*) syncState
->analysisData
;
536 if (analysisData
== NULL
)
541 g_hash_table_destroy(analysisData
->rttInfo
);
543 if (syncState
->stats
)
545 AnalysisStatsEval
* stats
= analysisData
->stats
;
547 for (i
= 0; i
< syncState
->traceNb
; i
++)
549 free(stats
->messageStats
[i
]);
551 free(stats
->messageStats
);
553 g_hash_table_destroy(stats
->exchangeRtt
);
556 freeAllFactors(syncState
->traceNb
, stats
->chFactorsArray
);
557 freeAllFactors(syncState
->traceNb
, stats
->lpFactorsArray
);
563 if (syncState
->graphsStream
)
565 AnalysisGraphsEval
* graphs
= analysisData
->graphs
;
567 if (graphs
->histograms
)
569 g_hash_table_destroy(graphs
->histograms
);
572 for (i
= 0; i
< syncState
->traceNb
; i
++)
574 free(graphs
->bounds
[i
]);
576 free(graphs
->bounds
);
579 for (i
= 0; i
< syncState
->traceNb
; i
++)
583 for (j
= 0; j
< i
; j
++)
585 // There seems to be a memory leak in glpk, valgrind reports a
586 // loss (reachable) even if the problem is deleted
587 glp_delete_prob(graphs
->lps
[i
][j
]);
589 free(graphs
->lps
[i
]);
593 if (!syncState
->stats
)
595 freeAllFactors(syncState
->traceNb
, graphs
->lpFactorsArray
);
602 if (syncState
->stats
|| syncState
->graphsStream
)
604 analysisData
->chullSS
->analysisModule
->destroyAnalysis(analysisData
->chullSS
);
605 free(analysisData
->chullSS
);
608 free(syncState
->analysisData
);
609 syncState
->analysisData
= NULL
;
614 * Perform analysis on an event pair.
616 * Check if there is message inversion or messages that are too fast.
619 * syncState container for synchronization data
620 * message structure containing the events
622 static void analyzeMessageEval(SyncState
* const syncState
, Message
* const
625 AnalysisDataEval
* analysisData
= syncState
->analysisData
;
626 MessageStats
* messageStats
;
629 struct RttKey rttKey
;
631 g_assert(message
->inE
->type
== TCP
);
633 if (syncState
->stats
)
636 &analysisData
->stats
->messageStats
[message
->outE
->traceNum
][message
->inE
->traceNum
];
637 messageStats
->total
++;
640 tt
= wallTimeSub(&message
->inE
->wallTime
, &message
->outE
->wallTime
);
643 if (syncState
->stats
)
645 messageStats
->inversionNb
++;
648 else if (syncState
->graphsStream
)
650 struct RttKey rttKey
= {
651 .saddr
=MIN(message
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.saddr
,
652 message
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.daddr
),
653 .daddr
=MAX(message
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.saddr
,
654 message
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.daddr
),
656 AnalysisHistogramEval
* histogram
=
657 g_hash_table_lookup(analysisData
->graphs
->histograms
, &rttKey
);
659 if (histogram
== NULL
)
661 struct RttKey
* tableKey
= malloc(sizeof(*tableKey
));
663 histogram
= constructAnalysisHistogramEval(syncState
->graphsDir
, &rttKey
);
664 memcpy(tableKey
, &rttKey
, sizeof(*tableKey
));
665 g_hash_table_insert(analysisData
->graphs
->histograms
, tableKey
, histogram
);
668 if (message
->inE
->event
.udpEvent
->datagramKey
->saddr
<
669 message
->inE
->event
.udpEvent
->datagramKey
->daddr
)
671 hitBin(&histogram
->ttSendBins
, tt
);
675 hitBin(&histogram
->ttRecvBins
, tt
);
679 if (syncState
->stats
)
682 message
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.saddr
;
684 message
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.daddr
;
685 rtt
= g_hash_table_lookup(analysisData
->rttInfo
, &rttKey
);
686 g_debug("rttInfo, looking up (%u, %u)->(%f)", rttKey
.saddr
,
687 rttKey
.daddr
, rtt
? *rtt
: NAN
);
691 g_debug("rttInfo, tt: %f rtt / 2: %f", tt
, *rtt
/ 2.);
694 messageStats
->tooFastNb
++;
699 messageStats
->noRTTInfoNb
++;
703 if (syncState
->graphsStream
)
705 updateBounds(analysisData
->graphs
->bounds
, message
->inE
,
709 if (syncState
->stats
|| syncState
->graphsStream
)
711 analysisData
->chullSS
->analysisModule
->analyzeMessage(analysisData
->chullSS
,
718 * Perform analysis on multiple messages
723 * syncState container for synchronization data
724 * exchange structure containing the messages
726 static void analyzeExchangeEval(SyncState
* const syncState
, Exchange
* const
729 AnalysisDataEval
* analysisData
= syncState
->analysisData
;
730 Message
* m1
= g_queue_peek_tail(exchange
->acks
);
731 Message
* m2
= exchange
->message
;
732 struct RttKey
* rttKey
;
733 double* rtt
, * exchangeRtt
;
735 g_assert(m1
->inE
->type
== TCP
);
737 // (T2 - T1) - (T3 - T4)
738 rtt
= malloc(sizeof(double));
739 *rtt
= wallTimeSub(&m1
->inE
->wallTime
, &m1
->outE
->wallTime
) -
740 wallTimeSub(&m2
->outE
->wallTime
, &m2
->inE
->wallTime
);
742 rttKey
= malloc(sizeof(struct RttKey
));
744 MIN(m1
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.saddr
,
745 m1
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.daddr
);
747 MAX(m1
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.saddr
,
748 m1
->inE
->event
.tcpEvent
->segmentKey
->connectionKey
.daddr
);
750 if (syncState
->graphsStream
)
752 AnalysisHistogramEval
* histogram
=
753 g_hash_table_lookup(analysisData
->graphs
->histograms
, rttKey
);
755 if (histogram
== NULL
)
757 struct RttKey
* tableKey
= malloc(sizeof(*tableKey
));
759 histogram
= constructAnalysisHistogramEval(syncState
->graphsDir
,
761 memcpy(tableKey
, rttKey
, sizeof(*tableKey
));
762 g_hash_table_insert(analysisData
->graphs
->histograms
, tableKey
,
766 hitBin(&histogram
->hrttBins
, *rtt
/ 2);
769 if (syncState
->stats
)
771 exchangeRtt
= g_hash_table_lookup(analysisData
->stats
->exchangeRtt
,
776 if (*rtt
< *exchangeRtt
)
778 g_hash_table_replace(analysisData
->stats
->exchangeRtt
, rttKey
, rtt
);
788 g_hash_table_insert(analysisData
->stats
->exchangeRtt
, rttKey
, rtt
);
800 * Perform analysis on muliple events
802 * Sum the broadcast differential delays
805 * syncState container for synchronization data
806 * broadcast structure containing the events
808 static void analyzeBroadcastEval(SyncState
* const syncState
, Broadcast
* const
811 AnalysisDataEval
* analysisData
= syncState
->analysisData
;
813 if (syncState
->stats
)
815 double sum
= 0, squaresSum
= 0;
818 g_queue_foreach(broadcast
->events
, &gfSum
, &sum
);
819 g_queue_foreach(broadcast
->events
, &gfSumSquares
, &squaresSum
);
821 analysisData
->stats
->broadcastNb
++;
822 // Because of numerical errors, this can at times be < 0
823 y
= squaresSum
/ g_queue_get_length(broadcast
->events
) - pow(sum
/
824 g_queue_get_length(broadcast
->events
), 2.);
827 analysisData
->stats
->broadcastStdevSum
+= sqrt(y
);
830 if (syncState
->traceNb
== 2 && g_queue_get_length(broadcast
->events
)
836 e0
= g_queue_peek_head(broadcast
->events
);
837 e1
= g_queue_peek_tail(broadcast
->events
);
838 if (e0
->traceNum
> e1
->traceNum
)
847 dd
= wallTimeSub(&e1
->wallTime
, &e0
->wallTime
);
849 analysisData
->stats
->broadcastPairNb
++;
850 if (dd
< analysisData
->stats
->broadcastRangeMin
)
852 analysisData
->stats
->broadcastRangeMin
= dd
;
854 if (dd
> analysisData
->stats
->broadcastRangeMax
)
856 analysisData
->stats
->broadcastRangeMax
= dd
;
859 analysisData
->stats
->broadcastSum
+= dd
;
860 analysisData
->stats
->broadcastSumSquares
+= pow(dd
, 2);
864 if (syncState
->graphsStream
)
868 unsigned int eventNb
= broadcast
->events
->length
;
870 events
= g_array_sized_new(FALSE
, FALSE
, sizeof(Event
*), eventNb
);
871 g_queue_foreach(broadcast
->events
, &gfAddEventToArray
, events
);
873 for (i
= 0; i
< eventNb
; i
++)
875 for (j
= 0; j
< eventNb
; j
++)
877 Event
* eventI
= g_array_index(events
, Event
*, i
), * eventJ
=
878 g_array_index(events
, Event
*, j
);
880 if (eventI
->traceNum
< eventJ
->traceNum
)
882 updateBounds(analysisData
->graphs
->bounds
, eventI
, eventJ
);
887 g_array_free(events
, TRUE
);
893 * Finalize the factor calculations. Since this module does not really
894 * calculate factors, identity factors are returned. Instead, histograms are
895 * written out and histogram structures are freed.
898 * syncState container for synchronization data.
901 * Factors[traceNb] identity factors for each trace
903 static GArray
* finalizeAnalysisEval(SyncState
* const syncState
)
907 AnalysisDataEval
* analysisData
= syncState
->analysisData
;
909 if (syncState
->graphsStream
&& analysisData
->graphs
->histograms
)
911 g_hash_table_foreach(analysisData
->graphs
->histograms
,
912 &ghfWriteHistogram
, &(struct WriteHistogramInfo
) {.rttInfo
=
913 analysisData
->rttInfo
, .graphsStream
= syncState
->graphsStream
});
914 g_hash_table_destroy(analysisData
->graphs
->histograms
);
915 analysisData
->graphs
->histograms
= NULL
;
918 finalizeAnalysisEvalLP(syncState
);
920 factors
= g_array_sized_new(FALSE
, FALSE
, sizeof(Factors
),
922 g_array_set_size(factors
, syncState
->traceNb
);
923 for (i
= 0; i
< syncState
->traceNb
; i
++)
927 e
= &g_array_index(factors
, Factors
, i
);
937 * Print statistics related to analysis. Must be called after
941 * syncState container for synchronization data.
943 static void printAnalysisStatsEval(SyncState
* const syncState
)
945 AnalysisDataEval
* analysisData
;
946 unsigned int i
, j
, k
;
947 unsigned int totInversion
= 0, totTooFast
= 0, totNoInfo
= 0, totTotal
= 0;
950 if (!syncState
->stats
)
955 analysisData
= (AnalysisDataEval
*) syncState
->analysisData
;
957 printf("Synchronization evaluation analysis stats:\n");
958 if (analysisData
->stats
->broadcastNb
)
960 printf("\tBroadcast differential delay:\n");
961 printf("\t\tsum of standard deviations: %g\n",
962 analysisData
->stats
->broadcastStdevSum
);
963 printf("\t\taverage standard deviation: %g\n",
964 analysisData
->stats
->broadcastStdevSum
/
965 analysisData
->stats
->broadcastNb
);
967 if (syncState
->traceNb
== 2)
969 printf("\t\tdifferential delay range: [ %g .. %g ]\n",
970 analysisData
->stats
->broadcastRangeMin
,
971 analysisData
->stats
->broadcastRangeMax
);
972 printf("\t\tdifferential delay average: %g\n",
973 analysisData
->stats
->broadcastSum
/
974 analysisData
->stats
->broadcastPairNb
);
975 printf("\t\tdifferential delay standard deviation: %g\n",
976 sqrt(analysisData
->stats
->broadcastSumSquares
/
977 analysisData
->stats
->broadcastPairNb
-
978 pow(analysisData
->stats
->broadcastSum
/
979 analysisData
->stats
->broadcastPairNb
, 2)));
983 printf("\tIndividual evaluation:\n"
984 "\t\tTrace pair Inversions Too fast No RTT info Total\n");
986 for (i
= 0; i
< syncState
->traceNb
; i
++)
988 for (j
= i
+ 1; j
< syncState
->traceNb
; j
++)
990 MessageStats
* messageStats
;
998 for (k
= 0; k
< sizeof(loopValues
) / sizeof(*loopValues
); k
++)
1001 &analysisData
->stats
->messageStats
[loopValues
[k
].t1
][loopValues
[k
].t2
];
1003 printf("\t\t%3d - %-3d ", loopValues
[k
].t1
, loopValues
[k
].t2
);
1004 printf("%u (%.2f%%)%n", messageStats
->inversionNb
, (double)
1005 messageStats
->inversionNb
/ messageStats
->total
* 100,
1007 printf("%*s", 17 - charNb
> 0 ? 17 - charNb
+ 1: 1, " ");
1008 printf("%u (%.2f%%)%n", messageStats
->tooFastNb
, (double)
1009 messageStats
->tooFastNb
/ messageStats
->total
* 100,
1011 printf("%*s%-10u %u\n", 17 - charNb
> 0 ? 17 - charNb
+ 1:
1012 1, " ", messageStats
->noRTTInfoNb
, messageStats
->total
);
1014 totInversion
+= messageStats
->inversionNb
;
1015 totTooFast
+= messageStats
->tooFastNb
;
1016 totNoInfo
+= messageStats
->noRTTInfoNb
;
1017 totTotal
+= messageStats
->total
;
1022 printf("\t\t total ");
1023 printf("%u (%.2f%%)%n", totInversion
, (double) totInversion
/ totTotal
*
1025 printf("%*s", 17 - charNb
> 0 ? 17 - charNb
+ 1: 1, " ");
1026 printf("%u (%.2f%%)%n", totTooFast
, (double) totTooFast
/ totTotal
* 100,
1028 printf("%*s%-10u %u\n", 17 - charNb
> 0 ? 17 - charNb
+ 1: 1, " ",
1029 totNoInfo
, totTotal
);
1031 printf("\tRound-trip times:\n"
1032 "\t\tHost pair RTT from exchanges RTTs from file (ms)\n");
1033 g_hash_table_foreach(analysisData
->stats
->exchangeRtt
,
1034 &ghfPrintExchangeRtt
, analysisData
->rttInfo
);
1037 printf("\tConvex hull factors comparisons:\n"
1038 "\t\tTrace pair Factors type Differences (lp - chull)\n"
1040 "\t\t Min Max Min Max\n");
1042 for (i
= 0; i
< syncState
->traceNb
; i
++)
1044 for (j
= 0; j
< i
; j
++)
1046 FactorsCHull
* chFactors
= &analysisData
->stats
->chFactorsArray
[i
][j
];
1047 FactorsCHull
* lpFactors
= &analysisData
->stats
->lpFactorsArray
[i
][j
];
1049 printf("\t\t%3d - %-3d ", i
, j
);
1050 if (lpFactors
->type
== chFactors
->type
)
1052 if (lpFactors
->type
== MIDDLE
)
1054 printf("%-13s %-10.4g %-10.4g %-10.4g %.4g\n",
1055 approxNames
[lpFactors
->type
],
1056 lpFactors
->min
->offset
- chFactors
->min
->offset
,
1057 lpFactors
->max
->offset
- chFactors
->max
->offset
,
1058 lpFactors
->min
->drift
- chFactors
->min
->drift
,
1059 lpFactors
->max
->drift
- chFactors
->max
->drift
);
1061 else if (lpFactors
->type
== ABSENT
)
1063 printf("%s\n", approxNames
[lpFactors
->type
]);
1068 printf("Different! %s and %s\n", approxNames
[lpFactors
->type
],
1069 approxNames
[chFactors
->type
]);
1078 * A GHFunc for g_hash_table_foreach()
1081 * key: RttKey* where saddr < daddr
1082 * value: double*, RTT estimated from exchanges
1083 * user_data GHashTable* rttInfo
1085 static void ghfPrintExchangeRtt(gpointer key
, gpointer value
, gpointer
1088 char addr1
[16], addr2
[16];
1089 struct RttKey
* rttKey1
= key
;
1090 struct RttKey rttKey2
= {rttKey1
->daddr
, rttKey1
->saddr
};
1091 double* fileRtt1
, *fileRtt2
;
1092 GHashTable
* rttInfo
= user_data
;
1094 convertIP(addr1
, rttKey1
->saddr
);
1095 convertIP(addr2
, rttKey1
->daddr
);
1097 fileRtt1
= g_hash_table_lookup(rttInfo
, rttKey1
);
1098 fileRtt2
= g_hash_table_lookup(rttInfo
, &rttKey2
);
1100 printf("\t\t(%15s, %-15s) %-18.3f ", addr1
, addr2
, *(double*) value
* 1e3
);
1102 if (fileRtt1
|| fileRtt2
)
1106 printf("%.3f", *fileRtt1
* 1e3
);
1108 if (fileRtt1
&& fileRtt2
)
1114 printf("%.3f", *fileRtt2
* 1e3
);
1126 * A GHashFunc for g_hash_table_new()
1129 * key struct RttKey*
1131 static guint
ghfRttKeyHash(gconstpointer key
)
1133 struct RttKey
* rttKey
;
1136 rttKey
= (struct RttKey
*) key
;
1148 * A GDestroyNotify function for g_hash_table_new_full()
1151 * data: struct RttKey*
1153 static void gdnDestroyRttKey(gpointer data
)
1160 * A GDestroyNotify function for g_hash_table_new_full()
1165 static void gdnDestroyDouble(gpointer data
)
1172 * A GEqualFunc for g_hash_table_new()
1178 * TRUE if both values are equal
1180 static gboolean
gefRttKeyEqual(gconstpointer a
, gconstpointer b
)
1182 const struct RttKey
* rkA
, * rkB
;
1184 rkA
= (struct RttKey
*) a
;
1185 rkB
= (struct RttKey
*) b
;
1187 if (rkA
->saddr
== rkB
->saddr
&& rkA
->daddr
== rkB
->daddr
)
1199 * Read a file contain minimum round trip time values and fill an array with
1200 * them. The file is formatted as such:
1201 * <host1 IP> <host2 IP> <RTT in milliseconds>
1202 * ip's should be in dotted quad format
1205 * rttInfo: double* rttInfo[RttKey], empty table, will be filled
1206 * rttStream: stream from which to read
1208 static void readRttInfo(GHashTable
* rttInfo
, FILE* rttStream
)
1214 positionStream(rttStream
);
1215 retval
= getline(&line
, &len
, rttStream
);
1216 while(!feof(rttStream
))
1218 struct RttKey
* rttKey
;
1219 char saddrDQ
[20], daddrDQ
[20];
1222 struct in_addr addr
;
1228 {saddrDQ
, offsetof(struct RttKey
, saddr
)},
1229 {daddrDQ
, offsetof(struct RttKey
, daddr
)}
1232 if (retval
== -1 && !feof(rttStream
))
1234 g_error(strerror(errno
));
1237 if (line
[retval
- 1] == '\n')
1239 line
[retval
- 1]= '\0';
1242 rtt
= malloc(sizeof(double));
1243 retval
= sscanf(line
, " %19s %19s %lf %c", saddrDQ
, daddrDQ
, rtt
,
1247 g_error(strerror(errno
));
1249 else if (retval
!= 3)
1251 g_error("Error parsing RTT file, line was '%s'", line
);
1254 rttKey
= malloc(sizeof(struct RttKey
));
1255 for (i
= 0; i
< sizeof(loopValues
) / sizeof(*loopValues
); i
++)
1257 retval
= inet_aton(loopValues
[i
].dq
, &addr
);
1260 g_error("Error converting address '%s'", loopValues
[i
].dq
);
1262 *(uint32_t*) ((void*) rttKey
+ loopValues
[i
].offset
)=
1267 g_debug("rttInfo, Inserting (%u, %u)->(%f)", rttKey
->saddr
,
1268 rttKey
->daddr
, *rtt
);
1269 g_hash_table_insert(rttInfo
, rttKey
, rtt
);
1271 positionStream(rttStream
);
1272 retval
= getline(&line
, &len
, rttStream
);
1283 * Advance stream over empty space, empty lines and lines that begin with '#'
1286 * stream: stream, at exit, will be over the first non-empty character
1287 * of a line of be at EOF
1289 static void positionStream(FILE* stream
)
1298 firstChar
= fgetc(stream
);
1299 if (firstChar
== (int) '#')
1301 retval
= getline(&line
, &len
, stream
);
1310 g_error(strerror(errno
));
1314 else if (firstChar
== (int) '\n' || firstChar
== (int) ' ' ||
1315 firstChar
== (int) '\t')
1317 else if (firstChar
== EOF
)
1326 retval
= ungetc(firstChar
, stream
);
1329 g_error("Error: ungetc()");
1341 * A GFunc for g_queue_foreach()
1344 * data Event*, a UDP broadcast event
1345 * user_data double*, the running sum
1348 * Adds the time of the event to the sum
1350 static void gfSum(gpointer data
, gpointer userData
)
1352 Event
* event
= (Event
*) data
;
1354 *(double*) userData
+= event
->wallTime
.seconds
+ event
->wallTime
.nanosec
/
1360 * A GFunc for g_queue_foreach()
1363 * data Event*, a UDP broadcast event
1364 * user_data double*, the running sum
1367 * Adds the square of the time of the event to the sum
1369 static void gfSumSquares(gpointer data
, gpointer userData
)
1371 Event
* event
= (Event
*) data
;
1373 *(double*) userData
+= pow(event
->wallTime
.seconds
+ event
->wallTime
.nanosec
1379 * Update a struct Bins according to a new value
1382 * bins: the structure containing bins to build a histrogram
1383 * value: the new value
1385 static void hitBin(struct Bins
* const bins
, const double value
)
1387 unsigned int binN
= binNum(value
);
1389 if (binN
< bins
->min
)
1393 else if (binN
> bins
->max
)
1405 * Figure out the bin in a histogram to which a value belongs.
1407 * This uses exponentially sized bins that go from 0 to infinity.
1410 * value: in the range -INFINITY to INFINITY
1413 * The number of the bin in a struct Bins.bin
1415 static unsigned int binNum(const double value
)
1421 else if (value
< binEnd(1))
1425 else if (value
>= binStart(BIN_NB
- 1))
1431 return floor(log(value
) / log(binBase
)) + BIN_NB
+ 1;
1437 * Figure out the start of the interval of a bin in a histogram. See struct
1440 * This uses exponentially sized bins that go from 0 to infinity.
1443 * binNum: bin number
1446 * The start of the interval, this value is included in the interval (except
1447 * for -INFINITY, naturally)
1449 static double binStart(const unsigned int binNum
)
1451 g_assert_cmpuint(binNum
, <, BIN_NB
);
1457 else if (binNum
== 1)
1463 return pow(binBase
, (double) binNum
- BIN_NB
+ 1);
1469 * Figure out the end of the interval of a bin in a histogram. See struct
1472 * This uses exponentially sized bins that go from 0 to infinity.
1475 * binNum: bin number
1478 * The end of the interval, this value is not included in the interval
1480 static double binEnd(const unsigned int binNum
)
1482 g_assert_cmpuint(binNum
, <, BIN_NB
);
1488 else if (binNum
< BIN_NB
- 1)
1490 return pow(binBase
, (double) binNum
- BIN_NB
+ 2);
1500 * Return the total number of elements in the "normal" bins (not underflow or
1504 * bins: the structure containing bins to build a histrogram
1506 static uint32_t normalTotal(struct Bins
* const bins
)
1508 return bins
->total
- bins
->bin
[0] - bins
->bin
[BIN_NB
- 1];
1512 /* Update the bounds between two traces
1515 * bounds: the array containing all the trace-pair bounds
1516 * e1, e2: the two related events
1518 static void updateBounds(Bounds
** const bounds
, Event
* const e1
, Event
* const
1521 unsigned int traceI
, traceJ
;
1522 uint64_t messageTime
;
1525 if (e1
->traceNum
< e2
->traceNum
)
1527 traceI
= e2
->traceNum
;
1528 traceJ
= e1
->traceNum
;
1529 messageTime
= e1
->cpuTime
;
1533 traceI
= e1
->traceNum
;
1534 traceJ
= e2
->traceNum
;
1535 messageTime
= e2
->cpuTime
;
1537 tpBounds
= &bounds
[traceI
][traceJ
];
1539 if (messageTime
< tpBounds
->min
)
1541 tpBounds
->min
= messageTime
;
1543 if (messageTime
> tpBounds
->max
)
1545 tpBounds
->max
= messageTime
;
1552 * Create the linear programming problem containing the constraints defined by
1553 * two half-hulls. The objective function and optimization directions are not
1557 * syncState: container for synchronization data
1558 * i: first trace number
1559 * j: second trace number, garanteed to be larger than i
1561 * A new glp_prob*, this problem must be freed by the caller with
1564 static glp_prob
* lpCreateProblem(GQueue
* const lowerHull
, GQueue
* const
1569 const double zeroD
= 0.;
1570 glp_prob
* lp
= glp_create_prob();
1571 unsigned int hullPointNb
= g_queue_get_length(lowerHull
) +
1572 g_queue_get_length(upperHull
);
1573 GArray
* iArray
= g_array_sized_new(FALSE
, FALSE
, sizeof(int), hullPointNb
+
1575 GArray
* jArray
= g_array_sized_new(FALSE
, FALSE
, sizeof(int), hullPointNb
+
1577 GArray
* aArray
= g_array_sized_new(FALSE
, FALSE
, sizeof(double),
1581 struct LPAddRowInfo rowInfo
;
1583 {lowerHull
, {lp
, GLP_UP
, iArray
, jArray
, aArray
}},
1584 {upperHull
, {lp
, GLP_LO
, iArray
, jArray
, aArray
}},
1587 // Create the LP problem
1588 glp_term_out(GLP_OFF
);
1589 if (hullPointNb
> 0)
1591 glp_add_rows(lp
, hullPointNb
);
1593 glp_add_cols(lp
, 2);
1595 glp_set_col_name(lp
, 1, "a0");
1596 glp_set_col_bnds(lp
, 1, GLP_FR
, 0., 0.);
1597 glp_set_col_name(lp
, 2, "a1");
1598 glp_set_col_bnds(lp
, 2, GLP_LO
, 0., 0.);
1600 // Add row constraints
1601 g_array_append_val(iArray
, zero
);
1602 g_array_append_val(jArray
, zero
);
1603 g_array_append_val(aArray
, zeroD
);
1605 for (it
= 0; it
< sizeof(loopValues
) / sizeof(*loopValues
); it
++)
1607 g_queue_foreach(loopValues
[it
].hull
, &gfLPAddRow
,
1608 &loopValues
[it
].rowInfo
);
1611 g_assert_cmpuint(iArray
->len
, ==, jArray
->len
);
1612 g_assert_cmpuint(jArray
->len
, ==, aArray
->len
);
1613 g_assert_cmpuint(aArray
->len
- 1, ==, hullPointNb
* 2);
1615 glp_load_matrix(lp
, aArray
->len
- 1, &g_array_index(iArray
, int, 0),
1616 &g_array_index(jArray
, int, 0), &g_array_index(aArray
, double, 0));
1618 glp_scale_prob(lp
, GLP_SF_AUTO
);
1620 g_array_free(iArray
, TRUE
);
1621 g_array_free(jArray
, TRUE
);
1622 g_array_free(aArray
, TRUE
);
1629 * A GFunc for g_queue_foreach(). Add constraints and bounds for one row.
1632 * data Point*, synchronization point for which to add an LP row
1634 * user_data LPAddRowInfo*
1636 static void gfLPAddRow(gpointer data
, gpointer user_data
)
1639 struct LPAddRowInfo
* rowInfo
= user_data
;
1641 double constraints
[2];
1643 indexes
[0]= g_array_index(rowInfo
->iArray
, int, rowInfo
->iArray
->len
- 1) + 1;
1644 indexes
[1]= indexes
[0];
1646 if (rowInfo
->boundType
== GLP_UP
)
1648 glp_set_row_bnds(rowInfo
->lp
, indexes
[0], GLP_UP
, 0., p
->y
);
1650 else if (rowInfo
->boundType
== GLP_LO
)
1652 glp_set_row_bnds(rowInfo
->lp
, indexes
[0], GLP_LO
, p
->y
, 0.);
1656 g_assert_not_reached();
1659 g_array_append_vals(rowInfo
->iArray
, indexes
, 2);
1662 g_array_append_vals(rowInfo
->jArray
, indexes
, 2);
1664 constraints
[1]= p
->x
;
1665 g_array_append_vals(rowInfo
->aArray
, constraints
, 2);
1670 * Calculate min or max correction factors (as possible) using an LP problem.
1673 * lp: A linear programming problem with constraints and bounds
1675 * direction: The type of factors desired. Use GLP_MAX for max
1676 * approximation factors (a1, the drift or slope is the
1677 * largest) and GLP_MIN in the other case.
1680 * If the calculation was successful, a new Factors struct. Otherwise, NULL.
1681 * The calculation will fail if the hull assumptions are not respected.
1683 static Factors
* calculateFactors(glp_prob
* const lp
, const int direction
)
1688 glp_set_obj_coef(lp
, 1, 0.);
1689 glp_set_obj_coef(lp
, 2, 1.);
1691 glp_set_obj_dir(lp
, direction
);
1692 retval
= glp_simplex(lp
, NULL
);
1693 status
= glp_get_status(lp
);
1695 if (retval
== 0 && status
== GLP_OPT
)
1697 factors
= malloc(sizeof(Factors
));
1698 factors
->offset
= glp_get_col_prim(lp
, 1);
1699 factors
->drift
= glp_get_col_prim(lp
, 2);
1711 * Calculate min, max and approx correction factors (as possible) using an LP
1715 * lp: A linear programming problem with constraints and bounds
1719 * Please note that the approximation type may be MIDDLE, INCOMPLETE or
1720 * ABSENT. Unlike in analysis_chull, ABSENT is also used when the hulls do
1721 * not respect assumptions.
1723 static void calculateCompleteFactors(glp_prob
* const lp
, FactorsCHull
* factors
)
1725 factors
->min
= calculateFactors(lp
, GLP_MIN
);
1726 factors
->max
= calculateFactors(lp
, GLP_MAX
);
1728 if (factors
->min
&& factors
->max
)
1730 factors
->type
= MIDDLE
;
1731 calculateFactorsMiddle(factors
);
1733 else if (factors
->min
|| factors
->max
)
1735 factors
->type
= INCOMPLETE
;
1736 factors
->approx
= NULL
;
1740 factors
->type
= ABSENT
;
1741 factors
->approx
= NULL
;
1747 * Create and initialize an array like AnalysisStatsCHull.allFactors
1750 * traceNb: number of traces
1753 * A new array, which can be freed with freeAllFactors()
1755 static FactorsCHull
** createAllFactors(const unsigned int traceNb
)
1757 FactorsCHull
** factorsArray
;
1760 factorsArray
= malloc(traceNb
* sizeof(FactorsCHull
*));
1761 for (i
= 0; i
< traceNb
; i
++)
1763 factorsArray
[i
]= calloc((i
+ 1), sizeof(FactorsCHull
));
1765 factorsArray
[i
][i
].type
= EXACT
;
1766 factorsArray
[i
][i
].approx
= malloc(sizeof(Factors
));
1767 factorsArray
[i
][i
].approx
->drift
= 1.;
1768 factorsArray
[i
][i
].approx
->offset
= 0.;
1771 return factorsArray
;
1777 * Compute synchronization factors using a linear programming approach.
1778 * Compute the factors using analysis_chull. Compare the two.
1780 * When the solver library, glpk, is not available at build time, only compute
1781 * the factors using analysis_chull. This is to make sure that module runs its
1782 * finalize function so that its graph functions can be called later.
1785 * syncState: container for synchronization data
1787 static void finalizeAnalysisEvalLP(SyncState
* const syncState
)
1789 AnalysisDataEval
* analysisData
= syncState
->analysisData
;
1792 AnalysisDataCHull
* chAnalysisData
= analysisData
->chullSS
->analysisData
;
1793 FactorsCHull
** lpFactorsArray
;
1795 if (!syncState
->stats
&& !syncState
->graphsStream
)
1800 /* Because of matching_distributor, this analysis may be called twice.
1801 * Only run it once */
1802 if ((syncState
->graphsStream
&& analysisData
->graphs
->lps
!= NULL
) ||
1803 (syncState
->stats
&& analysisData
->stats
->chFactorsArray
!= NULL
))
1808 lpFactorsArray
= createAllFactors(syncState
->traceNb
);
1810 if (syncState
->stats
)
1812 analysisData
->stats
->chFactorsArray
=
1813 calculateAllFactors(analysisData
->chullSS
);
1814 analysisData
->stats
->lpFactorsArray
= lpFactorsArray
;
1817 if (syncState
->graphsStream
)
1819 analysisData
->graphs
->lps
= malloc(syncState
->traceNb
*
1820 sizeof(glp_prob
**));
1821 for (i
= 0; i
< syncState
->traceNb
; i
++)
1823 analysisData
->graphs
->lps
[i
]= malloc(i
* sizeof(glp_prob
*));
1825 analysisData
->graphs
->lpFactorsArray
= lpFactorsArray
;
1828 for (i
= 0; i
< syncState
->traceNb
; i
++)
1830 for (j
= 0; j
< i
; j
++)
1834 // Create the LP problem
1835 lp
= lpCreateProblem(chAnalysisData
->hullArray
[i
][j
],
1836 chAnalysisData
->hullArray
[j
][i
]);
1838 // Use the LP problem to find the correction factors for this pair of
1840 calculateCompleteFactors(lp
, &lpFactorsArray
[i
][j
]);
1842 if (syncState
->graphsStream
)
1844 analysisData
->graphs
->lps
[i
][j
]= lp
;
1848 glp_delete_prob(lp
);
1854 g_array_free(analysisData
->chullSS
->analysisModule
->finalizeAnalysis(analysisData
->chullSS
),
1860 * Compute synchronization accuracy information using a linear programming
1861 * approach. Write the neccessary data files and plot lines in the gnuplot
1864 * When the solver library, glpk, is not available at build time nothing is
1865 * actually produced.
1868 * syncState: container for synchronization data
1869 * i: first trace number
1870 * j: second trace number, garanteed to be larger than i
1872 static void writeAnalysisTraceTimeBackPlotsEval(SyncState
* const syncState
,
1873 const unsigned int i
, const unsigned int j
)
1877 AnalysisDataEval
* analysisData
= syncState
->analysisData
;
1878 AnalysisGraphsEval
* graphs
= analysisData
->graphs
;
1879 GQueue
*** hullArray
= ((AnalysisDataCHull
*)
1880 analysisData
->chullSS
->analysisData
)->hullArray
;
1881 FactorsCHull
* lpFactors
= &graphs
->lpFactorsArray
[j
][i
];
1882 glp_prob
* lp
= graphs
->lps
[j
][i
];
1884 if (lpFactors
->type
== MIDDLE
)
1891 unsigned int xBegin
, xEnd
;
1893 const unsigned int graphPointNb
= 1000;
1895 // Open the data file
1896 snprintf(fileName
, 40, "analysis_eval_accuracy-%03u_and_%03u.data", i
, j
);
1897 fileName
[sizeof(fileName
) - 1]= '\0';
1899 cwd
= changeToGraphsDir(syncState
->graphsDir
);
1901 if ((fp
= fopen(fileName
, "w")) == NULL
)
1903 g_error(strerror(errno
));
1905 fprintf(fp
, "#%-24s %-25s %-25s %-25s\n", "x", "middle", "min", "max");
1910 g_error(strerror(errno
));
1914 // Build the list of absisca values for the points in the accuracy graph
1915 g_assert_cmpuint(graphPointNb
, >=, 4);
1916 xValues
= malloc(graphPointNb
* sizeof(double));
1917 xValues
[0]= graphs
->bounds
[j
][i
].min
;
1918 xValues
[graphPointNb
- 1]= graphs
->bounds
[j
][i
].max
;
1919 xValues
[1]= MIN(((Point
*) g_queue_peek_head(hullArray
[i
][j
]))->x
,
1920 ((Point
*) g_queue_peek_head(hullArray
[j
][i
]))->x
);
1921 xValues
[graphPointNb
- 2]= MAX(((Point
*)
1922 g_queue_peek_tail(hullArray
[i
][j
]))->x
, ((Point
*)
1923 g_queue_peek_tail(hullArray
[j
][i
]))->x
);
1925 if (xValues
[0] == xValues
[1])
1933 if (xValues
[graphPointNb
- 2] == xValues
[graphPointNb
- 1])
1935 xEnd
= graphPointNb
- 1;
1939 xEnd
= graphPointNb
- 2;
1941 interval
= (xValues
[xEnd
] - xValues
[xBegin
]) / (graphPointNb
- 1);
1943 for (it
= xBegin
; it
<= xEnd
; it
++)
1945 xValues
[it
]= xValues
[xBegin
] + interval
* (it
- xBegin
);
1948 /* For each absisca value and each optimisation direction, solve the LP
1949 * and write a line in the data file */
1950 for (it
= 0; it
< graphPointNb
; it
++)
1953 int directions
[]= {GLP_MIN
, GLP_MAX
};
1954 glp_set_obj_coef(lp
, 1, 1.);
1955 glp_set_obj_coef(lp
, 2, xValues
[it
]);
1957 fprintf(fp
, "%25.9f %25.9f", xValues
[it
],
1958 lpFactors
->approx
->offset
+ lpFactors
->approx
->drift
*
1960 for (it2
= 0; it2
< sizeof(directions
) / sizeof(*directions
); it2
++)
1964 glp_set_obj_dir(lp
, directions
[it2
]);
1965 retval
= glp_simplex(lp
, NULL
);
1966 status
= glp_get_status(lp
);
1968 g_assert(retval
== 0 && status
== GLP_OPT
);
1969 fprintf(fp
, " %25.9f", glp_get_obj_val(lp
));
1977 fprintf(syncState
->graphsStream
,
1978 "\t\"analysis_eval_accuracy-%1$03u_and_%2$03u.data\" "
1979 "using 1:(($3 - $2) / clock_freq_%2$u):(($4 - $2) / clock_freq_%2$u) "
1980 "title \"Synchronization accuracy\" "
1981 "with filledcurves linewidth 2 linetype 1 "
1982 "linecolor rgb \"black\" fill solid 0.25 noborder, \\\n", i
,
1990 * Write the analysis-specific graph lines in the gnuplot script.
1992 * When the solver library, glpk, is not available at build time nothing is
1993 * actually produced.
1996 * syncState: container for synchronization data
1997 * i: first trace number
1998 * j: second trace number, garanteed to be larger than i
2000 static void writeAnalysisTraceTimeForePlotsEval(SyncState
* const syncState
,
2001 const unsigned int i
, const unsigned int j
)
2004 if (((AnalysisDataEval
*)
2005 syncState
->analysisData
)->graphs
->lpFactorsArray
[j
][i
].type
==
2008 fprintf(syncState
->graphsStream
,
2009 "\t\"analysis_eval_accuracy-%1$03u_and_%2$03u.data\" "
2010 "using 1:(($3 - $2) / clock_freq_%2$u) notitle "
2011 "with lines linewidth 2 linetype 1 "
2012 "linecolor rgb \"gray60\", \\\n"
2013 "\t\"analysis_eval_accuracy-%1$03u_and_%2$03u.data\" "
2014 "using 1:(($4 - $2) / clock_freq_%2$u) notitle "
2015 "with lines linewidth 2 linetype 1 "
2016 "linecolor rgb \"gray60\", \\\n", i
, j
);
2023 * Write the analysis-specific graph lines in the gnuplot script.
2026 * syncState: container for synchronization data
2027 * i: first trace number
2028 * j: second trace number, garanteed to be larger than i
2030 static void writeAnalysisTraceTraceBackPlotsEval(SyncState
* const syncState
,
2031 const unsigned int i
, const unsigned int j
)
2034 fprintf(syncState
->graphsStream
,
2035 "\t\"analysis_eval_accuracy-%1$03u_and_%2$03u.data\" "
2037 "title \"Synchronization accuracy\" "
2038 "with filledcurves linewidth 2 linetype 1 "
2039 "linecolor rgb \"black\" fill solid 0.25 noborder, \\\n", i
, j
);
2045 * Write the analysis-specific graph lines in the gnuplot script.
2048 * syncState: container for synchronization data
2049 * i: first trace number
2050 * j: second trace number, garanteed to be larger than i
2052 static void writeAnalysisTraceTraceForePlotsEval(SyncState
* const syncState
,
2053 const unsigned int i
, const unsigned int j
)
2055 AnalysisDataEval
* analysisData
= syncState
->analysisData
;
2057 analysisData
->chullSS
->analysisModule
->graphFunctions
.writeTraceTraceForePlots(analysisData
->chullSS
,