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