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