Lines Matching defs:order
1089 * order: region size (log base 2 of number of bits)
1096 * some size '1 << order' (a power of two), aligned to that same
1097 * '1 << order' power of two.
1109 static int __reg_op(unsigned long *bitmap, unsigned int pos, int order, int reg_op)
1124 nbits_reg = 1 << order;
1165 * @order: region size (log base 2 of number of bits) to find
1169 * a power (@order) of two, aligned to that power of two, which
1175 int bitmap_find_free_region(unsigned long *bitmap, unsigned int bits, int order)
1177 unsigned int pos, end; /* scans bitmap by regions of size order */
1179 for (pos = 0 ; (end = pos + (1U << order)) <= bits; pos = end) {
1180 if (!__reg_op(bitmap, pos, order, REG_OP_ISFREE))
1182 __reg_op(bitmap, pos, order, REG_OP_ALLOC);
1193 * @order: region size (log base 2 of number of bits) to release
1200 void bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order)
1202 __reg_op(bitmap, pos, order, REG_OP_RELEASE);
1210 * @order: region size (log base 2 of number of bits) to allocate
1217 int bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order)
1219 if (!__reg_op(bitmap, pos, order, REG_OP_ISFREE))
1221 return __reg_op(bitmap, pos, order, REG_OP_ALLOC);
1226 * bitmap_copy_le - copy a bitmap, putting the bits into little-endian order.
1303 * @buf: array of u32 (in host byte order), the source bitmap
1325 * @buf: array of u32 (in host byte order), the dest bitmap