/* Functions to support general ended bitmaps.
|
/* Functions to support general ended bitmaps.
|
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005,
|
Copyright (C) 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005,
|
2006, 2007, 2008, 2009 Free Software Foundation, Inc.
|
2006, 2007, 2008, 2009 Free Software Foundation, Inc.
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
GCC 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
|
the terms of the GNU General Public License as published by the Free
|
Software Foundation; either version 3, or (at your option) any later
|
Software Foundation; either version 3, or (at your option) any later
|
version.
|
version.
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
for more details.
|
for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
#include "config.h"
|
#include "config.h"
|
#include "system.h"
|
#include "system.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
#include "rtl.h"
|
#include "rtl.h"
|
#include "flags.h"
|
#include "flags.h"
|
#include "obstack.h"
|
#include "obstack.h"
|
#include "ggc.h"
|
#include "ggc.h"
|
#include "bitmap.h"
|
#include "bitmap.h"
|
#include "hashtab.h"
|
#include "hashtab.h"
|
|
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
|
|
/* Store information about each particular bitmap. */
|
/* Store information about each particular bitmap. */
|
struct bitmap_descriptor
|
struct bitmap_descriptor
|
{
|
{
|
const char *function;
|
const char *function;
|
const char *file;
|
const char *file;
|
int line;
|
int line;
|
int created;
|
int created;
|
HOST_WIDEST_INT allocated;
|
HOST_WIDEST_INT allocated;
|
HOST_WIDEST_INT peak;
|
HOST_WIDEST_INT peak;
|
HOST_WIDEST_INT current;
|
HOST_WIDEST_INT current;
|
int nsearches;
|
int nsearches;
|
};
|
};
|
|
|
/* Hashtable mapping bitmap names to descriptors. */
|
/* Hashtable mapping bitmap names to descriptors. */
|
static htab_t bitmap_desc_hash;
|
static htab_t bitmap_desc_hash;
|
|
|
/* Hashtable helpers. */
|
/* Hashtable helpers. */
|
static hashval_t
|
static hashval_t
|
hash_descriptor (const void *p)
|
hash_descriptor (const void *p)
|
{
|
{
|
const struct bitmap_descriptor *const d =
|
const struct bitmap_descriptor *const d =
|
(const struct bitmap_descriptor *) p;
|
(const struct bitmap_descriptor *) p;
|
return htab_hash_pointer (d->file) + d->line;
|
return htab_hash_pointer (d->file) + d->line;
|
}
|
}
|
struct loc
|
struct loc
|
{
|
{
|
const char *file;
|
const char *file;
|
const char *function;
|
const char *function;
|
int line;
|
int line;
|
};
|
};
|
static int
|
static int
|
eq_descriptor (const void *p1, const void *p2)
|
eq_descriptor (const void *p1, const void *p2)
|
{
|
{
|
const struct bitmap_descriptor *const d =
|
const struct bitmap_descriptor *const d =
|
(const struct bitmap_descriptor *) p1;
|
(const struct bitmap_descriptor *) p1;
|
const struct loc *const l = (const struct loc *) p2;
|
const struct loc *const l = (const struct loc *) p2;
|
return d->file == l->file && d->function == l->function && d->line == l->line;
|
return d->file == l->file && d->function == l->function && d->line == l->line;
|
}
|
}
|
|
|
/* For given file and line, return descriptor, create new if needed. */
|
/* For given file and line, return descriptor, create new if needed. */
|
static struct bitmap_descriptor *
|
static struct bitmap_descriptor *
|
bitmap_descriptor (const char *file, const char *function, int line)
|
bitmap_descriptor (const char *file, const char *function, int line)
|
{
|
{
|
struct bitmap_descriptor **slot;
|
struct bitmap_descriptor **slot;
|
struct loc loc;
|
struct loc loc;
|
|
|
loc.file = file;
|
loc.file = file;
|
loc.function = function;
|
loc.function = function;
|
loc.line = line;
|
loc.line = line;
|
|
|
if (!bitmap_desc_hash)
|
if (!bitmap_desc_hash)
|
bitmap_desc_hash = htab_create (10, hash_descriptor, eq_descriptor, NULL);
|
bitmap_desc_hash = htab_create (10, hash_descriptor, eq_descriptor, NULL);
|
|
|
slot = (struct bitmap_descriptor **)
|
slot = (struct bitmap_descriptor **)
|
htab_find_slot_with_hash (bitmap_desc_hash, &loc,
|
htab_find_slot_with_hash (bitmap_desc_hash, &loc,
|
htab_hash_pointer (file) + line,
|
htab_hash_pointer (file) + line,
|
INSERT);
|
INSERT);
|
if (*slot)
|
if (*slot)
|
return *slot;
|
return *slot;
|
*slot = XCNEW (struct bitmap_descriptor);
|
*slot = XCNEW (struct bitmap_descriptor);
|
(*slot)->file = file;
|
(*slot)->file = file;
|
(*slot)->function = function;
|
(*slot)->function = function;
|
(*slot)->line = line;
|
(*slot)->line = line;
|
return *slot;
|
return *slot;
|
}
|
}
|
|
|
/* Register new bitmap. */
|
/* Register new bitmap. */
|
void
|
void
|
bitmap_register (bitmap b MEM_STAT_DECL)
|
bitmap_register (bitmap b MEM_STAT_DECL)
|
{
|
{
|
b->desc = bitmap_descriptor (_loc_name, _loc_function, _loc_line);
|
b->desc = bitmap_descriptor (_loc_name, _loc_function, _loc_line);
|
b->desc->created++;
|
b->desc->created++;
|
}
|
}
|
|
|
/* Account the overhead. */
|
/* Account the overhead. */
|
static void
|
static void
|
register_overhead (bitmap b, int amount)
|
register_overhead (bitmap b, int amount)
|
{
|
{
|
b->desc->current += amount;
|
b->desc->current += amount;
|
if (amount > 0)
|
if (amount > 0)
|
b->desc->allocated += amount;
|
b->desc->allocated += amount;
|
gcc_assert (b->desc->current >= 0);
|
gcc_assert (b->desc->current >= 0);
|
if (b->desc->peak < b->desc->current)
|
if (b->desc->peak < b->desc->current)
|
b->desc->peak = b->desc->current;
|
b->desc->peak = b->desc->current;
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Global data */
|
/* Global data */
|
bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
|
bitmap_element bitmap_zero_bits; /* An element of all zero bits. */
|
bitmap_obstack bitmap_default_obstack; /* The default bitmap obstack. */
|
bitmap_obstack bitmap_default_obstack; /* The default bitmap obstack. */
|
static int bitmap_default_obstack_depth;
|
static int bitmap_default_obstack_depth;
|
static GTY((deletable)) bitmap_element *bitmap_ggc_free; /* Freelist of
|
static GTY((deletable)) bitmap_element *bitmap_ggc_free; /* Freelist of
|
GC'd elements. */
|
GC'd elements. */
|
|
|
static void bitmap_elem_to_freelist (bitmap, bitmap_element *);
|
static void bitmap_elem_to_freelist (bitmap, bitmap_element *);
|
static void bitmap_element_free (bitmap, bitmap_element *);
|
static void bitmap_element_free (bitmap, bitmap_element *);
|
static bitmap_element *bitmap_element_allocate (bitmap);
|
static bitmap_element *bitmap_element_allocate (bitmap);
|
static int bitmap_element_zerop (const bitmap_element *);
|
static int bitmap_element_zerop (const bitmap_element *);
|
static void bitmap_element_link (bitmap, bitmap_element *);
|
static void bitmap_element_link (bitmap, bitmap_element *);
|
static bitmap_element *bitmap_elt_insert_after (bitmap, bitmap_element *, unsigned int);
|
static bitmap_element *bitmap_elt_insert_after (bitmap, bitmap_element *, unsigned int);
|
static void bitmap_elt_clear_from (bitmap, bitmap_element *);
|
static void bitmap_elt_clear_from (bitmap, bitmap_element *);
|
static bitmap_element *bitmap_find_bit (bitmap, unsigned int);
|
static bitmap_element *bitmap_find_bit (bitmap, unsigned int);
|
|
|
|
|
/* Add ELEM to the appropriate freelist. */
|
/* Add ELEM to the appropriate freelist. */
|
static inline void
|
static inline void
|
bitmap_elem_to_freelist (bitmap head, bitmap_element *elt)
|
bitmap_elem_to_freelist (bitmap head, bitmap_element *elt)
|
{
|
{
|
bitmap_obstack *bit_obstack = head->obstack;
|
bitmap_obstack *bit_obstack = head->obstack;
|
|
|
elt->next = NULL;
|
elt->next = NULL;
|
if (bit_obstack)
|
if (bit_obstack)
|
{
|
{
|
elt->prev = bit_obstack->elements;
|
elt->prev = bit_obstack->elements;
|
bit_obstack->elements = elt;
|
bit_obstack->elements = elt;
|
}
|
}
|
else
|
else
|
{
|
{
|
elt->prev = bitmap_ggc_free;
|
elt->prev = bitmap_ggc_free;
|
bitmap_ggc_free = elt;
|
bitmap_ggc_free = elt;
|
}
|
}
|
}
|
}
|
|
|
/* Free a bitmap element. Since these are allocated off the
|
/* Free a bitmap element. Since these are allocated off the
|
bitmap_obstack, "free" actually means "put onto the freelist". */
|
bitmap_obstack, "free" actually means "put onto the freelist". */
|
|
|
static inline void
|
static inline void
|
bitmap_element_free (bitmap head, bitmap_element *elt)
|
bitmap_element_free (bitmap head, bitmap_element *elt)
|
{
|
{
|
bitmap_element *next = elt->next;
|
bitmap_element *next = elt->next;
|
bitmap_element *prev = elt->prev;
|
bitmap_element *prev = elt->prev;
|
|
|
if (prev)
|
if (prev)
|
prev->next = next;
|
prev->next = next;
|
|
|
if (next)
|
if (next)
|
next->prev = prev;
|
next->prev = prev;
|
|
|
if (head->first == elt)
|
if (head->first == elt)
|
head->first = next;
|
head->first = next;
|
|
|
/* Since the first thing we try is to insert before current,
|
/* Since the first thing we try is to insert before current,
|
make current the next entry in preference to the previous. */
|
make current the next entry in preference to the previous. */
|
if (head->current == elt)
|
if (head->current == elt)
|
{
|
{
|
head->current = next != 0 ? next : prev;
|
head->current = next != 0 ? next : prev;
|
if (head->current)
|
if (head->current)
|
head->indx = head->current->indx;
|
head->indx = head->current->indx;
|
else
|
else
|
head->indx = 0;
|
head->indx = 0;
|
}
|
}
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
register_overhead (head, -((int)sizeof (bitmap_element)));
|
register_overhead (head, -((int)sizeof (bitmap_element)));
|
#endif
|
#endif
|
bitmap_elem_to_freelist (head, elt);
|
bitmap_elem_to_freelist (head, elt);
|
}
|
}
|
|
|
/* Allocate a bitmap element. The bits are cleared, but nothing else is. */
|
/* Allocate a bitmap element. The bits are cleared, but nothing else is. */
|
|
|
static inline bitmap_element *
|
static inline bitmap_element *
|
bitmap_element_allocate (bitmap head)
|
bitmap_element_allocate (bitmap head)
|
{
|
{
|
bitmap_element *element;
|
bitmap_element *element;
|
bitmap_obstack *bit_obstack = head->obstack;
|
bitmap_obstack *bit_obstack = head->obstack;
|
|
|
if (bit_obstack)
|
if (bit_obstack)
|
{
|
{
|
element = bit_obstack->elements;
|
element = bit_obstack->elements;
|
|
|
if (element)
|
if (element)
|
/* Use up the inner list first before looking at the next
|
/* Use up the inner list first before looking at the next
|
element of the outer list. */
|
element of the outer list. */
|
if (element->next)
|
if (element->next)
|
{
|
{
|
bit_obstack->elements = element->next;
|
bit_obstack->elements = element->next;
|
bit_obstack->elements->prev = element->prev;
|
bit_obstack->elements->prev = element->prev;
|
}
|
}
|
else
|
else
|
/* Inner list was just a singleton. */
|
/* Inner list was just a singleton. */
|
bit_obstack->elements = element->prev;
|
bit_obstack->elements = element->prev;
|
else
|
else
|
element = XOBNEW (&bit_obstack->obstack, bitmap_element);
|
element = XOBNEW (&bit_obstack->obstack, bitmap_element);
|
}
|
}
|
else
|
else
|
{
|
{
|
element = bitmap_ggc_free;
|
element = bitmap_ggc_free;
|
if (element)
|
if (element)
|
/* Use up the inner list first before looking at the next
|
/* Use up the inner list first before looking at the next
|
element of the outer list. */
|
element of the outer list. */
|
if (element->next)
|
if (element->next)
|
{
|
{
|
bitmap_ggc_free = element->next;
|
bitmap_ggc_free = element->next;
|
bitmap_ggc_free->prev = element->prev;
|
bitmap_ggc_free->prev = element->prev;
|
}
|
}
|
else
|
else
|
/* Inner list was just a singleton. */
|
/* Inner list was just a singleton. */
|
bitmap_ggc_free = element->prev;
|
bitmap_ggc_free = element->prev;
|
else
|
else
|
element = GGC_NEW (bitmap_element);
|
element = GGC_NEW (bitmap_element);
|
}
|
}
|
|
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
register_overhead (head, sizeof (bitmap_element));
|
register_overhead (head, sizeof (bitmap_element));
|
#endif
|
#endif
|
memset (element->bits, 0, sizeof (element->bits));
|
memset (element->bits, 0, sizeof (element->bits));
|
|
|
return element;
|
return element;
|
}
|
}
|
|
|
/* Remove ELT and all following elements from bitmap HEAD. */
|
/* Remove ELT and all following elements from bitmap HEAD. */
|
|
|
void
|
void
|
bitmap_elt_clear_from (bitmap head, bitmap_element *elt)
|
bitmap_elt_clear_from (bitmap head, bitmap_element *elt)
|
{
|
{
|
bitmap_element *prev;
|
bitmap_element *prev;
|
bitmap_obstack *bit_obstack = head->obstack;
|
bitmap_obstack *bit_obstack = head->obstack;
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
int n;
|
int n;
|
#endif
|
#endif
|
|
|
if (!elt) return;
|
if (!elt) return;
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
n = 0;
|
n = 0;
|
for (prev = elt; prev; prev = prev->next)
|
for (prev = elt; prev; prev = prev->next)
|
n++;
|
n++;
|
register_overhead (head, -sizeof (bitmap_element) * n);
|
register_overhead (head, -sizeof (bitmap_element) * n);
|
#endif
|
#endif
|
|
|
prev = elt->prev;
|
prev = elt->prev;
|
if (prev)
|
if (prev)
|
{
|
{
|
prev->next = NULL;
|
prev->next = NULL;
|
if (head->current->indx > prev->indx)
|
if (head->current->indx > prev->indx)
|
{
|
{
|
head->current = prev;
|
head->current = prev;
|
head->indx = prev->indx;
|
head->indx = prev->indx;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
head->first = NULL;
|
head->first = NULL;
|
head->current = NULL;
|
head->current = NULL;
|
head->indx = 0;
|
head->indx = 0;
|
}
|
}
|
|
|
/* Put the entire list onto the free list in one operation. */
|
/* Put the entire list onto the free list in one operation. */
|
if (bit_obstack)
|
if (bit_obstack)
|
{
|
{
|
elt->prev = bit_obstack->elements;
|
elt->prev = bit_obstack->elements;
|
bit_obstack->elements = elt;
|
bit_obstack->elements = elt;
|
}
|
}
|
else
|
else
|
{
|
{
|
elt->prev = bitmap_ggc_free;
|
elt->prev = bitmap_ggc_free;
|
bitmap_ggc_free = elt;
|
bitmap_ggc_free = elt;
|
}
|
}
|
}
|
}
|
|
|
/* Clear a bitmap by freeing the linked list. */
|
/* Clear a bitmap by freeing the linked list. */
|
|
|
void
|
void
|
bitmap_clear (bitmap head)
|
bitmap_clear (bitmap head)
|
{
|
{
|
if (head->first)
|
if (head->first)
|
bitmap_elt_clear_from (head, head->first);
|
bitmap_elt_clear_from (head, head->first);
|
}
|
}
|
|
|
/* Initialize a bitmap obstack. If BIT_OBSTACK is NULL, initialize
|
/* Initialize a bitmap obstack. If BIT_OBSTACK is NULL, initialize
|
the default bitmap obstack. */
|
the default bitmap obstack. */
|
|
|
void
|
void
|
bitmap_obstack_initialize (bitmap_obstack *bit_obstack)
|
bitmap_obstack_initialize (bitmap_obstack *bit_obstack)
|
{
|
{
|
if (!bit_obstack)
|
if (!bit_obstack)
|
{
|
{
|
if (bitmap_default_obstack_depth++)
|
if (bitmap_default_obstack_depth++)
|
return;
|
return;
|
bit_obstack = &bitmap_default_obstack;
|
bit_obstack = &bitmap_default_obstack;
|
}
|
}
|
|
|
#if !defined(__GNUC__) || (__GNUC__ < 2)
|
#if !defined(__GNUC__) || (__GNUC__ < 2)
|
#define __alignof__(type) 0
|
#define __alignof__(type) 0
|
#endif
|
#endif
|
|
|
bit_obstack->elements = NULL;
|
bit_obstack->elements = NULL;
|
bit_obstack->heads = NULL;
|
bit_obstack->heads = NULL;
|
obstack_specify_allocation (&bit_obstack->obstack, OBSTACK_CHUNK_SIZE,
|
obstack_specify_allocation (&bit_obstack->obstack, OBSTACK_CHUNK_SIZE,
|
__alignof__ (bitmap_element),
|
__alignof__ (bitmap_element),
|
obstack_chunk_alloc,
|
obstack_chunk_alloc,
|
obstack_chunk_free);
|
obstack_chunk_free);
|
}
|
}
|
|
|
/* Release the memory from a bitmap obstack. If BIT_OBSTACK is NULL,
|
/* Release the memory from a bitmap obstack. If BIT_OBSTACK is NULL,
|
release the default bitmap obstack. */
|
release the default bitmap obstack. */
|
|
|
void
|
void
|
bitmap_obstack_release (bitmap_obstack *bit_obstack)
|
bitmap_obstack_release (bitmap_obstack *bit_obstack)
|
{
|
{
|
if (!bit_obstack)
|
if (!bit_obstack)
|
{
|
{
|
if (--bitmap_default_obstack_depth)
|
if (--bitmap_default_obstack_depth)
|
{
|
{
|
gcc_assert (bitmap_default_obstack_depth > 0);
|
gcc_assert (bitmap_default_obstack_depth > 0);
|
return;
|
return;
|
}
|
}
|
bit_obstack = &bitmap_default_obstack;
|
bit_obstack = &bitmap_default_obstack;
|
}
|
}
|
|
|
bit_obstack->elements = NULL;
|
bit_obstack->elements = NULL;
|
bit_obstack->heads = NULL;
|
bit_obstack->heads = NULL;
|
obstack_free (&bit_obstack->obstack, NULL);
|
obstack_free (&bit_obstack->obstack, NULL);
|
}
|
}
|
|
|
/* Create a new bitmap on an obstack. If BIT_OBSTACK is NULL, create
|
/* Create a new bitmap on an obstack. If BIT_OBSTACK is NULL, create
|
it on the default bitmap obstack. */
|
it on the default bitmap obstack. */
|
|
|
bitmap
|
bitmap
|
bitmap_obstack_alloc_stat (bitmap_obstack *bit_obstack MEM_STAT_DECL)
|
bitmap_obstack_alloc_stat (bitmap_obstack *bit_obstack MEM_STAT_DECL)
|
{
|
{
|
bitmap map;
|
bitmap map;
|
|
|
if (!bit_obstack)
|
if (!bit_obstack)
|
bit_obstack = &bitmap_default_obstack;
|
bit_obstack = &bitmap_default_obstack;
|
map = bit_obstack->heads;
|
map = bit_obstack->heads;
|
if (map)
|
if (map)
|
bit_obstack->heads = (struct bitmap_head_def *) map->first;
|
bit_obstack->heads = (struct bitmap_head_def *) map->first;
|
else
|
else
|
map = XOBNEW (&bit_obstack->obstack, bitmap_head);
|
map = XOBNEW (&bit_obstack->obstack, bitmap_head);
|
bitmap_initialize_stat (map, bit_obstack PASS_MEM_STAT);
|
bitmap_initialize_stat (map, bit_obstack PASS_MEM_STAT);
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
register_overhead (map, sizeof (bitmap_head));
|
register_overhead (map, sizeof (bitmap_head));
|
#endif
|
#endif
|
|
|
return map;
|
return map;
|
}
|
}
|
|
|
/* Create a new GCd bitmap. */
|
/* Create a new GCd bitmap. */
|
|
|
bitmap
|
bitmap
|
bitmap_gc_alloc_stat (ALONE_MEM_STAT_DECL)
|
bitmap_gc_alloc_stat (ALONE_MEM_STAT_DECL)
|
{
|
{
|
bitmap map;
|
bitmap map;
|
|
|
map = GGC_NEW (struct bitmap_head_def);
|
map = GGC_NEW (struct bitmap_head_def);
|
bitmap_initialize_stat (map, NULL PASS_MEM_STAT);
|
bitmap_initialize_stat (map, NULL PASS_MEM_STAT);
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
register_overhead (map, sizeof (bitmap_head));
|
register_overhead (map, sizeof (bitmap_head));
|
#endif
|
#endif
|
|
|
return map;
|
return map;
|
}
|
}
|
|
|
/* Release an obstack allocated bitmap. */
|
/* Release an obstack allocated bitmap. */
|
|
|
void
|
void
|
bitmap_obstack_free (bitmap map)
|
bitmap_obstack_free (bitmap map)
|
{
|
{
|
if (map)
|
if (map)
|
{
|
{
|
bitmap_clear (map);
|
bitmap_clear (map);
|
map->first = (bitmap_element *) map->obstack->heads;
|
map->first = (bitmap_element *) map->obstack->heads;
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
register_overhead (map, -((int)sizeof (bitmap_head)));
|
register_overhead (map, -((int)sizeof (bitmap_head)));
|
#endif
|
#endif
|
map->obstack->heads = map;
|
map->obstack->heads = map;
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Return nonzero if all bits in an element are zero. */
|
/* Return nonzero if all bits in an element are zero. */
|
|
|
static inline int
|
static inline int
|
bitmap_element_zerop (const bitmap_element *element)
|
bitmap_element_zerop (const bitmap_element *element)
|
{
|
{
|
#if BITMAP_ELEMENT_WORDS == 2
|
#if BITMAP_ELEMENT_WORDS == 2
|
return (element->bits[0] | element->bits[1]) == 0;
|
return (element->bits[0] | element->bits[1]) == 0;
|
#else
|
#else
|
unsigned i;
|
unsigned i;
|
|
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
if (element->bits[i] != 0)
|
if (element->bits[i] != 0)
|
return 0;
|
return 0;
|
|
|
return 1;
|
return 1;
|
#endif
|
#endif
|
}
|
}
|
|
|
/* Link the bitmap element into the current bitmap linked list. */
|
/* Link the bitmap element into the current bitmap linked list. */
|
|
|
static inline void
|
static inline void
|
bitmap_element_link (bitmap head, bitmap_element *element)
|
bitmap_element_link (bitmap head, bitmap_element *element)
|
{
|
{
|
unsigned int indx = element->indx;
|
unsigned int indx = element->indx;
|
bitmap_element *ptr;
|
bitmap_element *ptr;
|
|
|
/* If this is the first and only element, set it in. */
|
/* If this is the first and only element, set it in. */
|
if (head->first == 0)
|
if (head->first == 0)
|
{
|
{
|
element->next = element->prev = 0;
|
element->next = element->prev = 0;
|
head->first = element;
|
head->first = element;
|
}
|
}
|
|
|
/* If this index is less than that of the current element, it goes someplace
|
/* If this index is less than that of the current element, it goes someplace
|
before the current element. */
|
before the current element. */
|
else if (indx < head->indx)
|
else if (indx < head->indx)
|
{
|
{
|
for (ptr = head->current;
|
for (ptr = head->current;
|
ptr->prev != 0 && ptr->prev->indx > indx;
|
ptr->prev != 0 && ptr->prev->indx > indx;
|
ptr = ptr->prev)
|
ptr = ptr->prev)
|
;
|
;
|
|
|
if (ptr->prev)
|
if (ptr->prev)
|
ptr->prev->next = element;
|
ptr->prev->next = element;
|
else
|
else
|
head->first = element;
|
head->first = element;
|
|
|
element->prev = ptr->prev;
|
element->prev = ptr->prev;
|
element->next = ptr;
|
element->next = ptr;
|
ptr->prev = element;
|
ptr->prev = element;
|
}
|
}
|
|
|
/* Otherwise, it must go someplace after the current element. */
|
/* Otherwise, it must go someplace after the current element. */
|
else
|
else
|
{
|
{
|
for (ptr = head->current;
|
for (ptr = head->current;
|
ptr->next != 0 && ptr->next->indx < indx;
|
ptr->next != 0 && ptr->next->indx < indx;
|
ptr = ptr->next)
|
ptr = ptr->next)
|
;
|
;
|
|
|
if (ptr->next)
|
if (ptr->next)
|
ptr->next->prev = element;
|
ptr->next->prev = element;
|
|
|
element->next = ptr->next;
|
element->next = ptr->next;
|
element->prev = ptr;
|
element->prev = ptr;
|
ptr->next = element;
|
ptr->next = element;
|
}
|
}
|
|
|
/* Set up so this is the first element searched. */
|
/* Set up so this is the first element searched. */
|
head->current = element;
|
head->current = element;
|
head->indx = indx;
|
head->indx = indx;
|
}
|
}
|
|
|
/* Insert a new uninitialized element into bitmap HEAD after element
|
/* Insert a new uninitialized element into bitmap HEAD after element
|
ELT. If ELT is NULL, insert the element at the start. Return the
|
ELT. If ELT is NULL, insert the element at the start. Return the
|
new element. */
|
new element. */
|
|
|
static bitmap_element *
|
static bitmap_element *
|
bitmap_elt_insert_after (bitmap head, bitmap_element *elt, unsigned int indx)
|
bitmap_elt_insert_after (bitmap head, bitmap_element *elt, unsigned int indx)
|
{
|
{
|
bitmap_element *node = bitmap_element_allocate (head);
|
bitmap_element *node = bitmap_element_allocate (head);
|
node->indx = indx;
|
node->indx = indx;
|
|
|
if (!elt)
|
if (!elt)
|
{
|
{
|
if (!head->current)
|
if (!head->current)
|
{
|
{
|
head->current = node;
|
head->current = node;
|
head->indx = indx;
|
head->indx = indx;
|
}
|
}
|
node->next = head->first;
|
node->next = head->first;
|
if (node->next)
|
if (node->next)
|
node->next->prev = node;
|
node->next->prev = node;
|
head->first = node;
|
head->first = node;
|
node->prev = NULL;
|
node->prev = NULL;
|
}
|
}
|
else
|
else
|
{
|
{
|
gcc_assert (head->current);
|
gcc_assert (head->current);
|
node->next = elt->next;
|
node->next = elt->next;
|
if (node->next)
|
if (node->next)
|
node->next->prev = node;
|
node->next->prev = node;
|
elt->next = node;
|
elt->next = node;
|
node->prev = elt;
|
node->prev = elt;
|
}
|
}
|
return node;
|
return node;
|
}
|
}
|
|
|
/* Copy a bitmap to another bitmap. */
|
/* Copy a bitmap to another bitmap. */
|
|
|
void
|
void
|
bitmap_copy (bitmap to, const_bitmap from)
|
bitmap_copy (bitmap to, const_bitmap from)
|
{
|
{
|
const bitmap_element *from_ptr;
|
const bitmap_element *from_ptr;
|
bitmap_element *to_ptr = 0;
|
bitmap_element *to_ptr = 0;
|
|
|
bitmap_clear (to);
|
bitmap_clear (to);
|
|
|
/* Copy elements in forward direction one at a time. */
|
/* Copy elements in forward direction one at a time. */
|
for (from_ptr = from->first; from_ptr; from_ptr = from_ptr->next)
|
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);
|
|
|
to_elt->indx = from_ptr->indx;
|
to_elt->indx = from_ptr->indx;
|
memcpy (to_elt->bits, from_ptr->bits, sizeof (to_elt->bits));
|
memcpy (to_elt->bits, from_ptr->bits, sizeof (to_elt->bits));
|
|
|
/* Here we have a special case of bitmap_element_link, for the case
|
/* Here we have a special case of bitmap_element_link, for the case
|
where we know the links are being entered in sequence. */
|
where we know the links are being entered in sequence. */
|
if (to_ptr == 0)
|
if (to_ptr == 0)
|
{
|
{
|
to->first = to->current = to_elt;
|
to->first = to->current = to_elt;
|
to->indx = from_ptr->indx;
|
to->indx = from_ptr->indx;
|
to_elt->next = to_elt->prev = 0;
|
to_elt->next = to_elt->prev = 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
to_elt->prev = to_ptr;
|
to_elt->prev = to_ptr;
|
to_elt->next = 0;
|
to_elt->next = 0;
|
to_ptr->next = to_elt;
|
to_ptr->next = to_elt;
|
}
|
}
|
|
|
to_ptr = to_elt;
|
to_ptr = to_elt;
|
}
|
}
|
}
|
}
|
|
|
/* Find a bitmap element that would hold a bitmap's bit.
|
/* Find a bitmap element that would hold a bitmap's bit.
|
Update the `current' field even if we can't find an element that
|
Update the `current' field even if we can't find an element that
|
would hold the bitmap's bit to make eventual allocation
|
would hold the bitmap's bit to make eventual allocation
|
faster. */
|
faster. */
|
|
|
static inline bitmap_element *
|
static inline bitmap_element *
|
bitmap_find_bit (bitmap head, unsigned int bit)
|
bitmap_find_bit (bitmap head, unsigned int bit)
|
{
|
{
|
bitmap_element *element;
|
bitmap_element *element;
|
unsigned int indx = bit / BITMAP_ELEMENT_ALL_BITS;
|
unsigned int indx = bit / BITMAP_ELEMENT_ALL_BITS;
|
|
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
head->desc->nsearches++;
|
head->desc->nsearches++;
|
#endif
|
#endif
|
if (head->current == 0
|
if (head->current == 0
|
|| head->indx == indx)
|
|| head->indx == indx)
|
return head->current;
|
return head->current;
|
|
|
if (head->indx < indx)
|
if (head->indx < indx)
|
/* INDX is beyond head->indx. Search from head->current
|
/* INDX is beyond head->indx. Search from head->current
|
forward. */
|
forward. */
|
for (element = head->current;
|
for (element = head->current;
|
element->next != 0 && element->indx < indx;
|
element->next != 0 && element->indx < indx;
|
element = element->next)
|
element = element->next)
|
;
|
;
|
|
|
else if (head->indx / 2 < indx)
|
else if (head->indx / 2 < indx)
|
/* INDX is less than head->indx and closer to head->indx than to
|
/* INDX is less than head->indx and closer to head->indx than to
|
0. Search from head->current backward. */
|
0. Search from head->current backward. */
|
for (element = head->current;
|
for (element = head->current;
|
element->prev != 0 && element->indx > indx;
|
element->prev != 0 && element->indx > indx;
|
element = element->prev)
|
element = element->prev)
|
;
|
;
|
|
|
else
|
else
|
/* INDX is less than head->indx and closer to 0 than to
|
/* INDX is less than head->indx and closer to 0 than to
|
head->indx. Search from head->first forward. */
|
head->indx. Search from head->first forward. */
|
for (element = head->first;
|
for (element = head->first;
|
element->next != 0 && element->indx < indx;
|
element->next != 0 && element->indx < indx;
|
element = element->next)
|
element = element->next)
|
;
|
;
|
|
|
/* `element' is the nearest to the one we want. If it's not the one we
|
/* `element' is the nearest to the one we want. If it's not the one we
|
want, the one we want doesn't exist. */
|
want, the one we want doesn't exist. */
|
head->current = element;
|
head->current = element;
|
head->indx = element->indx;
|
head->indx = element->indx;
|
if (element != 0 && element->indx != indx)
|
if (element != 0 && element->indx != indx)
|
element = 0;
|
element = 0;
|
|
|
return element;
|
return element;
|
}
|
}
|
|
|
/* Clear a single bit in a bitmap. Return true if the bit changed. */
|
/* Clear a single bit in a bitmap. Return true if the bit changed. */
|
|
|
bool
|
bool
|
bitmap_clear_bit (bitmap head, int bit)
|
bitmap_clear_bit (bitmap head, int bit)
|
{
|
{
|
bitmap_element *const ptr = bitmap_find_bit (head, bit);
|
bitmap_element *const ptr = bitmap_find_bit (head, bit);
|
|
|
if (ptr != 0)
|
if (ptr != 0)
|
{
|
{
|
unsigned bit_num = bit % BITMAP_WORD_BITS;
|
unsigned bit_num = bit % BITMAP_WORD_BITS;
|
unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num;
|
BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num;
|
bool res = (ptr->bits[word_num] & bit_val) != 0;
|
bool res = (ptr->bits[word_num] & bit_val) != 0;
|
if (res)
|
if (res)
|
ptr->bits[word_num] &= ~bit_val;
|
ptr->bits[word_num] &= ~bit_val;
|
|
|
/* If we cleared the entire word, free up the element. */
|
/* If we cleared the entire word, free up the element. */
|
if (bitmap_element_zerop (ptr))
|
if (bitmap_element_zerop (ptr))
|
bitmap_element_free (head, ptr);
|
bitmap_element_free (head, ptr);
|
|
|
return res;
|
return res;
|
}
|
}
|
|
|
return false;
|
return false;
|
}
|
}
|
|
|
/* Set a single bit in a bitmap. Return true if the bit changed. */
|
/* Set a single bit in a bitmap. Return true if the bit changed. */
|
|
|
bool
|
bool
|
bitmap_set_bit (bitmap head, int bit)
|
bitmap_set_bit (bitmap head, int bit)
|
{
|
{
|
bitmap_element *ptr = bitmap_find_bit (head, bit);
|
bitmap_element *ptr = bitmap_find_bit (head, bit);
|
unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
unsigned word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
unsigned bit_num = bit % BITMAP_WORD_BITS;
|
unsigned bit_num = bit % BITMAP_WORD_BITS;
|
BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num;
|
BITMAP_WORD bit_val = ((BITMAP_WORD) 1) << bit_num;
|
|
|
if (ptr == 0)
|
if (ptr == 0)
|
{
|
{
|
ptr = bitmap_element_allocate (head);
|
ptr = bitmap_element_allocate (head);
|
ptr->indx = bit / BITMAP_ELEMENT_ALL_BITS;
|
ptr->indx = bit / BITMAP_ELEMENT_ALL_BITS;
|
ptr->bits[word_num] = bit_val;
|
ptr->bits[word_num] = bit_val;
|
bitmap_element_link (head, ptr);
|
bitmap_element_link (head, ptr);
|
return true;
|
return true;
|
}
|
}
|
else
|
else
|
{
|
{
|
bool res = (ptr->bits[word_num] & bit_val) == 0;
|
bool res = (ptr->bits[word_num] & bit_val) == 0;
|
if (res)
|
if (res)
|
ptr->bits[word_num] |= bit_val;
|
ptr->bits[word_num] |= bit_val;
|
return res;
|
return res;
|
}
|
}
|
}
|
}
|
|
|
/* Return whether a bit is set within a bitmap. */
|
/* Return whether a bit is set within a bitmap. */
|
|
|
int
|
int
|
bitmap_bit_p (bitmap head, int bit)
|
bitmap_bit_p (bitmap head, int bit)
|
{
|
{
|
bitmap_element *ptr;
|
bitmap_element *ptr;
|
unsigned bit_num;
|
unsigned bit_num;
|
unsigned word_num;
|
unsigned word_num;
|
|
|
ptr = bitmap_find_bit (head, bit);
|
ptr = bitmap_find_bit (head, bit);
|
if (ptr == 0)
|
if (ptr == 0)
|
return 0;
|
return 0;
|
|
|
bit_num = bit % BITMAP_WORD_BITS;
|
bit_num = bit % BITMAP_WORD_BITS;
|
word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
word_num = bit / BITMAP_WORD_BITS % BITMAP_ELEMENT_WORDS;
|
|
|
return (ptr->bits[word_num] >> bit_num) & 1;
|
return (ptr->bits[word_num] >> bit_num) & 1;
|
}
|
}
|
|
|
#if GCC_VERSION < 3400
|
#if GCC_VERSION < 3400
|
/* Table of number of set bits in a character, indexed by value of char. */
|
/* Table of number of set bits in a character, indexed by value of char. */
|
static const unsigned char popcount_table[] =
|
static const unsigned char popcount_table[] =
|
{
|
{
|
0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
|
0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8,
|
3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8,
|
};
|
};
|
|
|
static unsigned long
|
static unsigned long
|
bitmap_popcount (BITMAP_WORD a)
|
bitmap_popcount (BITMAP_WORD a)
|
{
|
{
|
unsigned long ret = 0;
|
unsigned long ret = 0;
|
unsigned i;
|
unsigned i;
|
|
|
/* Just do this the table way for now */
|
/* Just do this the table way for now */
|
for (i = 0; i < BITMAP_WORD_BITS; i+= 8)
|
for (i = 0; i < BITMAP_WORD_BITS; i+= 8)
|
ret += popcount_table[(a >> i) & 0xff];
|
ret += popcount_table[(a >> i) & 0xff];
|
return ret;
|
return ret;
|
}
|
}
|
#endif
|
#endif
|
/* Count the number of bits set in the bitmap, and return it. */
|
/* Count the number of bits set in the bitmap, and return it. */
|
|
|
unsigned long
|
unsigned long
|
bitmap_count_bits (const_bitmap a)
|
bitmap_count_bits (const_bitmap a)
|
{
|
{
|
unsigned long count = 0;
|
unsigned long count = 0;
|
const bitmap_element *elt;
|
const bitmap_element *elt;
|
unsigned ix;
|
unsigned ix;
|
|
|
for (elt = a->first; elt; elt = elt->next)
|
for (elt = a->first; elt; elt = elt->next)
|
{
|
{
|
for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
|
for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
|
{
|
{
|
#if GCC_VERSION >= 3400
|
#if GCC_VERSION >= 3400
|
/* Note that popcountl matches BITMAP_WORD in type, so the actual size
|
/* Note that popcountl matches BITMAP_WORD in type, so the actual size
|
of BITMAP_WORD is not material. */
|
of BITMAP_WORD is not material. */
|
count += __builtin_popcountl (elt->bits[ix]);
|
count += __builtin_popcountl (elt->bits[ix]);
|
#else
|
#else
|
count += bitmap_popcount (elt->bits[ix]);
|
count += bitmap_popcount (elt->bits[ix]);
|
#endif
|
#endif
|
}
|
}
|
}
|
}
|
return count;
|
return count;
|
}
|
}
|
|
|
/* Return true if the bitmap has a single bit set. Otherwise return
|
/* Return true if the bitmap has a single bit set. Otherwise return
|
false. */
|
false. */
|
|
|
bool
|
bool
|
bitmap_single_bit_set_p (const_bitmap a)
|
bitmap_single_bit_set_p (const_bitmap a)
|
{
|
{
|
unsigned long count = 0;
|
unsigned long count = 0;
|
const bitmap_element *elt;
|
const bitmap_element *elt;
|
unsigned ix;
|
unsigned ix;
|
|
|
if (bitmap_empty_p (a))
|
if (bitmap_empty_p (a))
|
return false;
|
return false;
|
|
|
elt = a->first;
|
elt = a->first;
|
/* As there are no completely empty bitmap elements, a second one
|
/* As there are no completely empty bitmap elements, a second one
|
means we have more than one bit set. */
|
means we have more than one bit set. */
|
if (elt->next != NULL)
|
if (elt->next != NULL)
|
return false;
|
return false;
|
|
|
for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
|
for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
|
{
|
{
|
#if GCC_VERSION >= 3400
|
#if GCC_VERSION >= 3400
|
/* Note that popcountl matches BITMAP_WORD in type, so the actual size
|
/* Note that popcountl matches BITMAP_WORD in type, so the actual size
|
of BITMAP_WORD is not material. */
|
of BITMAP_WORD is not material. */
|
count += __builtin_popcountl (elt->bits[ix]);
|
count += __builtin_popcountl (elt->bits[ix]);
|
#else
|
#else
|
count += bitmap_popcount (elt->bits[ix]);
|
count += bitmap_popcount (elt->bits[ix]);
|
#endif
|
#endif
|
if (count > 1)
|
if (count > 1)
|
return false;
|
return false;
|
}
|
}
|
|
|
return count == 1;
|
return count == 1;
|
}
|
}
|
|
|
|
|
/* Return the bit number of the first set bit in the bitmap. The
|
/* Return the bit number of the first set bit in the bitmap. The
|
bitmap must be non-empty. */
|
bitmap must be non-empty. */
|
|
|
unsigned
|
unsigned
|
bitmap_first_set_bit (const_bitmap a)
|
bitmap_first_set_bit (const_bitmap a)
|
{
|
{
|
const bitmap_element *elt = a->first;
|
const bitmap_element *elt = a->first;
|
unsigned bit_no;
|
unsigned bit_no;
|
BITMAP_WORD word;
|
BITMAP_WORD word;
|
unsigned ix;
|
unsigned ix;
|
|
|
gcc_assert (elt);
|
gcc_assert (elt);
|
bit_no = elt->indx * BITMAP_ELEMENT_ALL_BITS;
|
bit_no = elt->indx * BITMAP_ELEMENT_ALL_BITS;
|
for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
|
for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
|
{
|
{
|
word = elt->bits[ix];
|
word = elt->bits[ix];
|
if (word)
|
if (word)
|
goto found_bit;
|
goto found_bit;
|
}
|
}
|
gcc_unreachable ();
|
gcc_unreachable ();
|
found_bit:
|
found_bit:
|
bit_no += ix * BITMAP_WORD_BITS;
|
bit_no += ix * BITMAP_WORD_BITS;
|
|
|
#if GCC_VERSION >= 3004
|
#if GCC_VERSION >= 3004
|
gcc_assert (sizeof(long) == sizeof (word));
|
gcc_assert (sizeof(long) == sizeof (word));
|
bit_no += __builtin_ctzl (word);
|
bit_no += __builtin_ctzl (word);
|
#else
|
#else
|
/* Binary search for the first set bit. */
|
/* Binary search for the first set bit. */
|
#if BITMAP_WORD_BITS > 64
|
#if BITMAP_WORD_BITS > 64
|
#error "Fill out the table."
|
#error "Fill out the table."
|
#endif
|
#endif
|
#if BITMAP_WORD_BITS > 32
|
#if BITMAP_WORD_BITS > 32
|
if (!(word & 0xffffffff))
|
if (!(word & 0xffffffff))
|
word >>= 32, bit_no += 32;
|
word >>= 32, bit_no += 32;
|
#endif
|
#endif
|
if (!(word & 0xffff))
|
if (!(word & 0xffff))
|
word >>= 16, bit_no += 16;
|
word >>= 16, bit_no += 16;
|
if (!(word & 0xff))
|
if (!(word & 0xff))
|
word >>= 8, bit_no += 8;
|
word >>= 8, bit_no += 8;
|
if (!(word & 0xf))
|
if (!(word & 0xf))
|
word >>= 4, bit_no += 4;
|
word >>= 4, bit_no += 4;
|
if (!(word & 0x3))
|
if (!(word & 0x3))
|
word >>= 2, bit_no += 2;
|
word >>= 2, bit_no += 2;
|
if (!(word & 0x1))
|
if (!(word & 0x1))
|
word >>= 1, bit_no += 1;
|
word >>= 1, bit_no += 1;
|
|
|
gcc_assert (word & 1);
|
gcc_assert (word & 1);
|
#endif
|
#endif
|
return bit_no;
|
return bit_no;
|
}
|
}
|
|
|
/* Return the bit number of the first set bit in the bitmap. The
|
/* Return the bit number of the first set bit in the bitmap. The
|
bitmap must be non-empty. */
|
bitmap must be non-empty. */
|
|
|
unsigned
|
unsigned
|
bitmap_last_set_bit (const_bitmap a)
|
bitmap_last_set_bit (const_bitmap a)
|
{
|
{
|
const bitmap_element *elt = a->current ? a->current : a->first;
|
const bitmap_element *elt = a->current ? a->current : a->first;
|
unsigned bit_no;
|
unsigned bit_no;
|
BITMAP_WORD word;
|
BITMAP_WORD word;
|
int ix;
|
int ix;
|
|
|
gcc_assert (elt);
|
gcc_assert (elt);
|
while (elt->next)
|
while (elt->next)
|
elt = elt->next;
|
elt = elt->next;
|
bit_no = elt->indx * BITMAP_ELEMENT_ALL_BITS;
|
bit_no = elt->indx * BITMAP_ELEMENT_ALL_BITS;
|
for (ix = BITMAP_ELEMENT_WORDS - 1; ix >= 0; ix--)
|
for (ix = BITMAP_ELEMENT_WORDS - 1; ix >= 0; ix--)
|
{
|
{
|
word = elt->bits[ix];
|
word = elt->bits[ix];
|
if (word)
|
if (word)
|
goto found_bit;
|
goto found_bit;
|
}
|
}
|
gcc_unreachable ();
|
gcc_unreachable ();
|
found_bit:
|
found_bit:
|
bit_no += ix * BITMAP_WORD_BITS;
|
bit_no += ix * BITMAP_WORD_BITS;
|
|
|
/* Binary search for the last set bit. */
|
/* Binary search for the last set bit. */
|
#if GCC_VERSION >= 3004
|
#if GCC_VERSION >= 3004
|
gcc_assert (sizeof(long) == sizeof (word));
|
gcc_assert (sizeof(long) == sizeof (word));
|
bit_no += sizeof (long) * 8 - __builtin_ctzl (word);
|
bit_no += sizeof (long) * 8 - __builtin_ctzl (word);
|
#else
|
#else
|
#if BITMAP_WORD_BITS > 64
|
#if BITMAP_WORD_BITS > 64
|
#error "Fill out the table."
|
#error "Fill out the table."
|
#endif
|
#endif
|
#if BITMAP_WORD_BITS > 32
|
#if BITMAP_WORD_BITS > 32
|
if ((word & 0xffffffff00000000))
|
if ((word & 0xffffffff00000000))
|
word >>= 32, bit_no += 32;
|
word >>= 32, bit_no += 32;
|
#endif
|
#endif
|
if (word & 0xffff0000)
|
if (word & 0xffff0000)
|
word >>= 16, bit_no += 16;
|
word >>= 16, bit_no += 16;
|
if (!(word & 0xff00))
|
if (!(word & 0xff00))
|
word >>= 8, bit_no += 8;
|
word >>= 8, bit_no += 8;
|
if (!(word & 0xf0))
|
if (!(word & 0xf0))
|
word >>= 4, bit_no += 4;
|
word >>= 4, bit_no += 4;
|
if (!(word & 12))
|
if (!(word & 12))
|
word >>= 2, bit_no += 2;
|
word >>= 2, bit_no += 2;
|
if (!(word & 2))
|
if (!(word & 2))
|
word >>= 1, bit_no += 1;
|
word >>= 1, bit_no += 1;
|
#endif
|
#endif
|
|
|
gcc_assert (word & 1);
|
gcc_assert (word & 1);
|
return bit_no;
|
return bit_no;
|
}
|
}
|
|
|
|
|
/* DST = A & B. */
|
/* DST = A & B. */
|
|
|
void
|
void
|
bitmap_and (bitmap dst, const_bitmap a, const_bitmap b)
|
bitmap_and (bitmap dst, const_bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *dst_elt = dst->first;
|
bitmap_element *dst_elt = dst->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *dst_prev = NULL;
|
bitmap_element *dst_prev = NULL;
|
|
|
gcc_assert (dst != a && dst != b);
|
gcc_assert (dst != a && dst != b);
|
|
|
if (a == b)
|
if (a == b)
|
{
|
{
|
bitmap_copy (dst, a);
|
bitmap_copy (dst, a);
|
return;
|
return;
|
}
|
}
|
|
|
while (a_elt && b_elt)
|
while (a_elt && b_elt)
|
{
|
{
|
if (a_elt->indx < b_elt->indx)
|
if (a_elt->indx < b_elt->indx)
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
else if (b_elt->indx < a_elt->indx)
|
else if (b_elt->indx < a_elt->indx)
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
else
|
else
|
{
|
{
|
/* Matching elts, generate A & B. */
|
/* Matching elts, generate A & B. */
|
unsigned ix;
|
unsigned ix;
|
BITMAP_WORD ior = 0;
|
BITMAP_WORD ior = 0;
|
|
|
if (!dst_elt)
|
if (!dst_elt)
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx);
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx);
|
else
|
else
|
dst_elt->indx = a_elt->indx;
|
dst_elt->indx = a_elt->indx;
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
|
|
|
dst_elt->bits[ix] = r;
|
dst_elt->bits[ix] = r;
|
ior |= r;
|
ior |= r;
|
}
|
}
|
if (ior)
|
if (ior)
|
{
|
{
|
dst_prev = dst_elt;
|
dst_prev = dst_elt;
|
dst_elt = dst_elt->next;
|
dst_elt = dst_elt->next;
|
}
|
}
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
}
|
}
|
/* Ensure that dst->current is valid. */
|
/* Ensure that dst->current is valid. */
|
dst->current = dst->first;
|
dst->current = dst->first;
|
bitmap_elt_clear_from (dst, dst_elt);
|
bitmap_elt_clear_from (dst, dst_elt);
|
gcc_assert (!dst->current == !dst->first);
|
gcc_assert (!dst->current == !dst->first);
|
if (dst->current)
|
if (dst->current)
|
dst->indx = dst->current->indx;
|
dst->indx = dst->current->indx;
|
}
|
}
|
|
|
/* A &= B. */
|
/* A &= B. */
|
|
|
void
|
void
|
bitmap_and_into (bitmap a, const_bitmap b)
|
bitmap_and_into (bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *a_elt = a->first;
|
bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *next;
|
bitmap_element *next;
|
|
|
if (a == b)
|
if (a == b)
|
return;
|
return;
|
|
|
while (a_elt && b_elt)
|
while (a_elt && b_elt)
|
{
|
{
|
if (a_elt->indx < b_elt->indx)
|
if (a_elt->indx < b_elt->indx)
|
{
|
{
|
next = a_elt->next;
|
next = a_elt->next;
|
bitmap_element_free (a, a_elt);
|
bitmap_element_free (a, a_elt);
|
a_elt = next;
|
a_elt = next;
|
}
|
}
|
else if (b_elt->indx < a_elt->indx)
|
else if (b_elt->indx < a_elt->indx)
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
else
|
else
|
{
|
{
|
/* Matching elts, generate A &= B. */
|
/* Matching elts, generate A &= B. */
|
unsigned ix;
|
unsigned ix;
|
BITMAP_WORD ior = 0;
|
BITMAP_WORD ior = 0;
|
|
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] & b_elt->bits[ix];
|
|
|
a_elt->bits[ix] = r;
|
a_elt->bits[ix] = r;
|
ior |= r;
|
ior |= r;
|
}
|
}
|
next = a_elt->next;
|
next = a_elt->next;
|
if (!ior)
|
if (!ior)
|
bitmap_element_free (a, a_elt);
|
bitmap_element_free (a, a_elt);
|
a_elt = next;
|
a_elt = next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
}
|
}
|
bitmap_elt_clear_from (a, a_elt);
|
bitmap_elt_clear_from (a, a_elt);
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current || a->indx == a->current->indx);
|
gcc_assert (!a->current || a->indx == a->current->indx);
|
}
|
}
|
|
|
|
|
/* Insert an element equal to SRC_ELT after DST_PREV, overwriting DST_ELT
|
/* Insert an element equal to SRC_ELT after DST_PREV, overwriting DST_ELT
|
if non-NULL. CHANGED is true if the destination bitmap had already been
|
if non-NULL. CHANGED is true if the destination bitmap had already been
|
changed; the new value of CHANGED is returned. */
|
changed; the new value of CHANGED is returned. */
|
|
|
static inline bool
|
static inline bool
|
bitmap_elt_copy (bitmap dst, bitmap_element *dst_elt, bitmap_element *dst_prev,
|
bitmap_elt_copy (bitmap dst, bitmap_element *dst_elt, bitmap_element *dst_prev,
|
const bitmap_element *src_elt, bool changed)
|
const bitmap_element *src_elt, bool changed)
|
{
|
{
|
if (!changed && dst_elt && dst_elt->indx == src_elt->indx)
|
if (!changed && dst_elt && dst_elt->indx == src_elt->indx)
|
{
|
{
|
unsigned ix;
|
unsigned ix;
|
|
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
if (src_elt->bits[ix] != dst_elt->bits[ix])
|
if (src_elt->bits[ix] != dst_elt->bits[ix])
|
{
|
{
|
dst_elt->bits[ix] = src_elt->bits[ix];
|
dst_elt->bits[ix] = src_elt->bits[ix];
|
changed = true;
|
changed = true;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
changed = true;
|
changed = true;
|
if (!dst_elt)
|
if (!dst_elt)
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, src_elt->indx);
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, src_elt->indx);
|
else
|
else
|
dst_elt->indx = src_elt->indx;
|
dst_elt->indx = src_elt->indx;
|
memcpy (dst_elt->bits, src_elt->bits, sizeof (dst_elt->bits));
|
memcpy (dst_elt->bits, src_elt->bits, sizeof (dst_elt->bits));
|
}
|
}
|
return changed;
|
return changed;
|
}
|
}
|
|
|
|
|
|
|
/* DST = A & ~B */
|
/* DST = A & ~B */
|
|
|
bool
|
bool
|
bitmap_and_compl (bitmap dst, const_bitmap a, const_bitmap b)
|
bitmap_and_compl (bitmap dst, const_bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *dst_elt = dst->first;
|
bitmap_element *dst_elt = dst->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *dst_prev = NULL;
|
bitmap_element *dst_prev = NULL;
|
bitmap_element **dst_prev_pnext = &dst->first;
|
bitmap_element **dst_prev_pnext = &dst->first;
|
bool changed = false;
|
bool changed = false;
|
|
|
gcc_assert (dst != a && dst != b);
|
gcc_assert (dst != a && dst != b);
|
|
|
if (a == b)
|
if (a == b)
|
{
|
{
|
changed = !bitmap_empty_p (dst);
|
changed = !bitmap_empty_p (dst);
|
bitmap_clear (dst);
|
bitmap_clear (dst);
|
return changed;
|
return changed;
|
}
|
}
|
|
|
while (a_elt)
|
while (a_elt)
|
{
|
{
|
while (b_elt && b_elt->indx < a_elt->indx)
|
while (b_elt && b_elt->indx < a_elt->indx)
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
|
|
if (!b_elt || b_elt->indx > a_elt->indx)
|
if (!b_elt || b_elt->indx > a_elt->indx)
|
{
|
{
|
changed = bitmap_elt_copy (dst, dst_elt, dst_prev, a_elt, changed);
|
changed = bitmap_elt_copy (dst, dst_elt, dst_prev, a_elt, changed);
|
dst_prev = *dst_prev_pnext;
|
dst_prev = *dst_prev_pnext;
|
dst_prev_pnext = &dst_prev->next;
|
dst_prev_pnext = &dst_prev->next;
|
dst_elt = *dst_prev_pnext;
|
dst_elt = *dst_prev_pnext;
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
}
|
}
|
|
|
else
|
else
|
{
|
{
|
/* Matching elts, generate A & ~B. */
|
/* Matching elts, generate A & ~B. */
|
unsigned ix;
|
unsigned ix;
|
BITMAP_WORD ior = 0;
|
BITMAP_WORD ior = 0;
|
|
|
if (!changed && dst_elt && dst_elt->indx == a_elt->indx)
|
if (!changed && dst_elt && dst_elt->indx == a_elt->indx)
|
{
|
{
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix];
|
|
|
if (dst_elt->bits[ix] != r)
|
if (dst_elt->bits[ix] != r)
|
{
|
{
|
changed = true;
|
changed = true;
|
dst_elt->bits[ix] = r;
|
dst_elt->bits[ix] = r;
|
}
|
}
|
ior |= r;
|
ior |= r;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
bool new_element;
|
bool new_element;
|
if (!dst_elt || dst_elt->indx > a_elt->indx)
|
if (!dst_elt || dst_elt->indx > a_elt->indx)
|
{
|
{
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx);
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx);
|
new_element = true;
|
new_element = true;
|
}
|
}
|
else
|
else
|
{
|
{
|
dst_elt->indx = a_elt->indx;
|
dst_elt->indx = a_elt->indx;
|
new_element = false;
|
new_element = false;
|
}
|
}
|
|
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] & ~b_elt->bits[ix];
|
|
|
dst_elt->bits[ix] = r;
|
dst_elt->bits[ix] = r;
|
ior |= r;
|
ior |= r;
|
}
|
}
|
|
|
if (ior)
|
if (ior)
|
changed = true;
|
changed = true;
|
else
|
else
|
{
|
{
|
changed |= !new_element;
|
changed |= !new_element;
|
bitmap_element_free (dst, dst_elt);
|
bitmap_element_free (dst, dst_elt);
|
dst_elt = *dst_prev_pnext;
|
dst_elt = *dst_prev_pnext;
|
}
|
}
|
}
|
}
|
|
|
if (ior)
|
if (ior)
|
{
|
{
|
dst_prev = *dst_prev_pnext;
|
dst_prev = *dst_prev_pnext;
|
dst_prev_pnext = &dst_prev->next;
|
dst_prev_pnext = &dst_prev->next;
|
dst_elt = *dst_prev_pnext;
|
dst_elt = *dst_prev_pnext;
|
}
|
}
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
}
|
}
|
|
|
/* Ensure that dst->current is valid. */
|
/* Ensure that dst->current is valid. */
|
dst->current = dst->first;
|
dst->current = dst->first;
|
|
|
if (dst_elt)
|
if (dst_elt)
|
{
|
{
|
changed = true;
|
changed = true;
|
bitmap_elt_clear_from (dst, dst_elt);
|
bitmap_elt_clear_from (dst, dst_elt);
|
}
|
}
|
gcc_assert (!dst->current == !dst->first);
|
gcc_assert (!dst->current == !dst->first);
|
if (dst->current)
|
if (dst->current)
|
dst->indx = dst->current->indx;
|
dst->indx = dst->current->indx;
|
|
|
return changed;
|
return changed;
|
}
|
}
|
|
|
/* A &= ~B. Returns true if A changes */
|
/* A &= ~B. Returns true if A changes */
|
|
|
bool
|
bool
|
bitmap_and_compl_into (bitmap a, const_bitmap b)
|
bitmap_and_compl_into (bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *a_elt = a->first;
|
bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *next;
|
bitmap_element *next;
|
BITMAP_WORD changed = 0;
|
BITMAP_WORD changed = 0;
|
|
|
if (a == b)
|
if (a == b)
|
{
|
{
|
if (bitmap_empty_p (a))
|
if (bitmap_empty_p (a))
|
return false;
|
return false;
|
else
|
else
|
{
|
{
|
bitmap_clear (a);
|
bitmap_clear (a);
|
return true;
|
return true;
|
}
|
}
|
}
|
}
|
|
|
while (a_elt && b_elt)
|
while (a_elt && b_elt)
|
{
|
{
|
if (a_elt->indx < b_elt->indx)
|
if (a_elt->indx < b_elt->indx)
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
else if (b_elt->indx < a_elt->indx)
|
else if (b_elt->indx < a_elt->indx)
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
else
|
else
|
{
|
{
|
/* Matching elts, generate A &= ~B. */
|
/* Matching elts, generate A &= ~B. */
|
unsigned ix;
|
unsigned ix;
|
BITMAP_WORD ior = 0;
|
BITMAP_WORD ior = 0;
|
|
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix];
|
BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] ^ cleared;
|
BITMAP_WORD r = a_elt->bits[ix] ^ cleared;
|
|
|
a_elt->bits[ix] = r;
|
a_elt->bits[ix] = r;
|
changed |= cleared;
|
changed |= cleared;
|
ior |= r;
|
ior |= r;
|
}
|
}
|
next = a_elt->next;
|
next = a_elt->next;
|
if (!ior)
|
if (!ior)
|
bitmap_element_free (a, a_elt);
|
bitmap_element_free (a, a_elt);
|
a_elt = next;
|
a_elt = next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
}
|
}
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current || a->indx == a->current->indx);
|
gcc_assert (!a->current || a->indx == a->current->indx);
|
return changed != 0;
|
return changed != 0;
|
}
|
}
|
|
|
/* Set COUNT bits from START in HEAD. */
|
/* Set COUNT bits from START in HEAD. */
|
void
|
void
|
bitmap_set_range (bitmap head, unsigned int start, unsigned int count)
|
bitmap_set_range (bitmap head, unsigned int start, unsigned int count)
|
{
|
{
|
unsigned int first_index, end_bit_plus1, last_index;
|
unsigned int first_index, end_bit_plus1, last_index;
|
bitmap_element *elt, *elt_prev;
|
bitmap_element *elt, *elt_prev;
|
unsigned int i;
|
unsigned int i;
|
|
|
if (!count)
|
if (!count)
|
return;
|
return;
|
|
|
first_index = start / BITMAP_ELEMENT_ALL_BITS;
|
first_index = start / BITMAP_ELEMENT_ALL_BITS;
|
end_bit_plus1 = start + count;
|
end_bit_plus1 = start + count;
|
last_index = (end_bit_plus1 - 1) / BITMAP_ELEMENT_ALL_BITS;
|
last_index = (end_bit_plus1 - 1) / BITMAP_ELEMENT_ALL_BITS;
|
elt = bitmap_find_bit (head, start);
|
elt = bitmap_find_bit (head, start);
|
|
|
/* If bitmap_find_bit returns zero, the current is the closest block
|
/* If bitmap_find_bit returns zero, the current is the closest block
|
to the result. Otherwise, just use bitmap_element_allocate to
|
to the result. Otherwise, just use bitmap_element_allocate to
|
ensure ELT is set; in the loop below, ELT == NULL means "insert
|
ensure ELT is set; in the loop below, ELT == NULL means "insert
|
at the end of the bitmap". */
|
at the end of the bitmap". */
|
if (!elt)
|
if (!elt)
|
{
|
{
|
elt = bitmap_element_allocate (head);
|
elt = bitmap_element_allocate (head);
|
elt->indx = first_index;
|
elt->indx = first_index;
|
bitmap_element_link (head, elt);
|
bitmap_element_link (head, elt);
|
}
|
}
|
|
|
gcc_assert (elt->indx == first_index);
|
gcc_assert (elt->indx == first_index);
|
elt_prev = elt->prev;
|
elt_prev = elt->prev;
|
for (i = first_index; i <= last_index; i++)
|
for (i = first_index; i <= last_index; i++)
|
{
|
{
|
unsigned elt_start_bit = i * BITMAP_ELEMENT_ALL_BITS;
|
unsigned elt_start_bit = i * BITMAP_ELEMENT_ALL_BITS;
|
unsigned elt_end_bit_plus1 = elt_start_bit + BITMAP_ELEMENT_ALL_BITS;
|
unsigned elt_end_bit_plus1 = elt_start_bit + BITMAP_ELEMENT_ALL_BITS;
|
|
|
unsigned int first_word_to_mod;
|
unsigned int first_word_to_mod;
|
BITMAP_WORD first_mask;
|
BITMAP_WORD first_mask;
|
unsigned int last_word_to_mod;
|
unsigned int last_word_to_mod;
|
BITMAP_WORD last_mask;
|
BITMAP_WORD last_mask;
|
unsigned int ix;
|
unsigned int ix;
|
|
|
if (!elt || elt->indx != i)
|
if (!elt || elt->indx != i)
|
elt = bitmap_elt_insert_after (head, elt_prev, i);
|
elt = bitmap_elt_insert_after (head, elt_prev, i);
|
|
|
if (elt_start_bit <= start)
|
if (elt_start_bit <= start)
|
{
|
{
|
/* The first bit to turn on is somewhere inside this
|
/* The first bit to turn on is somewhere inside this
|
elt. */
|
elt. */
|
first_word_to_mod = (start - elt_start_bit) / BITMAP_WORD_BITS;
|
first_word_to_mod = (start - elt_start_bit) / BITMAP_WORD_BITS;
|
|
|
/* This mask should have 1s in all bits >= start position. */
|
/* This mask should have 1s in all bits >= start position. */
|
first_mask =
|
first_mask =
|
(((BITMAP_WORD) 1) << ((start % BITMAP_WORD_BITS))) - 1;
|
(((BITMAP_WORD) 1) << ((start % BITMAP_WORD_BITS))) - 1;
|
first_mask = ~first_mask;
|
first_mask = ~first_mask;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* The first bit to turn on is below this start of this elt. */
|
/* The first bit to turn on is below this start of this elt. */
|
first_word_to_mod = 0;
|
first_word_to_mod = 0;
|
first_mask = ~(BITMAP_WORD) 0;
|
first_mask = ~(BITMAP_WORD) 0;
|
}
|
}
|
|
|
if (elt_end_bit_plus1 <= end_bit_plus1)
|
if (elt_end_bit_plus1 <= end_bit_plus1)
|
{
|
{
|
/* The last bit to turn on is beyond this elt. */
|
/* The last bit to turn on is beyond this elt. */
|
last_word_to_mod = BITMAP_ELEMENT_WORDS - 1;
|
last_word_to_mod = BITMAP_ELEMENT_WORDS - 1;
|
last_mask = ~(BITMAP_WORD) 0;
|
last_mask = ~(BITMAP_WORD) 0;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* The last bit to turn on is inside to this elt. */
|
/* The last bit to turn on is inside to this elt. */
|
last_word_to_mod =
|
last_word_to_mod =
|
(end_bit_plus1 - elt_start_bit) / BITMAP_WORD_BITS;
|
(end_bit_plus1 - elt_start_bit) / BITMAP_WORD_BITS;
|
|
|
/* The last mask should have 1s below the end bit. */
|
/* The last mask should have 1s below the end bit. */
|
last_mask =
|
last_mask =
|
(((BITMAP_WORD) 1) << ((end_bit_plus1 % BITMAP_WORD_BITS))) - 1;
|
(((BITMAP_WORD) 1) << ((end_bit_plus1 % BITMAP_WORD_BITS))) - 1;
|
}
|
}
|
|
|
if (first_word_to_mod == last_word_to_mod)
|
if (first_word_to_mod == last_word_to_mod)
|
{
|
{
|
BITMAP_WORD mask = first_mask & last_mask;
|
BITMAP_WORD mask = first_mask & last_mask;
|
elt->bits[first_word_to_mod] |= mask;
|
elt->bits[first_word_to_mod] |= mask;
|
}
|
}
|
else
|
else
|
{
|
{
|
elt->bits[first_word_to_mod] |= first_mask;
|
elt->bits[first_word_to_mod] |= first_mask;
|
if (BITMAP_ELEMENT_WORDS > 2)
|
if (BITMAP_ELEMENT_WORDS > 2)
|
for (ix = first_word_to_mod + 1; ix < last_word_to_mod; ix++)
|
for (ix = first_word_to_mod + 1; ix < last_word_to_mod; ix++)
|
elt->bits[ix] = ~(BITMAP_WORD) 0;
|
elt->bits[ix] = ~(BITMAP_WORD) 0;
|
elt->bits[last_word_to_mod] |= last_mask;
|
elt->bits[last_word_to_mod] |= last_mask;
|
}
|
}
|
|
|
elt_prev = elt;
|
elt_prev = elt;
|
elt = elt->next;
|
elt = elt->next;
|
}
|
}
|
|
|
head->current = elt ? elt : elt_prev;
|
head->current = elt ? elt : elt_prev;
|
head->indx = head->current->indx;
|
head->indx = head->current->indx;
|
}
|
}
|
|
|
/* Clear COUNT bits from START in HEAD. */
|
/* Clear COUNT bits from START in HEAD. */
|
void
|
void
|
bitmap_clear_range (bitmap head, unsigned int start, unsigned int count)
|
bitmap_clear_range (bitmap head, unsigned int start, unsigned int count)
|
{
|
{
|
unsigned int first_index, end_bit_plus1, last_index;
|
unsigned int first_index, end_bit_plus1, last_index;
|
bitmap_element *elt;
|
bitmap_element *elt;
|
|
|
if (!count)
|
if (!count)
|
return;
|
return;
|
|
|
first_index = start / BITMAP_ELEMENT_ALL_BITS;
|
first_index = start / BITMAP_ELEMENT_ALL_BITS;
|
end_bit_plus1 = start + count;
|
end_bit_plus1 = start + count;
|
last_index = (end_bit_plus1 - 1) / BITMAP_ELEMENT_ALL_BITS;
|
last_index = (end_bit_plus1 - 1) / BITMAP_ELEMENT_ALL_BITS;
|
elt = bitmap_find_bit (head, start);
|
elt = bitmap_find_bit (head, start);
|
|
|
/* If bitmap_find_bit returns zero, the current is the closest block
|
/* If bitmap_find_bit returns zero, the current is the closest block
|
to the result. If the current is less than first index, find the
|
to the result. If the current is less than first index, find the
|
next one. Otherwise, just set elt to be current. */
|
next one. Otherwise, just set elt to be current. */
|
if (!elt)
|
if (!elt)
|
{
|
{
|
if (head->current)
|
if (head->current)
|
{
|
{
|
if (head->indx < first_index)
|
if (head->indx < first_index)
|
{
|
{
|
elt = head->current->next;
|
elt = head->current->next;
|
if (!elt)
|
if (!elt)
|
return;
|
return;
|
}
|
}
|
else
|
else
|
elt = head->current;
|
elt = head->current;
|
}
|
}
|
else
|
else
|
return;
|
return;
|
}
|
}
|
|
|
while (elt && (elt->indx <= last_index))
|
while (elt && (elt->indx <= last_index))
|
{
|
{
|
bitmap_element * next_elt = elt->next;
|
bitmap_element * next_elt = elt->next;
|
unsigned elt_start_bit = (elt->indx) * BITMAP_ELEMENT_ALL_BITS;
|
unsigned elt_start_bit = (elt->indx) * BITMAP_ELEMENT_ALL_BITS;
|
unsigned elt_end_bit_plus1 = elt_start_bit + BITMAP_ELEMENT_ALL_BITS;
|
unsigned elt_end_bit_plus1 = elt_start_bit + BITMAP_ELEMENT_ALL_BITS;
|
|
|
|
|
if (elt_start_bit >= start && elt_end_bit_plus1 <= end_bit_plus1)
|
if (elt_start_bit >= start && elt_end_bit_plus1 <= end_bit_plus1)
|
/* Get rid of the entire elt and go to the next one. */
|
/* Get rid of the entire elt and go to the next one. */
|
bitmap_element_free (head, elt);
|
bitmap_element_free (head, elt);
|
else
|
else
|
{
|
{
|
/* Going to have to knock out some bits in this elt. */
|
/* Going to have to knock out some bits in this elt. */
|
unsigned int first_word_to_mod;
|
unsigned int first_word_to_mod;
|
BITMAP_WORD first_mask;
|
BITMAP_WORD first_mask;
|
unsigned int last_word_to_mod;
|
unsigned int last_word_to_mod;
|
BITMAP_WORD last_mask;
|
BITMAP_WORD last_mask;
|
unsigned int i;
|
unsigned int i;
|
bool clear = true;
|
bool clear = true;
|
|
|
if (elt_start_bit <= start)
|
if (elt_start_bit <= start)
|
{
|
{
|
/* The first bit to turn off is somewhere inside this
|
/* The first bit to turn off is somewhere inside this
|
elt. */
|
elt. */
|
first_word_to_mod = (start - elt_start_bit) / BITMAP_WORD_BITS;
|
first_word_to_mod = (start - elt_start_bit) / BITMAP_WORD_BITS;
|
|
|
/* This mask should have 1s in all bits >= start position. */
|
/* This mask should have 1s in all bits >= start position. */
|
first_mask =
|
first_mask =
|
(((BITMAP_WORD) 1) << ((start % BITMAP_WORD_BITS))) - 1;
|
(((BITMAP_WORD) 1) << ((start % BITMAP_WORD_BITS))) - 1;
|
first_mask = ~first_mask;
|
first_mask = ~first_mask;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* The first bit to turn off is below this start of this elt. */
|
/* The first bit to turn off is below this start of this elt. */
|
first_word_to_mod = 0;
|
first_word_to_mod = 0;
|
first_mask = 0;
|
first_mask = 0;
|
first_mask = ~first_mask;
|
first_mask = ~first_mask;
|
}
|
}
|
|
|
if (elt_end_bit_plus1 <= end_bit_plus1)
|
if (elt_end_bit_plus1 <= end_bit_plus1)
|
{
|
{
|
/* The last bit to turn off is beyond this elt. */
|
/* The last bit to turn off is beyond this elt. */
|
last_word_to_mod = BITMAP_ELEMENT_WORDS - 1;
|
last_word_to_mod = BITMAP_ELEMENT_WORDS - 1;
|
last_mask = 0;
|
last_mask = 0;
|
last_mask = ~last_mask;
|
last_mask = ~last_mask;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* The last bit to turn off is inside to this elt. */
|
/* The last bit to turn off is inside to this elt. */
|
last_word_to_mod =
|
last_word_to_mod =
|
(end_bit_plus1 - elt_start_bit) / BITMAP_WORD_BITS;
|
(end_bit_plus1 - elt_start_bit) / BITMAP_WORD_BITS;
|
|
|
/* The last mask should have 1s below the end bit. */
|
/* The last mask should have 1s below the end bit. */
|
last_mask =
|
last_mask =
|
(((BITMAP_WORD) 1) << (((end_bit_plus1) % BITMAP_WORD_BITS))) - 1;
|
(((BITMAP_WORD) 1) << (((end_bit_plus1) % BITMAP_WORD_BITS))) - 1;
|
}
|
}
|
|
|
|
|
if (first_word_to_mod == last_word_to_mod)
|
if (first_word_to_mod == last_word_to_mod)
|
{
|
{
|
BITMAP_WORD mask = first_mask & last_mask;
|
BITMAP_WORD mask = first_mask & last_mask;
|
elt->bits[first_word_to_mod] &= ~mask;
|
elt->bits[first_word_to_mod] &= ~mask;
|
}
|
}
|
else
|
else
|
{
|
{
|
elt->bits[first_word_to_mod] &= ~first_mask;
|
elt->bits[first_word_to_mod] &= ~first_mask;
|
if (BITMAP_ELEMENT_WORDS > 2)
|
if (BITMAP_ELEMENT_WORDS > 2)
|
for (i = first_word_to_mod + 1; i < last_word_to_mod; i++)
|
for (i = first_word_to_mod + 1; i < last_word_to_mod; i++)
|
elt->bits[i] = 0;
|
elt->bits[i] = 0;
|
elt->bits[last_word_to_mod] &= ~last_mask;
|
elt->bits[last_word_to_mod] &= ~last_mask;
|
}
|
}
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
if (elt->bits[i])
|
if (elt->bits[i])
|
{
|
{
|
clear = false;
|
clear = false;
|
break;
|
break;
|
}
|
}
|
/* Check to see if there are any bits left. */
|
/* Check to see if there are any bits left. */
|
if (clear)
|
if (clear)
|
bitmap_element_free (head, elt);
|
bitmap_element_free (head, elt);
|
}
|
}
|
elt = next_elt;
|
elt = next_elt;
|
}
|
}
|
|
|
if (elt)
|
if (elt)
|
{
|
{
|
head->current = elt;
|
head->current = elt;
|
head->indx = head->current->indx;
|
head->indx = head->current->indx;
|
}
|
}
|
}
|
}
|
|
|
/* A = ~A & B. */
|
/* A = ~A & B. */
|
|
|
void
|
void
|
bitmap_compl_and_into (bitmap a, const_bitmap b)
|
bitmap_compl_and_into (bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *a_elt = a->first;
|
bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *a_prev = NULL;
|
bitmap_element *a_prev = NULL;
|
bitmap_element *next;
|
bitmap_element *next;
|
|
|
gcc_assert (a != b);
|
gcc_assert (a != b);
|
|
|
if (bitmap_empty_p (a))
|
if (bitmap_empty_p (a))
|
{
|
{
|
bitmap_copy (a, b);
|
bitmap_copy (a, b);
|
return;
|
return;
|
}
|
}
|
if (bitmap_empty_p (b))
|
if (bitmap_empty_p (b))
|
{
|
{
|
bitmap_clear (a);
|
bitmap_clear (a);
|
return;
|
return;
|
}
|
}
|
|
|
while (a_elt || b_elt)
|
while (a_elt || b_elt)
|
{
|
{
|
if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
|
if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
|
{
|
{
|
/* A is before B. Remove A */
|
/* A is before B. Remove A */
|
next = a_elt->next;
|
next = a_elt->next;
|
a_prev = a_elt->prev;
|
a_prev = a_elt->prev;
|
bitmap_element_free (a, a_elt);
|
bitmap_element_free (a, a_elt);
|
a_elt = next;
|
a_elt = next;
|
}
|
}
|
else if (!a_elt || b_elt->indx < a_elt->indx)
|
else if (!a_elt || b_elt->indx < a_elt->indx)
|
{
|
{
|
/* B is before A. Copy B. */
|
/* B is before A. Copy B. */
|
next = bitmap_elt_insert_after (a, a_prev, b_elt->indx);
|
next = bitmap_elt_insert_after (a, a_prev, b_elt->indx);
|
memcpy (next->bits, b_elt->bits, sizeof (next->bits));
|
memcpy (next->bits, b_elt->bits, sizeof (next->bits));
|
a_prev = next;
|
a_prev = next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Matching elts, generate A = ~A & B. */
|
/* Matching elts, generate A = ~A & B. */
|
unsigned ix;
|
unsigned ix;
|
BITMAP_WORD ior = 0;
|
BITMAP_WORD ior = 0;
|
|
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix];
|
BITMAP_WORD cleared = a_elt->bits[ix] & b_elt->bits[ix];
|
BITMAP_WORD r = b_elt->bits[ix] ^ cleared;
|
BITMAP_WORD r = b_elt->bits[ix] ^ cleared;
|
|
|
a_elt->bits[ix] = r;
|
a_elt->bits[ix] = r;
|
ior |= r;
|
ior |= r;
|
}
|
}
|
next = a_elt->next;
|
next = a_elt->next;
|
if (!ior)
|
if (!ior)
|
bitmap_element_free (a, a_elt);
|
bitmap_element_free (a, a_elt);
|
else
|
else
|
a_prev = a_elt;
|
a_prev = a_elt;
|
a_elt = next;
|
a_elt = next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
}
|
}
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current || a->indx == a->current->indx);
|
gcc_assert (!a->current || a->indx == a->current->indx);
|
return;
|
return;
|
}
|
}
|
|
|
|
|
/* Insert an element corresponding to A_ELT | B_ELT after DST_PREV,
|
/* Insert an element corresponding to A_ELT | B_ELT after DST_PREV,
|
overwriting DST_ELT if non-NULL. CHANGED is true if the destination bitmap
|
overwriting DST_ELT if non-NULL. CHANGED is true if the destination bitmap
|
had already been changed; the new value of CHANGED is returned. */
|
had already been changed; the new value of CHANGED is returned. */
|
|
|
static inline bool
|
static inline bool
|
bitmap_elt_ior (bitmap dst, bitmap_element *dst_elt, bitmap_element *dst_prev,
|
bitmap_elt_ior (bitmap dst, bitmap_element *dst_elt, bitmap_element *dst_prev,
|
const bitmap_element *a_elt, const bitmap_element *b_elt,
|
const bitmap_element *a_elt, const bitmap_element *b_elt,
|
bool changed)
|
bool changed)
|
{
|
{
|
gcc_assert (a_elt || b_elt);
|
gcc_assert (a_elt || b_elt);
|
|
|
if (a_elt && b_elt && a_elt->indx == b_elt->indx)
|
if (a_elt && b_elt && a_elt->indx == b_elt->indx)
|
{
|
{
|
/* Matching elts, generate A | B. */
|
/* Matching elts, generate A | B. */
|
unsigned ix;
|
unsigned ix;
|
|
|
if (!changed && dst_elt && dst_elt->indx == a_elt->indx)
|
if (!changed && dst_elt && dst_elt->indx == a_elt->indx)
|
{
|
{
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
|
if (r != dst_elt->bits[ix])
|
if (r != dst_elt->bits[ix])
|
{
|
{
|
dst_elt->bits[ix] = r;
|
dst_elt->bits[ix] = r;
|
changed = true;
|
changed = true;
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
changed = true;
|
changed = true;
|
if (!dst_elt)
|
if (!dst_elt)
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx);
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx);
|
else
|
else
|
dst_elt->indx = a_elt->indx;
|
dst_elt->indx = a_elt->indx;
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] | b_elt->bits[ix];
|
dst_elt->bits[ix] = r;
|
dst_elt->bits[ix] = r;
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Copy a single element. */
|
/* Copy a single element. */
|
const bitmap_element *src;
|
const bitmap_element *src;
|
|
|
if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
|
if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
|
src = a_elt;
|
src = a_elt;
|
else
|
else
|
src = b_elt;
|
src = b_elt;
|
|
|
gcc_assert (src);
|
gcc_assert (src);
|
changed = bitmap_elt_copy (dst, dst_elt, dst_prev, src, changed);
|
changed = bitmap_elt_copy (dst, dst_elt, dst_prev, src, changed);
|
}
|
}
|
return changed;
|
return changed;
|
}
|
}
|
|
|
|
|
/* DST = A | B. Return true if DST changes. */
|
/* DST = A | B. Return true if DST changes. */
|
|
|
bool
|
bool
|
bitmap_ior (bitmap dst, const_bitmap a, const_bitmap b)
|
bitmap_ior (bitmap dst, const_bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *dst_elt = dst->first;
|
bitmap_element *dst_elt = dst->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *dst_prev = NULL;
|
bitmap_element *dst_prev = NULL;
|
bitmap_element **dst_prev_pnext = &dst->first;
|
bitmap_element **dst_prev_pnext = &dst->first;
|
bool changed = false;
|
bool changed = false;
|
|
|
gcc_assert (dst != a && dst != b);
|
gcc_assert (dst != a && dst != b);
|
|
|
while (a_elt || b_elt)
|
while (a_elt || b_elt)
|
{
|
{
|
changed = bitmap_elt_ior (dst, dst_elt, dst_prev, a_elt, b_elt, changed);
|
changed = bitmap_elt_ior (dst, dst_elt, dst_prev, a_elt, b_elt, changed);
|
|
|
if (a_elt && b_elt && a_elt->indx == b_elt->indx)
|
if (a_elt && b_elt && a_elt->indx == b_elt->indx)
|
{
|
{
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
else
|
else
|
{
|
{
|
if (a_elt && (!b_elt || a_elt->indx <= b_elt->indx))
|
if (a_elt && (!b_elt || a_elt->indx <= b_elt->indx))
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
else if (b_elt && (!a_elt || b_elt->indx <= a_elt->indx))
|
else if (b_elt && (!a_elt || b_elt->indx <= a_elt->indx))
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
|
|
dst_prev = *dst_prev_pnext;
|
dst_prev = *dst_prev_pnext;
|
dst_prev_pnext = &dst_prev->next;
|
dst_prev_pnext = &dst_prev->next;
|
dst_elt = *dst_prev_pnext;
|
dst_elt = *dst_prev_pnext;
|
}
|
}
|
|
|
if (dst_elt)
|
if (dst_elt)
|
{
|
{
|
changed = true;
|
changed = true;
|
bitmap_elt_clear_from (dst, dst_elt);
|
bitmap_elt_clear_from (dst, dst_elt);
|
}
|
}
|
gcc_assert (!dst->current == !dst->first);
|
gcc_assert (!dst->current == !dst->first);
|
if (dst->current)
|
if (dst->current)
|
dst->indx = dst->current->indx;
|
dst->indx = dst->current->indx;
|
return changed;
|
return changed;
|
}
|
}
|
|
|
/* A |= B. Return true if A changes. */
|
/* A |= B. Return true if A changes. */
|
|
|
bool
|
bool
|
bitmap_ior_into (bitmap a, const_bitmap b)
|
bitmap_ior_into (bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *a_elt = a->first;
|
bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *a_prev = NULL;
|
bitmap_element *a_prev = NULL;
|
bitmap_element **a_prev_pnext = &a->first;
|
bitmap_element **a_prev_pnext = &a->first;
|
bool changed = false;
|
bool changed = false;
|
|
|
if (a == b)
|
if (a == b)
|
return false;
|
return false;
|
|
|
while (b_elt)
|
while (b_elt)
|
{
|
{
|
/* If A lags behind B, just advance it. */
|
/* If A lags behind B, just advance it. */
|
if (!a_elt || a_elt->indx == b_elt->indx)
|
if (!a_elt || a_elt->indx == b_elt->indx)
|
{
|
{
|
changed = bitmap_elt_ior (a, a_elt, a_prev, a_elt, b_elt, changed);
|
changed = bitmap_elt_ior (a, a_elt, a_prev, a_elt, b_elt, changed);
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
else if (a_elt->indx > b_elt->indx)
|
else if (a_elt->indx > b_elt->indx)
|
{
|
{
|
changed = bitmap_elt_copy (a, NULL, a_prev, b_elt, changed);
|
changed = bitmap_elt_copy (a, NULL, a_prev, b_elt, changed);
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
|
|
a_prev = *a_prev_pnext;
|
a_prev = *a_prev_pnext;
|
a_prev_pnext = &a_prev->next;
|
a_prev_pnext = &a_prev->next;
|
a_elt = *a_prev_pnext;
|
a_elt = *a_prev_pnext;
|
}
|
}
|
|
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current == !a->first);
|
if (a->current)
|
if (a->current)
|
a->indx = a->current->indx;
|
a->indx = a->current->indx;
|
return changed;
|
return changed;
|
}
|
}
|
|
|
/* DST = A ^ B */
|
/* DST = A ^ B */
|
|
|
void
|
void
|
bitmap_xor (bitmap dst, const_bitmap a, const_bitmap b)
|
bitmap_xor (bitmap dst, const_bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *dst_elt = dst->first;
|
bitmap_element *dst_elt = dst->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *dst_prev = NULL;
|
bitmap_element *dst_prev = NULL;
|
|
|
gcc_assert (dst != a && dst != b);
|
gcc_assert (dst != a && dst != b);
|
if (a == b)
|
if (a == b)
|
{
|
{
|
bitmap_clear (dst);
|
bitmap_clear (dst);
|
return;
|
return;
|
}
|
}
|
|
|
while (a_elt || b_elt)
|
while (a_elt || b_elt)
|
{
|
{
|
if (a_elt && b_elt && a_elt->indx == b_elt->indx)
|
if (a_elt && b_elt && a_elt->indx == b_elt->indx)
|
{
|
{
|
/* Matching elts, generate A ^ B. */
|
/* Matching elts, generate A ^ B. */
|
unsigned ix;
|
unsigned ix;
|
BITMAP_WORD ior = 0;
|
BITMAP_WORD ior = 0;
|
|
|
if (!dst_elt)
|
if (!dst_elt)
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx);
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, a_elt->indx);
|
else
|
else
|
dst_elt->indx = a_elt->indx;
|
dst_elt->indx = a_elt->indx;
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
|
|
|
ior |= r;
|
ior |= r;
|
dst_elt->bits[ix] = r;
|
dst_elt->bits[ix] = r;
|
}
|
}
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
if (ior)
|
if (ior)
|
{
|
{
|
dst_prev = dst_elt;
|
dst_prev = dst_elt;
|
dst_elt = dst_elt->next;
|
dst_elt = dst_elt->next;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Copy a single element. */
|
/* Copy a single element. */
|
const bitmap_element *src;
|
const bitmap_element *src;
|
|
|
if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
|
if (!b_elt || (a_elt && a_elt->indx < b_elt->indx))
|
{
|
{
|
src = a_elt;
|
src = a_elt;
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
}
|
}
|
else
|
else
|
{
|
{
|
src = b_elt;
|
src = b_elt;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
|
|
if (!dst_elt)
|
if (!dst_elt)
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, src->indx);
|
dst_elt = bitmap_elt_insert_after (dst, dst_prev, src->indx);
|
else
|
else
|
dst_elt->indx = src->indx;
|
dst_elt->indx = src->indx;
|
memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits));
|
memcpy (dst_elt->bits, src->bits, sizeof (dst_elt->bits));
|
dst_prev = dst_elt;
|
dst_prev = dst_elt;
|
dst_elt = dst_elt->next;
|
dst_elt = dst_elt->next;
|
}
|
}
|
}
|
}
|
/* Ensure that dst->current is valid. */
|
/* Ensure that dst->current is valid. */
|
dst->current = dst->first;
|
dst->current = dst->first;
|
bitmap_elt_clear_from (dst, dst_elt);
|
bitmap_elt_clear_from (dst, dst_elt);
|
gcc_assert (!dst->current == !dst->first);
|
gcc_assert (!dst->current == !dst->first);
|
if (dst->current)
|
if (dst->current)
|
dst->indx = dst->current->indx;
|
dst->indx = dst->current->indx;
|
}
|
}
|
|
|
/* A ^= B */
|
/* A ^= B */
|
|
|
void
|
void
|
bitmap_xor_into (bitmap a, const_bitmap b)
|
bitmap_xor_into (bitmap a, const_bitmap b)
|
{
|
{
|
bitmap_element *a_elt = a->first;
|
bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
bitmap_element *a_prev = NULL;
|
bitmap_element *a_prev = NULL;
|
|
|
if (a == b)
|
if (a == b)
|
{
|
{
|
bitmap_clear (a);
|
bitmap_clear (a);
|
return;
|
return;
|
}
|
}
|
|
|
while (b_elt)
|
while (b_elt)
|
{
|
{
|
if (!a_elt || b_elt->indx < a_elt->indx)
|
if (!a_elt || b_elt->indx < a_elt->indx)
|
{
|
{
|
/* Copy b_elt. */
|
/* Copy b_elt. */
|
bitmap_element *dst = bitmap_elt_insert_after (a, a_prev, b_elt->indx);
|
bitmap_element *dst = bitmap_elt_insert_after (a, a_prev, b_elt->indx);
|
memcpy (dst->bits, b_elt->bits, sizeof (dst->bits));
|
memcpy (dst->bits, b_elt->bits, sizeof (dst->bits));
|
a_prev = dst;
|
a_prev = dst;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
else if (a_elt->indx < b_elt->indx)
|
else if (a_elt->indx < b_elt->indx)
|
{
|
{
|
a_prev = a_elt;
|
a_prev = a_elt;
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Matching elts, generate A ^= B. */
|
/* Matching elts, generate A ^= B. */
|
unsigned ix;
|
unsigned ix;
|
BITMAP_WORD ior = 0;
|
BITMAP_WORD ior = 0;
|
bitmap_element *next = a_elt->next;
|
bitmap_element *next = a_elt->next;
|
|
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
|
BITMAP_WORD r = a_elt->bits[ix] ^ b_elt->bits[ix];
|
|
|
ior |= r;
|
ior |= r;
|
a_elt->bits[ix] = r;
|
a_elt->bits[ix] = r;
|
}
|
}
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
if (ior)
|
if (ior)
|
a_prev = a_elt;
|
a_prev = a_elt;
|
else
|
else
|
bitmap_element_free (a, a_elt);
|
bitmap_element_free (a, a_elt);
|
a_elt = next;
|
a_elt = next;
|
}
|
}
|
}
|
}
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current == !a->first);
|
if (a->current)
|
if (a->current)
|
a->indx = a->current->indx;
|
a->indx = a->current->indx;
|
}
|
}
|
|
|
/* Return true if two bitmaps are identical.
|
/* Return true if two bitmaps are identical.
|
We do not bother with a check for pointer equality, as that never
|
We do not bother with a check for pointer equality, as that never
|
occurs in practice. */
|
occurs in practice. */
|
|
|
bool
|
bool
|
bitmap_equal_p (const_bitmap a, const_bitmap b)
|
bitmap_equal_p (const_bitmap a, const_bitmap b)
|
{
|
{
|
const bitmap_element *a_elt;
|
const bitmap_element *a_elt;
|
const bitmap_element *b_elt;
|
const bitmap_element *b_elt;
|
unsigned ix;
|
unsigned ix;
|
|
|
for (a_elt = a->first, b_elt = b->first;
|
for (a_elt = a->first, b_elt = b->first;
|
a_elt && b_elt;
|
a_elt && b_elt;
|
a_elt = a_elt->next, b_elt = b_elt->next)
|
a_elt = a_elt->next, b_elt = b_elt->next)
|
{
|
{
|
if (a_elt->indx != b_elt->indx)
|
if (a_elt->indx != b_elt->indx)
|
return false;
|
return false;
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
if (a_elt->bits[ix] != b_elt->bits[ix])
|
if (a_elt->bits[ix] != b_elt->bits[ix])
|
return false;
|
return false;
|
}
|
}
|
return !a_elt && !b_elt;
|
return !a_elt && !b_elt;
|
}
|
}
|
|
|
/* Return true if A AND B is not empty. */
|
/* Return true if A AND B is not empty. */
|
|
|
bool
|
bool
|
bitmap_intersect_p (const_bitmap a, const_bitmap b)
|
bitmap_intersect_p (const_bitmap a, const_bitmap b)
|
{
|
{
|
const bitmap_element *a_elt;
|
const bitmap_element *a_elt;
|
const bitmap_element *b_elt;
|
const bitmap_element *b_elt;
|
unsigned ix;
|
unsigned ix;
|
|
|
for (a_elt = a->first, b_elt = b->first;
|
for (a_elt = a->first, b_elt = b->first;
|
a_elt && b_elt;)
|
a_elt && b_elt;)
|
{
|
{
|
if (a_elt->indx < b_elt->indx)
|
if (a_elt->indx < b_elt->indx)
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
else if (b_elt->indx < a_elt->indx)
|
else if (b_elt->indx < a_elt->indx)
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
else
|
else
|
{
|
{
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
if (a_elt->bits[ix] & b_elt->bits[ix])
|
if (a_elt->bits[ix] & b_elt->bits[ix])
|
return true;
|
return true;
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
}
|
}
|
return false;
|
return false;
|
}
|
}
|
|
|
/* Return true if A AND NOT B is not empty. */
|
/* Return true if A AND NOT B is not empty. */
|
|
|
bool
|
bool
|
bitmap_intersect_compl_p (const_bitmap a, const_bitmap b)
|
bitmap_intersect_compl_p (const_bitmap a, const_bitmap b)
|
{
|
{
|
const bitmap_element *a_elt;
|
const bitmap_element *a_elt;
|
const bitmap_element *b_elt;
|
const bitmap_element *b_elt;
|
unsigned ix;
|
unsigned ix;
|
for (a_elt = a->first, b_elt = b->first;
|
for (a_elt = a->first, b_elt = b->first;
|
a_elt && b_elt;)
|
a_elt && b_elt;)
|
{
|
{
|
if (a_elt->indx < b_elt->indx)
|
if (a_elt->indx < b_elt->indx)
|
return true;
|
return true;
|
else if (b_elt->indx < a_elt->indx)
|
else if (b_elt->indx < a_elt->indx)
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
else
|
else
|
{
|
{
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
if (a_elt->bits[ix] & ~b_elt->bits[ix])
|
if (a_elt->bits[ix] & ~b_elt->bits[ix])
|
return true;
|
return true;
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
}
|
}
|
return a_elt != NULL;
|
return a_elt != NULL;
|
}
|
}
|
|
|
|
|
/* DST = A | (FROM1 & ~FROM2). Return true if DST changes. */
|
/* DST = A | (FROM1 & ~FROM2). Return true if DST changes. */
|
|
|
bool
|
bool
|
bitmap_ior_and_compl (bitmap dst, const_bitmap a, const_bitmap b, const_bitmap kill)
|
bitmap_ior_and_compl (bitmap dst, const_bitmap a, const_bitmap b, const_bitmap kill)
|
{
|
{
|
bool changed = false;
|
bool changed = false;
|
|
|
bitmap_element *dst_elt = dst->first;
|
bitmap_element *dst_elt = dst->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *kill_elt = kill->first;
|
const bitmap_element *kill_elt = kill->first;
|
bitmap_element *dst_prev = NULL;
|
bitmap_element *dst_prev = NULL;
|
bitmap_element **dst_prev_pnext = &dst->first;
|
bitmap_element **dst_prev_pnext = &dst->first;
|
|
|
gcc_assert (dst != a && dst != b && dst != kill);
|
gcc_assert (dst != a && dst != b && dst != kill);
|
|
|
/* Special cases. We don't bother checking for bitmap_equal_p (b, kill). */
|
/* Special cases. We don't bother checking for bitmap_equal_p (b, kill). */
|
if (b == kill || bitmap_empty_p (b))
|
if (b == kill || bitmap_empty_p (b))
|
{
|
{
|
changed = !bitmap_equal_p (dst, a);
|
changed = !bitmap_equal_p (dst, a);
|
if (changed)
|
if (changed)
|
bitmap_copy (dst, a);
|
bitmap_copy (dst, a);
|
return changed;
|
return changed;
|
}
|
}
|
if (bitmap_empty_p (kill))
|
if (bitmap_empty_p (kill))
|
return bitmap_ior (dst, a, b);
|
return bitmap_ior (dst, a, b);
|
if (bitmap_empty_p (a))
|
if (bitmap_empty_p (a))
|
return bitmap_and_compl (dst, b, kill);
|
return bitmap_and_compl (dst, b, kill);
|
|
|
while (a_elt || b_elt)
|
while (a_elt || b_elt)
|
{
|
{
|
bool new_element = false;
|
bool new_element = false;
|
|
|
if (b_elt)
|
if (b_elt)
|
while (kill_elt && kill_elt->indx < b_elt->indx)
|
while (kill_elt && kill_elt->indx < b_elt->indx)
|
kill_elt = kill_elt->next;
|
kill_elt = kill_elt->next;
|
|
|
if (b_elt && kill_elt && kill_elt->indx == b_elt->indx
|
if (b_elt && kill_elt && kill_elt->indx == b_elt->indx
|
&& (!a_elt || a_elt->indx >= b_elt->indx))
|
&& (!a_elt || a_elt->indx >= b_elt->indx))
|
{
|
{
|
bitmap_element tmp_elt;
|
bitmap_element tmp_elt;
|
unsigned ix;
|
unsigned ix;
|
|
|
BITMAP_WORD ior = 0;
|
BITMAP_WORD ior = 0;
|
tmp_elt.indx = b_elt->indx;
|
tmp_elt.indx = b_elt->indx;
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
BITMAP_WORD r = b_elt->bits[ix] & ~kill_elt->bits[ix];
|
BITMAP_WORD r = b_elt->bits[ix] & ~kill_elt->bits[ix];
|
ior |= r;
|
ior |= r;
|
tmp_elt.bits[ix] = r;
|
tmp_elt.bits[ix] = r;
|
}
|
}
|
|
|
if (ior)
|
if (ior)
|
{
|
{
|
changed = bitmap_elt_ior (dst, dst_elt, dst_prev,
|
changed = bitmap_elt_ior (dst, dst_elt, dst_prev,
|
a_elt, &tmp_elt, changed);
|
a_elt, &tmp_elt, changed);
|
new_element = true;
|
new_element = true;
|
if (a_elt && a_elt->indx == b_elt->indx)
|
if (a_elt && a_elt->indx == b_elt->indx)
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
}
|
}
|
|
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
kill_elt = kill_elt->next;
|
kill_elt = kill_elt->next;
|
}
|
}
|
else
|
else
|
{
|
{
|
changed = bitmap_elt_ior (dst, dst_elt, dst_prev,
|
changed = bitmap_elt_ior (dst, dst_elt, dst_prev,
|
a_elt, b_elt, changed);
|
a_elt, b_elt, changed);
|
new_element = true;
|
new_element = true;
|
|
|
if (a_elt && b_elt && a_elt->indx == b_elt->indx)
|
if (a_elt && b_elt && a_elt->indx == b_elt->indx)
|
{
|
{
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
else
|
else
|
{
|
{
|
if (a_elt && (!b_elt || a_elt->indx <= b_elt->indx))
|
if (a_elt && (!b_elt || a_elt->indx <= b_elt->indx))
|
a_elt = a_elt->next;
|
a_elt = a_elt->next;
|
else if (b_elt && (!a_elt || b_elt->indx <= a_elt->indx))
|
else if (b_elt && (!a_elt || b_elt->indx <= a_elt->indx))
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
}
|
}
|
}
|
}
|
|
|
if (new_element)
|
if (new_element)
|
{
|
{
|
dst_prev = *dst_prev_pnext;
|
dst_prev = *dst_prev_pnext;
|
dst_prev_pnext = &dst_prev->next;
|
dst_prev_pnext = &dst_prev->next;
|
dst_elt = *dst_prev_pnext;
|
dst_elt = *dst_prev_pnext;
|
}
|
}
|
}
|
}
|
|
|
if (dst_elt)
|
if (dst_elt)
|
{
|
{
|
changed = true;
|
changed = true;
|
bitmap_elt_clear_from (dst, dst_elt);
|
bitmap_elt_clear_from (dst, dst_elt);
|
}
|
}
|
gcc_assert (!dst->current == !dst->first);
|
gcc_assert (!dst->current == !dst->first);
|
if (dst->current)
|
if (dst->current)
|
dst->indx = dst->current->indx;
|
dst->indx = dst->current->indx;
|
|
|
return changed;
|
return changed;
|
}
|
}
|
|
|
/* A |= (FROM1 & ~FROM2). Return true if A changes. */
|
/* A |= (FROM1 & ~FROM2). Return true if A changes. */
|
|
|
bool
|
bool
|
bitmap_ior_and_compl_into (bitmap a, const_bitmap from1, const_bitmap from2)
|
bitmap_ior_and_compl_into (bitmap a, const_bitmap from1, const_bitmap from2)
|
{
|
{
|
bitmap_head tmp;
|
bitmap_head tmp;
|
bool changed;
|
bool changed;
|
|
|
bitmap_initialize (&tmp, &bitmap_default_obstack);
|
bitmap_initialize (&tmp, &bitmap_default_obstack);
|
bitmap_and_compl (&tmp, from1, from2);
|
bitmap_and_compl (&tmp, from1, from2);
|
changed = bitmap_ior_into (a, &tmp);
|
changed = bitmap_ior_into (a, &tmp);
|
bitmap_clear (&tmp);
|
bitmap_clear (&tmp);
|
|
|
return changed;
|
return changed;
|
}
|
}
|
|
|
/* A |= (B & C). Return true if A changes. */
|
/* A |= (B & C). Return true if A changes. */
|
|
|
bool
|
bool
|
bitmap_ior_and_into (bitmap a, const_bitmap b, const_bitmap c)
|
bitmap_ior_and_into (bitmap a, const_bitmap b, const_bitmap c)
|
{
|
{
|
bitmap_element *a_elt = a->first;
|
bitmap_element *a_elt = a->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *b_elt = b->first;
|
const bitmap_element *c_elt = c->first;
|
const bitmap_element *c_elt = c->first;
|
bitmap_element and_elt;
|
bitmap_element and_elt;
|
bitmap_element *a_prev = NULL;
|
bitmap_element *a_prev = NULL;
|
bitmap_element **a_prev_pnext = &a->first;
|
bitmap_element **a_prev_pnext = &a->first;
|
bool changed = false;
|
bool changed = false;
|
unsigned ix;
|
unsigned ix;
|
|
|
if (b == c)
|
if (b == c)
|
return bitmap_ior_into (a, b);
|
return bitmap_ior_into (a, b);
|
if (bitmap_empty_p (b) || bitmap_empty_p (c))
|
if (bitmap_empty_p (b) || bitmap_empty_p (c))
|
return false;
|
return false;
|
|
|
and_elt.indx = -1;
|
and_elt.indx = -1;
|
while (b_elt && c_elt)
|
while (b_elt && c_elt)
|
{
|
{
|
BITMAP_WORD overall;
|
BITMAP_WORD overall;
|
|
|
/* Find a common item of B and C. */
|
/* Find a common item of B and C. */
|
while (b_elt->indx != c_elt->indx)
|
while (b_elt->indx != c_elt->indx)
|
{
|
{
|
if (b_elt->indx < c_elt->indx)
|
if (b_elt->indx < c_elt->indx)
|
{
|
{
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
if (!b_elt)
|
if (!b_elt)
|
goto done;
|
goto done;
|
}
|
}
|
else
|
else
|
{
|
{
|
c_elt = c_elt->next;
|
c_elt = c_elt->next;
|
if (!c_elt)
|
if (!c_elt)
|
goto done;
|
goto done;
|
}
|
}
|
}
|
}
|
|
|
overall = 0;
|
overall = 0;
|
and_elt.indx = b_elt->indx;
|
and_elt.indx = b_elt->indx;
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
for (ix = BITMAP_ELEMENT_WORDS; ix--;)
|
{
|
{
|
and_elt.bits[ix] = b_elt->bits[ix] & c_elt->bits[ix];
|
and_elt.bits[ix] = b_elt->bits[ix] & c_elt->bits[ix];
|
overall |= and_elt.bits[ix];
|
overall |= and_elt.bits[ix];
|
}
|
}
|
|
|
b_elt = b_elt->next;
|
b_elt = b_elt->next;
|
c_elt = c_elt->next;
|
c_elt = c_elt->next;
|
if (!overall)
|
if (!overall)
|
continue;
|
continue;
|
|
|
/* Now find a place to insert AND_ELT. */
|
/* Now find a place to insert AND_ELT. */
|
do
|
do
|
{
|
{
|
ix = a_elt ? a_elt->indx : and_elt.indx;
|
ix = a_elt ? a_elt->indx : and_elt.indx;
|
if (ix == and_elt.indx)
|
if (ix == and_elt.indx)
|
changed = bitmap_elt_ior (a, a_elt, a_prev, a_elt, &and_elt, changed);
|
changed = bitmap_elt_ior (a, a_elt, a_prev, a_elt, &and_elt, changed);
|
else if (ix > and_elt.indx)
|
else if (ix > and_elt.indx)
|
changed = bitmap_elt_copy (a, NULL, a_prev, &and_elt, changed);
|
changed = bitmap_elt_copy (a, NULL, a_prev, &and_elt, changed);
|
|
|
a_prev = *a_prev_pnext;
|
a_prev = *a_prev_pnext;
|
a_prev_pnext = &a_prev->next;
|
a_prev_pnext = &a_prev->next;
|
a_elt = *a_prev_pnext;
|
a_elt = *a_prev_pnext;
|
|
|
/* If A lagged behind B/C, we advanced it so loop once more. */
|
/* If A lagged behind B/C, we advanced it so loop once more. */
|
}
|
}
|
while (ix < and_elt.indx);
|
while (ix < and_elt.indx);
|
}
|
}
|
|
|
done:
|
done:
|
gcc_assert (!a->current == !a->first);
|
gcc_assert (!a->current == !a->first);
|
if (a->current)
|
if (a->current)
|
a->indx = a->current->indx;
|
a->indx = a->current->indx;
|
return changed;
|
return changed;
|
}
|
}
|
|
|
/* Debugging function to print out the contents of a bitmap. */
|
/* Debugging function to print out the contents of a bitmap. */
|
|
|
void
|
void
|
debug_bitmap_file (FILE *file, const_bitmap head)
|
debug_bitmap_file (FILE *file, const_bitmap head)
|
{
|
{
|
const bitmap_element *ptr;
|
const bitmap_element *ptr;
|
|
|
fprintf (file, "\nfirst = " HOST_PTR_PRINTF
|
fprintf (file, "\nfirst = " HOST_PTR_PRINTF
|
" current = " HOST_PTR_PRINTF " indx = %u\n",
|
" current = " HOST_PTR_PRINTF " indx = %u\n",
|
(void *) head->first, (void *) head->current, head->indx);
|
(void *) head->first, (void *) head->current, head->indx);
|
|
|
for (ptr = head->first; ptr; ptr = ptr->next)
|
for (ptr = head->first; ptr; ptr = ptr->next)
|
{
|
{
|
unsigned int i, j, col = 26;
|
unsigned int i, j, col = 26;
|
|
|
fprintf (file, "\t" HOST_PTR_PRINTF " next = " HOST_PTR_PRINTF
|
fprintf (file, "\t" HOST_PTR_PRINTF " next = " HOST_PTR_PRINTF
|
" prev = " HOST_PTR_PRINTF " indx = %u\n\t\tbits = {",
|
" prev = " HOST_PTR_PRINTF " indx = %u\n\t\tbits = {",
|
(const void*) ptr, (const void*) ptr->next,
|
(const void*) ptr, (const void*) ptr->next,
|
(const void*) ptr->prev, ptr->indx);
|
(const void*) ptr->prev, ptr->indx);
|
|
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
for (i = 0; i < BITMAP_ELEMENT_WORDS; i++)
|
for (j = 0; j < BITMAP_WORD_BITS; j++)
|
for (j = 0; j < BITMAP_WORD_BITS; j++)
|
if ((ptr->bits[i] >> j) & 1)
|
if ((ptr->bits[i] >> j) & 1)
|
{
|
{
|
if (col > 70)
|
if (col > 70)
|
{
|
{
|
fprintf (file, "\n\t\t\t");
|
fprintf (file, "\n\t\t\t");
|
col = 24;
|
col = 24;
|
}
|
}
|
|
|
fprintf (file, " %u", (ptr->indx * BITMAP_ELEMENT_ALL_BITS
|
fprintf (file, " %u", (ptr->indx * BITMAP_ELEMENT_ALL_BITS
|
+ i * BITMAP_WORD_BITS + j));
|
+ i * BITMAP_WORD_BITS + j));
|
col += 4;
|
col += 4;
|
}
|
}
|
|
|
fprintf (file, " }\n");
|
fprintf (file, " }\n");
|
}
|
}
|
}
|
}
|
|
|
/* Function to be called from the debugger to print the contents
|
/* Function to be called from the debugger to print the contents
|
of a bitmap. */
|
of a bitmap. */
|
|
|
void
|
void
|
debug_bitmap (const_bitmap head)
|
debug_bitmap (const_bitmap head)
|
{
|
{
|
debug_bitmap_file (stdout, head);
|
debug_bitmap_file (stdout, head);
|
}
|
}
|
|
|
/* Function to print out the contents of a bitmap. Unlike debug_bitmap_file,
|
/* Function to print out the contents of a bitmap. Unlike debug_bitmap_file,
|
it does not print anything but the bits. */
|
it does not print anything but the bits. */
|
|
|
void
|
void
|
bitmap_print (FILE *file, const_bitmap head, const char *prefix, const char *suffix)
|
bitmap_print (FILE *file, const_bitmap head, const char *prefix, const char *suffix)
|
{
|
{
|
const char *comma = "";
|
const char *comma = "";
|
unsigned i;
|
unsigned i;
|
bitmap_iterator bi;
|
bitmap_iterator bi;
|
|
|
fputs (prefix, file);
|
fputs (prefix, file);
|
EXECUTE_IF_SET_IN_BITMAP (head, 0, i, bi)
|
EXECUTE_IF_SET_IN_BITMAP (head, 0, i, bi)
|
{
|
{
|
fprintf (file, "%s%d", comma, i);
|
fprintf (file, "%s%d", comma, i);
|
comma = ", ";
|
comma = ", ";
|
}
|
}
|
fputs (suffix, file);
|
fputs (suffix, file);
|
}
|
}
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
|
|
|
|
/* Used to accumulate statistics about bitmap sizes. */
|
/* Used to accumulate statistics about bitmap sizes. */
|
struct output_info
|
struct output_info
|
{
|
{
|
HOST_WIDEST_INT size;
|
HOST_WIDEST_INT size;
|
int count;
|
int count;
|
};
|
};
|
|
|
/* Called via htab_traverse. Output bitmap descriptor pointed out by SLOT
|
/* Called via htab_traverse. Output bitmap descriptor pointed out by SLOT
|
and update statistics. */
|
and update statistics. */
|
static int
|
static int
|
print_statistics (void **slot, void *b)
|
print_statistics (void **slot, void *b)
|
{
|
{
|
struct bitmap_descriptor *d = (struct bitmap_descriptor *) *slot;
|
struct bitmap_descriptor *d = (struct bitmap_descriptor *) *slot;
|
struct output_info *i = (struct output_info *) b;
|
struct output_info *i = (struct output_info *) b;
|
char s[4096];
|
char s[4096];
|
|
|
if (d->allocated)
|
if (d->allocated)
|
{
|
{
|
const char *s1 = d->file;
|
const char *s1 = d->file;
|
const char *s2;
|
const char *s2;
|
while ((s2 = strstr (s1, "gcc/")))
|
while ((s2 = strstr (s1, "gcc/")))
|
s1 = s2 + 4;
|
s1 = s2 + 4;
|
sprintf (s, "%s:%i (%s)", s1, d->line, d->function);
|
sprintf (s, "%s:%i (%s)", s1, d->line, d->function);
|
s[41] = 0;
|
s[41] = 0;
|
fprintf (stderr, "%-41s %8d %15"HOST_WIDEST_INT_PRINT"d %15"
|
fprintf (stderr, "%-41s %8d %15"HOST_WIDEST_INT_PRINT"d %15"
|
HOST_WIDEST_INT_PRINT"d %15"HOST_WIDEST_INT_PRINT"d %10d\n",
|
HOST_WIDEST_INT_PRINT"d %15"HOST_WIDEST_INT_PRINT"d %10d\n",
|
s, d->created, d->allocated, d->peak, d->current, d->nsearches);
|
s, d->created, d->allocated, d->peak, d->current, d->nsearches);
|
i->size += d->allocated;
|
i->size += d->allocated;
|
i->count += d->created;
|
i->count += d->created;
|
}
|
}
|
return 1;
|
return 1;
|
}
|
}
|
#endif
|
#endif
|
/* Output per-bitmap memory usage statistics. */
|
/* Output per-bitmap memory usage statistics. */
|
void
|
void
|
dump_bitmap_statistics (void)
|
dump_bitmap_statistics (void)
|
{
|
{
|
#ifdef GATHER_STATISTICS
|
#ifdef GATHER_STATISTICS
|
struct output_info info;
|
struct output_info info;
|
|
|
if (!bitmap_desc_hash)
|
if (!bitmap_desc_hash)
|
return;
|
return;
|
|
|
fprintf (stderr, "\nBitmap Overall "
|
fprintf (stderr, "\nBitmap Overall "
|
" Allocated Peak Leak searched "
|
" Allocated Peak Leak searched "
|
" per search\n");
|
" per search\n");
|
fprintf (stderr, "---------------------------------------------------------------------------------\n");
|
fprintf (stderr, "---------------------------------------------------------------------------------\n");
|
info.count = 0;
|
info.count = 0;
|
info.size = 0;
|
info.size = 0;
|
htab_traverse (bitmap_desc_hash, print_statistics, &info);
|
htab_traverse (bitmap_desc_hash, print_statistics, &info);
|
fprintf (stderr, "---------------------------------------------------------------------------------\n");
|
fprintf (stderr, "---------------------------------------------------------------------------------\n");
|
fprintf (stderr, "%-40s %9d %15"HOST_WIDEST_INT_PRINT"d\n",
|
fprintf (stderr, "%-40s %9d %15"HOST_WIDEST_INT_PRINT"d\n",
|
"Total", info.count, info.size);
|
"Total", info.count, info.size);
|
fprintf (stderr, "---------------------------------------------------------------------------------\n");
|
fprintf (stderr, "---------------------------------------------------------------------------------\n");
|
#endif
|
#endif
|
}
|
}
|
|
|
/* Compute hash of bitmap (for purposes of hashing). */
|
/* Compute hash of bitmap (for purposes of hashing). */
|
hashval_t
|
hashval_t
|
bitmap_hash (const_bitmap head)
|
bitmap_hash (const_bitmap head)
|
{
|
{
|
const bitmap_element *ptr;
|
const bitmap_element *ptr;
|
BITMAP_WORD hash = 0;
|
BITMAP_WORD hash = 0;
|
int ix;
|
int ix;
|
|
|
for (ptr = head->first; ptr; ptr = ptr->next)
|
for (ptr = head->first; ptr; ptr = ptr->next)
|
{
|
{
|
hash ^= ptr->indx;
|
hash ^= ptr->indx;
|
for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
|
for (ix = 0; ix != BITMAP_ELEMENT_WORDS; ix++)
|
hash ^= ptr->bits[ix];
|
hash ^= ptr->bits[ix];
|
}
|
}
|
return (hashval_t)hash;
|
return (hashval_t)hash;
|
}
|
}
|
|
|
#include "gt-bitmap.h"
|
#include "gt-bitmap.h"
|
|
|
