1 |
tim |
333 |
/* |
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 |
gezelter |
1390 |
* 1. Redistributions of source code must retain the above copyright |
10 |
tim |
333 |
* notice, this list of conditions and the following disclaimer. |
11 |
|
|
* |
12 |
gezelter |
1390 |
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
tim |
333 |
* notice, this list of conditions and the following disclaimer in the |
14 |
|
|
* documentation and/or other materials provided with the |
15 |
|
|
* distribution. |
16 |
|
|
* |
17 |
|
|
* This software is provided "AS IS," without a warranty of any |
18 |
|
|
* kind. All express or implied conditions, representations and |
19 |
|
|
* warranties, including any implied warranty of merchantability, |
20 |
|
|
* fitness for a particular purpose or non-infringement, are hereby |
21 |
|
|
* excluded. The University of Notre Dame and its licensors shall not |
22 |
|
|
* be liable for any damages suffered by licensee as a result of |
23 |
|
|
* using, modifying or distributing the software or its |
24 |
|
|
* derivatives. In no event will the University of Notre Dame or its |
25 |
|
|
* licensors be liable for any lost revenue, profit or data, or for |
26 |
|
|
* direct, indirect, special, consequential, incidental or punitive |
27 |
|
|
* damages, however caused and regardless of the theory of liability, |
28 |
|
|
* arising out of the use of or inability to use software, even if the |
29 |
|
|
* University of Notre Dame has been advised of the possibility of |
30 |
|
|
* such damages. |
31 |
gezelter |
1390 |
* |
32 |
|
|
* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your |
33 |
|
|
* research, please cite the appropriate papers when you publish your |
34 |
|
|
* work. Good starting points are: |
35 |
|
|
* |
36 |
|
|
* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005). |
37 |
|
|
* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006). |
38 |
|
|
* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008). |
39 |
gezelter |
1782 |
* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010). |
40 |
|
|
* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). |
41 |
tim |
333 |
*/ |
42 |
|
|
|
43 |
|
|
#include "applications/dynamicProps/TimeCorrFunc.hpp" |
44 |
|
|
#include "utils/simError.h" |
45 |
|
|
#include "primitives/Molecule.hpp" |
46 |
gezelter |
1782 |
using namespace std; |
47 |
gezelter |
1390 |
namespace OpenMD { |
48 |
tim |
333 |
|
49 |
gezelter |
1782 |
TimeCorrFunc::TimeCorrFunc(SimInfo* info, const string& filename, |
50 |
|
|
const string& sele1, const string& sele2, |
51 |
gezelter |
1596 |
int storageLayout, long long int memSize) |
52 |
|
|
: info_(info), storageLayout_(storageLayout), memSize_(memSize), |
53 |
|
|
dumpFilename_(filename), selectionScript1_(sele1), |
54 |
|
|
selectionScript2_(sele2), evaluator1_(info), evaluator2_(info), |
55 |
gezelter |
1782 |
seleMan1_(info), seleMan2_(info) { |
56 |
tim |
333 |
|
57 |
gezelter |
1782 |
int nAtoms = info->getNGlobalAtoms(); |
58 |
|
|
int nRigidBodies = info->getNGlobalRigidBodies(); |
59 |
|
|
|
60 |
|
|
set<AtomType*> atomTypes = info->getSimulatedAtomTypes(); |
61 |
|
|
set<AtomType*>::iterator i; |
62 |
|
|
bool hasDirectionalAtom = false; |
63 |
|
|
bool hasMultipole = false; |
64 |
|
|
for (i = atomTypes.begin(); i != atomTypes.end(); ++i) { |
65 |
|
|
if ((*i)->isDirectional()){ |
66 |
|
|
hasDirectionalAtom = true; |
67 |
gezelter |
507 |
} |
68 |
gezelter |
1782 |
if ((*i)->isMultipole()){ |
69 |
|
|
hasMultipole = true; |
70 |
gezelter |
507 |
} |
71 |
gezelter |
1782 |
} |
72 |
tim |
334 |
|
73 |
gezelter |
1782 |
if (nRigidBodies > 0 || hasDirectionalAtom) { |
74 |
|
|
storageLayout_ |= DataStorage::dslAmat; |
75 |
|
|
if(storageLayout_ & DataStorage::dslVelocity) { |
76 |
|
|
storageLayout_ |= DataStorage::dslAngularMomentum; |
77 |
gezelter |
507 |
} |
78 |
gezelter |
1782 |
if (storageLayout_ & DataStorage::dslForce) { |
79 |
|
|
storageLayout_ |= DataStorage::dslTorque; |
80 |
gezelter |
507 |
} |
81 |
gezelter |
1782 |
} |
82 |
|
|
if (hasMultipole) { |
83 |
|
|
storageLayout_ |= DataStorage::dslElectroFrame; |
84 |
|
|
} |
85 |
tim |
333 |
|
86 |
gezelter |
1811 |
bsMan_ = new BlockSnapshotManager(info, dumpFilename_, storageLayout_, |
87 |
|
|
memSize_); |
88 |
gezelter |
1782 |
info_->setSnapshotManager(bsMan_); |
89 |
|
|
|
90 |
|
|
evaluator1_.loadScriptString(selectionScript1_); |
91 |
|
|
evaluator2_.loadScriptString(selectionScript2_); |
92 |
|
|
|
93 |
|
|
//if selection is static, we only need to evaluate it once |
94 |
|
|
if (!evaluator1_.isDynamic()) { |
95 |
|
|
seleMan1_.setSelectionSet(evaluator1_.evaluate()); |
96 |
|
|
validateSelection(seleMan1_); |
97 |
|
|
} |
98 |
|
|
|
99 |
|
|
if (!evaluator2_.isDynamic()) { |
100 |
|
|
seleMan2_.setSelectionSet(evaluator2_.evaluate()); |
101 |
|
|
validateSelection(seleMan2_); |
102 |
|
|
} |
103 |
|
|
|
104 |
|
|
/**@todo Fix Me */ |
105 |
|
|
Globals* simParams = info_->getSimParams(); |
106 |
|
|
if (simParams->haveSampleTime()){ |
107 |
|
|
deltaTime_ = simParams->getSampleTime(); |
108 |
|
|
} else { |
109 |
|
|
sprintf(painCave.errMsg, |
110 |
|
|
"TimeCorrFunc::writeCorrelate Error: can not figure out deltaTime\n"); |
111 |
|
|
painCave.isFatal = 1; |
112 |
|
|
simError(); |
113 |
|
|
} |
114 |
tim |
333 |
|
115 |
gezelter |
1782 |
int nframes = bsMan_->getNFrames(); |
116 |
|
|
nTimeBins_ = nframes; |
117 |
|
|
histogram_.resize(nTimeBins_); |
118 |
|
|
count_.resize(nTimeBins_); |
119 |
|
|
time_.resize(nTimeBins_); |
120 |
tim |
333 |
|
121 |
gezelter |
1782 |
for (int i = 0; i < nTimeBins_; ++i) { |
122 |
|
|
time_[i] = i * deltaTime_; |
123 |
|
|
} |
124 |
gezelter |
507 |
|
125 |
gezelter |
1782 |
} |
126 |
tim |
333 |
|
127 |
|
|
|
128 |
gezelter |
507 |
void TimeCorrFunc::doCorrelate() { |
129 |
tim |
333 |
preCorrelate(); |
130 |
|
|
|
131 |
|
|
int nblocks = bsMan_->getNBlocks(); |
132 |
|
|
|
133 |
|
|
for (int i = 0; i < nblocks; ++i) { |
134 |
gezelter |
507 |
bsMan_->loadBlock(i); |
135 |
tim |
351 |
|
136 |
gezelter |
507 |
for (int j = i; j < nblocks; ++j) { |
137 |
|
|
bsMan_->loadBlock(j); |
138 |
|
|
correlateBlocks(i, j); |
139 |
|
|
bsMan_->unloadBlock(j); |
140 |
|
|
} |
141 |
tim |
351 |
|
142 |
gezelter |
507 |
bsMan_->unloadBlock(i); |
143 |
tim |
333 |
} |
144 |
|
|
|
145 |
|
|
postCorrelate(); |
146 |
|
|
|
147 |
|
|
writeCorrelate(); |
148 |
gezelter |
507 |
} |
149 |
tim |
333 |
|
150 |
gezelter |
507 |
void TimeCorrFunc::correlateBlocks(int block1, int block2) { |
151 |
tim |
333 |
|
152 |
tim |
334 |
int jstart, jend; |
153 |
tim |
333 |
|
154 |
tim |
334 |
assert(bsMan_->isBlockActive(block1) && bsMan_->isBlockActive(block2)); |
155 |
tim |
333 |
|
156 |
tim |
334 |
SnapshotBlock snapshotBlock1 = bsMan_->getSnapshotBlock(block1); |
157 |
|
|
SnapshotBlock snapshotBlock2 = bsMan_->getSnapshotBlock(block2); |
158 |
tim |
333 |
|
159 |
tim |
334 |
jend = snapshotBlock2.second; |
160 |
|
|
|
161 |
|
|
for (int i = snapshotBlock1.first; i < snapshotBlock1.second; ++i) { |
162 |
|
|
|
163 |
gezelter |
507 |
//update the position or velocity of the atoms belong to rigid bodies |
164 |
|
|
updateFrame(i); |
165 |
tim |
334 |
|
166 |
gezelter |
1811 |
if (evaluator1_.isDynamic()) { |
167 |
|
|
seleMan1_.setSelectionSet(evaluator1_.evaluate()); |
168 |
|
|
} |
169 |
|
|
|
170 |
gezelter |
507 |
// if the two blocks are the same, we don't want to correlate |
171 |
|
|
// backwards in time, so start j at the same frame as i |
172 |
|
|
if (block1 == block2) { |
173 |
tim |
334 |
jstart = i; |
174 |
gezelter |
507 |
} else { |
175 |
|
|
jstart = snapshotBlock2.first; |
176 |
|
|
} |
177 |
tim |
334 |
|
178 |
gezelter |
507 |
for(int j = jstart; j < jend; ++j) { |
179 |
|
|
//update the position or velocity of the atoms belong to rigid bodies |
180 |
|
|
updateFrame(j); |
181 |
gezelter |
1811 |
if (evaluator2_.isDynamic()) { |
182 |
|
|
seleMan2_.setSelectionSet(evaluator2_.evaluate()); |
183 |
|
|
} |
184 |
|
|
|
185 |
gezelter |
507 |
correlateFrames(i, j); |
186 |
|
|
} |
187 |
tim |
333 |
} |
188 |
gezelter |
507 |
} |
189 |
tim |
333 |
|
190 |
gezelter |
507 |
void TimeCorrFunc::updateFrame(int frame){ |
191 |
tim |
333 |
Molecule* mol; |
192 |
|
|
RigidBody* rb; |
193 |
|
|
SimInfo::MoleculeIterator mi; |
194 |
|
|
Molecule::RigidBodyIterator rbIter; |
195 |
|
|
|
196 |
|
|
/** @todo need improvement */ |
197 |
|
|
if (storageLayout_ & DataStorage::dslPosition) { |
198 |
xsun |
1183 |
for (mol = info_->beginMolecule(mi); mol != NULL; |
199 |
|
|
mol = info_->nextMolecule(mi)) { |
200 |
tim |
333 |
|
201 |
gezelter |
507 |
//change the positions of atoms which belong to the rigidbodies |
202 |
xsun |
1183 |
for (rb = mol->beginRigidBody(rbIter); rb != NULL; |
203 |
|
|
rb = mol->nextRigidBody(rbIter)) { |
204 |
gezelter |
507 |
rb->updateAtoms(frame); |
205 |
|
|
} |
206 |
|
|
} |
207 |
tim |
333 |
} |
208 |
|
|
|
209 |
|
|
if (storageLayout_ & DataStorage::dslVelocity) { |
210 |
xsun |
1183 |
for (mol = info_->beginMolecule(mi); mol != NULL; |
211 |
|
|
mol = info_->nextMolecule(mi)) { |
212 |
|
|
|
213 |
gezelter |
507 |
//change the positions of atoms which belong to the rigidbodies |
214 |
xsun |
1183 |
for (rb = mol->beginRigidBody(rbIter); rb != NULL; |
215 |
|
|
rb = mol->nextRigidBody(rbIter)) { |
216 |
gezelter |
507 |
rb->updateAtomVel(frame); |
217 |
|
|
} |
218 |
gezelter |
1782 |
} |
219 |
|
|
} |
220 |
gezelter |
507 |
} |
221 |
tim |
333 |
|
222 |
|
|
|
223 |
gezelter |
507 |
void TimeCorrFunc::preCorrelate() { |
224 |
gezelter |
1782 |
fill(histogram_.begin(), histogram_.end(), 0.0); |
225 |
|
|
fill(count_.begin(), count_.end(), 0); |
226 |
gezelter |
507 |
} |
227 |
tim |
333 |
|
228 |
gezelter |
507 |
void TimeCorrFunc::postCorrelate() { |
229 |
tim |
333 |
for (int i =0 ; i < nTimeBins_; ++i) { |
230 |
gezelter |
507 |
if (count_[i] > 0) { |
231 |
|
|
histogram_[i] /= count_[i]; |
232 |
|
|
} |
233 |
tim |
333 |
} |
234 |
gezelter |
507 |
} |
235 |
tim |
333 |
|
236 |
|
|
|
237 |
gezelter |
507 |
void TimeCorrFunc::writeCorrelate() { |
238 |
gezelter |
1782 |
ofstream ofs(outputFilename_.c_str()); |
239 |
tim |
333 |
|
240 |
|
|
if (ofs.is_open()) { |
241 |
|
|
|
242 |
gezelter |
507 |
ofs << "#" << getCorrFuncType() << "\n"; |
243 |
gezelter |
1782 |
ofs << "#selection script1: \"" << selectionScript1_ ; |
244 |
|
|
ofs << "\"\tselection script2: \"" << selectionScript2_ << "\"\n"; |
245 |
gezelter |
507 |
ofs << "#extra information: " << extra_ << "\n"; |
246 |
|
|
ofs << "#time\tcorrVal\n"; |
247 |
tim |
333 |
|
248 |
gezelter |
507 |
for (int i = 0; i < nTimeBins_; ++i) { |
249 |
|
|
ofs << time_[i] << "\t" << histogram_[i] << "\n"; |
250 |
|
|
} |
251 |
tim |
333 |
|
252 |
|
|
} else { |
253 |
gezelter |
507 |
sprintf(painCave.errMsg, |
254 |
gezelter |
1782 |
"TimeCorrFunc::writeCorrelate Error: fail to open %s\n", |
255 |
|
|
outputFilename_.c_str()); |
256 |
gezelter |
507 |
painCave.isFatal = 1; |
257 |
|
|
simError(); |
258 |
tim |
333 |
} |
259 |
|
|
|
260 |
|
|
ofs.close(); |
261 |
gezelter |
507 |
} |
262 |
tim |
333 |
|
263 |
|
|
} |