43     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_empty()  local
45     for (k = 0; k < lim; ++k) {  in slow_bitmap_empty()
46         if (bitmap[k]) {  in slow_bitmap_empty()
51         if (bitmap[k] & BITMAP_LAST_WORD_MASK(bits)) {  in slow_bitmap_empty()
61     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_full()  local
63     for (k = 0; k < lim; ++k) {  in slow_bitmap_full()
64         if (~bitmap[k]) {  in slow_bitmap_full()
70         if (~bitmap[k] & BITMAP_LAST_WORD_MASK(bits)) {  in slow_bitmap_full()
81     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_equal()  local
83     for (k = 0; k < lim; ++k) {  in slow_bitmap_equal()
84         if (bitmap1[k] != bitmap2[k]) {  in slow_bitmap_equal()
90         if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) {  in slow_bitmap_equal()
101     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_complement()  local
103     for (k = 0; k < lim; ++k) {  in slow_bitmap_complement()
104         dst[k] = ~src[k];  in slow_bitmap_complement()
108         dst[k] = ~src[k] & BITMAP_LAST_WORD_MASK(bits);  in slow_bitmap_complement()
115     long k;  in slow_bitmap_and()  local
119     for (k = 0; k < nr; k++) {  in slow_bitmap_and()
120         result |= (dst[k] = bitmap1[k] & bitmap2[k]);  in slow_bitmap_and()
128     long k;  in slow_bitmap_or()  local
131     for (k = 0; k < nr; k++) {  in slow_bitmap_or()
132         dst[k] = bitmap1[k] | bitmap2[k];  in slow_bitmap_or()
139     long k;  in slow_bitmap_xor()  local
142     for (k = 0; k < nr; k++) {  in slow_bitmap_xor()
143         dst[k] = bitmap1[k] ^ bitmap2[k];  in slow_bitmap_xor()
150     long k;  in slow_bitmap_andnot()  local
154     for (k = 0; k < nr; k++) {  in slow_bitmap_andnot()
155         result |= (dst[k] = bitmap1[k] & ~bitmap2[k]);  in slow_bitmap_andnot()
388     long k, lim = bits/BITS_PER_LONG;  in slow_bitmap_intersects()  local
390     for (k = 0; k < lim; ++k) {  in slow_bitmap_intersects()
391         if (bitmap1[k] & bitmap2[k]) {  in slow_bitmap_intersects()
397         if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) {  in slow_bitmap_intersects()
406     long k, lim = nbits / BITS_PER_LONG, result = 0;  in slow_bitmap_count_one()  local
408     for (k = 0; k < lim; k++) {  in slow_bitmap_count_one()
409         result += ctpopl(bitmap[k]);  in slow_bitmap_count_one()
413         result += ctpopl(bitmap[k] & BITMAP_LAST_WORD_MASK(nbits));  in slow_bitmap_count_one()