15a40ced5a
* Make-lang.in (F77_SRCS): Remove all .j files. * Makefile.in (ASSERT_H, CONFIG_H, CONVERT_H, FLAGS_H, GGC_H, GLIMITS_H, HCONFIG_H, INPUT_H, OUTPUT_H, RTL_H, SYSTEM_H, TOPLEV_H, TREE_H): Remove references to .j files. (TCONFIG_H, TM_H): Remove entirely. (deps-kinda): Delete rule. Correct commentary. * assert.j, config.j, convert.j. flags.j, ggc.j, glimits.j, hconfig.j, input.j, output.j, rtl.j, system.j, toplev.j, tree.j, tconfig.j, tree.j: Delete. * ansify.c, bad.c, bit.c, com.c, com.h, intdoc.c, lex.c, parse.c, proj.c, proj.h, ste.c, target.c, target.h, top.c, where.c, where.h: Include parent-directory headers directly. * lex.c: Don't include tree.h twice. From-SVN: r34638
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.
|
|
|
|
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.h"
|
|
|
|
#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
|