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 |
#ifndef SELECTION_SELECTIONEVALUATOR_HPP |
43 |
#define SELECTION_SELECTIONEVALUATOR_HPP |
44 |
|
45 |
#include <map> |
46 |
#include <string> |
47 |
#include <vector> |
48 |
|
49 |
#include "brains/SimInfo.hpp" |
50 |
#include "selection/Token.hpp" |
51 |
#include "selection/SelectionCompiler.hpp" |
52 |
#include "utils/BitSet.hpp" |
53 |
|
54 |
namespace oopse { |
55 |
|
56 |
class Context { |
57 |
public: |
58 |
|
59 |
void clear() { |
60 |
linenumbers.clear(); |
61 |
lineIndices.clear(); |
62 |
aatoken.clear(); |
63 |
} |
64 |
|
65 |
std::string filename; |
66 |
std::string script; |
67 |
std::vector<int> linenumbers; |
68 |
std::vector<int> lineIndices; |
69 |
std::vector<std::vector<Token> > aatoken; |
70 |
int pc; |
71 |
}; |
72 |
|
73 |
/** |
74 |
* @class SelectionEvaluator SelectionEvaluator.hpp "selection/SelectionEvaluator" |
75 |
* @brief Evalute the tokens compiled by SelectionCompiler and return a BitSet |
76 |
*/ |
77 |
class SelectionEvaluator{ |
78 |
public: |
79 |
|
80 |
SelectionEvaluator(SimInfo* info, const std::string& script); |
81 |
|
82 |
|
83 |
BitSet evaluate(); |
84 |
|
85 |
BitSet evaluate(int frameNo); |
86 |
|
87 |
/** |
88 |
* Tests if the result from evaluation of script is static. |
89 |
* @return true if the result keeps the same even the frame change, otherwise return false |
90 |
*/ |
91 |
bool isStatic(); |
92 |
|
93 |
bool hadRuntimeError() const{ |
94 |
return error; |
95 |
} |
96 |
|
97 |
std::string getErrorMessage() const { |
98 |
return errorMessage; |
99 |
} |
100 |
|
101 |
|
102 |
int getLinenumber() { |
103 |
return linenumbers[pc]; |
104 |
} |
105 |
|
106 |
std::string getLine() { |
107 |
int ichBegin = lineIndices[pc]; |
108 |
int ichEnd; |
109 |
if ((ichEnd = script.find('\r', ichBegin)) == std::string::npos && |
110 |
(ichEnd = script.find('\n', ichBegin)) == std::string::npos) { |
111 |
ichEnd = script.size(); |
112 |
} |
113 |
return script.substr(ichBegin, ichEnd); |
114 |
} |
115 |
|
116 |
private: |
117 |
|
118 |
void clearState(); |
119 |
|
120 |
bool loadScript(const std::string& filename, const std::string& script); |
121 |
bool loadScriptString(const std::string& script); |
122 |
bool loadScriptFileInternal(const std::string& filename); |
123 |
bool loadScriptFile(const std::string& filename); |
124 |
|
125 |
void clearDefinitionsAndLoadPredefined(); |
126 |
|
127 |
void define(); |
128 |
|
129 |
void predefine(); |
130 |
|
131 |
void instructionDispatchLoop(); |
132 |
|
133 |
void withinInstruction(const Token& instruction, BitSet& , BitSet&); |
134 |
|
135 |
BitSet expression(std::vector<Token>& tokens, int pc); |
136 |
|
137 |
SelectionCompiler compiler; |
138 |
|
139 |
const static int scriptLevelMax = 10; |
140 |
int scriptLevel; |
141 |
|
142 |
Context stack[scriptLevelMax]; |
143 |
|
144 |
std::string filename; |
145 |
std::string script; |
146 |
std::vector<int> linenumbers; |
147 |
std::vector<int> lineIndices; |
148 |
std::vector<std::vector<Token> > aatoken; |
149 |
int pc; // program counter |
150 |
|
151 |
bool error; |
152 |
std::string errorMessage; |
153 |
|
154 |
std::vector<Token> statement; |
155 |
int statementLength; |
156 |
|
157 |
SimInfo* info; |
158 |
|
159 |
std::map<std::string, std::vector<Token> > variables; |
160 |
}; |
161 |
|
162 |
} |
163 |
#endif |