Lines Matching refs:size
52 const unsigned int size = start + len; in __bitmap_set() local
64 mask_to_set &= BITMAP_LAST_WORD_MASK(size); in __bitmap_set()
73 const unsigned int size = start + len; in __bitmap_clear() local
85 mask_to_clear &= BITMAP_LAST_WORD_MASK(size); in __bitmap_clear()
102 find_next_bit(const unsigned long *addr, unsigned long size, in find_next_bit() argument
109 if (offset >= size) in find_next_bit()
110 return size; in find_next_bit()
111 size -= result; in find_next_bit()
116 if (size < BITS_PER_LONG) in find_next_bit()
120 size -= BITS_PER_LONG; in find_next_bit()
123 while (size & ~(BITS_PER_LONG - 1)) { in find_next_bit()
128 size -= BITS_PER_LONG; in find_next_bit()
130 if (!size) in find_next_bit()
135 tmp &= (~0UL >> (BITS_PER_LONG - size)); in find_next_bit()
137 return result + size; /* Nope. */ in find_next_bit()
145 static inline unsigned long find_first_bit(const unsigned long *addr, unsigned long size) in find_first_bit() argument
149 for (idx = 0; idx * BITS_PER_LONG < size; idx++) { in find_first_bit()
151 return min(idx * BITS_PER_LONG + __ffs(addr[idx]), size); in find_first_bit()
154 return size; in find_first_bit()
157 #define for_each_set_bit(bit, addr, size) \ argument
158 for ((bit) = find_first_bit((addr), (size)); \
159 (bit) < (size); \
160 (bit) = find_next_bit((addr), (size), (bit) + 1))
164 unsigned long size, in bitmap_find_next_zero_area() argument
170 index = find_next_zero_bit(map, size, start); in bitmap_find_next_zero_area()
178 if (end > size) in bitmap_find_next_zero_area()