Lines Matching defs:order
605 * - If printing the whole bitmap as list by parts, user must ensure the order
1227 * order: region size (log base 2 of number of bits)
1234 * some size '1 << order' (a power of two), aligned to that same
1235 * '1 << order' power of two.
1247 static int __reg_op(unsigned long *bitmap, unsigned int pos, int order, int reg_op)
1262 nbits_reg = 1 << order;
1303 * @order: region size (log base 2 of number of bits) to find
1307 * a power (@order) of two, aligned to that power of two, which
1313 int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order)
1315 unsigned int pos, end; /* scans bitmap by regions of size order */
1317 for (pos = 0 ; (end = pos + (1U << order)) <= bits; pos = end) {
1318 if (!__reg_op(bitmap, pos, order, REG_OP_ISFREE))
1320 __reg_op(bitmap, pos, order, REG_OP_ALLOC);
1331 * @order: region size (log base 2 of number of bits) to release
1338 void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order)
1340 __reg_op(bitmap, pos, order, REG_OP_RELEASE);
1348 * @order: region size (log base 2 of number of bits) to allocate
1355 int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order)
1357 if (!__reg_op(bitmap, pos, order, REG_OP_ISFREE))
1359 return __reg_op(bitmap, pos, order, REG_OP_ALLOC);
1364 * bitmap_copy_le - copy a bitmap, putting the bits into little-endian order.
1454 * @buf: array of u32 (in host byte order), the source bitmap
1476 * @buf: array of u32 (in host byte order), the dest bitmap
1502 * @buf: array of u64 (in host byte order), the source bitmap
1531 * @buf: array of u64 (in host byte order), the dest bitmap