aboutsummaryrefslogtreecommitdiff
path: root/gcc/bitmap.h
diff options
context:
space:
mode:
Diffstat (limited to 'gcc/bitmap.h')
-rw-r--r--gcc/bitmap.h8
1 files changed, 4 insertions, 4 deletions
diff --git a/gcc/bitmap.h b/gcc/bitmap.h
index 4e3254e..11c75e9 100644
--- a/gcc/bitmap.h
+++ b/gcc/bitmap.h
@@ -288,10 +288,10 @@ typedef unsigned long BITMAP_WORD;
#define BITMAP_ELEMENT_ALL_BITS (BITMAP_ELEMENT_WORDS * BITMAP_WORD_BITS)
/* Obstack for allocating bitmaps and elements from. */
-struct GTY (()) bitmap_obstack {
+struct bitmap_obstack {
struct bitmap_element *elements;
struct bitmap_head *heads;
- struct obstack GTY ((skip)) obstack;
+ struct obstack obstack;
};
/* Bitmap set element. We use a linked list to hold only the bits that
@@ -306,7 +306,7 @@ struct GTY (()) bitmap_obstack {
bitmap_elt_clear_from to be implemented in unit time rather than
linear in the number of elements to be freed. */
-struct GTY((chain_next ("%h.next"), chain_prev ("%h.prev"))) bitmap_element {
+struct GTY((chain_next ("%h.next"))) bitmap_element {
/* In list form, the next element in the linked list;
in tree form, the left child node in the tree. */
struct bitmap_element *next;
@@ -340,7 +340,7 @@ struct GTY(()) bitmap_head {
/* Last element looked at. */
bitmap_element * GTY((skip(""))) current;
/* Obstack to allocate elements from. If NULL, then use GGC allocation. */
- bitmap_obstack *obstack;
+ bitmap_obstack * GTY((skip(""))) obstack;
void dump ();
};