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