Lines Matching defs:elt1
206 bitmap_element *elt1;
227 bi->elt1 = map->first;
230 /* Advance elt1 until it is not before the block containing start_bit. */
233 if (!bi->elt1)
235 bi->elt1 = &bitmap_zero_bits;
239 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
241 bi->elt1 = bi->elt1->next;
245 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
246 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
250 bi->bits = bi->elt1->bits[bi->word_no];
269 bi->elt1 = map1->first;
272 /* Advance elt1 until it is not before the block containing
276 if (!bi->elt1)
282 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
284 bi->elt1 = bi->elt1->next;
287 /* Advance elt2 until it is not before elt1. */
292 bi->elt1 = bi->elt2 = &bitmap_zero_bits;
296 if (bi->elt2->indx >= bi->elt1->indx)
302 if (bi->elt1->indx == bi->elt2->indx)
306 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
307 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
310 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no];
315 /* Otherwise we must immediately advance elt1, so initialize for
337 bi->elt1 = map1->first;
340 /* Advance elt1 until it is not before the block containing start_bit. */
343 if (!bi->elt1)
345 bi->elt1 = &bitmap_zero_bits;
349 if (bi->elt1->indx >= start_bit / BITMAP_ELEMENT_ALL_BITS)
351 bi->elt1 = bi->elt1->next;
354 /* Advance elt2 until it is not before elt1. */
355 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx)
360 if (bi->elt1->indx != start_bit / BITMAP_ELEMENT_ALL_BITS)
361 start_bit = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
364 bi->bits = bi->elt1->bits[bi->word_no];
365 if (bi->elt2 && bi->elt1->indx == bi->elt2->indx)
436 bi->bits = bi->elt1->bits[bi->word_no];
444 bi->elt1 = bi->elt1->next;
445 if (!bi->elt1)
447 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
479 bi->bits = bi->elt1->bits[bi->word_no] & bi->elt2->bits[bi->word_no];
489 /* Advance elt1 while it is less than elt2. We always want
493 bi->elt1 = bi->elt1->next;
494 if (!bi->elt1)
497 while (bi->elt1->indx < bi->elt2->indx);
499 /* Advance elt2 to be no less than elt1. This might not
501 while (bi->elt2->indx < bi->elt1->indx)
508 while (bi->elt1->indx != bi->elt2->indx);
510 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
542 bi->bits = bi->elt1->bits[bi->word_no];
543 if (bi->elt2 && bi->elt2->indx == bi->elt1->indx)
551 /* Advance to the next element of elt1. */
552 bi->elt1 = bi->elt1->next;
553 if (!bi->elt1)
556 /* Advance elt2 until it is no less than elt1. */
557 while (bi->elt2 && bi->elt2->indx < bi->elt1->indx)
560 *bit_no = bi->elt1->indx * BITMAP_ELEMENT_ALL_BITS;
