|
Zoltan2
|
00001 // @HEADER 00002 // 00003 // *********************************************************************** 00004 // 00005 // Zoltan2: A package of combinatorial algorithms for scientific computing 00006 // Copyright 2012 Sandia Corporation 00007 // 00008 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation, 00009 // the U.S. Government retains certain rights in this software. 00010 // 00011 // Redistribution and use in source and binary forms, with or without 00012 // modification, are permitted provided that the following conditions are 00013 // met: 00014 // 00015 // 1. Redistributions of source code must retain the above copyright 00016 // notice, this list of conditions and the following disclaimer. 00017 // 00018 // 2. Redistributions in binary form must reproduce the above copyright 00019 // notice, this list of conditions and the following disclaimer in the 00020 // documentation and/or other materials provided with the distribution. 00021 // 00022 // 3. Neither the name of the Corporation nor the names of the 00023 // contributors may be used to endorse or promote products derived from 00024 // this software without specific prior written permission. 00025 // 00026 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY 00027 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 00028 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00029 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE 00030 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00031 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00032 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00033 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00034 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00035 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00036 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00037 // 00038 // Questions? Contact Karen Devine (kddevin@sandia.gov) 00039 // Erik Boman (egboman@sandia.gov) 00040 // Siva Rajamanickam (srajama@sandia.gov) 00041 // 00042 // *********************************************************************** 00043 // 00044 // @HEADER 00045 00046 #ifndef ERRORHANDLINGFORTESTS_HPP 00047 #define ERRORHANDLINGFORTESTS_HPP 00048 00049 #include <Zoltan2_config.h> 00050 #include <iostream> 00051 #include <string> 00052 #include <exception> 00053 00054 #include <Teuchos_RCP.hpp> 00055 #include <Teuchos_Comm.hpp> 00056 #include <Teuchos_CommHelpers.hpp> 00057 00058 using Teuchos::RCP; 00059 using Teuchos::Comm; 00060 using Teuchos::reduceAll; 00061 00062 #ifdef HAVE_ZOLTAN2_MPI 00063 00064 #define TEST_FAIL_AND_THROW(comm, ok, s){ \ 00065 int gval, lval=( (ok) ? 0 : 1); \ 00066 reduceAll<int,int>(comm, Teuchos::REDUCE_SUM, 1, &lval, &gval);\ 00067 if (gval){ \ 00068 throw std::runtime_error(std::string(s)); \ 00069 } \ 00070 } 00071 00072 #define TEST_FAIL_AND_EXIT(comm, ok, s, code){ \ 00073 int gval, lval=( (ok) ? 0 : 1); \ 00074 reduceAll<int,int>(comm, Teuchos::REDUCE_SUM, 1, &lval, &gval);\ 00075 if (gval){ \ 00076 if ((comm).getRank() == 0){\ 00077 std::cerr << "Error: " << s << std::endl;\ 00078 std::cout << "Error: " << s << std::endl;\ 00079 std::cout << "FAIL" << std::endl;\ 00080 } \ 00081 exit(code);\ 00082 } \ 00083 } 00084 00085 #define TEST_FAIL_AND_RETURN(comm, ok, s){ \ 00086 int gval, lval=( (ok) ? 0 : 1); \ 00087 reduceAll<int,int>(comm, Teuchos::REDUCE_SUM, 1, &lval, &gval);\ 00088 if (gval){ \ 00089 if ((comm).getRank() == 0){\ 00090 std::cerr << "Error: " << s << std::endl;\ 00091 std::cout << "Error: " << s << std::endl;\ 00092 std::cout << "FAIL" << std::endl;\ 00093 } \ 00094 return; \ 00095 } \ 00096 } 00097 00098 #define TEST_FAIL_AND_RETURN_VALUE(comm, ok, s, rc){ \ 00099 int gval, lval=( (ok) ? 0 : 1); \ 00100 reduceAll<int,int>(comm, Teuchos::REDUCE_SUM, 1, &lval, &gval);\ 00101 if (gval){ \ 00102 if ((comm).getRank() == 0){\ 00103 std::cerr << "Error: " << s << std::endl;\ 00104 std::cout << "Error: " << s << std::endl;\ 00105 std::cout << "FAIL" << std::endl;\ 00106 } \ 00107 return (rc); \ 00108 } \ 00109 } 00110 00111 #else 00112 00113 #define TEST_FAIL_AND_THROW(comm, ok, s) \ 00114 if (!(ok)){ \ 00115 throw std::runtime_error(std::string(s)); \ 00116 } 00117 00118 #define TEST_FAIL_AND_EXIT(comm, ok, s, code) \ 00119 if (!(ok)){ \ 00120 std::cerr << "Error: " << s << std::endl;\ 00121 std::cout << "Error: " << s << std::endl;\ 00122 std::cout << "FAIL" << std::endl;\ 00123 exit(code);\ 00124 } 00125 00126 #define TEST_FAIL_AND_RETURN(comm, ok, s) \ 00127 if (!(ok)){ \ 00128 std::cerr << "Error: " << s << std::endl;\ 00129 std::cout << "Error: " << s << std::endl;\ 00130 std::cout << "FAIL" << std::endl;\ 00131 return;\ 00132 } 00133 00134 #define TEST_FAIL_AND_RETURN_VALUE(comm, ok, s, rc) \ 00135 if (!(ok)){ \ 00136 std::cerr << "Error: " << s << std::endl;\ 00137 std::cout << "Error: " << s << std::endl;\ 00138 std::cout << "FAIL" << std::endl;\ 00139 return (rc);\ 00140 } 00141 #endif 00142 00143 int globalFail(const RCP<const Comm<int> > &comm, int fail) 00144 { 00145 int gfail=0; 00146 reduceAll<int,int>(*comm, Teuchos::REDUCE_SUM, 1, &fail, &gfail); 00147 return gfail; 00148 } 00149 00150 void printFailureCode(const RCP<const Comm<int> > &comm, int fail) 00151 { 00152 int rank = comm->getRank(); 00153 int nprocs = comm->getSize(); 00154 comm->barrier(); 00155 for (int p=0; p < nprocs; p++){ 00156 if (p == rank) 00157 std::cout << rank << ": " << fail << std::endl; 00158 comm->barrier(); 00159 } 00160 comm->barrier(); 00161 if (rank==0) std::cout << "FAIL" << std::endl; 00162 exit(1); 00163 } 00164 00165 #endif
1.7.6.1