MOOCHO (Single Doxygen Collection) Version of the Day
TestStopWatchMain.cpp
Go to the documentation of this file.
00001 // @HEADER
00002 // ***********************************************************************
00003 // 
00004 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
00005 //                  Copyright (2003) Sandia Corporation
00006 // 
00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
00008 // license for use of this work by or on behalf of the U.S. Government.
00009 // 
00010 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 
00038 // 
00039 // ***********************************************************************
00040 // @HEADER
00041 
00042 #include "StopWatchPack_stopwatch.hpp"
00043 #include "Teuchos_GlobalMPISession.hpp"
00044 #include "Teuchos_StandardCatchMacros.hpp"
00045 
00046 int main(int argc, char* argv[])
00047 {
00048 
00049   using std::cout;
00050   using std::endl;
00051   using StopWatchPack::stopwatch;
00052   
00053   bool success = true;
00054 
00055   Teuchos::GlobalMPISession mpiSession(&argc,&argv);
00056 
00057   try {
00058     
00059     stopwatch timer;
00060     
00061     // Finding min resolution.
00062     double min_resolution = 0.0; // in seconds
00063     int total_num_calls   = 0;
00064     {
00065       cout  << "\n*** Measuring miminum resolution.\n";
00066       timer.start();
00067       double last_time = timer.read();
00068       const int max_num_samples = 20;
00069       int num_samples = 0;
00070       int num_calls = 0;
00071       while( num_samples < max_num_samples ) {
00072         double time = timer.read();
00073         num_calls++;
00074         if( time - last_time > 0.0 ) {
00075           cout  << "time_diff = " << time - last_time
00076                 << ", num_calls = " << num_calls << endl;
00077           min_resolution += time - last_time;
00078           ++total_num_calls;
00079           last_time = time;
00080           num_calls = 0;
00081           num_samples++;
00082         }
00083       }
00084       min_resolution /= total_num_calls;
00085     }
00086     
00087     std::cerr << "Minimum stopwatch resolution = " << min_resolution << " sec\n";
00088     
00089     // Finding increasing resolution.
00090     {
00091       cout  << "\n*** Measuring increasing resolution.\n";
00092       timer.start();
00093       double start_time = timer.read(), last_time = start_time;
00094       const int max_num_samples = 20;
00095       int num_samples = 0;
00096       int num_calls = 0;
00097       while( num_samples < max_num_samples ) {
00098         double time = timer.read();
00099         num_calls++;
00100         if( time - last_time > 0.0 ) {
00101           cout  << "time = " << time - start_time
00102                 << ", num_calls = " << num_calls << endl;
00103           last_time = time;
00104           num_calls = 0;
00105           num_samples++;
00106         }
00107       }
00108     }
00109 
00110   } // end try
00111   TEUCHOS_STANDARD_CATCH_STATEMENTS(true, std::cerr, success);
00112   
00113   if(success)
00114     cout << "\nEnd Result: TEST PASSED" << std::endl;
00115   
00116   return 0;
00117   
00118 }
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines