1 |
gezelter |
507 |
/* |
2 |
gezelter |
246 |
* 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 |
gezelter |
1390 |
* 1. Redistributions of source code must retain the above copyright |
10 |
gezelter |
246 |
* notice, this list of conditions and the following disclaimer. |
11 |
|
|
* |
12 |
gezelter |
1390 |
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
gezelter |
246 |
* notice, this list of conditions and the following disclaimer in the |
14 |
|
|
* documentation and/or other materials provided with the |
15 |
|
|
* distribution. |
16 |
|
|
* |
17 |
|
|
* This software is provided "AS IS," without a warranty of any |
18 |
|
|
* kind. All express or implied conditions, representations and |
19 |
|
|
* warranties, including any implied warranty of merchantability, |
20 |
|
|
* fitness for a particular purpose or non-infringement, are hereby |
21 |
|
|
* excluded. The University of Notre Dame and its licensors shall not |
22 |
|
|
* be liable for any damages suffered by licensee as a result of |
23 |
|
|
* using, modifying or distributing the software or its |
24 |
|
|
* derivatives. In no event will the University of Notre Dame or its |
25 |
|
|
* licensors be liable for any lost revenue, profit or data, or for |
26 |
|
|
* direct, indirect, special, consequential, incidental or punitive |
27 |
|
|
* damages, however caused and regardless of the theory of liability, |
28 |
|
|
* arising out of the use of or inability to use software, even if the |
29 |
|
|
* University of Notre Dame has been advised of the possibility of |
30 |
|
|
* such damages. |
31 |
gezelter |
1390 |
* |
32 |
|
|
* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your |
33 |
|
|
* research, please cite the appropriate papers when you publish your |
34 |
|
|
* work. Good starting points are: |
35 |
|
|
* |
36 |
|
|
* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005). |
37 |
|
|
* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006). |
38 |
|
|
* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008). |
39 |
|
|
* [4] Vardeman & Gezelter, in progress (2009). |
40 |
gezelter |
246 |
*/ |
41 |
|
|
|
42 |
gezelter |
2 |
#include <stdlib.h> |
43 |
|
|
#include <stdio.h> |
44 |
|
|
#include <string.h> |
45 |
|
|
#include "config.h" |
46 |
|
|
#ifdef IS_MPI |
47 |
|
|
#include <mpi.h> |
48 |
gezelter |
1241 |
#endif |
49 |
gezelter |
2 |
|
50 |
|
|
int nChecks; |
51 |
|
|
|
52 |
tim |
3 |
#include "utils/simError.h" |
53 |
gezelter |
2 |
|
54 |
|
|
errorStruct painCave; |
55 |
|
|
|
56 |
|
|
char checkPointMsg[MAX_SIM_ERROR_MSG_LENGTH]; |
57 |
|
|
int worldRank; |
58 |
|
|
|
59 |
|
|
void initSimError( void ){ |
60 |
|
|
painCave.errMsg[0] = '\0'; |
61 |
|
|
painCave.isFatal = 0; |
62 |
gezelter |
1390 |
painCave.severity = OPENMD_ERROR; |
63 |
gezelter |
2 |
painCave.isEventLoop = 0; |
64 |
|
|
nChecks = 0; |
65 |
gezelter |
1241 |
#ifdef IS_MPI |
66 |
gezelter |
2 |
MPI_Comm_rank( MPI_COMM_WORLD, &worldRank ); |
67 |
gezelter |
1241 |
#else |
68 |
|
|
worldRank = 0; |
69 |
gezelter |
2 |
#endif |
70 |
|
|
} |
71 |
|
|
|
72 |
|
|
int simError( void ) { |
73 |
|
|
|
74 |
|
|
int myError = 1; |
75 |
|
|
int isError; |
76 |
|
|
char errorMsg[MAX_SIM_ERROR_MSG_LENGTH]; |
77 |
|
|
char nodeMsg[MAX_SIM_ERROR_MSG_LENGTH]; |
78 |
|
|
|
79 |
gezelter |
1390 |
strcpy(errorMsg, "OpenMD "); |
80 |
gezelter |
2 |
switch( painCave.severity ) { |
81 |
gezelter |
1390 |
case OPENMD_WARNING: |
82 |
|
|
strcat(errorMsg, "warning"); |
83 |
gezelter |
2 |
break; |
84 |
gezelter |
1390 |
case OPENMD_INFO: |
85 |
|
|
strcat(errorMsg, "info"); |
86 |
gezelter |
2 |
break; |
87 |
|
|
default: |
88 |
|
|
if( painCave.isFatal ) { |
89 |
|
|
strcat(errorMsg, "FATAL "); |
90 |
|
|
} |
91 |
|
|
strcat(errorMsg, "ERROR"); |
92 |
|
|
} |
93 |
|
|
|
94 |
|
|
#ifdef IS_MPI |
95 |
|
|
if ( painCave.isEventLoop ) { |
96 |
|
|
sprintf( nodeMsg, " (reported by MPI node %d)", worldRank); |
97 |
|
|
strncat(errorMsg, nodeMsg, strlen(nodeMsg)); |
98 |
|
|
} |
99 |
|
|
#endif |
100 |
|
|
|
101 |
|
|
strcat(errorMsg, ":\n\t"); |
102 |
|
|
|
103 |
|
|
strncat(errorMsg, painCave.errMsg, strlen(painCave.errMsg)); |
104 |
|
|
|
105 |
|
|
strcat(errorMsg, "\n"); |
106 |
gezelter |
1610 |
fprintf(stderr, "%s", errorMsg); |
107 |
gezelter |
2 |
|
108 |
|
|
#ifdef IS_MPI |
109 |
|
|
if (painCave.isEventLoop) |
110 |
|
|
return 1; |
111 |
|
|
#endif |
112 |
|
|
|
113 |
|
|
if (painCave.isFatal) { |
114 |
|
|
#ifdef IS_MPI |
115 |
|
|
MPI_Allreduce( &myError, &isError, 1, MPI_INT, MPI_LOR, MPI_COMM_WORLD ); |
116 |
|
|
MPI_Finalize(); |
117 |
|
|
#endif |
118 |
|
|
exit(0); |
119 |
|
|
} |
120 |
|
|
|
121 |
|
|
return 1; |
122 |
|
|
} |
123 |
|
|
|
124 |
|
|
|
125 |
gezelter |
1241 |
void errorCheckPoint( void ){ |
126 |
|
|
|
127 |
gezelter |
2 |
int myError = 0; |
128 |
gezelter |
1313 |
int isError = 0; |
129 |
gezelter |
2 |
|
130 |
gezelter |
1241 |
#ifdef IS_MPI |
131 |
gezelter |
2 |
MPI_Allreduce( &myError, &isError, 1, MPI_INT, MPI_LOR, MPI_COMM_WORLD ); |
132 |
gezelter |
1241 |
#else |
133 |
|
|
isError = myError; |
134 |
|
|
#endif |
135 |
|
|
|
136 |
gezelter |
2 |
if( isError ){ |
137 |
gezelter |
1241 |
|
138 |
|
|
#ifdef IS_MPI |
139 |
gezelter |
2 |
MPI_Finalize(); |
140 |
gezelter |
1241 |
#endif |
141 |
|
|
|
142 |
gezelter |
2 |
exit(0); |
143 |
|
|
} |
144 |
|
|
|
145 |
|
|
#ifdef CHECKPOINT_VERBOSE |
146 |
|
|
nChecks++; |
147 |
gezelter |
1241 |
|
148 |
|
|
#ifdef IS_MPI |
149 |
gezelter |
2 |
if( worldRank == 0 ){ |
150 |
gezelter |
1241 |
#endif |
151 |
|
|
|
152 |
gezelter |
2 |
fprintf(stderr, |
153 |
|
|
"Checkpoint #%d reached: %s\n", |
154 |
|
|
nChecks, |
155 |
|
|
checkPointMsg ); |
156 |
gezelter |
1241 |
#ifdef IS_MPI |
157 |
gezelter |
2 |
} |
158 |
gezelter |
1241 |
#endif |
159 |
|
|
|
160 |
tim |
564 |
#endif |
161 |
gezelter |
2 |
} |
162 |
|
|
|
163 |
gezelter |
1241 |
|