f2fs: update memory footprint information
[deliverable/linux.git] / fs / f2fs / debug.c
CommitLineData
0a8165d7 1/*
902829aa
GKH
2 * f2fs debugging statistics
3 *
4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
6 * Copyright (c) 2012 Linux Foundation
7 * Copyright (c) 2012 Greg Kroah-Hartman <gregkh@linuxfoundation.org>
8 *
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License version 2 as
11 * published by the Free Software Foundation.
12 */
13
14#include <linux/fs.h>
15#include <linux/backing-dev.h>
902829aa
GKH
16#include <linux/f2fs_fs.h>
17#include <linux/blkdev.h>
18#include <linux/debugfs.h>
19#include <linux/seq_file.h>
20
21#include "f2fs.h"
22#include "node.h"
23#include "segment.h"
24#include "gc.h"
25
26static LIST_HEAD(f2fs_stat_list);
40e1ebe9 27static struct dentry *f2fs_debugfs_root;
66af62ce 28static DEFINE_MUTEX(f2fs_stat_mutex);
902829aa 29
25ca923b 30static void update_general_status(struct f2fs_sb_info *sbi)
902829aa 31{
963d4f7d 32 struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa
GKH
33 int i;
34
e1c42045 35 /* validation check of the segment numbers */
902829aa
GKH
36 si->hit_ext = sbi->read_hit_ext;
37 si->total_ext = sbi->total_hit_ext;
38 si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
39 si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
40 si->ndirty_dirs = sbi->n_dirty_dirs;
41 si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
8dcf2ff7 42 si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
902829aa
GKH
43 si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
44 si->rsvd_segs = reserved_segments(sbi);
45 si->overp_segs = overprovision_segments(sbi);
46 si->valid_count = valid_user_blocks(sbi);
47 si->valid_node_count = valid_node_count(sbi);
48 si->valid_inode_count = valid_inode_count(sbi);
03e14d52
CY
49 si->inline_inode = atomic_read(&sbi->inline_inode);
50 si->inline_dir = atomic_read(&sbi->inline_dir);
902829aa
GKH
51 si->utilization = utilization(sbi);
52
53 si->free_segs = free_segments(sbi);
54 si->free_secs = free_sections(sbi);
55 si->prefree_count = prefree_segments(sbi);
56 si->dirty_count = dirty_segments(sbi);
4ef51a8f 57 si->node_pages = NODE_MAPPING(sbi)->nrpages;
9df27d98 58 si->meta_pages = META_MAPPING(sbi)->nrpages;
902829aa 59 si->nats = NM_I(sbi)->nat_cnt;
dd4e4b59
JK
60 si->dirty_nats = NM_I(sbi)->dirty_nat_cnt;
61 si->sits = MAIN_SEGS(sbi);
62 si->dirty_sits = SIT_I(sbi)->dirty_sentries;
902829aa
GKH
63 si->fnids = NM_I(sbi)->fcnt;
64 si->bg_gc = sbi->bg_gc;
65 si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
66 * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
67 / 2;
68 si->util_valid = (int)(written_block_count(sbi) >>
69 sbi->log_blocks_per_seg)
70 * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
71 / 2;
72 si->util_invalid = 50 - si->util_free - si->util_valid;
73 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
74 struct curseg_info *curseg = CURSEG_I(sbi, i);
75 si->curseg[i] = curseg->segno;
76 si->cursec[i] = curseg->segno / sbi->segs_per_sec;
77 si->curzone[i] = si->cursec[i] / sbi->secs_per_zone;
78 }
79
80 for (i = 0; i < 2; i++) {
81 si->segment_count[i] = sbi->segment_count[i];
82 si->block_count[i] = sbi->block_count[i];
83 }
b9a2c252
CL
84
85 si->inplace_count = atomic_read(&sbi->inplace_count);
902829aa
GKH
86}
87
0a8165d7 88/*
902829aa
GKH
89 * This function calculates BDF of every segments
90 */
91static void update_sit_info(struct f2fs_sb_info *sbi)
92{
963d4f7d 93 struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa 94 unsigned int blks_per_sec, hblks_per_sec, total_vblocks, bimodal, dist;
902829aa
GKH
95 unsigned int segno, vblocks;
96 int ndirty = 0;
97
98 bimodal = 0;
99 total_vblocks = 0;
100 blks_per_sec = sbi->segs_per_sec * (1 << sbi->log_blocks_per_seg);
101 hblks_per_sec = blks_per_sec / 2;
7cd8558b 102 for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
902829aa
GKH
103 vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
104 dist = abs(vblocks - hblks_per_sec);
105 bimodal += dist * dist;
106
107 if (vblocks > 0 && vblocks < blks_per_sec) {
108 total_vblocks += vblocks;
109 ndirty++;
110 }
111 }
7cd8558b 112 dist = MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec / 100;
902829aa
GKH
113 si->bimodal = bimodal / dist;
114 if (si->dirty_count)
115 si->avg_vblocks = total_vblocks / ndirty;
116 else
117 si->avg_vblocks = 0;
118}
119
0a8165d7 120/*
902829aa
GKH
121 * This function calculates memory footprint.
122 */
123static void update_mem_info(struct f2fs_sb_info *sbi)
124{
963d4f7d 125 struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa 126 unsigned npages;
8c402946 127 int i;
902829aa
GKH
128
129 if (si->base_mem)
130 goto get_cache;
131
132 si->base_mem = sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
133 si->base_mem += 2 * sizeof(struct f2fs_inode_info);
134 si->base_mem += sizeof(*sbi->ckpt);
135
136 /* build sm */
137 si->base_mem += sizeof(struct f2fs_sm_info);
138
139 /* build sit */
140 si->base_mem += sizeof(struct sit_info);
7cd8558b
JK
141 si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
142 si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
143 si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
902829aa 144 if (sbi->segs_per_sec > 1)
7cd8558b 145 si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
902829aa
GKH
146 si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
147
148 /* build free segmap */
149 si->base_mem += sizeof(struct free_segmap_info);
7cd8558b
JK
150 si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
151 si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
902829aa
GKH
152
153 /* build curseg */
154 si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
155 si->base_mem += PAGE_CACHE_SIZE * NR_CURSEG_TYPE;
156
157 /* build dirty segmap */
158 si->base_mem += sizeof(struct dirty_seglist_info);
7cd8558b
JK
159 si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
160 si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
902829aa 161
e1c42045 162 /* build nm */
902829aa
GKH
163 si->base_mem += sizeof(struct f2fs_nm_info);
164 si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
165
9066c6a7
CY
166get_cache:
167 si->cache_mem = 0;
168
902829aa 169 /* build gc */
9066c6a7
CY
170 if (sbi->gc_thread)
171 si->cache_mem += sizeof(struct f2fs_gc_kthread);
172
173 /* build merge flush thread */
174 if (SM_I(sbi)->cmd_control_info)
175 si->cache_mem += sizeof(struct flush_cmd_control);
902829aa 176
902829aa 177 /* free nids */
9066c6a7
CY
178 si->cache_mem += NM_I(sbi)->fcnt * sizeof(struct free_nid);
179 si->cache_mem += NM_I(sbi)->nat_cnt * sizeof(struct nat_entry);
6f0aacbc
JK
180 si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
181 sizeof(struct nat_entry_set);
182 si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
06292073 183 si->cache_mem += sbi->n_dirty_dirs * sizeof(struct inode_entry);
8c402946 184 for (i = 0; i <= UPDATE_INO; i++)
67298804 185 si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
6f0aacbc
JK
186
187 si->page_mem = 0;
188 npages = NODE_MAPPING(sbi)->nrpages;
189 si->page_mem += npages << PAGE_CACHE_SHIFT;
190 npages = META_MAPPING(sbi)->nrpages;
191 si->page_mem += npages << PAGE_CACHE_SHIFT;
902829aa
GKH
192}
193
194static int stat_show(struct seq_file *s, void *v)
195{
145b04e5 196 struct f2fs_stat_info *si;
902829aa
GKH
197 int i = 0;
198 int j;
199
66af62ce 200 mutex_lock(&f2fs_stat_mutex);
145b04e5 201 list_for_each_entry(si, &f2fs_stat_list, stat_list) {
f83759e2 202 char devname[BDEVNAME_SIZE];
902829aa 203
902829aa
GKH
204 update_general_status(si->sbi);
205
f83759e2 206 seq_printf(s, "\n=====[ partition info(%s). #%d ]=====\n",
207 bdevname(si->sbi->sb->s_bdev, devname), i++);
7880ceed
HL
208 seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
209 si->sit_area_segs, si->nat_area_segs);
902829aa
GKH
210 seq_printf(s, "[SSA: %d] [MAIN: %d",
211 si->ssa_area_segs, si->main_area_segs);
212 seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
213 si->overp_segs, si->rsvd_segs);
214 seq_printf(s, "Utilization: %d%% (%d valid blocks)\n",
215 si->utilization, si->valid_count);
216 seq_printf(s, " - Node: %u (Inode: %u, ",
217 si->valid_node_count, si->valid_inode_count);
218 seq_printf(s, "Other: %u)\n - Data: %u\n",
219 si->valid_node_count - si->valid_inode_count,
220 si->valid_count - si->valid_node_count);
0dbdc2ae
JK
221 seq_printf(s, " - Inline_data Inode: %u\n",
222 si->inline_inode);
3289c061
JK
223 seq_printf(s, " - Inline_dentry Inode: %u\n",
224 si->inline_dir);
902829aa
GKH
225 seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
226 si->main_area_segs, si->main_area_sections,
227 si->main_area_zones);
228 seq_printf(s, " - COLD data: %d, %d, %d\n",
229 si->curseg[CURSEG_COLD_DATA],
230 si->cursec[CURSEG_COLD_DATA],
231 si->curzone[CURSEG_COLD_DATA]);
232 seq_printf(s, " - WARM data: %d, %d, %d\n",
233 si->curseg[CURSEG_WARM_DATA],
234 si->cursec[CURSEG_WARM_DATA],
235 si->curzone[CURSEG_WARM_DATA]);
236 seq_printf(s, " - HOT data: %d, %d, %d\n",
237 si->curseg[CURSEG_HOT_DATA],
238 si->cursec[CURSEG_HOT_DATA],
239 si->curzone[CURSEG_HOT_DATA]);
240 seq_printf(s, " - Dir dnode: %d, %d, %d\n",
241 si->curseg[CURSEG_HOT_NODE],
242 si->cursec[CURSEG_HOT_NODE],
243 si->curzone[CURSEG_HOT_NODE]);
244 seq_printf(s, " - File dnode: %d, %d, %d\n",
245 si->curseg[CURSEG_WARM_NODE],
246 si->cursec[CURSEG_WARM_NODE],
247 si->curzone[CURSEG_WARM_NODE]);
248 seq_printf(s, " - Indir nodes: %d, %d, %d\n",
249 si->curseg[CURSEG_COLD_NODE],
250 si->cursec[CURSEG_COLD_NODE],
251 si->curzone[CURSEG_COLD_NODE]);
252 seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
253 si->main_area_segs - si->dirty_count -
254 si->prefree_count - si->free_segs,
255 si->dirty_count);
256 seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
257 si->prefree_count, si->free_segs, si->free_secs);
942e0be6 258 seq_printf(s, "CP calls: %d\n", si->cp_count);
902829aa
GKH
259 seq_printf(s, "GC calls: %d (BG: %d)\n",
260 si->call_count, si->bg_gc);
261 seq_printf(s, " - data segments : %d\n", si->data_segs);
262 seq_printf(s, " - node segments : %d\n", si->node_segs);
263 seq_printf(s, "Try to move %d blocks\n", si->tot_blks);
264 seq_printf(s, " - data blocks : %d\n", si->data_blks);
265 seq_printf(s, " - node blocks : %d\n", si->node_blks);
266 seq_printf(s, "\nExtent Hit Ratio: %d / %d\n",
267 si->hit_ext, si->total_ext);
6c311ec6 268 seq_puts(s, "\nBalancing F2FS Async:\n");
8dcf2ff7
JK
269 seq_printf(s, " - inmem: %4d\n",
270 si->inmem_pages);
499046ab 271 seq_printf(s, " - nodes: %4d in %4d\n",
902829aa 272 si->ndirty_node, si->node_pages);
499046ab 273 seq_printf(s, " - dents: %4d in dirs:%4d\n",
902829aa 274 si->ndirty_dent, si->ndirty_dirs);
499046ab 275 seq_printf(s, " - meta: %4d in %4d\n",
902829aa 276 si->ndirty_meta, si->meta_pages);
dd4e4b59
JK
277 seq_printf(s, " - NATs: %9d/%9d\n - SITs: %9d/%9d\n",
278 si->dirty_nats, si->nats, si->dirty_sits, si->sits);
a5f42010
JK
279 seq_printf(s, " - free_nids: %9d\n",
280 si->fnids);
2d219c51
GZ
281 seq_puts(s, "\nDistribution of User Blocks:");
282 seq_puts(s, " [ valid | invalid | free ]\n");
283 seq_puts(s, " [");
902829aa
GKH
284
285 for (j = 0; j < si->util_valid; j++)
2d219c51
GZ
286 seq_putc(s, '-');
287 seq_putc(s, '|');
902829aa
GKH
288
289 for (j = 0; j < si->util_invalid; j++)
2d219c51
GZ
290 seq_putc(s, '-');
291 seq_putc(s, '|');
902829aa
GKH
292
293 for (j = 0; j < si->util_free; j++)
2d219c51
GZ
294 seq_putc(s, '-');
295 seq_puts(s, "]\n\n");
b9a2c252 296 seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
902829aa
GKH
297 seq_printf(s, "SSR: %u blocks in %u segments\n",
298 si->block_count[SSR], si->segment_count[SSR]);
299 seq_printf(s, "LFS: %u blocks in %u segments\n",
300 si->block_count[LFS], si->segment_count[LFS]);
301
302 /* segment usage info */
303 update_sit_info(si->sbi);
304 seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
305 si->bimodal, si->avg_vblocks);
306
307 /* memory footprint */
308 update_mem_info(si->sbi);
6f0aacbc
JK
309 seq_printf(s, "\nMemory: %u KB\n",
310 (si->base_mem + si->cache_mem + si->page_mem) >> 10);
311 seq_printf(s, " - static: %u KB\n",
312 si->base_mem >> 10);
313 seq_printf(s, " - cached: %u KB\n",
314 si->cache_mem >> 10);
315 seq_printf(s, " - paged : %u KB\n",
316 si->page_mem >> 10);
902829aa 317 }
66af62ce 318 mutex_unlock(&f2fs_stat_mutex);
902829aa
GKH
319 return 0;
320}
321
322static int stat_open(struct inode *inode, struct file *file)
323{
324 return single_open(file, stat_show, inode->i_private);
325}
326
327static const struct file_operations stat_fops = {
328 .open = stat_open,
329 .read = seq_read,
330 .llseek = seq_lseek,
331 .release = single_release,
332};
333
4589d25d 334int f2fs_build_stats(struct f2fs_sb_info *sbi)
902829aa
GKH
335{
336 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
337 struct f2fs_stat_info *si;
338
963d4f7d
GZ
339 si = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
340 if (!si)
902829aa
GKH
341 return -ENOMEM;
342
902829aa
GKH
343 si->all_area_segs = le32_to_cpu(raw_super->segment_count);
344 si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
345 si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
346 si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
347 si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
348 si->main_area_sections = le32_to_cpu(raw_super->section_count);
349 si->main_area_zones = si->main_area_sections /
350 le32_to_cpu(raw_super->secs_per_zone);
351 si->sbi = sbi;
963d4f7d 352 sbi->stat_info = si;
66af62ce 353
03e14d52
CY
354 atomic_set(&sbi->inline_inode, 0);
355 atomic_set(&sbi->inline_dir, 0);
b9a2c252 356 atomic_set(&sbi->inplace_count, 0);
03e14d52 357
66af62ce 358 mutex_lock(&f2fs_stat_mutex);
359 list_add_tail(&si->stat_list, &f2fs_stat_list);
360 mutex_unlock(&f2fs_stat_mutex);
361
902829aa
GKH
362 return 0;
363}
364
902829aa
GKH
365void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
366{
963d4f7d 367 struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa 368
66af62ce 369 mutex_lock(&f2fs_stat_mutex);
902829aa 370 list_del(&si->stat_list);
66af62ce 371 mutex_unlock(&f2fs_stat_mutex);
372
963d4f7d 373 kfree(si);
902829aa
GKH
374}
375
4589d25d
NJ
376void __init f2fs_create_root_stats(void)
377{
c524723e
YL
378 struct dentry *file;
379
40e1ebe9
YL
380 f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
381 if (!f2fs_debugfs_root)
7a6c76b1 382 return;
c524723e 383
40e1ebe9 384 file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
c524723e 385 NULL, &stat_fops);
7a6c76b1
GZ
386 if (!file) {
387 debugfs_remove(f2fs_debugfs_root);
388 f2fs_debugfs_root = NULL;
389 }
4589d25d
NJ
390}
391
392void f2fs_destroy_root_stats(void)
902829aa 393{
40e1ebe9 394 if (!f2fs_debugfs_root)
c524723e
YL
395 return;
396
40e1ebe9
YL
397 debugfs_remove_recursive(f2fs_debugfs_root);
398 f2fs_debugfs_root = NULL;
902829aa 399}
This page took 0.108443 seconds and 5 git commands to generate.