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