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, by the GROMACS development team, led by
7 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
8 * and including many others, as listed in the AUTHORS file in the
9 * top-level source directory and at http://www.gromacs.org.
11 * GROMACS is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Lesser General Public License
13 * as published by the Free Software Foundation; either version 2.1
14 * of the License, or (at your option) any later version.
16 * GROMACS is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * Lesser General Public License for more details.
21 * You should have received a copy of the GNU Lesser General Public
22 * License along with GROMACS; if not, see
23 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
24 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
26 * If you want to redistribute modifications to GROMACS, please
27 * consider that scientific software is very special. Version
28 * control is crucial - bugs must be traceable. We will be happy to
29 * consider code for inclusion in the official distribution, but
30 * derived work must not be called official GROMACS. Details are found
31 * in the README & COPYING files - if they are missing, get the
32 * official version at http://www.gromacs.org.
34 * To help us fund GROMACS development, we humbly ask that you cite
35 * the research papers on the package. Check out http://www.gromacs.org.
37 /* This file is completely threadsafe - keep it that way! */
38 #include "cstringutil.h"
51 #include <sys/types.h>
52 #ifdef HAVE_SYS_TIME_H
62 #include "gromacs/legacyheaders/types/simple.h"
63 #include "gromacs/legacyheaders/gmx_fatal.h"
64 #include "gromacs/legacyheaders/main.h"
66 #include "gromacs/fileio/futil.h"
67 #include "gromacs/utility/smalloc.h"
69 int continuing(char *s
)
76 if ((sl
> 0) && (s
[sl
-1] == CONTINUE
))
89 char *fgets2(char *line
, int n
, FILE *stream
)
92 if (fgets(line
, n
, stream
) == NULL
)
96 if ((c
= strchr(line
, '\n')) != NULL
)
102 /* A line not ending in a newline can only occur at the end of a file,
103 * or because of n being too small.
104 * Since both cases occur very infrequently, we can check for EOF.
108 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
);
111 if ((c
= strchr(line
, '\r')) != NULL
)
119 void strip_comment (char *line
)
128 /* search for a comment mark and replace it by a zero */
129 if ((c
= strchr(line
, COMMENTSIGN
)) != NULL
)
135 void upstring (char *str
)
139 for (i
= 0; (i
< (int)strlen(str
)); i
++)
141 str
[i
] = toupper(str
[i
]);
145 void ltrim (char *str
)
156 while (('\0' != str
[c
]) && isspace(str
[c
]))
162 for (i
= c
; ('\0' != str
[i
]); i
++)
170 void rtrim (char *str
)
180 while ((nul
> 0) && ((str
[nul
] == ' ') || (str
[nul
] == '\t')) )
187 void trim (char *str
)
194 gmx_ctime_r(const time_t *clock
, char *buf
, int n
)
198 #ifdef GMX_NATIVE_WINDOWS
200 ctime_s( tmpbuf
, STRLEN
, clock
);
201 #elif (defined(__sun))
203 ctime_r(clock
, tmpbuf
, n
);
205 ctime_r(clock
, tmpbuf
);
207 strncpy(buf
, tmpbuf
, n
-1);
213 void nice_header (FILE *out
, const char *fn
)
215 const char *unk
= "onbekend";
217 const char *user
= unk
;
225 char timebuf
[STRLEN
];
230 /* Print a nice header above the file */
232 fprintf (out
, "%c\n", COMMENTSIGN
);
233 fprintf (out
, "%c\tFile '%s' was generated\n", COMMENTSIGN
, fn
? fn
: unk
);
238 gh
= gmx_gethostname(buf
, 255);
239 /* pw returns null on error (e.g. compute nodes lack /etc/passwd) */
240 user
= pw
? pw
->pw_name
: unk
;
246 gmx_ctime_r(&clock
, timebuf
, STRLEN
);
247 fprintf (out
, "%c\tBy user: %s (%d)\n", COMMENTSIGN
,
248 user
? user
: unk
, (int) uid
);
249 fprintf(out
, "%c\tOn host: %s\n", COMMENTSIGN
, (gh
== 0) ? buf
: unk
);
251 fprintf (out
, "%c\tAt date: %s", COMMENTSIGN
, timebuf
);
252 fprintf (out
, "%c\n", COMMENTSIGN
);
256 int gmx_strcasecmp_min(const char *str1
, const char *str2
)
264 ch1
= toupper(*(str1
++));
266 while ((ch1
== '-') || (ch1
== '_'));
269 ch2
= toupper(*(str2
++));
271 while ((ch2
== '-') || (ch2
== '_'));
282 int gmx_strncasecmp_min(const char *str1
, const char *str2
, int n
)
287 stri1
= (char *)str1
;
288 stri2
= (char *)str2
;
293 ch1
= toupper(*(str1
++));
295 while ((ch1
== '-') || (ch1
== '_'));
298 ch2
= toupper(*(str2
++));
300 while ((ch2
== '-') || (ch2
== '_'));
307 while (ch1
&& (str1
-stri1
< n
) && (str2
-stri2
< n
));
311 int gmx_strcasecmp(const char *str1
, const char *str2
)
317 ch1
= toupper(*(str1
++));
318 ch2
= toupper(*(str2
++));
328 int gmx_strncasecmp(const char *str1
, const char *str2
, int n
)
339 ch1
= toupper(*(str1
++));
340 ch2
= toupper(*(str2
++));
351 char *gmx_strdup(const char *src
)
355 snew(dest
, strlen(src
)+1);
362 gmx_strndup(const char *src
, int n
)
373 strncpy(dest
, src
, len
);
378 /* Magic hash init number for Dan J. Bernsteins algorithm.
379 * Do NOT use any other value unless you really know what you are doing.
382 gmx_string_hash_init
= 5381;
386 gmx_string_fullhash_func(const char *s
, unsigned int hash_init
)
390 while ((c
= (*s
++)) != '\0')
392 hash_init
= ((hash_init
<< 5) + hash_init
) ^ c
; /* (hash * 33) xor c */
398 gmx_string_hash_func(const char *s
, unsigned int hash_init
)
402 while ((c
= toupper(*s
++)) != '\0')
406 hash_init
= ((hash_init
<< 5) + hash_init
) ^ c
; /* (hash * 33) xor c */
413 gmx_wcmatch(const char *pattern
, const char *str
)
419 /* Skip multiple wildcards in a sequence */
420 while (*pattern
== '*' || *pattern
== '?')
423 /* For ?, we need to check that there are characters left
429 return GMX_NO_WCMATCH
;
437 /* If the pattern ends after the star, we have a match */
442 /* Match the rest against each possible suffix of str */
445 /* Only do the recursive call if the first character
446 * matches. We don't have to worry about wildcards here,
447 * since we have processed them above. */
448 if (*pattern
== *str
)
451 /* Match the suffix, and return if a match or an error */
452 rc
= gmx_wcmatch(pattern
, str
);
453 if (rc
!= GMX_NO_WCMATCH
)
460 /* If no suffix of str matches, we don't have a match */
461 return GMX_NO_WCMATCH
;
463 else if ((*pattern
== '?' && *str
!= 0) || *pattern
== *str
)
469 return GMX_NO_WCMATCH
;
473 /* When the pattern runs out, we have a match if the string has ended. */
474 return (*str
== 0) ? 0 : GMX_NO_WCMATCH
;
477 char *wrap_lines(const char *buf
, int line_width
, int indent
, gmx_bool bIndentFirst
)
480 int i
, i0
, i2
, j
, b2len
, lspace
= 0, l2space
= 0;
481 gmx_bool bFirst
, bFitsOnLine
;
483 /* characters are copied from buf to b2 with possible spaces changed
484 * into newlines and extra space added for indentation.
485 * i indexes buf (source buffer) and i2 indexes b2 (destination buffer)
486 * i0 points to the beginning of the current line (in buf, source)
487 * lspace and l2space point to the last space on the current line
488 * bFirst is set to prevent indentation of first line
489 * bFitsOnLine says if the first space occurred before line_width, if
490 * that is not the case, we have a word longer than line_width which
491 * will also not fit on the next line, so we might as well keep it on
492 * the current line (where it also won't fit, but looks better)
496 b2len
= strlen(buf
)+1+indent
;
501 for (i2
= 0; (i2
< indent
); i2
++)
510 /* find the last space before end of line */
511 for (i
= i0
; ((i
-i0
< line_width
) || (l2space
== -1)) && (buf
[i
]); i
++)
514 /* remember the position of a space */
520 /* if we have a newline before the line is full, reset counters */
521 if (buf
[i
] == '\n' && buf
[i
+1])
526 /* add indentation after the newline */
527 for (j
= 0; (j
< indent
); j
++)
533 /* If we are at the last newline, copy it */
534 if (buf
[i
] == '\n' && !buf
[i
+1])
538 /* if we're not at the end of the string */
541 /* check if one word does not fit on the line */
542 bFitsOnLine
= (i
-i0
<= line_width
);
543 /* reset line counters to just after the space */
546 /* if the words fit on the line, and we're beyond the indentation part */
547 if ( (bFitsOnLine
) && (l2space
>= indent
) )
549 /* start a new line */
551 /* and add indentation */
556 line_width
-= indent
;
561 for (j
= 0; (j
< indent
); j
++)
565 /* no extra spaces after indent; */
566 while (buf
[i0
] == ' ')
581 str_to_int64_t(const char *str
, char **endptr
)
584 return strtoll(str
, endptr
, 10);
586 return _strtoi64(str
, endptr
, 10);
590 void parse_digits_from_plain_string(const char *digitstring
, int *ndigits
, int **digitlist
)
594 if (NULL
== digitstring
)
601 *ndigits
= strlen(digitstring
);
603 snew(*digitlist
, *ndigits
);
605 for (i
= 0; i
< *ndigits
; i
++)
607 if (digitstring
[i
] < '0' || digitstring
[i
] > '9')
609 gmx_fatal(FARGS
, "Invalid character in digit-only string: '%c'\n",
612 (*digitlist
)[i
] = digitstring
[i
] - '0';
616 static void parse_digits_from_csv_string(const char gmx_unused
*digitstring
, int gmx_unused
*ndigits
, int gmx_unused
*digitlist
)
618 /* TODO Implement csv format to support (e.g.) more than 10
619 different GPUs in a node. */
620 gmx_incons("Not implemented yet");