4 * Manages VM statistics
5 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
8 * Copyright (C) 2006 Silicon Graphics, Inc.,
9 * Christoph Lameter <christoph@lameter.com>
10 * Copyright (C) 2008-2014 Christoph Lameter
14 #include <linux/err.h>
15 #include <linux/module.h>
16 #include <linux/slab.h>
17 #include <linux/cpu.h>
18 #include <linux/cpumask.h>
19 #include <linux/vmstat.h>
20 #include <linux/proc_fs.h>
21 #include <linux/seq_file.h>
22 #include <linux/debugfs.h>
23 #include <linux/sched.h>
24 #include <linux/math64.h>
25 #include <linux/writeback.h>
26 #include <linux/compaction.h>
27 #include <linux/mm_inline.h>
28 #include <linux/page_ext.h>
29 #include <linux/page_owner.h>
33 #ifdef CONFIG_VM_EVENT_COUNTERS
34 DEFINE_PER_CPU(struct vm_event_state, vm_event_states) = {{0}};
35 EXPORT_PER_CPU_SYMBOL(vm_event_states);
37 static void sum_vm_events(unsigned long *ret)
42 memset(ret, 0, NR_VM_EVENT_ITEMS * sizeof(unsigned long));
44 for_each_online_cpu(cpu) {
45 struct vm_event_state *this = &per_cpu(vm_event_states, cpu);
47 for (i = 0; i < NR_VM_EVENT_ITEMS; i++)
48 ret[i] += this->event[i];
53 * Accumulate the vm event counters across all CPUs.
54 * The result is unavoidably approximate - it can change
55 * during and after execution of this function.
57 void all_vm_events(unsigned long *ret)
63 EXPORT_SYMBOL_GPL(all_vm_events);
66 * Fold the foreign cpu events into our own.
68 * This is adding to the events on one processor
69 * but keeps the global counts constant.
71 void vm_events_fold_cpu(int cpu)
73 struct vm_event_state *fold_state = &per_cpu(vm_event_states, cpu);
76 for (i = 0; i < NR_VM_EVENT_ITEMS; i++) {
77 count_vm_events(i, fold_state->event[i]);
78 fold_state->event[i] = 0;
82 #endif /* CONFIG_VM_EVENT_COUNTERS */
85 * Manage combined zone based / global counters
87 * vm_stat contains the global counters
89 atomic_long_t vm_stat[NR_VM_ZONE_STAT_ITEMS] __cacheline_aligned_in_smp;
90 EXPORT_SYMBOL(vm_stat);
94 int calculate_pressure_threshold(struct zone *zone)
97 int watermark_distance;
100 * As vmstats are not up to date, there is drift between the estimated
101 * and real values. For high thresholds and a high number of CPUs, it
102 * is possible for the min watermark to be breached while the estimated
103 * value looks fine. The pressure threshold is a reduced value such
104 * that even the maximum amount of drift will not accidentally breach
107 watermark_distance = low_wmark_pages(zone) - min_wmark_pages(zone);
108 threshold = max(1, (int)(watermark_distance / num_online_cpus()));
111 * Maximum threshold is 125
113 threshold = min(125, threshold);
118 int calculate_normal_threshold(struct zone *zone)
121 int mem; /* memory in 128 MB units */
124 * The threshold scales with the number of processors and the amount
125 * of memory per zone. More memory means that we can defer updates for
126 * longer, more processors could lead to more contention.
127 * fls() is used to have a cheap way of logarithmic scaling.
129 * Some sample thresholds:
131 * Threshold Processors (fls) Zonesize fls(mem+1)
132 * ------------------------------------------------------------------
149 * 125 1024 10 8-16 GB 8
150 * 125 1024 10 16-32 GB 9
153 mem = zone->managed_pages >> (27 - PAGE_SHIFT);
155 threshold = 2 * fls(num_online_cpus()) * (1 + fls(mem));
158 * Maximum threshold is 125
160 threshold = min(125, threshold);
166 * Refresh the thresholds for each zone.
168 void refresh_zone_stat_thresholds(void)
174 for_each_populated_zone(zone) {
175 unsigned long max_drift, tolerate_drift;
177 threshold = calculate_normal_threshold(zone);
179 for_each_online_cpu(cpu)
180 per_cpu_ptr(zone->pageset, cpu)->stat_threshold
184 * Only set percpu_drift_mark if there is a danger that
185 * NR_FREE_PAGES reports the low watermark is ok when in fact
186 * the min watermark could be breached by an allocation
188 tolerate_drift = low_wmark_pages(zone) - min_wmark_pages(zone);
189 max_drift = num_online_cpus() * threshold;
190 if (max_drift > tolerate_drift)
191 zone->percpu_drift_mark = high_wmark_pages(zone) +
196 void set_pgdat_percpu_threshold(pg_data_t *pgdat,
197 int (*calculate_pressure)(struct zone *))
204 for (i = 0; i < pgdat->nr_zones; i++) {
205 zone = &pgdat->node_zones[i];
206 if (!zone->percpu_drift_mark)
209 threshold = (*calculate_pressure)(zone);
210 for_each_online_cpu(cpu)
211 per_cpu_ptr(zone->pageset, cpu)->stat_threshold
217 * For use when we know that interrupts are disabled,
218 * or when we know that preemption is disabled and that
219 * particular counter cannot be updated from interrupt context.
221 void __mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
224 struct per_cpu_pageset __percpu *pcp = zone->pageset;
225 s8 __percpu *p = pcp->vm_stat_diff + item;
229 x = delta + __this_cpu_read(*p);
231 t = __this_cpu_read(pcp->stat_threshold);
233 if (unlikely(x > t || x < -t)) {
234 zone_page_state_add(x, zone, item);
237 __this_cpu_write(*p, x);
239 EXPORT_SYMBOL(__mod_zone_page_state);
242 * Optimized increment and decrement functions.
244 * These are only for a single page and therefore can take a struct page *
245 * argument instead of struct zone *. This allows the inclusion of the code
246 * generated for page_zone(page) into the optimized functions.
248 * No overflow check is necessary and therefore the differential can be
249 * incremented or decremented in place which may allow the compilers to
250 * generate better code.
251 * The increment or decrement is known and therefore one boundary check can
254 * NOTE: These functions are very performance sensitive. Change only
257 * Some processors have inc/dec instructions that are atomic vs an interrupt.
258 * However, the code must first determine the differential location in a zone
259 * based on the processor number and then inc/dec the counter. There is no
260 * guarantee without disabling preemption that the processor will not change
261 * in between and therefore the atomicity vs. interrupt cannot be exploited
262 * in a useful way here.
264 void __inc_zone_state(struct zone *zone, enum zone_stat_item item)
266 struct per_cpu_pageset __percpu *pcp = zone->pageset;
267 s8 __percpu *p = pcp->vm_stat_diff + item;
270 v = __this_cpu_inc_return(*p);
271 t = __this_cpu_read(pcp->stat_threshold);
272 if (unlikely(v > t)) {
273 s8 overstep = t >> 1;
275 zone_page_state_add(v + overstep, zone, item);
276 __this_cpu_write(*p, -overstep);
280 void __inc_zone_page_state(struct page *page, enum zone_stat_item item)
282 __inc_zone_state(page_zone(page), item);
284 EXPORT_SYMBOL(__inc_zone_page_state);
286 void __dec_zone_state(struct zone *zone, enum zone_stat_item item)
288 struct per_cpu_pageset __percpu *pcp = zone->pageset;
289 s8 __percpu *p = pcp->vm_stat_diff + item;
292 v = __this_cpu_dec_return(*p);
293 t = __this_cpu_read(pcp->stat_threshold);
294 if (unlikely(v < - t)) {
295 s8 overstep = t >> 1;
297 zone_page_state_add(v - overstep, zone, item);
298 __this_cpu_write(*p, overstep);
302 void __dec_zone_page_state(struct page *page, enum zone_stat_item item)
304 __dec_zone_state(page_zone(page), item);
306 EXPORT_SYMBOL(__dec_zone_page_state);
308 #ifdef CONFIG_HAVE_CMPXCHG_LOCAL
310 * If we have cmpxchg_local support then we do not need to incur the overhead
311 * that comes with local_irq_save/restore if we use this_cpu_cmpxchg.
313 * mod_state() modifies the zone counter state through atomic per cpu
316 * Overstep mode specifies how overstep should handled:
318 * 1 Overstepping half of threshold
319 * -1 Overstepping minus half of threshold
321 static inline void mod_state(struct zone *zone, enum zone_stat_item item,
322 long delta, int overstep_mode)
324 struct per_cpu_pageset __percpu *pcp = zone->pageset;
325 s8 __percpu *p = pcp->vm_stat_diff + item;
329 z = 0; /* overflow to zone counters */
332 * The fetching of the stat_threshold is racy. We may apply
333 * a counter threshold to the wrong the cpu if we get
334 * rescheduled while executing here. However, the next
335 * counter update will apply the threshold again and
336 * therefore bring the counter under the threshold again.
338 * Most of the time the thresholds are the same anyways
339 * for all cpus in a zone.
341 t = this_cpu_read(pcp->stat_threshold);
343 o = this_cpu_read(*p);
346 if (n > t || n < -t) {
347 int os = overstep_mode * (t >> 1) ;
349 /* Overflow must be added to zone counters */
353 } while (this_cpu_cmpxchg(*p, o, n) != o);
356 zone_page_state_add(z, zone, item);
359 void mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
362 mod_state(zone, item, delta, 0);
364 EXPORT_SYMBOL(mod_zone_page_state);
366 void inc_zone_state(struct zone *zone, enum zone_stat_item item)
368 mod_state(zone, item, 1, 1);
371 void inc_zone_page_state(struct page *page, enum zone_stat_item item)
373 mod_state(page_zone(page), item, 1, 1);
375 EXPORT_SYMBOL(inc_zone_page_state);
377 void dec_zone_page_state(struct page *page, enum zone_stat_item item)
379 mod_state(page_zone(page), item, -1, -1);
381 EXPORT_SYMBOL(dec_zone_page_state);
384 * Use interrupt disable to serialize counter updates
386 void mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
391 local_irq_save(flags);
392 __mod_zone_page_state(zone, item, delta);
393 local_irq_restore(flags);
395 EXPORT_SYMBOL(mod_zone_page_state);
397 void inc_zone_state(struct zone *zone, enum zone_stat_item item)
401 local_irq_save(flags);
402 __inc_zone_state(zone, item);
403 local_irq_restore(flags);
406 void inc_zone_page_state(struct page *page, enum zone_stat_item item)
411 zone = page_zone(page);
412 local_irq_save(flags);
413 __inc_zone_state(zone, item);
414 local_irq_restore(flags);
416 EXPORT_SYMBOL(inc_zone_page_state);
418 void dec_zone_page_state(struct page *page, enum zone_stat_item item)
422 local_irq_save(flags);
423 __dec_zone_page_state(page, item);
424 local_irq_restore(flags);
426 EXPORT_SYMBOL(dec_zone_page_state);
431 * Fold a differential into the global counters.
432 * Returns the number of counters updated.
434 static int fold_diff(int *diff)
439 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
441 atomic_long_add(diff[i], &vm_stat[i]);
448 * Update the zone counters for the current cpu.
450 * Note that refresh_cpu_vm_stats strives to only access
451 * node local memory. The per cpu pagesets on remote zones are placed
452 * in the memory local to the processor using that pageset. So the
453 * loop over all zones will access a series of cachelines local to
456 * The call to zone_page_state_add updates the cachelines with the
457 * statistics in the remote zone struct as well as the global cachelines
458 * with the global counters. These could cause remote node cache line
459 * bouncing and will have to be only done when necessary.
461 * The function returns the number of global counters updated.
463 static int refresh_cpu_vm_stats(bool do_pagesets)
467 int global_diff[NR_VM_ZONE_STAT_ITEMS] = { 0, };
470 for_each_populated_zone(zone) {
471 struct per_cpu_pageset __percpu *p = zone->pageset;
473 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++) {
476 v = this_cpu_xchg(p->vm_stat_diff[i], 0);
479 atomic_long_add(v, &zone->vm_stat[i]);
482 /* 3 seconds idle till flush */
483 __this_cpu_write(p->expire, 3);
491 * Deal with draining the remote pageset of this
494 * Check if there are pages remaining in this pageset
495 * if not then there is nothing to expire.
497 if (!__this_cpu_read(p->expire) ||
498 !__this_cpu_read(p->pcp.count))
502 * We never drain zones local to this processor.
504 if (zone_to_nid(zone) == numa_node_id()) {
505 __this_cpu_write(p->expire, 0);
509 if (__this_cpu_dec_return(p->expire))
512 if (__this_cpu_read(p->pcp.count)) {
513 drain_zone_pages(zone, this_cpu_ptr(&p->pcp));
519 changes += fold_diff(global_diff);
524 * Fold the data for an offline cpu into the global array.
525 * There cannot be any access by the offline cpu and therefore
526 * synchronization is simplified.
528 void cpu_vm_stats_fold(int cpu)
532 int global_diff[NR_VM_ZONE_STAT_ITEMS] = { 0, };
534 for_each_populated_zone(zone) {
535 struct per_cpu_pageset *p;
537 p = per_cpu_ptr(zone->pageset, cpu);
539 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
540 if (p->vm_stat_diff[i]) {
543 v = p->vm_stat_diff[i];
544 p->vm_stat_diff[i] = 0;
545 atomic_long_add(v, &zone->vm_stat[i]);
550 fold_diff(global_diff);
554 * this is only called if !populated_zone(zone), which implies no other users of
555 * pset->vm_stat_diff[] exsist.
557 void drain_zonestat(struct zone *zone, struct per_cpu_pageset *pset)
561 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
562 if (pset->vm_stat_diff[i]) {
563 int v = pset->vm_stat_diff[i];
564 pset->vm_stat_diff[i] = 0;
565 atomic_long_add(v, &zone->vm_stat[i]);
566 atomic_long_add(v, &vm_stat[i]);
573 * Determine the per node value of a stat item.
575 unsigned long node_page_state(int node, enum zone_stat_item item)
577 struct zone *zones = NODE_DATA(node)->node_zones;
579 unsigned long count = 0;
581 for (i = 0; i < MAX_NR_ZONES; i++)
582 count += zone_page_state(zones + i, item);
589 #ifdef CONFIG_COMPACTION
591 struct contig_page_info {
592 unsigned long free_pages;
593 unsigned long free_blocks_total;
594 unsigned long free_blocks_suitable;
598 * Calculate the number of free pages in a zone, how many contiguous
599 * pages are free and how many are large enough to satisfy an allocation of
600 * the target size. Note that this function makes no attempt to estimate
601 * how many suitable free blocks there *might* be if MOVABLE pages were
602 * migrated. Calculating that is possible, but expensive and can be
603 * figured out from userspace
605 static void fill_contig_page_info(struct zone *zone,
606 unsigned int suitable_order,
607 struct contig_page_info *info)
611 info->free_pages = 0;
612 info->free_blocks_total = 0;
613 info->free_blocks_suitable = 0;
615 for (order = 0; order < MAX_ORDER; order++) {
616 unsigned long blocks;
618 /* Count number of free blocks */
619 blocks = zone->free_area[order].nr_free;
620 info->free_blocks_total += blocks;
622 /* Count free base pages */
623 info->free_pages += blocks << order;
625 /* Count the suitable free blocks */
626 if (order >= suitable_order)
627 info->free_blocks_suitable += blocks <<
628 (order - suitable_order);
633 * A fragmentation index only makes sense if an allocation of a requested
634 * size would fail. If that is true, the fragmentation index indicates
635 * whether external fragmentation or a lack of memory was the problem.
636 * The value can be used to determine if page reclaim or compaction
639 static int __fragmentation_index(unsigned int order, struct contig_page_info *info)
641 unsigned long requested = 1UL << order;
643 if (!info->free_blocks_total)
646 /* Fragmentation index only makes sense when a request would fail */
647 if (info->free_blocks_suitable)
651 * Index is between 0 and 1 so return within 3 decimal places
653 * 0 => allocation would fail due to lack of memory
654 * 1 => allocation would fail due to fragmentation
656 return 1000 - div_u64( (1000+(div_u64(info->free_pages * 1000ULL, requested))), info->free_blocks_total);
659 /* Same as __fragmentation index but allocs contig_page_info on stack */
660 int fragmentation_index(struct zone *zone, unsigned int order)
662 struct contig_page_info info;
664 fill_contig_page_info(zone, order, &info);
665 return __fragmentation_index(order, &info);
669 #if defined(CONFIG_PROC_FS) || defined(CONFIG_SYSFS) || defined(CONFIG_NUMA)
670 #ifdef CONFIG_ZONE_DMA
671 #define TEXT_FOR_DMA(xx) xx "_dma",
673 #define TEXT_FOR_DMA(xx)
676 #ifdef CONFIG_ZONE_DMA32
677 #define TEXT_FOR_DMA32(xx) xx "_dma32",
679 #define TEXT_FOR_DMA32(xx)
682 #ifdef CONFIG_HIGHMEM
683 #define TEXT_FOR_HIGHMEM(xx) xx "_high",
685 #define TEXT_FOR_HIGHMEM(xx)
688 #define TEXTS_FOR_ZONES(xx) TEXT_FOR_DMA(xx) TEXT_FOR_DMA32(xx) xx "_normal", \
689 TEXT_FOR_HIGHMEM(xx) xx "_movable",
691 const char * const vmstat_text[] = {
692 /* enum zone_stat_item countes */
706 "nr_slab_reclaimable",
707 "nr_slab_unreclaimable",
708 "nr_page_table_pages",
713 "nr_vmscan_immediate_reclaim",
721 #if IS_ENABLED(CONFIG_ZSMALLOC)
732 "workingset_refault",
733 "workingset_activate",
734 "workingset_nodereclaim",
735 "nr_anon_transparent_hugepages",
738 /* enum writeback_stat_item counters */
739 "nr_dirty_threshold",
740 "nr_dirty_background_threshold",
742 #ifdef CONFIG_VM_EVENT_COUNTERS
743 /* enum vm_event_item counters */
749 TEXTS_FOR_ZONES("pgalloc")
759 TEXTS_FOR_ZONES("pgrefill")
760 TEXTS_FOR_ZONES("pgsteal_kswapd")
761 TEXTS_FOR_ZONES("pgsteal_direct")
762 TEXTS_FOR_ZONES("pgscan_kswapd")
763 TEXTS_FOR_ZONES("pgscan_direct")
764 "pgscan_direct_throttle",
767 "zone_reclaim_failed",
772 "kswapd_low_wmark_hit_quickly",
773 "kswapd_high_wmark_hit_quickly",
782 #ifdef CONFIG_NUMA_BALANCING
784 "numa_huge_pte_updates",
786 "numa_hint_faults_local",
787 "numa_pages_migrated",
789 #ifdef CONFIG_MIGRATION
793 #ifdef CONFIG_COMPACTION
794 "compact_migrate_scanned",
795 "compact_free_scanned",
800 "compact_daemon_wake",
803 #ifdef CONFIG_HUGETLB_PAGE
804 "htlb_buddy_alloc_success",
805 "htlb_buddy_alloc_fail",
807 "unevictable_pgs_culled",
808 "unevictable_pgs_scanned",
809 "unevictable_pgs_rescued",
810 "unevictable_pgs_mlocked",
811 "unevictable_pgs_munlocked",
812 "unevictable_pgs_cleared",
813 "unevictable_pgs_stranded",
815 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
817 "thp_fault_fallback",
818 "thp_collapse_alloc",
819 "thp_collapse_alloc_failed",
823 "thp_split_page_failed",
824 "thp_deferred_split_page",
826 "thp_zero_page_alloc",
827 "thp_zero_page_alloc_failed",
829 #ifdef CONFIG_MEMORY_BALLOON
832 #ifdef CONFIG_BALLOON_COMPACTION
835 #endif /* CONFIG_MEMORY_BALLOON */
836 #ifdef CONFIG_DEBUG_TLBFLUSH
838 "nr_tlb_remote_flush",
839 "nr_tlb_remote_flush_received",
840 #endif /* CONFIG_SMP */
841 "nr_tlb_local_flush_all",
842 "nr_tlb_local_flush_one",
843 #endif /* CONFIG_DEBUG_TLBFLUSH */
845 #ifdef CONFIG_DEBUG_VM_VMACACHE
846 "vmacache_find_calls",
847 "vmacache_find_hits",
848 "vmacache_full_flushes",
850 #endif /* CONFIG_VM_EVENTS_COUNTERS */
852 #endif /* CONFIG_PROC_FS || CONFIG_SYSFS || CONFIG_NUMA */
855 #if (defined(CONFIG_DEBUG_FS) && defined(CONFIG_COMPACTION)) || \
856 defined(CONFIG_PROC_FS)
857 static void *frag_start(struct seq_file *m, loff_t *pos)
862 for (pgdat = first_online_pgdat();
864 pgdat = next_online_pgdat(pgdat))
870 static void *frag_next(struct seq_file *m, void *arg, loff_t *pos)
872 pg_data_t *pgdat = (pg_data_t *)arg;
875 return next_online_pgdat(pgdat);
878 static void frag_stop(struct seq_file *m, void *arg)
882 /* Walk all the zones in a node and print using a callback */
883 static void walk_zones_in_node(struct seq_file *m, pg_data_t *pgdat,
884 void (*print)(struct seq_file *m, pg_data_t *, struct zone *))
887 struct zone *node_zones = pgdat->node_zones;
890 for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) {
891 if (!populated_zone(zone))
894 spin_lock_irqsave(&zone->lock, flags);
895 print(m, pgdat, zone);
896 spin_unlock_irqrestore(&zone->lock, flags);
901 #ifdef CONFIG_PROC_FS
902 static void frag_show_print(struct seq_file *m, pg_data_t *pgdat,
907 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
908 for (order = 0; order < MAX_ORDER; ++order)
909 seq_printf(m, "%6lu ", zone->free_area[order].nr_free);
914 * This walks the free areas for each zone.
916 static int frag_show(struct seq_file *m, void *arg)
918 pg_data_t *pgdat = (pg_data_t *)arg;
919 walk_zones_in_node(m, pgdat, frag_show_print);
923 static void pagetypeinfo_showfree_print(struct seq_file *m,
924 pg_data_t *pgdat, struct zone *zone)
928 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++) {
929 seq_printf(m, "Node %4d, zone %8s, type %12s ",
932 migratetype_names[mtype]);
933 for (order = 0; order < MAX_ORDER; ++order) {
934 unsigned long freecount = 0;
935 struct free_area *area;
936 struct list_head *curr;
938 area = &(zone->free_area[order]);
940 list_for_each(curr, &area->free_list[mtype])
942 seq_printf(m, "%6lu ", freecount);
948 /* Print out the free pages at each order for each migatetype */
949 static int pagetypeinfo_showfree(struct seq_file *m, void *arg)
952 pg_data_t *pgdat = (pg_data_t *)arg;
955 seq_printf(m, "%-43s ", "Free pages count per migrate type at order");
956 for (order = 0; order < MAX_ORDER; ++order)
957 seq_printf(m, "%6d ", order);
960 walk_zones_in_node(m, pgdat, pagetypeinfo_showfree_print);
965 static void pagetypeinfo_showblockcount_print(struct seq_file *m,
966 pg_data_t *pgdat, struct zone *zone)
970 unsigned long start_pfn = zone->zone_start_pfn;
971 unsigned long end_pfn = zone_end_pfn(zone);
972 unsigned long count[MIGRATE_TYPES] = { 0, };
974 for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
980 page = pfn_to_page(pfn);
982 /* Watch for unexpected holes punched in the memmap */
983 if (!memmap_valid_within(pfn, page, zone))
986 if (page_zone(page) != zone)
989 mtype = get_pageblock_migratetype(page);
991 if (mtype < MIGRATE_TYPES)
996 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
997 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
998 seq_printf(m, "%12lu ", count[mtype]);
1002 /* Print out the free pages at each order for each migratetype */
1003 static int pagetypeinfo_showblockcount(struct seq_file *m, void *arg)
1006 pg_data_t *pgdat = (pg_data_t *)arg;
1008 seq_printf(m, "\n%-23s", "Number of blocks type ");
1009 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1010 seq_printf(m, "%12s ", migratetype_names[mtype]);
1012 walk_zones_in_node(m, pgdat, pagetypeinfo_showblockcount_print);
1017 #ifdef CONFIG_PAGE_OWNER
1018 static void pagetypeinfo_showmixedcount_print(struct seq_file *m,
1023 struct page_ext *page_ext;
1024 unsigned long pfn = zone->zone_start_pfn, block_end_pfn;
1025 unsigned long end_pfn = pfn + zone->spanned_pages;
1026 unsigned long count[MIGRATE_TYPES] = { 0, };
1027 int pageblock_mt, page_mt;
1030 /* Scan block by block. First and last block may be incomplete */
1031 pfn = zone->zone_start_pfn;
1034 * Walk the zone in pageblock_nr_pages steps. If a page block spans
1035 * a zone boundary, it will be double counted between zones. This does
1036 * not matter as the mixed block count will still be correct
1038 for (; pfn < end_pfn; ) {
1039 if (!pfn_valid(pfn)) {
1040 pfn = ALIGN(pfn + 1, MAX_ORDER_NR_PAGES);
1044 block_end_pfn = ALIGN(pfn + 1, pageblock_nr_pages);
1045 block_end_pfn = min(block_end_pfn, end_pfn);
1047 page = pfn_to_page(pfn);
1048 pageblock_mt = get_pageblock_migratetype(page);
1050 for (; pfn < block_end_pfn; pfn++) {
1051 if (!pfn_valid_within(pfn))
1054 page = pfn_to_page(pfn);
1056 if (page_zone(page) != zone)
1059 if (PageBuddy(page)) {
1060 pfn += (1UL << page_order(page)) - 1;
1064 if (PageReserved(page))
1067 page_ext = lookup_page_ext(page);
1068 if (unlikely(!page_ext))
1071 if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags))
1074 page_mt = gfpflags_to_migratetype(page_ext->gfp_mask);
1075 if (pageblock_mt != page_mt) {
1076 if (is_migrate_cma(pageblock_mt))
1077 count[MIGRATE_MOVABLE]++;
1079 count[pageblock_mt]++;
1081 pfn = block_end_pfn;
1084 pfn += (1UL << page_ext->order) - 1;
1089 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
1090 for (i = 0; i < MIGRATE_TYPES; i++)
1091 seq_printf(m, "%12lu ", count[i]);
1094 #endif /* CONFIG_PAGE_OWNER */
1097 * Print out the number of pageblocks for each migratetype that contain pages
1098 * of other types. This gives an indication of how well fallbacks are being
1099 * contained by rmqueue_fallback(). It requires information from PAGE_OWNER
1100 * to determine what is going on
1102 static void pagetypeinfo_showmixedcount(struct seq_file *m, pg_data_t *pgdat)
1104 #ifdef CONFIG_PAGE_OWNER
1107 if (!static_branch_unlikely(&page_owner_inited))
1110 drain_all_pages(NULL);
1112 seq_printf(m, "\n%-23s", "Number of mixed blocks ");
1113 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1114 seq_printf(m, "%12s ", migratetype_names[mtype]);
1117 walk_zones_in_node(m, pgdat, pagetypeinfo_showmixedcount_print);
1118 #endif /* CONFIG_PAGE_OWNER */
1122 * This prints out statistics in relation to grouping pages by mobility.
1123 * It is expensive to collect so do not constantly read the file.
1125 static int pagetypeinfo_show(struct seq_file *m, void *arg)
1127 pg_data_t *pgdat = (pg_data_t *)arg;
1129 /* check memoryless node */
1130 if (!node_state(pgdat->node_id, N_MEMORY))
1133 seq_printf(m, "Page block order: %d\n", pageblock_order);
1134 seq_printf(m, "Pages per block: %lu\n", pageblock_nr_pages);
1136 pagetypeinfo_showfree(m, pgdat);
1137 pagetypeinfo_showblockcount(m, pgdat);
1138 pagetypeinfo_showmixedcount(m, pgdat);
1143 static const struct seq_operations fragmentation_op = {
1144 .start = frag_start,
1150 static int fragmentation_open(struct inode *inode, struct file *file)
1152 return seq_open(file, &fragmentation_op);
1155 static const struct file_operations fragmentation_file_operations = {
1156 .open = fragmentation_open,
1158 .llseek = seq_lseek,
1159 .release = seq_release,
1162 static const struct seq_operations pagetypeinfo_op = {
1163 .start = frag_start,
1166 .show = pagetypeinfo_show,
1169 static int pagetypeinfo_open(struct inode *inode, struct file *file)
1171 return seq_open(file, &pagetypeinfo_op);
1174 static const struct file_operations pagetypeinfo_file_ops = {
1175 .open = pagetypeinfo_open,
1177 .llseek = seq_lseek,
1178 .release = seq_release,
1181 static void zoneinfo_show_print(struct seq_file *m, pg_data_t *pgdat,
1185 seq_printf(m, "Node %d, zone %8s", pgdat->node_id, zone->name);
1195 zone_page_state(zone, NR_FREE_PAGES),
1196 min_wmark_pages(zone),
1197 low_wmark_pages(zone),
1198 high_wmark_pages(zone),
1199 zone_page_state(zone, NR_PAGES_SCANNED),
1200 zone->spanned_pages,
1201 zone->present_pages,
1202 zone->managed_pages);
1204 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
1205 seq_printf(m, "\n %-12s %lu", vmstat_text[i],
1206 zone_page_state(zone, i));
1209 "\n protection: (%ld",
1210 zone->lowmem_reserve[0]);
1211 for (i = 1; i < ARRAY_SIZE(zone->lowmem_reserve); i++)
1212 seq_printf(m, ", %ld", zone->lowmem_reserve[i]);
1216 for_each_online_cpu(i) {
1217 struct per_cpu_pageset *pageset;
1219 pageset = per_cpu_ptr(zone->pageset, i);
1228 pageset->pcp.batch);
1230 seq_printf(m, "\n vm stats threshold: %d",
1231 pageset->stat_threshold);
1235 "\n all_unreclaimable: %u"
1237 "\n inactive_ratio: %u",
1238 !zone_reclaimable(zone),
1239 zone->zone_start_pfn,
1240 zone->inactive_ratio);
1245 * Output information about zones in @pgdat.
1247 static int zoneinfo_show(struct seq_file *m, void *arg)
1249 pg_data_t *pgdat = (pg_data_t *)arg;
1250 walk_zones_in_node(m, pgdat, zoneinfo_show_print);
1254 static const struct seq_operations zoneinfo_op = {
1255 .start = frag_start, /* iterate over all zones. The same as in
1259 .show = zoneinfo_show,
1262 static int zoneinfo_open(struct inode *inode, struct file *file)
1264 return seq_open(file, &zoneinfo_op);
1267 static const struct file_operations proc_zoneinfo_file_operations = {
1268 .open = zoneinfo_open,
1270 .llseek = seq_lseek,
1271 .release = seq_release,
1274 enum writeback_stat_item {
1276 NR_DIRTY_BG_THRESHOLD,
1277 NR_VM_WRITEBACK_STAT_ITEMS,
1280 static void *vmstat_start(struct seq_file *m, loff_t *pos)
1283 int i, stat_items_size;
1285 if (*pos >= ARRAY_SIZE(vmstat_text))
1287 stat_items_size = NR_VM_ZONE_STAT_ITEMS * sizeof(unsigned long) +
1288 NR_VM_WRITEBACK_STAT_ITEMS * sizeof(unsigned long);
1290 #ifdef CONFIG_VM_EVENT_COUNTERS
1291 stat_items_size += sizeof(struct vm_event_state);
1294 v = kmalloc(stat_items_size, GFP_KERNEL);
1297 return ERR_PTR(-ENOMEM);
1298 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
1299 v[i] = global_page_state(i);
1300 v += NR_VM_ZONE_STAT_ITEMS;
1302 global_dirty_limits(v + NR_DIRTY_BG_THRESHOLD,
1303 v + NR_DIRTY_THRESHOLD);
1304 v += NR_VM_WRITEBACK_STAT_ITEMS;
1306 #ifdef CONFIG_VM_EVENT_COUNTERS
1308 v[PGPGIN] /= 2; /* sectors -> kbytes */
1311 return (unsigned long *)m->private + *pos;
1314 static void *vmstat_next(struct seq_file *m, void *arg, loff_t *pos)
1317 if (*pos >= ARRAY_SIZE(vmstat_text))
1319 return (unsigned long *)m->private + *pos;
1322 static int vmstat_show(struct seq_file *m, void *arg)
1324 unsigned long *l = arg;
1325 unsigned long off = l - (unsigned long *)m->private;
1327 seq_printf(m, "%s %lu\n", vmstat_text[off], *l);
1331 static void vmstat_stop(struct seq_file *m, void *arg)
1337 static const struct seq_operations vmstat_op = {
1338 .start = vmstat_start,
1339 .next = vmstat_next,
1340 .stop = vmstat_stop,
1341 .show = vmstat_show,
1344 static int vmstat_open(struct inode *inode, struct file *file)
1346 return seq_open(file, &vmstat_op);
1349 static const struct file_operations proc_vmstat_file_operations = {
1350 .open = vmstat_open,
1352 .llseek = seq_lseek,
1353 .release = seq_release,
1355 #endif /* CONFIG_PROC_FS */
1358 static struct workqueue_struct *vmstat_wq;
1359 static DEFINE_PER_CPU(struct delayed_work, vmstat_work);
1360 int sysctl_stat_interval __read_mostly = HZ;
1362 #ifdef CONFIG_PROC_FS
1363 static void refresh_vm_stats(struct work_struct *work)
1365 refresh_cpu_vm_stats(true);
1368 int vmstat_refresh(struct ctl_table *table, int write,
1369 void __user *buffer, size_t *lenp, loff_t *ppos)
1376 * The regular update, every sysctl_stat_interval, may come later
1377 * than expected: leaving a significant amount in per_cpu buckets.
1378 * This is particularly misleading when checking a quantity of HUGE
1379 * pages, immediately after running a test. /proc/sys/vm/stat_refresh,
1380 * which can equally be echo'ed to or cat'ted from (by root),
1381 * can be used to update the stats just before reading them.
1383 * Oh, and since global_page_state() etc. are so careful to hide
1384 * transiently negative values, report an error here if any of
1385 * the stats is negative, so we know to go looking for imbalance.
1387 err = schedule_on_each_cpu(refresh_vm_stats);
1390 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++) {
1391 val = atomic_long_read(&vm_stat[i]);
1394 case NR_ALLOC_BATCH:
1395 case NR_PAGES_SCANNED:
1397 * These are often seen to go negative in
1398 * recent kernels, but not to go permanently
1399 * negative. Whilst it would be nicer not to
1400 * have exceptions, rooting them out would be
1401 * another task, of rather low priority.
1405 pr_warn("%s: %s %ld\n",
1406 __func__, vmstat_text[i], val);
1420 #endif /* CONFIG_PROC_FS */
1422 static void vmstat_update(struct work_struct *w)
1424 if (refresh_cpu_vm_stats(true)) {
1426 * Counters were updated so we expect more updates
1427 * to occur in the future. Keep on running the
1428 * update worker thread.
1430 queue_delayed_work_on(smp_processor_id(), vmstat_wq,
1431 this_cpu_ptr(&vmstat_work),
1432 round_jiffies_relative(sysctl_stat_interval));
1437 * Switch off vmstat processing and then fold all the remaining differentials
1438 * until the diffs stay at zero. The function is used by NOHZ and can only be
1439 * invoked when tick processing is not active.
1442 * Check if the diffs for a certain cpu indicate that
1443 * an update is needed.
1445 static bool need_update(int cpu)
1449 for_each_populated_zone(zone) {
1450 struct per_cpu_pageset *p = per_cpu_ptr(zone->pageset, cpu);
1452 BUILD_BUG_ON(sizeof(p->vm_stat_diff[0]) != 1);
1454 * The fast way of checking if there are any vmstat diffs.
1455 * This works because the diffs are byte sized items.
1457 if (memchr_inv(p->vm_stat_diff, 0, NR_VM_ZONE_STAT_ITEMS))
1465 * Switch off vmstat processing and then fold all the remaining differentials
1466 * until the diffs stay at zero. The function is used by NOHZ and can only be
1467 * invoked when tick processing is not active.
1469 void quiet_vmstat(void)
1471 if (system_state != SYSTEM_RUNNING)
1474 if (!delayed_work_pending(this_cpu_ptr(&vmstat_work)))
1477 if (!need_update(smp_processor_id()))
1481 * Just refresh counters and do not care about the pending delayed
1482 * vmstat_update. It doesn't fire that often to matter and canceling
1483 * it would be too expensive from this path.
1484 * vmstat_shepherd will take care about that for us.
1486 refresh_cpu_vm_stats(false);
1490 * Shepherd worker thread that checks the
1491 * differentials of processors that have their worker
1492 * threads for vm statistics updates disabled because of
1495 static void vmstat_shepherd(struct work_struct *w);
1497 static DECLARE_DEFERRABLE_WORK(shepherd, vmstat_shepherd);
1499 static void vmstat_shepherd(struct work_struct *w)
1504 /* Check processors whose vmstat worker threads have been disabled */
1505 for_each_online_cpu(cpu) {
1506 struct delayed_work *dw = &per_cpu(vmstat_work, cpu);
1508 if (!delayed_work_pending(dw) && need_update(cpu))
1509 queue_delayed_work_on(cpu, vmstat_wq, dw, 0);
1513 schedule_delayed_work(&shepherd,
1514 round_jiffies_relative(sysctl_stat_interval));
1517 static void __init start_shepherd_timer(void)
1521 for_each_possible_cpu(cpu)
1522 INIT_DEFERRABLE_WORK(per_cpu_ptr(&vmstat_work, cpu),
1525 vmstat_wq = alloc_workqueue("vmstat", WQ_FREEZABLE|WQ_MEM_RECLAIM, 0);
1526 schedule_delayed_work(&shepherd,
1527 round_jiffies_relative(sysctl_stat_interval));
1530 static void vmstat_cpu_dead(int node)
1535 for_each_online_cpu(cpu)
1536 if (cpu_to_node(cpu) == node)
1539 node_clear_state(node, N_CPU);
1545 * Use the cpu notifier to insure that the thresholds are recalculated
1548 static int vmstat_cpuup_callback(struct notifier_block *nfb,
1549 unsigned long action,
1552 long cpu = (long)hcpu;
1556 case CPU_ONLINE_FROZEN:
1557 refresh_zone_stat_thresholds();
1558 node_set_state(cpu_to_node(cpu), N_CPU);
1560 case CPU_DOWN_PREPARE:
1561 case CPU_DOWN_PREPARE_FROZEN:
1562 cancel_delayed_work_sync(&per_cpu(vmstat_work, cpu));
1564 case CPU_DOWN_FAILED:
1565 case CPU_DOWN_FAILED_FROZEN:
1568 case CPU_DEAD_FROZEN:
1569 refresh_zone_stat_thresholds();
1570 vmstat_cpu_dead(cpu_to_node(cpu));
1578 static struct notifier_block vmstat_notifier =
1579 { &vmstat_cpuup_callback, NULL, 0 };
1582 static int __init setup_vmstat(void)
1585 cpu_notifier_register_begin();
1586 __register_cpu_notifier(&vmstat_notifier);
1588 start_shepherd_timer();
1589 cpu_notifier_register_done();
1591 #ifdef CONFIG_PROC_FS
1592 proc_create("buddyinfo", S_IRUGO, NULL, &fragmentation_file_operations);
1593 proc_create("pagetypeinfo", S_IRUGO, NULL, &pagetypeinfo_file_ops);
1594 proc_create("vmstat", S_IRUGO, NULL, &proc_vmstat_file_operations);
1595 proc_create("zoneinfo", S_IRUGO, NULL, &proc_zoneinfo_file_operations);
1599 module_init(setup_vmstat)
1601 #if defined(CONFIG_DEBUG_FS) && defined(CONFIG_COMPACTION)
1604 * Return an index indicating how much of the available free memory is
1605 * unusable for an allocation of the requested size.
1607 static int unusable_free_index(unsigned int order,
1608 struct contig_page_info *info)
1610 /* No free memory is interpreted as all free memory is unusable */
1611 if (info->free_pages == 0)
1615 * Index should be a value between 0 and 1. Return a value to 3
1618 * 0 => no fragmentation
1619 * 1 => high fragmentation
1621 return div_u64((info->free_pages - (info->free_blocks_suitable << order)) * 1000ULL, info->free_pages);
1625 static void unusable_show_print(struct seq_file *m,
1626 pg_data_t *pgdat, struct zone *zone)
1630 struct contig_page_info info;
1632 seq_printf(m, "Node %d, zone %8s ",
1635 for (order = 0; order < MAX_ORDER; ++order) {
1636 fill_contig_page_info(zone, order, &info);
1637 index = unusable_free_index(order, &info);
1638 seq_printf(m, "%d.%03d ", index / 1000, index % 1000);
1645 * Display unusable free space index
1647 * The unusable free space index measures how much of the available free
1648 * memory cannot be used to satisfy an allocation of a given size and is a
1649 * value between 0 and 1. The higher the value, the more of free memory is
1650 * unusable and by implication, the worse the external fragmentation is. This
1651 * can be expressed as a percentage by multiplying by 100.
1653 static int unusable_show(struct seq_file *m, void *arg)
1655 pg_data_t *pgdat = (pg_data_t *)arg;
1657 /* check memoryless node */
1658 if (!node_state(pgdat->node_id, N_MEMORY))
1661 walk_zones_in_node(m, pgdat, unusable_show_print);
1666 static const struct seq_operations unusable_op = {
1667 .start = frag_start,
1670 .show = unusable_show,
1673 static int unusable_open(struct inode *inode, struct file *file)
1675 return seq_open(file, &unusable_op);
1678 static const struct file_operations unusable_file_ops = {
1679 .open = unusable_open,
1681 .llseek = seq_lseek,
1682 .release = seq_release,
1685 static void extfrag_show_print(struct seq_file *m,
1686 pg_data_t *pgdat, struct zone *zone)
1691 /* Alloc on stack as interrupts are disabled for zone walk */
1692 struct contig_page_info info;
1694 seq_printf(m, "Node %d, zone %8s ",
1697 for (order = 0; order < MAX_ORDER; ++order) {
1698 fill_contig_page_info(zone, order, &info);
1699 index = __fragmentation_index(order, &info);
1700 seq_printf(m, "%d.%03d ", index / 1000, index % 1000);
1707 * Display fragmentation index for orders that allocations would fail for
1709 static int extfrag_show(struct seq_file *m, void *arg)
1711 pg_data_t *pgdat = (pg_data_t *)arg;
1713 walk_zones_in_node(m, pgdat, extfrag_show_print);
1718 static const struct seq_operations extfrag_op = {
1719 .start = frag_start,
1722 .show = extfrag_show,
1725 static int extfrag_open(struct inode *inode, struct file *file)
1727 return seq_open(file, &extfrag_op);
1730 static const struct file_operations extfrag_file_ops = {
1731 .open = extfrag_open,
1733 .llseek = seq_lseek,
1734 .release = seq_release,
1737 static int __init extfrag_debug_init(void)
1739 struct dentry *extfrag_debug_root;
1741 extfrag_debug_root = debugfs_create_dir("extfrag", NULL);
1742 if (!extfrag_debug_root)
1745 if (!debugfs_create_file("unusable_index", 0444,
1746 extfrag_debug_root, NULL, &unusable_file_ops))
1749 if (!debugfs_create_file("extfrag_index", 0444,
1750 extfrag_debug_root, NULL, &extfrag_file_ops))
1755 debugfs_remove_recursive(extfrag_debug_root);
1759 module_init(extfrag_debug_init);