blob: f6026dbcdf6b3beca15ae315dcb858b6361849da [file] [log] [blame]
Thomas Gleixner55716d22019-06-01 10:08:42 +02001// SPDX-License-Identifier: GPL-2.0-only
Dennis Zhou30a5b532017-06-19 19:28:31 -04002/*
3 * mm/percpu-debug.c
4 *
5 * Copyright (C) 2017 Facebook Inc.
Dennis Zhoubfacd382020-04-01 10:07:48 -07006 * Copyright (C) 2017 Dennis Zhou <dennis@kernel.org>
Dennis Zhou30a5b532017-06-19 19:28:31 -04007 *
Dennis Zhou30a5b532017-06-19 19:28:31 -04008 * Prints statistics about the percpu allocator and backing chunks.
9 */
10#include <linux/debugfs.h>
11#include <linux/list.h>
12#include <linux/percpu.h>
13#include <linux/seq_file.h>
14#include <linux/sort.h>
15#include <linux/vmalloc.h>
16
17#include "percpu-internal.h"
18
19#define P(X, Y) \
Dennis Zhou (Facebook)02459162017-07-15 22:23:07 -040020 seq_printf(m, " %-20s: %12lld\n", X, (long long int)Y)
Dennis Zhou30a5b532017-06-19 19:28:31 -040021
22struct percpu_stats pcpu_stats;
23struct pcpu_alloc_info pcpu_stats_ai;
24
25static int cmpint(const void *a, const void *b)
26{
27 return *(int *)a - *(int *)b;
28}
29
30/*
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070031 * Iterates over all chunks to find the max nr_alloc entries.
Dennis Zhou30a5b532017-06-19 19:28:31 -040032 */
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070033static int find_max_nr_alloc(void)
Dennis Zhou30a5b532017-06-19 19:28:31 -040034{
35 struct pcpu_chunk *chunk;
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070036 int slot, max_nr_alloc;
Roman Gushchin3c7be182020-08-11 18:30:17 -070037 enum pcpu_chunk_type type;
Dennis Zhou30a5b532017-06-19 19:28:31 -040038
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070039 max_nr_alloc = 0;
Roman Gushchin3c7be182020-08-11 18:30:17 -070040 for (type = 0; type < PCPU_NR_CHUNK_TYPES; type++)
41 for (slot = 0; slot < pcpu_nr_slots; slot++)
42 list_for_each_entry(chunk, &pcpu_chunk_list(type)[slot],
43 list)
44 max_nr_alloc = max(max_nr_alloc,
45 chunk->nr_alloc);
Dennis Zhou30a5b532017-06-19 19:28:31 -040046
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070047 return max_nr_alloc;
Dennis Zhou30a5b532017-06-19 19:28:31 -040048}
49
50/*
51 * Prints out chunk state. Fragmentation is considered between
52 * the beginning of the chunk to the last allocation.
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070053 *
54 * All statistics are in bytes unless stated otherwise.
Dennis Zhou30a5b532017-06-19 19:28:31 -040055 */
56static void chunk_map_stats(struct seq_file *m, struct pcpu_chunk *chunk,
Dennis Zhou (Facebook)cd6a8842017-07-15 22:23:06 -040057 int *buffer)
Dennis Zhou30a5b532017-06-19 19:28:31 -040058{
Dennis Zhou92c14ca2019-02-26 10:00:08 -080059 struct pcpu_block_md *chunk_md = &chunk->chunk_md;
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070060 int i, last_alloc, as_len, start, end;
Dennis Zhou30a5b532017-06-19 19:28:31 -040061 int *alloc_sizes, *p;
62 /* statistics */
63 int sum_frag = 0, max_frag = 0;
64 int cur_min_alloc = 0, cur_med_alloc = 0, cur_max_alloc = 0;
65
66 alloc_sizes = buffer;
Dennis Zhou30a5b532017-06-19 19:28:31 -040067
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070068 /*
69 * find_last_bit returns the start value if nothing found.
70 * Therefore, we must determine if it is a failure of find_last_bit
71 * and set the appropriate value.
72 */
73 last_alloc = find_last_bit(chunk->alloc_map,
74 pcpu_chunk_map_bits(chunk) -
75 chunk->end_offset / PCPU_MIN_ALLOC_SIZE - 1);
76 last_alloc = test_bit(last_alloc, chunk->alloc_map) ?
77 last_alloc + 1 : 0;
78
79 as_len = 0;
Dennis Zhou2e08d202017-09-27 16:34:59 -050080 start = chunk->start_offset / PCPU_MIN_ALLOC_SIZE;
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -070081
82 /*
83 * If a bit is set in the allocation map, the bound_map identifies
84 * where the allocation ends. If the allocation is not set, the
85 * bound_map does not identify free areas as it is only kept accurate
86 * on allocation, not free.
87 *
88 * Positive values are allocations and negative values are free
89 * fragments.
90 */
91 while (start < last_alloc) {
92 if (test_bit(start, chunk->alloc_map)) {
93 end = find_next_bit(chunk->bound_map, last_alloc,
94 start + 1);
95 alloc_sizes[as_len] = 1;
96 } else {
97 end = find_next_bit(chunk->alloc_map, last_alloc,
98 start + 1);
99 alloc_sizes[as_len] = -1;
Dennis Zhou30a5b532017-06-19 19:28:31 -0400100 }
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -0700101
102 alloc_sizes[as_len++] *= (end - start) * PCPU_MIN_ALLOC_SIZE;
103
104 start = end;
Dennis Zhou30a5b532017-06-19 19:28:31 -0400105 }
106
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -0700107 /*
108 * The negative values are free fragments and thus sorting gives the
109 * free fragments at the beginning in largest first order.
110 */
111 if (as_len > 0) {
112 sort(alloc_sizes, as_len, sizeof(int), cmpint, NULL);
Dennis Zhou30a5b532017-06-19 19:28:31 -0400113
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -0700114 /* iterate through the unallocated fragments */
Dennis Zhou30a5b532017-06-19 19:28:31 -0400115 for (i = 0, p = alloc_sizes; *p < 0 && i < as_len; i++, p++) {
116 sum_frag -= *p;
117 max_frag = max(max_frag, -1 * (*p));
118 }
119
120 cur_min_alloc = alloc_sizes[i];
121 cur_med_alloc = alloc_sizes[(i + as_len - 1) / 2];
122 cur_max_alloc = alloc_sizes[as_len - 1];
123 }
124
125 P("nr_alloc", chunk->nr_alloc);
126 P("max_alloc_size", chunk->max_alloc_size);
Dennis Zhou (Facebook)0cecf502017-07-24 19:02:08 -0400127 P("empty_pop_pages", chunk->nr_empty_pop_pages);
Dennis Zhou92c14ca2019-02-26 10:00:08 -0800128 P("first_bit", chunk_md->first_free);
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -0700129 P("free_bytes", chunk->free_bytes);
Dennis Zhou92c14ca2019-02-26 10:00:08 -0800130 P("contig_bytes", chunk_md->contig_hint * PCPU_MIN_ALLOC_SIZE);
Dennis Zhou30a5b532017-06-19 19:28:31 -0400131 P("sum_frag", sum_frag);
132 P("max_frag", max_frag);
133 P("cur_min_alloc", cur_min_alloc);
134 P("cur_med_alloc", cur_med_alloc);
135 P("cur_max_alloc", cur_max_alloc);
Roman Gushchin3c7be182020-08-11 18:30:17 -0700136#ifdef CONFIG_MEMCG_KMEM
137 P("memcg_aware", pcpu_is_memcg_chunk(pcpu_chunk_type(chunk)));
138#endif
Dennis Zhou30a5b532017-06-19 19:28:31 -0400139 seq_putc(m, '\n');
140}
141
142static int percpu_stats_show(struct seq_file *m, void *v)
143{
144 struct pcpu_chunk *chunk;
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -0700145 int slot, max_nr_alloc;
Dennis Zhou (Facebook)cd6a8842017-07-15 22:23:06 -0400146 int *buffer;
Roman Gushchin3c7be182020-08-11 18:30:17 -0700147 enum pcpu_chunk_type type;
Roman Gushchin0760fa32021-04-07 20:57:33 -0700148 int nr_empty_pop_pages;
Dennis Zhou30a5b532017-06-19 19:28:31 -0400149
150alloc_buffer:
151 spin_lock_irq(&pcpu_lock);
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -0700152 max_nr_alloc = find_max_nr_alloc();
Dennis Zhou30a5b532017-06-19 19:28:31 -0400153 spin_unlock_irq(&pcpu_lock);
154
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -0700155 /* there can be at most this many free and allocated fragments */
Kees Cook42bc47b2018-06-12 14:27:11 -0700156 buffer = vmalloc(array_size(sizeof(int), (2 * max_nr_alloc + 1)));
Dennis Zhou30a5b532017-06-19 19:28:31 -0400157 if (!buffer)
158 return -ENOMEM;
159
160 spin_lock_irq(&pcpu_lock);
161
162 /* if the buffer allocated earlier is too small */
Dennis Zhou (Facebook)40064ae2017-07-12 11:27:32 -0700163 if (max_nr_alloc < find_max_nr_alloc()) {
Dennis Zhou30a5b532017-06-19 19:28:31 -0400164 spin_unlock_irq(&pcpu_lock);
165 vfree(buffer);
166 goto alloc_buffer;
167 }
168
Roman Gushchin0760fa32021-04-07 20:57:33 -0700169 nr_empty_pop_pages = 0;
170 for (type = 0; type < PCPU_NR_CHUNK_TYPES; type++)
171 nr_empty_pop_pages += pcpu_nr_empty_pop_pages[type];
172
173#define PL(X) \
Dennis Zhou (Facebook)02459162017-07-15 22:23:07 -0400174 seq_printf(m, " %-20s: %12lld\n", #X, (long long int)pcpu_stats_ai.X)
Dennis Zhou30a5b532017-06-19 19:28:31 -0400175
176 seq_printf(m,
177 "Percpu Memory Statistics\n"
178 "Allocation Info:\n"
179 "----------------------------------------\n");
180 PL(unit_size);
181 PL(static_size);
182 PL(reserved_size);
183 PL(dyn_size);
184 PL(atom_size);
185 PL(alloc_size);
186 seq_putc(m, '\n');
187
188#undef PL
189
190#define PU(X) \
Dennis Zhou (Facebook)02459162017-07-15 22:23:07 -0400191 seq_printf(m, " %-20s: %12llu\n", #X, (unsigned long long)pcpu_stats.X)
Dennis Zhou30a5b532017-06-19 19:28:31 -0400192
193 seq_printf(m,
194 "Global Stats:\n"
195 "----------------------------------------\n");
196 PU(nr_alloc);
197 PU(nr_dealloc);
198 PU(nr_cur_alloc);
199 PU(nr_max_alloc);
200 PU(nr_chunks);
201 PU(nr_max_chunks);
202 PU(min_alloc_size);
203 PU(max_alloc_size);
Roman Gushchin0760fa32021-04-07 20:57:33 -0700204 P("empty_pop_pages", nr_empty_pop_pages);
Dennis Zhou30a5b532017-06-19 19:28:31 -0400205 seq_putc(m, '\n');
206
207#undef PU
208
209 seq_printf(m,
210 "Per Chunk Stats:\n"
211 "----------------------------------------\n");
212
213 if (pcpu_reserved_chunk) {
214 seq_puts(m, "Chunk: <- Reserved Chunk\n");
215 chunk_map_stats(m, pcpu_reserved_chunk, buffer);
216 }
217
Roman Gushchin3c7be182020-08-11 18:30:17 -0700218 for (type = 0; type < PCPU_NR_CHUNK_TYPES; type++) {
219 for (slot = 0; slot < pcpu_nr_slots; slot++) {
220 list_for_each_entry(chunk, &pcpu_chunk_list(type)[slot],
221 list) {
222 if (chunk == pcpu_first_chunk) {
223 seq_puts(m, "Chunk: <- First Chunk\n");
224 chunk_map_stats(m, chunk, buffer);
225 } else {
226 seq_puts(m, "Chunk:\n");
227 chunk_map_stats(m, chunk, buffer);
228 }
Dennis Zhou30a5b532017-06-19 19:28:31 -0400229 }
Dennis Zhou30a5b532017-06-19 19:28:31 -0400230 }
231 }
232
233 spin_unlock_irq(&pcpu_lock);
234
235 vfree(buffer);
236
237 return 0;
238}
Andy Shevchenko5ad35092018-04-05 16:23:16 -0700239DEFINE_SHOW_ATTRIBUTE(percpu_stats);
Dennis Zhou30a5b532017-06-19 19:28:31 -0400240
241static int __init init_percpu_stats_debugfs(void)
242{
243 debugfs_create_file("percpu_stats", 0444, NULL, NULL,
244 &percpu_stats_fops);
245
246 return 0;
247}
248
249late_initcall(init_percpu_stats_debugfs);