mm: workingset: make shadow node shrinker memcg aware
[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
f8891e5e
CL
33#ifdef CONFIG_VM_EVENT_COUNTERS
34DEFINE_PER_CPU(struct vm_event_state, vm_event_states) = {{0}};
35EXPORT_PER_CPU_SYMBOL(vm_event_states);
36
31f961a8 37static void sum_vm_events(unsigned long *ret)
f8891e5e 38{
9eccf2a8 39 int cpu;
f8891e5e
CL
40 int i;
41
42 memset(ret, 0, NR_VM_EVENT_ITEMS * sizeof(unsigned long));
43
31f961a8 44 for_each_online_cpu(cpu) {
f8891e5e
CL
45 struct vm_event_state *this = &per_cpu(vm_event_states, cpu);
46
f8891e5e
CL
47 for (i = 0; i < NR_VM_EVENT_ITEMS; i++)
48 ret[i] += this->event[i];
49 }
50}
51
52/*
53 * Accumulate the vm event counters across all CPUs.
54 * The result is unavoidably approximate - it can change
55 * during and after execution of this function.
56*/
57void all_vm_events(unsigned long *ret)
58{
b5be1132 59 get_online_cpus();
31f961a8 60 sum_vm_events(ret);
b5be1132 61 put_online_cpus();
f8891e5e 62}
32dd66fc 63EXPORT_SYMBOL_GPL(all_vm_events);
f8891e5e 64
f8891e5e
CL
65/*
66 * Fold the foreign cpu events into our own.
67 *
68 * This is adding to the events on one processor
69 * but keeps the global counts constant.
70 */
71void vm_events_fold_cpu(int cpu)
72{
73 struct vm_event_state *fold_state = &per_cpu(vm_event_states, cpu);
74 int i;
75
76 for (i = 0; i < NR_VM_EVENT_ITEMS; i++) {
77 count_vm_events(i, fold_state->event[i]);
78 fold_state->event[i] = 0;
79 }
80}
f8891e5e
CL
81
82#endif /* CONFIG_VM_EVENT_COUNTERS */
83
2244b95a
CL
84/*
85 * Manage combined zone based / global counters
86 *
87 * vm_stat contains the global counters
88 */
a1cb2c60 89atomic_long_t vm_stat[NR_VM_ZONE_STAT_ITEMS] __cacheline_aligned_in_smp;
2244b95a
CL
90EXPORT_SYMBOL(vm_stat);
91
92#ifdef CONFIG_SMP
93
b44129b3 94int calculate_pressure_threshold(struct zone *zone)
88f5acf8
MG
95{
96 int threshold;
97 int watermark_distance;
98
99 /*
100 * As vmstats are not up to date, there is drift between the estimated
101 * and real values. For high thresholds and a high number of CPUs, it
102 * is possible for the min watermark to be breached while the estimated
103 * value looks fine. The pressure threshold is a reduced value such
104 * that even the maximum amount of drift will not accidentally breach
105 * the min watermark
106 */
107 watermark_distance = low_wmark_pages(zone) - min_wmark_pages(zone);
108 threshold = max(1, (int)(watermark_distance / num_online_cpus()));
109
110 /*
111 * Maximum threshold is 125
112 */
113 threshold = min(125, threshold);
114
115 return threshold;
116}
117
b44129b3 118int calculate_normal_threshold(struct zone *zone)
df9ecaba
CL
119{
120 int threshold;
121 int mem; /* memory in 128 MB units */
122
123 /*
124 * The threshold scales with the number of processors and the amount
125 * of memory per zone. More memory means that we can defer updates for
126 * longer, more processors could lead to more contention.
127 * fls() is used to have a cheap way of logarithmic scaling.
128 *
129 * Some sample thresholds:
130 *
131 * Threshold Processors (fls) Zonesize fls(mem+1)
132 * ------------------------------------------------------------------
133 * 8 1 1 0.9-1 GB 4
134 * 16 2 2 0.9-1 GB 4
135 * 20 2 2 1-2 GB 5
136 * 24 2 2 2-4 GB 6
137 * 28 2 2 4-8 GB 7
138 * 32 2 2 8-16 GB 8
139 * 4 2 2 <128M 1
140 * 30 4 3 2-4 GB 5
141 * 48 4 3 8-16 GB 8
142 * 32 8 4 1-2 GB 4
143 * 32 8 4 0.9-1GB 4
144 * 10 16 5 <128M 1
145 * 40 16 5 900M 4
146 * 70 64 7 2-4 GB 5
147 * 84 64 7 4-8 GB 6
148 * 108 512 9 4-8 GB 6
149 * 125 1024 10 8-16 GB 8
150 * 125 1024 10 16-32 GB 9
151 */
152
b40da049 153 mem = zone->managed_pages >> (27 - PAGE_SHIFT);
df9ecaba
CL
154
155 threshold = 2 * fls(num_online_cpus()) * (1 + fls(mem));
156
157 /*
158 * Maximum threshold is 125
159 */
160 threshold = min(125, threshold);
161
162 return threshold;
163}
2244b95a
CL
164
165/*
df9ecaba 166 * Refresh the thresholds for each zone.
2244b95a 167 */
a6cccdc3 168void refresh_zone_stat_thresholds(void)
2244b95a 169{
df9ecaba
CL
170 struct zone *zone;
171 int cpu;
172 int threshold;
173
ee99c71c 174 for_each_populated_zone(zone) {
aa454840
CL
175 unsigned long max_drift, tolerate_drift;
176
b44129b3 177 threshold = calculate_normal_threshold(zone);
df9ecaba
CL
178
179 for_each_online_cpu(cpu)
99dcc3e5
CL
180 per_cpu_ptr(zone->pageset, cpu)->stat_threshold
181 = threshold;
aa454840
CL
182
183 /*
184 * Only set percpu_drift_mark if there is a danger that
185 * NR_FREE_PAGES reports the low watermark is ok when in fact
186 * the min watermark could be breached by an allocation
187 */
188 tolerate_drift = low_wmark_pages(zone) - min_wmark_pages(zone);
189 max_drift = num_online_cpus() * threshold;
190 if (max_drift > tolerate_drift)
191 zone->percpu_drift_mark = high_wmark_pages(zone) +
192 max_drift;
df9ecaba 193 }
2244b95a
CL
194}
195
b44129b3
MG
196void set_pgdat_percpu_threshold(pg_data_t *pgdat,
197 int (*calculate_pressure)(struct zone *))
88f5acf8
MG
198{
199 struct zone *zone;
200 int cpu;
201 int threshold;
202 int i;
203
88f5acf8
MG
204 for (i = 0; i < pgdat->nr_zones; i++) {
205 zone = &pgdat->node_zones[i];
206 if (!zone->percpu_drift_mark)
207 continue;
208
b44129b3 209 threshold = (*calculate_pressure)(zone);
bb0b6dff 210 for_each_online_cpu(cpu)
88f5acf8
MG
211 per_cpu_ptr(zone->pageset, cpu)->stat_threshold
212 = threshold;
213 }
88f5acf8
MG
214}
215
2244b95a 216/*
bea04b07
JZ
217 * For use when we know that interrupts are disabled,
218 * or when we know that preemption is disabled and that
219 * particular counter cannot be updated from interrupt context.
2244b95a
CL
220 */
221void __mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
6cdb18ad 222 long delta)
2244b95a 223{
12938a92
CL
224 struct per_cpu_pageset __percpu *pcp = zone->pageset;
225 s8 __percpu *p = pcp->vm_stat_diff + item;
2244b95a 226 long x;
12938a92
CL
227 long t;
228
229 x = delta + __this_cpu_read(*p);
2244b95a 230
12938a92 231 t = __this_cpu_read(pcp->stat_threshold);
2244b95a 232
12938a92 233 if (unlikely(x > t || x < -t)) {
2244b95a
CL
234 zone_page_state_add(x, zone, item);
235 x = 0;
236 }
12938a92 237 __this_cpu_write(*p, x);
2244b95a
CL
238}
239EXPORT_SYMBOL(__mod_zone_page_state);
240
2244b95a
CL
241/*
242 * Optimized increment and decrement functions.
243 *
244 * These are only for a single page and therefore can take a struct page *
245 * argument instead of struct zone *. This allows the inclusion of the code
246 * generated for page_zone(page) into the optimized functions.
247 *
248 * No overflow check is necessary and therefore the differential can be
249 * incremented or decremented in place which may allow the compilers to
250 * generate better code.
2244b95a
CL
251 * The increment or decrement is known and therefore one boundary check can
252 * be omitted.
253 *
df9ecaba
CL
254 * NOTE: These functions are very performance sensitive. Change only
255 * with care.
256 *
2244b95a
CL
257 * Some processors have inc/dec instructions that are atomic vs an interrupt.
258 * However, the code must first determine the differential location in a zone
259 * based on the processor number and then inc/dec the counter. There is no
260 * guarantee without disabling preemption that the processor will not change
261 * in between and therefore the atomicity vs. interrupt cannot be exploited
262 * in a useful way here.
263 */
c8785385 264void __inc_zone_state(struct zone *zone, enum zone_stat_item item)
2244b95a 265{
12938a92
CL
266 struct per_cpu_pageset __percpu *pcp = zone->pageset;
267 s8 __percpu *p = pcp->vm_stat_diff + item;
268 s8 v, t;
2244b95a 269
908ee0f1 270 v = __this_cpu_inc_return(*p);
12938a92
CL
271 t = __this_cpu_read(pcp->stat_threshold);
272 if (unlikely(v > t)) {
273 s8 overstep = t >> 1;
df9ecaba 274
12938a92
CL
275 zone_page_state_add(v + overstep, zone, item);
276 __this_cpu_write(*p, -overstep);
2244b95a
CL
277 }
278}
ca889e6c
CL
279
280void __inc_zone_page_state(struct page *page, enum zone_stat_item item)
281{
282 __inc_zone_state(page_zone(page), item);
283}
2244b95a
CL
284EXPORT_SYMBOL(__inc_zone_page_state);
285
c8785385 286void __dec_zone_state(struct zone *zone, enum zone_stat_item item)
2244b95a 287{
12938a92
CL
288 struct per_cpu_pageset __percpu *pcp = zone->pageset;
289 s8 __percpu *p = pcp->vm_stat_diff + item;
290 s8 v, t;
2244b95a 291
908ee0f1 292 v = __this_cpu_dec_return(*p);
12938a92
CL
293 t = __this_cpu_read(pcp->stat_threshold);
294 if (unlikely(v < - t)) {
295 s8 overstep = t >> 1;
2244b95a 296
12938a92
CL
297 zone_page_state_add(v - overstep, zone, item);
298 __this_cpu_write(*p, overstep);
2244b95a
CL
299 }
300}
c8785385
CL
301
302void __dec_zone_page_state(struct page *page, enum zone_stat_item item)
303{
304 __dec_zone_state(page_zone(page), item);
305}
2244b95a
CL
306EXPORT_SYMBOL(__dec_zone_page_state);
307
4156153c 308#ifdef CONFIG_HAVE_CMPXCHG_LOCAL
7c839120
CL
309/*
310 * If we have cmpxchg_local support then we do not need to incur the overhead
311 * that comes with local_irq_save/restore if we use this_cpu_cmpxchg.
312 *
313 * mod_state() modifies the zone counter state through atomic per cpu
314 * operations.
315 *
316 * Overstep mode specifies how overstep should handled:
317 * 0 No overstepping
318 * 1 Overstepping half of threshold
319 * -1 Overstepping minus half of threshold
320*/
6cdb18ad
HC
321static inline void mod_state(struct zone *zone, enum zone_stat_item item,
322 long delta, int overstep_mode)
7c839120
CL
323{
324 struct per_cpu_pageset __percpu *pcp = zone->pageset;
325 s8 __percpu *p = pcp->vm_stat_diff + item;
326 long o, n, t, z;
327
328 do {
329 z = 0; /* overflow to zone counters */
330
331 /*
332 * The fetching of the stat_threshold is racy. We may apply
333 * a counter threshold to the wrong the cpu if we get
d3bc2367
CL
334 * rescheduled while executing here. However, the next
335 * counter update will apply the threshold again and
336 * therefore bring the counter under the threshold again.
337 *
338 * Most of the time the thresholds are the same anyways
339 * for all cpus in a zone.
7c839120
CL
340 */
341 t = this_cpu_read(pcp->stat_threshold);
342
343 o = this_cpu_read(*p);
344 n = delta + o;
345
346 if (n > t || n < -t) {
347 int os = overstep_mode * (t >> 1) ;
348
349 /* Overflow must be added to zone counters */
350 z = n + os;
351 n = -os;
352 }
353 } while (this_cpu_cmpxchg(*p, o, n) != o);
354
355 if (z)
356 zone_page_state_add(z, zone, item);
357}
358
359void mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
6cdb18ad 360 long delta)
7c839120
CL
361{
362 mod_state(zone, item, delta, 0);
363}
364EXPORT_SYMBOL(mod_zone_page_state);
365
366void inc_zone_state(struct zone *zone, enum zone_stat_item item)
367{
368 mod_state(zone, item, 1, 1);
369}
370
371void inc_zone_page_state(struct page *page, enum zone_stat_item item)
372{
373 mod_state(page_zone(page), item, 1, 1);
374}
375EXPORT_SYMBOL(inc_zone_page_state);
376
377void dec_zone_page_state(struct page *page, enum zone_stat_item item)
378{
379 mod_state(page_zone(page), item, -1, -1);
380}
381EXPORT_SYMBOL(dec_zone_page_state);
382#else
383/*
384 * Use interrupt disable to serialize counter updates
385 */
386void mod_zone_page_state(struct zone *zone, enum zone_stat_item item,
6cdb18ad 387 long delta)
7c839120
CL
388{
389 unsigned long flags;
390
391 local_irq_save(flags);
392 __mod_zone_page_state(zone, item, delta);
393 local_irq_restore(flags);
394}
395EXPORT_SYMBOL(mod_zone_page_state);
396
ca889e6c
CL
397void inc_zone_state(struct zone *zone, enum zone_stat_item item)
398{
399 unsigned long flags;
400
401 local_irq_save(flags);
402 __inc_zone_state(zone, item);
403 local_irq_restore(flags);
404}
405
2244b95a
CL
406void inc_zone_page_state(struct page *page, enum zone_stat_item item)
407{
408 unsigned long flags;
409 struct zone *zone;
2244b95a
CL
410
411 zone = page_zone(page);
412 local_irq_save(flags);
ca889e6c 413 __inc_zone_state(zone, item);
2244b95a
CL
414 local_irq_restore(flags);
415}
416EXPORT_SYMBOL(inc_zone_page_state);
417
418void dec_zone_page_state(struct page *page, enum zone_stat_item item)
419{
420 unsigned long flags;
2244b95a 421
2244b95a 422 local_irq_save(flags);
a302eb4e 423 __dec_zone_page_state(page, item);
2244b95a
CL
424 local_irq_restore(flags);
425}
426EXPORT_SYMBOL(dec_zone_page_state);
7c839120 427#endif
2244b95a 428
7cc36bbd
CL
429
430/*
431 * Fold a differential into the global counters.
432 * Returns the number of counters updated.
433 */
434static int fold_diff(int *diff)
4edb0748
CL
435{
436 int i;
7cc36bbd 437 int changes = 0;
4edb0748
CL
438
439 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
7cc36bbd 440 if (diff[i]) {
4edb0748 441 atomic_long_add(diff[i], &vm_stat[i]);
7cc36bbd
CL
442 changes++;
443 }
444 return changes;
4edb0748
CL
445}
446
2244b95a 447/*
2bb921e5 448 * Update the zone counters for the current cpu.
a7f75e25 449 *
4037d452
CL
450 * Note that refresh_cpu_vm_stats strives to only access
451 * node local memory. The per cpu pagesets on remote zones are placed
452 * in the memory local to the processor using that pageset. So the
453 * loop over all zones will access a series of cachelines local to
454 * the processor.
455 *
456 * The call to zone_page_state_add updates the cachelines with the
457 * statistics in the remote zone struct as well as the global cachelines
458 * with the global counters. These could cause remote node cache line
459 * bouncing and will have to be only done when necessary.
7cc36bbd
CL
460 *
461 * The function returns the number of global counters updated.
2244b95a 462 */
0eb77e98 463static int refresh_cpu_vm_stats(bool do_pagesets)
2244b95a
CL
464{
465 struct zone *zone;
466 int i;
a7f75e25 467 int global_diff[NR_VM_ZONE_STAT_ITEMS] = { 0, };
7cc36bbd 468 int changes = 0;
2244b95a 469
ee99c71c 470 for_each_populated_zone(zone) {
fbc2edb0 471 struct per_cpu_pageset __percpu *p = zone->pageset;
2244b95a 472
fbc2edb0
CL
473 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++) {
474 int v;
2244b95a 475
fbc2edb0
CL
476 v = this_cpu_xchg(p->vm_stat_diff[i], 0);
477 if (v) {
a7f75e25 478
a7f75e25
CL
479 atomic_long_add(v, &zone->vm_stat[i]);
480 global_diff[i] += v;
4037d452
CL
481#ifdef CONFIG_NUMA
482 /* 3 seconds idle till flush */
fbc2edb0 483 __this_cpu_write(p->expire, 3);
4037d452 484#endif
2244b95a 485 }
fbc2edb0 486 }
4037d452 487#ifdef CONFIG_NUMA
0eb77e98
CL
488 if (do_pagesets) {
489 cond_resched();
490 /*
491 * Deal with draining the remote pageset of this
492 * processor
493 *
494 * Check if there are pages remaining in this pageset
495 * if not then there is nothing to expire.
496 */
497 if (!__this_cpu_read(p->expire) ||
fbc2edb0 498 !__this_cpu_read(p->pcp.count))
0eb77e98 499 continue;
4037d452 500
0eb77e98
CL
501 /*
502 * We never drain zones local to this processor.
503 */
504 if (zone_to_nid(zone) == numa_node_id()) {
505 __this_cpu_write(p->expire, 0);
506 continue;
507 }
4037d452 508
0eb77e98
CL
509 if (__this_cpu_dec_return(p->expire))
510 continue;
4037d452 511
0eb77e98
CL
512 if (__this_cpu_read(p->pcp.count)) {
513 drain_zone_pages(zone, this_cpu_ptr(&p->pcp));
514 changes++;
515 }
7cc36bbd 516 }
4037d452 517#endif
2244b95a 518 }
7cc36bbd
CL
519 changes += fold_diff(global_diff);
520 return changes;
2244b95a
CL
521}
522
2bb921e5
CL
523/*
524 * Fold the data for an offline cpu into the global array.
525 * There cannot be any access by the offline cpu and therefore
526 * synchronization is simplified.
527 */
528void cpu_vm_stats_fold(int cpu)
529{
530 struct zone *zone;
531 int i;
532 int global_diff[NR_VM_ZONE_STAT_ITEMS] = { 0, };
533
534 for_each_populated_zone(zone) {
535 struct per_cpu_pageset *p;
536
537 p = per_cpu_ptr(zone->pageset, cpu);
538
539 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
540 if (p->vm_stat_diff[i]) {
541 int v;
542
543 v = p->vm_stat_diff[i];
544 p->vm_stat_diff[i] = 0;
545 atomic_long_add(v, &zone->vm_stat[i]);
546 global_diff[i] += v;
547 }
548 }
549
4edb0748 550 fold_diff(global_diff);
2bb921e5
CL
551}
552
40f4b1ea
CS
553/*
554 * this is only called if !populated_zone(zone), which implies no other users of
555 * pset->vm_stat_diff[] exsist.
556 */
5a883813
MK
557void drain_zonestat(struct zone *zone, struct per_cpu_pageset *pset)
558{
559 int i;
560
561 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
562 if (pset->vm_stat_diff[i]) {
563 int v = pset->vm_stat_diff[i];
564 pset->vm_stat_diff[i] = 0;
565 atomic_long_add(v, &zone->vm_stat[i]);
566 atomic_long_add(v, &vm_stat[i]);
567 }
568}
2244b95a
CL
569#endif
570
ca889e6c
CL
571#ifdef CONFIG_NUMA
572/*
573 * zonelist = the list of zones passed to the allocator
574 * z = the zone from which the allocation occurred.
575 *
576 * Must be called with interrupts disabled.
78afd561
AK
577 *
578 * When __GFP_OTHER_NODE is set assume the node of the preferred
579 * zone is the local node. This is useful for daemons who allocate
580 * memory on behalf of other processes.
ca889e6c 581 */
78afd561 582void zone_statistics(struct zone *preferred_zone, struct zone *z, gfp_t flags)
ca889e6c 583{
18ea7e71 584 if (z->zone_pgdat == preferred_zone->zone_pgdat) {
ca889e6c
CL
585 __inc_zone_state(z, NUMA_HIT);
586 } else {
587 __inc_zone_state(z, NUMA_MISS);
18ea7e71 588 __inc_zone_state(preferred_zone, NUMA_FOREIGN);
ca889e6c 589 }
78afd561
AK
590 if (z->node == ((flags & __GFP_OTHER_NODE) ?
591 preferred_zone->node : numa_node_id()))
ca889e6c
CL
592 __inc_zone_state(z, NUMA_LOCAL);
593 else
594 __inc_zone_state(z, NUMA_OTHER);
595}
c2d42c16
AM
596
597/*
598 * Determine the per node value of a stat item.
599 */
600unsigned long node_page_state(int node, enum zone_stat_item item)
601{
602 struct zone *zones = NODE_DATA(node)->node_zones;
603
604 return
605#ifdef CONFIG_ZONE_DMA
606 zone_page_state(&zones[ZONE_DMA], item) +
607#endif
608#ifdef CONFIG_ZONE_DMA32
609 zone_page_state(&zones[ZONE_DMA32], item) +
610#endif
611#ifdef CONFIG_HIGHMEM
612 zone_page_state(&zones[ZONE_HIGHMEM], item) +
613#endif
614 zone_page_state(&zones[ZONE_NORMAL], item) +
615 zone_page_state(&zones[ZONE_MOVABLE], item);
616}
617
ca889e6c
CL
618#endif
619
d7a5752c 620#ifdef CONFIG_COMPACTION
36deb0be 621
d7a5752c
MG
622struct contig_page_info {
623 unsigned long free_pages;
624 unsigned long free_blocks_total;
625 unsigned long free_blocks_suitable;
626};
627
628/*
629 * Calculate the number of free pages in a zone, how many contiguous
630 * pages are free and how many are large enough to satisfy an allocation of
631 * the target size. Note that this function makes no attempt to estimate
632 * how many suitable free blocks there *might* be if MOVABLE pages were
633 * migrated. Calculating that is possible, but expensive and can be
634 * figured out from userspace
635 */
636static void fill_contig_page_info(struct zone *zone,
637 unsigned int suitable_order,
638 struct contig_page_info *info)
639{
640 unsigned int order;
641
642 info->free_pages = 0;
643 info->free_blocks_total = 0;
644 info->free_blocks_suitable = 0;
645
646 for (order = 0; order < MAX_ORDER; order++) {
647 unsigned long blocks;
648
649 /* Count number of free blocks */
650 blocks = zone->free_area[order].nr_free;
651 info->free_blocks_total += blocks;
652
653 /* Count free base pages */
654 info->free_pages += blocks << order;
655
656 /* Count the suitable free blocks */
657 if (order >= suitable_order)
658 info->free_blocks_suitable += blocks <<
659 (order - suitable_order);
660 }
661}
f1a5ab12
MG
662
663/*
664 * A fragmentation index only makes sense if an allocation of a requested
665 * size would fail. If that is true, the fragmentation index indicates
666 * whether external fragmentation or a lack of memory was the problem.
667 * The value can be used to determine if page reclaim or compaction
668 * should be used
669 */
56de7263 670static int __fragmentation_index(unsigned int order, struct contig_page_info *info)
f1a5ab12
MG
671{
672 unsigned long requested = 1UL << order;
673
674 if (!info->free_blocks_total)
675 return 0;
676
677 /* Fragmentation index only makes sense when a request would fail */
678 if (info->free_blocks_suitable)
679 return -1000;
680
681 /*
682 * Index is between 0 and 1 so return within 3 decimal places
683 *
684 * 0 => allocation would fail due to lack of memory
685 * 1 => allocation would fail due to fragmentation
686 */
687 return 1000 - div_u64( (1000+(div_u64(info->free_pages * 1000ULL, requested))), info->free_blocks_total);
688}
56de7263
MG
689
690/* Same as __fragmentation index but allocs contig_page_info on stack */
691int fragmentation_index(struct zone *zone, unsigned int order)
692{
693 struct contig_page_info info;
694
695 fill_contig_page_info(zone, order, &info);
696 return __fragmentation_index(order, &info);
697}
d7a5752c
MG
698#endif
699
0d6617c7 700#if defined(CONFIG_PROC_FS) || defined(CONFIG_SYSFS) || defined(CONFIG_NUMA)
fa25c503
KM
701#ifdef CONFIG_ZONE_DMA
702#define TEXT_FOR_DMA(xx) xx "_dma",
703#else
704#define TEXT_FOR_DMA(xx)
705#endif
706
707#ifdef CONFIG_ZONE_DMA32
708#define TEXT_FOR_DMA32(xx) xx "_dma32",
709#else
710#define TEXT_FOR_DMA32(xx)
711#endif
712
713#ifdef CONFIG_HIGHMEM
714#define TEXT_FOR_HIGHMEM(xx) xx "_high",
715#else
716#define TEXT_FOR_HIGHMEM(xx)
717#endif
718
719#define TEXTS_FOR_ZONES(xx) TEXT_FOR_DMA(xx) TEXT_FOR_DMA32(xx) xx "_normal", \
720 TEXT_FOR_HIGHMEM(xx) xx "_movable",
721
722const char * const vmstat_text[] = {
09316c09 723 /* enum zone_stat_item countes */
fa25c503 724 "nr_free_pages",
81c0a2bb 725 "nr_alloc_batch",
fa25c503
KM
726 "nr_inactive_anon",
727 "nr_active_anon",
728 "nr_inactive_file",
729 "nr_active_file",
730 "nr_unevictable",
731 "nr_mlock",
732 "nr_anon_pages",
733 "nr_mapped",
734 "nr_file_pages",
735 "nr_dirty",
736 "nr_writeback",
737 "nr_slab_reclaimable",
738 "nr_slab_unreclaimable",
739 "nr_page_table_pages",
740 "nr_kernel_stack",
741 "nr_unstable",
742 "nr_bounce",
743 "nr_vmscan_write",
49ea7eb6 744 "nr_vmscan_immediate_reclaim",
fa25c503
KM
745 "nr_writeback_temp",
746 "nr_isolated_anon",
747 "nr_isolated_file",
748 "nr_shmem",
749 "nr_dirtied",
750 "nr_written",
0d5d823a 751 "nr_pages_scanned",
fa25c503
KM
752
753#ifdef CONFIG_NUMA
754 "numa_hit",
755 "numa_miss",
756 "numa_foreign",
757 "numa_interleave",
758 "numa_local",
759 "numa_other",
760#endif
a528910e
JW
761 "workingset_refault",
762 "workingset_activate",
449dd698 763 "workingset_nodereclaim",
fa25c503 764 "nr_anon_transparent_hugepages",
d1ce749a 765 "nr_free_cma",
09316c09
KK
766
767 /* enum writeback_stat_item counters */
fa25c503
KM
768 "nr_dirty_threshold",
769 "nr_dirty_background_threshold",
770
771#ifdef CONFIG_VM_EVENT_COUNTERS
09316c09 772 /* enum vm_event_item counters */
fa25c503
KM
773 "pgpgin",
774 "pgpgout",
775 "pswpin",
776 "pswpout",
777
778 TEXTS_FOR_ZONES("pgalloc")
779
780 "pgfree",
781 "pgactivate",
782 "pgdeactivate",
783
784 "pgfault",
785 "pgmajfault",
854e9ed0 786 "pglazyfreed",
fa25c503
KM
787
788 TEXTS_FOR_ZONES("pgrefill")
904249aa
YH
789 TEXTS_FOR_ZONES("pgsteal_kswapd")
790 TEXTS_FOR_ZONES("pgsteal_direct")
fa25c503
KM
791 TEXTS_FOR_ZONES("pgscan_kswapd")
792 TEXTS_FOR_ZONES("pgscan_direct")
68243e76 793 "pgscan_direct_throttle",
fa25c503
KM
794
795#ifdef CONFIG_NUMA
796 "zone_reclaim_failed",
797#endif
798 "pginodesteal",
799 "slabs_scanned",
fa25c503
KM
800 "kswapd_inodesteal",
801 "kswapd_low_wmark_hit_quickly",
802 "kswapd_high_wmark_hit_quickly",
fa25c503
KM
803 "pageoutrun",
804 "allocstall",
805
806 "pgrotated",
807
5509a5d2
DH
808 "drop_pagecache",
809 "drop_slab",
810
03c5a6e1
MG
811#ifdef CONFIG_NUMA_BALANCING
812 "numa_pte_updates",
72403b4a 813 "numa_huge_pte_updates",
03c5a6e1
MG
814 "numa_hint_faults",
815 "numa_hint_faults_local",
816 "numa_pages_migrated",
817#endif
5647bc29
MG
818#ifdef CONFIG_MIGRATION
819 "pgmigrate_success",
820 "pgmigrate_fail",
821#endif
fa25c503 822#ifdef CONFIG_COMPACTION
397487db
MG
823 "compact_migrate_scanned",
824 "compact_free_scanned",
825 "compact_isolated",
fa25c503
KM
826 "compact_stall",
827 "compact_fail",
828 "compact_success",
698b1b30 829 "compact_daemon_wake",
fa25c503
KM
830#endif
831
832#ifdef CONFIG_HUGETLB_PAGE
833 "htlb_buddy_alloc_success",
834 "htlb_buddy_alloc_fail",
835#endif
836 "unevictable_pgs_culled",
837 "unevictable_pgs_scanned",
838 "unevictable_pgs_rescued",
839 "unevictable_pgs_mlocked",
840 "unevictable_pgs_munlocked",
841 "unevictable_pgs_cleared",
842 "unevictable_pgs_stranded",
fa25c503
KM
843
844#ifdef CONFIG_TRANSPARENT_HUGEPAGE
845 "thp_fault_alloc",
846 "thp_fault_fallback",
847 "thp_collapse_alloc",
848 "thp_collapse_alloc_failed",
122afea9
KS
849 "thp_split_page",
850 "thp_split_page_failed",
851 "thp_split_pmd",
d8a8e1f0
KS
852 "thp_zero_page_alloc",
853 "thp_zero_page_alloc_failed",
fa25c503 854#endif
09316c09
KK
855#ifdef CONFIG_MEMORY_BALLOON
856 "balloon_inflate",
857 "balloon_deflate",
858#ifdef CONFIG_BALLOON_COMPACTION
859 "balloon_migrate",
860#endif
861#endif /* CONFIG_MEMORY_BALLOON */
ec659934 862#ifdef CONFIG_DEBUG_TLBFLUSH
6df46865 863#ifdef CONFIG_SMP
9824cf97
DH
864 "nr_tlb_remote_flush",
865 "nr_tlb_remote_flush_received",
ec659934 866#endif /* CONFIG_SMP */
9824cf97
DH
867 "nr_tlb_local_flush_all",
868 "nr_tlb_local_flush_one",
ec659934 869#endif /* CONFIG_DEBUG_TLBFLUSH */
fa25c503 870
4f115147
DB
871#ifdef CONFIG_DEBUG_VM_VMACACHE
872 "vmacache_find_calls",
873 "vmacache_find_hits",
f5f302e2 874 "vmacache_full_flushes",
4f115147 875#endif
fa25c503
KM
876#endif /* CONFIG_VM_EVENTS_COUNTERS */
877};
0d6617c7 878#endif /* CONFIG_PROC_FS || CONFIG_SYSFS || CONFIG_NUMA */
fa25c503
KM
879
880
3c486871
AM
881#if (defined(CONFIG_DEBUG_FS) && defined(CONFIG_COMPACTION)) || \
882 defined(CONFIG_PROC_FS)
883static void *frag_start(struct seq_file *m, loff_t *pos)
884{
885 pg_data_t *pgdat;
886 loff_t node = *pos;
887
888 for (pgdat = first_online_pgdat();
889 pgdat && node;
890 pgdat = next_online_pgdat(pgdat))
891 --node;
892
893 return pgdat;
894}
895
896static void *frag_next(struct seq_file *m, void *arg, loff_t *pos)
897{
898 pg_data_t *pgdat = (pg_data_t *)arg;
899
900 (*pos)++;
901 return next_online_pgdat(pgdat);
902}
903
904static void frag_stop(struct seq_file *m, void *arg)
905{
906}
907
908/* Walk all the zones in a node and print using a callback */
909static void walk_zones_in_node(struct seq_file *m, pg_data_t *pgdat,
910 void (*print)(struct seq_file *m, pg_data_t *, struct zone *))
911{
912 struct zone *zone;
913 struct zone *node_zones = pgdat->node_zones;
914 unsigned long flags;
915
916 for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) {
917 if (!populated_zone(zone))
918 continue;
919
920 spin_lock_irqsave(&zone->lock, flags);
921 print(m, pgdat, zone);
922 spin_unlock_irqrestore(&zone->lock, flags);
923 }
924}
925#endif
926
d7a5752c 927#ifdef CONFIG_PROC_FS
467c996c
MG
928static void frag_show_print(struct seq_file *m, pg_data_t *pgdat,
929 struct zone *zone)
930{
931 int order;
932
933 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
934 for (order = 0; order < MAX_ORDER; ++order)
935 seq_printf(m, "%6lu ", zone->free_area[order].nr_free);
936 seq_putc(m, '\n');
937}
938
939/*
940 * This walks the free areas for each zone.
941 */
942static int frag_show(struct seq_file *m, void *arg)
943{
944 pg_data_t *pgdat = (pg_data_t *)arg;
945 walk_zones_in_node(m, pgdat, frag_show_print);
946 return 0;
947}
948
949static void pagetypeinfo_showfree_print(struct seq_file *m,
950 pg_data_t *pgdat, struct zone *zone)
951{
952 int order, mtype;
953
954 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++) {
955 seq_printf(m, "Node %4d, zone %8s, type %12s ",
956 pgdat->node_id,
957 zone->name,
958 migratetype_names[mtype]);
959 for (order = 0; order < MAX_ORDER; ++order) {
960 unsigned long freecount = 0;
961 struct free_area *area;
962 struct list_head *curr;
963
964 area = &(zone->free_area[order]);
965
966 list_for_each(curr, &area->free_list[mtype])
967 freecount++;
968 seq_printf(m, "%6lu ", freecount);
969 }
f6ac2354
CL
970 seq_putc(m, '\n');
971 }
467c996c
MG
972}
973
974/* Print out the free pages at each order for each migatetype */
975static int pagetypeinfo_showfree(struct seq_file *m, void *arg)
976{
977 int order;
978 pg_data_t *pgdat = (pg_data_t *)arg;
979
980 /* Print header */
981 seq_printf(m, "%-43s ", "Free pages count per migrate type at order");
982 for (order = 0; order < MAX_ORDER; ++order)
983 seq_printf(m, "%6d ", order);
984 seq_putc(m, '\n');
985
986 walk_zones_in_node(m, pgdat, pagetypeinfo_showfree_print);
987
988 return 0;
989}
990
991static void pagetypeinfo_showblockcount_print(struct seq_file *m,
992 pg_data_t *pgdat, struct zone *zone)
993{
994 int mtype;
995 unsigned long pfn;
996 unsigned long start_pfn = zone->zone_start_pfn;
108bcc96 997 unsigned long end_pfn = zone_end_pfn(zone);
467c996c
MG
998 unsigned long count[MIGRATE_TYPES] = { 0, };
999
1000 for (pfn = start_pfn; pfn < end_pfn; pfn += pageblock_nr_pages) {
1001 struct page *page;
1002
1003 if (!pfn_valid(pfn))
1004 continue;
1005
1006 page = pfn_to_page(pfn);
eb33575c
MG
1007
1008 /* Watch for unexpected holes punched in the memmap */
1009 if (!memmap_valid_within(pfn, page, zone))
e80d6a24 1010 continue;
eb33575c 1011
467c996c
MG
1012 mtype = get_pageblock_migratetype(page);
1013
e80d6a24
MG
1014 if (mtype < MIGRATE_TYPES)
1015 count[mtype]++;
467c996c
MG
1016 }
1017
1018 /* Print counts */
1019 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
1020 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1021 seq_printf(m, "%12lu ", count[mtype]);
1022 seq_putc(m, '\n');
1023}
1024
1025/* Print out the free pages at each order for each migratetype */
1026static int pagetypeinfo_showblockcount(struct seq_file *m, void *arg)
1027{
1028 int mtype;
1029 pg_data_t *pgdat = (pg_data_t *)arg;
1030
1031 seq_printf(m, "\n%-23s", "Number of blocks type ");
1032 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1033 seq_printf(m, "%12s ", migratetype_names[mtype]);
1034 seq_putc(m, '\n');
1035 walk_zones_in_node(m, pgdat, pagetypeinfo_showblockcount_print);
1036
1037 return 0;
1038}
1039
48c96a36
JK
1040#ifdef CONFIG_PAGE_OWNER
1041static void pagetypeinfo_showmixedcount_print(struct seq_file *m,
1042 pg_data_t *pgdat,
1043 struct zone *zone)
1044{
1045 struct page *page;
1046 struct page_ext *page_ext;
1047 unsigned long pfn = zone->zone_start_pfn, block_end_pfn;
1048 unsigned long end_pfn = pfn + zone->spanned_pages;
1049 unsigned long count[MIGRATE_TYPES] = { 0, };
1050 int pageblock_mt, page_mt;
1051 int i;
1052
1053 /* Scan block by block. First and last block may be incomplete */
1054 pfn = zone->zone_start_pfn;
1055
1056 /*
1057 * Walk the zone in pageblock_nr_pages steps. If a page block spans
1058 * a zone boundary, it will be double counted between zones. This does
1059 * not matter as the mixed block count will still be correct
1060 */
1061 for (; pfn < end_pfn; ) {
1062 if (!pfn_valid(pfn)) {
1063 pfn = ALIGN(pfn + 1, MAX_ORDER_NR_PAGES);
1064 continue;
1065 }
1066
1067 block_end_pfn = ALIGN(pfn + 1, pageblock_nr_pages);
1068 block_end_pfn = min(block_end_pfn, end_pfn);
1069
1070 page = pfn_to_page(pfn);
1071 pageblock_mt = get_pfnblock_migratetype(page, pfn);
1072
1073 for (; pfn < block_end_pfn; pfn++) {
1074 if (!pfn_valid_within(pfn))
1075 continue;
1076
1077 page = pfn_to_page(pfn);
1078 if (PageBuddy(page)) {
1079 pfn += (1UL << page_order(page)) - 1;
1080 continue;
1081 }
1082
1083 if (PageReserved(page))
1084 continue;
1085
1086 page_ext = lookup_page_ext(page);
1087
1088 if (!test_bit(PAGE_EXT_OWNER, &page_ext->flags))
1089 continue;
1090
1091 page_mt = gfpflags_to_migratetype(page_ext->gfp_mask);
1092 if (pageblock_mt != page_mt) {
1093 if (is_migrate_cma(pageblock_mt))
1094 count[MIGRATE_MOVABLE]++;
1095 else
1096 count[pageblock_mt]++;
1097
1098 pfn = block_end_pfn;
1099 break;
1100 }
1101 pfn += (1UL << page_ext->order) - 1;
1102 }
1103 }
1104
1105 /* Print counts */
1106 seq_printf(m, "Node %d, zone %8s ", pgdat->node_id, zone->name);
1107 for (i = 0; i < MIGRATE_TYPES; i++)
1108 seq_printf(m, "%12lu ", count[i]);
1109 seq_putc(m, '\n');
1110}
1111#endif /* CONFIG_PAGE_OWNER */
1112
1113/*
1114 * Print out the number of pageblocks for each migratetype that contain pages
1115 * of other types. This gives an indication of how well fallbacks are being
1116 * contained by rmqueue_fallback(). It requires information from PAGE_OWNER
1117 * to determine what is going on
1118 */
1119static void pagetypeinfo_showmixedcount(struct seq_file *m, pg_data_t *pgdat)
1120{
1121#ifdef CONFIG_PAGE_OWNER
1122 int mtype;
1123
7dd80b8a 1124 if (!static_branch_unlikely(&page_owner_inited))
48c96a36
JK
1125 return;
1126
1127 drain_all_pages(NULL);
1128
1129 seq_printf(m, "\n%-23s", "Number of mixed blocks ");
1130 for (mtype = 0; mtype < MIGRATE_TYPES; mtype++)
1131 seq_printf(m, "%12s ", migratetype_names[mtype]);
1132 seq_putc(m, '\n');
1133
1134 walk_zones_in_node(m, pgdat, pagetypeinfo_showmixedcount_print);
1135#endif /* CONFIG_PAGE_OWNER */
1136}
1137
467c996c
MG
1138/*
1139 * This prints out statistics in relation to grouping pages by mobility.
1140 * It is expensive to collect so do not constantly read the file.
1141 */
1142static int pagetypeinfo_show(struct seq_file *m, void *arg)
1143{
1144 pg_data_t *pgdat = (pg_data_t *)arg;
1145
41b25a37 1146 /* check memoryless node */
a47b53c5 1147 if (!node_state(pgdat->node_id, N_MEMORY))
41b25a37
KM
1148 return 0;
1149
467c996c
MG
1150 seq_printf(m, "Page block order: %d\n", pageblock_order);
1151 seq_printf(m, "Pages per block: %lu\n", pageblock_nr_pages);
1152 seq_putc(m, '\n');
1153 pagetypeinfo_showfree(m, pgdat);
1154 pagetypeinfo_showblockcount(m, pgdat);
48c96a36 1155 pagetypeinfo_showmixedcount(m, pgdat);
467c996c 1156
f6ac2354
CL
1157 return 0;
1158}
1159
8f32f7e5 1160static const struct seq_operations fragmentation_op = {
f6ac2354
CL
1161 .start = frag_start,
1162 .next = frag_next,
1163 .stop = frag_stop,
1164 .show = frag_show,
1165};
1166
8f32f7e5
AD
1167static int fragmentation_open(struct inode *inode, struct file *file)
1168{
1169 return seq_open(file, &fragmentation_op);
1170}
1171
1172static const struct file_operations fragmentation_file_operations = {
1173 .open = fragmentation_open,
1174 .read = seq_read,
1175 .llseek = seq_lseek,
1176 .release = seq_release,
1177};
1178
74e2e8e8 1179static const struct seq_operations pagetypeinfo_op = {
467c996c
MG
1180 .start = frag_start,
1181 .next = frag_next,
1182 .stop = frag_stop,
1183 .show = pagetypeinfo_show,
1184};
1185
74e2e8e8
AD
1186static int pagetypeinfo_open(struct inode *inode, struct file *file)
1187{
1188 return seq_open(file, &pagetypeinfo_op);
1189}
1190
1191static const struct file_operations pagetypeinfo_file_ops = {
1192 .open = pagetypeinfo_open,
1193 .read = seq_read,
1194 .llseek = seq_lseek,
1195 .release = seq_release,
1196};
1197
467c996c
MG
1198static void zoneinfo_show_print(struct seq_file *m, pg_data_t *pgdat,
1199 struct zone *zone)
f6ac2354 1200{
467c996c
MG
1201 int i;
1202 seq_printf(m, "Node %d, zone %8s", pgdat->node_id, zone->name);
1203 seq_printf(m,
1204 "\n pages free %lu"
1205 "\n min %lu"
1206 "\n low %lu"
1207 "\n high %lu"
08d9ae7c 1208 "\n scanned %lu"
467c996c 1209 "\n spanned %lu"
9feedc9d
JL
1210 "\n present %lu"
1211 "\n managed %lu",
88f5acf8 1212 zone_page_state(zone, NR_FREE_PAGES),
41858966
MG
1213 min_wmark_pages(zone),
1214 low_wmark_pages(zone),
1215 high_wmark_pages(zone),
0d5d823a 1216 zone_page_state(zone, NR_PAGES_SCANNED),
467c996c 1217 zone->spanned_pages,
9feedc9d
JL
1218 zone->present_pages,
1219 zone->managed_pages);
467c996c
MG
1220
1221 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
1222 seq_printf(m, "\n %-12s %lu", vmstat_text[i],
1223 zone_page_state(zone, i));
1224
1225 seq_printf(m,
3484b2de 1226 "\n protection: (%ld",
467c996c
MG
1227 zone->lowmem_reserve[0]);
1228 for (i = 1; i < ARRAY_SIZE(zone->lowmem_reserve); i++)
3484b2de 1229 seq_printf(m, ", %ld", zone->lowmem_reserve[i]);
467c996c
MG
1230 seq_printf(m,
1231 ")"
1232 "\n pagesets");
1233 for_each_online_cpu(i) {
1234 struct per_cpu_pageset *pageset;
467c996c 1235
99dcc3e5 1236 pageset = per_cpu_ptr(zone->pageset, i);
3dfa5721
CL
1237 seq_printf(m,
1238 "\n cpu: %i"
1239 "\n count: %i"
1240 "\n high: %i"
1241 "\n batch: %i",
1242 i,
1243 pageset->pcp.count,
1244 pageset->pcp.high,
1245 pageset->pcp.batch);
df9ecaba 1246#ifdef CONFIG_SMP
467c996c
MG
1247 seq_printf(m, "\n vm stats threshold: %d",
1248 pageset->stat_threshold);
df9ecaba 1249#endif
f6ac2354 1250 }
467c996c
MG
1251 seq_printf(m,
1252 "\n all_unreclaimable: %u"
556adecb
RR
1253 "\n start_pfn: %lu"
1254 "\n inactive_ratio: %u",
6e543d57 1255 !zone_reclaimable(zone),
556adecb
RR
1256 zone->zone_start_pfn,
1257 zone->inactive_ratio);
467c996c
MG
1258 seq_putc(m, '\n');
1259}
1260
1261/*
1262 * Output information about zones in @pgdat.
1263 */
1264static int zoneinfo_show(struct seq_file *m, void *arg)
1265{
1266 pg_data_t *pgdat = (pg_data_t *)arg;
1267 walk_zones_in_node(m, pgdat, zoneinfo_show_print);
f6ac2354
CL
1268 return 0;
1269}
1270
5c9fe628 1271static const struct seq_operations zoneinfo_op = {
f6ac2354
CL
1272 .start = frag_start, /* iterate over all zones. The same as in
1273 * fragmentation. */
1274 .next = frag_next,
1275 .stop = frag_stop,
1276 .show = zoneinfo_show,
1277};
1278
5c9fe628
AD
1279static int zoneinfo_open(struct inode *inode, struct file *file)
1280{
1281 return seq_open(file, &zoneinfo_op);
1282}
1283
1284static const struct file_operations proc_zoneinfo_file_operations = {
1285 .open = zoneinfo_open,
1286 .read = seq_read,
1287 .llseek = seq_lseek,
1288 .release = seq_release,
1289};
1290
79da826a
MR
1291enum writeback_stat_item {
1292 NR_DIRTY_THRESHOLD,
1293 NR_DIRTY_BG_THRESHOLD,
1294 NR_VM_WRITEBACK_STAT_ITEMS,
1295};
1296
f6ac2354
CL
1297static void *vmstat_start(struct seq_file *m, loff_t *pos)
1298{
2244b95a 1299 unsigned long *v;
79da826a 1300 int i, stat_items_size;
f6ac2354
CL
1301
1302 if (*pos >= ARRAY_SIZE(vmstat_text))
1303 return NULL;
79da826a
MR
1304 stat_items_size = NR_VM_ZONE_STAT_ITEMS * sizeof(unsigned long) +
1305 NR_VM_WRITEBACK_STAT_ITEMS * sizeof(unsigned long);
f6ac2354 1306
f8891e5e 1307#ifdef CONFIG_VM_EVENT_COUNTERS
79da826a 1308 stat_items_size += sizeof(struct vm_event_state);
f8891e5e 1309#endif
79da826a
MR
1310
1311 v = kmalloc(stat_items_size, GFP_KERNEL);
2244b95a
CL
1312 m->private = v;
1313 if (!v)
f6ac2354 1314 return ERR_PTR(-ENOMEM);
2244b95a
CL
1315 for (i = 0; i < NR_VM_ZONE_STAT_ITEMS; i++)
1316 v[i] = global_page_state(i);
79da826a
MR
1317 v += NR_VM_ZONE_STAT_ITEMS;
1318
1319 global_dirty_limits(v + NR_DIRTY_BG_THRESHOLD,
1320 v + NR_DIRTY_THRESHOLD);
1321 v += NR_VM_WRITEBACK_STAT_ITEMS;
1322
f8891e5e 1323#ifdef CONFIG_VM_EVENT_COUNTERS
79da826a
MR
1324 all_vm_events(v);
1325 v[PGPGIN] /= 2; /* sectors -> kbytes */
1326 v[PGPGOUT] /= 2;
f8891e5e 1327#endif
ff8b16d7 1328 return (unsigned long *)m->private + *pos;
f6ac2354
CL
1329}
1330
1331static void *vmstat_next(struct seq_file *m, void *arg, loff_t *pos)
1332{
1333 (*pos)++;
1334 if (*pos >= ARRAY_SIZE(vmstat_text))
1335 return NULL;
1336 return (unsigned long *)m->private + *pos;
1337}
1338
1339static int vmstat_show(struct seq_file *m, void *arg)
1340{
1341 unsigned long *l = arg;
1342 unsigned long off = l - (unsigned long *)m->private;
1343
1344 seq_printf(m, "%s %lu\n", vmstat_text[off], *l);
1345 return 0;
1346}
1347
1348static void vmstat_stop(struct seq_file *m, void *arg)
1349{
1350 kfree(m->private);
1351 m->private = NULL;
1352}
1353
b6aa44ab 1354static const struct seq_operations vmstat_op = {
f6ac2354
CL
1355 .start = vmstat_start,
1356 .next = vmstat_next,
1357 .stop = vmstat_stop,
1358 .show = vmstat_show,
1359};
1360
b6aa44ab
AD
1361static int vmstat_open(struct inode *inode, struct file *file)
1362{
1363 return seq_open(file, &vmstat_op);
1364}
1365
1366static const struct file_operations proc_vmstat_file_operations = {
1367 .open = vmstat_open,
1368 .read = seq_read,
1369 .llseek = seq_lseek,
1370 .release = seq_release,
1371};
f6ac2354
CL
1372#endif /* CONFIG_PROC_FS */
1373
df9ecaba 1374#ifdef CONFIG_SMP
373ccbe5 1375static struct workqueue_struct *vmstat_wq;
d1187ed2 1376static DEFINE_PER_CPU(struct delayed_work, vmstat_work);
77461ab3 1377int sysctl_stat_interval __read_mostly = HZ;
7cc36bbd 1378static cpumask_var_t cpu_stat_off;
d1187ed2
CL
1379
1380static void vmstat_update(struct work_struct *w)
1381{
0eb77e98 1382 if (refresh_cpu_vm_stats(true)) {
7cc36bbd
CL
1383 /*
1384 * Counters were updated so we expect more updates
1385 * to occur in the future. Keep on running the
1386 * update worker thread.
f01f17d3
MH
1387 * If we were marked on cpu_stat_off clear the flag
1388 * so that vmstat_shepherd doesn't schedule us again.
7cc36bbd 1389 */
f01f17d3
MH
1390 if (!cpumask_test_and_clear_cpu(smp_processor_id(),
1391 cpu_stat_off)) {
1392 queue_delayed_work_on(smp_processor_id(), vmstat_wq,
1393 this_cpu_ptr(&vmstat_work),
1394 round_jiffies_relative(sysctl_stat_interval));
1395 }
176bed1d 1396 } else {
7cc36bbd
CL
1397 /*
1398 * We did not update any counters so the app may be in
1399 * a mode where it does not cause counter updates.
1400 * We may be uselessly running vmstat_update.
1401 * Defer the checking for differentials to the
1402 * shepherd thread on a different processor.
1403 */
587198ba 1404 cpumask_set_cpu(smp_processor_id(), cpu_stat_off);
7cc36bbd
CL
1405 }
1406}
1407
0eb77e98
CL
1408/*
1409 * Switch off vmstat processing and then fold all the remaining differentials
1410 * until the diffs stay at zero. The function is used by NOHZ and can only be
1411 * invoked when tick processing is not active.
1412 */
7cc36bbd
CL
1413/*
1414 * Check if the diffs for a certain cpu indicate that
1415 * an update is needed.
1416 */
1417static bool need_update(int cpu)
1418{
1419 struct zone *zone;
1420
1421 for_each_populated_zone(zone) {
1422 struct per_cpu_pageset *p = per_cpu_ptr(zone->pageset, cpu);
1423
1424 BUILD_BUG_ON(sizeof(p->vm_stat_diff[0]) != 1);
1425 /*
1426 * The fast way of checking if there are any vmstat diffs.
1427 * This works because the diffs are byte sized items.
1428 */
1429 if (memchr_inv(p->vm_stat_diff, 0, NR_VM_ZONE_STAT_ITEMS))
1430 return true;
1431
1432 }
1433 return false;
1434}
1435
f01f17d3
MH
1436void quiet_vmstat(void)
1437{
1438 if (system_state != SYSTEM_RUNNING)
1439 return;
1440
1441 /*
1442 * If we are already in hands of the shepherd then there
1443 * is nothing for us to do here.
1444 */
1445 if (cpumask_test_and_set_cpu(smp_processor_id(), cpu_stat_off))
1446 return;
1447
1448 if (!need_update(smp_processor_id()))
1449 return;
1450
1451 /*
1452 * Just refresh counters and do not care about the pending delayed
1453 * vmstat_update. It doesn't fire that often to matter and canceling
1454 * it would be too expensive from this path.
1455 * vmstat_shepherd will take care about that for us.
1456 */
1457 refresh_cpu_vm_stats(false);
1458}
1459
7cc36bbd
CL
1460
1461/*
1462 * Shepherd worker thread that checks the
1463 * differentials of processors that have their worker
1464 * threads for vm statistics updates disabled because of
1465 * inactivity.
1466 */
1467static void vmstat_shepherd(struct work_struct *w);
1468
0eb77e98 1469static DECLARE_DEFERRABLE_WORK(shepherd, vmstat_shepherd);
7cc36bbd
CL
1470
1471static void vmstat_shepherd(struct work_struct *w)
1472{
1473 int cpu;
1474
1475 get_online_cpus();
1476 /* Check processors whose vmstat worker threads have been disabled */
f01f17d3
MH
1477 for_each_cpu(cpu, cpu_stat_off) {
1478 struct delayed_work *dw = &per_cpu(vmstat_work, cpu);
7cc36bbd 1479
f01f17d3
MH
1480 if (need_update(cpu)) {
1481 if (cpumask_test_and_clear_cpu(cpu, cpu_stat_off))
1482 queue_delayed_work_on(cpu, vmstat_wq, dw, 0);
1483 } else {
1484 /*
1485 * Cancel the work if quiet_vmstat has put this
1486 * cpu on cpu_stat_off because the work item might
1487 * be still scheduled
1488 */
1489 cancel_delayed_work(dw);
1490 }
1491 }
7cc36bbd
CL
1492 put_online_cpus();
1493
1494 schedule_delayed_work(&shepherd,
98f4ebb2 1495 round_jiffies_relative(sysctl_stat_interval));
d1187ed2
CL
1496}
1497
7cc36bbd 1498static void __init start_shepherd_timer(void)
d1187ed2 1499{
7cc36bbd
CL
1500 int cpu;
1501
1502 for_each_possible_cpu(cpu)
ccde8bd4 1503 INIT_DEFERRABLE_WORK(per_cpu_ptr(&vmstat_work, cpu),
7cc36bbd
CL
1504 vmstat_update);
1505
1506 if (!alloc_cpumask_var(&cpu_stat_off, GFP_KERNEL))
1507 BUG();
1508 cpumask_copy(cpu_stat_off, cpu_online_mask);
d1187ed2 1509
751e5f5c 1510 vmstat_wq = alloc_workqueue("vmstat", WQ_FREEZABLE|WQ_MEM_RECLAIM, 0);
7cc36bbd
CL
1511 schedule_delayed_work(&shepherd,
1512 round_jiffies_relative(sysctl_stat_interval));
d1187ed2
CL
1513}
1514
807a1bd2
TK
1515static void vmstat_cpu_dead(int node)
1516{
1517 int cpu;
1518
1519 get_online_cpus();
1520 for_each_online_cpu(cpu)
1521 if (cpu_to_node(cpu) == node)
1522 goto end;
1523
1524 node_clear_state(node, N_CPU);
1525end:
1526 put_online_cpus();
1527}
1528
df9ecaba
CL
1529/*
1530 * Use the cpu notifier to insure that the thresholds are recalculated
1531 * when necessary.
1532 */
0db0628d 1533static int vmstat_cpuup_callback(struct notifier_block *nfb,
df9ecaba
CL
1534 unsigned long action,
1535 void *hcpu)
1536{
d1187ed2
CL
1537 long cpu = (long)hcpu;
1538
df9ecaba 1539 switch (action) {
d1187ed2
CL
1540 case CPU_ONLINE:
1541 case CPU_ONLINE_FROZEN:
5ee28a44 1542 refresh_zone_stat_thresholds();
ad596925 1543 node_set_state(cpu_to_node(cpu), N_CPU);
7cc36bbd 1544 cpumask_set_cpu(cpu, cpu_stat_off);
d1187ed2
CL
1545 break;
1546 case CPU_DOWN_PREPARE:
1547 case CPU_DOWN_PREPARE_FROZEN:
afe2c511 1548 cancel_delayed_work_sync(&per_cpu(vmstat_work, cpu));
7cc36bbd 1549 cpumask_clear_cpu(cpu, cpu_stat_off);
d1187ed2
CL
1550 break;
1551 case CPU_DOWN_FAILED:
1552 case CPU_DOWN_FAILED_FROZEN:
7cc36bbd 1553 cpumask_set_cpu(cpu, cpu_stat_off);
d1187ed2 1554 break;
ce421c79 1555 case CPU_DEAD:
8bb78442 1556 case CPU_DEAD_FROZEN:
ce421c79 1557 refresh_zone_stat_thresholds();
807a1bd2 1558 vmstat_cpu_dead(cpu_to_node(cpu));
ce421c79
AW
1559 break;
1560 default:
1561 break;
df9ecaba
CL
1562 }
1563 return NOTIFY_OK;
1564}
1565
0db0628d 1566static struct notifier_block vmstat_notifier =
df9ecaba 1567 { &vmstat_cpuup_callback, NULL, 0 };
8f32f7e5 1568#endif
df9ecaba 1569
e2fc88d0 1570static int __init setup_vmstat(void)
df9ecaba 1571{
8f32f7e5 1572#ifdef CONFIG_SMP
0be94bad
SB
1573 cpu_notifier_register_begin();
1574 __register_cpu_notifier(&vmstat_notifier);
d1187ed2 1575
7cc36bbd 1576 start_shepherd_timer();
0be94bad 1577 cpu_notifier_register_done();
8f32f7e5
AD
1578#endif
1579#ifdef CONFIG_PROC_FS
1580 proc_create("buddyinfo", S_IRUGO, NULL, &fragmentation_file_operations);
74e2e8e8 1581 proc_create("pagetypeinfo", S_IRUGO, NULL, &pagetypeinfo_file_ops);
b6aa44ab 1582 proc_create("vmstat", S_IRUGO, NULL, &proc_vmstat_file_operations);
5c9fe628 1583 proc_create("zoneinfo", S_IRUGO, NULL, &proc_zoneinfo_file_operations);
8f32f7e5 1584#endif
df9ecaba
CL
1585 return 0;
1586}
1587module_init(setup_vmstat)
d7a5752c
MG
1588
1589#if defined(CONFIG_DEBUG_FS) && defined(CONFIG_COMPACTION)
d7a5752c
MG
1590
1591/*
1592 * Return an index indicating how much of the available free memory is
1593 * unusable for an allocation of the requested size.
1594 */
1595static int unusable_free_index(unsigned int order,
1596 struct contig_page_info *info)
1597{
1598 /* No free memory is interpreted as all free memory is unusable */
1599 if (info->free_pages == 0)
1600 return 1000;
1601
1602 /*
1603 * Index should be a value between 0 and 1. Return a value to 3
1604 * decimal places.
1605 *
1606 * 0 => no fragmentation
1607 * 1 => high fragmentation
1608 */
1609 return div_u64((info->free_pages - (info->free_blocks_suitable << order)) * 1000ULL, info->free_pages);
1610
1611}
1612
1613static void unusable_show_print(struct seq_file *m,
1614 pg_data_t *pgdat, struct zone *zone)
1615{
1616 unsigned int order;
1617 int index;
1618 struct contig_page_info info;
1619
1620 seq_printf(m, "Node %d, zone %8s ",
1621 pgdat->node_id,
1622 zone->name);
1623 for (order = 0; order < MAX_ORDER; ++order) {
1624 fill_contig_page_info(zone, order, &info);
1625 index = unusable_free_index(order, &info);
1626 seq_printf(m, "%d.%03d ", index / 1000, index % 1000);
1627 }
1628
1629 seq_putc(m, '\n');
1630}
1631
1632/*
1633 * Display unusable free space index
1634 *
1635 * The unusable free space index measures how much of the available free
1636 * memory cannot be used to satisfy an allocation of a given size and is a
1637 * value between 0 and 1. The higher the value, the more of free memory is
1638 * unusable and by implication, the worse the external fragmentation is. This
1639 * can be expressed as a percentage by multiplying by 100.
1640 */
1641static int unusable_show(struct seq_file *m, void *arg)
1642{
1643 pg_data_t *pgdat = (pg_data_t *)arg;
1644
1645 /* check memoryless node */
a47b53c5 1646 if (!node_state(pgdat->node_id, N_MEMORY))
d7a5752c
MG
1647 return 0;
1648
1649 walk_zones_in_node(m, pgdat, unusable_show_print);
1650
1651 return 0;
1652}
1653
1654static const struct seq_operations unusable_op = {
1655 .start = frag_start,
1656 .next = frag_next,
1657 .stop = frag_stop,
1658 .show = unusable_show,
1659};
1660
1661static int unusable_open(struct inode *inode, struct file *file)
1662{
1663 return seq_open(file, &unusable_op);
1664}
1665
1666static const struct file_operations unusable_file_ops = {
1667 .open = unusable_open,
1668 .read = seq_read,
1669 .llseek = seq_lseek,
1670 .release = seq_release,
1671};
1672
f1a5ab12
MG
1673static void extfrag_show_print(struct seq_file *m,
1674 pg_data_t *pgdat, struct zone *zone)
1675{
1676 unsigned int order;
1677 int index;
1678
1679 /* Alloc on stack as interrupts are disabled for zone walk */
1680 struct contig_page_info info;
1681
1682 seq_printf(m, "Node %d, zone %8s ",
1683 pgdat->node_id,
1684 zone->name);
1685 for (order = 0; order < MAX_ORDER; ++order) {
1686 fill_contig_page_info(zone, order, &info);
56de7263 1687 index = __fragmentation_index(order, &info);
f1a5ab12
MG
1688 seq_printf(m, "%d.%03d ", index / 1000, index % 1000);
1689 }
1690
1691 seq_putc(m, '\n');
1692}
1693
1694/*
1695 * Display fragmentation index for orders that allocations would fail for
1696 */
1697static int extfrag_show(struct seq_file *m, void *arg)
1698{
1699 pg_data_t *pgdat = (pg_data_t *)arg;
1700
1701 walk_zones_in_node(m, pgdat, extfrag_show_print);
1702
1703 return 0;
1704}
1705
1706static const struct seq_operations extfrag_op = {
1707 .start = frag_start,
1708 .next = frag_next,
1709 .stop = frag_stop,
1710 .show = extfrag_show,
1711};
1712
1713static int extfrag_open(struct inode *inode, struct file *file)
1714{
1715 return seq_open(file, &extfrag_op);
1716}
1717
1718static const struct file_operations extfrag_file_ops = {
1719 .open = extfrag_open,
1720 .read = seq_read,
1721 .llseek = seq_lseek,
1722 .release = seq_release,
1723};
1724
d7a5752c
MG
1725static int __init extfrag_debug_init(void)
1726{
bde8bd8a
S
1727 struct dentry *extfrag_debug_root;
1728
d7a5752c
MG
1729 extfrag_debug_root = debugfs_create_dir("extfrag", NULL);
1730 if (!extfrag_debug_root)
1731 return -ENOMEM;
1732
1733 if (!debugfs_create_file("unusable_index", 0444,
1734 extfrag_debug_root, NULL, &unusable_file_ops))
bde8bd8a 1735 goto fail;
d7a5752c 1736
f1a5ab12
MG
1737 if (!debugfs_create_file("extfrag_index", 0444,
1738 extfrag_debug_root, NULL, &extfrag_file_ops))
bde8bd8a 1739 goto fail;
f1a5ab12 1740
d7a5752c 1741 return 0;
bde8bd8a
S
1742fail:
1743 debugfs_remove_recursive(extfrag_debug_root);
1744 return -ENOMEM;
d7a5752c
MG
1745}
1746
1747module_init(extfrag_debug_init);
1748#endif