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 "gromacs/utility/gmx_header_config.h"
49 #include <sys/types.h>
52 #ifdef HAVE_SYS_TIME_H
68 #include "gmx_fatal.h"
73 int continuing(char *s)
80 if ((sl > 0) && (s[sl-1] == CONTINUE)) {
90 char *fgets2(char *line, int n, FILE *stream)
93 if (fgets(line,n,stream) == NULL) {
96 if ((c=strchr(line,'\n')) != NULL) {
99 /* A line not ending in a newline can only occur at the end of a file,
100 * or because of n being too small.
101 * Since both cases occur very infrequently, we can check for EOF.
103 if (!gmx_eof(stream)) {
104 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);
107 if ((c=strchr(line,'\r')) != NULL) {
114 void strip_comment (char *line)
121 /* search for a comment mark and replace it by a zero */
122 if ((c = strchr(line,COMMENTSIGN)) != NULL)
126 void upstring (char *str)
130 for (i=0; (i < (int)strlen(str)); i++)
131 str[i] = toupper(str[i]);
134 void ltrim (char *str)
143 while (('\0' != str[c]) && isspace(str[c]))
147 for(i=c; ('\0' != str[i]); i++)
153 void rtrim (char *str)
161 while ((nul > 0) && ((str[nul] == ' ') || (str[nul] == '\t')) ) {
167 void trim (char *str)
174 gmx_ctime_r(const time_t *clock,char *buf, int n)
178 #ifdef GMX_NATIVE_WINDOWS
180 ctime_s( tmpbuf, STRLEN, clock );
181 #elif (defined(__sun))
183 ctime_r(clock, tmpbuf, n);
185 ctime_r(clock,tmpbuf);
187 strncpy(buf,tmpbuf,n-1);
193 void nice_header (FILE *out,const char *fn)
195 const char *unk = "onbekend";
197 const char *user=unk;
205 char timebuf[STRLEN];
210 /* Print a nice header above the file */
212 fprintf (out,"%c\n",COMMENTSIGN);
213 fprintf (out,"%c\tFile '%s' was generated\n",COMMENTSIGN,fn ? fn : unk);
218 gh = gethostname(buf,255);
225 gmx_ctime_r(&clock,timebuf,STRLEN);
226 fprintf (out,"%c\tBy user: %s (%d)\n",COMMENTSIGN,
227 user ? user : unk,(int) uid);
228 fprintf(out,"%c\tOn host: %s\n",COMMENTSIGN,(gh == 0) ? buf : unk);
230 fprintf (out,"%c\tAt date: %s",COMMENTSIGN,timebuf);
231 fprintf (out,"%c\n",COMMENTSIGN);
234 int gmx_strcasecmp_min(const char *str1, const char *str2)
241 ch1=toupper(*(str1++));
242 while ((ch1=='-') || (ch1=='_'));
244 ch2=toupper(*(str2++));
245 while ((ch2=='-') || (ch2=='_'));
246 if (ch1!=ch2) return (ch1-ch2);
252 int gmx_strncasecmp_min(const char *str1, const char *str2, int n)
262 ch1=toupper(*(str1++));
263 while ((ch1=='-') || (ch1=='_'));
265 ch2=toupper(*(str2++));
266 while ((ch2=='-') || (ch2=='_'));
267 if (ch1!=ch2) return (ch1-ch2);
269 while (ch1 && (str1-stri1<n) && (str2-stri2<n));
273 int gmx_strcasecmp(const char *str1, const char *str2)
279 ch1=toupper(*(str1++));
280 ch2=toupper(*(str2++));
281 if (ch1!=ch2) return (ch1-ch2);
287 int gmx_strncasecmp(const char *str1, const char *str2, int n)
296 ch1=toupper(*(str1++));
297 ch2=toupper(*(str2++));
298 if (ch1!=ch2) return (ch1-ch2);
305 char *gmx_strdup(const char *src)
309 snew(dest,strlen(src)+1);
316 gmx_strndup(const char *src, int n)
327 strncpy(dest, src, len);
333 gmx_wcmatch(const char *pattern, const char *str)
339 /* Skip multiple wildcards in a sequence */
340 while (*pattern == '*' || *pattern == '?')
343 /* For ?, we need to check that there are characters left
349 return GMX_NO_WCMATCH;
357 /* If the pattern ends after the star, we have a match */
362 /* Match the rest against each possible suffix of str */
365 /* Only do the recursive call if the first character
366 * matches. We don't have to worry about wildcards here,
367 * since we have processed them above. */
368 if (*pattern == *str)
371 /* Match the suffix, and return if a match or an error */
372 rc = gmx_wcmatch(pattern, str);
373 if (rc != GMX_NO_WCMATCH)
380 /* If no suffix of str matches, we don't have a match */
381 return GMX_NO_WCMATCH;
383 else if ((*pattern == '?' && *str != 0) || *pattern == *str)
389 return GMX_NO_WCMATCH;
393 /* When the pattern runs out, we have a match if the string has ended. */
394 return (*str == 0) ? 0 : GMX_NO_WCMATCH;
397 char *wrap_lines(const char *buf,int line_width, int indent,gmx_bool bIndentFirst)
400 int i,i0,i2,j,b2len,lspace=0,l2space=0;
401 gmx_bool bFirst,bFitsOnLine;
403 /* characters are copied from buf to b2 with possible spaces changed
404 * into newlines and extra space added for indentation.
405 * i indexes buf (source buffer) and i2 indexes b2 (destination buffer)
406 * i0 points to the beginning of the current line (in buf, source)
407 * lspace and l2space point to the last space on the current line
408 * bFirst is set to prevent indentation of first line
409 * bFitsOnLine says if the first space occurred before line_width, if
410 * that is not the case, we have a word longer than line_width which
411 * will also not fit on the next line, so we might as well keep it on
412 * the current line (where it also won't fit, but looks better)
416 b2len=strlen(buf)+1+indent;
420 for(i2=0; (i2<indent); i2++)
425 /* find the last space before end of line */
426 for(i=i0; ((i-i0 < line_width) || (l2space==-1)) && (buf[i]); i++) {
428 /* remember the position of a space */
433 /* if we have a newline before the line is full, reset counters */
434 if (buf[i]=='\n' && buf[i+1]) {
438 /* add indentation after the newline */
439 for(j=0; (j<indent); j++)
443 /* If we are at the last newline, copy it */
444 if (buf[i]=='\n' && !buf[i+1]) {
447 /* if we're not at the end of the string */
449 /* check if one word does not fit on the line */
450 bFitsOnLine = (i-i0 <= line_width);
451 /* reset line counters to just after the space */
454 /* if the words fit on the line, and we're beyond the indentation part */
455 if ( (bFitsOnLine) && (l2space >= indent) ) {
456 /* start a new line */
458 /* and add indentation */
466 for(j=0; (j<indent); j++)
468 /* no extra spaces after indent; */
480 char **split(char sep,const char *str)
488 for(n=0; (n<nn); n++)
493 while (*str != '\0') {
494 while ((*str != '\0') && (*str == sep))
497 snew(ptr[nptr],1+strlen(str));
499 while ((*str != '\0') && (*str != sep)) {
515 str_to_large_int_t(const char *str, char **endptr)
518 gmx_large_int_t val = 0;
529 /* Strip off initial white space */
534 /* Conform to ISO C99 - return original pointer if string does not contain a number */
546 while( ((ch=*p) != '\0') && isdigit(ch) )
548 /* Important to add sign here, so we dont overflow in final multiplication */
553 /* Some sort of overflow has occured, set endptr to original string */
566 char *gmx_strsep(char **stringp, const char *delim)
569 int len=strlen(delim);
578 if ( (*stringp)[j] == '\0')
586 if ( (*stringp)[j]==delim[i])
589 *stringp=*stringp+j+1;