2 * f2fs debugging statistics
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>
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.
15 #include <linux/backing-dev.h>
16 #include <linux/f2fs_fs.h>
17 #include <linux/blkdev.h>
18 #include <linux/debugfs.h>
19 #include <linux/seq_file.h>
26 static LIST_HEAD(f2fs_stat_list);
27 static struct dentry *f2fs_debugfs_root;
28 static DEFINE_MUTEX(f2fs_stat_mutex);
30 static void update_general_status(struct f2fs_sb_info *sbi)
32 struct f2fs_stat_info *si = F2FS_STAT(sbi);
35 /* validation check of the segment numbers */
36 si->hit_largest = atomic64_read(&sbi->read_hit_largest);
37 si->hit_cached = atomic64_read(&sbi->read_hit_cached);
38 si->hit_rbtree = atomic64_read(&sbi->read_hit_rbtree);
39 si->hit_total = si->hit_largest + si->hit_cached + si->hit_rbtree;
40 si->total_ext = atomic64_read(&sbi->total_hit_ext);
41 si->ext_tree = atomic_read(&sbi->total_ext_tree);
42 si->zombie_tree = atomic_read(&sbi->total_zombie_tree);
43 si->ext_node = atomic_read(&sbi->total_ext_node);
44 si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
45 si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
46 si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
47 si->ndirty_data = get_pages(sbi, F2FS_DIRTY_DATA);
48 si->ndirty_imeta = get_pages(sbi, F2FS_DIRTY_IMETA);
49 si->ndirty_dirs = sbi->ndirty_inode[DIR_INODE];
50 si->ndirty_files = sbi->ndirty_inode[FILE_INODE];
51 si->ndirty_all = sbi->ndirty_inode[DIRTY_META];
52 si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
53 si->wb_bios = atomic_read(&sbi->nr_wb_bios);
54 si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
55 si->rsvd_segs = reserved_segments(sbi);
56 si->overp_segs = overprovision_segments(sbi);
57 si->valid_count = valid_user_blocks(sbi);
58 si->discard_blks = discard_blocks(sbi);
59 si->valid_node_count = valid_node_count(sbi);
60 si->valid_inode_count = valid_inode_count(sbi);
61 si->inline_xattr = atomic_read(&sbi->inline_xattr);
62 si->inline_inode = atomic_read(&sbi->inline_inode);
63 si->inline_dir = atomic_read(&sbi->inline_dir);
64 si->orphans = sbi->im[ORPHAN_INO].ino_num;
65 si->utilization = utilization(sbi);
67 si->free_segs = free_segments(sbi);
68 si->free_secs = free_sections(sbi);
69 si->prefree_count = prefree_segments(sbi);
70 si->dirty_count = dirty_segments(sbi);
71 si->node_pages = NODE_MAPPING(sbi)->nrpages;
72 si->meta_pages = META_MAPPING(sbi)->nrpages;
73 si->nats = NM_I(sbi)->nat_cnt;
74 si->dirty_nats = NM_I(sbi)->dirty_nat_cnt;
75 si->sits = MAIN_SEGS(sbi);
76 si->dirty_sits = SIT_I(sbi)->dirty_sentries;
77 si->fnids = NM_I(sbi)->fcnt;
78 si->bg_gc = sbi->bg_gc;
79 si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
80 * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
82 si->util_valid = (int)(written_block_count(sbi) >>
83 sbi->log_blocks_per_seg)
84 * 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
86 si->util_invalid = 50 - si->util_free - si->util_valid;
87 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
88 struct curseg_info *curseg = CURSEG_I(sbi, i);
89 si->curseg[i] = curseg->segno;
90 si->cursec[i] = curseg->segno / sbi->segs_per_sec;
91 si->curzone[i] = si->cursec[i] / sbi->secs_per_zone;
94 for (i = 0; i < 2; i++) {
95 si->segment_count[i] = sbi->segment_count[i];
96 si->block_count[i] = sbi->block_count[i];
99 si->inplace_count = atomic_read(&sbi->inplace_count);
103 * This function calculates BDF of every segments
105 static void update_sit_info(struct f2fs_sb_info *sbi)
107 struct f2fs_stat_info *si = F2FS_STAT(sbi);
108 unsigned long long blks_per_sec, hblks_per_sec, total_vblocks;
109 unsigned long long bimodal, dist;
110 unsigned int segno, vblocks;
115 blks_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
116 hblks_per_sec = blks_per_sec / 2;
117 for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
118 vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
119 dist = abs(vblocks - hblks_per_sec);
120 bimodal += dist * dist;
122 if (vblocks > 0 && vblocks < blks_per_sec) {
123 total_vblocks += vblocks;
127 dist = div_u64(MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec, 100);
128 si->bimodal = div64_u64(bimodal, dist);
130 si->avg_vblocks = div_u64(total_vblocks, ndirty);
136 * This function calculates memory footprint.
138 static void update_mem_info(struct f2fs_sb_info *sbi)
140 struct f2fs_stat_info *si = F2FS_STAT(sbi);
147 si->base_mem = sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
148 si->base_mem += 2 * sizeof(struct f2fs_inode_info);
149 si->base_mem += sizeof(*sbi->ckpt);
150 si->base_mem += sizeof(struct percpu_counter) * NR_COUNT_TYPE;
153 si->base_mem += sizeof(struct f2fs_sm_info);
156 si->base_mem += sizeof(struct sit_info);
157 si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
158 si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
159 si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
160 if (f2fs_discard_en(sbi))
161 si->base_mem += SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
162 si->base_mem += SIT_VBLOCK_MAP_SIZE;
163 if (sbi->segs_per_sec > 1)
164 si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
165 si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
167 /* build free segmap */
168 si->base_mem += sizeof(struct free_segmap_info);
169 si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
170 si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
173 si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
174 si->base_mem += PAGE_SIZE * NR_CURSEG_TYPE;
176 /* build dirty segmap */
177 si->base_mem += sizeof(struct dirty_seglist_info);
178 si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
179 si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
182 si->base_mem += sizeof(struct f2fs_nm_info);
183 si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
190 si->cache_mem += sizeof(struct f2fs_gc_kthread);
192 /* build merge flush thread */
193 if (SM_I(sbi)->cmd_control_info)
194 si->cache_mem += sizeof(struct flush_cmd_control);
197 si->cache_mem += NM_I(sbi)->fcnt * sizeof(struct free_nid);
198 si->cache_mem += NM_I(sbi)->nat_cnt * sizeof(struct nat_entry);
199 si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
200 sizeof(struct nat_entry_set);
201 si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
202 for (i = 0; i <= ORPHAN_INO; i++)
203 si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
204 si->cache_mem += atomic_read(&sbi->total_ext_tree) *
205 sizeof(struct extent_tree);
206 si->cache_mem += atomic_read(&sbi->total_ext_node) *
207 sizeof(struct extent_node);
210 npages = NODE_MAPPING(sbi)->nrpages;
211 si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
212 npages = META_MAPPING(sbi)->nrpages;
213 si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
216 static int stat_show(struct seq_file *s, void *v)
218 struct f2fs_stat_info *si;
222 mutex_lock(&f2fs_stat_mutex);
223 list_for_each_entry(si, &f2fs_stat_list, stat_list) {
224 update_general_status(si->sbi);
226 seq_printf(s, "\n=====[ partition info(%pg). #%d, %s]=====\n",
227 si->sbi->sb->s_bdev, i++,
228 f2fs_readonly(si->sbi->sb) ? "RO": "RW");
229 seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
230 si->sit_area_segs, si->nat_area_segs);
231 seq_printf(s, "[SSA: %d] [MAIN: %d",
232 si->ssa_area_segs, si->main_area_segs);
233 seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
234 si->overp_segs, si->rsvd_segs);
235 if (test_opt(si->sbi, DISCARD))
236 seq_printf(s, "Utilization: %u%% (%u valid blocks, %u discard blocks)\n",
237 si->utilization, si->valid_count, si->discard_blks);
239 seq_printf(s, "Utilization: %u%% (%u valid blocks)\n",
240 si->utilization, si->valid_count);
242 seq_printf(s, " - Node: %u (Inode: %u, ",
243 si->valid_node_count, si->valid_inode_count);
244 seq_printf(s, "Other: %u)\n - Data: %u\n",
245 si->valid_node_count - si->valid_inode_count,
246 si->valid_count - si->valid_node_count);
247 seq_printf(s, " - Inline_xattr Inode: %u\n",
249 seq_printf(s, " - Inline_data Inode: %u\n",
251 seq_printf(s, " - Inline_dentry Inode: %u\n",
253 seq_printf(s, " - Orphan Inode: %u\n",
255 seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
256 si->main_area_segs, si->main_area_sections,
257 si->main_area_zones);
258 seq_printf(s, " - COLD data: %d, %d, %d\n",
259 si->curseg[CURSEG_COLD_DATA],
260 si->cursec[CURSEG_COLD_DATA],
261 si->curzone[CURSEG_COLD_DATA]);
262 seq_printf(s, " - WARM data: %d, %d, %d\n",
263 si->curseg[CURSEG_WARM_DATA],
264 si->cursec[CURSEG_WARM_DATA],
265 si->curzone[CURSEG_WARM_DATA]);
266 seq_printf(s, " - HOT data: %d, %d, %d\n",
267 si->curseg[CURSEG_HOT_DATA],
268 si->cursec[CURSEG_HOT_DATA],
269 si->curzone[CURSEG_HOT_DATA]);
270 seq_printf(s, " - Dir dnode: %d, %d, %d\n",
271 si->curseg[CURSEG_HOT_NODE],
272 si->cursec[CURSEG_HOT_NODE],
273 si->curzone[CURSEG_HOT_NODE]);
274 seq_printf(s, " - File dnode: %d, %d, %d\n",
275 si->curseg[CURSEG_WARM_NODE],
276 si->cursec[CURSEG_WARM_NODE],
277 si->curzone[CURSEG_WARM_NODE]);
278 seq_printf(s, " - Indir nodes: %d, %d, %d\n",
279 si->curseg[CURSEG_COLD_NODE],
280 si->cursec[CURSEG_COLD_NODE],
281 si->curzone[CURSEG_COLD_NODE]);
282 seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
283 si->main_area_segs - si->dirty_count -
284 si->prefree_count - si->free_segs,
286 seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
287 si->prefree_count, si->free_segs, si->free_secs);
288 seq_printf(s, "CP calls: %d (BG: %d)\n",
289 si->cp_count, si->bg_cp_count);
290 seq_printf(s, "GC calls: %d (BG: %d)\n",
291 si->call_count, si->bg_gc);
292 seq_printf(s, " - data segments : %d (%d)\n",
293 si->data_segs, si->bg_data_segs);
294 seq_printf(s, " - node segments : %d (%d)\n",
295 si->node_segs, si->bg_node_segs);
296 seq_printf(s, "Try to move %d blocks (BG: %d)\n", si->tot_blks,
297 si->bg_data_blks + si->bg_node_blks);
298 seq_printf(s, " - data blocks : %d (%d)\n", si->data_blks,
300 seq_printf(s, " - node blocks : %d (%d)\n", si->node_blks,
302 seq_puts(s, "\nExtent Cache:\n");
303 seq_printf(s, " - Hit Count: L1-1:%llu L1-2:%llu L2:%llu\n",
304 si->hit_largest, si->hit_cached,
306 seq_printf(s, " - Hit Ratio: %llu%% (%llu / %llu)\n",
308 div64_u64(si->hit_total * 100, si->total_ext),
309 si->hit_total, si->total_ext);
310 seq_printf(s, " - Inner Struct Count: tree: %d(%d), node: %d\n",
311 si->ext_tree, si->zombie_tree, si->ext_node);
312 seq_puts(s, "\nBalancing F2FS Async:\n");
313 seq_printf(s, " - inmem: %4d, wb_bios: %4d\n",
314 si->inmem_pages, si->wb_bios);
315 seq_printf(s, " - nodes: %4d in %4d\n",
316 si->ndirty_node, si->node_pages);
317 seq_printf(s, " - dents: %4d in dirs:%4d (%4d)\n",
318 si->ndirty_dent, si->ndirty_dirs, si->ndirty_all);
319 seq_printf(s, " - datas: %4d in files:%4d\n",
320 si->ndirty_data, si->ndirty_files);
321 seq_printf(s, " - meta: %4d in %4d\n",
322 si->ndirty_meta, si->meta_pages);
323 seq_printf(s, " - imeta: %4d\n",
325 seq_printf(s, " - NATs: %9d/%9d\n - SITs: %9d/%9d\n",
326 si->dirty_nats, si->nats, si->dirty_sits, si->sits);
327 seq_printf(s, " - free_nids: %9d\n",
329 seq_puts(s, "\nDistribution of User Blocks:");
330 seq_puts(s, " [ valid | invalid | free ]\n");
333 for (j = 0; j < si->util_valid; j++)
337 for (j = 0; j < si->util_invalid; j++)
341 for (j = 0; j < si->util_free; j++)
343 seq_puts(s, "]\n\n");
344 seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
345 seq_printf(s, "SSR: %u blocks in %u segments\n",
346 si->block_count[SSR], si->segment_count[SSR]);
347 seq_printf(s, "LFS: %u blocks in %u segments\n",
348 si->block_count[LFS], si->segment_count[LFS]);
350 /* segment usage info */
351 update_sit_info(si->sbi);
352 seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
353 si->bimodal, si->avg_vblocks);
355 /* memory footprint */
356 update_mem_info(si->sbi);
357 seq_printf(s, "\nMemory: %llu KB\n",
358 (si->base_mem + si->cache_mem + si->page_mem) >> 10);
359 seq_printf(s, " - static: %llu KB\n",
361 seq_printf(s, " - cached: %llu KB\n",
362 si->cache_mem >> 10);
363 seq_printf(s, " - paged : %llu KB\n",
366 mutex_unlock(&f2fs_stat_mutex);
370 static int stat_open(struct inode *inode, struct file *file)
372 return single_open(file, stat_show, inode->i_private);
375 static const struct file_operations stat_fops = {
376 .owner = THIS_MODULE,
380 .release = single_release,
383 int f2fs_build_stats(struct f2fs_sb_info *sbi)
385 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
386 struct f2fs_stat_info *si;
388 si = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
392 si->all_area_segs = le32_to_cpu(raw_super->segment_count);
393 si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
394 si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
395 si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
396 si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
397 si->main_area_sections = le32_to_cpu(raw_super->section_count);
398 si->main_area_zones = si->main_area_sections /
399 le32_to_cpu(raw_super->secs_per_zone);
403 atomic64_set(&sbi->total_hit_ext, 0);
404 atomic64_set(&sbi->read_hit_rbtree, 0);
405 atomic64_set(&sbi->read_hit_largest, 0);
406 atomic64_set(&sbi->read_hit_cached, 0);
408 atomic_set(&sbi->inline_xattr, 0);
409 atomic_set(&sbi->inline_inode, 0);
410 atomic_set(&sbi->inline_dir, 0);
411 atomic_set(&sbi->inplace_count, 0);
413 mutex_lock(&f2fs_stat_mutex);
414 list_add_tail(&si->stat_list, &f2fs_stat_list);
415 mutex_unlock(&f2fs_stat_mutex);
420 void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
422 struct f2fs_stat_info *si = F2FS_STAT(sbi);
424 mutex_lock(&f2fs_stat_mutex);
425 list_del(&si->stat_list);
426 mutex_unlock(&f2fs_stat_mutex);
431 int __init f2fs_create_root_stats(void)
435 f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
436 if (!f2fs_debugfs_root)
439 file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
442 debugfs_remove(f2fs_debugfs_root);
443 f2fs_debugfs_root = NULL;
450 void f2fs_destroy_root_stats(void)
452 if (!f2fs_debugfs_root)
455 debugfs_remove_recursive(f2fs_debugfs_root);
456 f2fs_debugfs_root = NULL;