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