contrib/gcc/bitmap.c

33 bitmap_element bitmap_zero_bits;  /* An element of all zero bits.  */
68 /* Free a bitmap element.  Since these are allocated off the
100 /* Allocate a bitmap element.  The bits are cleared, but nothing else is.  */
105   bitmap_element *element;
110       element = bit_obstack->elements;
112       if (element)
114 	   element of the outer list.  */
115 	if (element->next)
117 	    bit_obstack->elements = element->next;
118 	    bit_obstack->elements->prev = element->prev;
122 	  bit_obstack->elements = element->prev;
124 	element = XOBNEW (&bit_obstack->obstack, bitmap_element);
128       element = bitmap_ggc_free;
129       if (element)
131 	   element of the outer list.  */
132 	if (element->next)
134 	    bitmap_ggc_free = element->next;
135 	    bitmap_ggc_free->prev = element->prev;
139 	  bitmap_ggc_free = element->prev;
141 	element = GGC_NEW (bitmap_element);
144   memset (element->bits, 0, sizeof (element->bits));
146   return element;
282 /* Return nonzero if all bits in an element are zero.  */
285 bitmap_element_zerop (bitmap_element *element)
288   return (element->bits[0] | element->bits[1]) == 0;
293     if (element->bits[i] != 0)
301 /* Link the bitmap element into the current bitmap linked list.  */
304 bitmap_element_link (bitmap head, bitmap_element *element)
306   unsigned int indx = element->indx;
309   /* If this is the first and only element, set it in.  */
312       element->next = element->prev = 0;
313       head->first = element;
316   /* If this index is less than that of the current element, it goes someplace
317      before the current element.  */
326 	ptr->prev->next = element;
328 	head->first = element;
330       element->prev = ptr->prev;
331       element->next = ptr;
332       ptr->prev = element;
335   /* Otherwise, it must go someplace after the current element.  */
344 	ptr->next->prev = element;
346       element->next = ptr->next;
347       element->prev = ptr;
348       ptr->next = element;
351   /* Set up so this is the first element searched.  */
352   head->current = element;
356 /* Insert a new uninitialized element into bitmap HEAD after element
357    ELT.  If ELT is NULL, insert the element at the start.  Return the
358    new element.  */
429 /* Find a bitmap element that would hold a bitmap's bit.
430    Update the `current' field even if we can't find an element that
437   bitmap_element *element;
447     for (element = head->current;
448 	 element->next != 0 && element->indx < indx;
449 	 element = element->next)
455     for (element = head->current;
456 	 element->prev != 0 && element->indx > indx;
457 	 element = element->prev)
463     for (element = head->first;
464 	 element->next != 0 && element->indx < indx;
465 	 element = element->next)
468   /* `element' is the nearest to the one we want.  If it's not the one we
470   head->current = element;
471   head->indx = element->indx;
472   if (element != 0 && element->indx != indx)
473     element = 0;
475   return element;
492       /* If we cleared the entire word, free up the element.  */
1111 	  /* Copy a single element.  */
1271 	  /* Copy a single element.  */