Lines Matching full:order
229 static void __free_pages_ok(struct page *page, unsigned int order,
303 static bool page_contains_unaccepted(struct page *page, unsigned int order);
304 static void accept_page(struct page *page, unsigned int order);
305 static bool try_to_accept_memory(struct zone *zone, unsigned int order);
331 _deferred_grow_zone(struct zone *zone, unsigned int order) in _deferred_grow_zone() argument
333 return deferred_grow_zone(zone, order); in _deferred_grow_zone()
520 static inline unsigned int order_to_pindex(int migratetype, int order) in order_to_pindex() argument
523 if (order > PAGE_ALLOC_COSTLY_ORDER) { in order_to_pindex()
524 VM_BUG_ON(order != pageblock_order); in order_to_pindex()
528 VM_BUG_ON(order > PAGE_ALLOC_COSTLY_ORDER); in order_to_pindex()
531 return (MIGRATE_PCPTYPES * order) + migratetype; in order_to_pindex()
536 int order = pindex / MIGRATE_PCPTYPES; in pindex_to_order() local
540 order = pageblock_order; in pindex_to_order()
542 VM_BUG_ON(order > PAGE_ALLOC_COSTLY_ORDER); in pindex_to_order()
545 return order; in pindex_to_order()
548 static inline bool pcp_allowed_order(unsigned int order) in pcp_allowed_order() argument
550 if (order <= PAGE_ALLOC_COSTLY_ORDER) in pcp_allowed_order()
553 if (order == pageblock_order) in pcp_allowed_order()
559 static inline void free_the_page(struct page *page, unsigned int order) in free_the_page() argument
561 if (pcp_allowed_order(order)) /* Via pcp? */ in free_the_page()
562 free_unref_page(page, order); in free_the_page()
564 __free_pages_ok(page, order, FPI_NONE); in free_the_page()
568 * Higher-order pages are called "compound pages". They are structured thusly:
575 * The first tail page's ->compound_order holds the order of allocation.
576 * This usage means that zero-order pages may not be compound.
579 void prep_compound_page(struct page *page, unsigned int order) in prep_compound_page() argument
582 int nr_pages = 1 << order; in prep_compound_page()
588 prep_compound_head(page, order); in prep_compound_page()
605 static inline void set_buddy_order(struct page *page, unsigned int order) in set_buddy_order() argument
607 set_page_private(page, order); in set_buddy_order()
624 int order, int migratetype) in compaction_capture() argument
626 if (!capc || order != capc->cc->order) in compaction_capture()
635 * Do not let lower order allocations pollute a movable pageblock. in compaction_capture()
638 * have trouble finding a high-order free page. in compaction_capture()
640 if (order < pageblock_order && migratetype == MIGRATE_MOVABLE) in compaction_capture()
655 int order, int migratetype) in compaction_capture() argument
663 unsigned int order, int migratetype) in add_to_free_list() argument
665 struct free_area *area = &zone->free_area[order]; in add_to_free_list()
673 unsigned int order, int migratetype) in add_to_free_list_tail() argument
675 struct free_area *area = &zone->free_area[order]; in add_to_free_list_tail()
687 unsigned int order, int migratetype) in move_to_free_list() argument
689 struct free_area *area = &zone->free_area[order]; in move_to_free_list()
695 unsigned int order) in del_page_from_free_list() argument
704 zone->free_area[order].nr_free--; in del_page_from_free_list()
716 * of the next-highest order is free. If it is, it's possible
720 * as a higher order page
724 struct page *page, unsigned int order) in buddy_merge_likely() argument
729 if (order >= MAX_ORDER - 1) in buddy_merge_likely()
735 return find_buddy_page_pfn(higher_page, higher_page_pfn, order + 1, in buddy_merge_likely()
752 * free pages of length of (1 << order) and marked with PageBuddy.
753 * Page's order is recorded in page_private(page) field.
765 struct zone *zone, unsigned int order, in __free_one_page() argument
779 __mod_zone_freepage_state(zone, 1 << order, migratetype); in __free_one_page()
781 VM_BUG_ON_PAGE(pfn & ((1 << order) - 1), page); in __free_one_page()
784 while (order < MAX_ORDER) { in __free_one_page()
785 if (compaction_capture(capc, page, order, migratetype)) { in __free_one_page()
786 __mod_zone_freepage_state(zone, -(1 << order), in __free_one_page()
791 buddy = find_buddy_page_pfn(page, pfn, order, &buddy_pfn); in __free_one_page()
795 if (unlikely(order >= pageblock_order)) { in __free_one_page()
812 * merge with it and move up one order. in __free_one_page()
815 clear_page_guard(zone, buddy, order, migratetype); in __free_one_page()
817 del_page_from_free_list(buddy, zone, order); in __free_one_page()
821 order++; in __free_one_page()
825 set_buddy_order(page, order); in __free_one_page()
829 else if (is_shuffle_order(order)) in __free_one_page()
832 to_tail = buddy_merge_likely(pfn, buddy_pfn, page, order); in __free_one_page()
835 add_to_free_list_tail(page, zone, order, migratetype); in __free_one_page()
837 add_to_free_list(page, zone, order, migratetype); in __free_one_page()
841 page_reporting_notify_free(order); in __free_one_page()
847 * @order: the order of the page
858 unsigned int order, unsigned long split_pfn_offset) in split_free_page() argument
873 if (!PageBuddy(free_page) || buddy_order(free_page) != order) { in split_free_page()
880 __mod_zone_freepage_state(zone, -(1UL << order), mt); in split_free_page()
882 del_page_from_free_list(free_page, zone, order); in split_free_page()
884 pfn < free_page_pfn + (1UL << order);) { in split_free_page()
888 pfn ? __ffs(pfn) : order, in split_free_page()
896 split_pfn_offset = (1UL << order) - (pfn - free_page_pfn); in split_free_page()
1076 unsigned int order, fpi_t fpi_flags) in free_pages_prepare() argument
1084 trace_mm_page_free(page, order); in free_pages_prepare()
1085 kmsan_free_page(page, order); in free_pages_prepare()
1087 if (unlikely(PageHWPoison(page)) && !order) { in free_pages_prepare()
1093 __memcg_kmem_uncharge_page(page, order); in free_pages_prepare()
1094 reset_page_owner(page, order); in free_pages_prepare()
1095 page_table_check_free(page, order); in free_pages_prepare()
1101 * avoid checking PageCompound for order-0 pages. in free_pages_prepare()
1103 if (unlikely(order)) { in free_pages_prepare()
1107 VM_BUG_ON_PAGE(compound && compound_order(page) != order, page); in free_pages_prepare()
1111 for (i = 1; i < (1 << order); i++) { in free_pages_prepare()
1126 __memcg_kmem_uncharge_page(page, order); in free_pages_prepare()
1136 reset_page_owner(page, order); in free_pages_prepare()
1137 page_table_check_free(page, order); in free_pages_prepare()
1141 PAGE_SIZE << order); in free_pages_prepare()
1143 PAGE_SIZE << order); in free_pages_prepare()
1146 kernel_poison_pages(page, 1 << order); in free_pages_prepare()
1157 kasan_poison_pages(page, order, init); in free_pages_prepare()
1164 kernel_init_pages(page, 1 << order); in free_pages_prepare()
1171 arch_free_page(page, order); in free_pages_prepare()
1173 debug_pagealloc_unmap_pages(page, 1 << order); in free_pages_prepare()
1188 unsigned int order; in free_pcppages_bulk() local
1215 order = pindex_to_order(pindex); in free_pcppages_bulk()
1216 nr_pages = 1 << order; in free_pcppages_bulk()
1234 __free_one_page(page, page_to_pfn(page), zone, order, mt, FPI_NONE); in free_pcppages_bulk()
1235 trace_mm_page_pcpu_drain(page, order, mt); in free_pcppages_bulk()
1244 unsigned int order, in free_one_page() argument
1254 __free_one_page(page, pfn, zone, order, migratetype, fpi_flags); in free_one_page()
1258 static void __free_pages_ok(struct page *page, unsigned int order, in __free_pages_ok() argument
1266 if (!free_pages_prepare(page, order, fpi_flags)) in __free_pages_ok()
1281 __free_one_page(page, pfn, zone, order, migratetype, fpi_flags); in __free_pages_ok()
1284 __count_vm_events(PGFREE, 1 << order); in __free_pages_ok()
1287 void __free_pages_core(struct page *page, unsigned int order) in __free_pages_core() argument
1289 unsigned int nr_pages = 1 << order; in __free_pages_core()
1309 if (page_contains_unaccepted(page, order)) { in __free_pages_core()
1310 if (order == MAX_ORDER && __free_unaccepted(page)) in __free_pages_core()
1313 accept_page(page, order); in __free_pages_core()
1320 __free_pages_ok(page, order, FPI_TO_TAIL); in __free_pages_core()
1340 * of the pfn range). For example, if the pageblock order is MAX_ORDER, which
1376 * The order of subdivision here is critical for the IO subsystem.
1377 * Please do not alter this order without good reasons and regression
1379 * the order in which smaller blocks are delivered depends on the order
1381 * influencing the order in which pages are delivered to the IO
1438 static inline bool check_new_pages(struct page *page, unsigned int order) in check_new_pages() argument
1441 for (int i = 0; i < (1 << order); i++) { in check_new_pages()
1480 inline void post_alloc_hook(struct page *page, unsigned int order, in post_alloc_hook() argument
1491 arch_alloc_page(page, order); in post_alloc_hook()
1492 debug_pagealloc_map_pages(page, 1 << order); in post_alloc_hook()
1499 kernel_unpoison_pages(page, 1 << order); in post_alloc_hook()
1513 for (i = 0; i != 1 << order; ++i) in post_alloc_hook()
1520 kasan_unpoison_pages(page, order, init)) { in post_alloc_hook()
1529 for (i = 0; i != 1 << order; ++i) in post_alloc_hook()
1534 kernel_init_pages(page, 1 << order); in post_alloc_hook()
1536 set_page_owner(page, order, gfp_flags); in post_alloc_hook()
1537 page_table_check_alloc(page, order); in post_alloc_hook()
1540 static void prep_new_page(struct page *page, unsigned int order, gfp_t gfp_flags, in prep_new_page() argument
1543 post_alloc_hook(page, order, gfp_flags); in prep_new_page()
1545 if (order && (gfp_flags & __GFP_COMP)) in prep_new_page()
1546 prep_compound_page(page, order); in prep_new_page()
1565 struct page *__rmqueue_smallest(struct zone *zone, unsigned int order, in __rmqueue_smallest() argument
1573 for (current_order = order; current_order <= MAX_ORDER; ++current_order) { in __rmqueue_smallest()
1579 expand(zone, page, order, current_order, migratetype); in __rmqueue_smallest()
1581 trace_mm_page_alloc_zone_locked(page, order, migratetype, in __rmqueue_smallest()
1582 pcp_allowed_order(order) && in __rmqueue_smallest()
1592 * This array describes the order lists are fallen back to when
1605 unsigned int order) in __rmqueue_cma_fallback() argument
1607 return __rmqueue_smallest(zone, order, MIGRATE_CMA); in __rmqueue_cma_fallback()
1611 unsigned int order) { return NULL; } in __rmqueue_cma_fallback() argument
1625 unsigned int order; in move_freepages() local
1647 order = buddy_order(page); in move_freepages()
1648 move_to_free_list(page, zone, order, migratetype); in move_freepages()
1649 pfn += 1 << order; in move_freepages()
1650 pages_moved += 1 << order; in move_freepages()
1701 static bool can_steal_fallback(unsigned int order, int start_mt) in can_steal_fallback() argument
1704 * Leaving this order check is intended, although there is in can_steal_fallback()
1705 * relaxed order check in next check. The reason is that in can_steal_fallback()
1710 if (order >= pageblock_order) in can_steal_fallback()
1713 if (order >= pageblock_order / 2 || in can_steal_fallback()
1760 * This function implements actual steal behaviour. If order is large enough,
1843 * Check whether there is a suitable fallback freepage with requested order.
1848 int find_suitable_fallback(struct free_area *area, unsigned int order, in find_suitable_fallback() argument
1863 if (can_steal_fallback(order, migratetype)) in find_suitable_fallback()
1877 * Reserve a pageblock for exclusive use of high-order atomic allocations if
1878 * there are no empty page blocks that contain a page with a suitable order
1914 * potentially hurts the reliability of high-order allocations when under
1929 int order; in unreserve_highatomic_pageblock() local
1943 for (order = 0; order <= MAX_ORDER; order++) { in unreserve_highatomic_pageblock()
1944 struct free_area *area = &(zone->free_area[order]); in unreserve_highatomic_pageblock()
1999 * The use of signed ints for order and current_order is a deliberate
2004 __rmqueue_fallback(struct zone *zone, int order, int start_migratetype, in __rmqueue_fallback() argument
2009 int min_order = order; in __rmqueue_fallback()
2019 if (order < pageblock_order && alloc_flags & ALLOC_NOFRAGMENT) in __rmqueue_fallback()
2044 && current_order > order) in __rmqueue_fallback()
2053 for (current_order = order; current_order <= MAX_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()
2308 unsigned int order) in free_unref_page_prepare() argument
2312 if (!free_pages_prepare(page, order, FPI_NONE)) in free_unref_page_prepare()
2325 /* Free everything if batch freeing high-order pages. */ in nr_pcp_free()
2369 unsigned int order) in free_unref_page_commit() argument
2375 __count_vm_events(PGFREE, 1 << order); in free_unref_page_commit()
2376 pindex = order_to_pindex(migratetype, order); in free_unref_page_commit()
2378 pcp->count += 1 << order; in free_unref_page_commit()
2381 * As high-order pages other than THP's stored on PCP can contribute in free_unref_page_commit()
2386 free_high = (pcp->free_factor && order && order <= PAGE_ALLOC_COSTLY_ORDER); in free_unref_page_commit()
2397 void free_unref_page(struct page *page, unsigned int order) in free_unref_page() argument
2405 if (!free_unref_page_prepare(page, pfn, order)) in free_unref_page()
2418 free_one_page(page_zone(page), page, pfn, order, migratetype, FPI_NONE); in free_unref_page()
2428 free_unref_page_commit(zone, pcp, page, pcpmigratetype, order); in free_unref_page()
2431 free_one_page(zone, page, pfn, order, migratetype, FPI_NONE); in free_unref_page()
2437 * Free a list of 0-order pages
2522 * split_page takes a non-compound higher-order page, and splits it into
2523 * n (1<<order) sub-pages: page[0..n]
2529 void split_page(struct page *page, unsigned int order) in split_page() argument
2536 for (i = 1; i < (1 << order); i++) in split_page()
2538 split_page_owner(page, 1 << order); in split_page()
2539 split_page_memcg(page, 1 << order); in split_page()
2543 int __isolate_free_page(struct page *page, unsigned int order) in __isolate_free_page() argument
2552 * emulate a high-order watermark check with a raised order-0 in __isolate_free_page()
2553 * watermark, because we already know our high-order page in __isolate_free_page()
2556 watermark = zone->_watermark[WMARK_MIN] + (1UL << order); in __isolate_free_page()
2560 __mod_zone_freepage_state(zone, -(1UL << order), mt); in __isolate_free_page()
2563 del_page_from_free_list(page, zone, order); in __isolate_free_page()
2569 if (order >= pageblock_order - 1) { in __isolate_free_page()
2570 struct page *endpage = page + (1 << order) - 1; in __isolate_free_page()
2583 return 1UL << order; in __isolate_free_page()
2589 * @order: Order of the isolated page
2595 void __putback_isolated_page(struct page *page, unsigned int order, int mt) in __putback_isolated_page() argument
2603 __free_one_page(page, page_to_pfn(page), zone, order, mt, in __putback_isolated_page()
2635 unsigned int order, unsigned int alloc_flags, in rmqueue_buddy() argument
2645 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC); in rmqueue_buddy()
2647 page = __rmqueue(zone, order, migratetype, alloc_flags); in rmqueue_buddy()
2652 * failing a high-order atomic allocation in the in rmqueue_buddy()
2656 page = __rmqueue_smallest(zone, order, MIGRATE_HIGHATOMIC); in rmqueue_buddy()
2663 __mod_zone_freepage_state(zone, -(1 << order), in rmqueue_buddy()
2666 } while (check_new_pages(page, order)); in rmqueue_buddy()
2668 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order); in rmqueue_buddy()
2676 struct page *__rmqueue_pcplist(struct zone *zone, unsigned int order, in __rmqueue_pcplist() argument
2690 * Scale batch relative to order if batch implies in __rmqueue_pcplist()
2697 batch = max(batch >> order, 2); in __rmqueue_pcplist()
2698 alloced = rmqueue_bulk(zone, order, in __rmqueue_pcplist()
2702 pcp->count += alloced << order; in __rmqueue_pcplist()
2709 pcp->count -= 1 << order; in __rmqueue_pcplist()
2710 } while (check_new_pages(page, order)); in __rmqueue_pcplist()
2717 struct zone *zone, unsigned int order, in rmqueue_pcplist() argument
2739 list = &pcp->lists[order_to_pindex(migratetype, order)]; in rmqueue_pcplist()
2740 page = __rmqueue_pcplist(zone, order, migratetype, alloc_flags, pcp, list); in rmqueue_pcplist()
2744 __count_zid_vm_events(PGALLOC, page_zonenum(page), 1 << order); in rmqueue_pcplist()
2752 * Use pcplists for THP or "cheap" high-order allocations.
2764 struct zone *zone, unsigned int order, in rmqueue() argument
2772 * allocate greater than order-1 page units with __GFP_NOFAIL. in rmqueue()
2774 WARN_ON_ONCE((gfp_flags & __GFP_NOFAIL) && (order > 1)); in rmqueue()
2776 if (likely(pcp_allowed_order(order))) { in rmqueue()
2777 page = rmqueue_pcplist(preferred_zone, zone, order, in rmqueue()
2783 page = rmqueue_buddy(preferred_zone, zone, order, alloc_flags, in rmqueue()
2798 noinline bool should_fail_alloc_page(gfp_t gfp_mask, unsigned int order) in should_fail_alloc_page() argument
2800 return __should_fail_alloc_page(gfp_mask, order); in should_fail_alloc_page()
2805 unsigned int order, unsigned int alloc_flags) in __zone_watermark_unusable_free() argument
2807 long unusable_free = (1 << order) - 1; in __zone_watermark_unusable_free()
2830 * Return true if free base pages are above 'mark'. For high-order checks it
2831 * will return true of the order-0 watermark is reached and there is at least
2835 bool __zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark, in __zone_watermark_ok() argument
2843 free_pages -= __zone_watermark_unusable_free(z, order, alloc_flags); in __zone_watermark_ok()
2875 * Check watermarks for an order-0 allocation request. If these in __zone_watermark_ok()
2876 * are not met, then a high-order request also cannot go ahead in __zone_watermark_ok()
2882 /* If this is an order-0 request then the watermark is fine */ in __zone_watermark_ok()
2883 if (!order) in __zone_watermark_ok()
2886 /* For a high-order request, check at least one suitable page is free */ in __zone_watermark_ok()
2887 for (o = order; o <= MAX_ORDER; o++) { in __zone_watermark_ok()
2913 bool zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark, in zone_watermark_ok() argument
2916 return __zone_watermark_ok(z, order, mark, highest_zoneidx, alloc_flags, in zone_watermark_ok()
2920 static inline bool zone_watermark_fast(struct zone *z, unsigned int order, in zone_watermark_fast() argument
2929 * Fast check for order-0 only. If this fails then the reserves in zone_watermark_fast()
2932 if (!order) { in zone_watermark_fast()
2945 if (__zone_watermark_ok(z, order, mark, highest_zoneidx, alloc_flags, in zone_watermark_fast()
2950 * Ignore watermark boosting for __GFP_HIGH order-0 allocations in zone_watermark_fast()
2955 if (unlikely(!order && (alloc_flags & ALLOC_MIN_RESERVE) && z->watermark_boost in zone_watermark_fast()
2958 return __zone_watermark_ok(z, order, mark, highest_zoneidx, in zone_watermark_fast()
2965 bool zone_watermark_ok_safe(struct zone *z, unsigned int order, in zone_watermark_ok_safe() argument
2973 return __zone_watermark_ok(z, order, mark, highest_zoneidx, 0, in zone_watermark_ok_safe()
3048 get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags, in get_page_from_freelist() argument
3119 if (!zone_watermark_fast(zone, order, mark, in get_page_from_freelist()
3125 if (try_to_accept_memory(zone, order)) in get_page_from_freelist()
3135 if (_deferred_grow_zone(zone, order)) in get_page_from_freelist()
3148 ret = node_reclaim(zone->zone_pgdat, gfp_mask, order); in get_page_from_freelist()
3158 if (zone_watermark_ok(zone, order, mark, in get_page_from_freelist()
3167 page = rmqueue(ac->preferred_zoneref->zone, zone, order, in get_page_from_freelist()
3170 prep_new_page(page, order, gfp_mask, alloc_flags); in get_page_from_freelist()
3173 * If this is a high-order atomic allocation then check in get_page_from_freelist()
3182 if (try_to_accept_memory(zone, order)) in get_page_from_freelist()
3189 if (_deferred_grow_zone(zone, order)) in get_page_from_freelist()
3253 __alloc_pages_cpuset_fallback(gfp_t gfp_mask, unsigned int order, in __alloc_pages_cpuset_fallback() argument
3259 page = get_page_from_freelist(gfp_mask, order, in __alloc_pages_cpuset_fallback()
3266 page = get_page_from_freelist(gfp_mask, order, in __alloc_pages_cpuset_fallback()
3273 __alloc_pages_may_oom(gfp_t gfp_mask, unsigned int order, in __alloc_pages_may_oom() argument
3281 .order = order, in __alloc_pages_may_oom()
3305 ~__GFP_DIRECT_RECLAIM, order, in __alloc_pages_may_oom()
3313 /* The OOM killer will not help higher order allocs */ in __alloc_pages_may_oom()
3314 if (order > PAGE_ALLOC_COSTLY_ORDER) in __alloc_pages_may_oom()
3351 page = __alloc_pages_cpuset_fallback(gfp_mask, order, in __alloc_pages_may_oom()
3366 /* Try memory compaction for high-order allocations before reclaim */
3368 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order, in __alloc_pages_direct_compact() argument
3376 if (!order) in __alloc_pages_direct_compact()
3383 *compact_result = try_to_compact_pages(gfp_mask, order, alloc_flags, ac, in __alloc_pages_direct_compact()
3400 prep_new_page(page, order, gfp_mask, alloc_flags); in __alloc_pages_direct_compact()
3404 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac); in __alloc_pages_direct_compact()
3410 compaction_defer_reset(zone, order, true); in __alloc_pages_direct_compact()
3427 should_compact_retry(struct alloc_context *ac, int order, int alloc_flags, in should_compact_retry() argument
3438 if (!order) in should_compact_retry()
3445 * Compaction was skipped due to a lack of free order-0 in should_compact_retry()
3449 ret = compaction_zonelist_suitable(ac, order, alloc_flags); in should_compact_retry()
3467 if (order > PAGE_ALLOC_COSTLY_ORDER) in should_compact_retry()
3479 min_priority = (order > PAGE_ALLOC_COSTLY_ORDER) ? in should_compact_retry()
3488 trace_compact_retry(order, priority, compact_result, retries, max_retries, ret); in should_compact_retry()
3493 __alloc_pages_direct_compact(gfp_t gfp_mask, unsigned int order, in __alloc_pages_direct_compact() argument
3502 should_compact_retry(struct alloc_context *ac, unsigned int order, int alloc_flags, in should_compact_retry() argument
3510 if (!order || order > PAGE_ALLOC_COSTLY_ORDER) in should_compact_retry()
3516 * Let's give them a good hope and keep retrying while the order-0 in should_compact_retry()
3614 __perform_reclaim(gfp_t gfp_mask, unsigned int order, in __perform_reclaim() argument
3627 progress = try_to_free_pages(ac->zonelist, order, gfp_mask, in __perform_reclaim()
3640 __alloc_pages_direct_reclaim(gfp_t gfp_mask, unsigned int order, in __alloc_pages_direct_reclaim() argument
3649 *did_some_progress = __perform_reclaim(gfp_mask, order, ac); in __alloc_pages_direct_reclaim()
3654 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac); in __alloc_pages_direct_reclaim()
3673 static void wake_all_kswapds(unsigned int order, gfp_t gfp_mask, in wake_all_kswapds() argument
3686 wakeup_kswapd(zone, gfp_mask, order, highest_zoneidx); in wake_all_kswapds()
3693 gfp_to_alloc_flags(gfp_t gfp_mask, unsigned int order) in gfp_to_alloc_flags() argument
3722 if (order > 0) in gfp_to_alloc_flags()
3794 should_reclaim_retry(gfp_t gfp_mask, unsigned order, in should_reclaim_retry() argument
3804 * their order will become available due to high fragmentation so in should_reclaim_retry()
3807 if (did_some_progress && order <= PAGE_ALLOC_COSTLY_ORDER) in should_reclaim_retry()
3841 wmark = __zone_watermark_ok(zone, order, min_wmark, in should_reclaim_retry()
3843 trace_reclaim_retry_zone(z, order, reclaimable, in should_reclaim_retry()
3899 __alloc_pages_slowpath(gfp_t gfp_mask, unsigned int order, in __alloc_pages_slowpath() argument
3903 const bool costly_order = order > PAGE_ALLOC_COSTLY_ORDER; in __alloc_pages_slowpath()
3927 alloc_flags = gfp_to_alloc_flags(gfp_mask, order); in __alloc_pages_slowpath()
3954 wake_all_kswapds(order, gfp_mask, ac); in __alloc_pages_slowpath()
3960 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac); in __alloc_pages_slowpath()
3967 * movable high-order allocations, do that as well, as compaction will in __alloc_pages_slowpath()
3975 (order > 0 && ac->migratetype != MIGRATE_MOVABLE)) in __alloc_pages_slowpath()
3977 page = __alloc_pages_direct_compact(gfp_mask, order, in __alloc_pages_slowpath()
3993 * order, fail immediately unless the allocator has in __alloc_pages_slowpath()
3999 * bursty high order allocations, in __alloc_pages_slowpath()
4022 wake_all_kswapds(order, gfp_mask, ac); in __alloc_pages_slowpath()
4041 page = get_page_from_freelist(gfp_mask, order, alloc_flags, ac); in __alloc_pages_slowpath()
4054 page = __alloc_pages_direct_reclaim(gfp_mask, order, alloc_flags, ac, in __alloc_pages_slowpath()
4060 page = __alloc_pages_direct_compact(gfp_mask, order, alloc_flags, ac, in __alloc_pages_slowpath()
4070 * Do not retry costly high order allocations unless they are in __alloc_pages_slowpath()
4076 if (should_reclaim_retry(gfp_mask, order, ac, alloc_flags, in __alloc_pages_slowpath()
4081 * It doesn't make any sense to retry for the compaction if the order-0 in __alloc_pages_slowpath()
4087 should_compact_retry(ac, order, alloc_flags, in __alloc_pages_slowpath()
4102 page = __alloc_pages_may_oom(gfp_mask, order, ac, &did_some_progress); in __alloc_pages_slowpath()
4161 page = __alloc_pages_cpuset_fallback(gfp_mask, order, ALLOC_MIN_RESERVE, ac); in __alloc_pages_slowpath()
4170 "page allocation failure: order:%u", order); in __alloc_pages_slowpath()
4175 static inline bool prepare_alloc_pages(gfp_t gfp_mask, unsigned int order, in prepare_alloc_pages() argument
4199 if (should_fail_alloc_page(gfp_mask, order)) in prepare_alloc_pages()
4219 * __alloc_pages_bulk - Allocate a number of order-0 pages to a list or array
4390 struct page *__alloc_pages(gfp_t gfp, unsigned int order, int preferred_nid, in __alloc_pages() argument
4399 * There are several places where we assume that the order value is sane in __alloc_pages()
4402 if (WARN_ON_ONCE_GFP(order > MAX_ORDER, gfp)) in __alloc_pages()
4415 if (!prepare_alloc_pages(gfp, order, preferred_nid, nodemask, &ac, in __alloc_pages()
4426 page = get_page_from_freelist(alloc_gfp, order, alloc_flags, &ac); in __alloc_pages()
4439 page = __alloc_pages_slowpath(alloc_gfp, order, &ac); in __alloc_pages()
4443 unlikely(__memcg_kmem_charge_page(page, gfp, order) != 0)) { in __alloc_pages()
4444 __free_pages(page, order); in __alloc_pages()
4448 trace_mm_page_alloc(page, order, alloc_gfp, ac.migratetype); in __alloc_pages()
4449 kmsan_alloc_page(page, order, alloc_gfp); in __alloc_pages()
4455 struct folio *__folio_alloc(gfp_t gfp, unsigned int order, int preferred_nid, in __folio_alloc() argument
4458 struct page *page = __alloc_pages(gfp | __GFP_COMP, order, in __folio_alloc()
4462 if (folio && order > 1) in __folio_alloc()
4473 unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order) in __get_free_pages() argument
4477 page = alloc_pages(gfp_mask & ~__GFP_HIGHMEM, order); in __get_free_pages()
4493 * @order: The order of the allocation.
4496 * pages. It does not check that the @order passed in matches that of
4510 void __free_pages(struct page *page, unsigned int order) in __free_pages() argument
4516 free_the_page(page, order); in __free_pages()
4518 while (order-- > 0) in __free_pages()
4519 free_the_page(page + (1 << order), order); in __free_pages()
4523 void free_pages(unsigned long addr, unsigned int order) in free_pages() argument
4527 __free_pages(virt_to_page((void *)addr), order); in free_pages()
4536 * within a 0 or higher order page. Multiple fragments within that page
4648 * Frees a page fragment allocated out of either a compound or order 0 page.
4659 static void *make_alloc_exact(unsigned long addr, unsigned int order, in make_alloc_exact() argument
4667 split_page_owner(page, 1 << order); in make_alloc_exact()
4668 split_page_memcg(page, 1 << order); in make_alloc_exact()
4672 last = page + (1UL << order); in make_alloc_exact()
4696 unsigned int order = get_order(size); in alloc_pages_exact() local
4702 addr = __get_free_pages(gfp_mask, order); in alloc_pages_exact()
4703 return make_alloc_exact(addr, order, size); in alloc_pages_exact()
4721 unsigned int order = get_order(size); in alloc_pages_exact_nid() local
4727 p = alloc_pages_node(nid, gfp_mask, order); in alloc_pages_exact_nid()
4730 return make_alloc_exact((unsigned long)page_address(p), order, size); in alloc_pages_exact_nid()
4995 pr_info("Fallback order for Node %d: ", local_node); in build_zonelists()
5160 * needs the percpu allocator in order to allocate its pagesets in build_all_zonelists_init()
5251 * fragmented and becoming unavailable for high-order allocations. in zone_batchsize()
6113 int order; in alloc_contig_range() local
6118 .order = -1, in alloc_contig_range()
6130 * MIGRATE_ISOLATE. Because pageblock and max order pages may in alloc_contig_range()
6179 * page allocator holds, ie. they can be part of higher order in alloc_contig_range()
6187 order = 0; in alloc_contig_range()
6190 if (++order > MAX_ORDER) { in alloc_contig_range()
6194 outer_start &= ~0UL << order; in alloc_contig_range()
6198 order = buddy_order(pfn_to_page(outer_start)); in alloc_contig_range()
6201 * outer_start page could be small order buddy page and in alloc_contig_range()
6206 if (outer_start + (1UL << order) <= start) in alloc_contig_range()
6398 unsigned int order; in __offline_isolated_pages() local
6427 order = buddy_order(page); in __offline_isolated_pages()
6428 del_page_from_free_list(page, zone, order); in __offline_isolated_pages()
6429 pfn += (1 << order); in __offline_isolated_pages()
6441 unsigned int order; in is_free_buddy_page() local
6443 for (order = 0; order <= MAX_ORDER; order++) { in is_free_buddy_page()
6444 struct page *page_head = page - (pfn & ((1 << order) - 1)); in is_free_buddy_page()
6447 buddy_order_unsafe(page_head) >= order) in is_free_buddy_page()
6451 return order <= MAX_ORDER; in is_free_buddy_page()
6457 * Break down a higher-order page in sub-pages, and keep our target out of
6498 unsigned int order; in take_page_off_buddy() local
6502 for (order = 0; order <= MAX_ORDER; order++) { in take_page_off_buddy()
6503 struct page *page_head = page - (pfn & ((1 << order) - 1)); in take_page_off_buddy()
6506 if (PageBuddy(page_head) && page_order >= order) { in take_page_off_buddy()
6588 static bool page_contains_unaccepted(struct page *page, unsigned int order) in page_contains_unaccepted() argument
6591 phys_addr_t end = start + (PAGE_SIZE << order); in page_contains_unaccepted()
6596 static void accept_page(struct page *page, unsigned int order) in accept_page() argument
6600 accept_memory(start, start + (PAGE_SIZE << order)); in accept_page()
6637 static bool try_to_accept_memory(struct zone *zone, unsigned int order) in try_to_accept_memory() argument
6645 __zone_watermark_unusable_free(zone, order, 0)); in try_to_accept_memory()
6687 static bool page_contains_unaccepted(struct page *page, unsigned int order) in page_contains_unaccepted() argument
6692 static void accept_page(struct page *page, unsigned int order) in accept_page() argument
6696 static bool try_to_accept_memory(struct zone *zone, unsigned int order) in try_to_accept_memory() argument