src/io/SectionParserManager.cpp

/*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Acknowledgement of the program authors must be made in any
 *    publication of scientific results based in part on use of the
 *    program.  An acceptable form of acknowledgement is citation of
 *    the article in which the program was described (Matthew
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
 *    Parallel Simulation Engine for Molecular Dynamics,"
 *    J. Comput. Chem. 26, pp. 252-271 (2005))
 *
 * 2. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 3. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 */
#include <algorithm> 
#include <stack>
#include "io/SectionParserManager.hpp"
#include "utils/Trim.hpp"
#include "utils/simError.h"

namespace oopse {

  SectionParserManager::~SectionParserManager() {
    SectionParserManager::iterator i;
    for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
      delete (i->sectionParser);
    }
    sectionParsers_.clear();
  }

  void SectionParserManager::parse(std::istream& input, ForceField& ff) {

    //reset active flags
    SectionParserManager::iterator i;
    for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
      i->isActive = false;
    }

    const int bufferSize = 65535;
    char buffer[bufferSize];
    int lineNo = 0;
    std::stack<std::string> sectionNameStack;
    //scan through the input stream and find section names        
    while(input.getline(buffer, bufferSize)) {
      ++lineNo;
        
      std::string line = trimLeftCopy(buffer);
      //a line begins with "//" is a comment line
      if ( line.empty() || (line.size() >= 2 && line[0] == '/' 
                            && line[1] == '/') ) {
        continue;
      } else {        
        StringTokenizer tokenizer(line);
        if (tokenizer.countTokens() < 2) {
          continue;
        } else {
          std::string keyword = tokenizer.nextToken();

          if (keyword == "begin") {
            std::string section = tokenizer.nextToken();
            sectionNameStack.push(section);
 
            i = std::find_if(sectionParsers_.begin(), sectionParsers_.end(),
                       SameSectionParserFunctor(section));
            if (i == sectionParsers_.end()){
              sprintf(painCave.errMsg, 
                "SectionParserManager Error: Can not find corresponding "
                "section parser for %s\n",
                section.c_str());
              painCave.isFatal = 1;
              simError();                        
            } else {
              if (i->isActive) {
          sprintf(painCave.errMsg, "SectionParserManager Error:find multiple %s "
                  "section\n",
                  section.c_str());
          painCave.isFatal = 1;
          simError();                        
              } else {                         
          i->isActive = true;
          i->lineNo = lineNo;
          i->offset = input.tellg();
              }
            }
          } else if (keyword == "end") {
            std::string section = tokenizer.nextToken();
            if (sectionNameStack.top() == section) {
              sectionNameStack.pop();
            } else {
              sprintf(painCave.errMsg, "SectionParserManager Error: begin %s and end %s does not match at line %d\n",
                sectionNameStack.top().c_str(), section.c_str(), lineNo);
              painCave.isFatal = 1;
              simError();
            }
      
          } else {
            continue;
          }
        }
      }
      
    }
    
    if (!sectionNameStack.empty()) {
      sprintf(painCave.errMsg, "SectionParserManager Error: stack is not empty\n");
      painCave.isFatal = 1;
      simError();
    }
    
    //invoke parser
    for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
      if (i->isActive) {
        //C++ standard does not guarantee seekg  reset EOF, in that case, seekg will fail
        //It is always a good idea to call clear() before seek
        input.clear();            
        input.seekg(i->offset);
        (i->sectionParser)->parse(input, ff, i->lineNo);
      }
    }
    
  }
  
  void SectionParserManager::push_front(SectionParser* sp) {
    SectionParserManager::iterator i;
    i = findSectionParser(sp->getSectionName());
    if (i != sectionParsers_.end()) {
      std::cerr << sp->getSectionName() << " section parser is alway existed" 
      << std::endl;
      return;
    }
    
    SectionParserContext context;
    
    if (sectionParsers_.empty()) {
      context.priority = beginPriority_;
    } else {
      context.priority = sectionParsers_.front().priority - priorityDifference_;
    }
    
    context.sectionParser = sp;
    context.lineNo = 0;
    context.offset = 0;
    context.isActive = false;

    sectionParsers_.push_front(context);
  }

  void SectionParserManager::push_back(SectionParser* sp) {
    SectionParserManager::iterator i;
    i = findSectionParser(sp->getSectionName());
    if (i != sectionParsers_.end()) {
      std::cerr << sp->getSectionName() << " section parser is alway existed" 
      << std::endl;
      return;
    }

    SectionParserContext context;    
    if (sectionParsers_.empty()) {
      context.priority = beginPriority_;
    } else {
      context.priority = sectionParsers_.back().priority + priorityDifference_;
    }

    context.sectionParser = sp;
    context.lineNo = 0;
    context.offset = 0;
    context.isActive = false;

    sectionParsers_.push_back(context);

  }

  void SectionParserManager::insert(SectionParser* sp, int priority) {
    SectionParserManager::iterator i;
    i = findSectionParser(sp->getSectionName());
    if (i != sectionParsers_.end()) {
      std::cerr << sp->getSectionName() << " section parser is already existed" 
      << std::endl;
    }

    SectionParserContext context;    
    context.priority = priority;
    context.sectionParser = sp;
    context.lineNo = 0;
    context.offset = 0;
    context.isActive = false;

    if (sectionParsers_.empty()) {
      sectionParsers_.push_back(context);
    } else {

      for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
        if (i->priority == priority) {
          std::cerr << "Priority " << priority << " already used" << std::endl;
          return;
        } else if (i->priority > priority) {
          sectionParsers_.insert(i, context);
          break;
        }
            
      }
    }

  }


  SectionParserManager::iterator SectionParserManager::findSectionParser(const std::string& sectionName) {
    SectionParserManager::iterator i;
    for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
      if (i->sectionParser->getSectionName() == sectionName) {
        break;
      }
    }

    return i;
  }

}
Revision:	2238
Committed:	Sun May 22 21:05:15 2005 UTC (19 years, 1 month ago) by tim
File size:	7992 byte(s)
Log Message:	adding keyword printPressureTensor
#	User	Rev	Content
1	gezelter	2204	/*
2	gezelter	1930	* 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	tim	2097	#include <stack>
43	gezelter	1930	#include "io/SectionParserManager.hpp"
44			#include "utils/Trim.hpp"
45	tim	2097	#include "utils/simError.h"
46	gezelter	1930
47			namespace oopse {
48
49	gezelter	2204	SectionParserManager::~SectionParserManager() {
50	gezelter	1930	SectionParserManager::iterator i;
51			for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
52	gezelter	2204	delete (i->sectionParser);
53	gezelter	1930	}
54			sectionParsers_.clear();
55	gezelter	2204	}
56	gezelter	1930
57	gezelter	2204	void SectionParserManager::parse(std::istream& input, ForceField& ff) {
58	gezelter	1930
59			//reset active flags
60			SectionParserManager::iterator i;
61			for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
62	gezelter	2204	i->isActive = false;
63	gezelter	1930	}
64
65			const int bufferSize = 65535;
66			char buffer[bufferSize];
67			int lineNo = 0;
68	tim	2097	std::stack<std::string> sectionNameStack;
69	gezelter	1930	//scan through the input stream and find section names
70			while(input.getline(buffer, bufferSize)) {
71	gezelter	2204	++lineNo;
72	gezelter	1930
73	gezelter	2204	std::string line = trimLeftCopy(buffer);
74			//a line begins with "//" is a comment line
75	chrisfen	2211	if ( line.empty() \|\| (line.size() >= 2 && line[0] == '/'
76			&& line[1] == '/') ) {
77	gezelter	2204	continue;
78			} else {
79			StringTokenizer tokenizer(line);
80			if (tokenizer.countTokens() < 2) {
81			continue;
82			} else {
83			std::string keyword = tokenizer.nextToken();
84	gezelter	1930
85	gezelter	2204	if (keyword == "begin") {
86			std::string section = tokenizer.nextToken();
87			sectionNameStack.push(section);
88	chrisfen	2211
89			i = std::find_if(sectionParsers_.begin(), sectionParsers_.end(),
90			SameSectionParserFunctor(section));
91	gezelter	2204	if (i == sectionParsers_.end()){
92	chrisfen	2211	sprintf(painCave.errMsg,
93			"SectionParserManager Error: Can not find corresponding "
94			"section parser for %s\n",
95			section.c_str());
96	gezelter	2204	painCave.isFatal = 1;
97			simError();
98			} else {
99			if (i->isActive) {
100	chrisfen	2211	sprintf(painCave.errMsg, "SectionParserManager Error:find multiple %s "
101			"section\n",
102			section.c_str());
103			painCave.isFatal = 1;
104			simError();
105	gezelter	2204	} else {
106	chrisfen	2211	i->isActive = true;
107			i->lineNo = lineNo;
108			i->offset = input.tellg();
109	gezelter	2204	}
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	chrisfen	2211	sectionNameStack.top().c_str(), section.c_str(), lineNo);
118	gezelter	2204	painCave.isFatal = 1;
119			simError();
120			}
121	chrisfen	2211
122	gezelter	2204	} else {
123			continue;
124			}
125			}
126			}
127	chrisfen	2211
128	gezelter	1930	}
129	chrisfen	2211
130	tim	2097	if (!sectionNameStack.empty()) {
131	gezelter	2204	sprintf(painCave.errMsg, "SectionParserManager Error: stack is not empty\n");
132			painCave.isFatal = 1;
133			simError();
134	tim	2097	}
135	chrisfen	2211
136	gezelter	1930	//invoke parser
137			for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
138	gezelter	2204	if (i->isActive) {
139	chrisfen	2211	//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	gezelter	2204	}
145	gezelter	1930	}
146
147	gezelter	2204	}
148	chrisfen	2211
149	gezelter	2204	void SectionParserManager::push_front(SectionParser* sp) {
150	gezelter	1930	SectionParserManager::iterator i;
151			i = findSectionParser(sp->getSectionName());
152			if (i != sectionParsers_.end()) {
153	chrisfen	2211	std::cerr << sp->getSectionName() << " section parser is alway existed"
154			<< std::endl;
155	gezelter	2204	return;
156	gezelter	1930	}
157
158			SectionParserContext context;
159
160			if (sectionParsers_.empty()) {
161	gezelter	2204	context.priority = beginPriority_;
162	gezelter	1930	} else {
163	gezelter	2204	context.priority = sectionParsers_.front().priority - priorityDifference_;
164	gezelter	1930	}
165	chrisfen	2211
166	gezelter	1930	context.sectionParser = sp;
167			context.lineNo = 0;
168			context.offset = 0;
169			context.isActive = false;
170
171			sectionParsers_.push_front(context);
172	gezelter	2204	}
173	gezelter	1930
174	gezelter	2204	void SectionParserManager::push_back(SectionParser* sp) {
175	gezelter	1930	SectionParserManager::iterator i;
176			i = findSectionParser(sp->getSectionName());
177			if (i != sectionParsers_.end()) {
178	chrisfen	2211	std::cerr << sp->getSectionName() << " section parser is alway existed"
179			<< std::endl;
180	gezelter	2204	return;
181	gezelter	1930	}
182
183			SectionParserContext context;
184			if (sectionParsers_.empty()) {
185	gezelter	2204	context.priority = beginPriority_;
186	gezelter	1930	} else {
187	gezelter	2204	context.priority = sectionParsers_.back().priority + priorityDifference_;
188	gezelter	1930	}
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	gezelter	2204	}
198	gezelter	1930
199	gezelter	2204	void SectionParserManager::insert(SectionParser* sp, int priority) {
200	gezelter	1930	SectionParserManager::iterator i;
201			i = findSectionParser(sp->getSectionName());
202			if (i != sectionParsers_.end()) {
203	tim	2238	std::cerr << sp->getSectionName() << " section parser is already existed"
204	chrisfen	2211	<< std::endl;
205	gezelter	1930	}
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	gezelter	2204	sectionParsers_.push_back(context);
216	gezelter	1930	} else {
217
218	gezelter	2204	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	gezelter	1930
227	gezelter	2204	}
228	gezelter	1930	}
229
230	gezelter	2204	}
231	gezelter	1930
232
233	gezelter	2204	SectionParserManager::iterator SectionParserManager::findSectionParser(const std::string& sectionName) {
234	gezelter	1930	SectionParserManager::iterator i;
235			for (i = sectionParsers_.begin(); i != sectionParsers_.end(); ++i) {
236	gezelter	2204	if (i->sectionParser->getSectionName() == sectionName) {
237	chrisfen	2211	break;
238	gezelter	2204	}
239	gezelter	1930	}
240
241			return i;
242	gezelter	2204	}
243	gezelter	1930
244			}