[mirror_ubuntu-zesty-kernel.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_largest = atomic_read(&sbi->read_hit_largest);
	si->hit_cached = atomic_read(&sbi->read_hit_cached);
	si->hit_ext = atomic_read(&sbi->read_hit_ext);
	si->total_ext = atomic_read(&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_xattr = atomic_read(&sbi->inline_xattr);
	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 long long blks_per_sec, hblks_per_sec, total_vblocks;
	unsigned long long 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 = div_u64(MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec, 100);
	si->bimodal = div_u64(bimodal, dist);
	if (si->dirty_count)
		si->avg_vblocks = div_u64(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_xattr Inode: %u\n",
			   si->inline_xattr);
		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: L1-1:%d L1-2:%d L2:%d / %d\n",
				si->hit_largest, si->hit_cached,
				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->total_hit_ext, 0);
	atomic_set(&sbi->read_hit_ext, 0);
	atomic_set(&sbi->read_hit_largest, 0);
	atomic_set(&sbi->read_hit_cached, 0);

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