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 |
#include <algorithm> |
42 |
#include <stack> |
43 |
#include "io/SectionParserManager.hpp" |
44 |
#include "utils/Trim.hpp" |
45 |
#include "utils/simError.h" |
46 |
|
47 |
namespace oopse { |
48 |
|
49 |
SectionParserManager::~SectionParserManager() { |
50 |
SectionParserManager::iterator i; |
51 |
for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) { |
52 |
delete (i->sectionParser); |
53 |
} |
54 |
sectionParsers_.clear(); |
55 |
} |
56 |
|
57 |
void SectionParserManager::parse(std::istream& input, ForceField& ff) { |
58 |
|
59 |
//reset active flags |
60 |
SectionParserManager::iterator i; |
61 |
for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) { |
62 |
i->isActive = false; |
63 |
} |
64 |
|
65 |
const int bufferSize = 65535; |
66 |
char buffer[bufferSize]; |
67 |
int lineNo = 0; |
68 |
std::stack<std::string> sectionNameStack; |
69 |
//scan through the input stream and find section names |
70 |
while(input.getline(buffer, bufferSize)) { |
71 |
++lineNo; |
72 |
|
73 |
std::string line = trimLeftCopy(buffer); |
74 |
//a line begins with "//" is a comment line |
75 |
if ( line.empty() || (line.size() >= 2 && line[0] == '/' |
76 |
&& line[1] == '/') ) { |
77 |
continue; |
78 |
} else { |
79 |
StringTokenizer tokenizer(line); |
80 |
if (tokenizer.countTokens() < 2) { |
81 |
continue; |
82 |
} else { |
83 |
std::string keyword = tokenizer.nextToken(); |
84 |
|
85 |
if (keyword == "begin") { |
86 |
std::string section = tokenizer.nextToken(); |
87 |
sectionNameStack.push(section); |
88 |
|
89 |
i = std::find_if(sectionParsers_.begin(), sectionParsers_.end(), |
90 |
SameSectionParserFunctor(section)); |
91 |
if (i == sectionParsers_.end()){ |
92 |
sprintf(painCave.errMsg, |
93 |
"SectionParserManager Error: Can not find corresponding " |
94 |
"section parser for %s\n", |
95 |
section.c_str()); |
96 |
painCave.isFatal = 1; |
97 |
simError(); |
98 |
} else { |
99 |
if (i->isActive) { |
100 |
sprintf(painCave.errMsg, "SectionParserManager Error:find multiple %s " |
101 |
"section\n", |
102 |
section.c_str()); |
103 |
painCave.isFatal = 1; |
104 |
simError(); |
105 |
} else { |
106 |
i->isActive = true; |
107 |
i->lineNo = lineNo; |
108 |
i->offset = input.tellg(); |
109 |
} |
110 |
} |
111 |
} else if (keyword == "end") { |
112 |
std::string section = tokenizer.nextToken(); |
113 |
if (sectionNameStack.top() == section) { |
114 |
sectionNameStack.pop(); |
115 |
} else { |
116 |
sprintf(painCave.errMsg, "SectionParserManager Error: begin %s and end %s does not match at line %d\n", |
117 |
sectionNameStack.top().c_str(), section.c_str(), lineNo); |
118 |
painCave.isFatal = 1; |
119 |
simError(); |
120 |
} |
121 |
|
122 |
} else { |
123 |
continue; |
124 |
} |
125 |
} |
126 |
} |
127 |
|
128 |
} |
129 |
|
130 |
if (!sectionNameStack.empty()) { |
131 |
sprintf(painCave.errMsg, "SectionParserManager Error: stack is not empty\n"); |
132 |
painCave.isFatal = 1; |
133 |
simError(); |
134 |
} |
135 |
|
136 |
//invoke parser |
137 |
for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) { |
138 |
if (i->isActive) { |
139 |
//C++ standard does not guarantee seekg reset EOF, in that case, seekg will fail |
140 |
//It is always a good idea to call clear() before seek |
141 |
input.clear(); |
142 |
input.seekg(i->offset); |
143 |
(i->sectionParser)->parse(input, ff, i->lineNo); |
144 |
} |
145 |
} |
146 |
|
147 |
} |
148 |
|
149 |
void SectionParserManager::push_front(SectionParser* sp) { |
150 |
SectionParserManager::iterator i; |
151 |
i = findSectionParser(sp->getSectionName()); |
152 |
if (i != sectionParsers_.end()) { |
153 |
std::cerr << sp->getSectionName() << " section parser is alway existed" |
154 |
<< std::endl; |
155 |
return; |
156 |
} |
157 |
|
158 |
SectionParserContext context; |
159 |
|
160 |
if (sectionParsers_.empty()) { |
161 |
context.priority = beginPriority_; |
162 |
} else { |
163 |
context.priority = sectionParsers_.front().priority - priorityDifference_; |
164 |
} |
165 |
|
166 |
context.sectionParser = sp; |
167 |
context.lineNo = 0; |
168 |
context.offset = 0; |
169 |
context.isActive = false; |
170 |
|
171 |
sectionParsers_.push_front(context); |
172 |
} |
173 |
|
174 |
void SectionParserManager::push_back(SectionParser* sp) { |
175 |
SectionParserManager::iterator i; |
176 |
i = findSectionParser(sp->getSectionName()); |
177 |
if (i != sectionParsers_.end()) { |
178 |
std::cerr << sp->getSectionName() << " section parser is alway existed" |
179 |
<< std::endl; |
180 |
return; |
181 |
} |
182 |
|
183 |
SectionParserContext context; |
184 |
if (sectionParsers_.empty()) { |
185 |
context.priority = beginPriority_; |
186 |
} else { |
187 |
context.priority = sectionParsers_.back().priority + priorityDifference_; |
188 |
} |
189 |
|
190 |
context.sectionParser = sp; |
191 |
context.lineNo = 0; |
192 |
context.offset = 0; |
193 |
context.isActive = false; |
194 |
|
195 |
sectionParsers_.push_back(context); |
196 |
|
197 |
} |
198 |
|
199 |
void SectionParserManager::insert(SectionParser* sp, int priority) { |
200 |
SectionParserManager::iterator i; |
201 |
i = findSectionParser(sp->getSectionName()); |
202 |
if (i != sectionParsers_.end()) { |
203 |
std::cerr << sp->getSectionName() << " section parser is alway existed" |
204 |
<< std::endl; |
205 |
} |
206 |
|
207 |
SectionParserContext context; |
208 |
context.priority = priority; |
209 |
context.sectionParser = sp; |
210 |
context.lineNo = 0; |
211 |
context.offset = 0; |
212 |
context.isActive = false; |
213 |
|
214 |
if (sectionParsers_.empty()) { |
215 |
sectionParsers_.push_back(context); |
216 |
} else { |
217 |
|
218 |
for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) { |
219 |
if (i->priority == priority) { |
220 |
std::cerr << "Priority " << priority << " already used" << std::endl; |
221 |
return; |
222 |
} else if (i->priority > priority) { |
223 |
sectionParsers_.insert(i, context); |
224 |
break; |
225 |
} |
226 |
|
227 |
} |
228 |
} |
229 |
|
230 |
} |
231 |
|
232 |
|
233 |
SectionParserManager::iterator SectionParserManager::findSectionParser(const std::string& sectionName) { |
234 |
SectionParserManager::iterator i; |
235 |
for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) { |
236 |
if (i->sectionParser->getSectionName() == sectionName) { |
237 |
break; |
238 |
} |
239 |
} |
240 |
|
241 |
return i; |
242 |
} |
243 |
|
244 |
} |