1 |
< |
/* |
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 |
< |
/** |
43 |
< |
* @file SimCreator.cpp |
44 |
< |
* @author tlin |
45 |
< |
* @date 11/03/2004 |
46 |
< |
* @time 13:51am |
47 |
< |
* @version 1.0 |
48 |
< |
*/ |
49 |
< |
|
50 |
< |
#include <sprng.h> |
51 |
< |
|
52 |
< |
#include "brains/MoleculeCreator.hpp" |
53 |
< |
#include "brains/SimCreator.hpp" |
54 |
< |
#include "brains/SimSnapshotManager.hpp" |
55 |
< |
#include "io/DumpReader.hpp" |
56 |
< |
#include "io/parse_me.h" |
57 |
< |
#include "UseTheForce/ForceFieldFactory.hpp" |
58 |
< |
#include "utils/simError.h" |
59 |
< |
#include "utils/StringUtils.hpp" |
60 |
< |
#ifdef IS_MPI |
61 |
< |
#include "io/mpiBASS.h" |
62 |
< |
#include "math/randomSPRNG.hpp" |
63 |
< |
#endif |
64 |
< |
|
65 |
< |
namespace oopse { |
66 |
< |
|
67 |
< |
void SimCreator::parseFile(const std::string mdFileName, MakeStamps* stamps, Globals* simParams){ |
68 |
< |
|
69 |
< |
#ifdef IS_MPI |
70 |
< |
|
71 |
< |
if (worldRank == 0) { |
72 |
< |
#endif // is_mpi |
73 |
< |
|
74 |
< |
simParams->initalize(); |
75 |
< |
set_interface_stamps(stamps, simParams); |
76 |
< |
|
77 |
< |
#ifdef IS_MPI |
78 |
< |
|
79 |
< |
mpiEventInit(); |
80 |
< |
|
81 |
< |
#endif |
82 |
< |
|
83 |
< |
yacc_BASS(mdFileName.c_str()); |
84 |
< |
|
85 |
< |
#ifdef IS_MPI |
86 |
< |
|
87 |
< |
throwMPIEvent(NULL); |
88 |
< |
} else { |
89 |
< |
set_interface_stamps(stamps, simParams); |
90 |
< |
mpiEventInit(); |
91 |
< |
MPIcheckPoint(); |
92 |
< |
mpiEventLoop(); |
93 |
< |
} |
94 |
< |
|
95 |
< |
#endif |
96 |
< |
|
97 |
< |
} |
98 |
< |
|
99 |
< |
SimInfo* SimCreator::createSim(const std::string & mdFileName, bool loadInitCoords) { |
100 |
< |
|
101 |
< |
MakeStamps * stamps = new MakeStamps(); |
102 |
< |
|
103 |
< |
Globals * simParams = new Globals(); |
104 |
< |
|
105 |
< |
//parse meta-data file |
106 |
< |
parseFile(mdFileName, stamps, simParams); |
107 |
< |
|
108 |
< |
//create the force field |
109 |
< |
ForceField * ff = ForceFieldFactory::getInstance()->createForceField( |
110 |
< |
simParams->getForceField()); |
111 |
< |
|
112 |
< |
if (ff == NULL) { |
113 |
< |
sprintf(painCave.errMsg, "ForceField Factory can not create %s force field\n", |
114 |
< |
simParams->getForceField()); |
115 |
< |
painCave.isFatal = 1; |
116 |
< |
simError(); |
117 |
< |
} |
118 |
< |
|
119 |
< |
if (simParams->haveForceFieldFileName()) { |
120 |
< |
ff->setForceFieldFileName(simParams->getForceFieldFileName()); |
121 |
< |
} |
122 |
< |
|
123 |
< |
std::string forcefieldFileName; |
124 |
< |
forcefieldFileName = ff->getForceFieldFileName(); |
125 |
< |
|
126 |
< |
if (simParams->haveForceFieldVariant()) { |
127 |
< |
//If the force field has variant, the variant force field name will be |
128 |
< |
//Base.variant.frc. For exampel EAM.u6.frc |
129 |
< |
|
130 |
< |
std::string variant = simParams->getForceFieldVariant(); |
131 |
< |
|
132 |
< |
std::string::size_type pos = forcefieldFileName.rfind(".frc"); |
133 |
< |
variant = "." + variant; |
134 |
< |
if (pos != std::string::npos) { |
135 |
< |
forcefieldFileName.insert(pos, variant); |
136 |
< |
} else { |
137 |
< |
//If the default force field file name does not containt .frc suffix, just append the .variant |
138 |
< |
forcefieldFileName.append(variant); |
139 |
< |
} |
140 |
< |
} |
141 |
< |
|
142 |
< |
ff->parse(forcefieldFileName); |
143 |
< |
|
144 |
< |
//extract the molecule stamps |
145 |
< |
std::vector < std::pair<MoleculeStamp *, int> > moleculeStampPairs; |
146 |
< |
compList(stamps, simParams, moleculeStampPairs); |
147 |
< |
|
148 |
< |
//create SimInfo |
149 |
< |
SimInfo * info = new SimInfo(moleculeStampPairs, ff, simParams); |
150 |
< |
|
151 |
< |
//gather parameters (SimCreator only retrieves part of the parameters) |
152 |
< |
gatherParameters(info, mdFileName); |
153 |
< |
|
154 |
< |
//divide the molecules and determine the global index of molecules |
155 |
< |
#ifdef IS_MPI |
156 |
< |
divideMolecules(info); |
157 |
< |
#endif |
158 |
< |
|
159 |
< |
//create the molecules |
160 |
< |
createMolecules(info); |
161 |
< |
|
162 |
< |
|
163 |
< |
//allocate memory for DataStorage(circular reference, need to break it) |
164 |
< |
info->setSnapshotManager(new SimSnapshotManager(info)); |
165 |
< |
|
166 |
< |
//set the global index of atoms, rigidbodies and cutoffgroups (only need to be set once, the |
167 |
< |
//global index will never change again). Local indices of atoms and rigidbodies are already set by |
168 |
< |
//MoleculeCreator class which actually delegates the responsibility to LocalIndexManager. |
169 |
< |
setGlobalIndex(info); |
170 |
< |
|
171 |
< |
//Alought addExculdePairs is called inside SimInfo's addMolecule method, at that point |
172 |
< |
//atoms don't have the global index yet (their global index are all initialized to -1). |
173 |
< |
//Therefore we have to call addExcludePairs explicitly here. A way to work around is that |
174 |
< |
//we can determine the beginning global indices of atoms before they get created. |
175 |
< |
SimInfo::MoleculeIterator mi; |
176 |
< |
Molecule* mol; |
177 |
< |
for (mol= info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { |
178 |
< |
info->addExcludePairs(mol); |
179 |
< |
} |
180 |
< |
|
181 |
< |
|
182 |
< |
//load initial coordinates, some extra information are pushed into SimInfo's property map ( such as |
183 |
< |
//eta, chi for NPT integrator) |
184 |
< |
if (loadInitCoords) |
185 |
< |
loadCoordinates(info); |
186 |
< |
|
187 |
< |
return info; |
188 |
< |
} |
189 |
< |
|
190 |
< |
void SimCreator::gatherParameters(SimInfo *info, const std::string& mdfile) { |
191 |
< |
|
192 |
< |
//setup seed for random number generator |
193 |
< |
int seedValue; |
194 |
< |
Globals * simParams = info->getSimParams(); |
195 |
< |
|
196 |
< |
if (simParams->haveSeed()) { |
197 |
< |
seedValue = simParams->getSeed(); |
198 |
< |
|
199 |
< |
if (seedValue < 100000000 ) { |
200 |
< |
sprintf(painCave.errMsg, |
201 |
< |
"Seed for sprng library should contain at least 9 digits\n" |
202 |
< |
"OOPSE will generate a seed for user\n"); |
203 |
< |
|
204 |
< |
painCave.isFatal = 0; |
205 |
< |
simError(); |
206 |
< |
|
207 |
< |
//using seed generated by system instead of invalid seed set by user |
208 |
< |
|
209 |
< |
#ifndef IS_MPI |
210 |
< |
|
211 |
< |
seedValue = make_sprng_seed(); |
212 |
< |
|
213 |
< |
#else |
214 |
< |
|
215 |
< |
if (worldRank == 0) { |
216 |
< |
seedValue = make_sprng_seed(); |
217 |
< |
} |
218 |
< |
|
219 |
< |
MPI_Bcast(&seedValue, 1, MPI_INT, 0, MPI_COMM_WORLD); |
220 |
< |
|
221 |
< |
#endif |
222 |
< |
|
223 |
< |
} //end if (seedValue /1000000000 == 0) |
224 |
< |
} else { |
225 |
< |
|
226 |
< |
#ifndef IS_MPI |
227 |
< |
|
228 |
< |
seedValue = make_sprng_seed(); |
229 |
< |
|
230 |
< |
#else |
231 |
< |
|
232 |
< |
if (worldRank == 0) { |
233 |
< |
seedValue = make_sprng_seed(); |
234 |
< |
} |
235 |
< |
|
236 |
< |
MPI_Bcast(&seedValue, 1, MPI_INT, 0, MPI_COMM_WORLD); |
237 |
< |
|
238 |
< |
#endif |
239 |
< |
|
240 |
< |
} //end of simParams->haveSeed() |
241 |
< |
|
242 |
< |
info->setSeed(seedValue); |
243 |
< |
|
244 |
< |
|
245 |
< |
//figure out the ouput file names |
246 |
< |
std::string prefix; |
247 |
< |
|
248 |
< |
#ifdef IS_MPI |
249 |
< |
|
250 |
< |
if (worldRank == 0) { |
251 |
< |
#endif // is_mpi |
252 |
< |
|
253 |
< |
if (simParams->haveFinalConfig()) { |
254 |
< |
prefix = getPrefix(simParams->getFinalConfig()); |
255 |
< |
} else { |
256 |
< |
prefix = getPrefix(mdfile); |
257 |
< |
} |
258 |
< |
|
259 |
< |
info->setFinalConfigFileName(prefix + ".eor"); |
260 |
< |
info->setDumpFileName(prefix + ".dump"); |
261 |
< |
info->setStatFileName(prefix + ".stat"); |
262 |
< |
|
263 |
< |
#ifdef IS_MPI |
264 |
< |
|
265 |
< |
} |
266 |
< |
|
267 |
< |
#endif |
268 |
< |
|
269 |
< |
} |
270 |
< |
|
271 |
< |
#ifdef IS_MPI |
272 |
< |
void SimCreator::divideMolecules(SimInfo *info) { |
273 |
< |
double numerator; |
274 |
< |
double denominator; |
275 |
< |
double precast; |
276 |
< |
double x; |
277 |
< |
double y; |
278 |
< |
double a; |
279 |
< |
int old_atoms; |
280 |
< |
int add_atoms; |
281 |
< |
int new_atoms; |
282 |
< |
int nTarget; |
283 |
< |
int done; |
284 |
< |
int i; |
285 |
< |
int j; |
286 |
< |
int loops; |
287 |
< |
int which_proc; |
288 |
< |
int nProcessors; |
289 |
< |
std::vector<int> atomsPerProc; |
290 |
< |
int nGlobalMols = info->getNGlobalMolecules(); |
291 |
< |
std::vector<int> molToProcMap(nGlobalMols, -1); // default to an error condition: |
292 |
< |
|
293 |
< |
MPI_Comm_size(MPI_COMM_WORLD, &nProcessors); |
294 |
< |
|
295 |
< |
if (nProcessors > nGlobalMols) { |
296 |
< |
sprintf(painCave.errMsg, |
297 |
< |
"nProcessors (%d) > nMol (%d)\n" |
298 |
< |
"\tThe number of processors is larger than\n" |
299 |
< |
"\tthe number of molecules. This will not result in a \n" |
300 |
< |
"\tusable division of atoms for force decomposition.\n" |
301 |
< |
"\tEither try a smaller number of processors, or run the\n" |
302 |
< |
"\tsingle-processor version of OOPSE.\n", nProcessors, nGlobalMols); |
303 |
< |
|
304 |
< |
painCave.isFatal = 1; |
305 |
< |
simError(); |
306 |
< |
} |
307 |
< |
|
308 |
< |
MTRand myRandom(info->getSeed(), nProcessors, worldRank); |
309 |
< |
|
310 |
< |
|
311 |
< |
a = 3.0 * nGlobalMols / info->getNGlobalAtoms(); |
312 |
< |
|
313 |
< |
//initialize atomsPerProc |
314 |
< |
atomsPerProc.insert(atomsPerProc.end(), nProcessors, 0); |
315 |
< |
|
316 |
< |
if (worldRank == 0) { |
317 |
< |
numerator = info->getNGlobalAtoms(); |
318 |
< |
denominator = nProcessors; |
319 |
< |
precast = numerator / denominator; |
320 |
< |
nTarget = (int)(precast + 0.5); |
321 |
< |
|
322 |
< |
for(i = 0; i < nGlobalMols; i++) { |
323 |
< |
done = 0; |
324 |
< |
loops = 0; |
325 |
< |
|
326 |
< |
while (!done) { |
327 |
< |
loops++; |
328 |
< |
|
329 |
< |
// Pick a processor at random |
330 |
< |
|
331 |
< |
which_proc = (int) (myRandom.rand() * nProcessors); |
332 |
< |
|
333 |
< |
//get the molecule stamp first |
334 |
< |
int stampId = info->getMoleculeStampId(i); |
335 |
< |
MoleculeStamp * moleculeStamp = info->getMoleculeStamp(stampId); |
336 |
< |
|
337 |
< |
// How many atoms does this processor have so far? |
338 |
< |
old_atoms = atomsPerProc[which_proc]; |
339 |
< |
add_atoms = moleculeStamp->getNAtoms(); |
340 |
< |
new_atoms = old_atoms + add_atoms; |
341 |
< |
|
342 |
< |
// If we've been through this loop too many times, we need |
343 |
< |
// to just give up and assign the molecule to this processor |
344 |
< |
// and be done with it. |
345 |
< |
|
346 |
< |
if (loops > 100) { |
347 |
< |
sprintf(painCave.errMsg, |
348 |
< |
"I've tried 100 times to assign molecule %d to a " |
349 |
< |
" processor, but can't find a good spot.\n" |
350 |
< |
"I'm assigning it at random to processor %d.\n", |
351 |
< |
i, which_proc); |
352 |
< |
|
353 |
< |
painCave.isFatal = 0; |
354 |
< |
simError(); |
355 |
< |
|
356 |
< |
molToProcMap[i] = which_proc; |
357 |
< |
atomsPerProc[which_proc] += add_atoms; |
358 |
< |
|
359 |
< |
done = 1; |
360 |
< |
continue; |
361 |
< |
} |
362 |
< |
|
363 |
< |
// If we can add this molecule to this processor without sending |
364 |
< |
// it above nTarget, then go ahead and do it: |
365 |
< |
|
366 |
< |
if (new_atoms <= nTarget) { |
367 |
< |
molToProcMap[i] = which_proc; |
368 |
< |
atomsPerProc[which_proc] += add_atoms; |
369 |
< |
|
370 |
< |
done = 1; |
371 |
< |
continue; |
372 |
< |
} |
373 |
< |
|
374 |
< |
// The only situation left is when new_atoms > nTarget. We |
375 |
< |
// want to accept this with some probability that dies off the |
376 |
< |
// farther we are from nTarget |
377 |
< |
|
378 |
< |
// roughly: x = new_atoms - nTarget |
379 |
< |
// Pacc(x) = exp(- a * x) |
380 |
< |
// where a = penalty / (average atoms per molecule) |
381 |
< |
|
382 |
< |
x = (double)(new_atoms - nTarget); |
383 |
< |
y = myRandom.getRandom(); |
384 |
< |
|
385 |
< |
if (y < exp(- a * x)) { |
386 |
< |
molToProcMap[i] = which_proc; |
387 |
< |
atomsPerProc[which_proc] += add_atoms; |
388 |
< |
|
389 |
< |
done = 1; |
390 |
< |
continue; |
391 |
< |
} else { |
392 |
< |
continue; |
393 |
< |
} |
394 |
< |
} |
395 |
< |
} |
396 |
< |
|
397 |
< |
// Spray out this nonsense to all other processors: |
398 |
< |
|
399 |
< |
MPI_Bcast(&molToProcMap[0], nGlobalMols, MPI_INT, 0, MPI_COMM_WORLD); |
400 |
< |
} else { |
401 |
< |
|
402 |
< |
// Listen to your marching orders from processor 0: |
403 |
< |
|
404 |
< |
MPI_Bcast(&molToProcMap[0], nGlobalMols, MPI_INT, 0, MPI_COMM_WORLD); |
405 |
< |
} |
406 |
< |
|
407 |
< |
info->setMolToProcMap(molToProcMap); |
408 |
< |
sprintf(checkPointMsg, |
409 |
< |
"Successfully divided the molecules among the processors.\n"); |
410 |
< |
MPIcheckPoint(); |
411 |
< |
} |
412 |
< |
|
413 |
< |
#endif |
414 |
< |
|
415 |
< |
void SimCreator::createMolecules(SimInfo *info) { |
416 |
< |
MoleculeCreator molCreator; |
417 |
< |
int stampId; |
418 |
< |
|
419 |
< |
for(int i = 0; i < info->getNGlobalMolecules(); i++) { |
420 |
< |
|
421 |
< |
#ifdef IS_MPI |
422 |
< |
|
423 |
< |
if (info->getMolToProc(i) == worldRank) { |
424 |
< |
#endif |
425 |
< |
|
426 |
< |
stampId = info->getMoleculeStampId(i); |
427 |
< |
Molecule * mol = molCreator.createMolecule(info->getForceField(), info->getMoleculeStamp(stampId), |
428 |
< |
stampId, i, info->getLocalIndexManager()); |
429 |
< |
|
430 |
< |
info->addMolecule(mol); |
431 |
< |
|
432 |
< |
#ifdef IS_MPI |
433 |
< |
|
434 |
< |
} |
435 |
< |
|
436 |
< |
#endif |
437 |
< |
|
438 |
< |
} //end for(int i=0) |
439 |
< |
} |
440 |
< |
|
441 |
< |
void SimCreator::compList(MakeStamps *stamps, Globals* simParams, |
442 |
< |
std::vector < std::pair<MoleculeStamp *, int> > &moleculeStampPairs) { |
443 |
< |
int i; |
444 |
< |
char * id; |
445 |
< |
MoleculeStamp * currentStamp; |
446 |
< |
Component** the_components = simParams->getComponents(); |
447 |
< |
int n_components = simParams->getNComponents(); |
448 |
< |
|
449 |
< |
if (!simParams->haveNMol()) { |
450 |
< |
// we don't have the total number of molecules, so we assume it is |
451 |
< |
// given in each component |
452 |
< |
|
453 |
< |
for(i = 0; i < n_components; i++) { |
454 |
< |
if (!the_components[i]->haveNMol()) { |
455 |
< |
// we have a problem |
456 |
< |
sprintf(painCave.errMsg, |
457 |
< |
"SimCreator Error. No global NMol or component NMol given.\n" |
458 |
< |
"\tCannot calculate the number of atoms.\n"); |
459 |
< |
|
460 |
< |
painCave.isFatal = 1; |
461 |
< |
simError(); |
462 |
< |
} |
463 |
< |
|
464 |
< |
id = the_components[i]->getType(); |
465 |
< |
currentStamp = (stamps->extractMolStamp(id))->getStamp(); |
466 |
< |
|
467 |
< |
if (currentStamp == NULL) { |
468 |
< |
sprintf(painCave.errMsg, |
469 |
< |
"SimCreator error: Component \"%s\" was not found in the " |
470 |
< |
"list of declared molecules\n", id); |
471 |
< |
|
472 |
< |
painCave.isFatal = 1; |
473 |
< |
simError(); |
474 |
< |
} |
475 |
< |
|
476 |
< |
moleculeStampPairs.push_back( |
477 |
< |
std::make_pair(currentStamp, the_components[i]->getNMol())); |
478 |
< |
} //end for (i = 0; i < n_components; i++) |
479 |
< |
} else { |
480 |
< |
sprintf(painCave.errMsg, "SimSetup error.\n" |
481 |
< |
"\tSorry, the ability to specify total" |
482 |
< |
" nMols and then give molfractions in the components\n" |
483 |
< |
"\tis not currently supported." |
484 |
< |
" Please give nMol in the components.\n"); |
485 |
< |
|
486 |
< |
painCave.isFatal = 1; |
487 |
< |
simError(); |
488 |
< |
} |
489 |
< |
|
490 |
< |
#ifdef IS_MPI |
491 |
< |
|
492 |
< |
strcpy(checkPointMsg, "Component stamps successfully extracted\n"); |
493 |
< |
MPIcheckPoint(); |
494 |
< |
|
495 |
< |
#endif // is_mpi |
496 |
< |
|
497 |
< |
} |
498 |
< |
|
499 |
< |
void SimCreator::setGlobalIndex(SimInfo *info) { |
500 |
< |
SimInfo::MoleculeIterator mi; |
501 |
< |
Molecule::AtomIterator ai; |
502 |
< |
Molecule::RigidBodyIterator ri; |
503 |
< |
Molecule::CutoffGroupIterator ci; |
504 |
< |
Molecule * mol; |
505 |
< |
Atom * atom; |
506 |
< |
RigidBody * rb; |
507 |
< |
CutoffGroup * cg; |
508 |
< |
int beginAtomIndex; |
509 |
< |
int beginRigidBodyIndex; |
510 |
< |
int beginCutoffGroupIndex; |
511 |
< |
int nGlobalAtoms = info->getNGlobalAtoms(); |
512 |
< |
|
513 |
< |
#ifndef IS_MPI |
514 |
< |
|
515 |
< |
beginAtomIndex = 0; |
516 |
< |
beginRigidBodyIndex = 0; |
517 |
< |
beginCutoffGroupIndex = 0; |
518 |
< |
|
519 |
< |
#else |
520 |
< |
|
521 |
< |
int nproc; |
522 |
< |
int myNode; |
523 |
< |
|
524 |
< |
myNode = worldRank; |
525 |
< |
MPI_Comm_size(MPI_COMM_WORLD, &nproc); |
526 |
< |
|
527 |
< |
std::vector < int > tmpAtomsInProc(nproc, 0); |
528 |
< |
std::vector < int > tmpRigidBodiesInProc(nproc, 0); |
529 |
< |
std::vector < int > tmpCutoffGroupsInProc(nproc, 0); |
530 |
< |
std::vector < int > NumAtomsInProc(nproc, 0); |
531 |
< |
std::vector < int > NumRigidBodiesInProc(nproc, 0); |
532 |
< |
std::vector < int > NumCutoffGroupsInProc(nproc, 0); |
533 |
< |
|
534 |
< |
tmpAtomsInProc[myNode] = info->getNAtoms(); |
535 |
< |
tmpRigidBodiesInProc[myNode] = info->getNRigidBodies(); |
536 |
< |
tmpCutoffGroupsInProc[myNode] = info->getNCutoffGroups(); |
537 |
< |
|
538 |
< |
//do MPI_ALLREDUCE to exchange the total number of atoms, rigidbodies and cutoff groups |
539 |
< |
MPI_Allreduce(&tmpAtomsInProc[0], &NumAtomsInProc[0], nproc, MPI_INT, |
540 |
< |
MPI_SUM, MPI_COMM_WORLD); |
541 |
< |
MPI_Allreduce(&tmpRigidBodiesInProc[0], &NumRigidBodiesInProc[0], nproc, |
542 |
< |
MPI_INT, MPI_SUM, MPI_COMM_WORLD); |
543 |
< |
MPI_Allreduce(&tmpCutoffGroupsInProc[0], &NumCutoffGroupsInProc[0], nproc, |
544 |
< |
MPI_INT, MPI_SUM, MPI_COMM_WORLD); |
545 |
< |
|
546 |
< |
beginAtomIndex = 0; |
547 |
< |
beginRigidBodyIndex = 0; |
548 |
< |
beginCutoffGroupIndex = 0; |
549 |
< |
|
550 |
< |
for(int i = 0; i < myNode; i++) { |
551 |
< |
beginAtomIndex += NumAtomsInProc[i]; |
552 |
< |
beginRigidBodyIndex += NumRigidBodiesInProc[i]; |
553 |
< |
beginCutoffGroupIndex += NumCutoffGroupsInProc[i]; |
554 |
< |
} |
555 |
< |
|
556 |
< |
#endif |
557 |
< |
|
558 |
< |
//rigidbody's index begins right after atom's |
559 |
< |
beginRigidBodyIndex += info->getNGlobalAtoms(); |
560 |
< |
|
561 |
< |
for(mol = info->beginMolecule(mi); mol != NULL; |
562 |
< |
mol = info->nextMolecule(mi)) { |
563 |
< |
|
564 |
< |
//local index(index in DataStorge) of atom is important |
565 |
< |
for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { |
566 |
< |
atom->setGlobalIndex(beginAtomIndex++); |
567 |
< |
} |
568 |
< |
|
569 |
< |
for(rb = mol->beginRigidBody(ri); rb != NULL; |
570 |
< |
rb = mol->nextRigidBody(ri)) { |
571 |
< |
rb->setGlobalIndex(beginRigidBodyIndex++); |
572 |
< |
} |
573 |
< |
|
574 |
< |
//local index of cutoff group is trivial, it only depends on the order of travesing |
575 |
< |
for(cg = mol->beginCutoffGroup(ci); cg != NULL; |
576 |
< |
cg = mol->nextCutoffGroup(ci)) { |
577 |
< |
cg->setGlobalIndex(beginCutoffGroupIndex++); |
578 |
< |
} |
579 |
< |
} |
580 |
< |
|
581 |
< |
//fill globalGroupMembership |
582 |
< |
std::vector<int> globalGroupMembership(info->getNGlobalAtoms(), 0); |
583 |
< |
for(mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { |
584 |
< |
for (cg = mol->beginCutoffGroup(ci); cg != NULL; cg = mol->nextCutoffGroup(ci)) { |
585 |
< |
|
586 |
< |
for(atom = cg->beginAtom(ai); atom != NULL; atom = cg->nextAtom(ai)) { |
587 |
< |
globalGroupMembership[atom->getGlobalIndex()] = cg->getGlobalIndex(); |
588 |
< |
} |
589 |
< |
|
590 |
< |
} |
591 |
< |
} |
592 |
< |
|
593 |
< |
#ifdef IS_MPI |
594 |
< |
// Since the globalGroupMembership has been zero filled and we've only |
595 |
< |
// poked values into the atoms we know, we can do an Allreduce |
596 |
< |
// to get the full globalGroupMembership array (We think). |
597 |
< |
// This would be prettier if we could use MPI_IN_PLACE like the MPI-2 |
598 |
< |
// docs said we could. |
599 |
< |
std::vector<int> tmpGroupMembership(nGlobalAtoms, 0); |
600 |
< |
MPI_Allreduce(&globalGroupMembership[0], &tmpGroupMembership[0], nGlobalAtoms, |
601 |
< |
MPI_INT, MPI_SUM, MPI_COMM_WORLD); |
602 |
< |
info->setGlobalGroupMembership(tmpGroupMembership); |
603 |
< |
#else |
604 |
< |
info->setGlobalGroupMembership(globalGroupMembership); |
605 |
< |
#endif |
606 |
< |
|
607 |
< |
//fill molMembership |
608 |
< |
std::vector<int> globalMolMembership(info->getNGlobalAtoms(), 0); |
609 |
< |
|
610 |
< |
for(mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { |
611 |
< |
|
612 |
< |
for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { |
613 |
< |
globalMolMembership[atom->getGlobalIndex()] = mol->getGlobalIndex(); |
614 |
< |
} |
615 |
< |
} |
616 |
< |
|
617 |
< |
#ifdef IS_MPI |
618 |
< |
std::vector<int> tmpMolMembership(nGlobalAtoms, 0); |
619 |
< |
|
620 |
< |
MPI_Allreduce(&globalMolMembership[0], &tmpMolMembership[0], nGlobalAtoms, |
621 |
< |
MPI_INT, MPI_SUM, MPI_COMM_WORLD); |
622 |
< |
|
623 |
< |
info->setGlobalMolMembership(tmpMolMembership); |
624 |
< |
#else |
625 |
< |
info->setGlobalMolMembership(globalMolMembership); |
626 |
< |
#endif |
627 |
< |
|
628 |
< |
} |
629 |
< |
|
630 |
< |
void SimCreator::loadCoordinates(SimInfo* info) { |
631 |
< |
Globals* simParams; |
632 |
< |
simParams = info->getSimParams(); |
633 |
< |
|
634 |
< |
if (!simParams->haveInitialConfig()) { |
635 |
< |
sprintf(painCave.errMsg, |
636 |
< |
"Cannot intialize a simulation without an initial configuration file.\n"); |
637 |
< |
painCave.isFatal = 1;; |
638 |
< |
simError(); |
639 |
< |
} |
640 |
< |
|
641 |
< |
DumpReader reader(info, simParams->getInitialConfig()); |
642 |
< |
int nframes = reader.getNFrames(); |
643 |
< |
|
644 |
< |
if (nframes > 0) { |
645 |
< |
reader.readFrame(nframes - 1); |
646 |
< |
} else { |
647 |
< |
//invalid initial coordinate file |
648 |
< |
sprintf(painCave.errMsg, "Initial configuration file %s should at least contain one frame\n", |
649 |
< |
simParams->getInitialConfig()); |
650 |
< |
painCave.isFatal = 1; |
651 |
< |
simError(); |
652 |
< |
} |
653 |
< |
|
654 |
< |
//copy the current snapshot to previous snapshot |
655 |
< |
info->getSnapshotManager()->advance(); |
656 |
< |
} |
657 |
< |
|
658 |
< |
} //end namespace oopse |
659 |
< |
|
660 |
< |
|
1 |
> |
/* |
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. Redistributions of source code must retain the above copyright |
10 |
> |
* notice, this list of conditions and the following disclaimer. |
11 |
> |
* |
12 |
> |
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
> |
* 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 |
> |
* |
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] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010). |
40 |
> |
* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). |
41 |
> |
*/ |
42 |
> |
|
43 |
> |
/** |
44 |
> |
* @file SimCreator.cpp |
45 |
> |
* @author tlin |
46 |
> |
* @date 11/03/2004 |
47 |
> |
* @time 13:51am |
48 |
> |
* @version 1.0 |
49 |
> |
*/ |
50 |
> |
#include <exception> |
51 |
> |
#include <iostream> |
52 |
> |
#include <sstream> |
53 |
> |
#include <string> |
54 |
> |
|
55 |
> |
#include "brains/MoleculeCreator.hpp" |
56 |
> |
#include "brains/SimCreator.hpp" |
57 |
> |
#include "brains/SimSnapshotManager.hpp" |
58 |
> |
#include "io/DumpReader.hpp" |
59 |
> |
#include "brains/ForceField.hpp" |
60 |
> |
#include "utils/simError.h" |
61 |
> |
#include "utils/StringUtils.hpp" |
62 |
> |
#include "math/SeqRandNumGen.hpp" |
63 |
> |
#include "mdParser/MDLexer.hpp" |
64 |
> |
#include "mdParser/MDParser.hpp" |
65 |
> |
#include "mdParser/MDTreeParser.hpp" |
66 |
> |
#include "mdParser/SimplePreprocessor.hpp" |
67 |
> |
#include "antlr/ANTLRException.hpp" |
68 |
> |
#include "antlr/TokenStreamRecognitionException.hpp" |
69 |
> |
#include "antlr/TokenStreamIOException.hpp" |
70 |
> |
#include "antlr/TokenStreamException.hpp" |
71 |
> |
#include "antlr/RecognitionException.hpp" |
72 |
> |
#include "antlr/CharStreamException.hpp" |
73 |
> |
|
74 |
> |
#include "antlr/MismatchedCharException.hpp" |
75 |
> |
#include "antlr/MismatchedTokenException.hpp" |
76 |
> |
#include "antlr/NoViableAltForCharException.hpp" |
77 |
> |
#include "antlr/NoViableAltException.hpp" |
78 |
> |
|
79 |
> |
#include "types/DirectionalAdapter.hpp" |
80 |
> |
#include "types/MultipoleAdapter.hpp" |
81 |
> |
#include "types/EAMAdapter.hpp" |
82 |
> |
#include "types/SuttonChenAdapter.hpp" |
83 |
> |
#include "types/PolarizableAdapter.hpp" |
84 |
> |
#include "types/FixedChargeAdapter.hpp" |
85 |
> |
#include "types/FluctuatingChargeAdapter.hpp" |
86 |
> |
|
87 |
> |
#ifdef IS_MPI |
88 |
> |
#include "mpi.h" |
89 |
> |
#include "math/ParallelRandNumGen.hpp" |
90 |
> |
#endif |
91 |
> |
|
92 |
> |
namespace OpenMD { |
93 |
> |
|
94 |
> |
Globals* SimCreator::parseFile(std::istream& rawMetaDataStream, const std::string& filename, int mdFileVersion, int startOfMetaDataBlock ){ |
95 |
> |
Globals* simParams = NULL; |
96 |
> |
try { |
97 |
> |
|
98 |
> |
// Create a preprocessor that preprocesses md file into an ostringstream |
99 |
> |
std::stringstream ppStream; |
100 |
> |
#ifdef IS_MPI |
101 |
> |
int streamSize; |
102 |
> |
const int masterNode = 0; |
103 |
> |
int commStatus; |
104 |
> |
if (worldRank == masterNode) { |
105 |
> |
commStatus = MPI_Bcast(&mdFileVersion, 1, MPI_INT, masterNode, MPI_COMM_WORLD); |
106 |
> |
#endif |
107 |
> |
SimplePreprocessor preprocessor; |
108 |
> |
preprocessor.preprocess(rawMetaDataStream, filename, startOfMetaDataBlock, ppStream); |
109 |
> |
|
110 |
> |
#ifdef IS_MPI |
111 |
> |
//brocasting the stream size |
112 |
> |
streamSize = ppStream.str().size() +1; |
113 |
> |
commStatus = MPI_Bcast(&streamSize, 1, MPI_LONG, masterNode, MPI_COMM_WORLD); |
114 |
> |
|
115 |
> |
commStatus = MPI_Bcast(static_cast<void*>(const_cast<char*>(ppStream.str().c_str())), streamSize, MPI_CHAR, masterNode, MPI_COMM_WORLD); |
116 |
> |
|
117 |
> |
|
118 |
> |
} else { |
119 |
> |
|
120 |
> |
commStatus = MPI_Bcast(&mdFileVersion, 1, MPI_INT, masterNode, MPI_COMM_WORLD); |
121 |
> |
|
122 |
> |
//get stream size |
123 |
> |
commStatus = MPI_Bcast(&streamSize, 1, MPI_LONG, masterNode, MPI_COMM_WORLD); |
124 |
> |
|
125 |
> |
char* buf = new char[streamSize]; |
126 |
> |
assert(buf); |
127 |
> |
|
128 |
> |
//receive file content |
129 |
> |
commStatus = MPI_Bcast(buf, streamSize, MPI_CHAR, masterNode, MPI_COMM_WORLD); |
130 |
> |
|
131 |
> |
ppStream.str(buf); |
132 |
> |
delete [] buf; |
133 |
> |
|
134 |
> |
} |
135 |
> |
#endif |
136 |
> |
// Create a scanner that reads from the input stream |
137 |
> |
MDLexer lexer(ppStream); |
138 |
> |
lexer.setFilename(filename); |
139 |
> |
lexer.initDeferredLineCount(); |
140 |
> |
|
141 |
> |
// Create a parser that reads from the scanner |
142 |
> |
MDParser parser(lexer); |
143 |
> |
parser.setFilename(filename); |
144 |
> |
|
145 |
> |
// Create an observer that synchorizes file name change |
146 |
> |
FilenameObserver observer; |
147 |
> |
observer.setLexer(&lexer); |
148 |
> |
observer.setParser(&parser); |
149 |
> |
lexer.setObserver(&observer); |
150 |
> |
|
151 |
> |
antlr::ASTFactory factory; |
152 |
> |
parser.initializeASTFactory(factory); |
153 |
> |
parser.setASTFactory(&factory); |
154 |
> |
parser.mdfile(); |
155 |
> |
|
156 |
> |
// Create a tree parser that reads information into Globals |
157 |
> |
MDTreeParser treeParser; |
158 |
> |
treeParser.initializeASTFactory(factory); |
159 |
> |
treeParser.setASTFactory(&factory); |
160 |
> |
simParams = treeParser.walkTree(parser.getAST()); |
161 |
> |
} |
162 |
> |
|
163 |
> |
|
164 |
> |
catch(antlr::MismatchedCharException& e) { |
165 |
> |
sprintf(painCave.errMsg, |
166 |
> |
"parser exception: %s %s:%d:%d\n", |
167 |
> |
e.getMessage().c_str(),e.getFilename().c_str(), e.getLine(), e.getColumn()); |
168 |
> |
painCave.isFatal = 1; |
169 |
> |
simError(); |
170 |
> |
} |
171 |
> |
catch(antlr::MismatchedTokenException &e) { |
172 |
> |
sprintf(painCave.errMsg, |
173 |
> |
"parser exception: %s %s:%d:%d\n", |
174 |
> |
e.getMessage().c_str(),e.getFilename().c_str(), e.getLine(), e.getColumn()); |
175 |
> |
painCave.isFatal = 1; |
176 |
> |
simError(); |
177 |
> |
} |
178 |
> |
catch(antlr::NoViableAltForCharException &e) { |
179 |
> |
sprintf(painCave.errMsg, |
180 |
> |
"parser exception: %s %s:%d:%d\n", |
181 |
> |
e.getMessage().c_str(),e.getFilename().c_str(), e.getLine(), e.getColumn()); |
182 |
> |
painCave.isFatal = 1; |
183 |
> |
simError(); |
184 |
> |
} |
185 |
> |
catch(antlr::NoViableAltException &e) { |
186 |
> |
sprintf(painCave.errMsg, |
187 |
> |
"parser exception: %s %s:%d:%d\n", |
188 |
> |
e.getMessage().c_str(),e.getFilename().c_str(), e.getLine(), e.getColumn()); |
189 |
> |
painCave.isFatal = 1; |
190 |
> |
simError(); |
191 |
> |
} |
192 |
> |
|
193 |
> |
catch(antlr::TokenStreamRecognitionException& e) { |
194 |
> |
sprintf(painCave.errMsg, |
195 |
> |
"parser exception: %s %s:%d:%d\n", |
196 |
> |
e.getMessage().c_str(),e.getFilename().c_str(), e.getLine(), e.getColumn()); |
197 |
> |
painCave.isFatal = 1; |
198 |
> |
simError(); |
199 |
> |
} |
200 |
> |
|
201 |
> |
catch(antlr::TokenStreamIOException& e) { |
202 |
> |
sprintf(painCave.errMsg, |
203 |
> |
"parser exception: %s\n", |
204 |
> |
e.getMessage().c_str()); |
205 |
> |
painCave.isFatal = 1; |
206 |
> |
simError(); |
207 |
> |
} |
208 |
> |
|
209 |
> |
catch(antlr::TokenStreamException& e) { |
210 |
> |
sprintf(painCave.errMsg, |
211 |
> |
"parser exception: %s\n", |
212 |
> |
e.getMessage().c_str()); |
213 |
> |
painCave.isFatal = 1; |
214 |
> |
simError(); |
215 |
> |
} |
216 |
> |
catch (antlr::RecognitionException& e) { |
217 |
> |
sprintf(painCave.errMsg, |
218 |
> |
"parser exception: %s %s:%d:%d\n", |
219 |
> |
e.getMessage().c_str(),e.getFilename().c_str(), e.getLine(), e.getColumn()); |
220 |
> |
painCave.isFatal = 1; |
221 |
> |
simError(); |
222 |
> |
} |
223 |
> |
catch (antlr::CharStreamException& e) { |
224 |
> |
sprintf(painCave.errMsg, |
225 |
> |
"parser exception: %s\n", |
226 |
> |
e.getMessage().c_str()); |
227 |
> |
painCave.isFatal = 1; |
228 |
> |
simError(); |
229 |
> |
} |
230 |
> |
catch (OpenMDException& e) { |
231 |
> |
sprintf(painCave.errMsg, |
232 |
> |
"%s\n", |
233 |
> |
e.getMessage().c_str()); |
234 |
> |
painCave.isFatal = 1; |
235 |
> |
simError(); |
236 |
> |
} |
237 |
> |
catch (std::exception& e) { |
238 |
> |
sprintf(painCave.errMsg, |
239 |
> |
"parser exception: %s\n", |
240 |
> |
e.what()); |
241 |
> |
painCave.isFatal = 1; |
242 |
> |
simError(); |
243 |
> |
} |
244 |
> |
|
245 |
> |
simParams->setMDfileVersion(mdFileVersion); |
246 |
> |
return simParams; |
247 |
> |
} |
248 |
> |
|
249 |
> |
SimInfo* SimCreator::createSim(const std::string & mdFileName, |
250 |
> |
bool loadInitCoords) { |
251 |
> |
|
252 |
> |
const int bufferSize = 65535; |
253 |
> |
char buffer[bufferSize]; |
254 |
> |
int lineNo = 0; |
255 |
> |
std::string mdRawData; |
256 |
> |
int metaDataBlockStart = -1; |
257 |
> |
int metaDataBlockEnd = -1; |
258 |
> |
int i; |
259 |
> |
streamoff mdOffset(0); |
260 |
> |
int mdFileVersion; |
261 |
> |
|
262 |
> |
|
263 |
> |
#ifdef IS_MPI |
264 |
> |
const int masterNode = 0; |
265 |
> |
if (worldRank == masterNode) { |
266 |
> |
#endif |
267 |
> |
|
268 |
> |
std::ifstream mdFile_; |
269 |
> |
mdFile_.open(mdFileName.c_str(), ifstream::in | ifstream::binary); |
270 |
> |
|
271 |
> |
if (mdFile_.fail()) { |
272 |
> |
sprintf(painCave.errMsg, |
273 |
> |
"SimCreator: Cannot open file: %s\n", |
274 |
> |
mdFileName.c_str()); |
275 |
> |
painCave.isFatal = 1; |
276 |
> |
simError(); |
277 |
> |
} |
278 |
> |
|
279 |
> |
mdFile_.getline(buffer, bufferSize); |
280 |
> |
++lineNo; |
281 |
> |
std::string line = trimLeftCopy(buffer); |
282 |
> |
i = CaseInsensitiveFind(line, "<OpenMD"); |
283 |
> |
if (static_cast<size_t>(i) == string::npos) { |
284 |
> |
// try the older file strings to see if that works: |
285 |
> |
i = CaseInsensitiveFind(line, "<OOPSE"); |
286 |
> |
} |
287 |
> |
|
288 |
> |
if (static_cast<size_t>(i) == string::npos) { |
289 |
> |
// still no luck! |
290 |
> |
sprintf(painCave.errMsg, |
291 |
> |
"SimCreator: File: %s is not a valid OpenMD file!\n", |
292 |
> |
mdFileName.c_str()); |
293 |
> |
painCave.isFatal = 1; |
294 |
> |
simError(); |
295 |
> |
} |
296 |
> |
|
297 |
> |
// found the correct opening string, now try to get the file |
298 |
> |
// format version number. |
299 |
> |
|
300 |
> |
StringTokenizer tokenizer(line, "=<> \t\n\r"); |
301 |
> |
std::string fileType = tokenizer.nextToken(); |
302 |
> |
toUpper(fileType); |
303 |
> |
|
304 |
> |
mdFileVersion = 0; |
305 |
> |
|
306 |
> |
if (fileType == "OPENMD") { |
307 |
> |
while (tokenizer.hasMoreTokens()) { |
308 |
> |
std::string token(tokenizer.nextToken()); |
309 |
> |
toUpper(token); |
310 |
> |
if (token == "VERSION") { |
311 |
> |
mdFileVersion = tokenizer.nextTokenAsInt(); |
312 |
> |
break; |
313 |
> |
} |
314 |
> |
} |
315 |
> |
} |
316 |
> |
|
317 |
> |
//scan through the input stream and find MetaData tag |
318 |
> |
while(mdFile_.getline(buffer, bufferSize)) { |
319 |
> |
++lineNo; |
320 |
> |
|
321 |
> |
std::string line = trimLeftCopy(buffer); |
322 |
> |
if (metaDataBlockStart == -1) { |
323 |
> |
i = CaseInsensitiveFind(line, "<MetaData>"); |
324 |
> |
if (i != string::npos) { |
325 |
> |
metaDataBlockStart = lineNo; |
326 |
> |
mdOffset = mdFile_.tellg(); |
327 |
> |
} |
328 |
> |
} else { |
329 |
> |
i = CaseInsensitiveFind(line, "</MetaData>"); |
330 |
> |
if (i != string::npos) { |
331 |
> |
metaDataBlockEnd = lineNo; |
332 |
> |
} |
333 |
> |
} |
334 |
> |
} |
335 |
> |
|
336 |
> |
if (metaDataBlockStart == -1) { |
337 |
> |
sprintf(painCave.errMsg, |
338 |
> |
"SimCreator: File: %s did not contain a <MetaData> tag!\n", |
339 |
> |
mdFileName.c_str()); |
340 |
> |
painCave.isFatal = 1; |
341 |
> |
simError(); |
342 |
> |
} |
343 |
> |
if (metaDataBlockEnd == -1) { |
344 |
> |
sprintf(painCave.errMsg, |
345 |
> |
"SimCreator: File: %s did not contain a closed MetaData block!\n", |
346 |
> |
mdFileName.c_str()); |
347 |
> |
painCave.isFatal = 1; |
348 |
> |
simError(); |
349 |
> |
} |
350 |
> |
|
351 |
> |
mdFile_.clear(); |
352 |
> |
mdFile_.seekg(0); |
353 |
> |
mdFile_.seekg(mdOffset); |
354 |
> |
|
355 |
> |
mdRawData.clear(); |
356 |
> |
|
357 |
> |
for (int i = 0; i < metaDataBlockEnd - metaDataBlockStart - 1; ++i) { |
358 |
> |
mdFile_.getline(buffer, bufferSize); |
359 |
> |
mdRawData += buffer; |
360 |
> |
mdRawData += "\n"; |
361 |
> |
} |
362 |
> |
|
363 |
> |
mdFile_.close(); |
364 |
> |
|
365 |
> |
#ifdef IS_MPI |
366 |
> |
} |
367 |
> |
#endif |
368 |
> |
|
369 |
> |
std::stringstream rawMetaDataStream(mdRawData); |
370 |
> |
|
371 |
> |
//parse meta-data file |
372 |
> |
Globals* simParams = parseFile(rawMetaDataStream, mdFileName, mdFileVersion, |
373 |
> |
metaDataBlockStart + 1); |
374 |
> |
|
375 |
> |
//create the force field |
376 |
> |
ForceField * ff = new ForceField(simParams->getForceField()); |
377 |
> |
|
378 |
> |
if (ff == NULL) { |
379 |
> |
sprintf(painCave.errMsg, |
380 |
> |
"ForceField Factory can not create %s force field\n", |
381 |
> |
simParams->getForceField().c_str()); |
382 |
> |
painCave.isFatal = 1; |
383 |
> |
simError(); |
384 |
> |
} |
385 |
> |
|
386 |
> |
if (simParams->haveForceFieldFileName()) { |
387 |
> |
ff->setForceFieldFileName(simParams->getForceFieldFileName()); |
388 |
> |
} |
389 |
> |
|
390 |
> |
std::string forcefieldFileName; |
391 |
> |
forcefieldFileName = ff->getForceFieldFileName(); |
392 |
> |
|
393 |
> |
if (simParams->haveForceFieldVariant()) { |
394 |
> |
//If the force field has variant, the variant force field name will be |
395 |
> |
//Base.variant.frc. For exampel EAM.u6.frc |
396 |
> |
|
397 |
> |
std::string variant = simParams->getForceFieldVariant(); |
398 |
> |
|
399 |
> |
std::string::size_type pos = forcefieldFileName.rfind(".frc"); |
400 |
> |
variant = "." + variant; |
401 |
> |
if (pos != std::string::npos) { |
402 |
> |
forcefieldFileName.insert(pos, variant); |
403 |
> |
} else { |
404 |
> |
//If the default force field file name does not containt .frc suffix, just append the .variant |
405 |
> |
forcefieldFileName.append(variant); |
406 |
> |
} |
407 |
> |
} |
408 |
> |
|
409 |
> |
ff->parse(forcefieldFileName); |
410 |
> |
//create SimInfo |
411 |
> |
SimInfo * info = new SimInfo(ff, simParams); |
412 |
> |
|
413 |
> |
info->setRawMetaData(mdRawData); |
414 |
> |
|
415 |
> |
//gather parameters (SimCreator only retrieves part of the |
416 |
> |
//parameters) |
417 |
> |
gatherParameters(info, mdFileName); |
418 |
> |
|
419 |
> |
//divide the molecules and determine the global index of molecules |
420 |
> |
#ifdef IS_MPI |
421 |
> |
divideMolecules(info); |
422 |
> |
#endif |
423 |
> |
|
424 |
> |
//create the molecules |
425 |
> |
createMolecules(info); |
426 |
> |
|
427 |
> |
//find the storage layout |
428 |
> |
|
429 |
> |
int storageLayout = computeStorageLayout(info); |
430 |
> |
|
431 |
> |
//allocate memory for DataStorage(circular reference, need to |
432 |
> |
//break it) |
433 |
> |
info->setSnapshotManager(new SimSnapshotManager(info, storageLayout)); |
434 |
> |
|
435 |
> |
//set the global index of atoms, rigidbodies and cutoffgroups |
436 |
> |
//(only need to be set once, the global index will never change |
437 |
> |
//again). Local indices of atoms and rigidbodies are already set |
438 |
> |
//by MoleculeCreator class which actually delegates the |
439 |
> |
//responsibility to LocalIndexManager. |
440 |
> |
setGlobalIndex(info); |
441 |
> |
|
442 |
> |
//Although addInteractionPairs is called inside SimInfo's addMolecule |
443 |
> |
//method, at that point atoms don't have the global index yet |
444 |
> |
//(their global index are all initialized to -1). Therefore we |
445 |
> |
//have to call addInteractionPairs explicitly here. A way to work |
446 |
> |
//around is that we can determine the beginning global indices of |
447 |
> |
//atoms before they get created. |
448 |
> |
SimInfo::MoleculeIterator mi; |
449 |
> |
Molecule* mol; |
450 |
> |
for (mol= info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { |
451 |
> |
info->addInteractionPairs(mol); |
452 |
> |
} |
453 |
> |
|
454 |
> |
if (loadInitCoords) |
455 |
> |
loadCoordinates(info, mdFileName); |
456 |
> |
return info; |
457 |
> |
} |
458 |
> |
|
459 |
> |
void SimCreator::gatherParameters(SimInfo *info, const std::string& mdfile) { |
460 |
> |
|
461 |
> |
//figure out the output file names |
462 |
> |
std::string prefix; |
463 |
> |
|
464 |
> |
#ifdef IS_MPI |
465 |
> |
|
466 |
> |
if (worldRank == 0) { |
467 |
> |
#endif // is_mpi |
468 |
> |
Globals * simParams = info->getSimParams(); |
469 |
> |
if (simParams->haveFinalConfig()) { |
470 |
> |
prefix = getPrefix(simParams->getFinalConfig()); |
471 |
> |
} else { |
472 |
> |
prefix = getPrefix(mdfile); |
473 |
> |
} |
474 |
> |
|
475 |
> |
info->setFinalConfigFileName(prefix + ".eor"); |
476 |
> |
info->setDumpFileName(prefix + ".dump"); |
477 |
> |
info->setStatFileName(prefix + ".stat"); |
478 |
> |
info->setRestFileName(prefix + ".zang"); |
479 |
> |
|
480 |
> |
#ifdef IS_MPI |
481 |
> |
|
482 |
> |
} |
483 |
> |
|
484 |
> |
#endif |
485 |
> |
|
486 |
> |
} |
487 |
> |
|
488 |
> |
#ifdef IS_MPI |
489 |
> |
void SimCreator::divideMolecules(SimInfo *info) { |
490 |
> |
RealType numerator; |
491 |
> |
RealType denominator; |
492 |
> |
RealType precast; |
493 |
> |
RealType x; |
494 |
> |
RealType y; |
495 |
> |
RealType a; |
496 |
> |
int old_atoms; |
497 |
> |
int add_atoms; |
498 |
> |
int new_atoms; |
499 |
> |
int nTarget; |
500 |
> |
int done; |
501 |
> |
int i; |
502 |
> |
int j; |
503 |
> |
int loops; |
504 |
> |
int which_proc; |
505 |
> |
int nProcessors; |
506 |
> |
std::vector<int> atomsPerProc; |
507 |
> |
int nGlobalMols = info->getNGlobalMolecules(); |
508 |
> |
std::vector<int> molToProcMap(nGlobalMols, -1); // default to an error condition: |
509 |
> |
|
510 |
> |
MPI_Comm_size(MPI_COMM_WORLD, &nProcessors); |
511 |
> |
|
512 |
> |
if (nProcessors > nGlobalMols) { |
513 |
> |
sprintf(painCave.errMsg, |
514 |
> |
"nProcessors (%d) > nMol (%d)\n" |
515 |
> |
"\tThe number of processors is larger than\n" |
516 |
> |
"\tthe number of molecules. This will not result in a \n" |
517 |
> |
"\tusable division of atoms for force decomposition.\n" |
518 |
> |
"\tEither try a smaller number of processors, or run the\n" |
519 |
> |
"\tsingle-processor version of OpenMD.\n", nProcessors, nGlobalMols); |
520 |
> |
|
521 |
> |
painCave.isFatal = 1; |
522 |
> |
simError(); |
523 |
> |
} |
524 |
> |
|
525 |
> |
int seedValue; |
526 |
> |
Globals * simParams = info->getSimParams(); |
527 |
> |
SeqRandNumGen* myRandom; //divide labor does not need Parallel random number generator |
528 |
> |
if (simParams->haveSeed()) { |
529 |
> |
seedValue = simParams->getSeed(); |
530 |
> |
myRandom = new SeqRandNumGen(seedValue); |
531 |
> |
}else { |
532 |
> |
myRandom = new SeqRandNumGen(); |
533 |
> |
} |
534 |
> |
|
535 |
> |
|
536 |
> |
a = 3.0 * nGlobalMols / info->getNGlobalAtoms(); |
537 |
> |
|
538 |
> |
//initialize atomsPerProc |
539 |
> |
atomsPerProc.insert(atomsPerProc.end(), nProcessors, 0); |
540 |
> |
|
541 |
> |
if (worldRank == 0) { |
542 |
> |
numerator = info->getNGlobalAtoms(); |
543 |
> |
denominator = nProcessors; |
544 |
> |
precast = numerator / denominator; |
545 |
> |
nTarget = (int)(precast + 0.5); |
546 |
> |
|
547 |
> |
for(i = 0; i < nGlobalMols; i++) { |
548 |
> |
done = 0; |
549 |
> |
loops = 0; |
550 |
> |
|
551 |
> |
while (!done) { |
552 |
> |
loops++; |
553 |
> |
|
554 |
> |
// Pick a processor at random |
555 |
> |
|
556 |
> |
which_proc = (int) (myRandom->rand() * nProcessors); |
557 |
> |
|
558 |
> |
//get the molecule stamp first |
559 |
> |
int stampId = info->getMoleculeStampId(i); |
560 |
> |
MoleculeStamp * moleculeStamp = info->getMoleculeStamp(stampId); |
561 |
> |
|
562 |
> |
// How many atoms does this processor have so far? |
563 |
> |
old_atoms = atomsPerProc[which_proc]; |
564 |
> |
add_atoms = moleculeStamp->getNAtoms(); |
565 |
> |
new_atoms = old_atoms + add_atoms; |
566 |
> |
|
567 |
> |
// If we've been through this loop too many times, we need |
568 |
> |
// to just give up and assign the molecule to this processor |
569 |
> |
// and be done with it. |
570 |
> |
|
571 |
> |
if (loops > 100) { |
572 |
> |
sprintf(painCave.errMsg, |
573 |
> |
"I've tried 100 times to assign molecule %d to a " |
574 |
> |
" processor, but can't find a good spot.\n" |
575 |
> |
"I'm assigning it at random to processor %d.\n", |
576 |
> |
i, which_proc); |
577 |
> |
|
578 |
> |
painCave.isFatal = 0; |
579 |
> |
simError(); |
580 |
> |
|
581 |
> |
molToProcMap[i] = which_proc; |
582 |
> |
atomsPerProc[which_proc] += add_atoms; |
583 |
> |
|
584 |
> |
done = 1; |
585 |
> |
continue; |
586 |
> |
} |
587 |
> |
|
588 |
> |
// If we can add this molecule to this processor without sending |
589 |
> |
// it above nTarget, then go ahead and do it: |
590 |
> |
|
591 |
> |
if (new_atoms <= nTarget) { |
592 |
> |
molToProcMap[i] = which_proc; |
593 |
> |
atomsPerProc[which_proc] += add_atoms; |
594 |
> |
|
595 |
> |
done = 1; |
596 |
> |
continue; |
597 |
> |
} |
598 |
> |
|
599 |
> |
// The only situation left is when new_atoms > nTarget. We |
600 |
> |
// want to accept this with some probability that dies off the |
601 |
> |
// farther we are from nTarget |
602 |
> |
|
603 |
> |
// roughly: x = new_atoms - nTarget |
604 |
> |
// Pacc(x) = exp(- a * x) |
605 |
> |
// where a = penalty / (average atoms per molecule) |
606 |
> |
|
607 |
> |
x = (RealType)(new_atoms - nTarget); |
608 |
> |
y = myRandom->rand(); |
609 |
> |
|
610 |
> |
if (y < exp(- a * x)) { |
611 |
> |
molToProcMap[i] = which_proc; |
612 |
> |
atomsPerProc[which_proc] += add_atoms; |
613 |
> |
|
614 |
> |
done = 1; |
615 |
> |
continue; |
616 |
> |
} else { |
617 |
> |
continue; |
618 |
> |
} |
619 |
> |
} |
620 |
> |
} |
621 |
> |
|
622 |
> |
delete myRandom; |
623 |
> |
|
624 |
> |
// Spray out this nonsense to all other processors: |
625 |
> |
|
626 |
> |
MPI_Bcast(&molToProcMap[0], nGlobalMols, MPI_INT, 0, MPI_COMM_WORLD); |
627 |
> |
} else { |
628 |
> |
|
629 |
> |
// Listen to your marching orders from processor 0: |
630 |
> |
|
631 |
> |
MPI_Bcast(&molToProcMap[0], nGlobalMols, MPI_INT, 0, MPI_COMM_WORLD); |
632 |
> |
} |
633 |
> |
|
634 |
> |
info->setMolToProcMap(molToProcMap); |
635 |
> |
sprintf(checkPointMsg, |
636 |
> |
"Successfully divided the molecules among the processors.\n"); |
637 |
> |
errorCheckPoint(); |
638 |
> |
} |
639 |
> |
|
640 |
> |
#endif |
641 |
> |
|
642 |
> |
void SimCreator::createMolecules(SimInfo *info) { |
643 |
> |
MoleculeCreator molCreator; |
644 |
> |
int stampId; |
645 |
> |
|
646 |
> |
for(int i = 0; i < info->getNGlobalMolecules(); i++) { |
647 |
> |
|
648 |
> |
#ifdef IS_MPI |
649 |
> |
|
650 |
> |
if (info->getMolToProc(i) == worldRank) { |
651 |
> |
#endif |
652 |
> |
|
653 |
> |
stampId = info->getMoleculeStampId(i); |
654 |
> |
Molecule * mol = molCreator.createMolecule(info->getForceField(), |
655 |
> |
info->getMoleculeStamp(stampId), |
656 |
> |
stampId, i, |
657 |
> |
info->getLocalIndexManager()); |
658 |
> |
|
659 |
> |
info->addMolecule(mol); |
660 |
> |
|
661 |
> |
#ifdef IS_MPI |
662 |
> |
|
663 |
> |
} |
664 |
> |
|
665 |
> |
#endif |
666 |
> |
|
667 |
> |
} //end for(int i=0) |
668 |
> |
} |
669 |
> |
|
670 |
> |
int SimCreator::computeStorageLayout(SimInfo* info) { |
671 |
> |
|
672 |
> |
Globals* simParams = info->getSimParams(); |
673 |
> |
int nRigidBodies = info->getNGlobalRigidBodies(); |
674 |
> |
set<AtomType*> atomTypes = info->getSimulatedAtomTypes(); |
675 |
> |
set<AtomType*>::iterator i; |
676 |
> |
bool hasDirectionalAtoms = false; |
677 |
> |
bool hasFixedCharge = false; |
678 |
> |
bool hasMultipoles = false; |
679 |
> |
bool hasPolarizable = false; |
680 |
> |
bool hasFluctuatingCharge = false; |
681 |
> |
bool hasMetallic = false; |
682 |
> |
int storageLayout = 0; |
683 |
> |
storageLayout |= DataStorage::dslPosition; |
684 |
> |
storageLayout |= DataStorage::dslVelocity; |
685 |
> |
storageLayout |= DataStorage::dslForce; |
686 |
> |
|
687 |
> |
for (i = atomTypes.begin(); i != atomTypes.end(); ++i) { |
688 |
> |
|
689 |
> |
DirectionalAdapter da = DirectionalAdapter( (*i) ); |
690 |
> |
MultipoleAdapter ma = MultipoleAdapter( (*i) ); |
691 |
> |
EAMAdapter ea = EAMAdapter( (*i) ); |
692 |
> |
SuttonChenAdapter sca = SuttonChenAdapter( (*i) ); |
693 |
> |
PolarizableAdapter pa = PolarizableAdapter( (*i) ); |
694 |
> |
FixedChargeAdapter fca = FixedChargeAdapter( (*i) ); |
695 |
> |
FluctuatingChargeAdapter fqa = FluctuatingChargeAdapter( (*i) ); |
696 |
> |
|
697 |
> |
if (da.isDirectional()){ |
698 |
> |
hasDirectionalAtoms = true; |
699 |
> |
} |
700 |
> |
if (ma.isMultipole()){ |
701 |
> |
hasMultipoles = true; |
702 |
> |
} |
703 |
> |
if (ea.isEAM() || sca.isSuttonChen()){ |
704 |
> |
hasMetallic = true; |
705 |
> |
} |
706 |
> |
if ( fca.isFixedCharge() ){ |
707 |
> |
hasFixedCharge = true; |
708 |
> |
} |
709 |
> |
if ( fqa.isFluctuatingCharge() ){ |
710 |
> |
hasFluctuatingCharge = true; |
711 |
> |
} |
712 |
> |
if ( pa.isPolarizable() ){ |
713 |
> |
hasPolarizable = true; |
714 |
> |
} |
715 |
> |
} |
716 |
> |
|
717 |
> |
if (nRigidBodies > 0 || hasDirectionalAtoms) { |
718 |
> |
storageLayout |= DataStorage::dslAmat; |
719 |
> |
if(storageLayout & DataStorage::dslVelocity) { |
720 |
> |
storageLayout |= DataStorage::dslAngularMomentum; |
721 |
> |
} |
722 |
> |
if (storageLayout & DataStorage::dslForce) { |
723 |
> |
storageLayout |= DataStorage::dslTorque; |
724 |
> |
} |
725 |
> |
} |
726 |
> |
if (hasMultipoles) { |
727 |
> |
storageLayout |= DataStorage::dslElectroFrame; |
728 |
> |
} |
729 |
> |
if (hasFixedCharge || hasFluctuatingCharge) { |
730 |
> |
storageLayout |= DataStorage::dslSkippedCharge; |
731 |
> |
} |
732 |
> |
if (hasMetallic) { |
733 |
> |
storageLayout |= DataStorage::dslDensity; |
734 |
> |
storageLayout |= DataStorage::dslFunctional; |
735 |
> |
storageLayout |= DataStorage::dslFunctionalDerivative; |
736 |
> |
} |
737 |
> |
if (hasPolarizable) { |
738 |
> |
storageLayout |= DataStorage::dslElectricField; |
739 |
> |
} |
740 |
> |
if (hasFluctuatingCharge){ |
741 |
> |
storageLayout |= DataStorage::dslFlucQPosition; |
742 |
> |
if(storageLayout & DataStorage::dslVelocity) { |
743 |
> |
storageLayout |= DataStorage::dslFlucQVelocity; |
744 |
> |
} |
745 |
> |
if (storageLayout & DataStorage::dslForce) { |
746 |
> |
storageLayout |= DataStorage::dslFlucQForce; |
747 |
> |
} |
748 |
> |
} |
749 |
> |
|
750 |
> |
// if the user has asked for them, make sure we've got the memory for the |
751 |
> |
// objects defined. |
752 |
> |
|
753 |
> |
if (simParams->getOutputParticlePotential()) { |
754 |
> |
storageLayout |= DataStorage::dslParticlePot; |
755 |
> |
} |
756 |
> |
|
757 |
> |
if (simParams->havePrintHeatFlux()) { |
758 |
> |
if (simParams->getPrintHeatFlux()) { |
759 |
> |
storageLayout |= DataStorage::dslParticlePot; |
760 |
> |
} |
761 |
> |
} |
762 |
> |
|
763 |
> |
if (simParams->getOutputElectricField()) { |
764 |
> |
storageLayout |= DataStorage::dslElectricField; |
765 |
> |
} |
766 |
> |
if (simParams->getOutputFluctuatingCharges()) { |
767 |
> |
storageLayout |= DataStorage::dslFlucQPosition; |
768 |
> |
storageLayout |= DataStorage::dslFlucQVelocity; |
769 |
> |
storageLayout |= DataStorage::dslFlucQForce; |
770 |
> |
} |
771 |
> |
|
772 |
> |
return storageLayout; |
773 |
> |
} |
774 |
> |
|
775 |
> |
void SimCreator::setGlobalIndex(SimInfo *info) { |
776 |
> |
SimInfo::MoleculeIterator mi; |
777 |
> |
Molecule::AtomIterator ai; |
778 |
> |
Molecule::RigidBodyIterator ri; |
779 |
> |
Molecule::CutoffGroupIterator ci; |
780 |
> |
Molecule::IntegrableObjectIterator ioi; |
781 |
> |
Molecule * mol; |
782 |
> |
Atom * atom; |
783 |
> |
RigidBody * rb; |
784 |
> |
CutoffGroup * cg; |
785 |
> |
int beginAtomIndex; |
786 |
> |
int beginRigidBodyIndex; |
787 |
> |
int beginCutoffGroupIndex; |
788 |
> |
int nGlobalAtoms = info->getNGlobalAtoms(); |
789 |
> |
|
790 |
> |
beginAtomIndex = 0; |
791 |
> |
//rigidbody's index begins right after atom's |
792 |
> |
beginRigidBodyIndex = info->getNGlobalAtoms(); |
793 |
> |
beginCutoffGroupIndex = 0; |
794 |
> |
|
795 |
> |
for(int i = 0; i < info->getNGlobalMolecules(); i++) { |
796 |
> |
|
797 |
> |
#ifdef IS_MPI |
798 |
> |
if (info->getMolToProc(i) == worldRank) { |
799 |
> |
#endif |
800 |
> |
// stuff to do if I own this molecule |
801 |
> |
mol = info->getMoleculeByGlobalIndex(i); |
802 |
> |
|
803 |
> |
//local index(index in DataStorge) of atom is important |
804 |
> |
for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { |
805 |
> |
atom->setGlobalIndex(beginAtomIndex++); |
806 |
> |
} |
807 |
> |
|
808 |
> |
for(rb = mol->beginRigidBody(ri); rb != NULL; |
809 |
> |
rb = mol->nextRigidBody(ri)) { |
810 |
> |
rb->setGlobalIndex(beginRigidBodyIndex++); |
811 |
> |
} |
812 |
> |
|
813 |
> |
//local index of cutoff group is trivial, it only depends on |
814 |
> |
//the order of travesing |
815 |
> |
for(cg = mol->beginCutoffGroup(ci); cg != NULL; |
816 |
> |
cg = mol->nextCutoffGroup(ci)) { |
817 |
> |
cg->setGlobalIndex(beginCutoffGroupIndex++); |
818 |
> |
} |
819 |
> |
|
820 |
> |
#ifdef IS_MPI |
821 |
> |
} else { |
822 |
> |
|
823 |
> |
// stuff to do if I don't own this molecule |
824 |
> |
|
825 |
> |
int stampId = info->getMoleculeStampId(i); |
826 |
> |
MoleculeStamp* stamp = info->getMoleculeStamp(stampId); |
827 |
> |
|
828 |
> |
beginAtomIndex += stamp->getNAtoms(); |
829 |
> |
beginRigidBodyIndex += stamp->getNRigidBodies(); |
830 |
> |
beginCutoffGroupIndex += stamp->getNCutoffGroups() + stamp->getNFreeAtoms(); |
831 |
> |
} |
832 |
> |
#endif |
833 |
> |
|
834 |
> |
} //end for(int i=0) |
835 |
> |
|
836 |
> |
//fill globalGroupMembership |
837 |
> |
std::vector<int> globalGroupMembership(info->getNGlobalAtoms(), 0); |
838 |
> |
for(mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { |
839 |
> |
for (cg = mol->beginCutoffGroup(ci); cg != NULL; cg = mol->nextCutoffGroup(ci)) { |
840 |
> |
|
841 |
> |
for(atom = cg->beginAtom(ai); atom != NULL; atom = cg->nextAtom(ai)) { |
842 |
> |
globalGroupMembership[atom->getGlobalIndex()] = cg->getGlobalIndex(); |
843 |
> |
} |
844 |
> |
|
845 |
> |
} |
846 |
> |
} |
847 |
> |
|
848 |
> |
#ifdef IS_MPI |
849 |
> |
// Since the globalGroupMembership has been zero filled and we've only |
850 |
> |
// poked values into the atoms we know, we can do an Allreduce |
851 |
> |
// to get the full globalGroupMembership array (We think). |
852 |
> |
// This would be prettier if we could use MPI_IN_PLACE like the MPI-2 |
853 |
> |
// docs said we could. |
854 |
> |
std::vector<int> tmpGroupMembership(info->getNGlobalAtoms(), 0); |
855 |
> |
MPI_Allreduce(&globalGroupMembership[0], &tmpGroupMembership[0], nGlobalAtoms, |
856 |
> |
MPI_INT, MPI_SUM, MPI_COMM_WORLD); |
857 |
> |
info->setGlobalGroupMembership(tmpGroupMembership); |
858 |
> |
#else |
859 |
> |
info->setGlobalGroupMembership(globalGroupMembership); |
860 |
> |
#endif |
861 |
> |
|
862 |
> |
//fill molMembership |
863 |
> |
std::vector<int> globalMolMembership(info->getNGlobalAtoms(), 0); |
864 |
> |
|
865 |
> |
for(mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { |
866 |
> |
for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { |
867 |
> |
globalMolMembership[atom->getGlobalIndex()] = mol->getGlobalIndex(); |
868 |
> |
} |
869 |
> |
} |
870 |
> |
|
871 |
> |
#ifdef IS_MPI |
872 |
> |
std::vector<int> tmpMolMembership(info->getNGlobalAtoms(), 0); |
873 |
> |
|
874 |
> |
MPI_Allreduce(&globalMolMembership[0], &tmpMolMembership[0], nGlobalAtoms, |
875 |
> |
MPI_INT, MPI_SUM, MPI_COMM_WORLD); |
876 |
> |
|
877 |
> |
info->setGlobalMolMembership(tmpMolMembership); |
878 |
> |
#else |
879 |
> |
info->setGlobalMolMembership(globalMolMembership); |
880 |
> |
#endif |
881 |
> |
|
882 |
> |
// nIOPerMol holds the number of integrable objects per molecule |
883 |
> |
// here the molecules are listed by their global indices. |
884 |
> |
|
885 |
> |
std::vector<int> nIOPerMol(info->getNGlobalMolecules(), 0); |
886 |
> |
for (mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { |
887 |
> |
nIOPerMol[mol->getGlobalIndex()] = mol->getNIntegrableObjects(); |
888 |
> |
} |
889 |
> |
|
890 |
> |
#ifdef IS_MPI |
891 |
> |
std::vector<int> numIntegrableObjectsPerMol(info->getNGlobalMolecules(), 0); |
892 |
> |
MPI_Allreduce(&nIOPerMol[0], &numIntegrableObjectsPerMol[0], |
893 |
> |
info->getNGlobalMolecules(), MPI_INT, MPI_SUM, MPI_COMM_WORLD); |
894 |
> |
#else |
895 |
> |
std::vector<int> numIntegrableObjectsPerMol = nIOPerMol; |
896 |
> |
#endif |
897 |
> |
|
898 |
> |
std::vector<int> startingIOIndexForMol(info->getNGlobalMolecules()); |
899 |
> |
|
900 |
> |
int startingIndex = 0; |
901 |
> |
for (int i = 0; i < info->getNGlobalMolecules(); i++) { |
902 |
> |
startingIOIndexForMol[i] = startingIndex; |
903 |
> |
startingIndex += numIntegrableObjectsPerMol[i]; |
904 |
> |
} |
905 |
> |
|
906 |
> |
std::vector<StuntDouble*> IOIndexToIntegrableObject(info->getNGlobalIntegrableObjects(), (StuntDouble*)NULL); |
907 |
> |
for (mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { |
908 |
> |
int myGlobalIndex = mol->getGlobalIndex(); |
909 |
> |
int globalIO = startingIOIndexForMol[myGlobalIndex]; |
910 |
> |
for (StuntDouble* sd = mol->beginIntegrableObject(ioi); sd != NULL; |
911 |
> |
sd = mol->nextIntegrableObject(ioi)) { |
912 |
> |
sd->setGlobalIntegrableObjectIndex(globalIO); |
913 |
> |
IOIndexToIntegrableObject[globalIO] = sd; |
914 |
> |
globalIO++; |
915 |
> |
} |
916 |
> |
} |
917 |
> |
|
918 |
> |
info->setIOIndexToIntegrableObject(IOIndexToIntegrableObject); |
919 |
> |
|
920 |
> |
} |
921 |
> |
|
922 |
> |
void SimCreator::loadCoordinates(SimInfo* info, const std::string& mdFileName) { |
923 |
> |
Globals* simParams; |
924 |
> |
|
925 |
> |
simParams = info->getSimParams(); |
926 |
> |
|
927 |
> |
DumpReader reader(info, mdFileName); |
928 |
> |
int nframes = reader.getNFrames(); |
929 |
> |
|
930 |
> |
if (nframes > 0) { |
931 |
> |
reader.readFrame(nframes - 1); |
932 |
> |
} else { |
933 |
> |
//invalid initial coordinate file |
934 |
> |
sprintf(painCave.errMsg, |
935 |
> |
"Initial configuration file %s should at least contain one frame\n", |
936 |
> |
mdFileName.c_str()); |
937 |
> |
painCave.isFatal = 1; |
938 |
> |
simError(); |
939 |
> |
} |
940 |
> |
//copy the current snapshot to previous snapshot |
941 |
> |
info->getSnapshotManager()->advance(); |
942 |
> |
} |
943 |
> |
|
944 |
> |
} //end namespace OpenMD |
945 |
> |
|
946 |
> |
|