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 * check out http://www.gromacs.org for more information.
7 * Copyright (c) 2012,2013, by the GROMACS development team, led by
8 * David van der Spoel, Berk Hess, Erik Lindahl, and including many
9 * others, as listed in the AUTHORS file in the top-level source
10 * 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.
38 /* This file is completely threadsafe - keep it that way! */
42 #include "visibility.h"
52 #include <sys/types.h>
55 #ifdef HAVE_SYS_TIME_H
68 #include "gmx_fatal.h"
73 int continuing(char *s)
74 /* strip trailing spaces and if s ends with a CONTINUE remove that too.
75 * returns TRUE if s ends with a CONTINUE, FALSE otherwise.
83 if ((sl > 0) && (s[sl-1] == CONTINUE))
96 char *fgets2(char *line, int n, FILE *stream)
97 /* This routine reads a string from stream of max length n
98 * and zero terminated, without newlines
99 * line should be long enough (>= n)
103 if (fgets(line, n, stream) == NULL)
107 if ((c = strchr(line, '\n')) != NULL)
113 /* A line not ending in a newline can only occur at the end of a file,
114 * or because of n being too small.
115 * Since both cases occur very infrequently, we can check for EOF.
117 if (!gmx_eof(stream))
119 gmx_fatal(FARGS, "An input file contains a line longer than %d characters, while the buffer passed to fgets2 has size %d. The line starts with: '%20.20s'", n, n, line);
122 if ((c = strchr(line, '\r')) != NULL)
130 void strip_comment (char *line)
139 /* search for a comment mark and replace it by a zero */
140 if ((c = strchr(line, COMMENTSIGN)) != NULL)
146 void upstring (char *str)
150 for (i = 0; (i < (int)strlen(str)); i++)
152 str[i] = toupper(str[i]);
156 void ltrim (char *str)
167 while (('\0' != str[c]) && isspace(str[c]))
173 for (i = c; ('\0' != str[i]); i++)
181 void rtrim (char *str)
191 while ((nul > 0) && ((str[nul] == ' ') || (str[nul] == '\t')) )
198 void trim (char *str)
206 gmx_ctime_r(const time_t *clock, char *buf, int n)
210 #ifdef GMX_NATIVE_WINDOWS
212 ctime_s( tmpbuf, STRLEN, clock );
213 #elif (defined(__sun))
215 ctime_r(clock, tmpbuf, n);
217 ctime_r(clock, tmpbuf);
219 strncpy(buf, tmpbuf, n-1);
225 void nice_header (FILE *out, const char *fn)
227 const char *unk = "onbekend";
229 const char *user = unk;
233 char timebuf[STRLEN];
238 /* Print a nice header above the file */
240 fprintf (out, "%c\n", COMMENTSIGN);
241 fprintf (out, "%c\tFile '%s' was generated\n", COMMENTSIGN, fn ? fn : unk);
246 gh = gethostname(buf, 255);
247 /* pw returns null on error (e.g. compute nodes lack /etc/passwd) */
248 user = pw ? pw->pw_name : unk;
254 gmx_ctime_r(&clock, timebuf, STRLEN);
255 fprintf (out, "%c\tBy user: %s (%d)\n", COMMENTSIGN,
256 user ? user : unk, (int) uid);
257 fprintf(out, "%c\tOn host: %s\n", COMMENTSIGN, (gh == 0) ? buf : unk);
259 fprintf (out, "%c\tAt date: %s", COMMENTSIGN, timebuf);
260 fprintf (out, "%c\n", COMMENTSIGN);
264 int gmx_strcasecmp_min(const char *str1, const char *str2)
272 ch1 = toupper(*(str1++));
274 while ((ch1 == '-') || (ch1 == '_'));
277 ch2 = toupper(*(str2++));
279 while ((ch2 == '-') || (ch2 == '_'));
290 int gmx_strncasecmp_min(const char *str1, const char *str2, int n)
295 stri1 = (char *)str1;
296 stri2 = (char *)str2;
301 ch1 = toupper(*(str1++));
303 while ((ch1 == '-') || (ch1 == '_'));
306 ch2 = toupper(*(str2++));
308 while ((ch2 == '-') || (ch2 == '_'));
315 while (ch1 && (str1-stri1 < n) && (str2-stri2 < n));
319 int gmx_strcasecmp(const char *str1, const char *str2)
325 ch1 = toupper(*(str1++));
326 ch2 = toupper(*(str2++));
336 int gmx_strncasecmp(const char *str1, const char *str2, int n)
347 ch1 = toupper(*(str1++));
348 ch2 = toupper(*(str2++));
359 char *gmx_strdup(const char *src)
363 snew(dest, strlen(src)+1);
370 gmx_strndup(const char *src, int n)
381 strncpy(dest, src, len);
386 /* Magic hash init number for Dan J. Bernsteins algorithm.
387 * Do NOT use any other value unless you really know what you are doing.
390 gmx_string_hash_init = 5381;
394 gmx_string_hash_func(const char *s, unsigned int hash_init)
398 while ((c = toupper(*s++)) != '\0')
402 hash_init = ((hash_init << 5) + hash_init) ^ c; /* (hash * 33) xor c */
409 * \param[in] pattern Pattern to match against.
410 * \param[in] str String to match.
411 * \returns 0 on match, GMX_NO_WCMATCH if there is no match.
413 * Matches \p str against \p pattern, which may contain * and ? wildcards.
414 * All other characters are matched literally.
415 * Currently, it is not possible to match literal * or ?.
418 gmx_wcmatch(const char *pattern, const char *str)
424 /* Skip multiple wildcards in a sequence */
425 while (*pattern == '*' || *pattern == '?')
428 /* For ?, we need to check that there are characters left
434 return GMX_NO_WCMATCH;
442 /* If the pattern ends after the star, we have a match */
447 /* Match the rest against each possible suffix of str */
450 /* Only do the recursive call if the first character
451 * matches. We don't have to worry about wildcards here,
452 * since we have processed them above. */
453 if (*pattern == *str)
456 /* Match the suffix, and return if a match or an error */
457 rc = gmx_wcmatch(pattern, str);
458 if (rc != GMX_NO_WCMATCH)
465 /* If no suffix of str matches, we don't have a match */
466 return GMX_NO_WCMATCH;
468 else if ((*pattern == '?' && *str != 0) || *pattern == *str)
474 return GMX_NO_WCMATCH;
478 /* When the pattern runs out, we have a match if the string has ended. */
479 return (*str == 0) ? 0 : GMX_NO_WCMATCH;
482 char *wrap_lines(const char *buf, int line_width, int indent, gmx_bool bIndentFirst)
485 int i, i0, i2, j, b2len, lspace = 0, l2space = 0;
486 gmx_bool bFirst, bFitsOnLine;
488 /* characters are copied from buf to b2 with possible spaces changed
489 * into newlines and extra space added for indentation.
490 * i indexes buf (source buffer) and i2 indexes b2 (destination buffer)
491 * i0 points to the beginning of the current line (in buf, source)
492 * lspace and l2space point to the last space on the current line
493 * bFirst is set to prevent indentation of first line
494 * bFitsOnLine says if the first space occurred before line_width, if
495 * that is not the case, we have a word longer than line_width which
496 * will also not fit on the next line, so we might as well keep it on
497 * the current line (where it also won't fit, but looks better)
501 b2len = strlen(buf)+1+indent;
506 for (i2 = 0; (i2 < indent); i2++)
515 /* find the last space before end of line */
516 for (i = i0; ((i-i0 < line_width) || (l2space == -1)) && (buf[i]); i++)
519 /* remember the position of a space */
525 /* if we have a newline before the line is full, reset counters */
526 if (buf[i] == '\n' && buf[i+1])
531 /* add indentation after the newline */
532 for (j = 0; (j < indent); j++)
538 /* If we are at the last newline, copy it */
539 if (buf[i] == '\n' && !buf[i+1])
543 /* if we're not at the end of the string */
546 /* check if one word does not fit on the line */
547 bFitsOnLine = (i-i0 <= line_width);
548 /* reset line counters to just after the space */
551 /* if the words fit on the line, and we're beyond the indentation part */
552 if ( (bFitsOnLine) && (l2space >= indent) )
554 /* start a new line */
556 /* and add indentation */
561 line_width -= indent;
566 for (j = 0; (j < indent); j++)
570 /* no extra spaces after indent; */
571 while (buf[i0] == ' ')
585 char **split(char sep, char *str)
595 for (n = 0; (n < nn); n++)
606 while ((*str != '\0') && (*str == sep))
612 snew(ptr[nptr], 1+strlen(str));
614 while ((*str != '\0') && (*str != sep))
631 str_to_large_int_t(const char *str, char **endptr)
634 gmx_large_int_t val = 0;
645 /* Strip off initial white space */
650 /* Conform to ISO C99 - return original pointer if string does not contain a number */
653 *endptr = (char *)str;
662 while ( ((ch = *p) != '\0') && isdigit(ch) )
664 /* Important to add sign here, so we dont overflow in final multiplication */
669 /* Some sort of overflow has occured, set endptr to original string */
670 *endptr = (char *)str;
682 char *gmx_strsep(char **stringp, const char *delim)
685 int len = strlen(delim);
696 if ( (*stringp)[j] == '\0')
702 for (i = 0; i < len; i++)
704 if ( (*stringp)[j] == delim[i])
706 (*stringp)[j] = '\0';
707 *stringp = *stringp+j+1;