Lines Matching defs:elt1
205 bitmap_element *elt1;
226 bi->elt1 = map->first;
229 /* Advance elt1 until it is not before the block containing start_bit. */
232 if (!bi->elt1)
234 bi->elt1 = &bitmap_zero_bits;
238 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
240 bi->elt1 = bi->elt1->next;
244 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
245 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
249 bi->bits = bi->elt1->bits[bi->word_no];
268 bi->elt1 = map1->first;
271 /* Advance elt1 until it is not before the block containing
275 if (!bi->elt1)
281 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
283 bi->elt1 = bi->elt1->next;
286 /* Advance elt2 until it is not before elt1. */
291 bi->elt1 = bi->elt2 = &bitmap_zero_bits;
295 if (bi->elt2->indx >= bi->elt1->indx)
301 if (bi->elt1->indx == bi->elt2->indx)
305 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
306 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
309 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no];
314 /* Otherwise we must immediately advance elt1, so initialize for
336 bi->elt1 = map1->first;
339 /* Advance elt1 until it is not before the block containing start_bit. */
342 if (!bi->elt1)
344 bi->elt1 = &bitmap_zero_bits;
348 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
350 bi->elt1 = bi->elt1->next;
353 /* Advance elt2 until it is not before elt1. */
354 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx)
359 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
360 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
363 bi->bits = bi->elt1->bits[bi->word_no];
364 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx)
418 bi->bits = bi->elt1->bits[bi->word_no];
426 bi->elt1 = bi->elt1->next;
427 if (!bi->elt1)
429 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
465 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no];
475 /* Advance elt1 while it is less than elt2. We always want
479 bi->elt1 = bi->elt1->next;
480 if (!bi->elt1)
483 while (bi->elt1->indx < bi->elt2->indx);
485 /* Advance elt2 to be no less than elt1. This might not
487 while (bi->elt2->indx < bi->elt1->indx)
494 while (bi->elt1->indx != bi->elt2->indx);
496 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
532 bi->bits = bi->elt1->bits[bi->word_no];
533 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx)
541 /* Advance to the next element of elt1. */
542 bi->elt1 = bi->elt1->next;
543 if (!bi->elt1)
546 /* Advance elt2 until it is no less than elt1. */
547 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx)
550 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
