debug.c 14.4 KB
Newer Older
J
Jaegeuk Kim 已提交
1
/*
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
 * 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);
27
static struct dentry *f2fs_debugfs_root;
28
static DEFINE_MUTEX(f2fs_stat_mutex);
29

30
static void update_general_status(struct f2fs_sb_info *sbi)
31
{
32
	struct f2fs_stat_info *si = F2FS_STAT(sbi);
33 34
	int i;

A
arter97 已提交
35
	/* validation check of the segment numbers */
36 37 38
	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);
39
	si->hit_total = si->hit_largest + si->hit_cached + si->hit_rbtree;
40
	si->total_ext = atomic64_read(&sbi->total_hit_ext);
41
	si->ext_tree = atomic_read(&sbi->total_ext_tree);
J
Jaegeuk Kim 已提交
42
	si->zombie_tree = atomic_read(&sbi->total_zombie_tree);
43
	si->ext_node = atomic_read(&sbi->total_ext_node);
44 45 46
	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);
C
Chao Yu 已提交
47 48 49
	si->ndirty_data = get_pages(sbi, F2FS_DIRTY_DATA);
	si->ndirty_dirs = sbi->ndirty_inode[DIR_INODE];
	si->ndirty_files = sbi->ndirty_inode[FILE_INODE];
50
	si->ndirty_all = sbi->ndirty_inode[DIRTY_META];
51
	si->inmem_pages = get_pages(sbi, F2FS_INMEM_PAGES);
52
	si->wb_bios = atomic_read(&sbi->nr_wb_bios);
53 54 55 56 57 58
	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);
C
Chao Yu 已提交
59
	si->inline_xattr = atomic_read(&sbi->inline_xattr);
60 61
	si->inline_inode = atomic_read(&sbi->inline_inode);
	si->inline_dir = atomic_read(&sbi->inline_dir);
J
Jaegeuk Kim 已提交
62
	si->orphans = sbi->im[ORPHAN_INO].ino_num;
63 64 65 66 67 68
	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);
69
	si->node_pages = NODE_MAPPING(sbi)->nrpages;
G
Gu Zheng 已提交
70
	si->meta_pages = META_MAPPING(sbi)->nrpages;
71
	si->nats = NM_I(sbi)->nat_cnt;
72 73 74
	si->dirty_nats = NM_I(sbi)->dirty_nat_cnt;
	si->sits = MAIN_SEGS(sbi);
	si->dirty_sits = SIT_I(sbi)->dirty_sentries;
75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
	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];
	}
96 97

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

J
Jaegeuk Kim 已提交
100
/*
101 102 103 104
 * This function calculates BDF of every segments
 */
static void update_sit_info(struct f2fs_sb_info *sbi)
{
105
	struct f2fs_stat_info *si = F2FS_STAT(sbi);
106 107
	unsigned long long blks_per_sec, hblks_per_sec, total_vblocks;
	unsigned long long bimodal, dist;
108 109 110 111 112
	unsigned int segno, vblocks;
	int ndirty = 0;

	bimodal = 0;
	total_vblocks = 0;
113
	blks_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
114
	hblks_per_sec = blks_per_sec / 2;
115
	for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) {
116 117 118 119 120 121 122 123 124
		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++;
		}
	}
125
	dist = div_u64(MAIN_SECS(sbi) * hblks_per_sec * hblks_per_sec, 100);
C
Chao Yu 已提交
126
	si->bimodal = div64_u64(bimodal, dist);
127
	if (si->dirty_count)
128
		si->avg_vblocks = div_u64(total_vblocks, ndirty);
129 130 131 132
	else
		si->avg_vblocks = 0;
}

J
Jaegeuk Kim 已提交
133
/*
134 135 136 137
 * This function calculates memory footprint.
 */
static void update_mem_info(struct f2fs_sb_info *sbi)
{
138
	struct f2fs_stat_info *si = F2FS_STAT(sbi);
139
	unsigned npages;
140
	int i;
141 142 143 144 145 146 147

	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);
148
	si->base_mem += sizeof(struct percpu_counter) * NR_COUNT_TYPE;
149 150 151 152 153 154

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

	/* build sit */
	si->base_mem += sizeof(struct sit_info);
155 156
	si->base_mem += MAIN_SEGS(sbi) * sizeof(struct seg_entry);
	si->base_mem += f2fs_bitmap_size(MAIN_SEGS(sbi));
157
	si->base_mem += 3 * SIT_VBLOCK_MAP_SIZE * MAIN_SEGS(sbi);
J
Jaegeuk Kim 已提交
158
	si->base_mem += SIT_VBLOCK_MAP_SIZE;
159
	if (sbi->segs_per_sec > 1)
160
		si->base_mem += MAIN_SECS(sbi) * sizeof(struct sec_entry);
161 162 163 164
	si->base_mem += __bitmap_size(sbi, SIT_BITMAP);

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

	/* build curseg */
	si->base_mem += sizeof(struct curseg_info) * NR_CURSEG_TYPE;
170
	si->base_mem += PAGE_SIZE * NR_CURSEG_TYPE;
171 172 173

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

A
arter97 已提交
177
	/* build nm */
178 179 180
	si->base_mem += sizeof(struct f2fs_nm_info);
	si->base_mem += __bitmap_size(sbi, NAT_BITMAP);

181 182 183
get_cache:
	si->cache_mem = 0;

184
	/* build gc */
185 186 187 188 189 190
	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);
191 192

	/* free nids */
193 194
	si->cache_mem += NM_I(sbi)->fcnt * sizeof(struct free_nid);
	si->cache_mem += NM_I(sbi)->nat_cnt * sizeof(struct nat_entry);
195 196 197
	si->cache_mem += NM_I(sbi)->dirty_nat_cnt *
					sizeof(struct nat_entry_set);
	si->cache_mem += si->inmem_pages * sizeof(struct inmem_pages);
J
Jaegeuk Kim 已提交
198
	for (i = 0; i <= ORPHAN_INO; i++)
199
		si->cache_mem += sbi->im[i].ino_num * sizeof(struct ino_entry);
200 201
	si->cache_mem += atomic_read(&sbi->total_ext_tree) *
						sizeof(struct extent_tree);
202 203
	si->cache_mem += atomic_read(&sbi->total_ext_node) *
						sizeof(struct extent_node);
204 205 206

	si->page_mem = 0;
	npages = NODE_MAPPING(sbi)->nrpages;
207
	si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
208
	npages = META_MAPPING(sbi)->nrpages;
209
	si->page_mem += (unsigned long long)npages << PAGE_SHIFT;
210 211 212 213
}

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

218
	mutex_lock(&f2fs_stat_mutex);
219
	list_for_each_entry(si, &f2fs_stat_list, stat_list) {
220 221
		update_general_status(si->sbi);

J
Jaegeuk Kim 已提交
222 223 224
		seq_printf(s, "\n=====[ partition info(%pg). #%d, %s]=====\n",
			si->sbi->sb->s_bdev, i++,
			f2fs_readonly(si->sbi->sb) ? "RO": "RW");
225 226
		seq_printf(s, "[SB: 1] [CP: 2] [SIT: %d] [NAT: %d] ",
			   si->sit_area_segs, si->nat_area_segs);
227 228 229 230 231 232 233 234 235 236 237
		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);
C
Chao Yu 已提交
238 239
		seq_printf(s, "  - Inline_xattr Inode: %u\n",
			   si->inline_xattr);
240 241
		seq_printf(s, "  - Inline_data Inode: %u\n",
			   si->inline_inode);
242 243
		seq_printf(s, "  - Inline_dentry Inode: %u\n",
			   si->inline_dir);
J
Jaegeuk Kim 已提交
244 245
		seq_printf(s, "  - Orphan Inode: %u\n",
			   si->orphans);
246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278
		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);
279 280
		seq_printf(s, "CP calls: %d (BG: %d)\n",
				si->cp_count, si->bg_cp_count);
281 282
		seq_printf(s, "GC calls: %d (BG: %d)\n",
			   si->call_count, si->bg_gc);
283 284 285 286 287 288 289 290 291 292
		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);
293
		seq_puts(s, "\nExtent Cache:\n");
294
		seq_printf(s, "  - Hit Count: L1-1:%llu L1-2:%llu L2:%llu\n",
295
				si->hit_largest, si->hit_cached,
296
				si->hit_rbtree);
297
		seq_printf(s, "  - Hit Ratio: %llu%% (%llu / %llu)\n",
298
				!si->total_ext ? 0 :
299
				div64_u64(si->hit_total * 100, si->total_ext),
300
				si->hit_total, si->total_ext);
J
Jaegeuk Kim 已提交
301 302
		seq_printf(s, "  - Inner Struct Count: tree: %d(%d), node: %d\n",
				si->ext_tree, si->zombie_tree, si->ext_node);
C
Chris Fries 已提交
303
		seq_puts(s, "\nBalancing F2FS Async:\n");
304
		seq_printf(s, "  - inmem: %4lld, wb_bios: %4d\n",
305
			   si->inmem_pages, si->wb_bios);
306
		seq_printf(s, "  - nodes: %4lld in %4d\n",
307
			   si->ndirty_node, si->node_pages);
308 309
		seq_printf(s, "  - dents: %4lld in dirs:%4d (%4d)\n",
			   si->ndirty_dent, si->ndirty_dirs, si->ndirty_all);
310
		seq_printf(s, "  - datas: %4lld in files:%4d\n",
C
Chao Yu 已提交
311
			   si->ndirty_data, si->ndirty_files);
312
		seq_printf(s, "  - meta: %4lld in %4d\n",
313
			   si->ndirty_meta, si->meta_pages);
314 315
		seq_printf(s, "  - NATs: %9d/%9d\n  - SITs: %9d/%9d\n",
			   si->dirty_nats, si->nats, si->dirty_sits, si->sits);
J
Jaegeuk Kim 已提交
316 317
		seq_printf(s, "  - free_nids: %9d\n",
			   si->fnids);
318 319 320
		seq_puts(s, "\nDistribution of User Blocks:");
		seq_puts(s, " [ valid | invalid | free ]\n");
		seq_puts(s, "  [");
321 322

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

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

		for (j = 0; j < si->util_free; j++)
331 332
			seq_putc(s, '-');
		seq_puts(s, "]\n\n");
333
		seq_printf(s, "IPU: %u blocks\n", si->inplace_count);
334 335 336 337 338 339 340 341 342 343 344 345
		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);
C
Chao Yu 已提交
346
		seq_printf(s, "\nMemory: %llu KB\n",
347
			(si->base_mem + si->cache_mem + si->page_mem) >> 10);
C
Chao Yu 已提交
348
		seq_printf(s, "  - static: %llu KB\n",
349
				si->base_mem >> 10);
C
Chao Yu 已提交
350
		seq_printf(s, "  - cached: %llu KB\n",
351
				si->cache_mem >> 10);
C
Chao Yu 已提交
352
		seq_printf(s, "  - paged : %llu KB\n",
353
				si->page_mem >> 10);
354
	}
355
	mutex_unlock(&f2fs_stat_mutex);
356 357 358 359 360 361 362 363 364 365 366 367 368 369 370
	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,
};

371
int f2fs_build_stats(struct f2fs_sb_info *sbi)
372 373 374 375
{
	struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
	struct f2fs_stat_info *si;

376 377
	si = kzalloc(sizeof(struct f2fs_stat_info), GFP_KERNEL);
	if (!si)
378 379 380 381 382 383 384 385 386 387 388
		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;
389
	sbi->stat_info = si;
390

391 392 393 394
	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);
395

C
Chao Yu 已提交
396
	atomic_set(&sbi->inline_xattr, 0);
397 398
	atomic_set(&sbi->inline_inode, 0);
	atomic_set(&sbi->inline_dir, 0);
399
	atomic_set(&sbi->inplace_count, 0);
400

401 402 403 404
	mutex_lock(&f2fs_stat_mutex);
	list_add_tail(&si->stat_list, &f2fs_stat_list);
	mutex_unlock(&f2fs_stat_mutex);

405 406 407 408 409
	return 0;
}

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

412
	mutex_lock(&f2fs_stat_mutex);
413
	list_del(&si->stat_list);
414 415
	mutex_unlock(&f2fs_stat_mutex);

416
	kfree(si);
417 418
}

419
int __init f2fs_create_root_stats(void)
420
{
421 422
	struct dentry *file;

423 424
	f2fs_debugfs_root = debugfs_create_dir("f2fs", NULL);
	if (!f2fs_debugfs_root)
425
		return -ENOMEM;
426

427
	file = debugfs_create_file("status", S_IRUGO, f2fs_debugfs_root,
428
			NULL, &stat_fops);
429 430 431
	if (!file) {
		debugfs_remove(f2fs_debugfs_root);
		f2fs_debugfs_root = NULL;
432
		return -ENOMEM;
433
	}
434 435

	return 0;
436 437 438
}

void f2fs_destroy_root_stats(void)
439
{
440
	if (!f2fs_debugfs_root)
441 442
		return;

443 444
	debugfs_remove_recursive(f2fs_debugfs_root);
	f2fs_debugfs_root = NULL;
445
}