| 1 |
gezelter |
246 |
/* |
| 2 |
|
|
* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. |
| 3 |
|
|
* |
| 4 |
|
|
* The University of Notre Dame grants you ("Licensee") a |
| 5 |
|
|
* non-exclusive, royalty free, license to use, modify and |
| 6 |
|
|
* redistribute this software in source and binary code form, provided |
| 7 |
|
|
* that the following conditions are met: |
| 8 |
|
|
* |
| 9 |
|
|
* 1. Acknowledgement of the program authors must be made in any |
| 10 |
|
|
* publication of scientific results based in part on use of the |
| 11 |
|
|
* program. An acceptable form of acknowledgement is citation of |
| 12 |
|
|
* the article in which the program was described (Matthew |
| 13 |
|
|
* A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher |
| 14 |
|
|
* J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented |
| 15 |
|
|
* Parallel Simulation Engine for Molecular Dynamics," |
| 16 |
|
|
* J. Comput. Chem. 26, pp. 252-271 (2005)) |
| 17 |
|
|
* |
| 18 |
|
|
* 2. Redistributions of source code must retain the above copyright |
| 19 |
|
|
* notice, this list of conditions and the following disclaimer. |
| 20 |
|
|
* |
| 21 |
|
|
* 3. Redistributions in binary form must reproduce the above copyright |
| 22 |
|
|
* notice, this list of conditions and the following disclaimer in the |
| 23 |
|
|
* documentation and/or other materials provided with the |
| 24 |
|
|
* distribution. |
| 25 |
|
|
* |
| 26 |
|
|
* This software is provided "AS IS," without a warranty of any |
| 27 |
|
|
* kind. All express or implied conditions, representations and |
| 28 |
|
|
* warranties, including any implied warranty of merchantability, |
| 29 |
|
|
* fitness for a particular purpose or non-infringement, are hereby |
| 30 |
|
|
* excluded. The University of Notre Dame and its licensors shall not |
| 31 |
|
|
* be liable for any damages suffered by licensee as a result of |
| 32 |
|
|
* using, modifying or distributing the software or its |
| 33 |
|
|
* derivatives. In no event will the University of Notre Dame or its |
| 34 |
|
|
* licensors be liable for any lost revenue, profit or data, or for |
| 35 |
|
|
* direct, indirect, special, consequential, incidental or punitive |
| 36 |
|
|
* damages, however caused and regardless of the theory of liability, |
| 37 |
|
|
* arising out of the use of or inability to use software, even if the |
| 38 |
|
|
* University of Notre Dame has been advised of the possibility of |
| 39 |
|
|
* such damages. |
| 40 |
|
|
*/ |
| 41 |
|
|
|
| 42 |
gezelter |
2 |
#include <stdlib.h> |
| 43 |
|
|
#include <stdio.h> |
| 44 |
|
|
#include <string.h> |
| 45 |
|
|
#include "config.h" |
| 46 |
|
|
|
| 47 |
|
|
#ifdef IS_MPI |
| 48 |
|
|
#include <mpi.h> |
| 49 |
|
|
|
| 50 |
|
|
int nChecks; |
| 51 |
|
|
#endif // IS_MPI |
| 52 |
|
|
|
| 53 |
tim |
3 |
#include "utils/simError.h" |
| 54 |
gezelter |
2 |
|
| 55 |
|
|
errorStruct painCave; |
| 56 |
|
|
|
| 57 |
|
|
#ifdef IS_MPI |
| 58 |
|
|
|
| 59 |
|
|
char checkPointMsg[MAX_SIM_ERROR_MSG_LENGTH]; |
| 60 |
|
|
int worldRank; |
| 61 |
|
|
|
| 62 |
|
|
#endif |
| 63 |
|
|
|
| 64 |
|
|
|
| 65 |
|
|
void initSimError( void ){ |
| 66 |
|
|
painCave.errMsg[0] = '\0'; |
| 67 |
|
|
painCave.isFatal = 0; |
| 68 |
|
|
painCave.severity = OOPSE_ERROR; |
| 69 |
|
|
#ifdef IS_MPI |
| 70 |
|
|
painCave.isEventLoop = 0; |
| 71 |
|
|
nChecks = 0; |
| 72 |
|
|
MPI_Comm_rank( MPI_COMM_WORLD, &worldRank ); |
| 73 |
|
|
#endif |
| 74 |
|
|
} |
| 75 |
|
|
|
| 76 |
|
|
int simError( void ) { |
| 77 |
|
|
|
| 78 |
|
|
int myError = 1; |
| 79 |
|
|
int isError; |
| 80 |
|
|
char errorMsg[MAX_SIM_ERROR_MSG_LENGTH]; |
| 81 |
|
|
char nodeMsg[MAX_SIM_ERROR_MSG_LENGTH]; |
| 82 |
|
|
|
| 83 |
|
|
strcpy(errorMsg, "OOPSE "); |
| 84 |
|
|
switch( painCave.severity ) { |
| 85 |
|
|
case OOPSE_WARNING: |
| 86 |
|
|
strcat(errorMsg, "WARNING"); |
| 87 |
|
|
break; |
| 88 |
|
|
case OOPSE_INFO: |
| 89 |
|
|
strcat(errorMsg, "INFO"); |
| 90 |
|
|
break; |
| 91 |
|
|
default: |
| 92 |
|
|
if( painCave.isFatal ) { |
| 93 |
|
|
strcat(errorMsg, "FATAL "); |
| 94 |
|
|
} |
| 95 |
|
|
strcat(errorMsg, "ERROR"); |
| 96 |
|
|
} |
| 97 |
|
|
|
| 98 |
|
|
#ifdef IS_MPI |
| 99 |
|
|
if ( painCave.isEventLoop ) { |
| 100 |
|
|
sprintf( nodeMsg, " (reported by MPI node %d)", worldRank); |
| 101 |
|
|
strncat(errorMsg, nodeMsg, strlen(nodeMsg)); |
| 102 |
|
|
} |
| 103 |
|
|
#endif |
| 104 |
|
|
|
| 105 |
|
|
strcat(errorMsg, ":\n\t"); |
| 106 |
|
|
|
| 107 |
|
|
strncat(errorMsg, painCave.errMsg, strlen(painCave.errMsg)); |
| 108 |
|
|
|
| 109 |
|
|
strcat(errorMsg, "\n"); |
| 110 |
|
|
fprintf(stderr, errorMsg); |
| 111 |
|
|
|
| 112 |
|
|
#ifdef IS_MPI |
| 113 |
|
|
if (painCave.isEventLoop) |
| 114 |
|
|
return 1; |
| 115 |
|
|
#endif |
| 116 |
|
|
|
| 117 |
|
|
if (painCave.isFatal) { |
| 118 |
|
|
#ifdef IS_MPI |
| 119 |
|
|
MPI_Allreduce( &myError, &isError, 1, MPI_INT, MPI_LOR, MPI_COMM_WORLD ); |
| 120 |
|
|
MPI_Finalize(); |
| 121 |
|
|
#endif |
| 122 |
|
|
exit(0); |
| 123 |
|
|
} |
| 124 |
|
|
|
| 125 |
|
|
return 1; |
| 126 |
|
|
} |
| 127 |
|
|
|
| 128 |
|
|
|
| 129 |
|
|
#ifdef IS_MPI |
| 130 |
|
|
|
| 131 |
|
|
void MPIcheckPoint( void ){ |
| 132 |
|
|
|
| 133 |
|
|
int myError = 0; |
| 134 |
|
|
int isError; |
| 135 |
|
|
|
| 136 |
|
|
MPI_Allreduce( &myError, &isError, 1, MPI_INT, MPI_LOR, MPI_COMM_WORLD ); |
| 137 |
|
|
if( isError ){ |
| 138 |
|
|
MPI_Finalize(); |
| 139 |
|
|
exit(0); |
| 140 |
|
|
} |
| 141 |
|
|
|
| 142 |
|
|
#ifdef CHECKPOINT_VERBOSE |
| 143 |
|
|
nChecks++; |
| 144 |
|
|
if( worldRank == 0 ){ |
| 145 |
|
|
fprintf(stderr, |
| 146 |
|
|
"Checkpoint #%d reached: %s\n", |
| 147 |
|
|
nChecks, |
| 148 |
|
|
checkPointMsg ); |
| 149 |
|
|
} |
| 150 |
|
|
#endif // CHECKPOINT_VERBOSE |
| 151 |
|
|
|
| 152 |
|
|
} |
| 153 |
|
|
|
| 154 |
|
|
#endif // IS_MPI |
