[linux.git] / fs / f2fs / debug.c

/*
 * f2fs debugging statistics
 *
 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
 *             http://www.samsung.com/
 * Copyright (c) 2012 Linux Foundation
 * Copyright (c) 2012 Greg Kroah-Hartman <[email protected]>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */

#include <linux/fs.h>
#include <linux/backing-dev.h>
#include <linux/f2fs_fs.h>
#include <linux/blkdev.h>
#include <linux/debugfs.h>
#include <linux/seq_file.h>

#include "f2fs.h"
#include "node.h"
#include "segment.h"
#include "gc.h"

static LIST_HEAD(f2fs_stat_list);
static struct dentry *f2fs_debugfs_root;
static DEFINE_MUTEX(f2fs_stat_mutex);

static void update_general_status(struct f2fs_sb_info *sbi)
{
	struct f2fs_stat_info *si = F2FS_STAT(sbi);
	int i;

	/* validation check of the segment numbers */
	si->hit_ext = sbi->read_hit_ext;
	si->total_ext = sbi->total_hit_ext;
	si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
	si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
	si->ndirty_dirs = sbi->n_dirty_dirs;
	si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
	si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
	si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
	si->rsvd_segs = reserved_segments(sbi);
	si->overp_segs = overprovision_segments(sbi);
	si->valid_count = valid_user_blocks(sbi);
	si->valid_node_count = valid_node_count(sbi);
	si->valid_inode_count = valid_inode_count(sbi);
	si->inline_inode = sbi->inline_inode;
	si->inline_dir = sbi->inline_dir;
	si->utilization = utilization(sbi);

	si->free_segs = free_segments(sbi);
	si->free_secs = free_sections(sbi);
	si->prefree_count = prefree_segments(sbi);
	si->dirty_count = dirty_segments(sbi);
	si->node_pages = NODE_MAPPING(sbi)->nrpages;
	si->meta_pages = META_MAPPING(sbi)->nrpages;
	si->nats = NM_I(sbi)->nat_cnt;
	si->sits = SIT_I(sbi)->dirty_sentries;
	si->fnids = NM_I(sbi)->fcnt;
	si->bg_gc = sbi->bg_gc;
	si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
		* 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
		/ 2;
	si->util_valid = (int)(written_block_count(sbi) >>
						sbi->log_blocks_per_seg)
		* 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
		/ 2;
	si->util_invalid = 50 - si->util_free - si->util_valid;
	for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
		struct curseg_info *curseg = CURSEG_I(sbi, i);
		si->curseg[i] = curseg->segno;
		si->cursec[i] = curseg->segno / sbi->segs_per_sec;
		si->curzone[i] = si->cursec[i] / sbi->secs_per_zone;
	}

	for (i = 0; i < 2; i++) {
		si->segment_count[i] = sbi->segment_count[i];
		si->block_count[i] = sbi->block_count[i];
	}
}

/*
 * This function calculates BDF of every segments
 */
static void update_sit_info(struct f2fs_sb_info *sbi)
{
	struct f2fs_stat_info *si = F2FS_STAT(sbi);
	unsigned int blks_per_sec, hblks_per_sec, total_vblocks, bimodal, dist;
	unsigned int segno, vblocks;
	int ndirty = 0;

	bimodal = 0;
	total_vblocks = 0;
	blks_per_sec = sbi->segs_per_sec * (1 << sbi->log_blocks_per_seg);
	hblks_per_sec = blks_per_sec / 2;
	for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
		vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
		dist = abs(vblocks - hblks_per_sec);
		bimodal += dist * dist;

		if (vblocks > 0 && vblocks < blks_per_sec) {
			total_vblocks += vblocks;
			ndirty++;
		}
	}
	dist = MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec / 100;
	si->bimodal = bimodal / dist;
	if (si->dirty_count)
		si->avg_vblocks = total_vblocks / ndirty;
	else
		si->avg_vblocks = 0;
}

/*
 * This function calculates memory footprint.
 */
static void update_mem_info(struct f2fs_sb_info *sbi)
{
	struct f2fs_stat_info *si = F2FS_STAT(sbi);
	unsigned npages;
	int i;

	if (si->base_mem)
		goto get_cache;

	si->base_mem = sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
	si->base_mem += 2 * sizeof(struct f2fs_inode_info);
	si->base_mem += sizeof(*sbi->ckpt);

	/* build sm */
	si->base_mem += sizeof(struct f2fs_sm_info);

	/* build sit */
	si->base_mem += sizeof(struct sit_info);
	si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
	si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
	si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
	if (sbi->segs_per_sec > 1)
		si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
	si->base_mem += __bitmap_size(sbi, SIT_BITMAP);

	/* build free segmap */
	si->base_mem += sizeof(struct free_segmap_info);
	si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
	si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));

	/* build curseg */
	si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
	si->base_mem += PAGE_CACHE_SIZE * NR_CURSEG_TYPE;

	/* build dirty segmap */
	si->base_mem += sizeof(struct dirty_seglist_info);
	si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
	si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));

	/* build nm */
	si->base_mem += sizeof(struct f2fs_nm_info);
	si->base_mem += __bitmap_size(sbi, NAT_BITMAP);

	/* build gc */
	si->base_mem += sizeof(struct f2fs_gc_kthread);

get_cache:
	/* free nids */
	si->cache_mem = NM_I(sbi)->fcnt;
	si->cache_mem += NM_I(sbi)->nat_cnt;
	npages = NODE_MAPPING(sbi)->nrpages;
	si->cache_mem += npages << PAGE_CACHE_SHIFT;
	npages = META_MAPPING(sbi)->nrpages;
	si->cache_mem += npages << PAGE_CACHE_SHIFT;
	si->cache_mem += sbi->n_dirty_dirs * sizeof(struct dir_inode_entry);
	for (i = 0; i <= UPDATE_INO; i++)
		si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
}

static int stat_show(struct seq_file *s, void *v)
{
	struct f2fs_stat_info *si;
	int i = 0;
	int j;

	mutex_lock(&f2fs_stat_mutex);
	list_for_each_entry(si, &f2fs_stat_list, stat_list) {
		char devname[BDEVNAME_SIZE];

		update_general_status(si->sbi);

		seq_printf(s, "\n=====[ partition info(%s). #%d ]=====\n",
			bdevname(si->sbi->sb->s_bdev, devname), i++);
		seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
			   si->sit_area_segs, si->nat_area_segs);
		seq_printf(s, "[SSA: %d] [MAIN: %d",
			   si->ssa_area_segs, si->main_area_segs);
		seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
			   si->overp_segs, si->rsvd_segs);
		seq_printf(s, "Utilization: %d%% (%d valid blocks)\n",
			   si->utilization, si->valid_count);
		seq_printf(s, "  - Node: %u (Inode: %u, ",
			   si->valid_node_count, si->valid_inode_count);
		seq_printf(s, "Other: %u)\n  - Data: %u\n",
			   si->valid_node_count - si->valid_inode_count,
			   si->valid_count - si->valid_node_count);
		seq_printf(s, "  - Inline_data Inode: %u\n",
			   si->inline_inode);
		seq_printf(s, "  - Inline_dentry Inode: %u\n",
			   si->inline_dir);
		seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
			   si->main_area_segs, si->main_area_sections,
			   si->main_area_zones);
		seq_printf(s, "  - COLD  data: %d, %d, %d\n",
			   si->curseg[CURSEG_COLD_DATA],
			   si->cursec[CURSEG_COLD_DATA],
			   si->curzone[CURSEG_COLD_DATA]);
		seq_printf(s, "  - WARM  data: %d, %d, %d\n",
			   si->curseg[CURSEG_WARM_DATA],
			   si->cursec[CURSEG_WARM_DATA],
			   si->curzone[CURSEG_WARM_DATA]);
		seq_printf(s, "  - HOT   data: %d, %d, %d\n",
			   si->curseg[CURSEG_HOT_DATA],
			   si->cursec[CURSEG_HOT_DATA],
			   si->curzone[CURSEG_HOT_DATA]);
		seq_printf(s, "  - Dir   dnode: %d, %d, %d\n",
			   si->curseg[CURSEG_HOT_NODE],
			   si->cursec[CURSEG_HOT_NODE],
			   si->curzone[CURSEG_HOT_NODE]);
		seq_printf(s, "  - File   dnode: %d, %d, %d\n",
			   si->curseg[CURSEG_WARM_NODE],
			   si->cursec[CURSEG_WARM_NODE],
			   si->curzone[CURSEG_WARM_NODE]);
		seq_printf(s, "  - Indir nodes: %d, %d, %d\n",
			   si->curseg[CURSEG_COLD_NODE],
			   si->cursec[CURSEG_COLD_NODE],
			   si->curzone[CURSEG_COLD_NODE]);
		seq_printf(s, "\n  - Valid: %d\n  - Dirty: %d\n",
			   si->main_area_segs - si->dirty_count -
			   si->prefree_count - si->free_segs,
			   si->dirty_count);
		seq_printf(s, "  - Prefree: %d\n  - Free: %d (%d)\n\n",
			   si->prefree_count, si->free_segs, si->free_secs);
		seq_printf(s, "CP calls: %d\n", si->cp_count);
		seq_printf(s, "GC calls: %d (BG: %d)\n",
			   si->call_count, si->bg_gc);
		seq_printf(s, "  - data segments : %d\n", si->data_segs);
		seq_printf(s, "  - node segments : %d\n", si->node_segs);
		seq_printf(s, "Try to move %d blocks\n", si->tot_blks);
		seq_printf(s, "  - data blocks : %d\n", si->data_blks);
		seq_printf(s, "  - node blocks : %d\n", si->node_blks);
		seq_printf(s, "\nExtent Hit Ratio: %d / %d\n",
			   si->hit_ext, si->total_ext);
		seq_puts(s, "\nBalancing F2FS Async:\n");
		seq_printf(s, "  - inmem: %4d\n",
			   si->inmem_pages);
		seq_printf(s, "  - nodes: %4d in %4d\n",
			   si->ndirty_node, si->node_pages);
		seq_printf(s, "  - dents: %4d in dirs:%4d\n",
			   si->ndirty_dent, si->ndirty_dirs);
		seq_printf(s, "  - meta: %4d in %4d\n",
			   si->ndirty_meta, si->meta_pages);
		seq_printf(s, "  - NATs: %9d\n  - SITs: %9d\n",
			   si->nats, si->sits);
		seq_printf(s, "  - free_nids: %9d\n",
			   si->fnids);
		seq_puts(s, "\nDistribution of User Blocks:");
		seq_puts(s, " [ valid | invalid | free ]\n");
		seq_puts(s, "  [");

		for (j = 0; j < si->util_valid; j++)
			seq_putc(s, '-');
		seq_putc(s, '|');

		for (j = 0; j < si->util_invalid; j++)
			seq_putc(s, '-');
		seq_putc(s, '|');

		for (j = 0; j < si->util_free; j++)
			seq_putc(s, '-');
		seq_puts(s, "]\n\n");
		seq_printf(s, "SSR: %u blocks in %u segments\n",
			   si->block_count[SSR], si->segment_count[SSR]);
		seq_printf(s, "LFS: %u blocks in %u segments\n",
			   si->block_count[LFS], si->segment_count[LFS]);

		/* segment usage info */
		update_sit_info(si->sbi);
		seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
			   si->bimodal, si->avg_vblocks);

		/* memory footprint */
		update_mem_info(si->sbi);
		seq_printf(s, "\nMemory: %u KB = static: %u + cached: %u\n",
				(si->base_mem + si->cache_mem) >> 10,
				si->base_mem >> 10, si->cache_mem >> 10);
	}
	mutex_unlock(&f2fs_stat_mutex);
	return 0;
}

static int stat_open(struct inode *inode, struct file *file)
{
	return single_open(file, stat_show, inode->i_private);
}

static const struct file_operations stat_fops = {
	.open = stat_open,
	.read = seq_read,
	.llseek = seq_lseek,
	.release = single_release,
};

int f2fs_build_stats(struct f2fs_sb_info *sbi)
{
	struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
	struct f2fs_stat_info *si;

	si = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
	if (!si)
		return -ENOMEM;

	si->all_area_segs = le32_to_cpu(raw_super->segment_count);
	si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
	si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
	si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
	si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
	si->main_area_sections = le32_to_cpu(raw_super->section_count);
	si->main_area_zones = si->main_area_sections /
				le32_to_cpu(raw_super->secs_per_zone);
	si->sbi = sbi;
	sbi->stat_info = si;

	mutex_lock(&f2fs_stat_mutex);
	list_add_tail(&si->stat_list, &f2fs_stat_list);
	mutex_unlock(&f2fs_stat_mutex);

	return 0;
}

void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
{
	struct f2fs_stat_info *si = F2FS_STAT(sbi);

	mutex_lock(&f2fs_stat_mutex);
	list_del(&si->stat_list);
	mutex_unlock(&f2fs_stat_mutex);

	kfree(si);
}

void __init f2fs_create_root_stats(void)
{
	struct dentry *file;

	f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
	if (!f2fs_debugfs_root)
		return;

	file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
			NULL, &stat_fops);
	if (!file) {
		debugfs_remove(f2fs_debugfs_root);
		f2fs_debugfs_root = NULL;
	}
}

void f2fs_destroy_root_stats(void)
{
	if (!f2fs_debugfs_root)
		return;

	debugfs_remove_recursive(f2fs_debugfs_root);
	f2fs_debugfs_root = NULL;
}
Commit	Line	Data
0a8165d7	1	/*
902829aa GKH	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 <[email protected]>
	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>
902829aa GKH	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);
40e1ebe9	27	static struct dentry *f2fs_debugfs_root;
66af62ce	28	static DEFINE_MUTEX(f2fs_stat_mutex);
902829aa	29
25ca923b	30	static void update_general_status(struct f2fs_sb_info *sbi)
902829aa	31	{
963d4f7d	32	struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa GKH	33	int i;
902829aa GKH	34
e1c42045	35	/* validation check of the segment numbers */
902829aa GKH	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);
8dcf2ff7	42	si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
902829aa GKH	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);
0dbdc2ae	49	si->inline_inode = sbi->inline_inode;
3289c061	50	si->inline_dir = sbi->inline_dir;
902829aa GKH	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);
4ef51a8f	57	si->node_pages = NODE_MAPPING(sbi)->nrpages;
9df27d98	58	si->meta_pages = META_MAPPING(sbi)->nrpages;
902829aa GKH	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
0a8165d7	84	/*
902829aa GKH	85	* This function calculates BDF of every segments
	86	*/
	87	static void update_sit_info(struct f2fs_sb_info *sbi)
	88	{
963d4f7d	89	struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa	90	unsigned int blks_per_sec, hblks_per_sec, total_vblocks, bimodal, dist;
902829aa GKH	91	unsigned int segno, vblocks;
	92	int ndirty = 0;
	93
	94	bimodal = 0;
	95	total_vblocks = 0;
	96	blks_per_sec = sbi->segs_per_sec * (1 << sbi->log_blocks_per_seg);
	97	hblks_per_sec = blks_per_sec / 2;
7cd8558b	98	for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
902829aa GKH	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	}
7cd8558b	108	dist = MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec / 100;
902829aa GKH	109	si->bimodal = bimodal / dist;
	110	if (si->dirty_count)
	111	si->avg_vblocks = total_vblocks / ndirty;
	112	else
	113	si->avg_vblocks = 0;
	114	}
	115
0a8165d7	116	/*
902829aa GKH	117	* This function calculates memory footprint.
	118	*/
	119	static void update_mem_info(struct f2fs_sb_info *sbi)
	120	{
963d4f7d	121	struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa	122	unsigned npages;
8c402946	123	int i;
902829aa GKH	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);
7cd8558b JK	137	si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
	138	si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
	139	si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
902829aa	140	if (sbi->segs_per_sec > 1)
7cd8558b	141	si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
902829aa GKH	142	si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
	143
	144	/* build free segmap */
	145	si->base_mem += sizeof(struct free_segmap_info);
7cd8558b JK	146	si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
7cd8558b JK	147	si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
902829aa GKH	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);
7cd8558b JK	155	si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
7cd8558b JK	156	si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
902829aa	157
e1c42045	158	/* build nm */
902829aa GKH	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;
4ef51a8f	169	npages = NODE_MAPPING(sbi)->nrpages;
902829aa	170	si->cache_mem += npages << PAGE_CACHE_SHIFT;
9df27d98	171	npages = META_MAPPING(sbi)->nrpages;
902829aa	172	si->cache_mem += npages << PAGE_CACHE_SHIFT;
902829aa	173	si->cache_mem += sbi->n_dirty_dirs * sizeof(struct dir_inode_entry);
8c402946	174	for (i = 0; i <= UPDATE_INO; i++)
67298804	175	si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
902829aa GKH	176	}
	177
	178	static int stat_show(struct seq_file s, void v)
	179	{
145b04e5	180	struct f2fs_stat_info *si;
902829aa GKH	181	int i = 0;
	182	int j;
	183
66af62ce	184	mutex_lock(&f2fs_stat_mutex);
145b04e5	185	list_for_each_entry(si, &f2fs_stat_list, stat_list) {
f83759e2	186	char devname[BDEVNAME_SIZE];
902829aa	187
902829aa GKH	188	update_general_status(si->sbi);
902829aa GKH	189
f83759e2	190	seq_printf(s, "\n=====[ partition info(%s). #%d ]=====\n",
f83759e2	191	bdevname(si->sbi->sb->s_bdev, devname), i++);
7880ceed HL	192	seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
7880ceed HL	193	si->sit_area_segs, si->nat_area_segs);
902829aa GKH	194	seq_printf(s, "[SSA: %d] [MAIN: %d",
	195	si->ssa_area_segs, si->main_area_segs);
	196	seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
	197	si->overp_segs, si->rsvd_segs);
	198	seq_printf(s, "Utilization: %d%% (%d valid blocks)\n",
	199	si->utilization, si->valid_count);
	200	seq_printf(s, " - Node: %u (Inode: %u, ",
	201	si->valid_node_count, si->valid_inode_count);
	202	seq_printf(s, "Other: %u)\n - Data: %u\n",
	203	si->valid_node_count - si->valid_inode_count,
	204	si->valid_count - si->valid_node_count);
0dbdc2ae JK	205	seq_printf(s, " - Inline_data Inode: %u\n",
0dbdc2ae JK	206	si->inline_inode);
3289c061 JK	207	seq_printf(s, " - Inline_dentry Inode: %u\n",
3289c061 JK	208	si->inline_dir);
902829aa GKH	209	seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
	210	si->main_area_segs, si->main_area_sections,
	211	si->main_area_zones);
	212	seq_printf(s, " - COLD data: %d, %d, %d\n",
	213	si->curseg[CURSEG_COLD_DATA],
	214	si->cursec[CURSEG_COLD_DATA],
	215	si->curzone[CURSEG_COLD_DATA]);
	216	seq_printf(s, " - WARM data: %d, %d, %d\n",
	217	si->curseg[CURSEG_WARM_DATA],
	218	si->cursec[CURSEG_WARM_DATA],
	219	si->curzone[CURSEG_WARM_DATA]);
	220	seq_printf(s, " - HOT data: %d, %d, %d\n",
	221	si->curseg[CURSEG_HOT_DATA],
	222	si->cursec[CURSEG_HOT_DATA],
	223	si->curzone[CURSEG_HOT_DATA]);
	224	seq_printf(s, " - Dir dnode: %d, %d, %d\n",
	225	si->curseg[CURSEG_HOT_NODE],
	226	si->cursec[CURSEG_HOT_NODE],
	227	si->curzone[CURSEG_HOT_NODE]);
	228	seq_printf(s, " - File dnode: %d, %d, %d\n",
	229	si->curseg[CURSEG_WARM_NODE],
	230	si->cursec[CURSEG_WARM_NODE],
	231	si->curzone[CURSEG_WARM_NODE]);
	232	seq_printf(s, " - Indir nodes: %d, %d, %d\n",
	233	si->curseg[CURSEG_COLD_NODE],
	234	si->cursec[CURSEG_COLD_NODE],
	235	si->curzone[CURSEG_COLD_NODE]);
	236	seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
	237	si->main_area_segs - si->dirty_count -
	238	si->prefree_count - si->free_segs,
	239	si->dirty_count);
	240	seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
	241	si->prefree_count, si->free_segs, si->free_secs);
942e0be6	242	seq_printf(s, "CP calls: %d\n", si->cp_count);
902829aa GKH	243	seq_printf(s, "GC calls: %d (BG: %d)\n",
	244	si->call_count, si->bg_gc);
	245	seq_printf(s, " - data segments : %d\n", si->data_segs);
	246	seq_printf(s, " - node segments : %d\n", si->node_segs);
	247	seq_printf(s, "Try to move %d blocks\n", si->tot_blks);
	248	seq_printf(s, " - data blocks : %d\n", si->data_blks);
	249	seq_printf(s, " - node blocks : %d\n", si->node_blks);
	250	seq_printf(s, "\nExtent Hit Ratio: %d / %d\n",
	251	si->hit_ext, si->total_ext);
6c311ec6	252	seq_puts(s, "\nBalancing F2FS Async:\n");
8dcf2ff7 JK	253	seq_printf(s, " - inmem: %4d\n",
8dcf2ff7 JK	254	si->inmem_pages);
499046ab	255	seq_printf(s, " - nodes: %4d in %4d\n",
902829aa	256	si->ndirty_node, si->node_pages);
499046ab	257	seq_printf(s, " - dents: %4d in dirs:%4d\n",
902829aa	258	si->ndirty_dent, si->ndirty_dirs);
499046ab	259	seq_printf(s, " - meta: %4d in %4d\n",
902829aa	260	si->ndirty_meta, si->meta_pages);
a5f42010 JK	261	seq_printf(s, " - NATs: %9d\n - SITs: %9d\n",
	262	si->nats, si->sits);
	263	seq_printf(s, " - free_nids: %9d\n",
	264	si->fnids);
2d219c51 GZ	265	seq_puts(s, "\nDistribution of User Blocks:");
	266	seq_puts(s, " [ valid \| invalid \| free ]\n");
	267	seq_puts(s, " [");
902829aa GKH	268
902829aa GKH	269	for (j = 0; j < si->util_valid; j++)
2d219c51 GZ	270	seq_putc(s, '-');
2d219c51 GZ	271	seq_putc(s, '\|');
902829aa GKH	272
902829aa GKH	273	for (j = 0; j < si->util_invalid; j++)
2d219c51 GZ	274	seq_putc(s, '-');
2d219c51 GZ	275	seq_putc(s, '\|');
902829aa GKH	276
902829aa GKH	277	for (j = 0; j < si->util_free; j++)
2d219c51 GZ	278	seq_putc(s, '-');
2d219c51 GZ	279	seq_puts(s, "]\n\n");
902829aa GKH	280	seq_printf(s, "SSR: %u blocks in %u segments\n",
	281	si->block_count[SSR], si->segment_count[SSR]);
	282	seq_printf(s, "LFS: %u blocks in %u segments\n",
	283	si->block_count[LFS], si->segment_count[LFS]);
	284
	285	/* segment usage info */
	286	update_sit_info(si->sbi);
	287	seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
	288	si->bimodal, si->avg_vblocks);
	289
	290	/* memory footprint */
	291	update_mem_info(si->sbi);
	292	seq_printf(s, "\nMemory: %u KB = static: %u + cached: %u\n",
	293	(si->base_mem + si->cache_mem) >> 10,
	294	si->base_mem >> 10, si->cache_mem >> 10);
902829aa	295	}
66af62ce	296	mutex_unlock(&f2fs_stat_mutex);
902829aa GKH	297	return 0;
	298	}
	299
	300	static int stat_open(struct inode inode, struct file file)
	301	{
	302	return single_open(file, stat_show, inode->i_private);
	303	}
	304
	305	static const struct file_operations stat_fops = {
	306	.open = stat_open,
	307	.read = seq_read,
	308	.llseek = seq_lseek,
	309	.release = single_release,
	310	};
	311
4589d25d	312	int f2fs_build_stats(struct f2fs_sb_info *sbi)
902829aa GKH	313	{
	314	struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
	315	struct f2fs_stat_info *si;
	316
963d4f7d GZ	317	si = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
963d4f7d GZ	318	if (!si)
902829aa GKH	319	return -ENOMEM;
902829aa GKH	320
902829aa GKH	321	si->all_area_segs = le32_to_cpu(raw_super->segment_count);
	322	si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
	323	si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
	324	si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
	325	si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
	326	si->main_area_sections = le32_to_cpu(raw_super->section_count);
	327	si->main_area_zones = si->main_area_sections /
	328	le32_to_cpu(raw_super->secs_per_zone);
	329	si->sbi = sbi;
963d4f7d	330	sbi->stat_info = si;
66af62ce	331
	332	mutex_lock(&f2fs_stat_mutex);
	333	list_add_tail(&si->stat_list, &f2fs_stat_list);
	334	mutex_unlock(&f2fs_stat_mutex);
	335
902829aa GKH	336	return 0;
	337	}
	338
902829aa GKH	339	void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
902829aa GKH	340	{
963d4f7d	341	struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa	342
66af62ce	343	mutex_lock(&f2fs_stat_mutex);
902829aa	344	list_del(&si->stat_list);
66af62ce	345	mutex_unlock(&f2fs_stat_mutex);
66af62ce	346
963d4f7d	347	kfree(si);
902829aa GKH	348	}
902829aa GKH	349
4589d25d NJ	350	void __init f2fs_create_root_stats(void)
4589d25d NJ	351	{
c524723e YL	352	struct dentry *file;
c524723e YL	353
40e1ebe9 YL	354	f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
40e1ebe9 YL	355	if (!f2fs_debugfs_root)
7a6c76b1	356	return;
c524723e	357
40e1ebe9	358	file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
c524723e	359	NULL, &stat_fops);
7a6c76b1 GZ	360	if (!file) {
	361	debugfs_remove(f2fs_debugfs_root);
	362	f2fs_debugfs_root = NULL;
	363	}
4589d25d NJ	364	}
	365
	366	void f2fs_destroy_root_stats(void)
902829aa	367	{
40e1ebe9	368	if (!f2fs_debugfs_root)
c524723e YL	369	return;
c524723e YL	370
40e1ebe9 YL	371	debugfs_remove_recursive(f2fs_debugfs_root);
40e1ebe9 YL	372	f2fs_debugfs_root = NULL;
902829aa	373	}