Lines Matching refs:buddy
13 * Index the hyp_vmemmap to find a potential buddy page, but make no assumption
16 * Example buddy-tree for a 4-pages physically contiguous pool:
51 /* Find a buddy page currently available for allocation */
56 struct hyp_page *buddy = __find_buddy_nocheck(pool, p, order);
58 if (!buddy || buddy->order != order || buddy->refcount)
61 return buddy;
98 struct hyp_page *buddy;
114 buddy = __find_buddy_avail(pool, p, order);
115 if (!buddy)
118 /* Take the buddy out of its list, and coalesce with @p */
119 page_remove_from_list(buddy);
120 buddy->order = HYP_NO_ORDER;
121 p = min(p, buddy);
134 struct hyp_page *buddy;
139 * The buddy of order n - 1 currently has HYP_NO_ORDER as it
145 buddy = __find_buddy_nocheck(pool, p, p->order);
146 buddy->order = p->order;
147 page_add_to_list(buddy, &pool->free_area[buddy->order]);
160 * Changes to the buddy tree and page refcounts must be done with the hyp_pool
161 * lock held. If a refcount change requires an update to the buddy tree (e.g.
243 /* Attach the unused pages to the buddy tree */