[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 = atomic64_read(&sbi->read_hit_largest);
	si->hit_cached = atomic64_read(&sbi->read_hit_cached);
	si->hit_rbtree = atomic64_read(&sbi->read_hit_rbtree);
	si->hit_total = si->hit_largest + si->hit_cached + si->hit_rbtree;
	si->total_ext = atomic64_read(&sbi->total_hit_ext);
	si->ext_tree = atomic_read(&sbi->total_ext_tree);
	si->zombie_tree = atomic_read(&sbi->total_zombie_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_meta = get_pages(sbi, F2FS_DIRTY_META);
	si->ndirty_data = get_pages(sbi, F2FS_DIRTY_DATA);
	si->ndirty_imeta = get_pages(sbi, F2FS_DIRTY_IMETA);
	si->ndirty_dirs = sbi->ndirty_inode[DIR_INODE];
	si->ndirty_files = sbi->ndirty_inode[FILE_INODE];
	si->ndirty_all = sbi->ndirty_inode[DIRTY_META];
	si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
	si->nr_wb_cp_data = get_pages(sbi, F2FS_WB_CP_DATA);
	si->nr_wb_data = get_pages(sbi, F2FS_WB_DATA);
	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->discard_blks = discard_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->orphans = sbi->im[ORPHAN_INO].ino_num;
	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->free_nids = NM_I(sbi)->nid_cnt[FREE_NID_LIST];
	si->alloc_nids = NM_I(sbi)->nid_cnt[ALLOC_NID_LIST];
	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 * sbi->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);
	si->base_mem += sizeof(struct percpu_counter) * NR_COUNT_TYPE;

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

	/* build sit */
	si->base_mem += sizeof(struct sit_info);
	si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
	si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
	si->base_mem += 2 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
	if (f2fs_discard_en(sbi))
		si->base_mem += 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_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)->nid_cnt[FREE_NID_LIST] +
				NM_I(sbi)->nid_cnt[ALLOC_NID_LIST]) *
				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);
	for (i = 0; i <= ORPHAN_INO; i++)
		si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
	si->cache_mem += atomic_read(&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_SHIFT;
	npages = META_MAPPING(sbi)->nrpages;
	si->page_mem += (unsigned long long)npages << PAGE_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) {
		update_general_status(si->sbi);

		seq_printf(s, "\n=====[ partition info(%pg). #%d, %s]=====\n",
			si->sbi->sb->s_bdev, i++,
			f2fs_readonly(si->sbi->sb) ? "RO": "RW");
		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);
		if (test_opt(si->sbi, DISCARD))
			seq_printf(s, "Utilization: %u%% (%u valid blocks, %u discard blocks)\n",
				si->utilization, si->valid_count, si->discard_blks);
		else
			seq_printf(s, "Utilization: %u%% (%u 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, "  - Orphan Inode: %u\n",
			   si->orphans);
		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 (BG: %d)\n",
				si->cp_count, si->bg_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:%llu L1-2:%llu L2:%llu\n",
				si->hit_largest, si->hit_cached,
				si->hit_rbtree);
		seq_printf(s, "  - Hit Ratio: %llu%% (%llu / %llu)\n",
				!si->total_ext ? 0 :
				div64_u64(si->hit_total * 100, si->total_ext),
				si->hit_total, si->total_ext);
		seq_printf(s, "  - Inner Struct Count: tree: %d(%d), node: %d\n",
				si->ext_tree, si->zombie_tree, si->ext_node);
		seq_puts(s, "\nBalancing F2FS Async:\n");
		seq_printf(s, "  - inmem: %4d, wb_cp_data: %4d, wb_data: %4d\n",
			   si->inmem_pages, si->nr_wb_cp_data, si->nr_wb_data);
		seq_printf(s, "  - nodes: %4d in %4d\n",
			   si->ndirty_node, si->node_pages);
		seq_printf(s, "  - dents: %4d in dirs:%4d (%4d)\n",
			   si->ndirty_dent, si->ndirty_dirs, si->ndirty_all);
		seq_printf(s, "  - datas: %4d in files:%4d\n",
			   si->ndirty_data, si->ndirty_files);
		seq_printf(s, "  - meta: %4d in %4d\n",
			   si->ndirty_meta, si->meta_pages);
		seq_printf(s, "  - imeta: %4d\n",
			   si->ndirty_imeta);
		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, alloc_nids: %9d\n",
			   si->free_nids, si->alloc_nids);
		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 = {
	.owner = THIS_MODULE,
	.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;

	atomic64_set(&sbi->total_hit_ext, 0);
	atomic64_set(&sbi->read_hit_rbtree, 0);
	atomic64_set(&sbi->read_hit_largest, 0);
	atomic64_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);
}

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

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

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

	return 0;
}

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