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