22  * that the number of levels is in fact fixed.
25  * granularity; in all levels except the last, bit N is set iff the N-th
44  * Setting or clearing a range of m bits on all levels, the work to perform
95      * Note that all bitmaps have the same number of levels.  Even a 1-bit
98     unsigned long *levels[HBITMAP_LEVELS];  member
100     /* The length of each levels[] array. */
117         cur = hbi->cur[i] & hb->levels[i][pos];  in hbitmap_iter_skip_words()
139         cur = hb->levels[i + 1][pos];  in hbitmap_iter_skip_words()
152             hbi->hb->levels[HBITMAP_LEVELS - 1][hbi->pos];  in hbitmap_iter_next()
185         hbi->cur[i] = hb->levels[i][pos] & ~((1UL << bit) - 1);  in hbitmap_iter_init()
223     unsigned long *last_lev = hb->levels[HBITMAP_LEVELS - 1];  in hbitmap_next_zero()
442         changed |= hb_set_elem(&hb->levels[level][i], start, next - 1);  in hb_set_between()
449             changed |= (hb->levels[level][i] == 0);  in hb_set_between()
450             hb->levels[level][i] = ~0UL;  in hb_set_between()
453     changed |= hb_set_elem(&hb->levels[level][i], start, last);  in hb_set_between()
526         if (hb_reset_elem(&hb->levels[level][i], start, next - 1)) {  in hb_reset_between()
538             changed |= (hb->levels[level][i] != 0);  in hb_reset_between()
539             hb->levels[level][i] = 0UL;  in hb_reset_between()
544     if (hb_reset_elem(&hb->levels[level][i], start, last)) {  in hb_reset_between()
592         memset(hb->levels[i], 0, hb->sizes[i] * sizeof(unsigned long));  in hbitmap_reset_all()
595     hb->levels[0][0] = 1UL << (BITS_PER_LONG - 1);  in hbitmap_reset_all()
624     return (hb->levels[HBITMAP_LEVELS - 1][pos >> BITS_PER_LEVEL] & bit) != 0;  in hbitmap_get()
655     *first_el = &hb->levels[HBITMAP_LEVELS - 1][start];  in serialization_chunk()
764     /* restore levels starting from penultimate to zero level, assuming  in hbitmap_deserialize_finish()
770         memset(bitmap->levels[lev], 0, size * sizeof(unsigned long));  in hbitmap_deserialize_finish()
773             if (bitmap->levels[lev + 1][i]) {  in hbitmap_deserialize_finish()
774                 bitmap->levels[lev][i >> BITS_PER_LEVEL] |=  in hbitmap_deserialize_finish()
780     bitmap->levels[0][0] |= 1UL << (BITS_PER_LONG - 1);  in hbitmap_deserialize_finish()
789         g_free(hb->levels[i]);  in hbitmap_free()
811         hb->levels[i] = g_new0(unsigned long, size);  in hbitmap_alloc()
819     hb->levels[0][0] |= 1UL << (BITS_PER_LONG - 1);  in hbitmap_alloc()
865         hb->levels[i] = g_renew(unsigned long, hb->levels[i], size);  in hbitmap_truncate()
867             memset(&hb->levels[i][old], 0x00,  in hbitmap_truncate()
868                    (size - old) * sizeof(*hb->levels[i]));  in hbitmap_truncate()
939             result->levels[i][j] = a->levels[i][j] | b->levels[i][j];  in hbitmap_merge()
950     char *data = (char *)bitmap->levels[HBITMAP_LEVELS - 1];  in hbitmap_sha256()