Lines Matching defs:order
108 /* Allocation order */
109 s8 order;
293 * 1) Any buddy B1 will have an order O twin B2 which satisfies
296 * For example, if the starting buddy (buddy2) is #8 its order
300 * 2) Any buddy B will have an order O+1 parent P which
307 __find_buddy_pfn(unsigned long page_pfn, unsigned int order)
309 return page_pfn ^ (1 << order);
324 extern int __isolate_free_page(struct page *page, unsigned int order);
325 extern void __putback_isolated_page(struct page *page, unsigned int order,
328 unsigned int order);
329 extern void __free_pages_core(struct page *page, unsigned int order);
330 extern void prep_compound_page(struct page *page, unsigned int order);
331 extern void post_alloc_hook(struct page *page, unsigned int order,
362 short search_order; /* order to start a fast search at */
364 int order; /* order a direct compactor needs */
395 int find_suitable_fallback(struct free_area *area, unsigned int order,
401 * This function returns the order of a free page in the buddy system. In
403 * page from being allocated in parallel and returning garbage as the order.
678 unsigned int order)