| 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 |  | 
| 104 | if (worldRank == masterNode) { | 
| 105 | MPI::COMM_WORLD.Bcast(&mdFileVersion, 1, MPI::INT, masterNode); | 
| 106 | #endif | 
| 107 | SimplePreprocessor preprocessor; | 
| 108 | preprocessor.preprocess(rawMetaDataStream, filename, startOfMetaDataBlock, | 
| 109 | ppStream); | 
| 110 |  | 
| 111 | #ifdef IS_MPI | 
| 112 | //brocasting the stream size | 
| 113 | streamSize = ppStream.str().size() +1; | 
| 114 | MPI::COMM_WORLD.Bcast(&streamSize, 1, MPI::LONG, masterNode); | 
| 115 | MPI::COMM_WORLD.Bcast(static_cast<void*>(const_cast<char*>(ppStream.str().c_str())), | 
| 116 | streamSize, MPI::CHAR, masterNode); | 
| 117 |  | 
| 118 | } else { | 
| 119 |  | 
| 120 | MPI::COMM_WORLD.Bcast(&mdFileVersion, 1, MPI::INT, masterNode); | 
| 121 |  | 
| 122 | //get stream size | 
| 123 | MPI::COMM_WORLD.Bcast(&streamSize, 1, MPI::LONG, masterNode); | 
| 124 |  | 
| 125 | char* buf = new char[streamSize]; | 
| 126 | assert(buf); | 
| 127 |  | 
| 128 | //receive file content | 
| 129 | MPI::COMM_WORLD.Bcast(buf, streamSize, MPI::CHAR, masterNode); | 
| 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 loops; | 
| 503 | int which_proc; | 
| 504 | int nProcessors; | 
| 505 | std::vector<int> atomsPerProc; | 
| 506 | int nGlobalMols = info->getNGlobalMolecules(); | 
| 507 | std::vector<int> molToProcMap(nGlobalMols, -1); // default to an error condition: | 
| 508 |  | 
| 509 | MPI_Comm_size(MPI_COMM_WORLD, &nProcessors); | 
| 510 |  | 
| 511 | if (nProcessors > nGlobalMols) { | 
| 512 | sprintf(painCave.errMsg, | 
| 513 | "nProcessors (%d) > nMol (%d)\n" | 
| 514 | "\tThe number of processors is larger than\n" | 
| 515 | "\tthe number of molecules.  This will not result in a \n" | 
| 516 | "\tusable division of atoms for force decomposition.\n" | 
| 517 | "\tEither try a smaller number of processors, or run the\n" | 
| 518 | "\tsingle-processor version of OpenMD.\n", nProcessors, nGlobalMols); | 
| 519 |  | 
| 520 | painCave.isFatal = 1; | 
| 521 | simError(); | 
| 522 | } | 
| 523 |  | 
| 524 | int seedValue; | 
| 525 | Globals * simParams = info->getSimParams(); | 
| 526 | SeqRandNumGen* myRandom; //divide labor does not need Parallel random number generator | 
| 527 | if (simParams->haveSeed()) { | 
| 528 | seedValue = simParams->getSeed(); | 
| 529 | myRandom = new SeqRandNumGen(seedValue); | 
| 530 | }else { | 
| 531 | myRandom = new SeqRandNumGen(); | 
| 532 | } | 
| 533 |  | 
| 534 |  | 
| 535 | a = 3.0 * nGlobalMols / info->getNGlobalAtoms(); | 
| 536 |  | 
| 537 | //initialize atomsPerProc | 
| 538 | atomsPerProc.insert(atomsPerProc.end(), nProcessors, 0); | 
| 539 |  | 
| 540 | if (worldRank == 0) { | 
| 541 | numerator = info->getNGlobalAtoms(); | 
| 542 | denominator = nProcessors; | 
| 543 | precast = numerator / denominator; | 
| 544 | nTarget = (int)(precast + 0.5); | 
| 545 |  | 
| 546 | for(i = 0; i < nGlobalMols; i++) { | 
| 547 | done = 0; | 
| 548 | loops = 0; | 
| 549 |  | 
| 550 | while (!done) { | 
| 551 | loops++; | 
| 552 |  | 
| 553 | // Pick a processor at random | 
| 554 |  | 
| 555 | which_proc = (int) (myRandom->rand() * nProcessors); | 
| 556 |  | 
| 557 | //get the molecule stamp first | 
| 558 | int stampId = info->getMoleculeStampId(i); | 
| 559 | MoleculeStamp * moleculeStamp = info->getMoleculeStamp(stampId); | 
| 560 |  | 
| 561 | // How many atoms does this processor have so far? | 
| 562 | old_atoms = atomsPerProc[which_proc]; | 
| 563 | add_atoms = moleculeStamp->getNAtoms(); | 
| 564 | new_atoms = old_atoms + add_atoms; | 
| 565 |  | 
| 566 | // If we've been through this loop too many times, we need | 
| 567 | // to just give up and assign the molecule to this processor | 
| 568 | // and be done with it. | 
| 569 |  | 
| 570 | if (loops > 100) { | 
| 571 | sprintf(painCave.errMsg, | 
| 572 | "I've tried 100 times to assign molecule %d to a " | 
| 573 | " processor, but can't find a good spot.\n" | 
| 574 | "I'm assigning it at random to processor %d.\n", | 
| 575 | i, which_proc); | 
| 576 |  | 
| 577 | painCave.isFatal = 0; | 
| 578 | simError(); | 
| 579 |  | 
| 580 | molToProcMap[i] = which_proc; | 
| 581 | atomsPerProc[which_proc] += add_atoms; | 
| 582 |  | 
| 583 | done = 1; | 
| 584 | continue; | 
| 585 | } | 
| 586 |  | 
| 587 | // If we can add this molecule to this processor without sending | 
| 588 | // it above nTarget, then go ahead and do it: | 
| 589 |  | 
| 590 | if (new_atoms <= nTarget) { | 
| 591 | molToProcMap[i] = which_proc; | 
| 592 | atomsPerProc[which_proc] += add_atoms; | 
| 593 |  | 
| 594 | done = 1; | 
| 595 | continue; | 
| 596 | } | 
| 597 |  | 
| 598 | // The only situation left is when new_atoms > nTarget.  We | 
| 599 | // want to accept this with some probability that dies off the | 
| 600 | // farther we are from nTarget | 
| 601 |  | 
| 602 | // roughly:  x = new_atoms - nTarget | 
| 603 | //           Pacc(x) = exp(- a * x) | 
| 604 | // where a = penalty / (average atoms per molecule) | 
| 605 |  | 
| 606 | x = (RealType)(new_atoms - nTarget); | 
| 607 | y = myRandom->rand(); | 
| 608 |  | 
| 609 | if (y < exp(- a * x)) { | 
| 610 | molToProcMap[i] = which_proc; | 
| 611 | atomsPerProc[which_proc] += add_atoms; | 
| 612 |  | 
| 613 | done = 1; | 
| 614 | continue; | 
| 615 | } else { | 
| 616 | continue; | 
| 617 | } | 
| 618 | } | 
| 619 | } | 
| 620 |  | 
| 621 | delete myRandom; | 
| 622 |  | 
| 623 | // Spray out this nonsense to all other processors: | 
| 624 |  | 
| 625 | MPI_Bcast(&molToProcMap[0], nGlobalMols, MPI_INT, 0, MPI_COMM_WORLD); | 
| 626 | } else { | 
| 627 |  | 
| 628 | // Listen to your marching orders from processor 0: | 
| 629 |  | 
| 630 | MPI_Bcast(&molToProcMap[0], nGlobalMols, MPI_INT, 0, MPI_COMM_WORLD); | 
| 631 | } | 
| 632 |  | 
| 633 | info->setMolToProcMap(molToProcMap); | 
| 634 | sprintf(checkPointMsg, | 
| 635 | "Successfully divided the molecules among the processors.\n"); | 
| 636 | errorCheckPoint(); | 
| 637 | } | 
| 638 |  | 
| 639 | #endif | 
| 640 |  | 
| 641 | void SimCreator::createMolecules(SimInfo *info) { | 
| 642 | MoleculeCreator molCreator; | 
| 643 | int stampId; | 
| 644 |  | 
| 645 | for(int i = 0; i < info->getNGlobalMolecules(); i++) { | 
| 646 |  | 
| 647 | #ifdef IS_MPI | 
| 648 |  | 
| 649 | if (info->getMolToProc(i) == worldRank) { | 
| 650 | #endif | 
| 651 |  | 
| 652 | stampId = info->getMoleculeStampId(i); | 
| 653 | Molecule * mol = molCreator.createMolecule(info->getForceField(), | 
| 654 | info->getMoleculeStamp(stampId), | 
| 655 | stampId, i, | 
| 656 | info->getLocalIndexManager()); | 
| 657 |  | 
| 658 | info->addMolecule(mol); | 
| 659 |  | 
| 660 | #ifdef IS_MPI | 
| 661 |  | 
| 662 | } | 
| 663 |  | 
| 664 | #endif | 
| 665 |  | 
| 666 | } //end for(int i=0) | 
| 667 | } | 
| 668 |  | 
| 669 | int SimCreator::computeStorageLayout(SimInfo* info) { | 
| 670 |  | 
| 671 | Globals* simParams = info->getSimParams(); | 
| 672 | int nRigidBodies = info->getNGlobalRigidBodies(); | 
| 673 | set<AtomType*> atomTypes = info->getSimulatedAtomTypes(); | 
| 674 | set<AtomType*>::iterator i; | 
| 675 | bool hasDirectionalAtoms = false; | 
| 676 | bool hasFixedCharge = false; | 
| 677 | bool hasMultipoles = false; | 
| 678 | bool hasPolarizable = false; | 
| 679 | bool hasFluctuatingCharge = false; | 
| 680 | bool hasMetallic = false; | 
| 681 | int storageLayout = 0; | 
| 682 | storageLayout |= DataStorage::dslPosition; | 
| 683 | storageLayout |= DataStorage::dslVelocity; | 
| 684 | storageLayout |= DataStorage::dslForce; | 
| 685 |  | 
| 686 | for (i = atomTypes.begin(); i != atomTypes.end(); ++i) { | 
| 687 |  | 
| 688 | DirectionalAdapter da = DirectionalAdapter( (*i) ); | 
| 689 | MultipoleAdapter ma = MultipoleAdapter( (*i) ); | 
| 690 | EAMAdapter ea = EAMAdapter( (*i) ); | 
| 691 | SuttonChenAdapter sca = SuttonChenAdapter( (*i) ); | 
| 692 | PolarizableAdapter pa = PolarizableAdapter( (*i) ); | 
| 693 | FixedChargeAdapter fca = FixedChargeAdapter( (*i) ); | 
| 694 | FluctuatingChargeAdapter fqa = FluctuatingChargeAdapter( (*i) ); | 
| 695 |  | 
| 696 | if (da.isDirectional()){ | 
| 697 | hasDirectionalAtoms = true; | 
| 698 | } | 
| 699 | if (ma.isMultipole()){ | 
| 700 | hasMultipoles = true; | 
| 701 | } | 
| 702 | if (ea.isEAM() || sca.isSuttonChen()){ | 
| 703 | hasMetallic = true; | 
| 704 | } | 
| 705 | if ( fca.isFixedCharge() ){ | 
| 706 | hasFixedCharge = true; | 
| 707 | } | 
| 708 | if ( fqa.isFluctuatingCharge() ){ | 
| 709 | hasFluctuatingCharge = true; | 
| 710 | } | 
| 711 | if ( pa.isPolarizable() ){ | 
| 712 | hasPolarizable = true; | 
| 713 | } | 
| 714 | } | 
| 715 |  | 
| 716 | if (nRigidBodies > 0 || hasDirectionalAtoms) { | 
| 717 | storageLayout |= DataStorage::dslAmat; | 
| 718 | if(storageLayout & DataStorage::dslVelocity) { | 
| 719 | storageLayout |= DataStorage::dslAngularMomentum; | 
| 720 | } | 
| 721 | if (storageLayout & DataStorage::dslForce) { | 
| 722 | storageLayout |= DataStorage::dslTorque; | 
| 723 | } | 
| 724 | } | 
| 725 | if (hasMultipoles) { | 
| 726 | storageLayout |= DataStorage::dslElectroFrame; | 
| 727 | } | 
| 728 | if (hasFixedCharge || hasFluctuatingCharge) { | 
| 729 | storageLayout |= DataStorage::dslSkippedCharge; | 
| 730 | } | 
| 731 | if (hasMetallic) { | 
| 732 | storageLayout |= DataStorage::dslDensity; | 
| 733 | storageLayout |= DataStorage::dslFunctional; | 
| 734 | storageLayout |= DataStorage::dslFunctionalDerivative; | 
| 735 | } | 
| 736 | if (hasPolarizable) { | 
| 737 | storageLayout |= DataStorage::dslElectricField; | 
| 738 | } | 
| 739 | if (hasFluctuatingCharge){ | 
| 740 | storageLayout |= DataStorage::dslFlucQPosition; | 
| 741 | if(storageLayout & DataStorage::dslVelocity) { | 
| 742 | storageLayout |= DataStorage::dslFlucQVelocity; | 
| 743 | } | 
| 744 | if (storageLayout & DataStorage::dslForce) { | 
| 745 | storageLayout |= DataStorage::dslFlucQForce; | 
| 746 | } | 
| 747 | } | 
| 748 |  | 
| 749 | // if the user has asked for them, make sure we've got the memory for the | 
| 750 | // objects defined. | 
| 751 |  | 
| 752 | if (simParams->getOutputParticlePotential()) { | 
| 753 | storageLayout |= DataStorage::dslParticlePot; | 
| 754 | } | 
| 755 |  | 
| 756 | if (simParams->havePrintHeatFlux()) { | 
| 757 | if (simParams->getPrintHeatFlux()) { | 
| 758 | storageLayout |= DataStorage::dslParticlePot; | 
| 759 | } | 
| 760 | } | 
| 761 |  | 
| 762 | if (simParams->getOutputElectricField()) { | 
| 763 | storageLayout |= DataStorage::dslElectricField; | 
| 764 | } | 
| 765 | if (simParams->getOutputFluctuatingCharges()) { | 
| 766 | storageLayout |= DataStorage::dslFlucQPosition; | 
| 767 | storageLayout |= DataStorage::dslFlucQVelocity; | 
| 768 | storageLayout |= DataStorage::dslFlucQForce; | 
| 769 | } | 
| 770 |  | 
| 771 | return storageLayout; | 
| 772 | } | 
| 773 |  | 
| 774 | void SimCreator::setGlobalIndex(SimInfo *info) { | 
| 775 | SimInfo::MoleculeIterator mi; | 
| 776 | Molecule::AtomIterator ai; | 
| 777 | Molecule::RigidBodyIterator ri; | 
| 778 | Molecule::CutoffGroupIterator ci; | 
| 779 | Molecule::IntegrableObjectIterator  ioi; | 
| 780 | Molecule * mol; | 
| 781 | Atom * atom; | 
| 782 | RigidBody * rb; | 
| 783 | CutoffGroup * cg; | 
| 784 | int beginAtomIndex; | 
| 785 | int beginRigidBodyIndex; | 
| 786 | int beginCutoffGroupIndex; | 
| 787 | int nGlobalAtoms = info->getNGlobalAtoms(); | 
| 788 |  | 
| 789 | beginAtomIndex = 0; | 
| 790 | //rigidbody's index begins right after atom's | 
| 791 | beginRigidBodyIndex = info->getNGlobalAtoms(); | 
| 792 | beginCutoffGroupIndex = 0; | 
| 793 |  | 
| 794 | for(int i = 0; i < info->getNGlobalMolecules(); i++) { | 
| 795 |  | 
| 796 | #ifdef IS_MPI | 
| 797 | if (info->getMolToProc(i) == worldRank) { | 
| 798 | #endif | 
| 799 | // stuff to do if I own this molecule | 
| 800 | mol = info->getMoleculeByGlobalIndex(i); | 
| 801 |  | 
| 802 | //local index(index in DataStorge) of atom is important | 
| 803 | for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { | 
| 804 | atom->setGlobalIndex(beginAtomIndex++); | 
| 805 | } | 
| 806 |  | 
| 807 | for(rb = mol->beginRigidBody(ri); rb != NULL; | 
| 808 | rb = mol->nextRigidBody(ri)) { | 
| 809 | rb->setGlobalIndex(beginRigidBodyIndex++); | 
| 810 | } | 
| 811 |  | 
| 812 | //local index of cutoff group is trivial, it only depends on | 
| 813 | //the order of travesing | 
| 814 | for(cg = mol->beginCutoffGroup(ci); cg != NULL; | 
| 815 | cg = mol->nextCutoffGroup(ci)) { | 
| 816 | cg->setGlobalIndex(beginCutoffGroupIndex++); | 
| 817 | } | 
| 818 |  | 
| 819 | #ifdef IS_MPI | 
| 820 | }  else { | 
| 821 |  | 
| 822 | // stuff to do if I don't own this molecule | 
| 823 |  | 
| 824 | int stampId = info->getMoleculeStampId(i); | 
| 825 | MoleculeStamp* stamp = info->getMoleculeStamp(stampId); | 
| 826 |  | 
| 827 | beginAtomIndex += stamp->getNAtoms(); | 
| 828 | beginRigidBodyIndex += stamp->getNRigidBodies(); | 
| 829 | beginCutoffGroupIndex += stamp->getNCutoffGroups() + stamp->getNFreeAtoms(); | 
| 830 | } | 
| 831 | #endif | 
| 832 |  | 
| 833 | } //end for(int i=0) | 
| 834 |  | 
| 835 | //fill globalGroupMembership | 
| 836 | std::vector<int> globalGroupMembership(info->getNGlobalAtoms(), 0); | 
| 837 | for(mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { | 
| 838 | for (cg = mol->beginCutoffGroup(ci); cg != NULL; cg = mol->nextCutoffGroup(ci)) { | 
| 839 |  | 
| 840 | for(atom = cg->beginAtom(ai); atom != NULL; atom = cg->nextAtom(ai)) { | 
| 841 | globalGroupMembership[atom->getGlobalIndex()] = cg->getGlobalIndex(); | 
| 842 | } | 
| 843 |  | 
| 844 | } | 
| 845 | } | 
| 846 |  | 
| 847 | #ifdef IS_MPI | 
| 848 | // Since the globalGroupMembership has been zero filled and we've only | 
| 849 | // poked values into the atoms we know, we can do an Allreduce | 
| 850 | // to get the full globalGroupMembership array (We think). | 
| 851 | // This would be prettier if we could use MPI_IN_PLACE like the MPI-2 | 
| 852 | // docs said we could. | 
| 853 | std::vector<int> tmpGroupMembership(info->getNGlobalAtoms(), 0); | 
| 854 | MPI_Allreduce(&globalGroupMembership[0], &tmpGroupMembership[0], nGlobalAtoms, | 
| 855 | MPI_INT, MPI_SUM, MPI_COMM_WORLD); | 
| 856 | info->setGlobalGroupMembership(tmpGroupMembership); | 
| 857 | #else | 
| 858 | info->setGlobalGroupMembership(globalGroupMembership); | 
| 859 | #endif | 
| 860 |  | 
| 861 | //fill molMembership | 
| 862 | std::vector<int> globalMolMembership(info->getNGlobalAtoms(), 0); | 
| 863 |  | 
| 864 | for(mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { | 
| 865 | for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { | 
| 866 | globalMolMembership[atom->getGlobalIndex()] = mol->getGlobalIndex(); | 
| 867 | } | 
| 868 | } | 
| 869 |  | 
| 870 | #ifdef IS_MPI | 
| 871 | std::vector<int> tmpMolMembership(info->getNGlobalAtoms(), 0); | 
| 872 |  | 
| 873 | MPI_Allreduce(&globalMolMembership[0], &tmpMolMembership[0], nGlobalAtoms, | 
| 874 | MPI_INT, MPI_SUM, MPI_COMM_WORLD); | 
| 875 |  | 
| 876 | info->setGlobalMolMembership(tmpMolMembership); | 
| 877 | #else | 
| 878 | info->setGlobalMolMembership(globalMolMembership); | 
| 879 | #endif | 
| 880 |  | 
| 881 | // nIOPerMol holds the number of integrable objects per molecule | 
| 882 | // here the molecules are listed by their global indices. | 
| 883 |  | 
| 884 | std::vector<int> nIOPerMol(info->getNGlobalMolecules(), 0); | 
| 885 | for (mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { | 
| 886 | nIOPerMol[mol->getGlobalIndex()] = mol->getNIntegrableObjects(); | 
| 887 | } | 
| 888 |  | 
| 889 | #ifdef IS_MPI | 
| 890 | std::vector<int> numIntegrableObjectsPerMol(info->getNGlobalMolecules(), 0); | 
| 891 | MPI_Allreduce(&nIOPerMol[0], &numIntegrableObjectsPerMol[0], | 
| 892 | info->getNGlobalMolecules(), MPI_INT, MPI_SUM, MPI_COMM_WORLD); | 
| 893 | #else | 
| 894 | std::vector<int> numIntegrableObjectsPerMol = nIOPerMol; | 
| 895 | #endif | 
| 896 |  | 
| 897 | std::vector<int> startingIOIndexForMol(info->getNGlobalMolecules()); | 
| 898 |  | 
| 899 | int startingIndex = 0; | 
| 900 | for (int i = 0; i < info->getNGlobalMolecules(); i++) { | 
| 901 | startingIOIndexForMol[i] = startingIndex; | 
| 902 | startingIndex += numIntegrableObjectsPerMol[i]; | 
| 903 | } | 
| 904 |  | 
| 905 | std::vector<StuntDouble*> IOIndexToIntegrableObject(info->getNGlobalIntegrableObjects(), (StuntDouble*)NULL); | 
| 906 | for (mol = info->beginMolecule(mi); mol != NULL; mol = info->nextMolecule(mi)) { | 
| 907 | int myGlobalIndex = mol->getGlobalIndex(); | 
| 908 | int globalIO = startingIOIndexForMol[myGlobalIndex]; | 
| 909 | for (StuntDouble* sd = mol->beginIntegrableObject(ioi); sd != NULL; | 
| 910 | sd = mol->nextIntegrableObject(ioi)) { | 
| 911 | sd->setGlobalIntegrableObjectIndex(globalIO); | 
| 912 | IOIndexToIntegrableObject[globalIO] = sd; | 
| 913 | globalIO++; | 
| 914 | } | 
| 915 | } | 
| 916 |  | 
| 917 | info->setIOIndexToIntegrableObject(IOIndexToIntegrableObject); | 
| 918 |  | 
| 919 | } | 
| 920 |  | 
| 921 | void SimCreator::loadCoordinates(SimInfo* info, const std::string& mdFileName) { | 
| 922 |  | 
| 923 | DumpReader reader(info, mdFileName); | 
| 924 | int nframes = reader.getNFrames(); | 
| 925 |  | 
| 926 | if (nframes > 0) { | 
| 927 | reader.readFrame(nframes - 1); | 
| 928 | } else { | 
| 929 | //invalid initial coordinate file | 
| 930 | sprintf(painCave.errMsg, | 
| 931 | "Initial configuration file %s should at least contain one frame\n", | 
| 932 | mdFileName.c_str()); | 
| 933 | painCave.isFatal = 1; | 
| 934 | simError(); | 
| 935 | } | 
| 936 | //copy the current snapshot to previous snapshot | 
| 937 | info->getSnapshotManager()->advance(); | 
| 938 | } | 
| 939 |  | 
| 940 | } //end namespace OpenMD | 
| 941 |  | 
| 942 |  |