Lines Matching defs:order
29 /* Allocating max_order bitmaps, one for each order */
39 /* In the beginning, we have only one order that is available for
75 unsigned int *order)
88 "ICM Buddy: failed finding free mem for order %d\n",
99 *order = order_iter;
106 * @order: Order of the buddy to update.
110 * It uses the data structures of the buddy system in order to find the first
111 * area of free place, starting from the current order till the maximum order
120 unsigned int order,
126 err = dr_buddy_find_free_seg(buddy, order, &seg, &order_iter);
133 /* If we found free memory in some order that is bigger than the
134 * required order, we need to split every order between the required
135 * order and the order that we found into two parts, and mark accordingly.
137 while (order_iter > order) {
144 seg <<= order;
151 unsigned int seg, unsigned int order)
153 seg >>= order;
158 while (test_bit(seg ^ 1, buddy->bitmap[order])) {
159 bitmap_clear(buddy->bitmap[order], seg ^ 1, 1);
160 --buddy->num_free[order];
162 ++order;
164 bitmap_set(buddy->bitmap[order], seg, 1);
166 ++buddy->num_free[order];