WebSVN – Kolibri OS – Diff – /contrib/toolchain/binutils/libiberty/obstack.c

 /* obstack.c - subroutines used implicitly by object stack macros
-   Copyright (C) 1988,89,90,91,92,93,94,96,97 Free Software Foundation, Inc.
+   Copyright (C) 1988-2015 Free Software Foundation, Inc.
+   This file is part of the GNU C Library.
+   The GNU C Library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
-   NOTE: This source is derived from an old version taken from the GNU C
-   Library (glibc).
-   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.
+   version 2.1 of the License, or (at your option) any later version.
-   This program is distributed in the hope that it will be useful,
+   The GNU C Library 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
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-   GNU General Public License for more details.
+   Lesser 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, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301,
-   USA.  */
+   You should have received a copy of the GNU Lesser General Public
+   License along with the GNU C Library; if not, see
+   .  */
+#ifdef _LIBC
-#ifdef HAVE_CONFIG_H
+# include
-#include
+#else
-#endif
+# include
-#include "obstack.h"
+# include "obstack.h"
 #endif
 /* NOTE BEFORE MODIFYING THIS FILE: This version number must be
-   incremented whenever callers compiled using an old obstack.h can no
+/* NOTE BEFORE MODIFYING THIS FILE: _OBSTACK_INTERFACE_VERSION in
-   longer properly call the functions in this obstack.c.  */
+   obstack.h must be incremented whenever callers compiled using an old
-#define OBSTACK_INTERFACE_VERSION 1
+   obstack.h can no longer properly call the functions in this file.  */
 /* Comment out all this code if we are using the GNU C Library, and are not
-   actually compiling the library itself, and the installed library
-   supports the same library interface we do.  This code is part of the GNU
-   C Library, but also included in many other GNU distributions.  Compiling
+   actually compiling the library itself, and the installed library
-   and linking in this code is a waste when using the GNU C library
+   supports the same library interface we do.  This code is part of the GNU
-   (especially if it is a shared library).  Rather than having every GNU
+   C Library, but also included in many other GNU distributions.  Compiling
+   and linking in this code is a waste when using the GNU C library
+   (especially if it is a shared library).  Rather than having every GNU
+   program understand 'configure --with-gnu-libc' and omit the object
+   files, it is simpler to just do this in the source for each such file.  */
-   program understand `configure --with-gnu-libc' and omit the object
+#if !defined _LIBC && defined __GNU_LIBRARY__ && __GNU_LIBRARY__ > 1
-   files, it is simpler to just do this in the source for each such file.  */
+# include
 # if (_GNU_OBSTACK_INTERFACE_VERSION == _OBSTACK_INTERFACE_VERSION	      \
+      || (_GNU_OBSTACK_INTERFACE_VERSION == 1				      \
+          && _OBSTACK_INTERFACE_VERSION == 2				      \
+          && defined SIZEOF_INT && defined SIZEOF_SIZE_T		      \
+          && SIZEOF_INT == SIZEOF_SIZE_T))
+#  define _OBSTACK_ELIDE_CODE
+# endif
+#endif
+#ifndef _OBSTACK_ELIDE_CODE
+/* If GCC, or if an oddball (testing?) host that #defines __alignof__,
+   use the already-supplied __alignof__.  Otherwise, this must be Gnulib
+   (as glibc assumes GCC); defer to Gnulib's alignof_type.  */
+# if !defined __GNUC__ && !defined __IBM__ALIGNOF__ && !defined __alignof__
+#  if defined __cplusplus
+template  struct alignof_helper { char __slot1; type __slot2; };
-#include 		/* Random thing to get __GNU_LIBRARY__.  */
+#   define __alignof__(type) offsetof (alignof_helper, __slot2)
-#if !defined (_LIBC) && defined (__GNU_LIBRARY__) && __GNU_LIBRARY__ > 1
-#include
-#if _GNU_OBSTACK_INTERFACE_VERSION == OBSTACK_INTERFACE_VERSION
+#  else
+#   define __alignof__(type)						      \
-#define ELIDE_CODE
+  offsetof (struct { char __slot1; type __slot2; }, __slot2)
-#endif
-#endif
+#  endif
 # endif
-#ifndef ELIDE_CODE
+# include
+# include
-#define POINTER void *
-/* Determine default alignment.  */
-struct fooalign {char x; double d;};
-#define DEFAULT_ALIGNMENT  \
-  ((PTR_INT_TYPE) ((char *) &((struct fooalign *) 0)->d - (char *) 0))
-/* If malloc were really smart, it would round addresses to DEFAULT_ALIGNMENT.
-   But in fact it might be less smart and round addresses to as much as
-   DEFAULT_ROUNDING.  So we prepare for it to do that.  */
+# ifndef MAX
+#  define MAX(a,b) ((a) > (b) ? (a) : (b))
+# endif
+/* Determine default alignment.  */
+/* If malloc were really smart, it would round addresses to DEFAULT_ALIGNMENT.
+   But in fact it might be less smart and round addresses to as much as
+   DEFAULT_ROUNDING.  So we prepare for it to do that.
-union fooround {long x; double d;};
-#define DEFAULT_ROUNDING (sizeof (union fooround))
-/* When we copy a long block of data, this is the unit to do it with.
-   On some machines, copying successive ints does not work;
+   DEFAULT_ALIGNMENT cannot be an enum constant; see gnulib's alignof.h.  */
-   in such a case, redefine COPYING_UNIT to `long' (if that works)
+#define DEFAULT_ALIGNMENT MAX (__alignof__ (long double),		      \
-   or `char' as a last resort.  */
+                               MAX (__alignof__ (uintmax_t),		      \
-#ifndef COPYING_UNIT
+                                    __alignof__ (void *)))
-#define COPYING_UNIT int
+#define DEFAULT_ROUNDING MAX (sizeof (long double),			      \
-#endif
-/* The functions allocating more room by calling `obstack_chunk_alloc'
-   jump to the handler pointed to by `obstack_alloc_failed_handler'.
+                               MAX (sizeof (uintmax_t),			      \
-   This variable by default points to the internal function
-   `print_and_abort'.  */
-static void print_and_abort (void);
-void (*obstack_alloc_failed_handler) (void) = print_and_abort;
+                                    sizeof (void *)))
-/* Exit value used when `print_and_abort' is used.  */
-#if defined __GNU_LIBRARY__ || defined HAVE_STDLIB_H
-#include
-#endif
-#ifndef EXIT_FAILURE
-#define EXIT_FAILURE 1
+/* Call functions with either the traditional malloc/free calling
-#endif
-int obstack_exit_failure = EXIT_FAILURE;
-/* The non-GNU-C macros copy the obstack into this global variable
-   to avoid multiple evaluation.  */
+   interface, or the mmalloc/mfree interface (that adds an extra first
-struct obstack *_obstack;
+   argument), based on the value of use_extra_arg.  */
-/* Define a macro that either calls functions with the traditional malloc/free
-   calling interface, or calls functions with the mmalloc/mfree interface
-   (that adds an extra first argument), based on the state of use_extra_arg.
+static void *
-   For free, do not use ?:, since some compilers, like the MIPS compilers,
-   do not allow (expr) ? void : void.  */
-#if defined (__STDC__) && __STDC__
+call_chunkfun (struct obstack *h, size_t size)
-#define CALL_CHUNKFUN(h, size) \
-  (((h) -> use_extra_arg) \
-   ? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
+{
-   : (*(struct _obstack_chunk *(*) (long)) (h)->chunkfun) ((size)))
+  if (h->use_extra_arg)
-#define CALL_FREEFUN(h, old_chunk) \
-  do { \
-    if ((h) -> use_extra_arg) \
-      (*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
-    else \
-      (*(void (*) (void *)) (h)->freefun) ((old_chunk)); \
-  } while (0)
-#else
-#define CALL_CHUNKFUN(h, size) \
+    return h->chunkfun.extra (h->extra_arg, size);
-  (((h) -> use_extra_arg) \
+  else
-   ? (*(h)->chunkfun) ((h)->extra_arg, (size)) \
+    return h->chunkfun.plain (size);
-   : (*(struct _obstack_chunk *(*) ()) (h)->chunkfun) ((size)))
-#define CALL_FREEFUN(h, old_chunk) \
+}
-  do { \
-    if ((h) -> use_extra_arg) \
-      (*(h)->freefun) ((h)->extra_arg, (old_chunk)); \
+static void
-    else \
+call_freefun (struct obstack *h, void *old_chunk)
-      (*(void (*) ()) (h)->freefun) ((old_chunk)); \
+{
-  } while (0)
+  if (h->use_extra_arg)
-#endif
+    h->freefun.extra (h->extra_arg, old_chunk);
   else
+    h->freefun.plain (old_chunk);
 /* Initialize an obstack H for use.  Specify chunk size SIZE (0 means default).
    Objects start on multiples of ALIGNMENT (0 means use default).
    CHUNKFUN is the function to use to allocate chunks,
-   and FREEFUN the function to free them.
+/* Initialize an obstack H for use.  Specify chunk size SIZE (0 means default).
    Objects start on multiples of ALIGNMENT (0 means use default).
 		    + 4 + DEFAULT_ROUNDING - 1)
 		   & ~(DEFAULT_ROUNDING - 1));
       size = 4096 - extra;
+    }
-  h->chunkfun = (struct _obstack_chunk * (*)(void *, long)) chunkfun;
   h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
   h->chunk_size = size;
-  h->alignment_mask = alignment - 1;
-  h->use_extra_arg = 0;
+  h->alignment_mask = alignment - 1;
-  chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
+  chunk = (struct _obstack_chunk *) call_chunkfun (h, h->chunk_size);
+  if (!chunk)
-  if (!chunk)
+    (*obstack_alloc_failed_handler) ();
-    (*obstack_alloc_failed_handler) ();
+  h->chunk = chunk;
-  h->next_free = h->object_base = chunk->contents;
+  h->next_free = h->object_base = __PTR_ALIGN ((char *) chunk, chunk->contents,
-  h->chunk_limit = chunk->limit
+                                               alignment - 1);
-    = (char *) chunk + h->chunk_size;
+  h->chunk_limit = chunk->limit = (char *) chunk + h->chunk_size;
   chunk->prev = 0;
   /* The initial chunk now contains no empty object.  */
   h->maybe_empty_object = 0;
   h->alloc_failed = 0;
   return 1;
 }
 int
-_obstack_begin_1 (struct obstack *h, int size, int alignment,
-                  POINTER (*chunkfun) (POINTER, long),
-                  void (*freefun) (POINTER, POINTER), POINTER arg)
-{
-  register struct _obstack_chunk *chunk; /* points to new chunk */
+_obstack_begin (struct obstack *h,
-  if (alignment == 0)
-    alignment = (int) DEFAULT_ALIGNMENT;
+                _OBSTACK_SIZE_T size, _OBSTACK_SIZE_T alignment,
-  if (size == 0)
-    /* Default size is what GNU malloc can fit in a 4096-byte block.  */
-    {
-      /* 12 is sizeof (mhead) and 4 is EXTRA from GNU malloc.
-	 Use the values for range checking, because if range checking is off,
-	 the extra bytes won't be missed terribly, but if range checking is on
-	 and we used a larger request, a whole extra 4096 bytes would be
-	 allocated.
+                void *(*chunkfun) (size_t),
-	 These number are irrelevant to the new GNU malloc.  I suspect it is
+                void (*freefun) (void *))
-	 less sensitive to the size of the request.  */
+{
-      int extra = ((((12 + DEFAULT_ROUNDING - 1) & ~(DEFAULT_ROUNDING - 1))
+  h->chunkfun.plain = chunkfun;
-		    + 4 + DEFAULT_ROUNDING - 1)
+  h->freefun.plain = freefun;
+  h->use_extra_arg = 0;
+  return _obstack_begin_worker (h, size, alignment);
+}
-		   & ~(DEFAULT_ROUNDING - 1));
-      size = 4096 - extra;
+int
+_obstack_begin_1 (struct obstack *h,
+                  _OBSTACK_SIZE_T size, _OBSTACK_SIZE_T alignment,
-    }
+                  void *(*chunkfun) (void *, size_t),
+                  void (*freefun) (void *, void *),
-  h->chunkfun = (struct _obstack_chunk * (*)(void *,long)) chunkfun;
+                  void *arg)
   h->freefun = (void (*) (void *, struct _obstack_chunk *)) freefun;
-  h->chunk_size = size;
-  h->alignment_mask = alignment - 1;
-  h->extra_arg = arg;
-  h->use_extra_arg = 1;
+  h->chunkfun.extra = chunkfun;
-  chunk = h->chunk = CALL_CHUNKFUN (h, h -> chunk_size);
-  if (!chunk)
-    (*obstack_alloc_failed_handler) ();
-  h->next_free = h->object_base = chunk->contents;
-  h->chunk_limit = chunk->limit
-    = (char *) chunk + h->chunk_size;
-  chunk->prev = 0;
-  /* The initial chunk now contains no empty object.  */
+  h->freefun.extra = freefun;
-  h->maybe_empty_object = 0;
+  h->extra_arg = arg;
-  h->alloc_failed = 0;
+  h->use_extra_arg = 1;
-  return 1;
+  return _obstack_begin_worker (h, size, alignment);
+}
 /* Allocate a new current chunk for the obstack *H
    on the assumption that LENGTH bytes need to be added
    to the current object, or a new object of length LENGTH allocated.
    Copies any partial object from the end of the old chunk
    to the beginning of the new one.  */
-void
-_obstack_newchunk (struct obstack *h, int length)
-{
+void
-  register struct _obstack_chunk *old_chunk = h->chunk;
+_obstack_newchunk (struct obstack *h, _OBSTACK_SIZE_T length)
+{
+  struct _obstack_chunk *old_chunk = h->chunk;
-  register struct _obstack_chunk *new_chunk;
+  struct _obstack_chunk *new_chunk = 0;
+  size_t obj_size = h->next_free - h->object_base;
+  char *object_base;
   register long	new_size;
-  register long obj_size = h->next_free - h->object_base;
+  /* Compute size for new chunk.  */
-  register long i;
+  size_t sum1 = obj_size + length;
+  size_t sum2 = sum1 + h->alignment_mask;
-  long already;
+  size_t new_size = sum2 + (obj_size >> 3) + 100;
   if (new_size < sum2)
-  /* Compute size for new chunk.  */
+    new_size = sum2;
-  new_size = (obj_size + length) + (obj_size >> 3) + 100;
+  if (new_size < h->chunk_size)
-  if (new_size < h->chunk_size)
+    new_size = h->chunk_size;
     new_size = h->chunk_size;
+  /* Allocate and initialize the new chunk.  */
-  /* Allocate and initialize the new chunk.  */
-  new_chunk = CALL_CHUNKFUN (h, new_size);
-  if (!new_chunk)
-    (*obstack_alloc_failed_handler) ();
-  h->chunk = new_chunk;
-  new_chunk->prev = old_chunk;
+  if (obj_size <= sum1 && sum1 <= sum2)
-  new_chunk->limit = h->chunk_limit = (char *) new_chunk + new_size;
+    new_chunk = (struct _obstack_chunk *) call_chunkfun (h, new_size);
-  /* Move the existing object to the new chunk.
-     Word at a time is fast and is safe if the object
-     is sufficiently aligned.  */
-  if (h->alignment_mask + 1 >= DEFAULT_ALIGNMENT)
-    {
+  if (!new_chunk)
-      for (i = obj_size / sizeof (COPYING_UNIT) - 1;
-	   i >= 0; i--)
-	((COPYING_UNIT *)new_chunk->contents)[i]
+    (*obstack_alloc_failed_handler)();
-	  = ((COPYING_UNIT *)h->object_base)[i];
-      /* We used to copy the odd few remaining bytes as one extra COPYING_UNIT,
+  h->chunk = new_chunk;
-	 but that can cross a page boundary on a machine
+  new_chunk->prev = old_chunk;
-	 which does not do strict alignment for COPYING_UNITS.  */
+  new_chunk->limit = h->chunk_limit = (char *) new_chunk + new_size;
       already = obj_size / sizeof (COPYING_UNIT) * sizeof (COPYING_UNIT);
-    }
+  /* Compute an aligned object_base in the new chunk */
+  object_base =
+    __PTR_ALIGN ((char *) new_chunk, new_chunk->contents, h->alignment_mask);
-  else
+  /* Move the existing object to the new chunk.  */
-    already = 0;
+  memcpy (object_base, h->object_base, obj_size);
-  /* Copy remaining bytes one by one.  */
-  for (i = already; i < obj_size; i++)
+  /* If the object just copied was the only data in OLD_CHUNK,
-    new_chunk->contents[i] = h->object_base[i];
+     free that chunk and remove it from the chain.
      But not if that chunk might contain an empty object.  */
-  /* If the object just copied was the only data in OLD_CHUNK,
+  if (!h->maybe_empty_object
-     free that chunk and remove it from the chain.
+      && (h->object_base
-     But not if that chunk might contain an empty object.  */
+          == __PTR_ALIGN ((char *) old_chunk, old_chunk->contents,
    This is here for debugging.
    If you use it in a program, you are probably losing.  */
 /* Suppress -Wmissing-prototypes warning.  We don't want to declare this in
    obstack.h because it is just for debugging.  */
-int _obstack_allocated_p (struct obstack *h, POINTER obj);
+int _obstack_allocated_p (struct obstack *h, void *obj) __attribute_pure__;
 int
-_obstack_allocated_p (struct obstack *h, POINTER obj)
+_obstack_allocated_p (struct obstack *h, void *obj)
 {
-  register struct _obstack_chunk *lp;	/* below addr of any objects in this chunk */
+  struct _obstack_chunk *lp;    /* below addr of any objects in this chunk */
-  register struct _obstack_chunk *plp;	/* point to previous chunk if any */
+  struct _obstack_chunk *plp;   /* point to previous chunk if any */
   lp = (h)->chunk;
   /* We use >= rather than > since the object cannot be exactly at
      the beginning of the chunk but might be an empty object exactly
      at the end of an adjacent chunk.  */
-  while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
+  while (lp != 0 && ((void *) lp >= obj || (void *) (lp)->limit < obj))
+    {
       plp = lp->prev;
       lp = plp;
+    }
   return lp != 0;
+}
-/* Free objects in obstack H, including OBJ and everything allocate
-   more recently than OBJ.  If OBJ is zero, free everything in H.  */
-#undef obstack_free
-/* This function has two names with identical definitions.
+/* Free objects in obstack H, including OBJ and everything allocate
-   This is the first one, called from non-ANSI code.  */
+   more recently than OBJ.  If OBJ is zero, free everything in H.  */
 void
-_obstack_free (struct obstack *h, POINTER obj)
+_obstack_free (struct obstack *h, void *obj)
+{
-  register struct _obstack_chunk *lp;	/* below addr of any objects in this chunk */
+  struct _obstack_chunk *lp;    /* below addr of any objects in this chunk */
-  register struct _obstack_chunk *plp;	/* point to previous chunk if any */
+  struct _obstack_chunk *plp;   /* point to previous chunk if any */
   lp = h->chunk;
   /* We use >= because there cannot be an object at the beginning of a chunk.
      But there can be an empty object at that address
      at the end of another chunk.  */
-  while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
+  while (lp != 0 && ((void *) lp >= obj || (void *) (lp)->limit < obj))
+    {
       plp = lp->prev;
-      CALL_FREEFUN (h, lp);
+      call_freefun (h, lp);
   else if (obj != 0)
     /* obj is not in any of the chunks! */
     abort ();
+}
-/* This function is used from ANSI code.  */
-void
-obstack_free (struct obstack *h, POINTER obj)
-{
-  register struct _obstack_chunk *lp;	/* below addr of any objects in this chunk */
-  register struct _obstack_chunk *plp;	/* point to previous chunk if any */
-  lp = h->chunk;
-  /* We use >= because there cannot be an object at the beginning of a chunk.
-     But there can be an empty object at that address
-     at the end of another chunk.  */
-  while (lp != 0 && ((POINTER) lp >= obj || (POINTER) (lp)->limit < obj))
-    {
-      plp = lp->prev;
-      CALL_FREEFUN (h, lp);
-      lp = plp;
-      /* If we switch chunks, we can't tell whether the new current
-	 chunk contains an empty object, so assume that it may.  */
-      h->maybe_empty_object = 1;
-    }
-  if (lp)
-    {
-      h->object_base = h->next_free = (char *) (obj);
-      h->chunk_limit = lp->limit;
-      h->chunk = lp;
-    }
-  else if (obj != 0)
-    /* obj is not in any of the chunks! */
-    abort ();
-}
-int
+_OBSTACK_SIZE_T
 _obstack_memory_used (struct obstack *h)
 {
-  register struct _obstack_chunk* lp;
+  struct _obstack_chunk *lp;
-  register int nbytes = 0;
+  _OBSTACK_SIZE_T nbytes = 0;
   for (lp = h->chunk; lp != 0; lp = lp->prev)
+    {
       nbytes += lp->limit - (char *) lp;
+    }
   return nbytes;
+}
+# ifndef _OBSTACK_NO_ERROR_HANDLER
+/* Define the error handler.  */
+#  include
+/* Exit value used when 'print_and_abort' is used.  */
+#  ifdef _LIBC
+int obstack_exit_failure = EXIT_FAILURE;
+#  else
+#   ifndef EXIT_FAILURE
+#    define EXIT_FAILURE 1
+#   endif
+#   define obstack_exit_failure EXIT_FAILURE
-/* Define the error handler.  */
+#  endif
 #ifndef _
-# if (HAVE_LIBINTL_H && ENABLE_NLS) || defined _LIBC
+#  if defined _LIBC || (HAVE_LIBINTL_H && ENABLE_NLS)
 #  include
 #  ifndef _
-#   define _(Str) gettext (Str)
+#    define _(msgid) gettext (msgid)
+#   endif
-#  endif
+#  else
-# else
+#   ifndef _
-#  define _(Str) (Str)
+#    define _(msgid) (msgid)
-# endif
-#endif
-static void
+#   endif
-print_and_abort (void)
-{
-  fputs (_("memory exhausted\n"), stderr);
-  exit (obstack_exit_failure);
-}
+#  endif
-#if 0
-/* These are now turned off because the applications do not use it
-   and it uses bcopy via obstack_grow, which causes trouble on sysV.  */
+#  if !(defined _Noreturn						      \
-/* Now define the functional versions of the obstack macros.
-   Define them to simply use the corresponding macros to do the job.  */
-/* The function names appear in parentheses in order to prevent
+        || (defined __STDC_VERSION__ && __STDC_VERSION__ >= 201112))
-   the macro-definitions of the names from being expanded there.  */
+#   if ((defined __GNUC__						      \
-POINTER (obstack_base) (struct obstack *obstack)
-{
-  return obstack_base (obstack);
-}
+	 && (__GNUC__ >= 3 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 8)))	      \
-POINTER (obstack_next_free) (struct obstack *obstack)
-{
-  return obstack_next_free (obstack);
-}
+	|| (defined __SUNPRO_C && __SUNPRO_C >= 0x5110))
-int (obstack_object_size) (struct obstack *obstack)
-{
-  return obstack_object_size (obstack);
-}
+#    define _Noreturn __attribute__ ((__noreturn__))
+#   elif defined _MSC_VER && _MSC_VER >= 1200
-int (obstack_room) (struct obstack *obstack)
-{
-  return obstack_room (obstack);
-}
-int (obstack_make_room) (struct obstack *obstack, int length)
-{
-  return obstack_make_room (obstack, length);
-}
-void (obstack_grow) (struct obstack *obstack, POINTER pointer, int length)
-{
-  obstack_grow (obstack, pointer, length);
-}
-void (obstack_grow0) (struct obstack *obstack, POINTER pointer, int length)
-{
-  obstack_grow0 (obstack, pointer, length);
-}
-void (obstack_1grow) (struct obstack *obstack, int character)
-{
-  obstack_1grow (obstack, character);
-}
+#    define _Noreturn __declspec (noreturn)
-void (obstack_blank) (struct obstack *obstack, int length)
-{
-  obstack_blank (obstack, length);
-}
-void (obstack_1grow_fast) (struct obstack *obstack, int character)
-{
-  obstack_1grow_fast (obstack, character);
-}
-void (obstack_blank_fast) (struct obstack *obstack, int length)
-{
-  obstack_blank_fast (obstack, length);
-}
-POINTER (obstack_finish) (struct obstack *obstack)
-{
-  return obstack_finish (obstack);
-}
-POINTER (obstack_alloc) (struct obstack *obstack, int length)
+# else
-{
-  return obstack_alloc (obstack, length);
+#    define _Noreturn
-}
+#   endif
+#  endif
-POINTER (obstack_copy) (struct obstack *obstack, POINTER pointer, int length)
+#  ifdef _LIBC
 #   include
+# endif
+static _Noreturn void
+print_and_abort (void)
+{
+  /* Don't change any of these strings.  Yes, it would be possible to add
+     the newline to the string and use fputs or so.  But this must not
+     happen because the "memory exhausted" message appears in other places
+     like this and the translation should be reused instead of creating
+     a very similar string which requires a separate translation.  */
-  return obstack_copy (obstack, pointer, length);
+#  ifdef _LIBC
   (void) __fxprintf (NULL, "%s\n", _("memory exhausted"));
+#  else
+  fprintf (stderr, "%s\n", _("memory exhausted"));
+#  endif
+  exit (obstack_exit_failure);
+}
-POINTER (obstack_copy0) (struct obstack *obstack, POINTER pointer, int length)
+/* The functions allocating more room by calling 'obstack_chunk_alloc'
+   jump to the handler pointed to by 'obstack_alloc_failed_handler'.
-{
+   This can be set to a user defined function which should either

Subversion Repositories Kolibri OS

(root)/contrib/toolchain/binutils/libiberty/obstack.c – Rev 5191 → 6324