ViewVC Help
View File | Revision Log | Show Annotations | View Changeset | Root Listing
root/group/trunk/OOPSE/libmdtools/SimInfo.cpp
(Generate patch)

Comparing trunk/OOPSE/libmdtools/SimInfo.cpp (file contents):
Revision 965 by gezelter, Mon Jan 19 21:17:39 2004 UTC vs.
Revision 1212 by chrisfen, Tue Jun 1 17:15:43 2004 UTC

# Line 12 | Line 12 | using namespace std;
12  
13   #include "fortranWrappers.hpp"
14  
15 + #include "MatVec3.h"
16 +
17   #ifdef IS_MPI
18   #include "mpiSimulation.hpp"
19   #endif
# Line 27 | Line 29 | SimInfo::SimInfo(){
29   SimInfo* currentInfo;
30  
31   SimInfo::SimInfo(){
32 <  excludes = NULL;
32 >
33    n_constraints = 0;
34    nZconstraints = 0;
35    n_oriented = 0;
# Line 40 | Line 42 | SimInfo::SimInfo(){
42    thermalTime = 0.0;
43    currentTime = 0.0;
44    rCut = 0.0;
45 <  ecr = 0.0;
44 <  est = 0.0;
45 >  rSw = 0.0;
46  
47    haveRcut = 0;
48 <  haveEcr = 0;
48 >  haveRsw = 0;
49    boxIsInit = 0;
50    
51    resetTime = 1e99;
52  
53 +  orthoRhombic = 0;
54    orthoTolerance = 1E-6;
55    useInitXSstate = true;
56  
# Line 60 | Line 62 | SimInfo::SimInfo(){
62    useReactionField = 0;
63    useGB = 0;
64    useEAM = 0;
65 +  useSolidThermInt = 0;
66 +  useLiquidThermInt = 0;
67  
68 +  haveCutoffGroups = false;
69 +
70 +  excludes = Exclude::Instance();
71 +
72    myConfiguration = new SimState();
73  
74 +  has_minimizer = false;
75 +  the_minimizer =NULL;
76 +
77 +  ngroup = 0;
78 +
79    wrapMeSimInfo( this );
80   }
81  
# Line 75 | Line 88 | SimInfo::~SimInfo(){
88    
89    for(i = properties.begin(); i != properties.end(); i++)
90      delete (*i).second;
91 <    
91 >  
92   }
93  
94   void SimInfo::setBox(double newBox[3]) {
# Line 180 | Line 193 | void SimInfo::calcHmatInv( void ) {
193      
194      if( orthoRhombic ){
195        sprintf( painCave.errMsg,
196 <               "Hmat is switching from Non-Orthorhombic to Orthorhombic Box.\n"
197 <               "\tIf this is a bad thing, change the orthoBoxTolerance\n"
198 <               "\tvariable ( currently set to %G ).\n",
196 >               "OOPSE is switching from the default Non-Orthorhombic\n"
197 >               "\tto the faster Orthorhombic periodic boundary computations.\n"
198 >               "\tThis is usually a good thing, but if you wan't the\n"
199 >               "\tNon-Orthorhombic computations, make the orthoBoxTolerance\n"
200 >               "\tvariable ( currently set to %G ) smaller.\n",
201                 orthoTolerance);
202        simError();
203      }
204      else {
205        sprintf( painCave.errMsg,
206 <               "Hmat is switching from Orthorhombic to Non-Orthorhombic Box.\n"
207 <               "\tIf this is a bad thing, change the orthoBoxTolerance\n"
208 <               "\tvariable ( currently set to %G ).\n",
206 >               "OOPSE is switching from the faster Orthorhombic to the more\n"
207 >               "\tflexible Non-Orthorhombic periodic boundary computations.\n"
208 >               "\tThis is usually because the box has deformed under\n"
209 >               "\tNPTf integration. If you wan't to live on the edge with\n"
210 >               "\tthe Orthorhombic computations, make the orthoBoxTolerance\n"
211 >               "\tvariable ( currently set to %G ) larger.\n",
212                 orthoTolerance);
213        simError();
196 –    }
197 –  }
198 – }
199 –
200 – double SimInfo::matDet3(double a[3][3]) {
201 –  int i, j, k;
202 –  double determinant;
203 –
204 –  determinant = 0.0;
205 –
206 –  for(i = 0; i < 3; i++) {
207 –    j = (i+1)%3;
208 –    k = (i+2)%3;
209 –
210 –    determinant += a[0][i] * (a[1][j]*a[2][k] - a[1][k]*a[2][j]);
211 –  }
212 –
213 –  return determinant;
214 – }
215 –
216 – void SimInfo::invertMat3(double a[3][3], double b[3][3]) {
217 –  
218 –  int  i, j, k, l, m, n;
219 –  double determinant;
220 –
221 –  determinant = matDet3( a );
222 –
223 –  if (determinant == 0.0) {
224 –    sprintf( painCave.errMsg,
225 –             "Can't invert a matrix with a zero determinant!\n");
226 –    painCave.isFatal = 1;
227 –    simError();
228 –  }
229 –
230 –  for (i=0; i < 3; i++) {
231 –    j = (i+1)%3;
232 –    k = (i+2)%3;
233 –    for(l = 0; l < 3; l++) {
234 –      m = (l+1)%3;
235 –      n = (l+2)%3;
236 –      
237 –      b[l][i] = (a[j][m]*a[k][n] - a[j][n]*a[k][m]) / determinant;
238 –    }
239 –  }
240 – }
241 –
242 – void SimInfo::matMul3(double a[3][3], double b[3][3], double c[3][3]) {
243 –  double r00, r01, r02, r10, r11, r12, r20, r21, r22;
244 –
245 –  r00 = a[0][0]*b[0][0] + a[0][1]*b[1][0] + a[0][2]*b[2][0];
246 –  r01 = a[0][0]*b[0][1] + a[0][1]*b[1][1] + a[0][2]*b[2][1];
247 –  r02 = a[0][0]*b[0][2] + a[0][1]*b[1][2] + a[0][2]*b[2][2];
248 –  
249 –  r10 = a[1][0]*b[0][0] + a[1][1]*b[1][0] + a[1][2]*b[2][0];
250 –  r11 = a[1][0]*b[0][1] + a[1][1]*b[1][1] + a[1][2]*b[2][1];
251 –  r12 = a[1][0]*b[0][2] + a[1][1]*b[1][2] + a[1][2]*b[2][2];
252 –  
253 –  r20 = a[2][0]*b[0][0] + a[2][1]*b[1][0] + a[2][2]*b[2][0];
254 –  r21 = a[2][0]*b[0][1] + a[2][1]*b[1][1] + a[2][2]*b[2][1];
255 –  r22 = a[2][0]*b[0][2] + a[2][1]*b[1][2] + a[2][2]*b[2][2];
256 –  
257 –  c[0][0] = r00; c[0][1] = r01; c[0][2] = r02;
258 –  c[1][0] = r10; c[1][1] = r11; c[1][2] = r12;
259 –  c[2][0] = r20; c[2][1] = r21; c[2][2] = r22;
260 – }
261 –
262 – void SimInfo::matVecMul3(double m[3][3], double inVec[3], double outVec[3]) {
263 –  double a0, a1, a2;
264 –
265 –  a0 = inVec[0];  a1 = inVec[1];  a2 = inVec[2];
266 –
267 –  outVec[0] = m[0][0]*a0 + m[0][1]*a1 + m[0][2]*a2;
268 –  outVec[1] = m[1][0]*a0 + m[1][1]*a1 + m[1][2]*a2;
269 –  outVec[2] = m[2][0]*a0 + m[2][1]*a1 + m[2][2]*a2;
270 – }
271 –
272 – void SimInfo::transposeMat3(double in[3][3], double out[3][3]) {
273 –  double temp[3][3];
274 –  int i, j;
275 –
276 –  for (i = 0; i < 3; i++) {
277 –    for (j = 0; j < 3; j++) {
278 –      temp[j][i] = in[i][j];
214      }
215    }
281 –  for (i = 0; i < 3; i++) {
282 –    for (j = 0; j < 3; j++) {
283 –      out[i][j] = temp[i][j];
284 –    }
285 –  }
216   }
287 –  
288 – void SimInfo::printMat3(double A[3][3] ){
217  
290 –  std::cerr
291 –            << "[ " << A[0][0] << ", " << A[0][1] << ", " << A[0][2] << " ]\n"
292 –            << "[ " << A[1][0] << ", " << A[1][1] << ", " << A[1][2] << " ]\n"
293 –            << "[ " << A[2][0] << ", " << A[2][1] << ", " << A[2][2] << " ]\n";
294 – }
295 –
296 – void SimInfo::printMat9(double A[9] ){
297 –
298 –  std::cerr
299 –            << "[ " << A[0] << ", " << A[1] << ", " << A[2] << " ]\n"
300 –            << "[ " << A[3] << ", " << A[4] << ", " << A[5] << " ]\n"
301 –            << "[ " << A[6] << ", " << A[7] << ", " << A[8] << " ]\n";
302 – }
303 –
304 –
305 – void SimInfo::crossProduct3(double a[3],double b[3], double out[3]){
306 –
307 –      out[0] = a[1] * b[2] - a[2] * b[1];
308 –      out[1] = a[2] * b[0] - a[0] * b[2] ;
309 –      out[2] = a[0] * b[1] - a[1] * b[0];
310 –      
311 – }
312 –
313 – double SimInfo::dotProduct3(double a[3], double b[3]){
314 –  return a[0]*b[0] + a[1]*b[1]+ a[2]*b[2];
315 – }
316 –
317 – double SimInfo::length3(double a[3]){
318 –  return sqrt(a[0]*a[0] + a[1]*a[1] + a[2]*a[2]);
319 – }
320 –
218   void SimInfo::calcBoxL( void ){
219  
220    double dx, dy, dz, dsq;
# Line 373 | Line 270 | double SimInfo::calcMaxCutOff(){
270    rk[0] = Hmat[0][2];
271    rk[1] = Hmat[1][2];
272    rk[2] = Hmat[2][2];
273 <  
274 <  crossProduct3(ri,rj, rij);
275 <  distXY = dotProduct3(rk,rij) / length3(rij);
273 >    
274 >  crossProduct3(ri, rj, rij);
275 >  distXY = dotProduct3(rk,rij) / norm3(rij);
276  
277    crossProduct3(rj,rk, rjk);
278 <  distYZ = dotProduct3(ri,rjk) / length3(rjk);
278 >  distYZ = dotProduct3(ri,rjk) / norm3(rjk);
279  
280    crossProduct3(rk,ri, rki);
281 <  distZX = dotProduct3(rj,rki) / length3(rki);
281 >  distZX = dotProduct3(rj,rki) / norm3(rki);
282  
283    minDist = min(min(distXY, distYZ), distZX);
284    return minDist/2;
# Line 429 | Line 326 | int SimInfo::getNDF(){
326  
327   int SimInfo::getNDF(){
328    int ndf_local;
329 +
330 +  ndf_local = 0;
331    
332 <  ndf_local = 3 * n_atoms + 3 * n_oriented - n_constraints;
332 >  for(int i = 0; i < integrableObjects.size(); i++){
333 >    ndf_local += 3;
334 >    if (integrableObjects[i]->isDirectional()) {
335 >      if (integrableObjects[i]->isLinear())
336 >        ndf_local += 2;
337 >      else
338 >        ndf_local += 3;
339 >    }
340 >  }
341  
342 +  // n_constraints is local, so subtract them on each processor:
343 +
344 +  ndf_local -= n_constraints;
345 +
346   #ifdef IS_MPI
347    MPI_Allreduce(&ndf_local,&ndf,1,MPI_INT,MPI_SUM, MPI_COMM_WORLD);
348   #else
349    ndf = ndf_local;
350   #endif
351  
352 +  // nZconstraints is global, as are the 3 COM translations for the
353 +  // entire system:
354 +
355    ndf = ndf - 3 - nZconstraints;
356  
357    return ndf;
# Line 447 | Line 361 | int SimInfo::getNDFraw() {
361    int ndfRaw_local;
362  
363    // Raw degrees of freedom that we have to set
364 <  ndfRaw_local = 3 * n_atoms + 3 * n_oriented;
365 <  
364 >  ndfRaw_local = 0;
365 >
366 >  for(int i = 0; i < integrableObjects.size(); i++){
367 >    ndfRaw_local += 3;
368 >    if (integrableObjects[i]->isDirectional()) {
369 >       if (integrableObjects[i]->isLinear())
370 >        ndfRaw_local += 2;
371 >      else
372 >        ndfRaw_local += 3;
373 >    }
374 >  }
375 >    
376   #ifdef IS_MPI
377    MPI_Allreduce(&ndfRaw_local,&ndfRaw,1,MPI_INT,MPI_SUM, MPI_COMM_WORLD);
378   #else
# Line 461 | Line 385 | int SimInfo::getNDFtranslational() {
385   int SimInfo::getNDFtranslational() {
386    int ndfTrans_local;
387  
388 <  ndfTrans_local = 3 * n_atoms - n_constraints;
388 >  ndfTrans_local = 3 * integrableObjects.size() - n_constraints;
389  
390 +
391   #ifdef IS_MPI
392    MPI_Allreduce(&ndfTrans_local,&ndfTrans,1,MPI_INT,MPI_SUM, MPI_COMM_WORLD);
393   #else
# Line 474 | Line 399 | int SimInfo::getNDFtranslational() {
399    return ndfTrans;
400   }
401  
402 + int SimInfo::getTotIntegrableObjects() {
403 +  int nObjs_local;
404 +  int nObjs;
405 +
406 +  nObjs_local =  integrableObjects.size();
407 +
408 +
409 + #ifdef IS_MPI
410 +  MPI_Allreduce(&nObjs_local,&nObjs,1,MPI_INT,MPI_SUM, MPI_COMM_WORLD);
411 + #else
412 +  nObjs = nObjs_local;
413 + #endif
414 +
415 +
416 +  return nObjs;
417 + }
418 +
419   void SimInfo::refreshSim(){
420  
421    simtype fInfo;
# Line 495 | Line 437 | void SimInfo::refreshSim(){
437    fInfo.SIM_uses_charges = useCharges;
438    fInfo.SIM_uses_dipoles = useDipoles;
439    //fInfo.SIM_uses_dipoles = 0;
440 <  //fInfo.SIM_uses_RF = useReactionField;
441 <  fInfo.SIM_uses_RF = 0;
440 >  fInfo.SIM_uses_RF = useReactionField;
441 >  //fInfo.SIM_uses_RF = 0;
442    fInfo.SIM_uses_GB = useGB;
443    fInfo.SIM_uses_EAM = useEAM;
444  
445 <  excl = Exclude::getArray();
446 <
445 >  n_exclude = excludes->getSize();
446 >  excl = excludes->getFortranArray();
447 >  
448   #ifdef IS_MPI
449 <  n_global = mpiSim->getTotAtoms();
449 >  n_global = mpiSim->getNAtomsGlobal();
450   #else
451    n_global = n_atoms;
452   #endif
453 <
453 >  
454    isError = 0;
455 <
455 >  
456 >  getFortranGroupArray(this, mfact, ngroup, groupList, groupStart);
457 >  //it may not be a good idea to pass the address of first element in vector
458 >  //since c++ standard does not require vector to be stored continuously in meomory
459 >  //Most of the compilers will organize the memory of vector continuously
460    setFsimulation( &fInfo, &n_global, &n_atoms, identArray, &n_exclude, excl,
461 <                  &nGlobalExcludes, globalExcludes, molMembershipArray,
462 <                  &isError );
463 <
461 >                  &nGlobalExcludes, globalExcludes, molMembershipArray,
462 >                  &mfact[0], &ngroup, &groupList[0], &groupStart[0], &isError);
463 >  
464    if( isError ){
465 <
465 >    
466      sprintf( painCave.errMsg,
467 <             "There was an error setting the simulation information in fortran.\n" );
467 >             "There was an error setting the simulation information in fortran.\n" );
468      painCave.isFatal = 1;
469      simError();
470    }
471 <
471 >  
472   #ifdef IS_MPI
473    sprintf( checkPointMsg,
474             "succesfully sent the simulation information to fortran.\n");
475    MPIcheckPoint();
476   #endif // is_mpi
477 <
477 >  
478    this->ndf = this->getNDF();
479    this->ndfRaw = this->getNDFraw();
480    this->ndfTrans = this->getNDFtranslational();
481   }
482  
483   void SimInfo::setDefaultRcut( double theRcut ){
484 <
484 >  
485    haveRcut = 1;
486    rCut = theRcut;
487 <
541 <  ( rCut > ecr )? rList = rCut + 1.0: rList = ecr + 1.0;
542 <
543 <  notifyFortranCutOffs( &rCut, &rList, &ecr, &est );
544 < }
545 <
546 < void SimInfo::setDefaultEcr( double theEcr ){
547 <
548 <  haveEcr = 1;
549 <  ecr = theEcr;
487 >  rList = rCut + 1.0;
488    
489 <  ( rCut > ecr )? rList = rCut + 1.0: rList = ecr + 1.0;
552 <
553 <  notifyFortranCutOffs( &rCut, &rList, &ecr, &est );
489 >  notifyFortranCutOffs( &rCut, &rSw, &rList );
490   }
491  
492 < void SimInfo::setDefaultEcr( double theEcr, double theEst ){
492 > void SimInfo::setDefaultRcut( double theRcut, double theRsw ){
493  
494 <  est = theEst;
495 <  setDefaultEcr( theEcr );
494 >  rSw = theRsw;
495 >  setDefaultRcut( theRcut );
496   }
497  
498  
# Line 568 | Line 504 | void SimInfo::checkCutOffs( void ){
504      
505      if( rCut > maxCutoff ){
506        sprintf( painCave.errMsg,
507 <               "Box size is too small for the long range cutoff radius, "
508 <               "%G, at time %G\n"
507 >               "cutoffRadius is too large for the current periodic box.\n"
508 >               "\tCurrent Value of cutoffRadius = %G at time %G\n "
509 >               "\tThis is larger than half of at least one of the\n"
510 >               "\tperiodic box vectors.  Right now, the Box matrix is:\n"
511 >               "\n"
512                 "\t[ %G %G %G ]\n"
513                 "\t[ %G %G %G ]\n"
514                 "\t[ %G %G %G ]\n",
# Line 579 | Line 518 | void SimInfo::checkCutOffs( void ){
518                 Hmat[2][0], Hmat[2][1], Hmat[2][2]);
519        painCave.isFatal = 1;
520        simError();
521 <    }
583 <    
584 <    if( haveEcr ){
585 <      if( ecr > maxCutoff ){
586 <        sprintf( painCave.errMsg,
587 <                 "Box size is too small for the electrostatic cutoff radius, "
588 <                 "%G, at time %G\n"
589 <                 "\t[ %G %G %G ]\n"
590 <                 "\t[ %G %G %G ]\n"
591 <                 "\t[ %G %G %G ]\n",
592 <                 ecr, currentTime,
593 <                 Hmat[0][0], Hmat[0][1], Hmat[0][2],
594 <                 Hmat[1][0], Hmat[1][1], Hmat[1][2],
595 <                 Hmat[2][0], Hmat[2][1], Hmat[2][2]);
596 <        painCave.isFatal = 1;
597 <        simError();
598 <      }
599 <    }
521 >    }    
522    } else {
523      // initialize this stuff before using it, OK?
524      sprintf( painCave.errMsg,
# Line 644 | Line 566 | GenericData* SimInfo::getProperty(const string& propNa
566      return NULL;  
567   }
568  
647 – vector<GenericData*> SimInfo::getProperties(){
569  
570 <  vector<GenericData*> result;
571 <  map<string, GenericData*>::iterator i;
570 > void getFortranGroupArray(SimInfo* info, vector<double>& mfact, int& ngroup,
571 >                          vector<int>& groupList, vector<int>& groupStart){
572 >  Molecule* myMols;
573 >  Atom** myAtoms;
574 >  int numAtom;
575 >  int curIndex;
576 >  double mtot;
577 >  int numMol;
578 >  int numCutoffGroups;
579 >  CutoffGroup* myCutoffGroup;
580 >  vector<CutoffGroup*>::iterator iterCutoff;
581 >  Atom* cutoffAtom;
582 >  vector<Atom*>::iterator iterAtom;
583 >  int atomIndex;
584 >  double totalMass;
585    
586 <  for(i = properties.begin(); i != properties.end(); i++)
587 <    result.push_back((*i).second);
588 <    
589 <  return result;
590 < }
586 >  mfact.clear();
587 >  groupList.clear();
588 >  groupStart.clear();
589 >  
590 >  //Be careful, fortran array begin at 1
591 >  curIndex = 1;
592  
593 < double SimInfo::matTrace3(double m[3][3]){
594 <  double trace;
595 <  trace = m[0][0] + m[1][1] + m[2][2];
593 >  myMols = info->molecules;
594 >  numMol = info->n_mol;
595 >  for(int i  = 0; i < numMol; i++){
596 >    numCutoffGroups = myMols[i].getNCutoffGroups();
597 >    for(myCutoffGroup =myMols[i].beginCutoffGroup(iterCutoff); myCutoffGroup != NULL;
598 >                                                  myCutoffGroup =myMols[i].nextCutoffGroup(iterCutoff)){
599  
600 <  return trace;
600 >      totalMass = myCutoffGroup->getMass();
601 >      
602 >      for(cutoffAtom = myCutoffGroup->beginAtom(iterAtom); cutoffAtom != NULL;
603 >                                           cutoffAtom = myCutoffGroup->nextAtom(iterAtom)){
604 >        mfact.push_back(cutoffAtom->getMass()/totalMass);
605 > #ifdef IS_MPI        
606 >        groupList.push_back(cutoffAtom->getGlobalIndex() + 1);
607 > #else
608 >        groupList.push_back(cutoffAtom->getIndex() + 1);
609 > #endif
610 >      }  
611 >                              
612 >      groupStart.push_back(curIndex);
613 >      curIndex += myCutoffGroup->getNumAtom();
614 >
615 >    }//end for(myCutoffGroup =myMols[i].beginCutoffGroup(iterCutoff))
616 >
617 >  }//end for(int i  = 0; i < numMol; i++)
618 >
619 >
620 >  //The last cutoff group need more element to indicate the end of the cutoff
621 >  ngroup = groupStart.size();
622   }

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines