[linux.git] / fs / f2fs / trace.c

/*
 * f2fs IO tracer
 *
 * Copyright (c) 2014 Motorola Mobility
 * Copyright (c) 2014 Jaegeuk Kim <[email protected]>
 *
 * 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/f2fs_fs.h>
#include <linux/sched.h>
#include <linux/radix-tree.h>

#include "f2fs.h"
#include "trace.h"

static RADIX_TREE(pids, GFP_ATOMIC);
static spinlock_t pids_lock;
static struct last_io_info last_io;

static inline void __print_last_io(void)
{
	if (!last_io.len)
		return;

	trace_printk("%3x:%3x %4x %-16s %2x %5x %12x %4x\n",
			last_io.major, last_io.minor,
			last_io.pid, "----------------",
			last_io.type,
			last_io.fio.rw, last_io.fio.blk_addr,
			last_io.len);
	memset(&last_io, 0, sizeof(last_io));
}

static int __file_type(struct inode *inode, pid_t pid)
{
	if (f2fs_is_atomic_file(inode))
		return __ATOMIC_FILE;
	else if (f2fs_is_volatile_file(inode))
		return __VOLATILE_FILE;
	else if (S_ISDIR(inode->i_mode))
		return __DIR_FILE;
	else if (inode->i_ino == F2FS_NODE_INO(F2FS_I_SB(inode)))
		return __NODE_FILE;
	else if (inode->i_ino == F2FS_META_INO(F2FS_I_SB(inode)))
		return __META_FILE;
	else if (pid)
		return __NORMAL_FILE;
	else
		return __MISC_FILE;
}

void f2fs_trace_pid(struct page *page)
{
	struct inode *inode = page->mapping->host;
	pid_t pid = task_pid_nr(current);
	void *p;

	page->private = pid;

	if (radix_tree_preload(GFP_NOFS))
		return;

	spin_lock(&pids_lock);
	p = radix_tree_lookup(&pids, pid);
	if (p == current)
		goto out;
	if (p)
		radix_tree_delete(&pids, pid);

	f2fs_radix_tree_insert(&pids, pid, current);

	trace_printk("%3x:%3x %4x %-16s\n",
			MAJOR(inode->i_sb->s_dev), MINOR(inode->i_sb->s_dev),
			pid, current->comm);
out:
	spin_unlock(&pids_lock);
	radix_tree_preload_end();
}

void f2fs_trace_ios(struct f2fs_io_info *fio, int flush)
{
	struct inode *inode;
	pid_t pid;
	int major, minor;

	if (flush) {
		__print_last_io();
		return;
	}

	inode = fio->page->mapping->host;
	pid = page_private(fio->page);

	major = MAJOR(inode->i_sb->s_dev);
	minor = MINOR(inode->i_sb->s_dev);

	if (last_io.major == major && last_io.minor == minor &&
			last_io.pid == pid &&
			last_io.type == __file_type(inode, pid) &&
			last_io.fio.rw == fio->rw &&
			last_io.fio.blk_addr + last_io.len == fio->blk_addr) {
		last_io.len++;
		return;
	}

	__print_last_io();

	last_io.major = major;
	last_io.minor = minor;
	last_io.pid = pid;
	last_io.type = __file_type(inode, pid);
	last_io.fio = *fio;
	last_io.len = 1;
	return;
}

void f2fs_build_trace_ios(void)
{
	spin_lock_init(&pids_lock);
}

#define PIDVEC_SIZE	128
static unsigned int gang_lookup_pids(pid_t *results, unsigned long first_index,
							unsigned int max_items)
{
	struct radix_tree_iter iter;
	void **slot;
	unsigned int ret = 0;

	if (unlikely(!max_items))
		return 0;

	radix_tree_for_each_slot(slot, &pids, &iter, first_index) {
		results[ret] = iter.index;
		if (++ret == PIDVEC_SIZE)
			break;
	}
	return ret;
}

void f2fs_destroy_trace_ios(void)
{
	pid_t pid[PIDVEC_SIZE];
	pid_t next_pid = 0;
	unsigned int found;

	spin_lock(&pids_lock);
	while ((found = gang_lookup_pids(pid, next_pid, PIDVEC_SIZE))) {
		unsigned idx;

		next_pid = pid[found - 1] + 1;
		for (idx = 0; idx < found; idx++)
			radix_tree_delete(&pids, pid[idx]);
	}
	spin_unlock(&pids_lock);
}
Commit	Line	Data
63f92ddc JK	1	/*
	2	* f2fs IO tracer
	3	*
	4	* Copyright (c) 2014 Motorola Mobility
	5	* Copyright (c) 2014 Jaegeuk Kim <[email protected]>
	6	*
	7	* This program is free software; you can redistribute it and/or modify
	8	* it under the terms of the GNU General Public License version 2 as
	9	* published by the Free Software Foundation.
	10	*/
	11	#include <linux/fs.h>
	12	#include <linux/f2fs_fs.h>
	13	#include <linux/sched.h>
351f4fba	14	#include <linux/radix-tree.h>
63f92ddc JK	15
	16	#include "f2fs.h"
	17	#include "trace.h"
	18
29e7043f	19	static RADIX_TREE(pids, GFP_ATOMIC);
08e4126e	20	static spinlock_t pids_lock;
29e7043f	21	static struct last_io_info last_io;
0e689d03 JK	22
	23	static inline void __print_last_io(void)
	24	{
	25	if (!last_io.len)
	26	return;
	27
	28	trace_printk("%3x:%3x %4x %-16s %2x %5x %12x %4x\n",
	29	last_io.major, last_io.minor,
	30	last_io.pid, "----------------",
	31	last_io.type,
	32	last_io.fio.rw, last_io.fio.blk_addr,
	33	last_io.len);
	34	memset(&last_io, 0, sizeof(last_io));
	35	}
	36
	37	static int __file_type(struct inode *inode, pid_t pid)
	38	{
	39	if (f2fs_is_atomic_file(inode))
	40	return __ATOMIC_FILE;
	41	else if (f2fs_is_volatile_file(inode))
	42	return __VOLATILE_FILE;
	43	else if (S_ISDIR(inode->i_mode))
	44	return __DIR_FILE;
	45	else if (inode->i_ino == F2FS_NODE_INO(F2FS_I_SB(inode)))
	46	return __NODE_FILE;
	47	else if (inode->i_ino == F2FS_META_INO(F2FS_I_SB(inode)))
	48	return __META_FILE;
	49	else if (pid)
	50	return __NORMAL_FILE;
	51	else
	52	return __MISC_FILE;
	53	}
	54
63f92ddc JK	55	void f2fs_trace_pid(struct page *page)
63f92ddc JK	56	{
0e689d03 JK	57	struct inode *inode = page->mapping->host;
	58	pid_t pid = task_pid_nr(current);
	59	void *p;
	60
	61	page->private = pid;
	62
c0508650 JK	63	if (radix_tree_preload(GFP_NOFS))
	64	return;
	65
	66	spin_lock(&pids_lock);
0e689d03 JK	67	p = radix_tree_lookup(&pids, pid);
0e689d03 JK	68	if (p == current)
c0508650	69	goto out;
0e689d03 JK	70	if (p)
	71	radix_tree_delete(&pids, pid);
	72
	73	f2fs_radix_tree_insert(&pids, pid, current);
	74
	75	trace_printk("%3x:%3x %4x %-16s\n",
	76	MAJOR(inode->i_sb->s_dev), MINOR(inode->i_sb->s_dev),
	77	pid, current->comm);
c0508650 JK	78	out:
	79	spin_unlock(&pids_lock);
	80	radix_tree_preload_end();
63f92ddc JK	81	}
63f92ddc JK	82
05ca3632	83	void f2fs_trace_ios(struct f2fs_io_info *fio, int flush)
63f92ddc	84	{
0e689d03 JK	85	struct inode *inode;
	86	pid_t pid;
	87	int major, minor;
	88
	89	if (flush) {
	90	__print_last_io();
	91	return;
	92	}
	93
05ca3632 JK	94	inode = fio->page->mapping->host;
05ca3632 JK	95	pid = page_private(fio->page);
0e689d03 JK	96
	97	major = MAJOR(inode->i_sb->s_dev);
	98	minor = MINOR(inode->i_sb->s_dev);
	99
	100	if (last_io.major == major && last_io.minor == minor &&
	101	last_io.pid == pid &&
	102	last_io.type == __file_type(inode, pid) &&
	103	last_io.fio.rw == fio->rw &&
	104	last_io.fio.blk_addr + last_io.len == fio->blk_addr) {
	105	last_io.len++;
	106	return;
	107	}
	108
	109	__print_last_io();
	110
	111	last_io.major = major;
	112	last_io.minor = minor;
	113	last_io.pid = pid;
	114	last_io.type = __file_type(inode, pid);
	115	last_io.fio = *fio;
	116	last_io.len = 1;
	117	return;
63f92ddc	118	}
c0508650 JK	119
	120	void f2fs_build_trace_ios(void)
	121	{
	122	spin_lock_init(&pids_lock);
	123	}
351f4fba JK	124
	125	#define PIDVEC_SIZE 128
	126	static unsigned int gang_lookup_pids(pid_t *results, unsigned long first_index,
	127	unsigned int max_items)
	128	{
	129	struct radix_tree_iter iter;
	130	void **slot;
	131	unsigned int ret = 0;
	132
	133	if (unlikely(!max_items))
	134	return 0;
	135
	136	radix_tree_for_each_slot(slot, &pids, &iter, first_index) {
	137	results[ret] = iter.index;
	138	if (++ret == PIDVEC_SIZE)
	139	break;
	140	}
	141	return ret;
	142	}
	143
	144	void f2fs_destroy_trace_ios(void)
	145	{
	146	pid_t pid[PIDVEC_SIZE];
	147	pid_t next_pid = 0;
	148	unsigned int found;
	149
	150	spin_lock(&pids_lock);
	151	while ((found = gang_lookup_pids(pid, next_pid, PIDVEC_SIZE))) {
	152	unsigned idx;
	153
	154	next_pid = pid[found - 1] + 1;
	155	for (idx = 0; idx < found; idx++)
	156	radix_tree_delete(&pids, pid[idx]);
	157	}
	158	spin_unlock(&pids_lock);
	159	}