Boston, MA 02111-1307, USA. */
#include "config.h"
-#include <stdio.h>
+#include "system.h"
#include "rtl.h"
#include "flags.h"
#include "obstack.h"
#include "regs.h"
#include "basic-block.h"
-#ifdef HAVE_STDLIB_H
-#include <stdlib.h>
-#endif
-
-#ifdef NEED_DECLARATION_FREE
-extern void free PROTO((void *));
-#endif
-
/* Obstack to allocate bitmap elements from. */
static struct obstack bitmap_obstack;
static int bitmap_obstack_init = FALSE;
bitmap_element *bitmap_free; /* Freelist of bitmap elements. */
static void bitmap_element_free PROTO((bitmap, bitmap_element *));
-static bitmap_element *bitmap_element_allocate PROTO((bitmap));
+static bitmap_element *bitmap_element_allocate PROTO((void));
static int bitmap_element_zerop PROTO((bitmap_element *));
static void bitmap_element_link PROTO((bitmap, bitmap_element *));
static bitmap_element *bitmap_find_bit PROTO((bitmap, unsigned int));
/* Allocate a bitmap element. The bits are cleared, but nothing else is. */
static INLINE bitmap_element *
-bitmap_element_allocate (head)
- bitmap head;
+bitmap_element_allocate ()
{
bitmap_element *element;
#if BITMAP_ELEMENT_WORDS != 2
/* Copy elements in forward direction one at a time */
for (from_ptr = from->first; from_ptr; from_ptr = from_ptr->next)
{
- bitmap_element *to_elt = bitmap_element_allocate (to);
+ bitmap_element *to_elt = bitmap_element_allocate ();
to_elt->indx = from_ptr->indx;
if (ptr == 0)
{
- ptr = bitmap_element_allocate (head);
+ ptr = bitmap_element_allocate ();
ptr->indx = bit / BITMAP_ELEMENT_ALL_BITS;
ptr->bits[word_num] = bit_val;
bitmap_element_link (head, ptr);
}
if (to_ptr == 0)
- to_ptr = bitmap_element_allocate (to);
+ to_ptr = bitmap_element_allocate ();
/* Do the operation, and if any bits are set, link it into the
linked list. */