aboutsummaryrefslogtreecommitdiff
path: root/gcc/cppalloc.c
diff options
context:
space:
mode:
authorPer Bothner <bothner@gcc.gnu.org>1995-03-16 13:59:07 -0800
committerPer Bothner <bothner@gcc.gnu.org>1995-03-16 13:59:07 -0800
commit7f2935c734c36f84ab62b20a04de465e19061333 (patch)
tree0194faf594c2891f5c06b75959e9314b81c1b28c /gcc/cppalloc.c
parentb310a51d35b01c9ce4e617e357ade93d87cd1c90 (diff)
downloadgcc-7f2935c734c36f84ab62b20a04de465e19061333.zip
gcc-7f2935c734c36f84ab62b20a04de465e19061333.tar.gz
gcc-7f2935c734c36f84ab62b20a04de465e19061333.tar.bz2
Initial revision
From-SVN: r9191
Diffstat (limited to 'gcc/cppalloc.c')
-rw-r--r--gcc/cppalloc.c81
1 files changed, 81 insertions, 0 deletions
diff --git a/gcc/cppalloc.c b/gcc/cppalloc.c
new file mode 100644
index 0000000..aa37aac
--- /dev/null
+++ b/gcc/cppalloc.c
@@ -0,0 +1,81 @@
+/* Part of CPP library. (memory allocation - xmalloc etc)
+ Copyright (C) 1986, 87, 89, 92, 93, 94, 1995 Free Software Foundation, Inc.
+ Written by Per Bothner, 1994.
+ Based on CCCP program by by Paul Rubin, June 1986
+ Adapted to ANSI C, Richard Stallman, Jan 1987
+
+This program 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.
+
+This program 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 this program; if not, write to the Free Software
+Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
+
+ In other words, you are welcome to use, share and improve this program.
+ You are forbidden to forbid anyone else to use, share and improve
+ what you give them. Help stamp out software-hoarding! */
+
+static void
+memory_full ()
+{
+ fatal ("Memory exhausted.");
+}
+
+char *
+xmalloc (size)
+ unsigned size;
+{
+ register char *ptr = (char *) malloc (size);
+ if (ptr != 0) return (ptr);
+ memory_full ();
+ /*NOTREACHED*/
+ return 0;
+}
+
+char *
+xrealloc (old, size)
+ char *old;
+ unsigned size;
+{
+ register char *ptr = (char *) realloc (old, size);
+ if (ptr != 0) return (ptr);
+ memory_full ();
+ /*NOTREACHED*/
+ return 0;
+}
+
+char *
+xcalloc (number, size)
+ unsigned number, size;
+{
+ register unsigned total = number * size;
+ register char *ptr = (char *) malloc (total);
+ if (ptr != 0) {
+ if (total > 100)
+ bzero (ptr, total);
+ else {
+ /* It's not too long, so loop, zeroing by longs.
+ It must be safe because malloc values are always well aligned. */
+ register long *zp = (long *) ptr;
+ register long *zl = (long *) (ptr + total - 4);
+ register int i = total - 4;
+ while (zp < zl)
+ *zp++ = 0;
+ if (i < 0)
+ i = 0;
+ while (i < total)
+ ptr[i++] = 0;
+ }
+ return ptr;
+ }
+ memory_full ();
+ /*NOTREACHED*/
+ return 0;
+}