[deliverable/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 <gregkh@linuxfoundation.org>
 *
 * 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->ext_tree = sbi->total_ext_tree;
	si->ext_node = atomic_read(&sbi->total_ext_node);
	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->wb_pages = get_pages(sbi, F2FS_WRITEBACK);
	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 = atomic_read(&sbi->inline_inode);
	si->inline_dir = atomic_read(&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->dirty_nats = NM_I(sbi)->dirty_nat_cnt;
	si->sits = MAIN_SEGS(sbi);
	si->dirty_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];
	}

	si->inplace_count = atomic_read(&sbi->inplace_count);
}

/*
 * 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 += 3 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
	si->base_mem += SIT_VBLOCK_MAP_SIZE;
	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);

get_cache:
	si->cache_mem = 0;

	/* build gc */
	if (sbi->gc_thread)
		si->cache_mem += sizeof(struct f2fs_gc_kthread);

	/* build merge flush thread */
	if (SM_I(sbi)->cmd_control_info)
		si->cache_mem += sizeof(struct flush_cmd_control);

	/* free nids */
	si->cache_mem += NM_I(sbi)->fcnt * sizeof(struct free_nid);
	si->cache_mem += NM_I(sbi)->nat_cnt * sizeof(struct nat_entry);
	si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
					sizeof(struct nat_entry_set);
	si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
	si->cache_mem += sbi->n_dirty_dirs * sizeof(struct inode_entry);
	for (i = 0; i <= UPDATE_INO; i++)
		si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
	si->cache_mem += sbi->total_ext_tree * sizeof(struct extent_tree);
	si->cache_mem += atomic_read(&sbi->total_ext_node) *
						sizeof(struct extent_node);

	si->page_mem = 0;
	npages = NODE_MAPPING(sbi)->nrpages;
	si->page_mem += npages << PAGE_CACHE_SHIFT;
	npages = META_MAPPING(sbi)->nrpages;
	si->page_mem += npages << PAGE_CACHE_SHIFT;
}

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 (%d)\n",
				si->data_segs, si->bg_data_segs);
		seq_printf(s, "  - node segments : %d (%d)\n",
				si->node_segs, si->bg_node_segs);
		seq_printf(s, "Try to move %d blocks (BG: %d)\n", si->tot_blks,
				si->bg_data_blks + si->bg_node_blks);
		seq_printf(s, "  - data blocks : %d (%d)\n", si->data_blks,
				si->bg_data_blks);
		seq_printf(s, "  - node blocks : %d (%d)\n", si->node_blks,
				si->bg_node_blks);
		seq_printf(s, "\nExtent Hit Ratio: %d / %d\n",
			   si->hit_ext, si->total_ext);
		seq_printf(s, "\nExtent Tree Count: %d\n", si->ext_tree);
		seq_printf(s, "\nExtent Node Count: %d\n", si->ext_node);
		seq_puts(s, "\nBalancing F2FS Async:\n");
		seq_printf(s, "  - inmem: %4d, wb: %4d\n",
			   si->inmem_pages, si->wb_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/%9d\n  - SITs: %9d/%9d\n",
			   si->dirty_nats, si->nats, si->dirty_sits, 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, "IPU: %u blocks\n", si->inplace_count);
		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\n",
			(si->base_mem + si->cache_mem + si->page_mem) >> 10);
		seq_printf(s, "  - static: %u KB\n",
				si->base_mem >> 10);
		seq_printf(s, "  - cached: %u KB\n",
				si->cache_mem >> 10);
		seq_printf(s, "  - paged : %u KB\n",
				si->page_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;

	atomic_set(&sbi->inline_inode, 0);
	atomic_set(&sbi->inline_dir, 0);
	atomic_set(&sbi->inplace_count, 0);

	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 <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>
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;
902829aa GKH	37	si->total_ext = sbi->total_hit_ext;
4bf6fd9f CY	38	si->ext_tree = sbi->total_ext_tree;
4bf6fd9f CY	39	si->ext_node = atomic_read(&sbi->total_ext_node);
902829aa GKH	40	si->ndirty_node = get_pages(sbi, F2FS_DIRTY_NODES);
	41	si->ndirty_dent = get_pages(sbi, F2FS_DIRTY_DENTS);
	42	si->ndirty_dirs = sbi->n_dirty_dirs;
	43	si->ndirty_meta = get_pages(sbi, F2FS_DIRTY_META);
8dcf2ff7	44	si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
d24bdcbf	45	si->wb_pages = get_pages(sbi, F2FS_WRITEBACK);
902829aa GKH	46	si->total_count = (int)sbi->user_block_count / sbi->blocks_per_seg;
	47	si->rsvd_segs = reserved_segments(sbi);
	48	si->overp_segs = overprovision_segments(sbi);
	49	si->valid_count = valid_user_blocks(sbi);
	50	si->valid_node_count = valid_node_count(sbi);
	51	si->valid_inode_count = valid_inode_count(sbi);
03e14d52 CY	52	si->inline_inode = atomic_read(&sbi->inline_inode);
03e14d52 CY	53	si->inline_dir = atomic_read(&sbi->inline_dir);
902829aa GKH	54	si->utilization = utilization(sbi);
	55
	56	si->free_segs = free_segments(sbi);
	57	si->free_secs = free_sections(sbi);
	58	si->prefree_count = prefree_segments(sbi);
	59	si->dirty_count = dirty_segments(sbi);
4ef51a8f	60	si->node_pages = NODE_MAPPING(sbi)->nrpages;
9df27d98	61	si->meta_pages = META_MAPPING(sbi)->nrpages;
902829aa	62	si->nats = NM_I(sbi)->nat_cnt;
dd4e4b59 JK	63	si->dirty_nats = NM_I(sbi)->dirty_nat_cnt;
	64	si->sits = MAIN_SEGS(sbi);
	65	si->dirty_sits = SIT_I(sbi)->dirty_sentries;
902829aa GKH	66	si->fnids = NM_I(sbi)->fcnt;
	67	si->bg_gc = sbi->bg_gc;
	68	si->util_free = (int)(free_user_blocks(sbi) >> sbi->log_blocks_per_seg)
	69	* 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
	70	/ 2;
	71	si->util_valid = (int)(written_block_count(sbi) >>
	72	sbi->log_blocks_per_seg)
	73	* 100 / (int)(sbi->user_block_count >> sbi->log_blocks_per_seg)
	74	/ 2;
	75	si->util_invalid = 50 - si->util_free - si->util_valid;
	76	for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_NODE; i++) {
	77	struct curseg_info *curseg = CURSEG_I(sbi, i);
	78	si->curseg[i] = curseg->segno;
	79	si->cursec[i] = curseg->segno / sbi->segs_per_sec;
	80	si->curzone[i] = si->cursec[i] / sbi->secs_per_zone;
	81	}
	82
	83	for (i = 0; i < 2; i++) {
	84	si->segment_count[i] = sbi->segment_count[i];
	85	si->block_count[i] = sbi->block_count[i];
	86	}
b9a2c252 CL	87
b9a2c252 CL	88	si->inplace_count = atomic_read(&sbi->inplace_count);
902829aa GKH	89	}
902829aa GKH	90
0a8165d7	91	/*
902829aa GKH	92	* This function calculates BDF of every segments
	93	*/
	94	static void update_sit_info(struct f2fs_sb_info *sbi)
	95	{
963d4f7d	96	struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa	97	unsigned int blks_per_sec, hblks_per_sec, total_vblocks, bimodal, dist;
902829aa GKH	98	unsigned int segno, vblocks;
	99	int ndirty = 0;
	100
	101	bimodal = 0;
	102	total_vblocks = 0;
	103	blks_per_sec = sbi->segs_per_sec * (1 << sbi->log_blocks_per_seg);
	104	hblks_per_sec = blks_per_sec / 2;
7cd8558b	105	for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
902829aa GKH	106	vblocks = get_valid_blocks(sbi, segno, sbi->segs_per_sec);
	107	dist = abs(vblocks - hblks_per_sec);
	108	bimodal += dist * dist;
	109
	110	if (vblocks > 0 && vblocks < blks_per_sec) {
	111	total_vblocks += vblocks;
	112	ndirty++;
	113	}
	114	}
7cd8558b	115	dist = MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec / 100;
902829aa GKH	116	si->bimodal = bimodal / dist;
	117	if (si->dirty_count)
	118	si->avg_vblocks = total_vblocks / ndirty;
	119	else
	120	si->avg_vblocks = 0;
	121	}
	122
0a8165d7	123	/*
902829aa GKH	124	* This function calculates memory footprint.
	125	*/
	126	static void update_mem_info(struct f2fs_sb_info *sbi)
	127	{
963d4f7d	128	struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa	129	unsigned npages;
8c402946	130	int i;
902829aa GKH	131
	132	if (si->base_mem)
	133	goto get_cache;
	134
	135	si->base_mem = sizeof(struct f2fs_sb_info) + sbi->sb->s_blocksize;
	136	si->base_mem += 2 * sizeof(struct f2fs_inode_info);
	137	si->base_mem += sizeof(*sbi->ckpt);
	138
	139	/* build sm */
	140	si->base_mem += sizeof(struct f2fs_sm_info);
	141
	142	/* build sit */
	143	si->base_mem += sizeof(struct sit_info);
7cd8558b JK	144	si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
7cd8558b JK	145	si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
a66cdd98	146	si->base_mem += 3 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
60a3b782	147	si->base_mem += SIT_VBLOCK_MAP_SIZE;
902829aa	148	if (sbi->segs_per_sec > 1)
7cd8558b	149	si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
902829aa GKH	150	si->base_mem += __bitmap_size(sbi, SIT_BITMAP);
	151
	152	/* build free segmap */
	153	si->base_mem += sizeof(struct free_segmap_info);
7cd8558b JK	154	si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
7cd8558b JK	155	si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
902829aa GKH	156
	157	/* build curseg */
	158	si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
	159	si->base_mem += PAGE_CACHE_SIZE * NR_CURSEG_TYPE;
	160
	161	/* build dirty segmap */
	162	si->base_mem += sizeof(struct dirty_seglist_info);
7cd8558b JK	163	si->base_mem += NR_DIRTY_TYPE * f2fs_bitmap_size(MAIN_SEGS(sbi));
7cd8558b JK	164	si->base_mem += f2fs_bitmap_size(MAIN_SECS(sbi));
902829aa	165
e1c42045	166	/* build nm */
902829aa GKH	167	si->base_mem += sizeof(struct f2fs_nm_info);
	168	si->base_mem += __bitmap_size(sbi, NAT_BITMAP);
	169
9066c6a7 CY	170	get_cache:
	171	si->cache_mem = 0;
	172
902829aa	173	/* build gc */
9066c6a7 CY	174	if (sbi->gc_thread)
	175	si->cache_mem += sizeof(struct f2fs_gc_kthread);
	176
	177	/* build merge flush thread */
	178	if (SM_I(sbi)->cmd_control_info)
	179	si->cache_mem += sizeof(struct flush_cmd_control);
902829aa	180
902829aa	181	/* free nids */
9066c6a7 CY	182	si->cache_mem += NM_I(sbi)->fcnt * sizeof(struct free_nid);
9066c6a7 CY	183	si->cache_mem += NM_I(sbi)->nat_cnt * sizeof(struct nat_entry);
6f0aacbc JK	184	si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
	185	sizeof(struct nat_entry_set);
	186	si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
06292073	187	si->cache_mem += sbi->n_dirty_dirs * sizeof(struct inode_entry);
8c402946	188	for (i = 0; i <= UPDATE_INO; i++)
67298804	189	si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
4bf6fd9f CY	190	si->cache_mem += sbi->total_ext_tree * sizeof(struct extent_tree);
	191	si->cache_mem += atomic_read(&sbi->total_ext_node) *
	192	sizeof(struct extent_node);
6f0aacbc JK	193
	194	si->page_mem = 0;
	195	npages = NODE_MAPPING(sbi)->nrpages;
	196	si->page_mem += npages << PAGE_CACHE_SHIFT;
	197	npages = META_MAPPING(sbi)->nrpages;
	198	si->page_mem += npages << PAGE_CACHE_SHIFT;
902829aa GKH	199	}
	200
	201	static int stat_show(struct seq_file s, void v)
	202	{
145b04e5	203	struct f2fs_stat_info *si;
902829aa GKH	204	int i = 0;
	205	int j;
	206
66af62ce	207	mutex_lock(&f2fs_stat_mutex);
145b04e5	208	list_for_each_entry(si, &f2fs_stat_list, stat_list) {
f83759e2	209	char devname[BDEVNAME_SIZE];
902829aa	210
902829aa GKH	211	update_general_status(si->sbi);
902829aa GKH	212
f83759e2	213	seq_printf(s, "\n=====[ partition info(%s). #%d ]=====\n",
f83759e2	214	bdevname(si->sbi->sb->s_bdev, devname), i++);
7880ceed HL	215	seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
7880ceed HL	216	si->sit_area_segs, si->nat_area_segs);
902829aa GKH	217	seq_printf(s, "[SSA: %d] [MAIN: %d",
	218	si->ssa_area_segs, si->main_area_segs);
	219	seq_printf(s, "(OverProv:%d Resv:%d)]\n\n",
	220	si->overp_segs, si->rsvd_segs);
	221	seq_printf(s, "Utilization: %d%% (%d valid blocks)\n",
	222	si->utilization, si->valid_count);
	223	seq_printf(s, " - Node: %u (Inode: %u, ",
	224	si->valid_node_count, si->valid_inode_count);
	225	seq_printf(s, "Other: %u)\n - Data: %u\n",
	226	si->valid_node_count - si->valid_inode_count,
	227	si->valid_count - si->valid_node_count);
0dbdc2ae JK	228	seq_printf(s, " - Inline_data Inode: %u\n",
0dbdc2ae JK	229	si->inline_inode);
3289c061 JK	230	seq_printf(s, " - Inline_dentry Inode: %u\n",
3289c061 JK	231	si->inline_dir);
902829aa GKH	232	seq_printf(s, "\nMain area: %d segs, %d secs %d zones\n",
	233	si->main_area_segs, si->main_area_sections,
	234	si->main_area_zones);
	235	seq_printf(s, " - COLD data: %d, %d, %d\n",
	236	si->curseg[CURSEG_COLD_DATA],
	237	si->cursec[CURSEG_COLD_DATA],
	238	si->curzone[CURSEG_COLD_DATA]);
	239	seq_printf(s, " - WARM data: %d, %d, %d\n",
	240	si->curseg[CURSEG_WARM_DATA],
	241	si->cursec[CURSEG_WARM_DATA],
	242	si->curzone[CURSEG_WARM_DATA]);
	243	seq_printf(s, " - HOT data: %d, %d, %d\n",
	244	si->curseg[CURSEG_HOT_DATA],
	245	si->cursec[CURSEG_HOT_DATA],
	246	si->curzone[CURSEG_HOT_DATA]);
	247	seq_printf(s, " - Dir dnode: %d, %d, %d\n",
	248	si->curseg[CURSEG_HOT_NODE],
	249	si->cursec[CURSEG_HOT_NODE],
	250	si->curzone[CURSEG_HOT_NODE]);
	251	seq_printf(s, " - File dnode: %d, %d, %d\n",
	252	si->curseg[CURSEG_WARM_NODE],
	253	si->cursec[CURSEG_WARM_NODE],
	254	si->curzone[CURSEG_WARM_NODE]);
	255	seq_printf(s, " - Indir nodes: %d, %d, %d\n",
	256	si->curseg[CURSEG_COLD_NODE],
	257	si->cursec[CURSEG_COLD_NODE],
	258	si->curzone[CURSEG_COLD_NODE]);
	259	seq_printf(s, "\n - Valid: %d\n - Dirty: %d\n",
	260	si->main_area_segs - si->dirty_count -
	261	si->prefree_count - si->free_segs,
	262	si->dirty_count);
	263	seq_printf(s, " - Prefree: %d\n - Free: %d (%d)\n\n",
	264	si->prefree_count, si->free_segs, si->free_secs);
942e0be6	265	seq_printf(s, "CP calls: %d\n", si->cp_count);
902829aa GKH	266	seq_printf(s, "GC calls: %d (BG: %d)\n",
902829aa GKH	267	si->call_count, si->bg_gc);
e1235983 CL	268	seq_printf(s, " - data segments : %d (%d)\n",
	269	si->data_segs, si->bg_data_segs);
	270	seq_printf(s, " - node segments : %d (%d)\n",
	271	si->node_segs, si->bg_node_segs);
	272	seq_printf(s, "Try to move %d blocks (BG: %d)\n", si->tot_blks,
	273	si->bg_data_blks + si->bg_node_blks);
	274	seq_printf(s, " - data blocks : %d (%d)\n", si->data_blks,
	275	si->bg_data_blks);
	276	seq_printf(s, " - node blocks : %d (%d)\n", si->node_blks,
	277	si->bg_node_blks);
902829aa GKH	278	seq_printf(s, "\nExtent Hit Ratio: %d / %d\n",
902829aa GKH	279	si->hit_ext, si->total_ext);
4bf6fd9f CY	280	seq_printf(s, "\nExtent Tree Count: %d\n", si->ext_tree);
4bf6fd9f CY	281	seq_printf(s, "\nExtent Node Count: %d\n", si->ext_node);
6c311ec6	282	seq_puts(s, "\nBalancing F2FS Async:\n");
d24bdcbf JK	283	seq_printf(s, " - inmem: %4d, wb: %4d\n",
d24bdcbf JK	284	si->inmem_pages, si->wb_pages);
499046ab	285	seq_printf(s, " - nodes: %4d in %4d\n",
902829aa	286	si->ndirty_node, si->node_pages);
499046ab	287	seq_printf(s, " - dents: %4d in dirs:%4d\n",
902829aa	288	si->ndirty_dent, si->ndirty_dirs);
499046ab	289	seq_printf(s, " - meta: %4d in %4d\n",
902829aa	290	si->ndirty_meta, si->meta_pages);
dd4e4b59 JK	291	seq_printf(s, " - NATs: %9d/%9d\n - SITs: %9d/%9d\n",
dd4e4b59 JK	292	si->dirty_nats, si->nats, si->dirty_sits, si->sits);
a5f42010 JK	293	seq_printf(s, " - free_nids: %9d\n",
a5f42010 JK	294	si->fnids);
2d219c51 GZ	295	seq_puts(s, "\nDistribution of User Blocks:");
	296	seq_puts(s, " [ valid \| invalid \| free ]\n");
	297	seq_puts(s, " [");
902829aa GKH	298
902829aa GKH	299	for (j = 0; j < si->util_valid; j++)
2d219c51 GZ	300	seq_putc(s, '-');
2d219c51 GZ	301	seq_putc(s, '\|');
902829aa GKH	302
902829aa GKH	303	for (j = 0; j < si->util_invalid; j++)
2d219c51 GZ	304	seq_putc(s, '-');
2d219c51 GZ	305	seq_putc(s, '\|');
902829aa GKH	306
902829aa GKH	307	for (j = 0; j < si->util_free; j++)
2d219c51 GZ	308	seq_putc(s, '-');
2d219c51 GZ	309	seq_puts(s, "]\n\n");
b9a2c252	310	seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
902829aa GKH	311	seq_printf(s, "SSR: %u blocks in %u segments\n",
	312	si->block_count[SSR], si->segment_count[SSR]);
	313	seq_printf(s, "LFS: %u blocks in %u segments\n",
	314	si->block_count[LFS], si->segment_count[LFS]);
	315
	316	/* segment usage info */
	317	update_sit_info(si->sbi);
	318	seq_printf(s, "\nBDF: %u, avg. vblocks: %u\n",
	319	si->bimodal, si->avg_vblocks);
	320
	321	/* memory footprint */
	322	update_mem_info(si->sbi);
6f0aacbc JK	323	seq_printf(s, "\nMemory: %u KB\n",
	324	(si->base_mem + si->cache_mem + si->page_mem) >> 10);
	325	seq_printf(s, " - static: %u KB\n",
	326	si->base_mem >> 10);
	327	seq_printf(s, " - cached: %u KB\n",
	328	si->cache_mem >> 10);
	329	seq_printf(s, " - paged : %u KB\n",
	330	si->page_mem >> 10);
902829aa	331	}
66af62ce	332	mutex_unlock(&f2fs_stat_mutex);
902829aa GKH	333	return 0;
	334	}
	335
	336	static int stat_open(struct inode inode, struct file file)
	337	{
	338	return single_open(file, stat_show, inode->i_private);
	339	}
	340
	341	static const struct file_operations stat_fops = {
	342	.open = stat_open,
	343	.read = seq_read,
	344	.llseek = seq_lseek,
	345	.release = single_release,
	346	};
	347
4589d25d	348	int f2fs_build_stats(struct f2fs_sb_info *sbi)
902829aa GKH	349	{
	350	struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
	351	struct f2fs_stat_info *si;
	352
963d4f7d GZ	353	si = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
963d4f7d GZ	354	if (!si)
902829aa GKH	355	return -ENOMEM;
902829aa GKH	356
902829aa GKH	357	si->all_area_segs = le32_to_cpu(raw_super->segment_count);
	358	si->sit_area_segs = le32_to_cpu(raw_super->segment_count_sit);
	359	si->nat_area_segs = le32_to_cpu(raw_super->segment_count_nat);
	360	si->ssa_area_segs = le32_to_cpu(raw_super->segment_count_ssa);
	361	si->main_area_segs = le32_to_cpu(raw_super->segment_count_main);
	362	si->main_area_sections = le32_to_cpu(raw_super->section_count);
	363	si->main_area_zones = si->main_area_sections /
	364	le32_to_cpu(raw_super->secs_per_zone);
	365	si->sbi = sbi;
963d4f7d	366	sbi->stat_info = si;
66af62ce	367
03e14d52 CY	368	atomic_set(&sbi->inline_inode, 0);
03e14d52 CY	369	atomic_set(&sbi->inline_dir, 0);
b9a2c252	370	atomic_set(&sbi->inplace_count, 0);
03e14d52	371
66af62ce	372	mutex_lock(&f2fs_stat_mutex);
	373	list_add_tail(&si->stat_list, &f2fs_stat_list);
	374	mutex_unlock(&f2fs_stat_mutex);
	375
902829aa GKH	376	return 0;
	377	}
	378
902829aa GKH	379	void f2fs_destroy_stats(struct f2fs_sb_info *sbi)
902829aa GKH	380	{
963d4f7d	381	struct f2fs_stat_info *si = F2FS_STAT(sbi);
902829aa	382
66af62ce	383	mutex_lock(&f2fs_stat_mutex);
902829aa	384	list_del(&si->stat_list);
66af62ce	385	mutex_unlock(&f2fs_stat_mutex);
66af62ce	386
963d4f7d	387	kfree(si);
902829aa GKH	388	}
902829aa GKH	389
4589d25d NJ	390	void __init f2fs_create_root_stats(void)
4589d25d NJ	391	{
c524723e YL	392	struct dentry *file;
c524723e YL	393
40e1ebe9 YL	394	f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
40e1ebe9 YL	395	if (!f2fs_debugfs_root)
7a6c76b1	396	return;
c524723e	397
40e1ebe9	398	file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
c524723e	399	NULL, &stat_fops);
7a6c76b1 GZ	400	if (!file) {
	401	debugfs_remove(f2fs_debugfs_root);
	402	f2fs_debugfs_root = NULL;
	403	}
4589d25d NJ	404	}
	405
	406	void f2fs_destroy_root_stats(void)
902829aa	407	{
40e1ebe9	408	if (!f2fs_debugfs_root)
c524723e YL	409	return;
c524723e YL	410
40e1ebe9 YL	411	debugfs_remove_recursive(f2fs_debugfs_root);
40e1ebe9 YL	412	f2fs_debugfs_root = NULL;
902829aa	413	}