8b45da67d0
Mon Jun 15 22:21:57 1998 Craig Burley <burley@gnu.org> Cutover to system.h: * Make-lang.in: * Makefile.in: * ansify.c: * bad.c: * bld.c: * com.c: * com.h: * expr.c: * fini.c: * g77spec.c: * implic.c: * intdoc.c: * intrin.c: * lex.c: * lex.h: * parse.c: * proj.c: * proj.h: * src.c: * src.h: * stb.c: * ste.c: * target.c: * top.c: * system.j: New file. Use toplev.h where appropriate: * Make-lang.in: * Makefile.in: * bad.c: * bld.c: * com.c: * lex.c: * ste.c: * top.c: * toplev.j: New file. Conditionalize all dumping/reporting routines so they don't get built for gcc/egcs: * bld.c: * bld.h: * com.c: * equiv.c: * equiv.h: * sta.c: * stt.c: * stt.h: * symbol.c: * symbol.h: Use hconfig.h instead of config.h where appropriate: * Makefile.in (proj-h.o): Compile with -DUSE_HCONFIG. * fini.c: Define USE_HCONFIG before including proj.h. * Makefile.in (deps-kinda): Redirect stderr to stdout, to eliminate diagnostics vis-a-vis g77spec.c. * Makefile.in: Regenerate dependencies via deps-kinda. * lex.c (ffelex_file_fixed, ffelex_file_free): Eliminate apparently spurious warnings about uninitialized variables `c', `column', and so on. From-SVN: r20520
69 lines
1.7 KiB
C
69 lines
1.7 KiB
C
/* proj.c file for GNU Fortran
|
|
Copyright (C) 1995 Free Software Foundation, Inc.
|
|
Contributed by James Craig Burley (burley@gnu.org).
|
|
|
|
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
|