diff options
author | Jason Downs <downsj@cvs.openbsd.org> | 1996-07-27 02:52:39 +0000 |
---|---|---|
committer | Jason Downs <downsj@cvs.openbsd.org> | 1996-07-27 02:52:39 +0000 |
commit | 978f1b8e18efed5647513070f53f269049feb83c (patch) | |
tree | ce00da25c18405cf3e6847ad3d72d14d363e98b9 /gnu/usr.bin/gcc/f/proj.c | |
parent | e2ce9843b6a157aadf0700edefbe6d916cb98c57 (diff) |
Initial integration of G77.
Please do a make cleandir before rebuilding gcc!
Diffstat (limited to 'gnu/usr.bin/gcc/f/proj.c')
-rw-r--r-- | gnu/usr.bin/gcc/f/proj.c | 71 |
1 files changed, 71 insertions, 0 deletions
diff --git a/gnu/usr.bin/gcc/f/proj.c b/gnu/usr.bin/gcc/f/proj.c new file mode 100644 index 00000000000..0e1ef2e8bcd --- /dev/null +++ b/gnu/usr.bin/gcc/f/proj.c @@ -0,0 +1,71 @@ +/* proj.c file for GNU Fortran + Copyright (C) 1995 Free Software Foundation, Inc. + Contributed by James Craig Burley (burley@gnu.ai.mit.edu). + +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 <ctype.h> +#include "glimits.j" + +#if !FFEPROJ_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 + +#if !FFEPROJ_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 |