[deliverable/linux.git] / fs / f2fs / inline.c

/*
 * fs/f2fs/inline.c
 * Copyright (c) 2013, Intel Corporation
 * Authors: Huajun Li <huajun.li@intel.com>
 *          Haicheng Li <haicheng.li@intel.com>
 * 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 "f2fs.h"

bool f2fs_may_inline(struct inode *inode)
{
	block_t nr_blocks;
	loff_t i_size;

	if (!test_opt(F2FS_I_SB(inode), INLINE_DATA))
		return false;

	if (f2fs_is_atomic_file(inode))
		return false;

	nr_blocks = F2FS_I(inode)->i_xattr_nid ? 3 : 2;
	if (inode->i_blocks > nr_blocks)
		return false;

	i_size = i_size_read(inode);
	if (i_size > MAX_INLINE_DATA)
		return false;

	return true;
}

int f2fs_read_inline_data(struct inode *inode, struct page *page)
{
	struct page *ipage;
	void *src_addr, *dst_addr;

	if (page->index) {
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
		goto out;
	}

	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
	if (IS_ERR(ipage)) {
		unlock_page(page);
		return PTR_ERR(ipage);
	}

	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(ipage);
	dst_addr = kmap(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	kunmap(page);
	f2fs_put_page(ipage, 1);

out:
	SetPageUptodate(page);
	unlock_page(page);

	return 0;
}

static int __f2fs_convert_inline_data(struct inode *inode, struct page *page)
{
	int err = 0;
	struct page *ipage;
	struct dnode_of_data dn;
	void *src_addr, *dst_addr;
	block_t new_blk_addr;
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	struct f2fs_io_info fio = {
		.type = DATA,
		.rw = WRITE_SYNC | REQ_PRIO,
	};

	f2fs_lock_op(sbi);
	ipage = get_node_page(sbi, inode->i_ino);
	if (IS_ERR(ipage)) {
		err = PTR_ERR(ipage);
		goto out;
	}

	/* someone else converted inline_data already */
	if (!f2fs_has_inline_data(inode))
		goto out;

	/*
	 * i_addr[0] is not used for inline data,
	 * so reserving new block will not destroy inline data
	 */
	set_new_dnode(&dn, inode, ipage, NULL, 0);
	err = f2fs_reserve_block(&dn, 0);
	if (err)
		goto out;

	f2fs_wait_on_page_writeback(page, DATA);
	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(ipage);
	dst_addr = kmap(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	kunmap(page);
	SetPageUptodate(page);

	/* write data page to try to make data consistent */
	set_page_writeback(page);
	write_data_page(page, &dn, &new_blk_addr, &fio);
	update_extent_cache(new_blk_addr, &dn);
	f2fs_wait_on_page_writeback(page, DATA);

	/* clear inline data and flag after data writeback */
	zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	stat_dec_inline_inode(inode);

	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);
out:
	f2fs_unlock_op(sbi);
	return err;
}

int f2fs_convert_inline_data(struct inode *inode, pgoff_t to_size,
						struct page *page)
{
	struct page *new_page = page;
	int err;

	if (!f2fs_has_inline_data(inode))
		return 0;
	else if (to_size <= MAX_INLINE_DATA)
		return 0;

	if (!page || page->index != 0) {
		new_page = grab_cache_page(inode->i_mapping, 0);
		if (!new_page)
			return -ENOMEM;
	}

	err = __f2fs_convert_inline_data(inode, new_page);
	if (!page || page->index != 0)
		f2fs_put_page(new_page, 1);
	return err;
}

int f2fs_write_inline_data(struct inode *inode,
				struct page *page, unsigned size)
{
	void *src_addr, *dst_addr;
	struct page *ipage;
	struct dnode_of_data dn;
	int err;

	set_new_dnode(&dn, inode, NULL, NULL, 0);
	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	if (err)
		return err;
	ipage = dn.inode_page;

	/* Release any data block if it is allocated */
	if (!f2fs_has_inline_data(inode)) {
		int count = ADDRS_PER_PAGE(dn.node_page, F2FS_I(inode));
		truncate_data_blocks_range(&dn, count);
		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		stat_inc_inline_inode(inode);
	}

	f2fs_wait_on_page_writeback(ipage, NODE);
	zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	src_addr = kmap(page);
	dst_addr = inline_data_addr(ipage);
	memcpy(dst_addr, src_addr, size);
	kunmap(page);

	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);

	return 0;
}

void truncate_inline_data(struct inode *inode, u64 from)
{
	struct page *ipage;

	if (from >= MAX_INLINE_DATA)
		return;

	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
	if (IS_ERR(ipage))
		return;

	f2fs_wait_on_page_writeback(ipage, NODE);

	zero_user_segment(ipage, INLINE_DATA_OFFSET + from,
				INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	set_page_dirty(ipage);
	f2fs_put_page(ipage, 1);
}

bool recover_inline_data(struct inode *inode, struct page *npage)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	struct f2fs_inode *ri = NULL;
	void *src_addr, *dst_addr;
	struct page *ipage;

	/*
	 * The inline_data recovery policy is as follows.
	 * [prev.] [next] of inline_data flag
	 *    o       o  -> recover inline_data
	 *    o       x  -> remove inline_data, and then recover data blocks
	 *    x       o  -> remove inline_data, and then recover inline_data
	 *    x       x  -> recover data blocks
	 */
	if (IS_INODE(npage))
		ri = F2FS_INODE(npage);

	if (f2fs_has_inline_data(inode) &&
			ri && (ri->i_inline & F2FS_INLINE_DATA)) {
process_inline:
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(sbi, IS_ERR(ipage));

		f2fs_wait_on_page_writeback(ipage, NODE);

		src_addr = inline_data_addr(npage);
		dst_addr = inline_data_addr(ipage);
		memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
		return true;
	}

	if (f2fs_has_inline_data(inode)) {
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(sbi, IS_ERR(ipage));
		f2fs_wait_on_page_writeback(ipage, NODE);
		zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
		clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
		truncate_blocks(inode, 0, false);
		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		goto process_inline;
	}
	return false;
}

struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
				struct qstr *name, struct page **res_page)
{
	struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
	struct page *ipage;
	struct f2fs_dir_entry *de;
	f2fs_hash_t namehash;
	unsigned long bit_pos = 0;
	struct f2fs_inline_dentry *dentry_blk;
	const void *dentry_bits;

	ipage = get_node_page(sbi, dir->i_ino);
	if (IS_ERR(ipage))
		return NULL;

	namehash = f2fs_dentry_hash(name);

	dentry_blk = inline_data_addr(ipage);
	dentry_bits = &dentry_blk->dentry_bitmap;

	while (bit_pos < NR_INLINE_DENTRY) {
		if (!test_bit_le(bit_pos, dentry_bits)) {
			bit_pos++;
			continue;
		}
		de = &dentry_blk->dentry[bit_pos];
		if (early_match_name(name->len, namehash, de)) {
			if (!memcmp(dentry_blk->filename[bit_pos],
							name->name,
							name->len)) {
				*res_page = ipage;
				goto found;
			}
		}

		/*
		 * For the most part, it should be a bug when name_len is zero.
		 * We stop here for figuring out where the bugs are occurred.
		 */
		f2fs_bug_on(F2FS_P_SB(ipage), !de->name_len);

		bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
	}

	de = NULL;
found:
	unlock_page(ipage);
	return de;
}

struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *dir,
							struct page **p)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	struct f2fs_dir_entry *de;
	struct f2fs_inline_dentry *dentry_blk;

	ipage = get_node_page(sbi, dir->i_ino);
	if (IS_ERR(ipage))
		return NULL;

	dentry_blk = inline_data_addr(ipage);
	de = &dentry_blk->dentry[1];
	*p = ipage;
	unlock_page(ipage);
	return de;
}

int make_empty_inline_dir(struct inode *inode, struct inode *parent,
							struct page *ipage)
{
	struct f2fs_inline_dentry *dentry_blk;
	struct f2fs_dir_entry *de;

	dentry_blk = inline_data_addr(ipage);

	de = &dentry_blk->dentry[0];
	de->name_len = cpu_to_le16(1);
	de->hash_code = 0;
	de->ino = cpu_to_le32(inode->i_ino);
	memcpy(dentry_blk->filename[0], ".", 1);
	set_de_type(de, inode);

	de = &dentry_blk->dentry[1];
	de->hash_code = 0;
	de->name_len = cpu_to_le16(2);
	de->ino = cpu_to_le32(parent->i_ino);
	memcpy(dentry_blk->filename[1], "..", 2);
	set_de_type(de, inode);

	test_and_set_bit_le(0, &dentry_blk->dentry_bitmap);
	test_and_set_bit_le(1, &dentry_blk->dentry_bitmap);

	set_page_dirty(ipage);

	/* update i_size to MAX_INLINE_DATA */
	if (i_size_read(inode) < MAX_INLINE_DATA) {
		i_size_write(inode, MAX_INLINE_DATA);
		set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
	}
	return 0;
}

int room_in_inline_dir(struct f2fs_inline_dentry *dentry_blk, int slots)
{
	int bit_start = 0;
	int zero_start, zero_end;
next:
	zero_start = find_next_zero_bit_le(&dentry_blk->dentry_bitmap,
						NR_INLINE_DENTRY,
						bit_start);
	if (zero_start >= NR_INLINE_DENTRY)
		return NR_INLINE_DENTRY;

	zero_end = find_next_bit_le(&dentry_blk->dentry_bitmap,
						NR_INLINE_DENTRY,
						zero_start);
	if (zero_end - zero_start >= slots)
		return zero_start;

	bit_start = zero_end + 1;

	if (zero_end + 1 >= NR_INLINE_DENTRY)
		return NR_INLINE_DENTRY;
	goto next;
}

int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
				struct f2fs_inline_dentry *inline_dentry)
{
	struct page *page;
	struct dnode_of_data dn;
	struct f2fs_dentry_block *dentry_blk;
	int err;

	page = grab_cache_page(dir->i_mapping, 0);
	if (!page)
		return -ENOMEM;

	set_new_dnode(&dn, dir, ipage, NULL, 0);
	err = f2fs_reserve_block(&dn, 0);
	if (err)
		goto out;

	f2fs_wait_on_page_writeback(page, DATA);
	zero_user_segment(page, 0, PAGE_CACHE_SIZE);

	dentry_blk = kmap(page);

	/* copy data from inline dentry block to new dentry block */
	memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
					INLINE_DENTRY_BITMAP_SIZE);
	memcpy(dentry_blk->dentry, inline_dentry->dentry,
			sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
	memcpy(dentry_blk->filename, inline_dentry->filename,
					NR_INLINE_DENTRY * F2FS_SLOT_LEN);

	kunmap(page);
	SetPageUptodate(page);
	set_page_dirty(page);

	/* clear inline dir and flag after data writeback */
	zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);

	stat_dec_inline_inode(dir);

	if (i_size_read(dir) < PAGE_CACHE_SIZE) {
		i_size_write(dir, PAGE_CACHE_SIZE);
		set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	}

	sync_inode_page(&dn);
out:
	f2fs_put_page(page, 1);
	return err;
}

int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
						struct inode *inode)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	unsigned int bit_pos;
	f2fs_hash_t name_hash;
	struct f2fs_dir_entry *de;
	size_t namelen = name->len;
	struct f2fs_inline_dentry *dentry_blk = NULL;
	int slots = GET_DENTRY_SLOTS(namelen);
	struct page *page;
	int err = 0;
	int i;

	name_hash = f2fs_dentry_hash(name);

	ipage = get_node_page(sbi, dir->i_ino);
	if (IS_ERR(ipage))
		return PTR_ERR(ipage);

	dentry_blk = inline_data_addr(ipage);
	bit_pos = room_in_inline_dir(dentry_blk, slots);
	if (bit_pos >= NR_INLINE_DENTRY) {
		err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
		if (!err)
			err = -EAGAIN;
		goto out;
	}

	f2fs_wait_on_page_writeback(ipage, DATA);

	down_write(&F2FS_I(inode)->i_sem);
	page = init_inode_metadata(inode, dir, name);
	if (IS_ERR(page)) {
		err = PTR_ERR(page);
		goto fail;
	}
	de = &dentry_blk->dentry[bit_pos];
	de->hash_code = name_hash;
	de->name_len = cpu_to_le16(namelen);
	memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
	de->ino = cpu_to_le32(inode->i_ino);
	set_de_type(de, inode);
	for (i = 0; i < slots; i++)
		test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
	set_page_dirty(ipage);

	/* we don't need to mark_inode_dirty now */
	F2FS_I(inode)->i_pino = dir->i_ino;
	update_inode(inode, page);
	f2fs_put_page(page, 1);

	update_parent_metadata(dir, inode, 0);
fail:
	up_write(&F2FS_I(inode)->i_sem);

	if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
		update_inode(dir, ipage);
		clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	}
out:
	f2fs_put_page(ipage, 1);
	return err;
}

void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
					struct inode *dir, struct inode *inode)
{
	struct f2fs_inline_dentry *inline_dentry;
	int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
	unsigned int bit_pos;
	int i;

	lock_page(page);
	f2fs_wait_on_page_writeback(page, DATA);

	inline_dentry = inline_data_addr(page);
	bit_pos = dentry - inline_dentry->dentry;
	for (i = 0; i < slots; i++)
		test_and_clear_bit_le(bit_pos + i,
				&inline_dentry->dentry_bitmap);

	set_page_dirty(page);

	dir->i_ctime = dir->i_mtime = CURRENT_TIME;

	if (inode)
		f2fs_drop_nlink(dir, inode, page);

	f2fs_put_page(page, 1);
}

bool f2fs_empty_inline_dir(struct inode *dir)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	unsigned int bit_pos = 2;
	struct f2fs_inline_dentry *dentry_blk;

	ipage = get_node_page(sbi, dir->i_ino);
	if (IS_ERR(ipage))
		return false;

	dentry_blk = inline_data_addr(ipage);
	bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
					NR_INLINE_DENTRY,
					bit_pos);

	f2fs_put_page(ipage, 1);

	if (bit_pos < NR_INLINE_DENTRY)
		return false;

	return true;
}

int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx)
{
	struct inode *inode = file_inode(file);
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	unsigned int bit_pos = 0;
	struct f2fs_inline_dentry *inline_dentry = NULL;
	struct f2fs_dir_entry *de = NULL;
	struct page *ipage = NULL;
	unsigned char d_type = DT_UNKNOWN;

	if (ctx->pos == NR_INLINE_DENTRY)
		return 0;

	ipage = get_node_page(sbi, inode->i_ino);
	if (IS_ERR(ipage))
		return PTR_ERR(ipage);

	bit_pos = ((unsigned long)ctx->pos % NR_INLINE_DENTRY);

	inline_dentry = inline_data_addr(ipage);
	while (bit_pos < NR_INLINE_DENTRY) {
		bit_pos = find_next_bit_le(&inline_dentry->dentry_bitmap,
						NR_INLINE_DENTRY,
						bit_pos);
		if (bit_pos >= NR_INLINE_DENTRY)
			break;

		de = &inline_dentry->dentry[bit_pos];
		if (de->file_type < F2FS_FT_MAX)
			d_type = f2fs_filetype_table[de->file_type];
		else
			d_type = DT_UNKNOWN;

		if (!dir_emit(ctx,
				inline_dentry->filename[bit_pos],
				le16_to_cpu(de->name_len),
				le32_to_cpu(de->ino), d_type))
			goto out;

		bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
		ctx->pos = bit_pos;
	}

	ctx->pos = NR_INLINE_DENTRY;
out:
	f2fs_put_page(ipage, 1);

	return 0;
}
Commit	Line	Data
e18c65b2 HL	1	/*
	2	* fs/f2fs/inline.c
	3	* Copyright (c) 2013, Intel Corporation
	4	* Authors: Huajun Li <huajun.li@intel.com>
	5	* Haicheng Li <haicheng.li@intel.com>
	6	* This program is free software; you can redistribute it and/or modify
	7	* it under the terms of the GNU General Public License version 2 as
	8	* published by the Free Software Foundation.
	9	*/
	10
	11	#include <linux/fs.h>
	12	#include <linux/f2fs_fs.h>
	13
	14	#include "f2fs.h"
	15
e18c65b2 HL	16	bool f2fs_may_inline(struct inode *inode)
e18c65b2 HL	17	{
e18c65b2 HL	18	block_t nr_blocks;
	19	loff_t i_size;
	20
4081363f	21	if (!test_opt(F2FS_I_SB(inode), INLINE_DATA))
e18c65b2 HL	22	return false;
e18c65b2 HL	23
88b88a66 JK	24	if (f2fs_is_atomic_file(inode))
	25	return false;
	26
e18c65b2 HL	27	nr_blocks = F2FS_I(inode)->i_xattr_nid ? 3 : 2;
	28	if (inode->i_blocks > nr_blocks)
	29	return false;
	30
	31	i_size = i_size_read(inode);
	32	if (i_size > MAX_INLINE_DATA)
	33	return false;
	34
	35	return true;
	36	}
	37
	38	int f2fs_read_inline_data(struct inode inode, struct page page)
	39	{
e18c65b2 HL	40	struct page *ipage;
	41	void src_addr, dst_addr;
	42
04a17fb1 CY	43	if (page->index) {
	44	zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	45	goto out;
	46	}
	47
4081363f	48	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
d54c795b CY	49	if (IS_ERR(ipage)) {
d54c795b CY	50	unlock_page(page);
e18c65b2	51	return PTR_ERR(ipage);
d54c795b	52	}
e18c65b2	53
18309aaa	54	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
e18c65b2 HL	55
	56	/* Copy the whole inline data block */
	57	src_addr = inline_data_addr(ipage);
	58	dst_addr = kmap(page);
	59	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	60	kunmap(page);
	61	f2fs_put_page(ipage, 1);
	62
04a17fb1	63	out:
e18c65b2 HL	64	SetPageUptodate(page);
	65	unlock_page(page);
	66
	67	return 0;
	68	}
	69
	70	static int __f2fs_convert_inline_data(struct inode inode, struct page page)
	71	{
ec4e7af4	72	int err = 0;
e18c65b2 HL	73	struct page *ipage;
	74	struct dnode_of_data dn;
	75	void src_addr, dst_addr;
	76	block_t new_blk_addr;
4081363f	77	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
e18c65b2 HL	78	struct f2fs_io_info fio = {
	79	.type = DATA,
	80	.rw = WRITE_SYNC \| REQ_PRIO,
	81	};
	82
	83	f2fs_lock_op(sbi);
	84	ipage = get_node_page(sbi, inode->i_ino);
15c6e3aa JK	85	if (IS_ERR(ipage)) {
	86	err = PTR_ERR(ipage);
	87	goto out;
	88	}
e18c65b2	89
ec4e7af4 JK	90	/* someone else converted inline_data already */
	91	if (!f2fs_has_inline_data(inode))
	92	goto out;
	93
e18c65b2 HL	94	/*
	95	* i_addr[0] is not used for inline data,
	96	* so reserving new block will not destroy inline data
	97	*/
a8865372	98	set_new_dnode(&dn, inode, ipage, NULL, 0);
e18c65b2	99	err = f2fs_reserve_block(&dn, 0);
15c6e3aa JK	100	if (err)
15c6e3aa JK	101	goto out;
e18c65b2	102
9ac1349a	103	f2fs_wait_on_page_writeback(page, DATA);
18309aaa	104	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
e18c65b2 HL	105
	106	/* Copy the whole inline data block */
	107	src_addr = inline_data_addr(ipage);
	108	dst_addr = kmap(page);
	109	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	110	kunmap(page);
9e09fc85	111	SetPageUptodate(page);
e18c65b2 HL	112
	113	/* write data page to try to make data consistent */
	114	set_page_writeback(page);
	115	write_data_page(page, &dn, &new_blk_addr, &fio);
	116	update_extent_cache(new_blk_addr, &dn);
5514f0aa	117	f2fs_wait_on_page_writeback(page, DATA);
e18c65b2 HL	118
	119	/* clear inline data and flag after data writeback */
	120	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	121	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	122	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
0dbdc2ae	123	stat_dec_inline_inode(inode);
e18c65b2 HL	124
e18c65b2 HL	125	sync_inode_page(&dn);
a8865372	126	f2fs_put_dnode(&dn);
15c6e3aa	127	out:
e18c65b2	128	f2fs_unlock_op(sbi);
e18c65b2 HL	129	return err;
	130	}
	131
b067ba1f JK	132	int f2fs_convert_inline_data(struct inode *inode, pgoff_t to_size,
b067ba1f JK	133	struct page *page)
e18c65b2	134	{
b067ba1f	135	struct page *new_page = page;
9e09fc85	136	int err;
e18c65b2	137
9e09fc85 JK	138	if (!f2fs_has_inline_data(inode))
	139	return 0;
	140	else if (to_size <= MAX_INLINE_DATA)
	141	return 0;
e18c65b2	142
b067ba1f JK	143	if (!page \|\| page->index != 0) {
	144	new_page = grab_cache_page(inode->i_mapping, 0);
	145	if (!new_page)
	146	return -ENOMEM;
	147	}
e18c65b2	148
b067ba1f JK	149	err = __f2fs_convert_inline_data(inode, new_page);
	150	if (!page \|\| page->index != 0)
	151	f2fs_put_page(new_page, 1);
e18c65b2 HL	152	return err;
	153	}
	154
	155	int f2fs_write_inline_data(struct inode *inode,
b067ba1f	156	struct page *page, unsigned size)
e18c65b2 HL	157	{
	158	void src_addr, dst_addr;
	159	struct page *ipage;
	160	struct dnode_of_data dn;
	161	int err;
	162
	163	set_new_dnode(&dn, inode, NULL, NULL, 0);
	164	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	165	if (err)
	166	return err;
	167	ipage = dn.inode_page;
	168
c08a690b JK	169	/* Release any data block if it is allocated */
	170	if (!f2fs_has_inline_data(inode)) {
	171	int count = ADDRS_PER_PAGE(dn.node_page, F2FS_I(inode));
	172	truncate_data_blocks_range(&dn, count);
	173	set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	174	stat_inc_inline_inode(inode);
	175	}
	176
54b591df	177	f2fs_wait_on_page_writeback(ipage, NODE);
e18c65b2 HL	178	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	179	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	180	src_addr = kmap(page);
	181	dst_addr = inline_data_addr(ipage);
	182	memcpy(dst_addr, src_addr, size);
	183	kunmap(page);
	184
fff04f90	185	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
e18c65b2 HL	186	sync_inode_page(&dn);
	187	f2fs_put_dnode(&dn);
	188
	189	return 0;
	190	}
1e1bb4ba	191
8aa6f1c5 CY	192	void truncate_inline_data(struct inode *inode, u64 from)
8aa6f1c5 CY	193	{
8aa6f1c5 CY	194	struct page *ipage;
	195
	196	if (from >= MAX_INLINE_DATA)
	197	return;
	198
4081363f	199	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
8aa6f1c5 CY	200	if (IS_ERR(ipage))
	201	return;
	202
54b591df JK	203	f2fs_wait_on_page_writeback(ipage, NODE);
54b591df JK	204
8aa6f1c5 CY	205	zero_user_segment(ipage, INLINE_DATA_OFFSET + from,
	206	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	207	set_page_dirty(ipage);
	208	f2fs_put_page(ipage, 1);
	209	}
	210
0342fd30	211	bool recover_inline_data(struct inode inode, struct page npage)
1e1bb4ba	212	{
4081363f	213	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
1e1bb4ba JK	214	struct f2fs_inode *ri = NULL;
	215	void src_addr, dst_addr;
	216	struct page *ipage;
	217
	218	/*
	219	* The inline_data recovery policy is as follows.
	220	* [prev.] [next] of inline_data flag
	221	* o o -> recover inline_data
	222	* o x -> remove inline_data, and then recover data blocks
	223	* x o -> remove inline_data, and then recover inline_data
	224	* x x -> recover data blocks
	225	*/
	226	if (IS_INODE(npage))
	227	ri = F2FS_INODE(npage);
	228
	229	if (f2fs_has_inline_data(inode) &&
0342fd30	230	ri && (ri->i_inline & F2FS_INLINE_DATA)) {
1e1bb4ba JK	231	process_inline:
1e1bb4ba JK	232	ipage = get_node_page(sbi, inode->i_ino);
9850cf4a	233	f2fs_bug_on(sbi, IS_ERR(ipage));
1e1bb4ba	234
54b591df JK	235	f2fs_wait_on_page_writeback(ipage, NODE);
54b591df JK	236
1e1bb4ba JK	237	src_addr = inline_data_addr(npage);
	238	dst_addr = inline_data_addr(ipage);
	239	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	240	update_inode(inode, ipage);
	241	f2fs_put_page(ipage, 1);
0342fd30	242	return true;
1e1bb4ba JK	243	}
	244
	245	if (f2fs_has_inline_data(inode)) {
	246	ipage = get_node_page(sbi, inode->i_ino);
9850cf4a	247	f2fs_bug_on(sbi, IS_ERR(ipage));
54b591df	248	f2fs_wait_on_page_writeback(ipage, NODE);
1e1bb4ba JK	249	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	250	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	251	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	252	update_inode(inode, ipage);
	253	f2fs_put_page(ipage, 1);
0342fd30	254	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
764aa3e9	255	truncate_blocks(inode, 0, false);
1e1bb4ba JK	256	set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	257	goto process_inline;
	258	}
0342fd30	259	return false;
1e1bb4ba	260	}
201a05be CY	261
	262	struct f2fs_dir_entry find_in_inline_dir(struct inode dir,
	263	struct qstr name, struct page *res_page)
	264	{
	265	struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
	266	struct page *ipage;
	267	struct f2fs_dir_entry *de;
	268	f2fs_hash_t namehash;
	269	unsigned long bit_pos = 0;
	270	struct f2fs_inline_dentry *dentry_blk;
	271	const void *dentry_bits;
	272
	273	ipage = get_node_page(sbi, dir->i_ino);
	274	if (IS_ERR(ipage))
	275	return NULL;
	276
	277	namehash = f2fs_dentry_hash(name);
	278
	279	dentry_blk = inline_data_addr(ipage);
	280	dentry_bits = &dentry_blk->dentry_bitmap;
	281
	282	while (bit_pos < NR_INLINE_DENTRY) {
	283	if (!test_bit_le(bit_pos, dentry_bits)) {
	284	bit_pos++;
	285	continue;
	286	}
	287	de = &dentry_blk->dentry[bit_pos];
	288	if (early_match_name(name->len, namehash, de)) {
	289	if (!memcmp(dentry_blk->filename[bit_pos],
	290	name->name,
	291	name->len)) {
	292	*res_page = ipage;
	293	goto found;
	294	}
	295	}
	296
	297	/*
	298	* For the most part, it should be a bug when name_len is zero.
	299	* We stop here for figuring out where the bugs are occurred.
	300	*/
	301	f2fs_bug_on(F2FS_P_SB(ipage), !de->name_len);
	302
	303	bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
	304	}
	305
	306	de = NULL;
	307	found:
	308	unlock_page(ipage);
	309	return de;
	310	}
	311
	312	struct f2fs_dir_entry f2fs_parent_inline_dir(struct inode dir,
	313	struct page **p)
	314	{
	315	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	316	struct page *ipage;
	317	struct f2fs_dir_entry *de;
	318	struct f2fs_inline_dentry *dentry_blk;
	319
	320	ipage = get_node_page(sbi, dir->i_ino);
	321	if (IS_ERR(ipage))
	322	return NULL;
	323
	324	dentry_blk = inline_data_addr(ipage);
325	de = &dentry_blk->dentry[1];
326	*p = ipage;
327	unlock_page(ipage);
328	return de;
329	}
330
331	int make_empty_inline_dir(struct inode inode, struct inode parent,
332	struct page *ipage)
333	{
334	struct f2fs_inline_dentry *dentry_blk;
335	struct f2fs_dir_entry *de;
336
337	dentry_blk = inline_data_addr(ipage);
338
339	de = &dentry_blk->dentry[0];
340	de->name_len = cpu_to_le16(1);
341	de->hash_code = 0;
342	de->ino = cpu_to_le32(inode->i_ino);
343	memcpy(dentry_blk->filename[0], ".", 1);
344	set_de_type(de, inode);
345
346	de = &dentry_blk->dentry[1];
347	de->hash_code = 0;
348	de->name_len = cpu_to_le16(2);
349	de->ino = cpu_to_le32(parent->i_ino);
350	memcpy(dentry_blk->filename[1], "..", 2);
351	set_de_type(de, inode);
352
353	test_and_set_bit_le(0, &dentry_blk->dentry_bitmap);
354	test_and_set_bit_le(1, &dentry_blk->dentry_bitmap);
355
356	set_page_dirty(ipage);
357
358	/* update i_size to MAX_INLINE_DATA */
359	if (i_size_read(inode) < MAX_INLINE_DATA) {
360	i_size_write(inode, MAX_INLINE_DATA);
361	set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
362	}
363	return 0;
364	}
365
366	int room_in_inline_dir(struct f2fs_inline_dentry *dentry_blk, int slots)
367	{
368	int bit_start = 0;
369	int zero_start, zero_end;
370	next:
371	zero_start = find_next_zero_bit_le(&dentry_blk->dentry_bitmap,
372	NR_INLINE_DENTRY,
373	bit_start);
374	if (zero_start >= NR_INLINE_DENTRY)
375	return NR_INLINE_DENTRY;
376
377	zero_end = find_next_bit_le(&dentry_blk->dentry_bitmap,
378	NR_INLINE_DENTRY,
379	zero_start);
380	if (zero_end - zero_start >= slots)
381	return zero_start;
382
383	bit_start = zero_end + 1;
384
385	if (zero_end + 1 >= NR_INLINE_DENTRY)
386	return NR_INLINE_DENTRY;
387	goto next;
388	}
389
390	int f2fs_convert_inline_dir(struct inode dir, struct page ipage,
391	struct f2fs_inline_dentry *inline_dentry)
392	{
393	struct page *page;
394	struct dnode_of_data dn;
395	struct f2fs_dentry_block *dentry_blk;
396	int err;
397
398	page = grab_cache_page(dir->i_mapping, 0);
399	if (!page)
400	return -ENOMEM;
401
402	set_new_dnode(&dn, dir, ipage, NULL, 0);
403	err = f2fs_reserve_block(&dn, 0);
404	if (err)
405	goto out;
406
407	f2fs_wait_on_page_writeback(page, DATA);
408	zero_user_segment(page, 0, PAGE_CACHE_SIZE);
409
410	dentry_blk = kmap(page);
411
412	/* copy data from inline dentry block to new dentry block */
413	memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
414	INLINE_DENTRY_BITMAP_SIZE);
415	memcpy(dentry_blk->dentry, inline_dentry->dentry,
416	sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
417	memcpy(dentry_blk->filename, inline_dentry->filename,
418	NR_INLINE_DENTRY * F2FS_SLOT_LEN);
419
420	kunmap(page);
421	SetPageUptodate(page);
422	set_page_dirty(page);
423
424	/* clear inline dir and flag after data writeback */
425	zero_user_segment(ipage, INLINE_DATA_OFFSET,
426	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
427
428	stat_dec_inline_inode(dir);
429
430	if (i_size_read(dir) < PAGE_CACHE_SIZE) {
431	i_size_write(dir, PAGE_CACHE_SIZE);
432	set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
433	}
434
435	sync_inode_page(&dn);
436	out:
437	f2fs_put_page(page, 1);
438	return err;
439	}
440
441	int f2fs_add_inline_entry(struct inode dir, const struct qstr name,
442	struct inode *inode)
443	{
444	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
445	struct page *ipage;
446	unsigned int bit_pos;
447	f2fs_hash_t name_hash;
448	struct f2fs_dir_entry *de;
449	size_t namelen = name->len;
450	struct f2fs_inline_dentry *dentry_blk = NULL;
451	int slots = GET_DENTRY_SLOTS(namelen);
452	struct page *page;
453	int err = 0;
454	int i;
455
456	name_hash = f2fs_dentry_hash(name);
457
458	ipage = get_node_page(sbi, dir->i_ino);
459	if (IS_ERR(ipage))
460	return PTR_ERR(ipage);
461
462	dentry_blk = inline_data_addr(ipage);
463	bit_pos = room_in_inline_dir(dentry_blk, slots);
464	if (bit_pos >= NR_INLINE_DENTRY) {
465	err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
466	if (!err)
467	err = -EAGAIN;
468	goto out;
469	}
470
471	f2fs_wait_on_page_writeback(ipage, DATA);
472
473	down_write(&F2FS_I(inode)->i_sem);
474	page = init_inode_metadata(inode, dir, name);
475	if (IS_ERR(page)) {
476	err = PTR_ERR(page);
477	goto fail;
478	}
479	de = &dentry_blk->dentry[bit_pos];
480	de->hash_code = name_hash;
481	de->name_len = cpu_to_le16(namelen);
482	memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
483	de->ino = cpu_to_le32(inode->i_ino);
484	set_de_type(de, inode);
485	for (i = 0; i < slots; i++)
486	test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
487	set_page_dirty(ipage);
488
489	/* we don't need to mark_inode_dirty now */
490	F2FS_I(inode)->i_pino = dir->i_ino;
491	update_inode(inode, page);
492	f2fs_put_page(page, 1);
493
494	update_parent_metadata(dir, inode, 0);
495	fail:
496	up_write(&F2FS_I(inode)->i_sem);
497
498	if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
499	update_inode(dir, ipage);
500	clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
501	}
502	out:
503	f2fs_put_page(ipage, 1);
504	return err;
505	}
506
507	void f2fs_delete_inline_entry(struct f2fs_dir_entry dentry, struct page page,
508	struct inode dir, struct inode inode)
509	{
510	struct f2fs_inline_dentry *inline_dentry;
511	int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
512	unsigned int bit_pos;
513	int i;
514
515	lock_page(page);
516	f2fs_wait_on_page_writeback(page, DATA);
517
518	inline_dentry = inline_data_addr(page);
519	bit_pos = dentry - inline_dentry->dentry;
520	for (i = 0; i < slots; i++)
521	test_and_clear_bit_le(bit_pos + i,
522	&inline_dentry->dentry_bitmap);
523
524	set_page_dirty(page);
525
526	dir->i_ctime = dir->i_mtime = CURRENT_TIME;
527
528	if (inode)
529	f2fs_drop_nlink(dir, inode, page);
530
531	f2fs_put_page(page, 1);
532	}
533
534	bool f2fs_empty_inline_dir(struct inode *dir)
535	{
536	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
537	struct page *ipage;
538	unsigned int bit_pos = 2;
539	struct f2fs_inline_dentry *dentry_blk;
540
541	ipage = get_node_page(sbi, dir->i_ino);
542	if (IS_ERR(ipage))
543	return false;
544
545	dentry_blk = inline_data_addr(ipage);
546	bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
547	NR_INLINE_DENTRY,
548	bit_pos);
549
550	f2fs_put_page(ipage, 1);
551
552	if (bit_pos < NR_INLINE_DENTRY)
553	return false;
554
555	return true;
556	}
557
558	int f2fs_read_inline_dir(struct file file, struct dir_context ctx)
559	{
560	struct inode *inode = file_inode(file);
561	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
562	unsigned int bit_pos = 0;
563	struct f2fs_inline_dentry *inline_dentry = NULL;
564	struct f2fs_dir_entry *de = NULL;
565	struct page *ipage = NULL;
566	unsigned char d_type = DT_UNKNOWN;
567
568	if (ctx->pos == NR_INLINE_DENTRY)
569	return 0;
570
571	ipage = get_node_page(sbi, inode->i_ino);
572	if (IS_ERR(ipage))
573	return PTR_ERR(ipage);
574
575	bit_pos = ((unsigned long)ctx->pos % NR_INLINE_DENTRY);
576
577	inline_dentry = inline_data_addr(ipage);
578	while (bit_pos < NR_INLINE_DENTRY) {
579	bit_pos = find_next_bit_le(&inline_dentry->dentry_bitmap,
580	NR_INLINE_DENTRY,
581	bit_pos);
582	if (bit_pos >= NR_INLINE_DENTRY)
583	break;
584
585	de = &inline_dentry->dentry[bit_pos];
586	if (de->file_type < F2FS_FT_MAX)
587	d_type = f2fs_filetype_table[de->file_type];
588	else
589	d_type = DT_UNKNOWN;
590
591	if (!dir_emit(ctx,
592	inline_dentry->filename[bit_pos],
593	le16_to_cpu(de->name_len),
594	le32_to_cpu(de->ino), d_type))
595	goto out;
596
597	bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
598	ctx->pos = bit_pos;
599	}
600
601	ctx->pos = NR_INLINE_DENTRY;
602	out:
603	f2fs_put_page(ipage, 1);
604
605	return 0;
606	}