1 |
tim |
277 |
/* |
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 |
|
|
#ifndef SELECTION_SELECTIONEVALUATOR_HPP |
43 |
|
|
#define SELECTION_SELECTIONEVALUATOR_HPP |
44 |
|
|
|
45 |
|
|
#include <map> |
46 |
|
|
#include <string> |
47 |
|
|
#include <vector> |
48 |
chrisfen |
301 |
#include <fstream> |
49 |
tim |
277 |
|
50 |
|
|
#include "brains/SimInfo.hpp" |
51 |
|
|
#include "selection/Token.hpp" |
52 |
|
|
#include "selection/SelectionCompiler.hpp" |
53 |
tim |
283 |
#include "selection/NameFinder.hpp" |
54 |
tim |
295 |
#include "selection/DistanceFinder.hpp" |
55 |
tim |
277 |
#include "utils/BitSet.hpp" |
56 |
tim |
283 |
#include "primitives/StuntDouble.hpp" |
57 |
tim |
295 |
#include "utils/StringUtils.hpp" |
58 |
tim |
277 |
namespace oopse { |
59 |
|
|
|
60 |
tim |
283 |
|
61 |
tim |
288 |
//class Context { |
62 |
|
|
// public: |
63 |
|
|
// |
64 |
|
|
// void clear() { |
65 |
|
|
// linenumbers.clear(); |
66 |
|
|
// lineIndices.clear(); |
67 |
|
|
// aatoken.clear(); |
68 |
|
|
// } |
69 |
|
|
// |
70 |
|
|
// std::string filename; |
71 |
|
|
// std::string script; |
72 |
|
|
// std::vector<int> linenumbers; |
73 |
|
|
// std::vector<int> lineIndices; |
74 |
|
|
// std::vector<std::vector<Token> > aatoken; |
75 |
|
|
// int pc; |
76 |
|
|
//}; |
77 |
tim |
278 |
|
78 |
tim |
283 |
|
79 |
tim |
277 |
/** |
80 |
|
|
* @class SelectionEvaluator SelectionEvaluator.hpp "selection/SelectionEvaluator" |
81 |
|
|
* @brief Evalute the tokens compiled by SelectionCompiler and return a BitSet |
82 |
|
|
*/ |
83 |
|
|
class SelectionEvaluator{ |
84 |
|
|
public: |
85 |
|
|
|
86 |
tim |
288 |
SelectionEvaluator(SimInfo* info); |
87 |
tim |
277 |
|
88 |
tim |
278 |
|
89 |
tim |
288 |
bool loadScriptString(const std::string& script); |
90 |
|
|
bool loadScriptFile(const std::string& filename); |
91 |
|
|
|
92 |
tim |
277 |
BitSet evaluate(); |
93 |
|
|
|
94 |
tim |
288 |
//BitSet evaluate(Snapshot* snapshot); |
95 |
tim |
277 |
|
96 |
|
|
/** |
97 |
tim |
288 |
* Tests if the result from evaluation of script is dynamic. |
98 |
tim |
277 |
*/ |
99 |
tim |
288 |
bool isDynamic() { |
100 |
|
|
return isDynamic_; |
101 |
|
|
} |
102 |
tim |
278 |
|
103 |
|
|
bool hadRuntimeError() const{ |
104 |
|
|
return error; |
105 |
|
|
} |
106 |
|
|
|
107 |
|
|
std::string getErrorMessage() const { |
108 |
|
|
return errorMessage; |
109 |
|
|
} |
110 |
|
|
|
111 |
|
|
|
112 |
|
|
int getLinenumber() { |
113 |
|
|
return linenumbers[pc]; |
114 |
|
|
} |
115 |
|
|
|
116 |
|
|
std::string getLine() { |
117 |
|
|
int ichBegin = lineIndices[pc]; |
118 |
|
|
int ichEnd; |
119 |
tim |
281 |
if ((ichEnd = script.find('\r', ichBegin)) == std::string::npos && |
120 |
|
|
(ichEnd = script.find('\n', ichBegin)) == std::string::npos) { |
121 |
tim |
278 |
ichEnd = script.size(); |
122 |
|
|
} |
123 |
|
|
return script.substr(ichBegin, ichEnd); |
124 |
|
|
} |
125 |
|
|
|
126 |
tim |
277 |
private: |
127 |
|
|
|
128 |
tim |
278 |
void clearState(); |
129 |
|
|
|
130 |
|
|
bool loadScript(const std::string& filename, const std::string& script); |
131 |
tim |
288 |
|
132 |
tim |
278 |
bool loadScriptFileInternal(const std::string& filename); |
133 |
|
|
|
134 |
tim |
288 |
|
135 |
tim |
278 |
void clearDefinitionsAndLoadPredefined(); |
136 |
|
|
|
137 |
tim |
277 |
void define(); |
138 |
tim |
288 |
void select(BitSet& bs); |
139 |
tim |
283 |
void predefine(const std::string& script); |
140 |
tim |
277 |
|
141 |
tim |
288 |
void instructionDispatchLoop(BitSet& bs); |
142 |
tim |
278 |
|
143 |
tim |
283 |
void withinInstruction(const Token& instruction, BitSet& bs); |
144 |
|
|
|
145 |
|
|
BitSet comparatorInstruction(const Token& instruction); |
146 |
|
|
void compareProperty(StuntDouble* sd, BitSet& bs, int property, int comparator, float comparisonValue); |
147 |
|
|
BitSet nameInstruction(const std::string& name); |
148 |
tim |
295 |
BitSet indexInstruction(const boost::any& value); |
149 |
tim |
283 |
BitSet expression(const std::vector<Token>& tokens, int pc); |
150 |
tim |
278 |
|
151 |
tim |
283 |
BitSet lookupValue(const std::string& variable); |
152 |
|
|
|
153 |
tim |
288 |
void evalError(const std::string& message) { |
154 |
|
|
std::cerr << "SelectionEvaulator Error: " << message << std::endl; |
155 |
|
|
} |
156 |
tim |
282 |
|
157 |
|
|
void unrecognizedCommand(const Token& token) { |
158 |
tim |
283 |
evalError("unrecognized command:" + boost::any_cast<std::string>(token.value)); |
159 |
tim |
282 |
} |
160 |
tim |
283 |
|
161 |
|
|
void unrecognizedExpression() { |
162 |
|
|
evalError("unrecognized expression"); |
163 |
|
|
} |
164 |
|
|
|
165 |
|
|
void unrecognizedAtomProperty(int property){ |
166 |
|
|
evalError("unrecognized atom property"); |
167 |
|
|
} |
168 |
|
|
|
169 |
|
|
void unrecognizedIdentifier(const std::string& identifier) { |
170 |
|
|
evalError("unrecognized identifier:" + identifier); |
171 |
|
|
} |
172 |
tim |
288 |
|
173 |
tim |
295 |
void invalidIndexRange(std::pair<int, int> range) { |
174 |
|
|
evalError("invalid index range: [" + toString(range.first) + ", " + toString(range.second) + ")"); |
175 |
|
|
} |
176 |
|
|
|
177 |
|
|
void invalidIndex(int index) { |
178 |
|
|
evalError("invalid index : " + toString(index) ); |
179 |
|
|
} |
180 |
|
|
|
181 |
|
|
|
182 |
tim |
288 |
bool containDynamicToken(const std::vector<Token>& tokens); |
183 |
|
|
|
184 |
tim |
278 |
SelectionCompiler compiler; |
185 |
|
|
|
186 |
tim |
288 |
//const static int scriptLevelMax = 10; |
187 |
|
|
//int scriptLevel; |
188 |
tim |
278 |
|
189 |
tim |
288 |
//Context stack[scriptLevelMax]; |
190 |
tim |
278 |
|
191 |
|
|
std::string filename; |
192 |
|
|
std::string script; |
193 |
|
|
std::vector<int> linenumbers; |
194 |
|
|
std::vector<int> lineIndices; |
195 |
|
|
std::vector<std::vector<Token> > aatoken; |
196 |
|
|
int pc; // program counter |
197 |
|
|
|
198 |
tim |
281 |
bool error; |
199 |
tim |
278 |
std::string errorMessage; |
200 |
|
|
|
201 |
|
|
std::vector<Token> statement; |
202 |
|
|
int statementLength; |
203 |
|
|
|
204 |
tim |
281 |
SimInfo* info; |
205 |
tim |
295 |
NameFinder nameFinder; |
206 |
|
|
DistanceFinder distanceFinder; |
207 |
tim |
283 |
int nStuntDouble; //natoms + nrigidbodies |
208 |
|
|
std::map<std::string, boost::any > variables; |
209 |
tim |
288 |
|
210 |
|
|
bool isDynamic_; |
211 |
|
|
bool isLoaded_; |
212 |
|
|
|
213 |
tim |
277 |
}; |
214 |
|
|
|
215 |
|
|
} |
216 |
|
|
#endif |