48 #define block_start_pfn(pfn, order)	round_down(pfn, 1UL << (order))  argument
49 #define block_end_pfn(pfn, order)	ALIGN((pfn) + 1, 1UL << (order))  argument
71 	unsigned int i, order, nr_pages;  in split_map_pages()  local
78 		order = page_private(page);  in split_map_pages()
79 		nr_pages = 1 << order;  in split_map_pages()
81 		post_alloc_hook(page, order, __GFP_MOVABLE);  in split_map_pages()
82 		if (order)  in split_map_pages()
83 			split_page(page, order);  in split_map_pages()
142 void defer_compaction(struct zone *zone, int order)  in defer_compaction()  argument
147 	if (order < zone->compact_order_failed)  in defer_compaction()
148 		zone->compact_order_failed = order;  in defer_compaction()
153 	trace_mm_compaction_defer_compaction(zone, order);  in defer_compaction()
157 bool compaction_deferred(struct zone *zone, int order)  in compaction_deferred()  argument
161 	if (order < zone->compact_order_failed)  in compaction_deferred()
171 	trace_mm_compaction_deferred(zone, order);  in compaction_deferred()
177  * Update defer tracking counters after successful compaction of given order,
181 void compaction_defer_reset(struct zone *zone, int order,  in compaction_defer_reset()  argument
188 	if (order >= zone->compact_order_failed)  in compaction_defer_reset()
189 		zone->compact_order_failed = order + 1;  in compaction_defer_reset()
191 	trace_mm_compaction_defer_reset(zone, order);  in compaction_defer_reset()
195 bool compaction_restarting(struct zone *zone, int order)  in compaction_restarting()  argument
197 	if (order < zone->compact_order_failed)  in compaction_restarting()
224  * released. It is always pointless to compact pages of such order (if they are
547 	unsigned int order;  in isolate_freepages_block()  local
581 			const unsigned int order = compound_order(page);  in isolate_freepages_block()  local
583 			if (likely(order < MAX_ORDER)) {  in isolate_freepages_block()
584 				blockpfn += (1UL << order) - 1;  in isolate_freepages_block()
585 				cursor += (1UL << order) - 1;  in isolate_freepages_block()
609 		/* Found a free page, will break it into order-0 pages */  in isolate_freepages_block()
610 		order = page_order(page);  in isolate_freepages_block()
611 		isolated = __isolate_free_page(page, order);  in isolate_freepages_block()
614 		set_page_private(page, order);  in isolate_freepages_block()
704 		 * is more than pageblock order. In this case, we adjust  in isolate_freepages_range()
730 		 * pageblock_nr_pages for some non-negative n.  (Max order  in isolate_freepages_range()
816 		next_skip_pfn = block_end_pfn(low_pfn, cc->order);  in isolate_migratepages_block()
825 			 * previous order-aligned block, and did not skip it due  in isolate_migratepages_block()
833 			 * We failed to isolate in the previous order-aligned  in isolate_migratepages_block()
836 			 * next_skip_pfn by 1 << order, as low_pfn might have  in isolate_migratepages_block()
838 			 * a compound or a high-order buddy page in the  in isolate_migratepages_block()
841 			next_skip_pfn = block_end_pfn(low_pfn, cc->order);  in isolate_migratepages_block()
877 		 * Skip if free. We read page order here without zone lock  in isolate_migratepages_block()
887 			 * a valid page order. Consider only values in the  in isolate_migratepages_block()
888 			 * valid order range to prevent low_pfn overflow.  in isolate_migratepages_block()
903 			const unsigned int order = compound_order(page);  in isolate_migratepages_block()  local
905 			if (likely(order < MAX_ORDER))  in isolate_migratepages_block()
906 				low_pfn += (1UL << order) - 1;  in isolate_migratepages_block()
969 			 * and it's on LRU. It can only be a THP so the order  in isolate_migratepages_block()
1015 		 * instead of migrating, as we cannot form the cc->order buddy  in isolate_migratepages_block()
1034 			next_skip_pfn += 1UL << cc->order;  in isolate_migratepages_block()
1151 		 * pageblock, so it's not worth to check order for valid range.  in suitable_migration_target()
1257 static int next_search_order(struct compact_control *cc, int order)  in next_search_order()  argument
1259 	order--;  in next_search_order()
1260 	if (order < 0)  in next_search_order()
1261 		order = cc->order - 1;  in next_search_order()
1264 	if (order == cc->search_order) {  in next_search_order()
1267 			cc->search_order = cc->order - 1;  in next_search_order()
1271 	return order;  in next_search_order()
1284 	int order;  in fast_isolate_freepages()  local
1286 	/* Full compaction passes in a negative order */  in fast_isolate_freepages()
1287 	if (cc->order <= 0)  in fast_isolate_freepages()
1311 	 * Search starts from the last successful isolation order or the next  in fast_isolate_freepages()
1312 	 * order to search after a previous failure  in fast_isolate_freepages()
1314 	cc->search_order = min_t(unsigned int, cc->order - 1, cc->search_order);  in fast_isolate_freepages()
1316 	for (order = cc->search_order;  in fast_isolate_freepages()
1317 	     !page && order >= 0;  in fast_isolate_freepages()
1318 	     order = next_search_order(cc, order)) {  in fast_isolate_freepages()
1319 		struct free_area *area = &cc->zone->free_area[order];  in fast_isolate_freepages()
1342 				cc->search_order = order;  in fast_isolate_freepages()
1371 			if (__isolate_free_page(page, order)) {  in fast_isolate_freepages()
1372 				set_page_private(page, order);  in fast_isolate_freepages()
1373 				nr_isolated = 1 << order;  in fast_isolate_freepages()
1379 				order = cc->search_order + 1;  in fast_isolate_freepages()
1387 		 * Smaller scan on next order so the total scan ig related  in fast_isolate_freepages()
1631 	int order;  in fast_find_migrateblock()  local
1650 	if (cc->order <= PAGE_ALLOC_COSTLY_ORDER)  in fast_find_migrateblock()
1673 	for (order = cc->order - 1;  in fast_find_migrateblock()
1674 	     order >= PAGE_ALLOC_COSTLY_ORDER && pfn == cc->migrate_pfn && nr_scanned < limit;  in fast_find_migrateblock()
1675 	     order--) {  in fast_find_migrateblock()
1676 		struct free_area *area = &cc->zone->free_area[order];  in fast_find_migrateblock()
1841  * order == -1 is expected when compacting via
1844 static inline bool is_via_compact_memory(int order)  in is_via_compact_memory()  argument
1846 	return order == -1;  in is_via_compact_memory()
1851 	unsigned int order;  in __compact_finished()  local
1875 	if (is_via_compact_memory(cc->order))  in __compact_finished()
1889 	for (order = cc->order; order < MAX_ORDER; order++) {  in __compact_finished()
1890 		struct free_area *area = &cc->zone->free_area[order];  in __compact_finished()
1907 		if (find_suitable_fallback(area, order, migratetype,  in __compact_finished()
1944 	trace_mm_compaction_finished(cc->zone, cc->order, ret);  in compact_finished()
1958 static enum compact_result __compaction_suitable(struct zone *zone, int order,  in __compaction_suitable()  argument
1965 	if (is_via_compact_memory(order))  in __compaction_suitable()
1970 	 * If watermarks for high-order allocation are already met, there  in __compaction_suitable()
1973 	if (zone_watermark_ok(zone, order, watermark, classzone_idx,  in __compaction_suitable()
1978 	 * Watermarks for order-0 must be met for compaction to be able to  in __compaction_suitable()
1991 	watermark = (order > PAGE_ALLOC_COSTLY_ORDER) ?  in __compaction_suitable()
1993 	watermark += compact_gap(order);  in __compaction_suitable()
2001 enum compact_result compaction_suitable(struct zone *zone, int order,  in compaction_suitable()  argument
2008 	ret = __compaction_suitable(zone, order, alloc_flags, classzone_idx,  in compaction_suitable()
2015 	 * watermarks, but we already failed the high-order watermark check  in compaction_suitable()
2026 	if (ret == COMPACT_CONTINUE && (order > PAGE_ALLOC_COSTLY_ORDER)) {  in compaction_suitable()
2027 		fragindex = fragmentation_index(zone, order);  in compaction_suitable()
2032 	trace_mm_compaction_suitable(zone, order, ret);  in compaction_suitable()
2039 bool compaction_zonelist_suitable(struct alloc_context *ac, int order,  in compaction_zonelist_suitable()  argument
2056 		 * want to trash just for a single high order allocation which  in compaction_zonelist_suitable()
2060 		available = zone_reclaimable_pages(zone) / order;  in compaction_zonelist_suitable()
2062 		compact_result = __compaction_suitable(zone, order, alloc_flags,  in compaction_zonelist_suitable()
2093 	ret = compaction_suitable(cc->zone, cc->order, cc->alloc_flags,  in compact_zone()
2106 	if (compaction_restarting(cc->zone, cc->order))  in compact_zone()
2188 			 * previous cc->order aligned block.  in compact_zone()
2218 			 * order-aligned block, so skip the rest of it.  in compact_zone()
2223 						cc->migrate_pfn - 1, cc->order);  in compact_zone()
2232 		 * cc->order aligned block where we migrated from? If yes,  in compact_zone()
2237 		if (cc->order > 0 && last_migrated_pfn) {  in compact_zone()
2240 				block_start_pfn(cc->migrate_pfn, cc->order);  in compact_zone()
2288 static enum compact_result compact_zone_order(struct zone *zone, int order,  in compact_zone_order()  argument
2295 		.order = order,  in compact_zone_order()
2296 		.search_order = order,  in compact_zone_order()
2330  * try_to_compact_pages - Direct compact to satisfy a high-order allocation
2332  * @order: The order of the current allocation
2339 enum compact_result try_to_compact_pages(gfp_t gfp_mask, unsigned int order,  in try_to_compact_pages()  argument
2355 	trace_mm_compaction_try_to_compact_pages(order, gfp_mask, prio);  in try_to_compact_pages()
2363 					&& compaction_deferred(zone, order)) {  in try_to_compact_pages()
2368 		status = compact_zone_order(zone, order, gfp_mask, prio,  in try_to_compact_pages()
2380 			compaction_defer_reset(zone, order, false);  in try_to_compact_pages()
2392 			defer_compaction(zone, order);  in try_to_compact_pages()
2415 		.order = -1,  in compact_node()
2524 	 * order is allocatable.  in kcompactd_do_work()
2529 		.order = pgdat->kcompactd_max_order,  in kcompactd_do_work()
2536 	trace_mm_compaction_kcompactd_wake(pgdat->node_id, cc.order,  in kcompactd_do_work()
2547 		if (compaction_deferred(zone, cc.order))  in kcompactd_do_work()
2550 		if (compaction_suitable(zone, cc.order, 0, zoneid) !=  in kcompactd_do_work()
2561 			compaction_defer_reset(zone, cc.order, false);  in kcompactd_do_work()
2566 			 * order >= cc.order.  This is ratelimited by the  in kcompactd_do_work()
2575 			defer_compaction(zone, cc.order);  in kcompactd_do_work()
2589 	 * the requested order/classzone_idx in case it was higher/tighter than  in kcompactd_do_work()
2592 	if (pgdat->kcompactd_max_order <= cc.order)  in kcompactd_do_work()
2598 void wakeup_kcompactd(pg_data_t *pgdat, int order, int classzone_idx)  in wakeup_kcompactd()  argument
2600 	if (!order)  in wakeup_kcompactd()
2603 	if (pgdat->kcompactd_max_order < order)  in wakeup_kcompactd()
2604 		pgdat->kcompactd_max_order = order;  in wakeup_kcompactd()
2619 	trace_mm_compaction_wakeup_kcompactd(pgdat->node_id, order,  in wakeup_kcompactd()