Lines Matching full:order

53 #define block_start_pfn(pfn, order)	round_down(pfn, 1UL << (order))  argument
54 #define block_end_pfn(pfn, order) ALIGN((pfn) + 1, 1UL << (order)) argument
57 * Page order with-respect-to which proactive compaction
87 unsigned int i, order, nr_pages; in split_map_pages() local
94 order = page_private(page); in split_map_pages()
95 nr_pages = 1 << order; in split_map_pages()
97 post_alloc_hook(page, order, __GFP_MOVABLE); in split_map_pages()
98 if (order) in split_map_pages()
99 split_page(page, order); in split_map_pages()
154 static void defer_compaction(struct zone *zone, int order) in defer_compaction() argument
159 if (order < zone->compact_order_failed) in defer_compaction()
160 zone->compact_order_failed = order; in defer_compaction()
165 trace_mm_compaction_defer_compaction(zone, order); in defer_compaction()
169 static bool compaction_deferred(struct zone *zone, int order) in compaction_deferred() argument
173 if (order < zone->compact_order_failed) in compaction_deferred()
182 trace_mm_compaction_deferred(zone, order); in compaction_deferred()
188 * Update defer tracking counters after successful compaction of given order,
192 void compaction_defer_reset(struct zone *zone, int order, in compaction_defer_reset() argument
199 if (order >= zone->compact_order_failed) in compaction_defer_reset()
200 zone->compact_order_failed = order + 1; in compaction_defer_reset()
202 trace_mm_compaction_defer_reset(zone, order); in compaction_defer_reset()
206 static bool compaction_restarting(struct zone *zone, int order) in compaction_restarting() argument
208 if (order < zone->compact_order_failed) in compaction_restarting()
235 * released. It is always pointless to compact pages of such order (if they are
553 unsigned int order; in isolate_freepages_block() local
585 const unsigned int order = compound_order(page); in isolate_freepages_block() local
587 if (likely(order < MAX_ORDER)) { in isolate_freepages_block()
588 blockpfn += (1UL << order) - 1; in isolate_freepages_block()
589 cursor += (1UL << order) - 1; in isolate_freepages_block()
607 /* Found a free page, will break it into order-0 pages */ in isolate_freepages_block()
608 order = buddy_order(page); in isolate_freepages_block()
609 isolated = __isolate_free_page(page, order); in isolate_freepages_block()
612 set_page_private(page, order); in isolate_freepages_block()
703 * is more than pageblock order. In this case, we adjust in isolate_freepages_range()
729 * pageblock_nr_pages for some non-negative n. (Max order in isolate_freepages_range()
828 next_skip_pfn = block_end_pfn(low_pfn, cc->order); in isolate_migratepages_block()
837 * previous order-aligned block, and did not skip it due in isolate_migratepages_block()
845 * We failed to isolate in the previous order-aligned in isolate_migratepages_block()
848 * next_skip_pfn by 1 << order, as low_pfn might have in isolate_migratepages_block()
850 * a compound or a high-order buddy page in the in isolate_migratepages_block()
853 next_skip_pfn = block_end_pfn(low_pfn, cc->order); in isolate_migratepages_block()
929 * Skip if free. We read page order here without zone lock in isolate_migratepages_block()
939 * a valid page order. Consider only values in the in isolate_migratepages_block()
940 * valid order range to prevent low_pfn overflow. in isolate_migratepages_block()
956 const unsigned int order = compound_order(page); in isolate_migratepages_block() local
958 if (likely(order < MAX_ORDER)) in isolate_migratepages_block()
959 low_pfn += (1UL << order) - 1; in isolate_migratepages_block()
1076 * and it's on LRU. It can only be a THP so the order in isolate_migratepages_block()
1131 * instead of migrating, as we cannot form the cc->order buddy in isolate_migratepages_block()
1150 next_skip_pfn += 1UL << cc->order; in isolate_migratepages_block()
1278 * pageblock, so it's not worth to check order for valid range. in suitable_migration_target()
1386 static int next_search_order(struct compact_control *cc, int order) in next_search_order() argument
1388 order--; in next_search_order()
1389 if (order < 0) in next_search_order()
1390 order = cc->order - 1; in next_search_order()
1393 if (order == cc->search_order) { in next_search_order()
1396 cc->search_order = cc->order - 1; in next_search_order()
1400 return order; in next_search_order()
1413 int order; in fast_isolate_freepages() local
1415 /* Full compaction passes in a negative order */ in fast_isolate_freepages()
1416 if (cc->order <= 0) in fast_isolate_freepages()
1440 * Search starts from the last successful isolation order or the next in fast_isolate_freepages()
1441 * order to search after a previous failure in fast_isolate_freepages()
1443 cc->search_order = min_t(unsigned int, cc->order - 1, cc->search_order); in fast_isolate_freepages()
1445 for (order = cc->search_order; in fast_isolate_freepages()
1446 !page && order >= 0; in fast_isolate_freepages()
1447 order = next_search_order(cc, order)) { in fast_isolate_freepages()
1448 struct free_area *area = &cc->zone->free_area[order]; in fast_isolate_freepages()
1473 cc->search_order = order; in fast_isolate_freepages()
1502 if (__isolate_free_page(page, order)) { in fast_isolate_freepages()
1503 set_page_private(page, order); in fast_isolate_freepages()
1504 nr_isolated = 1 << order; in fast_isolate_freepages()
1511 order = cc->search_order + 1; in fast_isolate_freepages()
1519 * Smaller scan on next order so the total scan is related in fast_isolate_freepages()
1766 int order; in fast_find_migrateblock() local
1786 if (cc->order <= PAGE_ALLOC_COSTLY_ORDER) in fast_find_migrateblock()
1809 for (order = cc->order - 1; in fast_find_migrateblock()
1810 order >= PAGE_ALLOC_COSTLY_ORDER && !found_block && nr_scanned < limit; in fast_find_migrateblock()
1811 order--) { in fast_find_migrateblock()
1812 struct free_area *area = &cc->zone->free_area[order]; in fast_find_migrateblock()
1969 * order == -1 is expected when compacting via
1972 static inline bool is_via_compact_memory(int order) in is_via_compact_memory() argument
1974 return order == -1; in is_via_compact_memory()
2069 unsigned int order; in __compact_finished() local
2112 if (is_via_compact_memory(cc->order)) in __compact_finished()
2126 for (order = cc->order; order < MAX_ORDER; order++) { in __compact_finished()
2127 struct free_area *area = &cc->zone->free_area[order]; in __compact_finished()
2144 if (find_suitable_fallback(area, order, migratetype, in __compact_finished()
2169 trace_mm_compaction_finished(cc->zone, cc->order, ret); in compact_finished()
2176 static enum compact_result __compaction_suitable(struct zone *zone, int order, in __compaction_suitable() argument
2183 if (is_via_compact_memory(order)) in __compaction_suitable()
2188 * If watermarks for high-order allocation are already met, there in __compaction_suitable()
2191 if (zone_watermark_ok(zone, order, watermark, highest_zoneidx, in __compaction_suitable()
2196 * Watermarks for order-0 must be met for compaction to be able to in __compaction_suitable()
2209 watermark = (order > PAGE_ALLOC_COSTLY_ORDER) ? in __compaction_suitable()
2211 watermark += compact_gap(order); in __compaction_suitable()
2226 enum compact_result compaction_suitable(struct zone *zone, int order, in compaction_suitable() argument
2233 ret = __compaction_suitable(zone, order, alloc_flags, highest_zoneidx, in compaction_suitable()
2240 * watermarks, but we already failed the high-order watermark check in compaction_suitable()
2251 if (ret == COMPACT_CONTINUE && (order > PAGE_ALLOC_COSTLY_ORDER)) { in compaction_suitable()
2252 fragindex = fragmentation_index(zone, order); in compaction_suitable()
2257 trace_mm_compaction_suitable(zone, order, ret); in compaction_suitable()
2264 bool compaction_zonelist_suitable(struct alloc_context *ac, int order, in compaction_zonelist_suitable() argument
2281 * want to trash just for a single high order allocation which in compaction_zonelist_suitable()
2285 available = zone_reclaimable_pages(zone) / order; in compaction_zonelist_suitable()
2287 compact_result = __compaction_suitable(zone, order, alloc_flags, in compaction_zonelist_suitable()
2319 ret = compaction_suitable(cc->zone, cc->order, cc->alloc_flags, in compact_zone()
2332 if (compaction_restarting(cc->zone, cc->order)) in compact_zone()
2413 * previous cc->order aligned block. in compact_zone()
2441 * order-aligned block, so skip the rest of it. in compact_zone()
2446 cc->migrate_pfn - 1, cc->order); in compact_zone()
2455 * cc->order aligned block where we migrated from? If yes, in compact_zone()
2460 if (cc->order > 0 && last_migrated_pfn) { in compact_zone()
2462 block_start_pfn(cc->migrate_pfn, cc->order); in compact_zone()
2506 static enum compact_result compact_zone_order(struct zone *zone, int order, in compact_zone_order() argument
2513 .order = order, in compact_zone_order()
2514 .search_order = order, in compact_zone_order()
2566 * try_to_compact_pages - Direct compact to satisfy a high-order allocation
2568 * @order: The order of the current allocation
2576 enum compact_result try_to_compact_pages(gfp_t gfp_mask, unsigned int order, in try_to_compact_pages() argument
2592 trace_mm_compaction_try_to_compact_pages(order, gfp_mask, prio); in try_to_compact_pages()
2600 && compaction_deferred(zone, order)) { in try_to_compact_pages()
2605 status = compact_zone_order(zone, order, gfp_mask, prio, in try_to_compact_pages()
2617 compaction_defer_reset(zone, order, false); in try_to_compact_pages()
2629 defer_compaction(zone, order); in try_to_compact_pages()
2658 .order = -1, in proactive_compact_node()
2687 .order = -1, in compact_node()
2825 * order is allocatable. in kcompactd_do_work()
2830 .order = pgdat->kcompactd_max_order, in kcompactd_do_work()
2837 trace_mm_compaction_kcompactd_wake(pgdat->node_id, cc.order, in kcompactd_do_work()
2848 if (compaction_deferred(zone, cc.order)) in kcompactd_do_work()
2851 if (compaction_suitable(zone, cc.order, 0, zoneid) != in kcompactd_do_work()
2862 compaction_defer_reset(zone, cc.order, false); in kcompactd_do_work()
2867 * order >= cc.order. This is ratelimited by the in kcompactd_do_work()
2876 defer_compaction(zone, cc.order); in kcompactd_do_work()
2890 * the requested order/highest_zoneidx in case it was higher/tighter in kcompactd_do_work()
2893 if (pgdat->kcompactd_max_order <= cc.order) in kcompactd_do_work()
2899 void wakeup_kcompactd(pg_data_t *pgdat, int order, int highest_zoneidx) in wakeup_kcompactd() argument
2901 if (!order) in wakeup_kcompactd()
2904 if (pgdat->kcompactd_max_order < order) in wakeup_kcompactd()
2905 pgdat->kcompactd_max_order = order; in wakeup_kcompactd()
2920 trace_mm_compaction_wakeup_kcompactd(pgdat->node_id, order, in wakeup_kcompactd()