3 * This source code is part of
7 * GROningen MAchine for Chemical Simulations
10 * Written by David van der Spoel, Erik Lindahl, Berk Hess, and others.
11 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
12 * Copyright (c) 2001-2004, The GROMACS development team,
13 * check out http://www.gromacs.org for more information.
15 * This program is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU General Public License
17 * as published by the Free Software Foundation; either version 2
18 * of the License, or (at your option) any later version.
20 * If you want to redistribute modifications, please consider that
21 * scientific software is very special. Version control is crucial -
22 * bugs must be traceable. We will be happy to consider code for
23 * inclusion in the official distribution, but derived work must not
24 * be called official GROMACS. Details are found in the README & COPYING
25 * files - if they are missing, get the official version at www.gromacs.org.
27 * To help us fund GROMACS development, we humbly ask that you cite
28 * the papers on the package - you can find them in the top README file.
30 * For more info, check our website at http://www.gromacs.org
33 * GROningen Mixture of Alchemy and Childrens' Stories
35 /* This file is completely threadsafe - keep it that way! */
39 #include "visibility.h"
40 #include "gmx_header_config.h"
50 #include <sys/types.h>
53 #ifdef HAVE_SYS_TIME_H
66 #include "gmx_fatal.h"
71 int continuing(char *s)
72 /* strip trailing spaces and if s ends with a CONTINUE remove that too.
73 * returns TRUE if s ends with a CONTINUE, FALSE otherwise.
81 if ((sl > 0) && (s[sl-1] == CONTINUE)) {
91 char *fgets2(char *line, int n, FILE *stream)
92 /* This routine reads a string from stream of max length n
93 * and zero terminated, without newlines
94 * line should be long enough (>= n)
98 if (fgets(line,n,stream) == NULL) {
101 if ((c=strchr(line,'\n')) != NULL) {
104 /* A line not ending in a newline can only occur at the end of a file,
105 * or because of n being too small.
106 * Since both cases occur very infrequently, we can check for EOF.
108 if (!gmx_eof(stream)) {
109 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);
112 if ((c=strchr(line,'\r')) != NULL) {
119 void strip_comment (char *line)
126 /* search for a comment mark and replace it by a zero */
127 if ((c = strchr(line,COMMENTSIGN)) != NULL)
131 void upstring (char *str)
135 for (i=0; (i < (int)strlen(str)); i++)
136 str[i] = toupper(str[i]);
139 void ltrim (char *str)
148 while (('\0' != str[c]) && isspace(str[c]))
152 for(i=c; ('\0' != str[i]); i++)
158 void rtrim (char *str)
166 while ((nul > 0) && ((str[nul] == ' ') || (str[nul] == '\t')) ) {
172 void trim (char *str)
180 gmx_ctime_r(const time_t *clock,char *buf, int n)
184 #ifdef GMX_NATIVE_WINDOWS
186 ctime_s( tmpbuf, STRLEN, clock );
187 #elif (defined(__sun))
189 ctime_r(clock, tmpbuf, n);
191 ctime_r(clock,tmpbuf);
193 strncpy(buf,tmpbuf,n-1);
199 void nice_header (FILE *out,const char *fn)
201 const char *unk = "onbekend";
203 const char *user=unk;
207 char timebuf[STRLEN];
212 /* Print a nice header above the file */
214 fprintf (out,"%c\n",COMMENTSIGN);
215 fprintf (out,"%c\tFile '%s' was generated\n",COMMENTSIGN,fn ? fn : unk);
220 gh = gethostname(buf,255);
227 gmx_ctime_r(&clock,timebuf,STRLEN);
228 fprintf (out,"%c\tBy user: %s (%d)\n",COMMENTSIGN,
229 user ? user : unk,(int) uid);
230 fprintf(out,"%c\tOn host: %s\n",COMMENTSIGN,(gh == 0) ? buf : unk);
232 fprintf (out,"%c\tAt date: %s",COMMENTSIGN,timebuf);
233 fprintf (out,"%c\n",COMMENTSIGN);
237 int gmx_strcasecmp_min(const char *str1, const char *str2)
245 ch1=toupper(*(str1++));
247 while ((ch1=='-') || (ch1=='_'));
250 ch2=toupper(*(str2++));
252 while ((ch2=='-') || (ch2=='_'));
254 if (ch1!=ch2) return (ch1-ch2);
260 int gmx_strncasecmp_min(const char *str1, const char *str2, int n)
271 ch1=toupper(*(str1++));
273 while ((ch1=='-') || (ch1=='_'));
276 ch2=toupper(*(str2++));
278 while ((ch2=='-') || (ch2=='_'));
280 if (ch1!=ch2) return (ch1-ch2);
282 while (ch1 && (str1-stri1<n) && (str2-stri2<n));
286 int gmx_strcasecmp(const char *str1, const char *str2)
292 ch1=toupper(*(str1++));
293 ch2=toupper(*(str2++));
294 if (ch1!=ch2) return (ch1-ch2);
300 int gmx_strncasecmp(const char *str1, const char *str2, int n)
309 ch1=toupper(*(str1++));
310 ch2=toupper(*(str2++));
311 if (ch1!=ch2) return (ch1-ch2);
318 char *gmx_strdup(const char *src)
322 snew(dest,strlen(src)+1);
329 gmx_strndup(const char *src, int n)
340 strncpy(dest, src, len);
345 /* Magic hash init number for Dan J. Bernsteins algorithm.
346 * Do NOT use any other value unless you really know what you are doing.
349 gmx_string_hash_init = 5381;
353 gmx_string_hash_func(const char *s, unsigned int hash_init)
357 while ((c = toupper(*s++)) != '\0')
359 if(isalnum(c)) hash_init = ((hash_init << 5) + hash_init) ^ c; /* (hash * 33) xor c */
365 * \param[in] pattern Pattern to match against.
366 * \param[in] str String to match.
367 * \returns 0 on match, GMX_NO_WCMATCH if there is no match.
369 * Matches \p str against \p pattern, which may contain * and ? wildcards.
370 * All other characters are matched literally.
371 * Currently, it is not possible to match literal * or ?.
374 gmx_wcmatch(const char *pattern, const char *str)
380 /* Skip multiple wildcards in a sequence */
381 while (*pattern == '*' || *pattern == '?')
384 /* For ?, we need to check that there are characters left
390 return GMX_NO_WCMATCH;
398 /* If the pattern ends after the star, we have a match */
403 /* Match the rest against each possible suffix of str */
406 /* Only do the recursive call if the first character
407 * matches. We don't have to worry about wildcards here,
408 * since we have processed them above. */
409 if (*pattern == *str)
412 /* Match the suffix, and return if a match or an error */
413 rc = gmx_wcmatch(pattern, str);
414 if (rc != GMX_NO_WCMATCH)
421 /* If no suffix of str matches, we don't have a match */
422 return GMX_NO_WCMATCH;
424 else if ((*pattern == '?' && *str != 0) || *pattern == *str)
430 return GMX_NO_WCMATCH;
434 /* When the pattern runs out, we have a match if the string has ended. */
435 return (*str == 0) ? 0 : GMX_NO_WCMATCH;
438 char *wrap_lines(const char *buf,int line_width, int indent,gmx_bool bIndentFirst)
441 int i,i0,i2,j,b2len,lspace=0,l2space=0;
442 gmx_bool bFirst,bFitsOnLine;
444 /* characters are copied from buf to b2 with possible spaces changed
445 * into newlines and extra space added for indentation.
446 * i indexes buf (source buffer) and i2 indexes b2 (destination buffer)
447 * i0 points to the beginning of the current line (in buf, source)
448 * lspace and l2space point to the last space on the current line
449 * bFirst is set to prevent indentation of first line
450 * bFitsOnLine says if the first space occurred before line_width, if
451 * that is not the case, we have a word longer than line_width which
452 * will also not fit on the next line, so we might as well keep it on
453 * the current line (where it also won't fit, but looks better)
457 b2len=strlen(buf)+1+indent;
461 for(i2=0; (i2<indent); i2++)
466 /* find the last space before end of line */
467 for(i=i0; ((i-i0 < line_width) || (l2space==-1)) && (buf[i]); i++) {
469 /* remember the position of a space */
474 /* if we have a newline before the line is full, reset counters */
475 if (buf[i]=='\n' && buf[i+1]) {
479 /* add indentation after the newline */
480 for(j=0; (j<indent); j++)
484 /* If we are at the last newline, copy it */
485 if (buf[i]=='\n' && !buf[i+1]) {
488 /* if we're not at the end of the string */
490 /* check if one word does not fit on the line */
491 bFitsOnLine = (i-i0 <= line_width);
492 /* reset line counters to just after the space */
495 /* if the words fit on the line, and we're beyond the indentation part */
496 if ( (bFitsOnLine) && (l2space >= indent) ) {
497 /* start a new line */
499 /* and add indentation */
507 for(j=0; (j<indent); j++)
509 /* no extra spaces after indent; */
521 char **split(char sep,char *str)
529 for(n=0; (n<nn); n++)
534 while (*str != '\0') {
535 while ((*str != '\0') && (*str == sep))
538 snew(ptr[nptr],1+strlen(str));
540 while ((*str != '\0') && (*str != sep)) {
556 str_to_large_int_t(const char *str, char **endptr)
559 gmx_large_int_t val = 0;
570 /* Strip off initial white space */
575 /* Conform to ISO C99 - return original pointer if string does not contain a number */
587 while( ((ch=*p) != '\0') && isdigit(ch) )
589 /* Important to add sign here, so we dont overflow in final multiplication */
594 /* Some sort of overflow has occured, set endptr to original string */
607 char *gmx_strsep(char **stringp, const char *delim)
610 int len=strlen(delim);
619 if ( (*stringp)[j] == '\0')
627 if ( (*stringp)[j]==delim[i])
630 *stringp=*stringp+j+1;