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