2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
5 * Copyright (c) 2001-2004, The GROMACS development team.
6 * Copyright (c) 2013,2014,2015,2016,2017 by the GROMACS development team.
7 * Copyright (c) 2018,2019,2020, by the GROMACS development team, led by
8 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
9 * and including many others, as listed in the AUTHORS file in the
10 * top-level source directory and at http://www.gromacs.org.
12 * GROMACS is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU Lesser General Public License
14 * as published by the Free Software Foundation; either version 2.1
15 * of the License, or (at your option) any later version.
17 * GROMACS is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 * Lesser General Public License for more details.
22 * You should have received a copy of the GNU Lesser General Public
23 * License along with GROMACS; if not, see
24 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
25 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
27 * If you want to redistribute modifications to GROMACS, please
28 * consider that scientific software is very special. Version
29 * control is crucial - bugs must be traceable. We will be happy to
30 * consider code for inclusion in the official distribution, but
31 * derived work must not be called official GROMACS. Details are found
32 * in the README & COPYING files - if they are missing, get the
33 * official version at http://www.gromacs.org.
35 * To help us fund GROMACS development, we humbly ask that you cite
36 * the research papers on the package. Check out http://www.gromacs.org.
40 * Implements new and legacy symbol table routines.
42 * \author David van der Spoel <david.vanderspoel@icm.uu.se>
43 * \author Paul Bauer <paul.bauer.q@gmail.com>
44 * \ingroup module_topology
55 #include "gromacs/utility/basedefinitions.h"
56 #include "gromacs/utility/cstringutil.h"
57 #include "gromacs/utility/exceptions.h"
58 #include "gromacs/utility/fatalerror.h"
59 #include "gromacs/utility/iserializer.h"
60 #include "gromacs/utility/smalloc.h"
61 #include "gromacs/utility/stringutil.h"
62 #include "gromacs/utility/txtdump.h"
64 StringTableEntry StringTableBuilder::addString(const std::string& theString)
66 int size = map_.size();
67 std::string stripped = gmx::stripString(theString);
69 const auto foundEntry = map_.insert(StringTablePair(stripped, size));
70 return StringTableEntry(foundEntry.first->first, foundEntry.first->second);
73 int StringTableBuilder::findEntryByName(const std::string& name) const
75 auto foundEntry = map_.find(name);
76 if (foundEntry != map_.end())
78 return foundEntry->second;
82 GMX_THROW(gmx::InternalError(
83 gmx::formatString("Could not find string \"%s\" in SymbolTable", name.c_str())));
87 StringTable StringTableBuilder::build()
89 std::vector<std::string> table(map_.size());
90 for (const auto& entry : map_)
92 table[entry.second] = entry.first;
95 return StringTable(table);
98 void StringTable::printStringTableStorageToFile(FILE* fp, int indent, const char* title) const
100 indent = pr_title_n(fp, indent, title, table_.size());
102 for (const auto& entry : table_)
104 pr_indent(fp, indent);
105 fprintf(fp, "%s[%d]=\"%s\"\n", title, i++, entry.c_str());
109 StringTable::StringTable(gmx::ISerializer* serializer)
111 GMX_RELEASE_ASSERT(serializer->reading(),
112 "Can not use writing serializer to read string table");
114 serializer->doInt(&nr);
116 for (auto& entry : table_)
118 serializer->doString(&entry);
122 void StringTable::serializeStringTable(gmx::ISerializer* serializer)
124 GMX_RELEASE_ASSERT(!serializer->reading(),
125 "Can not use reading serializer to write string table");
126 int nr = table_.size();
127 serializer->doInt(&nr);
128 for (auto& entry : table_)
130 serializer->doString(&entry);
134 StringTableEntry StringTable::at(gmx::index index) const
136 if (index >= gmx::ssize(table_))
138 GMX_THROW(gmx::InternalError("Can't read beyond last entry"));
140 return StringTableEntry(table_[index], index);
143 StringTableEntry StringTable::operator[](gmx::index index) const
145 GMX_ASSERT(index < gmx::ssize(table_), "Can't read beyond last entry");
146 return StringTableEntry(table_[index], index);
149 void StringTableEntry::serialize(gmx::ISerializer* serializer) const
151 GMX_RELEASE_ASSERT(!serializer->reading(),
152 "Can not use reading serializer to write string index");
153 int entry = tableIndex_;
154 serializer->doInt(&entry);
157 StringTableEntry readStringTableEntry(gmx::ISerializer* serializer, const StringTable& table)
159 GMX_RELEASE_ASSERT(serializer->reading(),
160 "Can not use writing serializer to read string index");
162 serializer->doInt(&entry);
163 return table.at(entry);
166 void StringTable::copyToLegacySymtab(struct t_symtab* symtab) const
168 for (const auto& entry : table_)
170 put_symtab(symtab, entry.c_str());
174 // Old code for legacy data structure starts below.
175 //! Maximum size of character string in table.
176 constexpr int c_trimSize = 1024;
177 //! Maximum number of entries in each element of the linked list.
178 constexpr int c_maxBufSize = 5;
181 * Remove leading and trailing whitespace from string and enforce maximum length.
183 * \param[in] s String to trim.
184 * \param[inout] out String to return.
185 * \param[in] maxlen Maximum string length to use.
186 * \returns New pruned string.
188 static char* trim_string(const char* s, char* out, int maxlen)
192 if (strlen(s) > static_cast<size_t>(maxlen - 1))
194 gmx_fatal(FARGS, "String '%s' (%zu) is longer than buffer (%d).\n", s, strlen(s), maxlen - 1);
197 for (; (*s) == ' '; s++) {}
198 for (len = strlen(s); (len > 0); len--)
200 if (s[len - 1] != ' ')
205 if (len >= c_trimSize)
207 len = c_trimSize - 1;
209 for (i = 0; i < len; i++)
217 int lookup_symtab(t_symtab* symtab, char** name)
223 symbuf = symtab->symbuf;
224 while (symbuf != nullptr)
226 const int index = name - symbuf->buf;
227 if ((index >= 0) && (index < symbuf->bufsize))
233 base += symbuf->bufsize;
234 symbuf = symbuf->next;
237 gmx_fatal(FARGS, "symtab lookup \"%s\" not found", *name);
240 char** get_symtab_handle(t_symtab* symtab, int name)
244 symbuf = symtab->symbuf;
245 while (symbuf != nullptr)
247 if (name < symbuf->bufsize)
249 return &(symbuf->buf[name]);
253 name -= symbuf->bufsize;
254 symbuf = symbuf->next;
257 gmx_fatal(FARGS, "symtab get_symtab_handle %d not found", name);
260 //! Returns a new initialized entry into the symtab linked list.
261 static t_symbuf* new_symbuf()
266 symbuf->bufsize = c_maxBufSize;
267 snew(symbuf->buf, symbuf->bufsize);
268 symbuf->next = nullptr;
274 * Low level function to enter new string into legacy symtab.
276 * \param[inout] symtab Symbol table to add entry to.
277 * \param[in] name New string to add to symtab.
278 * \returns Pointer to new entry in the legacy symbol table, or to existing entry if it already existed.
280 static char** enter_buf(t_symtab* symtab, char* name)
286 if (symtab->symbuf == nullptr)
288 symtab->symbuf = new_symbuf();
291 symbuf = symtab->symbuf;
294 for (i = 0; (i < symbuf->bufsize); i++)
296 if (symbuf->buf[i] == nullptr)
299 symbuf->buf[i] = gmx_strdup(name);
300 return &(symbuf->buf[i]);
302 else if (strcmp(symbuf->buf[i], name) == 0)
304 return &(symbuf->buf[i]);
307 if (symbuf->next != nullptr)
309 symbuf = symbuf->next;
318 symbuf->next = new_symbuf();
319 symbuf = symbuf->next;
322 symbuf->buf[0] = gmx_strdup(name);
323 return &(symbuf->buf[0]);
326 char** put_symtab(t_symtab* symtab, const char* name)
330 return enter_buf(symtab, trim_string(name, buf, 1023));
333 void open_symtab(t_symtab* symtab)
336 symtab->symbuf = nullptr;
339 void close_symtab(t_symtab gmx_unused* symtab) {}
341 // TODO this will go away when we use a
342 // std::list<std::vector<std::string>>> for t_symtab.
343 t_symtab* duplicateSymtab(const t_symtab* symtab)
345 t_symtab* copySymtab;
347 open_symtab(copySymtab);
348 t_symbuf* symbuf = symtab->symbuf;
349 if (symbuf != nullptr)
351 snew(copySymtab->symbuf, 1);
353 t_symbuf* copySymbuf = copySymtab->symbuf;
354 while (symbuf != nullptr)
356 snew(copySymbuf->buf, symbuf->bufsize);
357 copySymbuf->bufsize = symbuf->bufsize;
358 for (int i = 0; (i < symbuf->bufsize) && (i < symtab->nr); i++)
362 copySymbuf->buf[i] = gmx_strdup(symbuf->buf[i]);
365 symbuf = symbuf->next;
366 if (symbuf != nullptr)
368 snew(copySymbuf->next, 1);
369 copySymbuf = copySymbuf->next;
372 copySymtab->nr = symtab->nr;
376 void done_symtab(t_symtab* symtab)
379 t_symbuf *symbuf, *freeptr;
381 close_symtab(symtab);
382 symbuf = symtab->symbuf;
383 while (symbuf != nullptr)
385 for (i = 0; (i < symbuf->bufsize) && (i < symtab->nr); i++)
387 sfree(symbuf->buf[i]);
392 symbuf = symbuf->next;
395 symtab->symbuf = nullptr;
398 gmx_incons("Freeing symbol table (symtab) structure");
402 void free_symtab(t_symtab* symtab)
404 t_symbuf *symbuf, *freeptr;
406 close_symtab(symtab);
407 symbuf = symtab->symbuf;
408 while (symbuf != nullptr)
410 symtab->nr -= std::min(symbuf->bufsize, symtab->nr);
412 symbuf = symbuf->next;
415 symtab->symbuf = nullptr;
418 gmx_incons("Freeing symbol table (symtab) structure");
422 void pr_symtab(FILE* fp, int indent, const char* title, t_symtab* symtab)
427 if (available(fp, symtab, indent, title))
429 indent = pr_title_n(fp, indent, title, symtab->nr);
432 symbuf = symtab->symbuf;
433 while (symbuf != nullptr)
435 for (j = 0; (j < symbuf->bufsize) && (j < nr); j++)
437 pr_indent(fp, indent);
438 (void)fprintf(fp, "%s[%d]=\"%s\"\n", title, i++, symbuf->buf[j]);
441 symbuf = symbuf->next;
445 gmx_incons("Printing symbol table (symtab) structure");