]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - mm/vmstat.c
UBUNTU: Ubuntu-4.15.0-96.97
[mirror_ubuntu-bionic-kernel.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",
dd0d4348 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
9824cf97
DH
1275 "nr_tlb_remote_flush",
1276 "nr_tlb_remote_flush_received",
1277 "nr_tlb_local_flush_all",
1278 "nr_tlb_local_flush_one",
ec659934 1279#endif /* CONFIG_DEBUG_TLBFLUSH */
fa25c503 1280
4f115147
DB
1281#ifdef CONFIG_DEBUG_VM_VMACACHE
1282 "vmacache_find_calls",
1283 "vmacache_find_hits",
1284#endif
cbc65df2
HY
1285#ifdef CONFIG_SWAP
1286 "swap_ra",
1287 "swap_ra_hit",
1288#endif
fa25c503
KM
1289#endif /* CONFIG_VM_EVENTS_COUNTERS */
1290};
0d6617c7 1291#endif /* CONFIG_PROC_FS || CONFIG_SYSFS || CONFIG_NUMA */
fa25c503 1292
3c486871
AM
1293#if (defined(CONFIG_DEBUG_FS) && defined(CONFIG_COMPACTION)) || \
1294 defined(CONFIG_PROC_FS)
1295static void *frag_start(struct seq_file *m, loff_t *pos)
1296{
1297 pg_data_t *pgdat;
1298 loff_t node = *pos;
1299
1300 for (pgdat = first_online_pgdat();
1301 pgdat && node;
1302 pgdat = next_online_pgdat(pgdat))
1303 --node;
1304
1305 return pgdat;
1306}
1307
1308static void *frag_next(struct seq_file *m, void *arg, loff_t *pos)
1309{
1310 pg_data_t *pgdat = (pg_data_t *)arg;
1311
1312 (*pos)++;
1313 return next_online_pgdat(pgdat);
1314}
1315
1316static void frag_stop(struct seq_file *m, void *arg)
1317{
1318}
1319
b2bd8598
DR
1320/*
1321 * Walk zones in a node and print using a callback.
1322 * If @assert_populated is true, only use callback for zones that are populated.
1323 */
3c486871 1324static void walk_zones_in_node(struct seq_file *m, pg_data_t *pgdat,
727c080f 1325 bool assert_populated, bool nolock,
3c486871
AM
1326 void (*print)(struct seq_file *m, pg_data_t *, struct zone *))
1327{
1328 struct zone *zone;
1329 struct zone *node_zones = pgdat->node_zones;
1330 unsigned long flags;
1331
1332 for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) {
b2bd8598 1333 if (assert_populated && !populated_zone(zone))
3c486871
AM
1334 continue;
1335
727c080f
VM
1336 if (!nolock)
1337 spin_lock_irqsave(&zone->lock, flags);
3c486871 1338 print(m, pgdat, zone);
727c080f
VM
1339 if (!nolock)
1340 spin_unlock_irqrestore(&zone->lock, flags);
3c486871
AM
1341 }
1342}
1343#endif
1344
d7a5752c 1345#ifdef CONFIG_PROC_FS
467c996c
MG
1346static void frag_show_print(struct seq_file *m, pg_data_t *pgdat,
1347 struct zone *zone)
1348{
1349 int order;
1350
1351 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
1352 for (order = 0; order < MAX_ORDER; ++order)
1353 seq_printf(m, "%6lu ", zone->free_area[order].nr_free);
1354 seq_putc(m, '\n');
1355}
1356
1357/*
1358 * This walks the free areas for each zone.
1359 */
1360static int frag_show(struct seq_file *m, void *arg)
1361{
1362 pg_data_t *pgdat = (pg_data_t *)arg;
727c080f 1363 walk_zones_in_node(m, pgdat, true, false, frag_show_print);
467c996c
MG
1364 return 0;
1365}
1366
1367static void pagetypeinfo_showfree_print(struct seq_file *m,
1368 pg_data_t *pgdat, struct zone *zone)
1369{
1370 int order, mtype;
1371
1372 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++) {
1373 seq_printf(m, "Node %4d, zone %8s, type %12s ",
1374 pgdat->node_id,
1375 zone->name,
1376 migratetype_names[mtype]);
1377 for (order = 0; order < MAX_ORDER; ++order) {
1378 unsigned long freecount = 0;
1379 struct free_area *area;
1380 struct list_head *curr;
1381
1382 area = &(zone->free_area[order]);
1383
1384 list_for_each(curr, &area->free_list[mtype])
1385 freecount++;
1386 seq_printf(m, "%6lu ", freecount);
1387 }
f6ac2354
CL
1388 seq_putc(m, '\n');
1389 }
467c996c
MG
1390}
1391
1392/* Print out the free pages at each order for each migatetype */
1393static int pagetypeinfo_showfree(struct seq_file *m, void *arg)
1394{
1395 int order;
1396 pg_data_t *pgdat = (pg_data_t *)arg;
1397
1398 /* Print header */
1399 seq_printf(m, "%-43s ", "Free pages count per migrate type at order");
1400 for (order = 0; order < MAX_ORDER; ++order)
1401 seq_printf(m, "%6d ", order);
1402 seq_putc(m, '\n');
1403
727c080f 1404 walk_zones_in_node(m, pgdat, true, false, pagetypeinfo_showfree_print);
467c996c
MG
1405
1406 return 0;
1407}
1408
1409static void pagetypeinfo_showblockcount_print(struct seq_file *m,
1410 pg_data_t *pgdat, struct zone *zone)
1411{
1412 int mtype;
1413 unsigned long pfn;
1414 unsigned long start_pfn = zone->zone_start_pfn;
108bcc96 1415 unsigned long end_pfn = zone_end_pfn(zone);
467c996c
MG
1416 unsigned long count[MIGRATE_TYPES] = { 0, };
1417
1418 for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
1419 struct page *page;
1420
d336e94e
MH
1421 page = pfn_to_online_page(pfn);
1422 if (!page)
467c996c
MG
1423 continue;
1424
eb33575c
MG
1425 /* Watch for unexpected holes punched in the memmap */
1426 if (!memmap_valid_within(pfn, page, zone))
e80d6a24 1427 continue;
eb33575c 1428
a91c43c7
JK
1429 if (page_zone(page) != zone)
1430 continue;
1431
467c996c
MG
1432 mtype = get_pageblock_migratetype(page);
1433
e80d6a24
MG
1434 if (mtype < MIGRATE_TYPES)
1435 count[mtype]++;
467c996c
MG
1436 }
1437
1438 /* Print counts */
1439 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
1440 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1441 seq_printf(m, "%12lu ", count[mtype]);
1442 seq_putc(m, '\n');
1443}
1444
f113e641 1445/* Print out the number of pageblocks for each migratetype */
467c996c
MG
1446static int pagetypeinfo_showblockcount(struct seq_file *m, void *arg)
1447{
1448 int mtype;
1449 pg_data_t *pgdat = (pg_data_t *)arg;
1450
1451 seq_printf(m, "\n%-23s", "Number of blocks type ");
1452 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1453 seq_printf(m, "%12s ", migratetype_names[mtype]);
1454 seq_putc(m, '\n');
727c080f
VM
1455 walk_zones_in_node(m, pgdat, true, false,
1456 pagetypeinfo_showblockcount_print);
467c996c
MG
1457
1458 return 0;
1459}
1460
48c96a36
JK
1461/*
1462 * Print out the number of pageblocks for each migratetype that contain pages
1463 * of other types. This gives an indication of how well fallbacks are being
1464 * contained by rmqueue_fallback(). It requires information from PAGE_OWNER
1465 * to determine what is going on
1466 */
1467static void pagetypeinfo_showmixedcount(struct seq_file *m, pg_data_t *pgdat)
1468{
1469#ifdef CONFIG_PAGE_OWNER
1470 int mtype;
1471
7dd80b8a 1472 if (!static_branch_unlikely(&page_owner_inited))
48c96a36
JK
1473 return;
1474
1475 drain_all_pages(NULL);
1476
1477 seq_printf(m, "\n%-23s", "Number of mixed blocks ");
1478 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1479 seq_printf(m, "%12s ", migratetype_names[mtype]);
1480 seq_putc(m, '\n');
1481
727c080f
VM
1482 walk_zones_in_node(m, pgdat, true, true,
1483 pagetypeinfo_showmixedcount_print);
48c96a36
JK
1484#endif /* CONFIG_PAGE_OWNER */
1485}
1486
467c996c
MG
1487/*
1488 * This prints out statistics in relation to grouping pages by mobility.
1489 * It is expensive to collect so do not constantly read the file.
1490 */
1491static int pagetypeinfo_show(struct seq_file *m, void *arg)
1492{
1493 pg_data_t *pgdat = (pg_data_t *)arg;
1494
41b25a37 1495 /* check memoryless node */
a47b53c5 1496 if (!node_state(pgdat->node_id, N_MEMORY))
41b25a37
KM
1497 return 0;
1498
467c996c
MG
1499 seq_printf(m, "Page block order: %d\n", pageblock_order);
1500 seq_printf(m, "Pages per block: %lu\n", pageblock_nr_pages);
1501 seq_putc(m, '\n');
1502 pagetypeinfo_showfree(m, pgdat);
1503 pagetypeinfo_showblockcount(m, pgdat);
48c96a36 1504 pagetypeinfo_showmixedcount(m, pgdat);
467c996c 1505
f6ac2354
CL
1506 return 0;
1507}
1508
8f32f7e5 1509static const struct seq_operations fragmentation_op = {
f6ac2354
CL
1510 .start = frag_start,
1511 .next = frag_next,
1512 .stop = frag_stop,
1513 .show = frag_show,
1514};
1515
8f32f7e5
AD
1516static int fragmentation_open(struct inode *inode, struct file *file)
1517{
1518 return seq_open(file, &fragmentation_op);
1519}
1520
9d85e15f 1521static const struct file_operations buddyinfo_file_operations = {
8f32f7e5
AD
1522 .open = fragmentation_open,
1523 .read = seq_read,
1524 .llseek = seq_lseek,
1525 .release = seq_release,
1526};
1527
74e2e8e8 1528static const struct seq_operations pagetypeinfo_op = {
467c996c
MG
1529 .start = frag_start,
1530 .next = frag_next,
1531 .stop = frag_stop,
1532 .show = pagetypeinfo_show,
1533};
1534
74e2e8e8
AD
1535static int pagetypeinfo_open(struct inode *inode, struct file *file)
1536{
1537 return seq_open(file, &pagetypeinfo_op);
1538}
1539
9d85e15f 1540static const struct file_operations pagetypeinfo_file_operations = {
74e2e8e8
AD
1541 .open = pagetypeinfo_open,
1542 .read = seq_read,
1543 .llseek = seq_lseek,
1544 .release = seq_release,
1545};
1546
e2ecc8a7
MG
1547static bool is_zone_first_populated(pg_data_t *pgdat, struct zone *zone)
1548{
1549 int zid;
1550
1551 for (zid = 0; zid < MAX_NR_ZONES; zid++) {
1552 struct zone *compare = &pgdat->node_zones[zid];
1553
1554 if (populated_zone(compare))
1555 return zone == compare;
1556 }
1557
e2ecc8a7
MG
1558 return false;
1559}
1560
467c996c
MG
1561static void zoneinfo_show_print(struct seq_file *m, pg_data_t *pgdat,
1562 struct zone *zone)
f6ac2354 1563{
467c996c
MG
1564 int i;
1565 seq_printf(m, "Node %d, zone %8s", pgdat->node_id, zone->name);
e2ecc8a7
MG
1566 if (is_zone_first_populated(pgdat, zone)) {
1567 seq_printf(m, "\n per-node stats");
1568 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++) {
491bfb62
RG
1569 /* Skip hidden vmstat items. */
1570 if (*vmstat_text[i + NR_VM_ZONE_STAT_ITEMS +
1571 NR_VM_NUMA_STAT_ITEMS] == '\0')
1572 continue;
e2ecc8a7 1573 seq_printf(m, "\n %-12s %lu",
3a321d2a
KW
1574 vmstat_text[i + NR_VM_ZONE_STAT_ITEMS +
1575 NR_VM_NUMA_STAT_ITEMS],
e2ecc8a7
MG
1576 node_page_state(pgdat, i));
1577 }
1578 }
467c996c
MG
1579 seq_printf(m,
1580 "\n pages free %lu"
1581 "\n min %lu"
1582 "\n low %lu"
1583 "\n high %lu"
467c996c 1584 "\n spanned %lu"
9feedc9d
JL
1585 "\n present %lu"
1586 "\n managed %lu",
88f5acf8 1587 zone_page_state(zone, NR_FREE_PAGES),
41858966
MG
1588 min_wmark_pages(zone),
1589 low_wmark_pages(zone),
1590 high_wmark_pages(zone),
467c996c 1591 zone->spanned_pages,
9feedc9d
JL
1592 zone->present_pages,
1593 zone->managed_pages);
467c996c 1594
467c996c 1595 seq_printf(m,
3484b2de 1596 "\n protection: (%ld",
467c996c
MG
1597 zone->lowmem_reserve[0]);
1598 for (i = 1; i < ARRAY_SIZE(zone->lowmem_reserve); i++)
3484b2de 1599 seq_printf(m, ", %ld", zone->lowmem_reserve[i]);
7dfb8bf3
DR
1600 seq_putc(m, ')');
1601
1602 /* If unpopulated, no other information is useful */
1603 if (!populated_zone(zone)) {
1604 seq_putc(m, '\n');
1605 return;
1606 }
1607
1608 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
1609 seq_printf(m, "\n %-12s %lu", vmstat_text[i],
1610 zone_page_state(zone, i));
1611
3a321d2a
KW
1612#ifdef CONFIG_NUMA
1613 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++)
1614 seq_printf(m, "\n %-12s %lu",
1615 vmstat_text[i + NR_VM_ZONE_STAT_ITEMS],
63803222 1616 zone_numa_state_snapshot(zone, i));
3a321d2a
KW
1617#endif
1618
7dfb8bf3 1619 seq_printf(m, "\n pagesets");
467c996c
MG
1620 for_each_online_cpu(i) {
1621 struct per_cpu_pageset *pageset;
467c996c 1622
99dcc3e5 1623 pageset = per_cpu_ptr(zone->pageset, i);
3dfa5721
CL
1624 seq_printf(m,
1625 "\n cpu: %i"
1626 "\n count: %i"
1627 "\n high: %i"
1628 "\n batch: %i",
1629 i,
1630 pageset->pcp.count,
1631 pageset->pcp.high,
1632 pageset->pcp.batch);
df9ecaba 1633#ifdef CONFIG_SMP
467c996c
MG
1634 seq_printf(m, "\n vm stats threshold: %d",
1635 pageset->stat_threshold);
df9ecaba 1636#endif
f6ac2354 1637 }
467c996c 1638 seq_printf(m,
599d0c95 1639 "\n node_unreclaimable: %u"
3a50d14d 1640 "\n start_pfn: %lu",
c73322d0 1641 pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES,
3a50d14d 1642 zone->zone_start_pfn);
467c996c
MG
1643 seq_putc(m, '\n');
1644}
1645
1646/*
b2bd8598
DR
1647 * Output information about zones in @pgdat. All zones are printed regardless
1648 * of whether they are populated or not: lowmem_reserve_ratio operates on the
1649 * set of all zones and userspace would not be aware of such zones if they are
1650 * suppressed here (zoneinfo displays the effect of lowmem_reserve_ratio).
467c996c
MG
1651 */
1652static int zoneinfo_show(struct seq_file *m, void *arg)
1653{
1654 pg_data_t *pgdat = (pg_data_t *)arg;
727c080f 1655 walk_zones_in_node(m, pgdat, false, false, zoneinfo_show_print);
f6ac2354
CL
1656 return 0;
1657}
1658
5c9fe628 1659static const struct seq_operations zoneinfo_op = {
f6ac2354
CL
1660 .start = frag_start, /* iterate over all zones. The same as in
1661 * fragmentation. */
1662 .next = frag_next,
1663 .stop = frag_stop,
1664 .show = zoneinfo_show,
1665};
1666
5c9fe628
AD
1667static int zoneinfo_open(struct inode *inode, struct file *file)
1668{
1669 return seq_open(file, &zoneinfo_op);
1670}
1671
9d85e15f 1672static const struct file_operations zoneinfo_file_operations = {
5c9fe628
AD
1673 .open = zoneinfo_open,
1674 .read = seq_read,
1675 .llseek = seq_lseek,
1676 .release = seq_release,
1677};
1678
79da826a
MR
1679enum writeback_stat_item {
1680 NR_DIRTY_THRESHOLD,
1681 NR_DIRTY_BG_THRESHOLD,
1682 NR_VM_WRITEBACK_STAT_ITEMS,
1683};
1684
f6ac2354
CL
1685static void *vmstat_start(struct seq_file *m, loff_t *pos)
1686{
2244b95a 1687 unsigned long *v;
79da826a 1688 int i, stat_items_size;
f6ac2354
CL
1689
1690 if (*pos >= ARRAY_SIZE(vmstat_text))
1691 return NULL;
79da826a 1692 stat_items_size = NR_VM_ZONE_STAT_ITEMS * sizeof(unsigned long) +
3a321d2a 1693 NR_VM_NUMA_STAT_ITEMS * sizeof(unsigned long) +
75ef7184 1694 NR_VM_NODE_STAT_ITEMS * sizeof(unsigned long) +
79da826a 1695 NR_VM_WRITEBACK_STAT_ITEMS * sizeof(unsigned long);
f6ac2354 1696
f8891e5e 1697#ifdef CONFIG_VM_EVENT_COUNTERS
79da826a 1698 stat_items_size += sizeof(struct vm_event_state);
f8891e5e 1699#endif
79da826a
MR
1700
1701 v = kmalloc(stat_items_size, GFP_KERNEL);
2244b95a
CL
1702 m->private = v;
1703 if (!v)
f6ac2354 1704 return ERR_PTR(-ENOMEM);
2244b95a 1705 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
c41f012a 1706 v[i] = global_zone_page_state(i);
79da826a
MR
1707 v += NR_VM_ZONE_STAT_ITEMS;
1708
3a321d2a
KW
1709#ifdef CONFIG_NUMA
1710 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++)
1711 v[i] = global_numa_state(i);
1712 v += NR_VM_NUMA_STAT_ITEMS;
1713#endif
1714
75ef7184
MG
1715 for (i = 0; i < NR_VM_NODE_STAT_ITEMS; i++)
1716 v[i] = global_node_page_state(i);
1717 v += NR_VM_NODE_STAT_ITEMS;
1718
79da826a
MR
1719 global_dirty_limits(v + NR_DIRTY_BG_THRESHOLD,
1720 v + NR_DIRTY_THRESHOLD);
1721 v += NR_VM_WRITEBACK_STAT_ITEMS;
1722
f8891e5e 1723#ifdef CONFIG_VM_EVENT_COUNTERS
79da826a
MR
1724 all_vm_events(v);
1725 v[PGPGIN] /= 2; /* sectors -> kbytes */
1726 v[PGPGOUT] /= 2;
f8891e5e 1727#endif
ff8b16d7 1728 return (unsigned long *)m->private + *pos;
f6ac2354
CL
1729}
1730
1731static void *vmstat_next(struct seq_file *m, void *arg, loff_t *pos)
1732{
1733 (*pos)++;
1734 if (*pos >= ARRAY_SIZE(vmstat_text))
1735 return NULL;
1736 return (unsigned long *)m->private + *pos;
1737}
1738
1739static int vmstat_show(struct seq_file *m, void *arg)
1740{
1741 unsigned long *l = arg;
1742 unsigned long off = l - (unsigned long *)m->private;
68ba0326 1743
dd0d4348
RG
1744 /* Skip hidden vmstat items. */
1745 if (*vmstat_text[off] == '\0')
1746 return 0;
1747
68ba0326 1748 seq_puts(m, vmstat_text[off]);
75ba1d07 1749 seq_put_decimal_ull(m, " ", *l);
68ba0326 1750 seq_putc(m, '\n');
f6ac2354
CL
1751 return 0;
1752}
1753
1754static void vmstat_stop(struct seq_file *m, void *arg)
1755{
1756 kfree(m->private);
1757 m->private = NULL;
1758}
1759
b6aa44ab 1760static const struct seq_operations vmstat_op = {
f6ac2354
CL
1761 .start = vmstat_start,
1762 .next = vmstat_next,
1763 .stop = vmstat_stop,
1764 .show = vmstat_show,
1765};
1766
b6aa44ab
AD
1767static int vmstat_open(struct inode *inode, struct file *file)
1768{
1769 return seq_open(file, &vmstat_op);
1770}
1771
9d85e15f 1772static const struct file_operations vmstat_file_operations = {
b6aa44ab
AD
1773 .open = vmstat_open,
1774 .read = seq_read,
1775 .llseek = seq_lseek,
1776 .release = seq_release,
1777};
f6ac2354
CL
1778#endif /* CONFIG_PROC_FS */
1779
df9ecaba 1780#ifdef CONFIG_SMP
d1187ed2 1781static DEFINE_PER_CPU(struct delayed_work, vmstat_work);
77461ab3 1782int sysctl_stat_interval __read_mostly = HZ;
d1187ed2 1783
52b6f46b
HD
1784#ifdef CONFIG_PROC_FS
1785static void refresh_vm_stats(struct work_struct *work)
1786{
1787 refresh_cpu_vm_stats(true);
1788}
1789
1790int vmstat_refresh(struct ctl_table *table, int write,
1791 void __user *buffer, size_t *lenp, loff_t *ppos)
1792{
1793 long val;
1794 int err;
1795 int i;
1796
1797 /*
1798 * The regular update, every sysctl_stat_interval, may come later
1799 * than expected: leaving a significant amount in per_cpu buckets.
1800 * This is particularly misleading when checking a quantity of HUGE
1801 * pages, immediately after running a test. /proc/sys/vm/stat_refresh,
1802 * which can equally be echo'ed to or cat'ted from (by root),
1803 * can be used to update the stats just before reading them.
1804 *
c41f012a 1805 * Oh, and since global_zone_page_state() etc. are so careful to hide
52b6f46b
HD
1806 * transiently negative values, report an error here if any of
1807 * the stats is negative, so we know to go looking for imbalance.
1808 */
1809 err = schedule_on_each_cpu(refresh_vm_stats);
1810 if (err)
1811 return err;
1812 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++) {
75ef7184 1813 val = atomic_long_read(&vm_zone_stat[i]);
52b6f46b 1814 if (val < 0) {
c822f622
JW
1815 pr_warn("%s: %s %ld\n",
1816 __func__, vmstat_text[i], val);
1817 err = -EINVAL;
52b6f46b
HD
1818 }
1819 }
3a321d2a
KW
1820#ifdef CONFIG_NUMA
1821 for (i = 0; i < NR_VM_NUMA_STAT_ITEMS; i++) {
1822 val = atomic_long_read(&vm_numa_stat[i]);
1823 if (val < 0) {
1824 pr_warn("%s: %s %ld\n",
1825 __func__, vmstat_text[i + NR_VM_ZONE_STAT_ITEMS], val);
1826 err = -EINVAL;
1827 }
1828 }
1829#endif
52b6f46b
HD
1830 if (err)
1831 return err;
1832 if (write)
1833 *ppos += *lenp;
1834 else
1835 *lenp = 0;
1836 return 0;
1837}
1838#endif /* CONFIG_PROC_FS */
1839
d1187ed2
CL
1840static void vmstat_update(struct work_struct *w)
1841{
0eb77e98 1842 if (refresh_cpu_vm_stats(true)) {
7cc36bbd
CL
1843 /*
1844 * Counters were updated so we expect more updates
1845 * to occur in the future. Keep on running the
1846 * update worker thread.
1847 */
ce612879 1848 queue_delayed_work_on(smp_processor_id(), mm_percpu_wq,
f01f17d3
MH
1849 this_cpu_ptr(&vmstat_work),
1850 round_jiffies_relative(sysctl_stat_interval));
7cc36bbd
CL
1851 }
1852}
1853
0eb77e98
CL
1854/*
1855 * Switch off vmstat processing and then fold all the remaining differentials
1856 * until the diffs stay at zero. The function is used by NOHZ and can only be
1857 * invoked when tick processing is not active.
1858 */
7cc36bbd
CL
1859/*
1860 * Check if the diffs for a certain cpu indicate that
1861 * an update is needed.
1862 */
1863static bool need_update(int cpu)
1864{
1865 struct zone *zone;
1866
1867 for_each_populated_zone(zone) {
1868 struct per_cpu_pageset *p = per_cpu_ptr(zone->pageset, cpu);
1869
1870 BUILD_BUG_ON(sizeof(p->vm_stat_diff[0]) != 1);
3a321d2a 1871#ifdef CONFIG_NUMA
1d90ca89 1872 BUILD_BUG_ON(sizeof(p->vm_numa_stat_diff[0]) != 2);
3a321d2a 1873#endif
63803222 1874
7cc36bbd
CL
1875 /*
1876 * The fast way of checking if there are any vmstat diffs.
7cc36bbd 1877 */
ac9ae2da
JH
1878 if (memchr_inv(p->vm_stat_diff, 0, NR_VM_ZONE_STAT_ITEMS *
1879 sizeof(p->vm_stat_diff[0])))
7cc36bbd 1880 return true;
3a321d2a 1881#ifdef CONFIG_NUMA
ac9ae2da
JH
1882 if (memchr_inv(p->vm_numa_stat_diff, 0, NR_VM_NUMA_STAT_ITEMS *
1883 sizeof(p->vm_numa_stat_diff[0])))
3a321d2a
KW
1884 return true;
1885#endif
7cc36bbd
CL
1886 }
1887 return false;
1888}
1889
7b8da4c7
CL
1890/*
1891 * Switch off vmstat processing and then fold all the remaining differentials
1892 * until the diffs stay at zero. The function is used by NOHZ and can only be
1893 * invoked when tick processing is not active.
1894 */
f01f17d3
MH
1895void quiet_vmstat(void)
1896{
1897 if (system_state != SYSTEM_RUNNING)
1898 return;
1899
7b8da4c7 1900 if (!delayed_work_pending(this_cpu_ptr(&vmstat_work)))
f01f17d3
MH
1901 return;
1902
1903 if (!need_update(smp_processor_id()))
1904 return;
1905
1906 /*
1907 * Just refresh counters and do not care about the pending delayed
1908 * vmstat_update. It doesn't fire that often to matter and canceling
1909 * it would be too expensive from this path.
1910 * vmstat_shepherd will take care about that for us.
1911 */
1912 refresh_cpu_vm_stats(false);
1913}
1914
7cc36bbd
CL
1915/*
1916 * Shepherd worker thread that checks the
1917 * differentials of processors that have their worker
1918 * threads for vm statistics updates disabled because of
1919 * inactivity.
1920 */
1921static void vmstat_shepherd(struct work_struct *w);
1922
0eb77e98 1923static DECLARE_DEFERRABLE_WORK(shepherd, vmstat_shepherd);
7cc36bbd
CL
1924
1925static void vmstat_shepherd(struct work_struct *w)
1926{
1927 int cpu;
1928
1929 get_online_cpus();
1930 /* Check processors whose vmstat worker threads have been disabled */
7b8da4c7 1931 for_each_online_cpu(cpu) {
f01f17d3 1932 struct delayed_work *dw = &per_cpu(vmstat_work, cpu);
7cc36bbd 1933
7b8da4c7 1934 if (!delayed_work_pending(dw) && need_update(cpu))
ce612879 1935 queue_delayed_work_on(cpu, mm_percpu_wq, dw, 0);
f01f17d3 1936 }
7cc36bbd
CL
1937 put_online_cpus();
1938
1939 schedule_delayed_work(&shepherd,
98f4ebb2 1940 round_jiffies_relative(sysctl_stat_interval));
d1187ed2
CL
1941}
1942
7cc36bbd 1943static void __init start_shepherd_timer(void)
d1187ed2 1944{
7cc36bbd
CL
1945 int cpu;
1946
1947 for_each_possible_cpu(cpu)
ccde8bd4 1948 INIT_DEFERRABLE_WORK(per_cpu_ptr(&vmstat_work, cpu),
7cc36bbd
CL
1949 vmstat_update);
1950
7cc36bbd
CL
1951 schedule_delayed_work(&shepherd,
1952 round_jiffies_relative(sysctl_stat_interval));
d1187ed2
CL
1953}
1954
03e86dba
TC
1955static void __init init_cpu_node_state(void)
1956{
4c501327 1957 int node;
03e86dba 1958
4c501327
SAS
1959 for_each_online_node(node) {
1960 if (cpumask_weight(cpumask_of_node(node)) > 0)
1961 node_set_state(node, N_CPU);
1962 }
03e86dba
TC
1963}
1964
5438da97
SAS
1965static int vmstat_cpu_online(unsigned int cpu)
1966{
1967 refresh_zone_stat_thresholds();
1968 node_set_state(cpu_to_node(cpu), N_CPU);
1969 return 0;
1970}
1971
1972static int vmstat_cpu_down_prep(unsigned int cpu)
1973{
1974 cancel_delayed_work_sync(&per_cpu(vmstat_work, cpu));
1975 return 0;
1976}
1977
1978static int vmstat_cpu_dead(unsigned int cpu)
807a1bd2 1979{
4c501327 1980 const struct cpumask *node_cpus;
5438da97 1981 int node;
807a1bd2 1982
5438da97
SAS
1983 node = cpu_to_node(cpu);
1984
1985 refresh_zone_stat_thresholds();
4c501327
SAS
1986 node_cpus = cpumask_of_node(node);
1987 if (cpumask_weight(node_cpus) > 0)
5438da97 1988 return 0;
807a1bd2
TK
1989
1990 node_clear_state(node, N_CPU);
5438da97 1991 return 0;
807a1bd2
TK
1992}
1993
8f32f7e5 1994#endif
df9ecaba 1995
ce612879
MH
1996struct workqueue_struct *mm_percpu_wq;
1997
597b7305 1998void __init init_mm_internals(void)
df9ecaba 1999{
ce612879 2000 int ret __maybe_unused;
5438da97 2001
80d136e1 2002 mm_percpu_wq = alloc_workqueue("mm_percpu_wq", WQ_MEM_RECLAIM, 0);
ce612879
MH
2003
2004#ifdef CONFIG_SMP
5438da97
SAS
2005 ret = cpuhp_setup_state_nocalls(CPUHP_MM_VMSTAT_DEAD, "mm/vmstat:dead",
2006 NULL, vmstat_cpu_dead);
2007 if (ret < 0)
2008 pr_err("vmstat: failed to register 'dead' hotplug state\n");
2009
2010 ret = cpuhp_setup_state_nocalls(CPUHP_AP_ONLINE_DYN, "mm/vmstat:online",
2011 vmstat_cpu_online,
2012 vmstat_cpu_down_prep);
2013 if (ret < 0)
2014 pr_err("vmstat: failed to register 'online' hotplug state\n");
2015
2016 get_online_cpus();
03e86dba 2017 init_cpu_node_state();
5438da97 2018 put_online_cpus();
d1187ed2 2019
7cc36bbd 2020 start_shepherd_timer();
8f32f7e5
AD
2021#endif
2022#ifdef CONFIG_PROC_FS
9d85e15f 2023 proc_create("buddyinfo", 0444, NULL, &buddyinfo_file_operations);
43bc0c0a 2024 proc_create("pagetypeinfo", 0400, NULL, &pagetypeinfo_file_operations);
9d85e15f
AK
2025 proc_create("vmstat", 0444, NULL, &vmstat_file_operations);
2026 proc_create("zoneinfo", 0444, NULL, &zoneinfo_file_operations);
8f32f7e5 2027#endif
df9ecaba 2028}
d7a5752c
MG
2029
2030#if defined(CONFIG_DEBUG_FS) && defined(CONFIG_COMPACTION)
d7a5752c
MG
2031
2032/*
2033 * Return an index indicating how much of the available free memory is
2034 * unusable for an allocation of the requested size.
2035 */
2036static int unusable_free_index(unsigned int order,
2037 struct contig_page_info *info)
2038{
2039 /* No free memory is interpreted as all free memory is unusable */
2040 if (info->free_pages == 0)
2041 return 1000;
2042
2043 /*
2044 * Index should be a value between 0 and 1. Return a value to 3
2045 * decimal places.
2046 *
2047 * 0 => no fragmentation
2048 * 1 => high fragmentation
2049 */
2050 return div_u64((info->free_pages - (info->free_blocks_suitable << order)) * 1000ULL, info->free_pages);
2051
2052}
2053
2054static void unusable_show_print(struct seq_file *m,
2055 pg_data_t *pgdat, struct zone *zone)
2056{
2057 unsigned int order;
2058 int index;
2059 struct contig_page_info info;
2060
2061 seq_printf(m, "Node %d, zone %8s ",
2062 pgdat->node_id,
2063 zone->name);
2064 for (order = 0; order < MAX_ORDER; ++order) {
2065 fill_contig_page_info(zone, order, &info);
2066 index = unusable_free_index(order, &info);
2067 seq_printf(m, "%d.%03d ", index / 1000, index % 1000);
2068 }
2069
2070 seq_putc(m, '\n');
2071}
2072
2073/*
2074 * Display unusable free space index
2075 *
2076 * The unusable free space index measures how much of the available free
2077 * memory cannot be used to satisfy an allocation of a given size and is a
2078 * value between 0 and 1. The higher the value, the more of free memory is
2079 * unusable and by implication, the worse the external fragmentation is. This
2080 * can be expressed as a percentage by multiplying by 100.
2081 */
2082static int unusable_show(struct seq_file *m, void *arg)
2083{
2084 pg_data_t *pgdat = (pg_data_t *)arg;
2085
2086 /* check memoryless node */
a47b53c5 2087 if (!node_state(pgdat->node_id, N_MEMORY))
d7a5752c
MG
2088 return 0;
2089
727c080f 2090 walk_zones_in_node(m, pgdat, true, false, unusable_show_print);
d7a5752c
MG
2091
2092 return 0;
2093}
2094
2095static const struct seq_operations unusable_op = {
2096 .start = frag_start,
2097 .next = frag_next,
2098 .stop = frag_stop,
2099 .show = unusable_show,
2100};
2101
2102static int unusable_open(struct inode *inode, struct file *file)
2103{
2104 return seq_open(file, &unusable_op);
2105}
2106
2107static const struct file_operations unusable_file_ops = {
2108 .open = unusable_open,
2109 .read = seq_read,
2110 .llseek = seq_lseek,
2111 .release = seq_release,
2112};
2113
f1a5ab12
MG
2114static void extfrag_show_print(struct seq_file *m,
2115 pg_data_t *pgdat, struct zone *zone)
2116{
2117 unsigned int order;
2118 int index;
2119
2120 /* Alloc on stack as interrupts are disabled for zone walk */
2121 struct contig_page_info info;
2122
2123 seq_printf(m, "Node %d, zone %8s ",
2124 pgdat->node_id,
2125 zone->name);
2126 for (order = 0; order < MAX_ORDER; ++order) {
2127 fill_contig_page_info(zone, order, &info);
56de7263 2128 index = __fragmentation_index(order, &info);
f1a5ab12
MG
2129 seq_printf(m, "%d.%03d ", index / 1000, index % 1000);
2130 }
2131
2132 seq_putc(m, '\n');
2133}
2134
2135/*
2136 * Display fragmentation index for orders that allocations would fail for
2137 */
2138static int extfrag_show(struct seq_file *m, void *arg)
2139{
2140 pg_data_t *pgdat = (pg_data_t *)arg;
2141
727c080f 2142 walk_zones_in_node(m, pgdat, true, false, extfrag_show_print);
f1a5ab12
MG
2143
2144 return 0;
2145}
2146
2147static const struct seq_operations extfrag_op = {
2148 .start = frag_start,
2149 .next = frag_next,
2150 .stop = frag_stop,
2151 .show = extfrag_show,
2152};
2153
2154static int extfrag_open(struct inode *inode, struct file *file)
2155{
2156 return seq_open(file, &extfrag_op);
2157}
2158
2159static const struct file_operations extfrag_file_ops = {
2160 .open = extfrag_open,
2161 .read = seq_read,
2162 .llseek = seq_lseek,
2163 .release = seq_release,
2164};
2165
d7a5752c
MG
2166static int __init extfrag_debug_init(void)
2167{
bde8bd8a
S
2168 struct dentry *extfrag_debug_root;
2169
d7a5752c
MG
2170 extfrag_debug_root = debugfs_create_dir("extfrag", NULL);
2171 if (!extfrag_debug_root)
2172 return -ENOMEM;
2173
2174 if (!debugfs_create_file("unusable_index", 0444,
2175 extfrag_debug_root, NULL, &unusable_file_ops))
bde8bd8a 2176 goto fail;
d7a5752c 2177
f1a5ab12
MG
2178 if (!debugfs_create_file("extfrag_index", 0444,
2179 extfrag_debug_root, NULL, &extfrag_file_ops))
bde8bd8a 2180 goto fail;
f1a5ab12 2181
d7a5752c 2182 return 0;
bde8bd8a
S
2183fail:
2184 debugfs_remove_recursive(extfrag_debug_root);
2185 return -ENOMEM;
d7a5752c
MG
2186}
2187
2188module_init(extfrag_debug_init);
2189#endif