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