fs/f2fs/debug.c

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