Home
last modified time | relevance | path

Searched refs:BITMAP_LAST_WORD_MASK (Results 1 – 9 of 9) sorted by relevance

/linux/tools/include/linux/
A Dbitmap.h25 #define BITMAP_LAST_WORD_MASK(nbits) (~0UL >> (-(nbits) & (BITS_PER_LONG - 1))) macro
44 dst[nlongs - 1] = BITMAP_LAST_WORD_MASK(nbits); in bitmap_fill()
50 return ! (*src & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_empty()
58 return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_full()
66 return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_weight()
152 return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0; in bitmap_and()
168 return !((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_equal()
179 return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0; in bitmap_intersects()
/linux/include/linux/
A Dbitmap.h268 dst[nbits / BITS_PER_LONG] &= BITMAP_LAST_WORD_MASK(nbits); in bitmap_copy_clear_tail()
293 return (*dst = *src1 & *src2 & BITMAP_LAST_WORD_MASK(nbits)) != 0; in bitmap_and()
343 return !((*src1 ^ *src2) & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_equal()
367 return !(((*src1 | *src2) ^ *src3) & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_or_equal()
374 return ((*src1 & *src2) & BITMAP_LAST_WORD_MASK(nbits)) != 0; in bitmap_intersects()
383 return ! ((*src1 & ~(*src2)) & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_subset()
391 return ! (*src & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_empty()
399 return ! (~(*src) & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_full()
407 return hweight_long(*src & BITMAP_LAST_WORD_MASK(nbits)); in bitmap_weight()
443 *dst = (*src & BITMAP_LAST_WORD_MASK(nbits)) >> shift; in bitmap_shift_right()
[all …]
A Dcpumask.h957 [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \
965 [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \
1028 [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \
1034 [BITS_TO_LONGS(NR_CPUS)-1] = BITMAP_LAST_WORD_MASK(NR_CPUS) \
A Dnodemask.h305 #define NODE_MASK_LAST_WORD BITMAP_LAST_WORD_MASK(MAX_NUMNODES)
/linux/tools/lib/
A Dbitmap.c16 w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits)); in __bitmap_weight()
71 BITMAP_LAST_WORD_MASK(bits)); in __bitmap_and()
84 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
99 if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_intersects()
/linux/lib/
A Dbitmap.c57 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
81 return (tmp & BITMAP_LAST_WORD_MASK(bits)) == 0; in __bitmap_or_equal()
108 unsigned long mask = BITMAP_LAST_WORD_MASK(nbits); in __bitmap_shift_right()
251 BITMAP_LAST_WORD_MASK(bits)); in __bitmap_and()
289 BITMAP_LAST_WORD_MASK(bits)); in __bitmap_andnot()
315 if ((bitmap1[k] & bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_intersects()
330 if ((bitmap1[k] & ~bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_subset()
345 w += hweight_long(bitmap[k] & BITMAP_LAST_WORD_MASK(bits)); in __bitmap_weight()
366 mask_to_set &= BITMAP_LAST_WORD_MASK(size); in __bitmap_set()
387 mask_to_clear &= BITMAP_LAST_WORD_MASK(size); in __bitmap_clear()
[all …]
A Dfind_bit.c114 unsigned long val = BITMAP_LAST_WORD_MASK(size); in _find_last_bit()
A Dgenalloc.c101 mask_to_set &= BITMAP_LAST_WORD_MASK(size); in bitmap_set_ll()
137 mask_to_clear &= BITMAP_LAST_WORD_MASK(size); in bitmap_clear_ll()
/linux/tools/testing/radix-tree/
A Dbitmap.c20 mask_to_clear &= BITMAP_LAST_WORD_MASK(size); in bitmap_clear()

Completed in 25 milliseconds