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