summaryrefslogtreecommitdiff
path: root/gcc/f/proj.c
diff options
context:
space:
mode:
authorYamaArashi <shadow962@live.com>2016-02-08 03:04:42 -0800
committerYamaArashi <shadow962@live.com>2016-02-08 03:04:42 -0800
commita5c638ceaca09d018d041f15e7e2518c217250bc (patch)
tree7374fe6cd30b24a25037dbdb259bbcf5300b13c2 /gcc/f/proj.c
parent476b5c86e5bc21311dfb14d0f043fbf5b870781d (diff)
remove Fortran, Objective C, and C++
Diffstat (limited to 'gcc/f/proj.c')
-rwxr-xr-xgcc/f/proj.c68
1 files changed, 0 insertions, 68 deletions
diff --git a/gcc/f/proj.c b/gcc/f/proj.c
deleted file mode 100755
index 6af2df5..0000000
--- a/gcc/f/proj.c
+++ /dev/null
@@ -1,68 +0,0 @@
-/* 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