diff options
author | Marc Espie <espie@cvs.openbsd.org> | 1999-05-26 13:38:57 +0000 |
---|---|---|
committer | Marc Espie <espie@cvs.openbsd.org> | 1999-05-26 13:38:57 +0000 |
commit | 0126e157b87f137fc08dc7f46f6c291b9d06ac5d (patch) | |
tree | f8555e3e504eb82b4cd3cba5cec20ae4ce8124ff /gnu/egcs/gcc/f/proj.c | |
parent | ff8e9a4356e55ed142306c3a375fa280800abc86 (diff) |
egcs projects compiler system
Exact copy of the snapshot, except for the removal of
texinfo/
gcc/ch/
libchill/
Diffstat (limited to 'gnu/egcs/gcc/f/proj.c')
-rw-r--r-- | gnu/egcs/gcc/f/proj.c | 68 |
1 files changed, 68 insertions, 0 deletions
diff --git a/gnu/egcs/gcc/f/proj.c b/gnu/egcs/gcc/f/proj.c new file mode 100644 index 00000000000..237ebe0ddf4 --- /dev/null +++ b/gnu/egcs/gcc/f/proj.c @@ -0,0 +1,68 @@ +/* proj.c file for GNU Fortran + Copyright (C) 1995 Free Software Foundation, Inc. + Contributed by James Craig Burley. + +This file is part of GNU Fortran. + +GNU Fortran is free software; you can redistribute it and/or modify +it under the terms of the GNU General Public License as published by +the Free Software Foundation; either version 2, or (at your option) +any later version. + +GNU Fortran is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +GNU General Public License for more details. + +You should have received a copy of the GNU General Public License +along with GNU Fortran; see the file COPYING. If not, write to +the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA +02111-1307, USA. */ + +#include "proj.h" +#include "glimits.j" + +#ifndef HAVE_STRTOUL +unsigned long int +strtoul (const char *nptr, char **endptr, int base) +{ + unsigned long int number = 0; + unsigned long int old_number = 0; + + assert (base == 10); + assert (endptr == NULL); + + while (ISDIGIT (*nptr)) + { + number = old_number * 10 + (*(nptr++) - '0'); + if ((number <= old_number) && (old_number != 0)) + return ULONG_MAX; + old_number = number; + } + + return number; +} +#endif + +#ifndef HAVE_BSEARCH +void * +bsearch (const void *key, const void *base, size_t nmemb, size_t size, + int (*compar) (const void *, const void *)) +{ + size_t i; + int cmp; + + /* We do a dumb incremental search, not a binary search, for now. */ + + for (i = 0; i < nmemb; ++i) + { + if ((cmp = (*compar) (key, base)) == 0) + return base; + if (cmp < 0) + break; + base += size; + } + + return NULL; +} +#endif |