Perform factor reduction as a modular step
[lttv.git] / lttv / lttv / sync / sync_chain_unittest.c
index 5d475ea8008f97c15d4ff548185a7d0ec842b109..40302a0e41183e6dfc20d4c138714763386cfa36 100644 (file)
@@ -1,19 +1,18 @@
 /* This file is part of the Linux Trace Toolkit viewer
- * Copyright (C) 2009 Benjamin Poirier <benjamin.poirier@polymtl.ca>
+ * Copyright (C) 2009, 2010 Benjamin Poirier <benjamin.poirier@polymtl.ca>
  *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License Version 2 as
- * published by the Free Software Foundation;
+ * This program is free software: you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation, either version 2.1 of the License, or (at
+ * your option) any later version.
  *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
+ * This program is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public
+ * License for more details.
  *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
- * MA 02111-1307, USA.
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
  */
 
 #define _GNU_SOURCE
 #include <sys/stat.h>
 #include <unistd.h>
 
+#include "event_processing_text.h"
+#include "event_matching_tcp.h"
+#include "event_matching_broadcast.h"
+#include "event_matching_distributor.h"
+#include "event_analysis_chull.h"
+#include "event_analysis_linreg.h"
+#include "event_analysis_eval.h"
+#include "factor_reduction_accuracy.h"
 #include "sync_chain.h"
 
 
@@ -76,6 +83,12 @@ static ModuleOption optionSyncAnalysis= {
        .hasArg= REQUIRED_ARG,
        .optionHelp= "Specify which algorithm to use for event analysis",
 };
+static ModuleOption optionSyncReduction= {
+       .shortName= 'r',
+       .longName= "sync-reduction",
+       .hasArg= REQUIRED_ARG,
+       .optionHelp= "Specify which algorithm to use for factor reduction",
+};
 
 
 /*
@@ -94,11 +107,33 @@ int main(const int argc, char* const argv[])
        struct timeval startTime, endTime;
        struct rusage startUsage, endUsage;
        GList* result;
+       GArray* factors;
        int retval;
        bool stats;
        const char* testCaseName;
        GString* analysisModulesNames;
+       GString* reductionModulesNames;
        unsigned int id;
+       AllFactors* allFactors;
+
+       /*
+        * Initialize event modules
+        * Call the "constructor" or initialization function of each event module
+        * so it can register itself. This must be done before elements in
+        * processingModules, matchingModules, analysisModules or moduleOptions
+        * are accessed.
+        */
+       registerProcessingText();
+
+       registerMatchingTCP();
+       registerMatchingBroadcast();
+       registerMatchingDistributor();
+
+       registerAnalysisCHull();
+       registerAnalysisLinReg();
+       registerAnalysisEval();
+
+       registerReductionAccuracy();
 
        // Initialize data structures
        syncState= malloc(sizeof(SyncState));
@@ -114,6 +149,16 @@ int main(const int argc, char* const argv[])
        g_string_truncate(analysisModulesNames, analysisModulesNames->len - 2);
        optionSyncAnalysis.argHelp= analysisModulesNames->str;
 
+       g_assert(g_queue_get_length(&reductionModules) > 0);
+       optionSyncReduction.arg= ((ReductionModule*)
+               g_queue_peek_head(&reductionModules))->name;
+       reductionModulesNames= g_string_new("Available modules: ");
+       g_queue_foreach(&reductionModules, &gfAppendReductionName,
+               reductionModulesNames);
+       // remove the last ", "
+       g_string_truncate(reductionModulesNames, reductionModulesNames->len - 2);
+       optionSyncReduction.argHelp= reductionModulesNames->str;
+
        retval= snprintf(graphsDir, sizeof(graphsDir), "graphs-%d", getpid());
        if (retval > sizeof(graphsDir) - 1)
        {
@@ -121,6 +166,7 @@ int main(const int argc, char* const argv[])
        }
        optionSyncGraphs.arg= graphsDir;
 
+       g_queue_push_head(&moduleOptions, &optionSyncReduction);
        g_queue_push_head(&moduleOptions, &optionSyncAnalysis);
        g_queue_push_head(&moduleOptions, &optionSyncGraphs);
        g_queue_push_head(&moduleOptions, &optionSyncStats);
@@ -128,6 +174,7 @@ int main(const int argc, char* const argv[])
        testCaseName= processOptions(argc, argv);
 
        g_string_free(analysisModulesNames, TRUE);
+       g_string_free(reductionModulesNames, TRUE);
 
        if (optionSyncStats.present)
        {
@@ -178,13 +225,29 @@ int main(const int argc, char* const argv[])
                g_error("Analysis module '%s' not found", optionSyncAnalysis.arg);
        }
 
+       syncState->reductionData= NULL;
+       result= g_queue_find_custom(&reductionModules, optionSyncReduction.arg,
+               &gcfCompareReduction);
+       if (result != NULL)
+       {
+               syncState->reductionModule= (ReductionModule*) result->data;
+       }
+       else
+       {
+               g_error("Reduction module '%s' not found", optionSyncReduction.arg);
+       }
+
        // Initialize modules
        syncState->processingModule->initProcessing(syncState, testCaseName);
        syncState->matchingModule->initMatching(syncState);
        syncState->analysisModule->initAnalysis(syncState);
+       syncState->reductionModule->initReduction(syncState);
 
        // Process traceset
-       syncState->processingModule->finalizeProcessing(syncState);
+       allFactors= syncState->processingModule->finalizeProcessing(syncState);
+       factors= syncState->reductionModule->finalizeReduction(syncState,
+               allFactors);
+       freeAllFactors(allFactors, syncState->traceNb);
 
        // Write graphs file
        if (syncState->graphsStream)
@@ -198,15 +261,26 @@ int main(const int argc, char* const argv[])
        }
 
        // Print statistics
-       if (syncState->stats)
+       if (optionSyncStats.present)
        {
+               unsigned int i;
+
                printStats(syncState);
+
+               printf("Resulting synchronization factors:\n");
+               for (i= 0; i < factors->len; i++)
+               {
+                       Factors* traceFactors= &g_array_index(factors, Factors, i);
+                       printf("\ttrace %u drift= %g offset= %g\n", i,
+                               traceFactors->drift, traceFactors->offset);
+               }
        }
 
        // Destroy modules and clean up
        syncState->processingModule->destroyProcessing(syncState);
        syncState->matchingModule->destroyMatching(syncState);
        syncState->analysisModule->destroyAnalysis(syncState);
+       syncState->reductionModule->destroyReduction(syncState);
 
        stats= syncState->stats;
        free(syncState);
@@ -238,7 +312,7 @@ int main(const int argc, char* const argv[])
 
 
 /*
- * Read program arguments dans update ModuleOptions structures
+ * Read program arguments and update ModuleOptions structures
  *
  * Args:
  *   argc, argv:   standard argument arrays
This page took 0.024262 seconds and 4 git commands to generate.