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