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