Lines Matching full:order
230 static void __free_pages_ok(struct page *page, unsigned int order,
304 static bool page_contains_unaccepted(struct page *page, unsigned int order);
305 static void accept_page(struct page *page, unsigned int order);
306 static bool try_to_accept_memory(struct zone *zone, unsigned int order);
332 _deferred_grow_zone(struct zone *zone, unsigned int order) in _deferred_grow_zone() argument
334 return deferred_grow_zone(zone, order); in _deferred_grow_zone()
521 static inline unsigned int order_to_pindex(int migratetype, int order) in order_to_pindex() argument
524 if (order > PAGE_ALLOC_COSTLY_ORDER) { in order_to_pindex()
525 VM_BUG_ON(order != pageblock_order); in order_to_pindex()
529 VM_BUG_ON(order > PAGE_ALLOC_COSTLY_ORDER); in order_to_pindex()
532 return (MIGRATE_PCPTYPES * order) + migratetype; in order_to_pindex()
537 int order = pindex / MIGRATE_PCPTYPES; in pindex_to_order() local
541 order = pageblock_order; in pindex_to_order()
543 VM_BUG_ON(order > PAGE_ALLOC_COSTLY_ORDER); in pindex_to_order()
546 return order; in pindex_to_order()
549 static inline bool pcp_allowed_order(unsigned int order) in pcp_allowed_order() argument
551 if (order <= PAGE_ALLOC_COSTLY_ORDER) in pcp_allowed_order()
554 if (order == pageblock_order) in pcp_allowed_order()
560 static inline void free_the_page(struct page *page, unsigned int order) in free_the_page() argument
562 if (pcp_allowed_order(order)) /* Via pcp? */ in free_the_page()
563 free_unref_page(page, order); in free_the_page()
565 __free_pages_ok(page, order, FPI_NONE); in free_the_page()
569 * Higher-order pages are called "compound pages". They are structured thusly:
576 * The first tail page's ->compound_order holds the order of allocation.
577 * This usage means that zero-order pages may not be compound.
580 void prep_compound_page(struct page *page, unsigned int order) in prep_compound_page() argument
583 int nr_pages = 1 << order; in prep_compound_page()
589 prep_compound_head(page, order); in prep_compound_page()
606 static inline void set_buddy_order(struct page *page, unsigned int order) in set_buddy_order() argument
608 set_page_private(page, order); in set_buddy_order()
625 int order, int migratetype) in compaction_capture() argument
627 if (!capc || order != capc->cc->order) in compaction_capture()
636 * Do not let lower order allocations pollute a movable pageblock. in compaction_capture()
639 * have trouble finding a high-order free page. in compaction_capture()
641 if (order < pageblock_order && migratetype == MIGRATE_MOVABLE) in compaction_capture()
656 int order, int migratetype) in compaction_capture() argument
664 unsigned int order, int migratetype) in add_to_free_list() argument
666 struct free_area *area = &zone->free_area[order]; in add_to_free_list()
674 unsigned int order, int migratetype) in add_to_free_list_tail() argument
676 struct free_area *area = &zone->free_area[order]; in add_to_free_list_tail()
688 unsigned int order, int migratetype) in move_to_free_list() argument
690 struct free_area *area = &zone->free_area[order]; in move_to_free_list()
696 unsigned int order) in del_page_from_free_list() argument
705 zone->free_area[order].nr_free--; in del_page_from_free_list()
717 * of the next-highest order is free. If it is, it's possible
721 * as a higher order page
725 struct page *page, unsigned int order) in buddy_merge_likely() argument
730 if (order >= MAX_PAGE_ORDER - 1) in buddy_merge_likely()
736 return find_buddy_page_pfn(higher_page, higher_page_pfn, order + 1, in buddy_merge_likely()
753 * free pages of length of (1 << order) and marked with PageBuddy.
754 * Page's order is recorded in page_private(page) field.
766 struct zone *zone, unsigned int order, in __free_one_page() argument
780 __mod_zone_freepage_state(zone, 1 << order, migratetype); in __free_one_page()
782 VM_BUG_ON_PAGE(pfn & ((1 << order) - 1), page); in __free_one_page()
785 while (order < MAX_PAGE_ORDER) { in __free_one_page()
786 if (compaction_capture(capc, page, order, migratetype)) { in __free_one_page()
787 __mod_zone_freepage_state(zone, -(1 << order), in __free_one_page()
792 buddy = find_buddy_page_pfn(page, pfn, order, &buddy_pfn); in __free_one_page()
796 if (unlikely(order >= pageblock_order)) { in __free_one_page()
813 * merge with it and move up one order. in __free_one_page()
816 clear_page_guard(zone, buddy, order, migratetype); in __free_one_page()
818 del_page_from_free_list(buddy, zone, order); in __free_one_page()
822 order++; in __free_one_page()
826 set_buddy_order(page, order); in __free_one_page()
830 else if (is_shuffle_order(order)) in __free_one_page()
833 to_tail = buddy_merge_likely(pfn, buddy_pfn, page, order); in __free_one_page()
836 add_to_free_list_tail(page, zone, order, migratetype); in __free_one_page()
838 add_to_free_list(page, zone, order, migratetype); in __free_one_page()
842 page_reporting_notify_free(order); in __free_one_page()
848 * @order: the order of the page
859 unsigned int order, unsigned long split_pfn_offset) in split_free_page() argument
874 if (!PageBuddy(free_page) || buddy_order(free_page) != order) { in split_free_page()
881 __mod_zone_freepage_state(zone, -(1UL << order), mt); in split_free_page()
883 del_page_from_free_list(free_page, zone, order); in split_free_page()
885 pfn < free_page_pfn + (1UL << order);) { in split_free_page()
889 pfn ? __ffs(pfn) : order, in split_free_page()
897 split_pfn_offset = (1UL << order) - (pfn - free_page_pfn); in split_free_page()
1084 unsigned int order, fpi_t fpi_flags) in free_pages_prepare() argument
1093 trace_mm_page_free(page, order); in free_pages_prepare()
1094 kmsan_free_page(page, order); in free_pages_prepare()
1097 __memcg_kmem_uncharge_page(page, order); in free_pages_prepare()
1099 if (unlikely(PageHWPoison(page)) && !order) { in free_pages_prepare()
1101 reset_page_owner(page, order); in free_pages_prepare()
1102 page_table_check_free(page, order); in free_pages_prepare()
1106 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page); in free_pages_prepare()
1110 * avoid checking PageCompound for order-0 pages. in free_pages_prepare()
1112 if (unlikely(order)) { in free_pages_prepare()
1117 for (i = 1; i < (1 << order); i++) { in free_pages_prepare()
1140 reset_page_owner(page, order); in free_pages_prepare()
1141 page_table_check_free(page, order); in free_pages_prepare()
1145 PAGE_SIZE << order); in free_pages_prepare()
1147 PAGE_SIZE << order); in free_pages_prepare()
1150 kernel_poison_pages(page, 1 << order); in free_pages_prepare()
1161 kasan_poison_pages(page, order, init); in free_pages_prepare()
1168 kernel_init_pages(page, 1 << order); in free_pages_prepare()
1175 arch_free_page(page, order); in free_pages_prepare()
1177 debug_pagealloc_unmap_pages(page, 1 << order); in free_pages_prepare()
1192 unsigned int order; in free_pcppages_bulk() local
1219 order = pindex_to_order(pindex); in free_pcppages_bulk()
1220 nr_pages = 1 << order; in free_pcppages_bulk()
1238 __free_one_page(page, page_to_pfn(page), zone, order, mt, FPI_NONE); in free_pcppages_bulk()
1239 trace_mm_page_pcpu_drain(page, order, mt); in free_pcppages_bulk()
1248 unsigned int order, in free_one_page() argument
1258 __free_one_page(page, pfn, zone, order, migratetype, fpi_flags); in free_one_page()
1262 static void __free_pages_ok(struct page *page, unsigned int order, in __free_pages_ok() argument
1269 if (!free_pages_prepare(page, order, fpi_flags)) in __free_pages_ok()
1279 free_one_page(zone, page, pfn, order, migratetype, fpi_flags); in __free_pages_ok()
1281 __count_vm_events(PGFREE, 1 << order); in __free_pages_ok()
1284 void __free_pages_core(struct page *page, unsigned int order) in __free_pages_core() argument
1286 unsigned int nr_pages = 1 << order; in __free_pages_core()
1306 if (page_contains_unaccepted(page, order)) { in __free_pages_core()
1307 if (order == MAX_PAGE_ORDER && __free_unaccepted(page)) in __free_pages_core()
1310 accept_page(page, order); in __free_pages_core()
1317 __free_pages_ok(page, order, FPI_TO_TAIL); in __free_pages_core()
1337 * of the pfn range). For example, if the pageblock order is MAX_PAGE_ORDER, which
1373 * The order of subdivision here is critical for the IO subsystem.
1374 * Please do not alter this order without good reasons and regression
1376 * the order in which smaller blocks are delivered depends on the order
1378 * influencing the order in which pages are delivered to the IO
1435 static inline bool check_new_pages(struct page *page, unsigned int order) in check_new_pages() argument
1438 for (int i = 0; i < (1 << order); i++) { in check_new_pages()
1477 inline void post_alloc_hook(struct page *page, unsigned int order, in post_alloc_hook() argument
1488 arch_alloc_page(page, order); in post_alloc_hook()
1489 debug_pagealloc_map_pages(page, 1 << order); in post_alloc_hook()
1496 kernel_unpoison_pages(page, 1 << order); in post_alloc_hook()
1510 for (i = 0; i != 1 << order; ++i) in post_alloc_hook()
1517 kasan_unpoison_pages(page, order, init)) { in post_alloc_hook()
1526 for (i = 0; i != 1 << order; ++i) in post_alloc_hook()
1531 kernel_init_pages(page, 1 << order); in post_alloc_hook()
1533 set_page_owner(page, order, gfp_flags); in post_alloc_hook()
1534 page_table_check_alloc(page, order); in post_alloc_hook()
1537 static void prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags, in prep_new_page() argument
1540 post_alloc_hook(page, order, gfp_flags); in prep_new_page()
1542 if (order && (gfp_flags & __GFP_COMP)) in prep_new_page()
1543 prep_compound_page(page, order); in prep_new_page()
1562 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order, in __rmqueue_smallest() argument
1570 for (current_order = order; current_order < NR_PAGE_ORDERS; ++current_order) { in __rmqueue_smallest()
1576 expand(zone, page, order, current_order, migratetype); in __rmqueue_smallest()
1578 trace_mm_page_alloc_zone_locked(page, order, migratetype, in __rmqueue_smallest()
1579 pcp_allowed_order(order) && in __rmqueue_smallest()
1589 * This array describes the order lists are fallen back to when
1602 unsigned int order) in __rmqueue_cma_fallback() argument
1604 return __rmqueue_smallest(zone, order, MIGRATE_CMA); in __rmqueue_cma_fallback()
1608 unsigned int order) { return NULL; } in __rmqueue_cma_fallback() argument
1622 unsigned int order; in move_freepages() local
1644 order = buddy_order(page); in move_freepages()
1645 move_to_free_list(page, zone, order, migratetype); in move_freepages()
1646 pfn += 1 << order; in move_freepages()
1647 pages_moved += 1 << order; in move_freepages()
1698 static bool can_steal_fallback(unsigned int order, int start_mt) in can_steal_fallback() argument
1701 * Leaving this order check is intended, although there is in can_steal_fallback()
1702 * relaxed order check in next check. The reason is that in can_steal_fallback()
1707 if (order >= pageblock_order) in can_steal_fallback()
1710 if (order >= pageblock_order / 2 || in can_steal_fallback()
1757 * This function implements actual steal behaviour. If order is large enough,
1840 * Check whether there is a suitable fallback freepage with requested order.
1845 int find_suitable_fallback(struct free_area *area, unsigned int order, in find_suitable_fallback() argument
1860 if (can_steal_fallback(order, migratetype)) in find_suitable_fallback()
1874 * Reserve a pageblock for exclusive use of high-order atomic allocations if
1875 * there are no empty page blocks that contain a page with a suitable order
1915 * potentially hurts the reliability of high-order allocations when under
1930 int order; in unreserve_highatomic_pageblock() local
1944 for (order = 0; order < NR_PAGE_ORDERS; order++) { in unreserve_highatomic_pageblock()
1945 struct free_area *area = &(zone->free_area[order]); in unreserve_highatomic_pageblock()
2000 * The use of signed ints for order and current_order is a deliberate
2005 __rmqueue_fallback(struct zone *zone, int order, int start_migratetype, in __rmqueue_fallback() argument
2010 int min_order = order; in __rmqueue_fallback()
2020 if (order < pageblock_order && alloc_flags & ALLOC_NOFRAGMENT) in __rmqueue_fallback()
2045 && current_order > order) in __rmqueue_fallback()
2054 for (current_order = order; current_order < NR_PAGE_ORDERS; current_order++) { in __rmqueue_fallback()
2074 trace_mm_page_alloc_extfrag(page, order, current_order, in __rmqueue_fallback()
2086 __rmqueue(struct zone *zone, unsigned int order, int migratetype, in __rmqueue() argument
2100 page = __rmqueue_cma_fallback(zone, order); in __rmqueue()
2106 page = __rmqueue_smallest(zone, order, migratetype); in __rmqueue()
2109 page = __rmqueue_cma_fallback(zone, order); in __rmqueue()
2111 if (!page && __rmqueue_fallback(zone, order, migratetype, in __rmqueue()
2123 static int rmqueue_bulk(struct zone *zone, unsigned int order, in rmqueue_bulk() argument
2132 struct page *page = __rmqueue(zone, order, migratetype, in rmqueue_bulk()
2139 * physical page order. The page is added to the tail of in rmqueue_bulk()
2143 * head, thus also in the physical page order. This is useful in rmqueue_bulk()
2150 -(1 << order)); in rmqueue_bulk()
2153 __mod_zone_page_state(zone, NR_FREE_PAGES, -(i << order)); in rmqueue_bulk()
2342 unsigned int order) in free_unref_page_prepare() argument
2346 if (!free_pages_prepare(page, order, FPI_NONE)) in free_unref_page_prepare()
2358 /* Free as much as possible if batch freeing high-order pages. */ in nr_pcp_free()
2429 unsigned int order) in free_unref_page_commit() argument
2441 __count_vm_events(PGFREE, 1 << order); in free_unref_page_commit()
2442 pindex = order_to_pindex(migratetype, order); in free_unref_page_commit()
2444 pcp->count += 1 << order; in free_unref_page_commit()
2448 * As high-order pages other than THP's stored on PCP can contribute in free_unref_page_commit()
2453 if (order && order <= PAGE_ALLOC_COSTLY_ORDER) { in free_unref_page_commit()
2463 pcp->free_count += (1 << order); in free_unref_page_commit()
2478 void free_unref_page(struct page *page, unsigned int order) in free_unref_page() argument
2486 if (!free_unref_page_prepare(page, pfn, order)) in free_unref_page()
2499 free_one_page(page_zone(page), page, pfn, order, migratetype, FPI_NONE); in free_unref_page()
2509 free_unref_page_commit(zone, pcp, page, pcpmigratetype, order); in free_unref_page()
2512 free_one_page(zone, page, pfn, order, migratetype, FPI_NONE); in free_unref_page()
2518 * Free a list of 0-order pages
2603 * split_page takes a non-compound higher-order page, and splits it into
2604 * n (1<<order) sub-pages: page[0..n]
2610 void split_page(struct page *page, unsigned int order) in split_page() argument
2617 for (i = 1; i < (1 << order); i++) in split_page()
2619 split_page_owner(page, 1 << order); in split_page()
2620 split_page_memcg(page, 1 << order); in split_page()
2624 int __isolate_free_page(struct page *page, unsigned int order) in __isolate_free_page() argument
2633 * emulate a high-order watermark check with a raised order-0 in __isolate_free_page()
2634 * watermark, because we already know our high-order page in __isolate_free_page()
2637 watermark = zone->_watermark[WMARK_MIN] + (1UL << order); in __isolate_free_page()
2641 __mod_zone_freepage_state(zone, -(1UL << order), mt); in __isolate_free_page()
2644 del_page_from_free_list(page, zone, order); in __isolate_free_page()
2650 if (order >= pageblock_order - 1) { in __isolate_free_page()
2651 struct page *endpage = page + (1 << order) - 1; in __isolate_free_page()
2664 return 1UL << order; in __isolate_free_page()
2670 * @order: Order of the isolated page
2676 void __putback_isolated_page(struct page *page, unsigned int order, int mt) in __putback_isolated_page() argument
2684 __free_one_page(page, page_to_pfn(page), zone, order, mt, in __putback_isolated_page()
2716 unsigned int order, unsigned int alloc_flags, in rmqueue_buddy() argument
2726 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC); in rmqueue_buddy()
2728 page = __rmqueue(zone, order, migratetype, alloc_flags); in rmqueue_buddy()
2733 * failing a high-order atomic allocation in the in rmqueue_buddy()
2737 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC); in rmqueue_buddy()
2744 __mod_zone_freepage_state(zone, -(1 << order), in rmqueue_buddy()
2747 } while (check_new_pages(page, order)); in rmqueue_buddy()
2749 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order); in rmqueue_buddy()
2755 static int nr_pcp_alloc(struct per_cpu_pages *pcp, struct zone *zone, int order) in nr_pcp_alloc() argument
2769 if (order) in nr_pcp_alloc()
2781 if (!order) { in nr_pcp_alloc()
2785 * subsequent allocation of order-0 pages without any freeing. in nr_pcp_alloc()
2794 * Scale batch relative to order if batch implies free pages in nr_pcp_alloc()
2800 batch = max(batch >> order, 2); in nr_pcp_alloc()
2807 struct page *__rmqueue_pcplist(struct zone *zone, unsigned int order, in __rmqueue_pcplist() argument
2817 int batch = nr_pcp_alloc(pcp, zone, order); in __rmqueue_pcplist()
2820 alloced = rmqueue_bulk(zone, order, in __rmqueue_pcplist()
2824 pcp->count += alloced << order; in __rmqueue_pcplist()
2831 pcp->count -= 1 << order; in __rmqueue_pcplist()
2832 } while (check_new_pages(page, order)); in __rmqueue_pcplist()
2839 struct zone *zone, unsigned int order, in rmqueue_pcplist() argument
2861 list = &pcp->lists[order_to_pindex(migratetype, order)]; in rmqueue_pcplist()
2862 page = __rmqueue_pcplist(zone, order, migratetype, alloc_flags, pcp, list); in rmqueue_pcplist()
2866 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order); in rmqueue_pcplist()
2874 * Use pcplists for THP or "cheap" high-order allocations.
2886 struct zone *zone, unsigned int order, in rmqueue() argument
2894 * allocate greater than order-1 page units with __GFP_NOFAIL. in rmqueue()
2896 WARN_ON_ONCE((gfp_flags & __GFP_NOFAIL) && (order > 1)); in rmqueue()
2898 if (likely(pcp_allowed_order(order))) { in rmqueue()
2899 page = rmqueue_pcplist(preferred_zone, zone, order, in rmqueue()
2905 page = rmqueue_buddy(preferred_zone, zone, order, alloc_flags, in rmqueue()
2920 noinline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order) in should_fail_alloc_page() argument
2922 return __should_fail_alloc_page(gfp_mask, order); in should_fail_alloc_page()
2927 unsigned int order, unsigned int alloc_flags) in __zone_watermark_unusable_free() argument
2929 long unusable_free = (1 << order) - 1; in __zone_watermark_unusable_free()
2952 * Return true if free base pages are above 'mark'. For high-order checks it
2953 * will return true of the order-0 watermark is reached and there is at least
2957 bool __zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark, in __zone_watermark_ok() argument
2965 free_pages -= __zone_watermark_unusable_free(z, order, alloc_flags); in __zone_watermark_ok()
2997 * Check watermarks for an order-0 allocation request. If these in __zone_watermark_ok()
2998 * are not met, then a high-order request also cannot go ahead in __zone_watermark_ok()
3004 /* If this is an order-0 request then the watermark is fine */ in __zone_watermark_ok()
3005 if (!order) in __zone_watermark_ok()
3008 /* For a high-order request, check at least one suitable page is free */ in __zone_watermark_ok()
3009 for (o = order; o < NR_PAGE_ORDERS; o++) { in __zone_watermark_ok()
3035 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark, in zone_watermark_ok() argument
3038 return __zone_watermark_ok(z, order, mark, highest_zoneidx, alloc_flags, in zone_watermark_ok()
3042 static inline bool zone_watermark_fast(struct zone *z, unsigned int order, in zone_watermark_fast() argument
3051 * Fast check for order-0 only. If this fails then the reserves in zone_watermark_fast()
3054 if (!order) { in zone_watermark_fast()
3067 if (__zone_watermark_ok(z, order, mark, highest_zoneidx, alloc_flags, in zone_watermark_fast()
3072 * Ignore watermark boosting for __GFP_HIGH order-0 allocations in zone_watermark_fast()
3077 if (unlikely(!order && (alloc_flags & ALLOC_MIN_RESERVE) && z->watermark_boost in zone_watermark_fast()
3080 return __zone_watermark_ok(z, order, mark, highest_zoneidx, in zone_watermark_fast()
3087 bool zone_watermark_ok_safe(struct zone *z, unsigned int order, in zone_watermark_ok_safe() argument
3095 return __zone_watermark_ok(z, order, mark, highest_zoneidx, 0, in zone_watermark_ok_safe()
3170 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags, in get_page_from_freelist() argument
3251 if (zone_watermark_fast(zone, order, mark, in get_page_from_freelist()
3260 if (!zone_watermark_fast(zone, order, mark, in get_page_from_freelist()
3266 if (try_to_accept_memory(zone, order)) in get_page_from_freelist()
3276 if (_deferred_grow_zone(zone, order)) in get_page_from_freelist()
3289 ret = node_reclaim(zone->zone_pgdat, gfp_mask, order); in get_page_from_freelist()
3299 if (zone_watermark_ok(zone, order, mark, in get_page_from_freelist()
3308 page = rmqueue(ac->preferred_zoneref->zone, zone, order, in get_page_from_freelist()
3311 prep_new_page(page, order, gfp_mask, alloc_flags); in get_page_from_freelist()
3314 * If this is a high-order atomic allocation then check in get_page_from_freelist()
3323 if (try_to_accept_memory(zone, order)) in get_page_from_freelist()
3330 if (_deferred_grow_zone(zone, order)) in get_page_from_freelist()
3394 __alloc_pages_cpuset_fallback(gfp_t gfp_mask, unsigned int order, in __alloc_pages_cpuset_fallback() argument
3400 page = get_page_from_freelist(gfp_mask, order, in __alloc_pages_cpuset_fallback()
3407 page = get_page_from_freelist(gfp_mask, order, in __alloc_pages_cpuset_fallback()
3414 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order, in __alloc_pages_may_oom() argument
3422 .order = order, in __alloc_pages_may_oom()
3446 ~__GFP_DIRECT_RECLAIM, order, in __alloc_pages_may_oom()
3454 /* The OOM killer will not help higher order allocs */ in __alloc_pages_may_oom()
3455 if (order > PAGE_ALLOC_COSTLY_ORDER) in __alloc_pages_may_oom()
3492 page = __alloc_pages_cpuset_fallback(gfp_mask, order, in __alloc_pages_may_oom()
3507 /* Try memory compaction for high-order allocations before reclaim */
3509 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order, in __alloc_pages_direct_compact() argument
3517 if (!order) in __alloc_pages_direct_compact()
3524 *compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac, in __alloc_pages_direct_compact()
3541 prep_new_page(page, order, gfp_mask, alloc_flags); in __alloc_pages_direct_compact()
3545 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac); in __alloc_pages_direct_compact()
3551 compaction_defer_reset(zone, order, true); in __alloc_pages_direct_compact()
3568 should_compact_retry(struct alloc_context *ac, int order, int alloc_flags, in should_compact_retry() argument
3579 if (!order) in should_compact_retry()
3586 * Compaction was skipped due to a lack of free order-0 in should_compact_retry()
3590 ret = compaction_zonelist_suitable(ac, order, alloc_flags); in should_compact_retry()
3608 if (order > PAGE_ALLOC_COSTLY_ORDER) in should_compact_retry()
3620 min_priority = (order > PAGE_ALLOC_COSTLY_ORDER) ? in should_compact_retry()
3629 trace_compact_retry(order, priority, compact_result, retries, max_retries, ret); in should_compact_retry()
3634 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order, in __alloc_pages_direct_compact() argument
3643 should_compact_retry(struct alloc_context *ac, unsigned int order, int alloc_flags, in should_compact_retry() argument
3651 if (!order || order > PAGE_ALLOC_COSTLY_ORDER) in should_compact_retry()
3657 * Let's give them a good hope and keep retrying while the order-0 in should_compact_retry()
3755 __perform_reclaim(gfp_t gfp_mask, unsigned int order, in __perform_reclaim() argument
3768 progress = try_to_free_pages(ac->zonelist, order, gfp_mask, in __perform_reclaim()
3781 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order, in __alloc_pages_direct_reclaim() argument
3790 *did_some_progress = __perform_reclaim(gfp_mask, order, ac); in __alloc_pages_direct_reclaim()
3795 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac); in __alloc_pages_direct_reclaim()
3814 static void wake_all_kswapds(unsigned int order, gfp_t gfp_mask, in wake_all_kswapds() argument
3827 wakeup_kswapd(zone, gfp_mask, order, highest_zoneidx); in wake_all_kswapds()
3834 gfp_to_alloc_flags(gfp_t gfp_mask, unsigned int order) in gfp_to_alloc_flags() argument
3863 if (order > 0) in gfp_to_alloc_flags()
3935 should_reclaim_retry(gfp_t gfp_mask, unsigned order, in should_reclaim_retry() argument
3945 * their order will become available due to high fragmentation so in should_reclaim_retry()
3948 if (did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER) in should_reclaim_retry()
3977 wmark = __zone_watermark_ok(zone, order, min_wmark, in should_reclaim_retry()
3979 trace_reclaim_retry_zone(z, order, reclaimable, in should_reclaim_retry()
4040 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order, in __alloc_pages_slowpath() argument
4045 const bool costly_order = order > PAGE_ALLOC_COSTLY_ORDER; in __alloc_pages_slowpath()
4069 alloc_flags = gfp_to_alloc_flags(gfp_mask, order); in __alloc_pages_slowpath()
4096 wake_all_kswapds(order, gfp_mask, ac); in __alloc_pages_slowpath()
4102 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac); in __alloc_pages_slowpath()
4109 * movable high-order allocations, do that as well, as compaction will in __alloc_pages_slowpath()
4117 (order > 0 && ac->migratetype != MIGRATE_MOVABLE)) in __alloc_pages_slowpath()
4119 page = __alloc_pages_direct_compact(gfp_mask, order, in __alloc_pages_slowpath()
4135 * order, fail immediately unless the allocator has in __alloc_pages_slowpath()
4141 * bursty high order allocations, in __alloc_pages_slowpath()
4164 wake_all_kswapds(order, gfp_mask, ac); in __alloc_pages_slowpath()
4183 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac); in __alloc_pages_slowpath()
4196 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac, in __alloc_pages_slowpath()
4202 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac, in __alloc_pages_slowpath()
4212 * Do not retry costly high order allocations unless they are in __alloc_pages_slowpath()
4219 if (should_reclaim_retry(gfp_mask, order, ac, alloc_flags, in __alloc_pages_slowpath()
4224 * It doesn't make any sense to retry for the compaction if the order-0 in __alloc_pages_slowpath()
4230 should_compact_retry(ac, order, alloc_flags, in __alloc_pages_slowpath()
4245 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress); in __alloc_pages_slowpath()
4304 page = __alloc_pages_cpuset_fallback(gfp_mask, order, ALLOC_MIN_RESERVE, ac); in __alloc_pages_slowpath()
4313 "page allocation failure: order:%u", order); in __alloc_pages_slowpath()
4318 static inline bool prepare_alloc_pages(gfp_t gfp_mask, unsigned int order, in prepare_alloc_pages() argument
4342 if (should_fail_alloc_page(gfp_mask, order)) in prepare_alloc_pages()
4362 * __alloc_pages_bulk - Allocate a number of order-0 pages to a list or array
4533 struct page *__alloc_pages(gfp_t gfp, unsigned int order, int preferred_nid, in __alloc_pages() argument
4542 * There are several places where we assume that the order value is sane in __alloc_pages()
4545 if (WARN_ON_ONCE_GFP(order > MAX_PAGE_ORDER, gfp)) in __alloc_pages()
4558 if (!prepare_alloc_pages(gfp, order, preferred_nid, nodemask, &ac, in __alloc_pages()
4569 page = get_page_from_freelist(alloc_gfp, order, alloc_flags, &ac); in __alloc_pages()
4582 page = __alloc_pages_slowpath(alloc_gfp, order, &ac); in __alloc_pages()
4586 unlikely(__memcg_kmem_charge_page(page, gfp, order) != 0)) { in __alloc_pages()
4587 __free_pages(page, order); in __alloc_pages()
4591 trace_mm_page_alloc(page, order, alloc_gfp, ac.migratetype); in __alloc_pages()
4592 kmsan_alloc_page(page, order, alloc_gfp); in __alloc_pages()
4598 struct folio *__folio_alloc(gfp_t gfp, unsigned int order, int preferred_nid, in __folio_alloc() argument
4601 struct page *page = __alloc_pages(gfp | __GFP_COMP, order, in __folio_alloc()
4612 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order) in __get_free_pages() argument
4616 page = alloc_pages(gfp_mask & ~__GFP_HIGHMEM, order); in __get_free_pages()
4632 * @order: The order of the allocation.
4635 * pages. It does not check that the @order passed in matches that of
4649 void __free_pages(struct page *page, unsigned int order) in __free_pages() argument
4655 free_the_page(page, order); in __free_pages()
4657 while (order-- > 0) in __free_pages()
4658 free_the_page(page + (1 << order), order); in __free_pages()
4662 void free_pages(unsigned long addr, unsigned int order) in free_pages() argument
4666 __free_pages(virt_to_page((void *)addr), order); in free_pages()
4675 * within a 0 or higher order page. Multiple fragments within that page
4787 * Frees a page fragment allocated out of either a compound or order 0 page.
4798 static void *make_alloc_exact(unsigned long addr, unsigned int order, in make_alloc_exact() argument
4806 split_page_owner(page, 1 << order); in make_alloc_exact()
4807 split_page_memcg(page, 1 << order); in make_alloc_exact()
4811 last = page + (1UL << order); in make_alloc_exact()
4835 unsigned int order = get_order(size); in alloc_pages_exact() local
4841 addr = __get_free_pages(gfp_mask, order); in alloc_pages_exact()
4842 return make_alloc_exact(addr, order, size); in alloc_pages_exact()
4860 unsigned int order = get_order(size); in alloc_pages_exact_nid() local
4866 p = alloc_pages_node(nid, gfp_mask, order); in alloc_pages_exact_nid()
4869 return make_alloc_exact((unsigned long)page_address(p), order, size); in alloc_pages_exact_nid()
5137 pr_info("Fallback order for Node %d: ", local_node); in build_zonelists()
5302 * needs the percpu allocator in order to allocate its pagesets in build_all_zonelists_init()
5393 * fragmented and becoming unavailable for high-order allocations. in zone_batchsize()
5589 * consecutive high-order pages freeing without allocation. in zone_pcp_update_cacheinfo()
6308 int order; in alloc_contig_range() local
6313 .order = -1, in alloc_contig_range()
6325 * MIGRATE_ISOLATE. Because pageblock and max order pages may in alloc_contig_range()
6374 * page allocator holds, ie. they can be part of higher order in alloc_contig_range()
6382 order = 0; in alloc_contig_range()
6385 if (++order > MAX_PAGE_ORDER) { in alloc_contig_range()
6389 outer_start &= ~0UL << order; in alloc_contig_range()
6393 order = buddy_order(pfn_to_page(outer_start)); in alloc_contig_range()
6396 * outer_start page could be small order buddy page and in alloc_contig_range()
6401 if (outer_start + (1UL << order) <= start) in alloc_contig_range()
6594 unsigned int order; in __offline_isolated_pages() local
6623 order = buddy_order(page); in __offline_isolated_pages()
6624 del_page_from_free_list(page, zone, order); in __offline_isolated_pages()
6625 pfn += (1 << order); in __offline_isolated_pages()
6637 unsigned int order; in is_free_buddy_page() local
6639 for (order = 0; order < NR_PAGE_ORDERS; order++) { in is_free_buddy_page()
6640 struct page *page_head = page - (pfn & ((1 << order) - 1)); in is_free_buddy_page()
6643 buddy_order_unsafe(page_head) >= order) in is_free_buddy_page()
6647 return order <= MAX_PAGE_ORDER; in is_free_buddy_page()
6653 * Break down a higher-order page in sub-pages, and keep our target out of
6690 unsigned int order; in take_page_off_buddy() local
6694 for (order = 0; order < NR_PAGE_ORDERS; order++) { in take_page_off_buddy()
6695 struct page *page_head = page - (pfn & ((1 << order) - 1)); in take_page_off_buddy()
6698 if (PageBuddy(page_head) && page_order >= order) { in take_page_off_buddy()
6780 static bool page_contains_unaccepted(struct page *page, unsigned int order) in page_contains_unaccepted() argument
6783 phys_addr_t end = start + (PAGE_SIZE << order); in page_contains_unaccepted()
6788 static void accept_page(struct page *page, unsigned int order) in accept_page() argument
6792 accept_memory(start, start + (PAGE_SIZE << order)); in accept_page()
6829 static bool try_to_accept_memory(struct zone *zone, unsigned int order) in try_to_accept_memory() argument
6837 __zone_watermark_unusable_free(zone, order, 0)); in try_to_accept_memory()
6879 static bool page_contains_unaccepted(struct page *page, unsigned int order) in page_contains_unaccepted() argument
6884 static void accept_page(struct page *page, unsigned int order) in accept_page() argument
6888 static bool try_to_accept_memory(struct zone *zone, unsigned int order) in try_to_accept_memory() argument