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