Merge tag 'phy-for-4.18-rc' of git://git.kernel.org/pub/scm/linux/kernel/git/kishon...
[linux-2.6-block.git] / mm / vmstat.c
CommitLineData
f6ac2354
CL
1/*
2 * linux/mm/vmstat.c
3 *
4 * Manages VM statistics
5 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
2244b95a
CL
6 *
7 * zoned VM statistics
8 * Copyright (C) 2006 Silicon Graphics, Inc.,
9 * Christoph Lameter <christoph@lameter.com>
7cc36bbd 10 * Copyright (C) 2008-2014 Christoph Lameter
f6ac2354 11 */
8f32f7e5 12#include <linux/fs.h>
f6ac2354 13#include <linux/mm.h>
4e950f6f 14#include <linux/err.h>
2244b95a 15#include <linux/module.h>
5a0e3ad6 16#include <linux/slab.h>
df9ecaba 17#include <linux/cpu.h>
7cc36bbd 18#include <linux/cpumask.h>
c748e134 19#include <linux/vmstat.h>
3c486871
AM
20#include <linux/proc_fs.h>
21#include <linux/seq_file.h>
22#include <linux/debugfs.h>
e8edc6e0 23#include <linux/sched.h>
f1a5ab12 24#include <linux/math64.h>
79da826a 25#include <linux/writeback.h>
36deb0be 26#include <linux/compaction.h>
6e543d57 27#include <linux/mm_inline.h>
48c96a36
JK
28#include <linux/page_ext.h>
29#include <linux/page_owner.h>
6e543d57
LD
30
31#include "internal.h"
f6ac2354 32
1d90ca89
KW
33#define NUMA_STATS_THRESHOLD (U16_MAX - 2)
34
4518085e
KW
35#ifdef CONFIG_NUMA
36int sysctl_vm_numa_stat = ENABLE_NUMA_STAT;
37
38/* zero numa counters within a zone */
39static void zero_zone_numa_counters(struct zone *zone)
40{
41 int item, cpu;
42
43 for (item = 0; item < NR_VM_NUMA_STAT_ITEMS; item++) {
44 atomic_long_set(&zone->vm_numa_stat[item], 0);
45 for_each_online_cpu(cpu)
46 per_cpu_ptr(zone->pageset, cpu)->vm_numa_stat_diff[item]
47 = 0;
48 }
49}
50
51/* zero numa counters of all the populated zones */
52static void zero_zones_numa_counters(void)
53{
54 struct zone *zone;
55
56 for_each_populated_zone(zone)
57 zero_zone_numa_counters(zone);
58}
59
60/* zero global numa counters */
61static void zero_global_numa_counters(void)
62{
63 int item;
64
65 for (item = 0; item < NR_VM_NUMA_STAT_ITEMS; item++)
66 atomic_long_set(&vm_numa_stat[item], 0);
67}
68
69static void invalid_numa_statistics(void)
70{
71 zero_zones_numa_counters();
72 zero_global_numa_counters();
73}
74
75static DEFINE_MUTEX(vm_numa_stat_lock);
76
77int sysctl_vm_numa_stat_handler(struct ctl_table *table, int write,
78 void __user *buffer, size_t *length, loff_t *ppos)
79{
80 int ret, oldval;
81
82 mutex_lock(&vm_numa_stat_lock);
83 if (write)
84 oldval = sysctl_vm_numa_stat;
85 ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
86 if (ret || !write)
87 goto out;
88
89 if (oldval == sysctl_vm_numa_stat)
90 goto out;
91 else if (sysctl_vm_numa_stat == ENABLE_NUMA_STAT) {
92 static_branch_enable(&vm_numa_stat_key);
93 pr_info("enable numa statistics\n");
94 } else {
95 static_branch_disable(&vm_numa_stat_key);
96 invalid_numa_statistics();
97 pr_info("disable numa statistics, and clear numa counters\n");
98 }
99
100out:
101 mutex_unlock(&vm_numa_stat_lock);
102 return ret;
103}
104#endif
105
f8891e5e
CL
106#ifdef CONFIG_VM_EVENT_COUNTERS
107DEFINE_PER_CPU(struct vm_event_state, vm_event_states) = {{0}};
108EXPORT_PER_CPU_SYMBOL(vm_event_states);
109
31f961a8 110static void sum_vm_events(unsigned long *ret)
f8891e5e 111{
9eccf2a8 112 int cpu;
f8891e5e
CL
113 int i;
114
115 memset(ret, 0, NR_VM_EVENT_ITEMS * sizeof(unsigned long));
116
31f961a8 117 for_each_online_cpu(cpu) {
f8891e5e
CL
118 struct vm_event_state *this = &per_cpu(vm_event_states, cpu);
119
f8891e5e
CL
120 for (i = 0; i < NR_VM_EVENT_ITEMS; i++)
121 ret[i] += this->event[i];
122 }
123}
124
125/*
126 * Accumulate the vm event counters across all CPUs.
127 * The result is unavoidably approximate - it can change
128 * during and after execution of this function.
129*/
130void all_vm_events(unsigned long *ret)
131{
b5be1132 132 get_online_cpus();
31f961a8 133 sum_vm_events(ret);
b5be1132 134 put_online_cpus();
f8891e5e 135}
32dd66fc 136EXPORT_SYMBOL_GPL(all_vm_events);
f8891e5e 137
f8891e5e
CL
138/*
139 * Fold the foreign cpu events into our own.
140 *
141 * This is adding to the events on one processor
142 * but keeps the global counts constant.
143 */
144void vm_events_fold_cpu(int cpu)
145{
146 struct vm_event_state *fold_state = &per_cpu(vm_event_states, cpu);
147 int i;
148
149 for (i = 0; i < NR_VM_EVENT_ITEMS; i++) {
150 count_vm_events(i, fold_state->event[i]);
151 fold_state->event[i] = 0;
152 }
153}
f8891e5e
CL
154
155#endif /* CONFIG_VM_EVENT_COUNTERS */
156
2244b95a
CL
157/*
158 * Manage combined zone based / global counters
159 *
160 * vm_stat contains the global counters
161 */
75ef7184 162atomic_long_t vm_zone_stat[NR_VM_ZONE_STAT_ITEMS] __cacheline_aligned_in_smp;
3a321d2a 163atomic_long_t vm_numa_stat[NR_VM_NUMA_STAT_ITEMS] __cacheline_aligned_in_smp;
75ef7184
MG
164atomic_long_t vm_node_stat[NR_VM_NODE_STAT_ITEMS] __cacheline_aligned_in_smp;
165EXPORT_SYMBOL(vm_zone_stat);
3a321d2a 166EXPORT_SYMBOL(vm_numa_stat);
75ef7184 167EXPORT_SYMBOL(vm_node_stat);
2244b95a
CL
168
169#ifdef CONFIG_SMP
170
b44129b3 171int calculate_pressure_threshold(struct zone *zone)
88f5acf8
MG
172{
173 int threshold;
174 int watermark_distance;
175
176 /*
177 * As vmstats are not up to date, there is drift between the estimated
178 * and real values. For high thresholds and a high number of CPUs, it
179 * is possible for the min watermark to be breached while the estimated
180 * value looks fine. The pressure threshold is a reduced value such
181 * that even the maximum amount of drift will not accidentally breach
182 * the min watermark
183 */
184 watermark_distance = low_wmark_pages(zone) - min_wmark_pages(zone);
185 threshold = max(1, (int)(watermark_distance / num_online_cpus()));
186
187 /*
188 * Maximum threshold is 125
189 */
190 threshold = min(125, threshold);
191
192 return threshold;
193}
194
b44129b3 195int calculate_normal_threshold(struct zone *zone)
df9ecaba
CL
196{
197 int threshold;
198 int mem; /* memory in 128 MB units */
199
200 /*
201 * The threshold scales with the number of processors and the amount
202 * of memory per zone. More memory means that we can defer updates for
203 * longer, more processors could lead to more contention.
204 * fls() is used to have a cheap way of logarithmic scaling.
205 *
206 * Some sample thresholds:
207 *
208 * Threshold Processors (fls) Zonesize fls(mem+1)
209 * ------------------------------------------------------------------
210 * 8 1 1 0.9-1 GB 4
211 * 16 2 2 0.9-1 GB 4
212 * 20 2 2 1-2 GB 5
213 * 24 2 2 2-4 GB 6
214 * 28 2 2 4-8 GB 7
215 * 32 2 2 8-16 GB 8
216 * 4 2 2 <128M 1
217 * 30 4 3 2-4 GB 5
218 * 48 4 3 8-16 GB 8
219 * 32 8 4 1-2 GB 4
220 * 32 8 4 0.9-1GB 4
221 * 10 16 5 <128M 1
222 * 40 16 5 900M 4
223 * 70 64 7 2-4 GB 5
224 * 84 64 7 4-8 GB 6
225 * 108 512 9 4-8 GB 6
226 * 125 1024 10 8-16 GB 8
227 * 125 1024 10 16-32 GB 9
228 */
229
b40da049 230 mem = zone->managed_pages >> (27 - PAGE_SHIFT);
df9ecaba
CL
231
232 threshold = 2 * fls(num_online_cpus()) * (1 + fls(mem));
233
234 /*
235 * Maximum threshold is 125
236 */
237 threshold = min(125, threshold);
238
239 return threshold;
240}
2244b95a
CL
241
242/*
df9ecaba 243 * Refresh the thresholds for each zone.
2244b95a 244 */
a6cccdc3 245void refresh_zone_stat_thresholds(void)
2244b95a 246{
75ef7184 247 struct pglist_data *pgdat;
df9ecaba
CL
248 struct zone *zone;
249 int cpu;
250 int threshold;
251
75ef7184
MG
252 /* Zero current pgdat thresholds */
253 for_each_online_pgdat(pgdat) {
254 for_each_online_cpu(cpu) {
255 per_cpu_ptr(pgdat->per_cpu_nodestats, cpu)->stat_threshold = 0;
256 }
257 }
258
ee99c71c 259 for_each_populated_zone(zone) {
75ef7184 260 struct pglist_data *pgdat = zone->zone_pgdat;
aa454840
CL
261 unsigned long max_drift, tolerate_drift;
262
b44129b3 263 threshold = calculate_normal_threshold(zone);
df9ecaba 264
75ef7184
MG
265 for_each_online_cpu(cpu) {
266 int pgdat_threshold;
267
99dcc3e5
CL
268 per_cpu_ptr(zone->pageset, cpu)->stat_threshold
269 = threshold;
1d90ca89 270
75ef7184
MG
271 /* Base nodestat threshold on the largest populated zone. */
272 pgdat_threshold = per_cpu_ptr(pgdat->per_cpu_nodestats, cpu)->stat_threshold;
273 per_cpu_ptr(pgdat->per_cpu_nodestats, cpu)->stat_threshold
274 = max(threshold, pgdat_threshold);
275 }
276
aa454840
CL
277 /*
278 * Only set percpu_drift_mark if there is a danger that
279 * NR_FREE_PAGES reports the low watermark is ok when in fact
280 * the min watermark could be breached by an allocation
281 */
282 tolerate_drift = low_wmark_pages(zone) - min_wmark_pages(zone);
283 max_drift = num_online_cpus() * threshold;
284 if (max_drift > tolerate_drift)
285 zone->percpu_drift_mark = high_wmark_pages(zone) +
286 max_drift;
df9ecaba 287 }
2244b95a
CL
288}
289
b44129b3
MG
290void set_pgdat_percpu_threshold(pg_data_t *pgdat,
291 int (*calculate_pressure)(struct zone *))
88f5acf8
MG
292{
293 struct zone *zone;
294 int cpu;
295 int threshold;
296 int i;
297
88f5acf8
MG
298 for (i = 0; i < pgdat->nr_zones; i++) {
299 zone = &pgdat->node_zones[i];
300 if (!zone->percpu_drift_mark)
301 continue;
302
b44129b3 303 threshold = (*calculate_pressure)(zone);
1d90ca89 304 for_each_online_cpu(cpu)
88f5acf8
MG
305 per_cpu_ptr(zone->pageset, cpu)->stat_threshold
306 = threshold;
307 }
88f5acf8
MG
308}
309
2244b95a 310/*
bea04b07
JZ
311 * For use when we know that interrupts are disabled,
312 * or when we know that preemption is disabled and that
313 * particular counter cannot be updated from interrupt context.
2244b95a
CL
314 */
315void __mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
6cdb18ad 316 long delta)
2244b95a 317{
12938a92
CL
318 struct per_cpu_pageset __percpu *pcp = zone->pageset;
319 s8 __percpu *p = pcp->vm_stat_diff + item;
2244b95a 320 long x;
12938a92
CL
321 long t;
322
323 x = delta + __this_cpu_read(*p);
2244b95a 324
12938a92 325 t = __this_cpu_read(pcp->stat_threshold);
2244b95a 326
12938a92 327 if (unlikely(x > t || x < -t)) {
2244b95a
CL
328 zone_page_state_add(x, zone, item);
329 x = 0;
330 }
12938a92 331 __this_cpu_write(*p, x);
2244b95a
CL
332}
333EXPORT_SYMBOL(__mod_zone_page_state);
334
75ef7184
MG
335void __mod_node_page_state(struct pglist_data *pgdat, enum node_stat_item item,
336 long delta)
337{
338 struct per_cpu_nodestat __percpu *pcp = pgdat->per_cpu_nodestats;
339 s8 __percpu *p = pcp->vm_node_stat_diff + item;
340 long x;
341 long t;
342
343 x = delta + __this_cpu_read(*p);
344
345 t = __this_cpu_read(pcp->stat_threshold);
346
347 if (unlikely(x > t || x < -t)) {
348 node_page_state_add(x, pgdat, item);
349 x = 0;
350 }
351 __this_cpu_write(*p, x);
352}
353EXPORT_SYMBOL(__mod_node_page_state);
354
2244b95a
CL
355/*
356 * Optimized increment and decrement functions.
357 *
358 * These are only for a single page and therefore can take a struct page *
359 * argument instead of struct zone *. This allows the inclusion of the code
360 * generated for page_zone(page) into the optimized functions.
361 *
362 * No overflow check is necessary and therefore the differential can be
363 * incremented or decremented in place which may allow the compilers to
364 * generate better code.
2244b95a
CL
365 * The increment or decrement is known and therefore one boundary check can
366 * be omitted.
367 *
df9ecaba
CL
368 * NOTE: These functions are very performance sensitive. Change only
369 * with care.
370 *
2244b95a
CL
371 * Some processors have inc/dec instructions that are atomic vs an interrupt.
372 * However, the code must first determine the differential location in a zone
373 * based on the processor number and then inc/dec the counter. There is no
374 * guarantee without disabling preemption that the processor will not change
375 * in between and therefore the atomicity vs. interrupt cannot be exploited
376 * in a useful way here.
377 */
c8785385 378void __inc_zone_state(struct zone *zone, enum zone_stat_item item)
2244b95a 379{
12938a92
CL
380 struct per_cpu_pageset __percpu *pcp = zone->pageset;
381 s8 __percpu *p = pcp->vm_stat_diff + item;
382 s8 v, t;
2244b95a 383
908ee0f1 384 v = __this_cpu_inc_return(*p);
12938a92
CL
385 t = __this_cpu_read(pcp->stat_threshold);
386 if (unlikely(v > t)) {
387 s8 overstep = t >> 1;
df9ecaba 388
12938a92
CL
389 zone_page_state_add(v + overstep, zone, item);
390 __this_cpu_write(*p, -overstep);
2244b95a
CL
391 }
392}
ca889e6c 393
75ef7184
MG
394void __inc_node_state(struct pglist_data *pgdat, enum node_stat_item item)
395{
396 struct per_cpu_nodestat __percpu *pcp = pgdat->per_cpu_nodestats;
397 s8 __percpu *p = pcp->vm_node_stat_diff + item;
398 s8 v, t;
399
400 v = __this_cpu_inc_return(*p);
401 t = __this_cpu_read(pcp->stat_threshold);
402 if (unlikely(v > t)) {
403 s8 overstep = t >> 1;
404
405 node_page_state_add(v + overstep, pgdat, item);
406 __this_cpu_write(*p, -overstep);
407 }
408}
409
ca889e6c
CL
410void __inc_zone_page_state(struct page *page, enum zone_stat_item item)
411{
412 __inc_zone_state(page_zone(page), item);
413}
2244b95a
CL
414EXPORT_SYMBOL(__inc_zone_page_state);
415
75ef7184
MG
416void __inc_node_page_state(struct page *page, enum node_stat_item item)
417{
418 __inc_node_state(page_pgdat(page), item);
419}
420EXPORT_SYMBOL(__inc_node_page_state);
421
c8785385 422void __dec_zone_state(struct zone *zone, enum zone_stat_item item)
2244b95a 423{
12938a92
CL
424 struct per_cpu_pageset __percpu *pcp = zone->pageset;
425 s8 __percpu *p = pcp->vm_stat_diff + item;
426 s8 v, t;
2244b95a 427
908ee0f1 428 v = __this_cpu_dec_return(*p);
12938a92
CL
429 t = __this_cpu_read(pcp->stat_threshold);
430 if (unlikely(v < - t)) {
431 s8 overstep = t >> 1;
2244b95a 432
12938a92
CL
433 zone_page_state_add(v - overstep, zone, item);
434 __this_cpu_write(*p, overstep);
2244b95a
CL
435 }
436}
c8785385 437
75ef7184
MG
438void __dec_node_state(struct pglist_data *pgdat, enum node_stat_item item)
439{
440 struct per_cpu_nodestat __percpu *pcp = pgdat->per_cpu_nodestats;
441 s8 __percpu *p = pcp->vm_node_stat_diff + item;
442 s8 v, t;
443
444 v = __this_cpu_dec_return(*p);
445 t = __this_cpu_read(pcp->stat_threshold);
446 if (unlikely(v < - t)) {
447 s8 overstep = t >> 1;
448
449 node_page_state_add(v - overstep, pgdat, item);
450 __this_cpu_write(*p, overstep);
451 }
452}
453
c8785385
CL
454void __dec_zone_page_state(struct page *page, enum zone_stat_item item)
455{
456 __dec_zone_state(page_zone(page), item);
457}
2244b95a
CL
458EXPORT_SYMBOL(__dec_zone_page_state);
459
75ef7184
MG
460void __dec_node_page_state(struct page *page, enum node_stat_item item)
461{
462 __dec_node_state(page_pgdat(page), item);
463}
464EXPORT_SYMBOL(__dec_node_page_state);
465
4156153c 466#ifdef CONFIG_HAVE_CMPXCHG_LOCAL
7c839120
CL
467/*
468 * If we have cmpxchg_local support then we do not need to incur the overhead
469 * that comes with local_irq_save/restore if we use this_cpu_cmpxchg.
470 *
471 * mod_state() modifies the zone counter state through atomic per cpu
472 * operations.
473 *
474 * Overstep mode specifies how overstep should handled:
475 * 0 No overstepping
476 * 1 Overstepping half of threshold
477 * -1 Overstepping minus half of threshold
478*/
75ef7184
MG
479static inline void mod_zone_state(struct zone *zone,
480 enum zone_stat_item item, long delta, int overstep_mode)
7c839120
CL
481{
482 struct per_cpu_pageset __percpu *pcp = zone->pageset;
483 s8 __percpu *p = pcp->vm_stat_diff + item;
484 long o, n, t, z;
485
486 do {
487 z = 0; /* overflow to zone counters */
488
489 /*
490 * The fetching of the stat_threshold is racy. We may apply
491 * a counter threshold to the wrong the cpu if we get
d3bc2367
CL
492 * rescheduled while executing here. However, the next
493 * counter update will apply the threshold again and
494 * therefore bring the counter under the threshold again.
495 *
496 * Most of the time the thresholds are the same anyways
497 * for all cpus in a zone.
7c839120
CL
498 */
499 t = this_cpu_read(pcp->stat_threshold);
500
501 o = this_cpu_read(*p);
502 n = delta + o;
503
504 if (n > t || n < -t) {
505 int os = overstep_mode * (t >> 1) ;
506
507 /* Overflow must be added to zone counters */
508 z = n + os;
509 n = -os;
510 }
511 } while (this_cpu_cmpxchg(*p, o, n) != o);
512
513 if (z)
514 zone_page_state_add(z, zone, item);
515}
516
517void mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
6cdb18ad 518 long delta)
7c839120 519{
75ef7184 520 mod_zone_state(zone, item, delta, 0);
7c839120
CL
521}
522EXPORT_SYMBOL(mod_zone_page_state);
523
7c839120
CL
524void inc_zone_page_state(struct page *page, enum zone_stat_item item)
525{
75ef7184 526 mod_zone_state(page_zone(page), item, 1, 1);
7c839120
CL
527}
528EXPORT_SYMBOL(inc_zone_page_state);
529
530void dec_zone_page_state(struct page *page, enum zone_stat_item item)
531{
75ef7184 532 mod_zone_state(page_zone(page), item, -1, -1);
7c839120
CL
533}
534EXPORT_SYMBOL(dec_zone_page_state);
75ef7184
MG
535
536static inline void mod_node_state(struct pglist_data *pgdat,
537 enum node_stat_item item, int delta, int overstep_mode)
538{
539 struct per_cpu_nodestat __percpu *pcp = pgdat->per_cpu_nodestats;
540 s8 __percpu *p = pcp->vm_node_stat_diff + item;
541 long o, n, t, z;
542
543 do {
544 z = 0; /* overflow to node counters */
545
546 /*
547 * The fetching of the stat_threshold is racy. We may apply
548 * a counter threshold to the wrong the cpu if we get
549 * rescheduled while executing here. However, the next
550 * counter update will apply the threshold again and
551 * therefore bring the counter under the threshold again.
552 *
553 * Most of the time the thresholds are the same anyways
554 * for all cpus in a node.
555 */
556 t = this_cpu_read(pcp->stat_threshold);
557
558 o = this_cpu_read(*p);
559 n = delta + o;
560
561 if (n > t || n < -t) {
562 int os = overstep_mode * (t >> 1) ;
563
564 /* Overflow must be added to node counters */
565 z = n + os;
566 n = -os;
567 }
568 } while (this_cpu_cmpxchg(*p, o, n) != o);
569
570 if (z)
571 node_page_state_add(z, pgdat, item);
572}
573
574void mod_node_page_state(struct pglist_data *pgdat, enum node_stat_item item,
575 long delta)
576{
577 mod_node_state(pgdat, item, delta, 0);
578}
579EXPORT_SYMBOL(mod_node_page_state);
580
581void inc_node_state(struct pglist_data *pgdat, enum node_stat_item item)
582{
583 mod_node_state(pgdat, item, 1, 1);
584}
585
586void inc_node_page_state(struct page *page, enum node_stat_item item)
587{
588 mod_node_state(page_pgdat(page), item, 1, 1);
589}
590EXPORT_SYMBOL(inc_node_page_state);
591
592void dec_node_page_state(struct page *page, enum node_stat_item item)
593{
594 mod_node_state(page_pgdat(page), item, -1, -1);
595}
596EXPORT_SYMBOL(dec_node_page_state);
7c839120
CL
597#else
598/*
599 * Use interrupt disable to serialize counter updates
600 */
601void mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
6cdb18ad 602 long delta)
7c839120
CL
603{
604 unsigned long flags;
605
606 local_irq_save(flags);
607 __mod_zone_page_state(zone, item, delta);
608 local_irq_restore(flags);
609}
610EXPORT_SYMBOL(mod_zone_page_state);
611
2244b95a
CL
612void inc_zone_page_state(struct page *page, enum zone_stat_item item)
613{
614 unsigned long flags;
615 struct zone *zone;
2244b95a
CL
616
617 zone = page_zone(page);
618 local_irq_save(flags);
ca889e6c 619 __inc_zone_state(zone, item);
2244b95a
CL
620 local_irq_restore(flags);
621}
622EXPORT_SYMBOL(inc_zone_page_state);
623
624void dec_zone_page_state(struct page *page, enum zone_stat_item item)
625{
626 unsigned long flags;
2244b95a 627
2244b95a 628 local_irq_save(flags);
a302eb4e 629 __dec_zone_page_state(page, item);
2244b95a
CL
630 local_irq_restore(flags);
631}
632EXPORT_SYMBOL(dec_zone_page_state);
633
75ef7184
MG
634void inc_node_state(struct pglist_data *pgdat, enum node_stat_item item)
635{
636 unsigned long flags;
637
638 local_irq_save(flags);
639 __inc_node_state(pgdat, item);
640 local_irq_restore(flags);
641}
642EXPORT_SYMBOL(inc_node_state);
643
644void mod_node_page_state(struct pglist_data *pgdat, enum node_stat_item item,
645 long delta)
646{
647 unsigned long flags;
648
649 local_irq_save(flags);
650 __mod_node_page_state(pgdat, item, delta);
651 local_irq_restore(flags);
652}
653EXPORT_SYMBOL(mod_node_page_state);
654
655void inc_node_page_state(struct page *page, enum node_stat_item item)
656{
657 unsigned long flags;
658 struct pglist_data *pgdat;
659
660 pgdat = page_pgdat(page);
661 local_irq_save(flags);
662 __inc_node_state(pgdat, item);
663 local_irq_restore(flags);
664}
665EXPORT_SYMBOL(inc_node_page_state);
666
667void dec_node_page_state(struct page *page, enum node_stat_item item)
668{
669 unsigned long flags;
670
671 local_irq_save(flags);
672 __dec_node_page_state(page, item);
673 local_irq_restore(flags);
674}
675EXPORT_SYMBOL(dec_node_page_state);
676#endif
7cc36bbd
CL
677
678/*
679 * Fold a differential into the global counters.
680 * Returns the number of counters updated.
681 */
3a321d2a
KW
682#ifdef CONFIG_NUMA
683static int fold_diff(int *zone_diff, int *numa_diff, int *node_diff)
684{
685 int i;
686 int changes = 0;
687
688 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
689 if (zone_diff[i]) {
690 atomic_long_add(zone_diff[i], &vm_zone_stat[i]);
691 changes++;
692 }
693
694 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++)
695 if (numa_diff[i]) {
696 atomic_long_add(numa_diff[i], &vm_numa_stat[i]);
697 changes++;
698 }
699
700 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++)
701 if (node_diff[i]) {
702 atomic_long_add(node_diff[i], &vm_node_stat[i]);
703 changes++;
704 }
705 return changes;
706}
707#else
75ef7184 708static int fold_diff(int *zone_diff, int *node_diff)
4edb0748
CL
709{
710 int i;
7cc36bbd 711 int changes = 0;
4edb0748
CL
712
713 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
75ef7184
MG
714 if (zone_diff[i]) {
715 atomic_long_add(zone_diff[i], &vm_zone_stat[i]);
716 changes++;
717 }
718
719 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++)
720 if (node_diff[i]) {
721 atomic_long_add(node_diff[i], &vm_node_stat[i]);
7cc36bbd
CL
722 changes++;
723 }
724 return changes;
4edb0748 725}
3a321d2a 726#endif /* CONFIG_NUMA */
4edb0748 727
2244b95a 728/*
2bb921e5 729 * Update the zone counters for the current cpu.
a7f75e25 730 *
4037d452
CL
731 * Note that refresh_cpu_vm_stats strives to only access
732 * node local memory. The per cpu pagesets on remote zones are placed
733 * in the memory local to the processor using that pageset. So the
734 * loop over all zones will access a series of cachelines local to
735 * the processor.
736 *
737 * The call to zone_page_state_add updates the cachelines with the
738 * statistics in the remote zone struct as well as the global cachelines
739 * with the global counters. These could cause remote node cache line
740 * bouncing and will have to be only done when necessary.
7cc36bbd
CL
741 *
742 * The function returns the number of global counters updated.
2244b95a 743 */
0eb77e98 744static int refresh_cpu_vm_stats(bool do_pagesets)
2244b95a 745{
75ef7184 746 struct pglist_data *pgdat;
2244b95a
CL
747 struct zone *zone;
748 int i;
75ef7184 749 int global_zone_diff[NR_VM_ZONE_STAT_ITEMS] = { 0, };
3a321d2a
KW
750#ifdef CONFIG_NUMA
751 int global_numa_diff[NR_VM_NUMA_STAT_ITEMS] = { 0, };
752#endif
75ef7184 753 int global_node_diff[NR_VM_NODE_STAT_ITEMS] = { 0, };
7cc36bbd 754 int changes = 0;
2244b95a 755
ee99c71c 756 for_each_populated_zone(zone) {
fbc2edb0 757 struct per_cpu_pageset __percpu *p = zone->pageset;
2244b95a 758
fbc2edb0
CL
759 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++) {
760 int v;
2244b95a 761
fbc2edb0
CL
762 v = this_cpu_xchg(p->vm_stat_diff[i], 0);
763 if (v) {
a7f75e25 764
a7f75e25 765 atomic_long_add(v, &zone->vm_stat[i]);
75ef7184 766 global_zone_diff[i] += v;
4037d452
CL
767#ifdef CONFIG_NUMA
768 /* 3 seconds idle till flush */
fbc2edb0 769 __this_cpu_write(p->expire, 3);
4037d452 770#endif
2244b95a 771 }
fbc2edb0 772 }
4037d452 773#ifdef CONFIG_NUMA
3a321d2a
KW
774 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++) {
775 int v;
776
777 v = this_cpu_xchg(p->vm_numa_stat_diff[i], 0);
778 if (v) {
779
780 atomic_long_add(v, &zone->vm_numa_stat[i]);
781 global_numa_diff[i] += v;
782 __this_cpu_write(p->expire, 3);
783 }
784 }
785
0eb77e98
CL
786 if (do_pagesets) {
787 cond_resched();
788 /*
789 * Deal with draining the remote pageset of this
790 * processor
791 *
792 * Check if there are pages remaining in this pageset
793 * if not then there is nothing to expire.
794 */
795 if (!__this_cpu_read(p->expire) ||
fbc2edb0 796 !__this_cpu_read(p->pcp.count))
0eb77e98 797 continue;
4037d452 798
0eb77e98
CL
799 /*
800 * We never drain zones local to this processor.
801 */
802 if (zone_to_nid(zone) == numa_node_id()) {
803 __this_cpu_write(p->expire, 0);
804 continue;
805 }
4037d452 806
0eb77e98
CL
807 if (__this_cpu_dec_return(p->expire))
808 continue;
4037d452 809
0eb77e98
CL
810 if (__this_cpu_read(p->pcp.count)) {
811 drain_zone_pages(zone, this_cpu_ptr(&p->pcp));
812 changes++;
813 }
7cc36bbd 814 }
4037d452 815#endif
2244b95a 816 }
75ef7184
MG
817
818 for_each_online_pgdat(pgdat) {
819 struct per_cpu_nodestat __percpu *p = pgdat->per_cpu_nodestats;
820
821 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++) {
822 int v;
823
824 v = this_cpu_xchg(p->vm_node_stat_diff[i], 0);
825 if (v) {
826 atomic_long_add(v, &pgdat->vm_stat[i]);
827 global_node_diff[i] += v;
828 }
829 }
830 }
831
3a321d2a
KW
832#ifdef CONFIG_NUMA
833 changes += fold_diff(global_zone_diff, global_numa_diff,
834 global_node_diff);
835#else
75ef7184 836 changes += fold_diff(global_zone_diff, global_node_diff);
3a321d2a 837#endif
7cc36bbd 838 return changes;
2244b95a
CL
839}
840
2bb921e5
CL
841/*
842 * Fold the data for an offline cpu into the global array.
843 * There cannot be any access by the offline cpu and therefore
844 * synchronization is simplified.
845 */
846void cpu_vm_stats_fold(int cpu)
847{
75ef7184 848 struct pglist_data *pgdat;
2bb921e5
CL
849 struct zone *zone;
850 int i;
75ef7184 851 int global_zone_diff[NR_VM_ZONE_STAT_ITEMS] = { 0, };
3a321d2a
KW
852#ifdef CONFIG_NUMA
853 int global_numa_diff[NR_VM_NUMA_STAT_ITEMS] = { 0, };
854#endif
75ef7184 855 int global_node_diff[NR_VM_NODE_STAT_ITEMS] = { 0, };
2bb921e5
CL
856
857 for_each_populated_zone(zone) {
858 struct per_cpu_pageset *p;
859
860 p = per_cpu_ptr(zone->pageset, cpu);
861
862 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
863 if (p->vm_stat_diff[i]) {
864 int v;
865
866 v = p->vm_stat_diff[i];
867 p->vm_stat_diff[i] = 0;
868 atomic_long_add(v, &zone->vm_stat[i]);
75ef7184 869 global_zone_diff[i] += v;
2bb921e5 870 }
3a321d2a
KW
871
872#ifdef CONFIG_NUMA
873 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++)
874 if (p->vm_numa_stat_diff[i]) {
875 int v;
876
877 v = p->vm_numa_stat_diff[i];
878 p->vm_numa_stat_diff[i] = 0;
879 atomic_long_add(v, &zone->vm_numa_stat[i]);
880 global_numa_diff[i] += v;
881 }
882#endif
2bb921e5
CL
883 }
884
75ef7184
MG
885 for_each_online_pgdat(pgdat) {
886 struct per_cpu_nodestat *p;
887
888 p = per_cpu_ptr(pgdat->per_cpu_nodestats, cpu);
889
890 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++)
891 if (p->vm_node_stat_diff[i]) {
892 int v;
893
894 v = p->vm_node_stat_diff[i];
895 p->vm_node_stat_diff[i] = 0;
896 atomic_long_add(v, &pgdat->vm_stat[i]);
897 global_node_diff[i] += v;
898 }
899 }
900
3a321d2a
KW
901#ifdef CONFIG_NUMA
902 fold_diff(global_zone_diff, global_numa_diff, global_node_diff);
903#else
75ef7184 904 fold_diff(global_zone_diff, global_node_diff);
3a321d2a 905#endif
2bb921e5
CL
906}
907
40f4b1ea
CS
908/*
909 * this is only called if !populated_zone(zone), which implies no other users of
910 * pset->vm_stat_diff[] exsist.
911 */
5a883813
MK
912void drain_zonestat(struct zone *zone, struct per_cpu_pageset *pset)
913{
914 int i;
915
916 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
917 if (pset->vm_stat_diff[i]) {
918 int v = pset->vm_stat_diff[i];
919 pset->vm_stat_diff[i] = 0;
920 atomic_long_add(v, &zone->vm_stat[i]);
75ef7184 921 atomic_long_add(v, &vm_zone_stat[i]);
5a883813 922 }
3a321d2a
KW
923
924#ifdef CONFIG_NUMA
925 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++)
926 if (pset->vm_numa_stat_diff[i]) {
927 int v = pset->vm_numa_stat_diff[i];
928
929 pset->vm_numa_stat_diff[i] = 0;
930 atomic_long_add(v, &zone->vm_numa_stat[i]);
931 atomic_long_add(v, &vm_numa_stat[i]);
932 }
933#endif
5a883813 934}
2244b95a
CL
935#endif
936
ca889e6c 937#ifdef CONFIG_NUMA
3a321d2a
KW
938void __inc_numa_state(struct zone *zone,
939 enum numa_stat_item item)
940{
941 struct per_cpu_pageset __percpu *pcp = zone->pageset;
1d90ca89
KW
942 u16 __percpu *p = pcp->vm_numa_stat_diff + item;
943 u16 v;
3a321d2a
KW
944
945 v = __this_cpu_inc_return(*p);
3a321d2a 946
1d90ca89
KW
947 if (unlikely(v > NUMA_STATS_THRESHOLD)) {
948 zone_numa_state_add(v, zone, item);
949 __this_cpu_write(*p, 0);
3a321d2a
KW
950 }
951}
952
c2d42c16 953/*
75ef7184
MG
954 * Determine the per node value of a stat item. This function
955 * is called frequently in a NUMA machine, so try to be as
956 * frugal as possible.
c2d42c16 957 */
75ef7184
MG
958unsigned long sum_zone_node_page_state(int node,
959 enum zone_stat_item item)
c2d42c16
AM
960{
961 struct zone *zones = NODE_DATA(node)->node_zones;
e87d59f7
JK
962 int i;
963 unsigned long count = 0;
c2d42c16 964
e87d59f7
JK
965 for (i = 0; i < MAX_NR_ZONES; i++)
966 count += zone_page_state(zones + i, item);
967
968 return count;
c2d42c16
AM
969}
970
63803222
KW
971/*
972 * Determine the per node value of a numa stat item. To avoid deviation,
973 * the per cpu stat number in vm_numa_stat_diff[] is also included.
974 */
3a321d2a
KW
975unsigned long sum_zone_numa_state(int node,
976 enum numa_stat_item item)
977{
978 struct zone *zones = NODE_DATA(node)->node_zones;
979 int i;
980 unsigned long count = 0;
981
982 for (i = 0; i < MAX_NR_ZONES; i++)
63803222 983 count += zone_numa_state_snapshot(zones + i, item);
3a321d2a
KW
984
985 return count;
986}
987
75ef7184
MG
988/*
989 * Determine the per node value of a stat item.
990 */
991unsigned long node_page_state(struct pglist_data *pgdat,
992 enum node_stat_item item)
993{
994 long x = atomic_long_read(&pgdat->vm_stat[item]);
995#ifdef CONFIG_SMP
996 if (x < 0)
997 x = 0;
998#endif
999 return x;
1000}
ca889e6c
CL
1001#endif
1002
d7a5752c 1003#ifdef CONFIG_COMPACTION
36deb0be 1004
d7a5752c
MG
1005struct contig_page_info {
1006 unsigned long free_pages;
1007 unsigned long free_blocks_total;
1008 unsigned long free_blocks_suitable;
1009};
1010
1011/*
1012 * Calculate the number of free pages in a zone, how many contiguous
1013 * pages are free and how many are large enough to satisfy an allocation of
1014 * the target size. Note that this function makes no attempt to estimate
1015 * how many suitable free blocks there *might* be if MOVABLE pages were
1016 * migrated. Calculating that is possible, but expensive and can be
1017 * figured out from userspace
1018 */
1019static void fill_contig_page_info(struct zone *zone,
1020 unsigned int suitable_order,
1021 struct contig_page_info *info)
1022{
1023 unsigned int order;
1024
1025 info->free_pages = 0;
1026 info->free_blocks_total = 0;
1027 info->free_blocks_suitable = 0;
1028
1029 for (order = 0; order < MAX_ORDER; order++) {
1030 unsigned long blocks;
1031
1032 /* Count number of free blocks */
1033 blocks = zone->free_area[order].nr_free;
1034 info->free_blocks_total += blocks;
1035
1036 /* Count free base pages */
1037 info->free_pages += blocks << order;
1038
1039 /* Count the suitable free blocks */
1040 if (order >= suitable_order)
1041 info->free_blocks_suitable += blocks <<
1042 (order - suitable_order);
1043 }
1044}
f1a5ab12
MG
1045
1046/*
1047 * A fragmentation index only makes sense if an allocation of a requested
1048 * size would fail. If that is true, the fragmentation index indicates
1049 * whether external fragmentation or a lack of memory was the problem.
1050 * The value can be used to determine if page reclaim or compaction
1051 * should be used
1052 */
56de7263 1053static int __fragmentation_index(unsigned int order, struct contig_page_info *info)
f1a5ab12
MG
1054{
1055 unsigned long requested = 1UL << order;
1056
88d6ac40
WY
1057 if (WARN_ON_ONCE(order >= MAX_ORDER))
1058 return 0;
1059
f1a5ab12
MG
1060 if (!info->free_blocks_total)
1061 return 0;
1062
1063 /* Fragmentation index only makes sense when a request would fail */
1064 if (info->free_blocks_suitable)
1065 return -1000;
1066
1067 /*
1068 * Index is between 0 and 1 so return within 3 decimal places
1069 *
1070 * 0 => allocation would fail due to lack of memory
1071 * 1 => allocation would fail due to fragmentation
1072 */
1073 return 1000 - div_u64( (1000+(div_u64(info->free_pages * 1000ULL, requested))), info->free_blocks_total);
1074}
56de7263
MG
1075
1076/* Same as __fragmentation index but allocs contig_page_info on stack */
1077int fragmentation_index(struct zone *zone, unsigned int order)
1078{
1079 struct contig_page_info info;
1080
1081 fill_contig_page_info(zone, order, &info);
1082 return __fragmentation_index(order, &info);
1083}
d7a5752c
MG
1084#endif
1085
0d6617c7 1086#if defined(CONFIG_PROC_FS) || defined(CONFIG_SYSFS) || defined(CONFIG_NUMA)
fa25c503
KM
1087#ifdef CONFIG_ZONE_DMA
1088#define TEXT_FOR_DMA(xx) xx "_dma",
1089#else
1090#define TEXT_FOR_DMA(xx)
1091#endif
1092
1093#ifdef CONFIG_ZONE_DMA32
1094#define TEXT_FOR_DMA32(xx) xx "_dma32",
1095#else
1096#define TEXT_FOR_DMA32(xx)
1097#endif
1098
1099#ifdef CONFIG_HIGHMEM
1100#define TEXT_FOR_HIGHMEM(xx) xx "_high",
1101#else
1102#define TEXT_FOR_HIGHMEM(xx)
1103#endif
1104
1105#define TEXTS_FOR_ZONES(xx) TEXT_FOR_DMA(xx) TEXT_FOR_DMA32(xx) xx "_normal", \
1106 TEXT_FOR_HIGHMEM(xx) xx "_movable",
1107
1108const char * const vmstat_text[] = {
09316c09 1109 /* enum zone_stat_item countes */
fa25c503 1110 "nr_free_pages",
71c799f4
MK
1111 "nr_zone_inactive_anon",
1112 "nr_zone_active_anon",
1113 "nr_zone_inactive_file",
1114 "nr_zone_active_file",
1115 "nr_zone_unevictable",
5a1c84b4 1116 "nr_zone_write_pending",
fa25c503 1117 "nr_mlock",
fa25c503
KM
1118 "nr_page_table_pages",
1119 "nr_kernel_stack",
fa25c503 1120 "nr_bounce",
91537fee
MK
1121#if IS_ENABLED(CONFIG_ZSMALLOC)
1122 "nr_zspages",
1123#endif
3a321d2a
KW
1124 "nr_free_cma",
1125
1126 /* enum numa_stat_item counters */
fa25c503
KM
1127#ifdef CONFIG_NUMA
1128 "numa_hit",
1129 "numa_miss",
1130 "numa_foreign",
1131 "numa_interleave",
1132 "numa_local",
1133 "numa_other",
1134#endif
09316c09 1135
599d0c95
MG
1136 /* Node-based counters */
1137 "nr_inactive_anon",
1138 "nr_active_anon",
1139 "nr_inactive_file",
1140 "nr_active_file",
1141 "nr_unevictable",
385386cf
JW
1142 "nr_slab_reclaimable",
1143 "nr_slab_unreclaimable",
599d0c95
MG
1144 "nr_isolated_anon",
1145 "nr_isolated_file",
1e6b1085
MG
1146 "workingset_refault",
1147 "workingset_activate",
1148 "workingset_nodereclaim",
50658e2e
MG
1149 "nr_anon_pages",
1150 "nr_mapped",
11fb9989
MG
1151 "nr_file_pages",
1152 "nr_dirty",
1153 "nr_writeback",
1154 "nr_writeback_temp",
1155 "nr_shmem",
1156 "nr_shmem_hugepages",
1157 "nr_shmem_pmdmapped",
1158 "nr_anon_transparent_hugepages",
1159 "nr_unstable",
c4a25635
MG
1160 "nr_vmscan_write",
1161 "nr_vmscan_immediate_reclaim",
1162 "nr_dirtied",
1163 "nr_written",
7aaf7727 1164 "", /* nr_indirectly_reclaimable */
599d0c95 1165
09316c09 1166 /* enum writeback_stat_item counters */
fa25c503
KM
1167 "nr_dirty_threshold",
1168 "nr_dirty_background_threshold",
1169
1170#ifdef CONFIG_VM_EVENT_COUNTERS
09316c09 1171 /* enum vm_event_item counters */
fa25c503
KM
1172 "pgpgin",
1173 "pgpgout",
1174 "pswpin",
1175 "pswpout",
1176
1177 TEXTS_FOR_ZONES("pgalloc")
7cc30fcf
MG
1178 TEXTS_FOR_ZONES("allocstall")
1179 TEXTS_FOR_ZONES("pgskip")
fa25c503
KM
1180
1181 "pgfree",
1182 "pgactivate",
1183 "pgdeactivate",
f7ad2a6c 1184 "pglazyfree",
fa25c503
KM
1185
1186 "pgfault",
1187 "pgmajfault",
854e9ed0 1188 "pglazyfreed",
fa25c503 1189
599d0c95
MG
1190 "pgrefill",
1191 "pgsteal_kswapd",
1192 "pgsteal_direct",
1193 "pgscan_kswapd",
1194 "pgscan_direct",
68243e76 1195 "pgscan_direct_throttle",
fa25c503
KM
1196
1197#ifdef CONFIG_NUMA
1198 "zone_reclaim_failed",
1199#endif
1200 "pginodesteal",
1201 "slabs_scanned",
fa25c503
KM
1202 "kswapd_inodesteal",
1203 "kswapd_low_wmark_hit_quickly",
1204 "kswapd_high_wmark_hit_quickly",
fa25c503 1205 "pageoutrun",
fa25c503
KM
1206
1207 "pgrotated",
1208
5509a5d2
DH
1209 "drop_pagecache",
1210 "drop_slab",
8e675f7a 1211 "oom_kill",
5509a5d2 1212
03c5a6e1
MG
1213#ifdef CONFIG_NUMA_BALANCING
1214 "numa_pte_updates",
72403b4a 1215 "numa_huge_pte_updates",
03c5a6e1
MG
1216 "numa_hint_faults",
1217 "numa_hint_faults_local",
1218 "numa_pages_migrated",
1219#endif
5647bc29
MG
1220#ifdef CONFIG_MIGRATION
1221 "pgmigrate_success",
1222 "pgmigrate_fail",
1223#endif
fa25c503 1224#ifdef CONFIG_COMPACTION
397487db
MG
1225 "compact_migrate_scanned",
1226 "compact_free_scanned",
1227 "compact_isolated",
fa25c503
KM
1228 "compact_stall",
1229 "compact_fail",
1230 "compact_success",
698b1b30 1231 "compact_daemon_wake",
7f354a54
DR
1232 "compact_daemon_migrate_scanned",
1233 "compact_daemon_free_scanned",
fa25c503
KM
1234#endif
1235
1236#ifdef CONFIG_HUGETLB_PAGE
1237 "htlb_buddy_alloc_success",
1238 "htlb_buddy_alloc_fail",
1239#endif
1240 "unevictable_pgs_culled",
1241 "unevictable_pgs_scanned",
1242 "unevictable_pgs_rescued",
1243 "unevictable_pgs_mlocked",
1244 "unevictable_pgs_munlocked",
1245 "unevictable_pgs_cleared",
1246 "unevictable_pgs_stranded",
fa25c503
KM
1247
1248#ifdef CONFIG_TRANSPARENT_HUGEPAGE
1249 "thp_fault_alloc",
1250 "thp_fault_fallback",
1251 "thp_collapse_alloc",
1252 "thp_collapse_alloc_failed",
95ecedcd
KS
1253 "thp_file_alloc",
1254 "thp_file_mapped",
122afea9
KS
1255 "thp_split_page",
1256 "thp_split_page_failed",
f9719a03 1257 "thp_deferred_split_page",
122afea9 1258 "thp_split_pmd",
ce9311cf
YX
1259#ifdef CONFIG_HAVE_ARCH_TRANSPARENT_HUGEPAGE_PUD
1260 "thp_split_pud",
1261#endif
d8a8e1f0
KS
1262 "thp_zero_page_alloc",
1263 "thp_zero_page_alloc_failed",
225311a4 1264 "thp_swpout",
fe490cc0 1265 "thp_swpout_fallback",
fa25c503 1266#endif
09316c09
KK
1267#ifdef CONFIG_MEMORY_BALLOON
1268 "balloon_inflate",
1269 "balloon_deflate",
1270#ifdef CONFIG_BALLOON_COMPACTION
1271 "balloon_migrate",
1272#endif
1273#endif /* CONFIG_MEMORY_BALLOON */
ec659934 1274#ifdef CONFIG_DEBUG_TLBFLUSH
6df46865 1275#ifdef CONFIG_SMP
9824cf97
DH
1276 "nr_tlb_remote_flush",
1277 "nr_tlb_remote_flush_received",
ec659934 1278#endif /* CONFIG_SMP */
9824cf97
DH
1279 "nr_tlb_local_flush_all",
1280 "nr_tlb_local_flush_one",
ec659934 1281#endif /* CONFIG_DEBUG_TLBFLUSH */
fa25c503 1282
4f115147
DB
1283#ifdef CONFIG_DEBUG_VM_VMACACHE
1284 "vmacache_find_calls",
1285 "vmacache_find_hits",
f5f302e2 1286 "vmacache_full_flushes",
4f115147 1287#endif
cbc65df2
HY
1288#ifdef CONFIG_SWAP
1289 "swap_ra",
1290 "swap_ra_hit",
1291#endif
fa25c503
KM
1292#endif /* CONFIG_VM_EVENTS_COUNTERS */
1293};
0d6617c7 1294#endif /* CONFIG_PROC_FS || CONFIG_SYSFS || CONFIG_NUMA */
fa25c503 1295
3c486871
AM
1296#if (defined(CONFIG_DEBUG_FS) && defined(CONFIG_COMPACTION)) || \
1297 defined(CONFIG_PROC_FS)
1298static void *frag_start(struct seq_file *m, loff_t *pos)
1299{
1300 pg_data_t *pgdat;
1301 loff_t node = *pos;
1302
1303 for (pgdat = first_online_pgdat();
1304 pgdat && node;
1305 pgdat = next_online_pgdat(pgdat))
1306 --node;
1307
1308 return pgdat;
1309}
1310
1311static void *frag_next(struct seq_file *m, void *arg, loff_t *pos)
1312{
1313 pg_data_t *pgdat = (pg_data_t *)arg;
1314
1315 (*pos)++;
1316 return next_online_pgdat(pgdat);
1317}
1318
1319static void frag_stop(struct seq_file *m, void *arg)
1320{
1321}
1322
b2bd8598
DR
1323/*
1324 * Walk zones in a node and print using a callback.
1325 * If @assert_populated is true, only use callback for zones that are populated.
1326 */
3c486871 1327static void walk_zones_in_node(struct seq_file *m, pg_data_t *pgdat,
727c080f 1328 bool assert_populated, bool nolock,
3c486871
AM
1329 void (*print)(struct seq_file *m, pg_data_t *, struct zone *))
1330{
1331 struct zone *zone;
1332 struct zone *node_zones = pgdat->node_zones;
1333 unsigned long flags;
1334
1335 for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) {
b2bd8598 1336 if (assert_populated && !populated_zone(zone))
3c486871
AM
1337 continue;
1338
727c080f
VM
1339 if (!nolock)
1340 spin_lock_irqsave(&zone->lock, flags);
3c486871 1341 print(m, pgdat, zone);
727c080f
VM
1342 if (!nolock)
1343 spin_unlock_irqrestore(&zone->lock, flags);
3c486871
AM
1344 }
1345}
1346#endif
1347
d7a5752c 1348#ifdef CONFIG_PROC_FS
467c996c
MG
1349static void frag_show_print(struct seq_file *m, pg_data_t *pgdat,
1350 struct zone *zone)
1351{
1352 int order;
1353
1354 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
1355 for (order = 0; order < MAX_ORDER; ++order)
1356 seq_printf(m, "%6lu ", zone->free_area[order].nr_free);
1357 seq_putc(m, '\n');
1358}
1359
1360/*
1361 * This walks the free areas for each zone.
1362 */
1363static int frag_show(struct seq_file *m, void *arg)
1364{
1365 pg_data_t *pgdat = (pg_data_t *)arg;
727c080f 1366 walk_zones_in_node(m, pgdat, true, false, frag_show_print);
467c996c
MG
1367 return 0;
1368}
1369
1370static void pagetypeinfo_showfree_print(struct seq_file *m,
1371 pg_data_t *pgdat, struct zone *zone)
1372{
1373 int order, mtype;
1374
1375 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++) {
1376 seq_printf(m, "Node %4d, zone %8s, type %12s ",
1377 pgdat->node_id,
1378 zone->name,
1379 migratetype_names[mtype]);
1380 for (order = 0; order < MAX_ORDER; ++order) {
1381 unsigned long freecount = 0;
1382 struct free_area *area;
1383 struct list_head *curr;
1384
1385 area = &(zone->free_area[order]);
1386
1387 list_for_each(curr, &area->free_list[mtype])
1388 freecount++;
1389 seq_printf(m, "%6lu ", freecount);
1390 }
f6ac2354
CL
1391 seq_putc(m, '\n');
1392 }
467c996c
MG
1393}
1394
1395/* Print out the free pages at each order for each migatetype */
1396static int pagetypeinfo_showfree(struct seq_file *m, void *arg)
1397{
1398 int order;
1399 pg_data_t *pgdat = (pg_data_t *)arg;
1400
1401 /* Print header */
1402 seq_printf(m, "%-43s ", "Free pages count per migrate type at order");
1403 for (order = 0; order < MAX_ORDER; ++order)
1404 seq_printf(m, "%6d ", order);
1405 seq_putc(m, '\n');
1406
727c080f 1407 walk_zones_in_node(m, pgdat, true, false, pagetypeinfo_showfree_print);
467c996c
MG
1408
1409 return 0;
1410}
1411
1412static void pagetypeinfo_showblockcount_print(struct seq_file *m,
1413 pg_data_t *pgdat, struct zone *zone)
1414{
1415 int mtype;
1416 unsigned long pfn;
1417 unsigned long start_pfn = zone->zone_start_pfn;
108bcc96 1418 unsigned long end_pfn = zone_end_pfn(zone);
467c996c
MG
1419 unsigned long count[MIGRATE_TYPES] = { 0, };
1420
1421 for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
1422 struct page *page;
1423
d336e94e
MH
1424 page = pfn_to_online_page(pfn);
1425 if (!page)
467c996c
MG
1426 continue;
1427
eb33575c
MG
1428 /* Watch for unexpected holes punched in the memmap */
1429 if (!memmap_valid_within(pfn, page, zone))
e80d6a24 1430 continue;
eb33575c 1431
a91c43c7
JK
1432 if (page_zone(page) != zone)
1433 continue;
1434
467c996c
MG
1435 mtype = get_pageblock_migratetype(page);
1436
e80d6a24
MG
1437 if (mtype < MIGRATE_TYPES)
1438 count[mtype]++;
467c996c
MG
1439 }
1440
1441 /* Print counts */
1442 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
1443 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1444 seq_printf(m, "%12lu ", count[mtype]);
1445 seq_putc(m, '\n');
1446}
1447
f113e641 1448/* Print out the number of pageblocks for each migratetype */
467c996c
MG
1449static int pagetypeinfo_showblockcount(struct seq_file *m, void *arg)
1450{
1451 int mtype;
1452 pg_data_t *pgdat = (pg_data_t *)arg;
1453
1454 seq_printf(m, "\n%-23s", "Number of blocks type ");
1455 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1456 seq_printf(m, "%12s ", migratetype_names[mtype]);
1457 seq_putc(m, '\n');
727c080f
VM
1458 walk_zones_in_node(m, pgdat, true, false,
1459 pagetypeinfo_showblockcount_print);
467c996c
MG
1460
1461 return 0;
1462}
1463
48c96a36
JK
1464/*
1465 * Print out the number of pageblocks for each migratetype that contain pages
1466 * of other types. This gives an indication of how well fallbacks are being
1467 * contained by rmqueue_fallback(). It requires information from PAGE_OWNER
1468 * to determine what is going on
1469 */
1470static void pagetypeinfo_showmixedcount(struct seq_file *m, pg_data_t *pgdat)
1471{
1472#ifdef CONFIG_PAGE_OWNER
1473 int mtype;
1474
7dd80b8a 1475 if (!static_branch_unlikely(&page_owner_inited))
48c96a36
JK
1476 return;
1477
1478 drain_all_pages(NULL);
1479
1480 seq_printf(m, "\n%-23s", "Number of mixed blocks ");
1481 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1482 seq_printf(m, "%12s ", migratetype_names[mtype]);
1483 seq_putc(m, '\n');
1484
727c080f
VM
1485 walk_zones_in_node(m, pgdat, true, true,
1486 pagetypeinfo_showmixedcount_print);
48c96a36
JK
1487#endif /* CONFIG_PAGE_OWNER */
1488}
1489
467c996c
MG
1490/*
1491 * This prints out statistics in relation to grouping pages by mobility.
1492 * It is expensive to collect so do not constantly read the file.
1493 */
1494static int pagetypeinfo_show(struct seq_file *m, void *arg)
1495{
1496 pg_data_t *pgdat = (pg_data_t *)arg;
1497
41b25a37 1498 /* check memoryless node */
a47b53c5 1499 if (!node_state(pgdat->node_id, N_MEMORY))
41b25a37
KM
1500 return 0;
1501
467c996c
MG
1502 seq_printf(m, "Page block order: %d\n", pageblock_order);
1503 seq_printf(m, "Pages per block: %lu\n", pageblock_nr_pages);
1504 seq_putc(m, '\n');
1505 pagetypeinfo_showfree(m, pgdat);
1506 pagetypeinfo_showblockcount(m, pgdat);
48c96a36 1507 pagetypeinfo_showmixedcount(m, pgdat);
467c996c 1508
f6ac2354
CL
1509 return 0;
1510}
1511
8f32f7e5 1512static const struct seq_operations fragmentation_op = {
f6ac2354
CL
1513 .start = frag_start,
1514 .next = frag_next,
1515 .stop = frag_stop,
1516 .show = frag_show,
1517};
1518
74e2e8e8 1519static const struct seq_operations pagetypeinfo_op = {
467c996c
MG
1520 .start = frag_start,
1521 .next = frag_next,
1522 .stop = frag_stop,
1523 .show = pagetypeinfo_show,
1524};
1525
e2ecc8a7
MG
1526static bool is_zone_first_populated(pg_data_t *pgdat, struct zone *zone)
1527{
1528 int zid;
1529
1530 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1531 struct zone *compare = &pgdat->node_zones[zid];
1532
1533 if (populated_zone(compare))
1534 return zone == compare;
1535 }
1536
e2ecc8a7
MG
1537 return false;
1538}
1539
467c996c
MG
1540static void zoneinfo_show_print(struct seq_file *m, pg_data_t *pgdat,
1541 struct zone *zone)
f6ac2354 1542{
467c996c
MG
1543 int i;
1544 seq_printf(m, "Node %d, zone %8s", pgdat->node_id, zone->name);
e2ecc8a7
MG
1545 if (is_zone_first_populated(pgdat, zone)) {
1546 seq_printf(m, "\n per-node stats");
1547 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++) {
1548 seq_printf(m, "\n %-12s %lu",
3a321d2a
KW
1549 vmstat_text[i + NR_VM_ZONE_STAT_ITEMS +
1550 NR_VM_NUMA_STAT_ITEMS],
e2ecc8a7
MG
1551 node_page_state(pgdat, i));
1552 }
1553 }
467c996c
MG
1554 seq_printf(m,
1555 "\n pages free %lu"
1556 "\n min %lu"
1557 "\n low %lu"
1558 "\n high %lu"
467c996c 1559 "\n spanned %lu"
9feedc9d
JL
1560 "\n present %lu"
1561 "\n managed %lu",
88f5acf8 1562 zone_page_state(zone, NR_FREE_PAGES),
41858966
MG
1563 min_wmark_pages(zone),
1564 low_wmark_pages(zone),
1565 high_wmark_pages(zone),
467c996c 1566 zone->spanned_pages,
9feedc9d
JL
1567 zone->present_pages,
1568 zone->managed_pages);
467c996c 1569
467c996c 1570 seq_printf(m,
3484b2de 1571 "\n protection: (%ld",
467c996c
MG
1572 zone->lowmem_reserve[0]);
1573 for (i = 1; i < ARRAY_SIZE(zone->lowmem_reserve); i++)
3484b2de 1574 seq_printf(m, ", %ld", zone->lowmem_reserve[i]);
7dfb8bf3
DR
1575 seq_putc(m, ')');
1576
1577 /* If unpopulated, no other information is useful */
1578 if (!populated_zone(zone)) {
1579 seq_putc(m, '\n');
1580 return;
1581 }
1582
1583 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
1584 seq_printf(m, "\n %-12s %lu", vmstat_text[i],
1585 zone_page_state(zone, i));
1586
3a321d2a
KW
1587#ifdef CONFIG_NUMA
1588 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++)
1589 seq_printf(m, "\n %-12s %lu",
1590 vmstat_text[i + NR_VM_ZONE_STAT_ITEMS],
63803222 1591 zone_numa_state_snapshot(zone, i));
3a321d2a
KW
1592#endif
1593
7dfb8bf3 1594 seq_printf(m, "\n pagesets");
467c996c
MG
1595 for_each_online_cpu(i) {
1596 struct per_cpu_pageset *pageset;
467c996c 1597
99dcc3e5 1598 pageset = per_cpu_ptr(zone->pageset, i);
3dfa5721
CL
1599 seq_printf(m,
1600 "\n cpu: %i"
1601 "\n count: %i"
1602 "\n high: %i"
1603 "\n batch: %i",
1604 i,
1605 pageset->pcp.count,
1606 pageset->pcp.high,
1607 pageset->pcp.batch);
df9ecaba 1608#ifdef CONFIG_SMP
467c996c
MG
1609 seq_printf(m, "\n vm stats threshold: %d",
1610 pageset->stat_threshold);
df9ecaba 1611#endif
f6ac2354 1612 }
467c996c 1613 seq_printf(m,
599d0c95 1614 "\n node_unreclaimable: %u"
3a50d14d 1615 "\n start_pfn: %lu",
c73322d0 1616 pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES,
3a50d14d 1617 zone->zone_start_pfn);
467c996c
MG
1618 seq_putc(m, '\n');
1619}
1620
1621/*
b2bd8598
DR
1622 * Output information about zones in @pgdat. All zones are printed regardless
1623 * of whether they are populated or not: lowmem_reserve_ratio operates on the
1624 * set of all zones and userspace would not be aware of such zones if they are
1625 * suppressed here (zoneinfo displays the effect of lowmem_reserve_ratio).
467c996c
MG
1626 */
1627static int zoneinfo_show(struct seq_file *m, void *arg)
1628{
1629 pg_data_t *pgdat = (pg_data_t *)arg;
727c080f 1630 walk_zones_in_node(m, pgdat, false, false, zoneinfo_show_print);
f6ac2354
CL
1631 return 0;
1632}
1633
5c9fe628 1634static const struct seq_operations zoneinfo_op = {
f6ac2354
CL
1635 .start = frag_start, /* iterate over all zones. The same as in
1636 * fragmentation. */
1637 .next = frag_next,
1638 .stop = frag_stop,
1639 .show = zoneinfo_show,
1640};
1641
79da826a
MR
1642enum writeback_stat_item {
1643 NR_DIRTY_THRESHOLD,
1644 NR_DIRTY_BG_THRESHOLD,
1645 NR_VM_WRITEBACK_STAT_ITEMS,
1646};
1647
f6ac2354
CL
1648static void *vmstat_start(struct seq_file *m, loff_t *pos)
1649{
2244b95a 1650 unsigned long *v;
79da826a 1651 int i, stat_items_size;
f6ac2354
CL
1652
1653 if (*pos >= ARRAY_SIZE(vmstat_text))
1654 return NULL;
79da826a 1655 stat_items_size = NR_VM_ZONE_STAT_ITEMS * sizeof(unsigned long) +
3a321d2a 1656 NR_VM_NUMA_STAT_ITEMS * sizeof(unsigned long) +
75ef7184 1657 NR_VM_NODE_STAT_ITEMS * sizeof(unsigned long) +
79da826a 1658 NR_VM_WRITEBACK_STAT_ITEMS * sizeof(unsigned long);
f6ac2354 1659
f8891e5e 1660#ifdef CONFIG_VM_EVENT_COUNTERS
79da826a 1661 stat_items_size += sizeof(struct vm_event_state);
f8891e5e 1662#endif
79da826a
MR
1663
1664 v = kmalloc(stat_items_size, GFP_KERNEL);
2244b95a
CL
1665 m->private = v;
1666 if (!v)
f6ac2354 1667 return ERR_PTR(-ENOMEM);
2244b95a 1668 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
c41f012a 1669 v[i] = global_zone_page_state(i);
79da826a
MR
1670 v += NR_VM_ZONE_STAT_ITEMS;
1671
3a321d2a
KW
1672#ifdef CONFIG_NUMA
1673 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++)
1674 v[i] = global_numa_state(i);
1675 v += NR_VM_NUMA_STAT_ITEMS;
1676#endif
1677
75ef7184
MG
1678 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++)
1679 v[i] = global_node_page_state(i);
1680 v += NR_VM_NODE_STAT_ITEMS;
1681
79da826a
MR
1682 global_dirty_limits(v + NR_DIRTY_BG_THRESHOLD,
1683 v + NR_DIRTY_THRESHOLD);
1684 v += NR_VM_WRITEBACK_STAT_ITEMS;
1685
f8891e5e 1686#ifdef CONFIG_VM_EVENT_COUNTERS
79da826a
MR
1687 all_vm_events(v);
1688 v[PGPGIN] /= 2; /* sectors -> kbytes */
1689 v[PGPGOUT] /= 2;
f8891e5e 1690#endif
ff8b16d7 1691 return (unsigned long *)m->private + *pos;
f6ac2354
CL
1692}
1693
1694static void *vmstat_next(struct seq_file *m, void *arg, loff_t *pos)
1695{
1696 (*pos)++;
1697 if (*pos >= ARRAY_SIZE(vmstat_text))
1698 return NULL;
1699 return (unsigned long *)m->private + *pos;
1700}
1701
1702static int vmstat_show(struct seq_file *m, void *arg)
1703{
1704 unsigned long *l = arg;
1705 unsigned long off = l - (unsigned long *)m->private;
68ba0326 1706
7aaf7727
RG
1707 /* Skip hidden vmstat items. */
1708 if (*vmstat_text[off] == '\0')
1709 return 0;
1710
68ba0326 1711 seq_puts(m, vmstat_text[off]);
75ba1d07 1712 seq_put_decimal_ull(m, " ", *l);
68ba0326 1713 seq_putc(m, '\n');
f6ac2354
CL
1714 return 0;
1715}
1716
1717static void vmstat_stop(struct seq_file *m, void *arg)
1718{
1719 kfree(m->private);
1720 m->private = NULL;
1721}
1722
b6aa44ab 1723static const struct seq_operations vmstat_op = {
f6ac2354
CL
1724 .start = vmstat_start,
1725 .next = vmstat_next,
1726 .stop = vmstat_stop,
1727 .show = vmstat_show,
1728};
f6ac2354
CL
1729#endif /* CONFIG_PROC_FS */
1730
df9ecaba 1731#ifdef CONFIG_SMP
d1187ed2 1732static DEFINE_PER_CPU(struct delayed_work, vmstat_work);
77461ab3 1733int sysctl_stat_interval __read_mostly = HZ;
d1187ed2 1734
52b6f46b
HD
1735#ifdef CONFIG_PROC_FS
1736static void refresh_vm_stats(struct work_struct *work)
1737{
1738 refresh_cpu_vm_stats(true);
1739}
1740
1741int vmstat_refresh(struct ctl_table *table, int write,
1742 void __user *buffer, size_t *lenp, loff_t *ppos)
1743{
1744 long val;
1745 int err;
1746 int i;
1747
1748 /*
1749 * The regular update, every sysctl_stat_interval, may come later
1750 * than expected: leaving a significant amount in per_cpu buckets.
1751 * This is particularly misleading when checking a quantity of HUGE
1752 * pages, immediately after running a test. /proc/sys/vm/stat_refresh,
1753 * which can equally be echo'ed to or cat'ted from (by root),
1754 * can be used to update the stats just before reading them.
1755 *
c41f012a 1756 * Oh, and since global_zone_page_state() etc. are so careful to hide
52b6f46b
HD
1757 * transiently negative values, report an error here if any of
1758 * the stats is negative, so we know to go looking for imbalance.
1759 */
1760 err = schedule_on_each_cpu(refresh_vm_stats);
1761 if (err)
1762 return err;
1763 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++) {
75ef7184 1764 val = atomic_long_read(&vm_zone_stat[i]);
52b6f46b 1765 if (val < 0) {
c822f622
JW
1766 pr_warn("%s: %s %ld\n",
1767 __func__, vmstat_text[i], val);
1768 err = -EINVAL;
52b6f46b
HD
1769 }
1770 }
3a321d2a
KW
1771#ifdef CONFIG_NUMA
1772 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++) {
1773 val = atomic_long_read(&vm_numa_stat[i]);
1774 if (val < 0) {
1775 pr_warn("%s: %s %ld\n",
1776 __func__, vmstat_text[i + NR_VM_ZONE_STAT_ITEMS], val);
1777 err = -EINVAL;
1778 }
1779 }
1780#endif
52b6f46b
HD
1781 if (err)
1782 return err;
1783 if (write)
1784 *ppos += *lenp;
1785 else
1786 *lenp = 0;
1787 return 0;
1788}
1789#endif /* CONFIG_PROC_FS */
1790
d1187ed2
CL
1791static void vmstat_update(struct work_struct *w)
1792{
0eb77e98 1793 if (refresh_cpu_vm_stats(true)) {
7cc36bbd
CL
1794 /*
1795 * Counters were updated so we expect more updates
1796 * to occur in the future. Keep on running the
1797 * update worker thread.
1798 */
ce612879 1799 queue_delayed_work_on(smp_processor_id(), mm_percpu_wq,
f01f17d3
MH
1800 this_cpu_ptr(&vmstat_work),
1801 round_jiffies_relative(sysctl_stat_interval));
7cc36bbd
CL
1802 }
1803}
1804
0eb77e98
CL
1805/*
1806 * Switch off vmstat processing and then fold all the remaining differentials
1807 * until the diffs stay at zero. The function is used by NOHZ and can only be
1808 * invoked when tick processing is not active.
1809 */
7cc36bbd
CL
1810/*
1811 * Check if the diffs for a certain cpu indicate that
1812 * an update is needed.
1813 */
1814static bool need_update(int cpu)
1815{
1816 struct zone *zone;
1817
1818 for_each_populated_zone(zone) {
1819 struct per_cpu_pageset *p = per_cpu_ptr(zone->pageset, cpu);
1820
1821 BUILD_BUG_ON(sizeof(p->vm_stat_diff[0]) != 1);
3a321d2a 1822#ifdef CONFIG_NUMA
1d90ca89 1823 BUILD_BUG_ON(sizeof(p->vm_numa_stat_diff[0]) != 2);
3a321d2a 1824#endif
63803222 1825
7cc36bbd
CL
1826 /*
1827 * The fast way of checking if there are any vmstat diffs.
1828 * This works because the diffs are byte sized items.
1829 */
1830 if (memchr_inv(p->vm_stat_diff, 0, NR_VM_ZONE_STAT_ITEMS))
1831 return true;
3a321d2a
KW
1832#ifdef CONFIG_NUMA
1833 if (memchr_inv(p->vm_numa_stat_diff, 0, NR_VM_NUMA_STAT_ITEMS))
1834 return true;
1835#endif
7cc36bbd
CL
1836 }
1837 return false;
1838}
1839
7b8da4c7
CL
1840/*
1841 * Switch off vmstat processing and then fold all the remaining differentials
1842 * until the diffs stay at zero. The function is used by NOHZ and can only be
1843 * invoked when tick processing is not active.
1844 */
f01f17d3
MH
1845void quiet_vmstat(void)
1846{
1847 if (system_state != SYSTEM_RUNNING)
1848 return;
1849
7b8da4c7 1850 if (!delayed_work_pending(this_cpu_ptr(&vmstat_work)))
f01f17d3
MH
1851 return;
1852
1853 if (!need_update(smp_processor_id()))
1854 return;
1855
1856 /*
1857 * Just refresh counters and do not care about the pending delayed
1858 * vmstat_update. It doesn't fire that often to matter and canceling
1859 * it would be too expensive from this path.
1860 * vmstat_shepherd will take care about that for us.
1861 */
1862 refresh_cpu_vm_stats(false);
1863}
1864
7cc36bbd
CL
1865/*
1866 * Shepherd worker thread that checks the
1867 * differentials of processors that have their worker
1868 * threads for vm statistics updates disabled because of
1869 * inactivity.
1870 */
1871static void vmstat_shepherd(struct work_struct *w);
1872
0eb77e98 1873static DECLARE_DEFERRABLE_WORK(shepherd, vmstat_shepherd);
7cc36bbd
CL
1874
1875static void vmstat_shepherd(struct work_struct *w)
1876{
1877 int cpu;
1878
1879 get_online_cpus();
1880 /* Check processors whose vmstat worker threads have been disabled */
7b8da4c7 1881 for_each_online_cpu(cpu) {
f01f17d3 1882 struct delayed_work *dw = &per_cpu(vmstat_work, cpu);
7cc36bbd 1883
7b8da4c7 1884 if (!delayed_work_pending(dw) && need_update(cpu))
ce612879 1885 queue_delayed_work_on(cpu, mm_percpu_wq, dw, 0);
f01f17d3 1886 }
7cc36bbd
CL
1887 put_online_cpus();
1888
1889 schedule_delayed_work(&shepherd,
98f4ebb2 1890 round_jiffies_relative(sysctl_stat_interval));
d1187ed2
CL
1891}
1892
7cc36bbd 1893static void __init start_shepherd_timer(void)
d1187ed2 1894{
7cc36bbd
CL
1895 int cpu;
1896
1897 for_each_possible_cpu(cpu)
ccde8bd4 1898 INIT_DEFERRABLE_WORK(per_cpu_ptr(&vmstat_work, cpu),
7cc36bbd
CL
1899 vmstat_update);
1900
7cc36bbd
CL
1901 schedule_delayed_work(&shepherd,
1902 round_jiffies_relative(sysctl_stat_interval));
d1187ed2
CL
1903}
1904
03e86dba
TC
1905static void __init init_cpu_node_state(void)
1906{
4c501327 1907 int node;
03e86dba 1908
4c501327
SAS
1909 for_each_online_node(node) {
1910 if (cpumask_weight(cpumask_of_node(node)) > 0)
1911 node_set_state(node, N_CPU);
1912 }
03e86dba
TC
1913}
1914
5438da97
SAS
1915static int vmstat_cpu_online(unsigned int cpu)
1916{
1917 refresh_zone_stat_thresholds();
1918 node_set_state(cpu_to_node(cpu), N_CPU);
1919 return 0;
1920}
1921
1922static int vmstat_cpu_down_prep(unsigned int cpu)
1923{
1924 cancel_delayed_work_sync(&per_cpu(vmstat_work, cpu));
1925 return 0;
1926}
1927
1928static int vmstat_cpu_dead(unsigned int cpu)
807a1bd2 1929{
4c501327 1930 const struct cpumask *node_cpus;
5438da97 1931 int node;
807a1bd2 1932
5438da97
SAS
1933 node = cpu_to_node(cpu);
1934
1935 refresh_zone_stat_thresholds();
4c501327
SAS
1936 node_cpus = cpumask_of_node(node);
1937 if (cpumask_weight(node_cpus) > 0)
5438da97 1938 return 0;
807a1bd2
TK
1939
1940 node_clear_state(node, N_CPU);
5438da97 1941 return 0;
807a1bd2
TK
1942}
1943
8f32f7e5 1944#endif
df9ecaba 1945
ce612879
MH
1946struct workqueue_struct *mm_percpu_wq;
1947
597b7305 1948void __init init_mm_internals(void)
df9ecaba 1949{
ce612879 1950 int ret __maybe_unused;
5438da97 1951
80d136e1 1952 mm_percpu_wq = alloc_workqueue("mm_percpu_wq", WQ_MEM_RECLAIM, 0);
ce612879
MH
1953
1954#ifdef CONFIG_SMP
5438da97
SAS
1955 ret = cpuhp_setup_state_nocalls(CPUHP_MM_VMSTAT_DEAD, "mm/vmstat:dead",
1956 NULL, vmstat_cpu_dead);
1957 if (ret < 0)
1958 pr_err("vmstat: failed to register 'dead' hotplug state\n");
1959
1960 ret = cpuhp_setup_state_nocalls(CPUHP_AP_ONLINE_DYN, "mm/vmstat:online",
1961 vmstat_cpu_online,
1962 vmstat_cpu_down_prep);
1963 if (ret < 0)
1964 pr_err("vmstat: failed to register 'online' hotplug state\n");
1965
1966 get_online_cpus();
03e86dba 1967 init_cpu_node_state();
5438da97 1968 put_online_cpus();
d1187ed2 1969
7cc36bbd 1970 start_shepherd_timer();
8f32f7e5
AD
1971#endif
1972#ifdef CONFIG_PROC_FS
fddda2b7
CH
1973 proc_create_seq("buddyinfo", 0444, NULL, &fragmentation_op);
1974 proc_create_seq("pagetypeinfo", 0444, NULL, &pagetypeinfo_op);
1975 proc_create_seq("vmstat", 0444, NULL, &vmstat_op);
1976 proc_create_seq("zoneinfo", 0444, NULL, &zoneinfo_op);
8f32f7e5 1977#endif
df9ecaba 1978}
d7a5752c
MG
1979
1980#if defined(CONFIG_DEBUG_FS) && defined(CONFIG_COMPACTION)
d7a5752c
MG
1981
1982/*
1983 * Return an index indicating how much of the available free memory is
1984 * unusable for an allocation of the requested size.
1985 */
1986static int unusable_free_index(unsigned int order,
1987 struct contig_page_info *info)
1988{
1989 /* No free memory is interpreted as all free memory is unusable */
1990 if (info->free_pages == 0)
1991 return 1000;
1992
1993 /*
1994 * Index should be a value between 0 and 1. Return a value to 3
1995 * decimal places.
1996 *
1997 * 0 => no fragmentation
1998 * 1 => high fragmentation
1999 */
2000 return div_u64((info->free_pages - (info->free_blocks_suitable << order)) * 1000ULL, info->free_pages);
2001
2002}
2003
2004static void unusable_show_print(struct seq_file *m,
2005 pg_data_t *pgdat, struct zone *zone)
2006{
2007 unsigned int order;
2008 int index;
2009 struct contig_page_info info;
2010
2011 seq_printf(m, "Node %d, zone %8s ",
2012 pgdat->node_id,
2013 zone->name);
2014 for (order = 0; order < MAX_ORDER; ++order) {
2015 fill_contig_page_info(zone, order, &info);
2016 index = unusable_free_index(order, &info);
2017 seq_printf(m, "%d.%03d ", index / 1000, index % 1000);
2018 }
2019
2020 seq_putc(m, '\n');
2021}
2022
2023/*
2024 * Display unusable free space index
2025 *
2026 * The unusable free space index measures how much of the available free
2027 * memory cannot be used to satisfy an allocation of a given size and is a
2028 * value between 0 and 1. The higher the value, the more of free memory is
2029 * unusable and by implication, the worse the external fragmentation is. This
2030 * can be expressed as a percentage by multiplying by 100.
2031 */
2032static int unusable_show(struct seq_file *m, void *arg)
2033{
2034 pg_data_t *pgdat = (pg_data_t *)arg;
2035
2036 /* check memoryless node */
a47b53c5 2037 if (!node_state(pgdat->node_id, N_MEMORY))
d7a5752c
MG
2038 return 0;
2039
727c080f 2040 walk_zones_in_node(m, pgdat, true, false, unusable_show_print);
d7a5752c
MG
2041
2042 return 0;
2043}
2044
2045static const struct seq_operations unusable_op = {
2046 .start = frag_start,
2047 .next = frag_next,
2048 .stop = frag_stop,
2049 .show = unusable_show,
2050};
2051
2052static int unusable_open(struct inode *inode, struct file *file)
2053{
2054 return seq_open(file, &unusable_op);
2055}
2056
2057static const struct file_operations unusable_file_ops = {
2058 .open = unusable_open,
2059 .read = seq_read,
2060 .llseek = seq_lseek,
2061 .release = seq_release,
2062};
2063
f1a5ab12
MG
2064static void extfrag_show_print(struct seq_file *m,
2065 pg_data_t *pgdat, struct zone *zone)
2066{
2067 unsigned int order;
2068 int index;
2069
2070 /* Alloc on stack as interrupts are disabled for zone walk */
2071 struct contig_page_info info;
2072
2073 seq_printf(m, "Node %d, zone %8s ",
2074 pgdat->node_id,
2075 zone->name);
2076 for (order = 0; order < MAX_ORDER; ++order) {
2077 fill_contig_page_info(zone, order, &info);
56de7263 2078 index = __fragmentation_index(order, &info);
f1a5ab12
MG
2079 seq_printf(m, "%d.%03d ", index / 1000, index % 1000);
2080 }
2081
2082 seq_putc(m, '\n');
2083}
2084
2085/*
2086 * Display fragmentation index for orders that allocations would fail for
2087 */
2088static int extfrag_show(struct seq_file *m, void *arg)
2089{
2090 pg_data_t *pgdat = (pg_data_t *)arg;
2091
727c080f 2092 walk_zones_in_node(m, pgdat, true, false, extfrag_show_print);
f1a5ab12
MG
2093
2094 return 0;
2095}
2096
2097static const struct seq_operations extfrag_op = {
2098 .start = frag_start,
2099 .next = frag_next,
2100 .stop = frag_stop,
2101 .show = extfrag_show,
2102};
2103
2104static int extfrag_open(struct inode *inode, struct file *file)
2105{
2106 return seq_open(file, &extfrag_op);
2107}
2108
2109static const struct file_operations extfrag_file_ops = {
2110 .open = extfrag_open,
2111 .read = seq_read,
2112 .llseek = seq_lseek,
2113 .release = seq_release,
2114};
2115
d7a5752c
MG
2116static int __init extfrag_debug_init(void)
2117{
bde8bd8a
S
2118 struct dentry *extfrag_debug_root;
2119
d7a5752c
MG
2120 extfrag_debug_root = debugfs_create_dir("extfrag", NULL);
2121 if (!extfrag_debug_root)
2122 return -ENOMEM;
2123
2124 if (!debugfs_create_file("unusable_index", 0444,
2125 extfrag_debug_root, NULL, &unusable_file_ops))
bde8bd8a 2126 goto fail;
d7a5752c 2127
f1a5ab12
MG
2128 if (!debugfs_create_file("extfrag_index", 0444,
2129 extfrag_debug_root, NULL, &extfrag_file_ops))
bde8bd8a 2130 goto fail;
f1a5ab12 2131
d7a5752c 2132 return 0;
bde8bd8a
S
2133fail:
2134 debugfs_remove_recursive(extfrag_debug_root);
2135 return -ENOMEM;
d7a5752c
MG
2136}
2137
2138module_init(extfrag_debug_init);
2139#endif