[mirror_ubuntu-artful-kernel.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)
{
	if (!test_opt(F2FS_I_SB(inode), INLINE_DATA))
		return false;

	if (f2fs_is_atomic_file(inode))
		return false;

	if (!S_ISREG(inode->i_mode))
		return false;

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

	return true;
}

void read_inline_data(struct page *page, struct page *ipage)
{
	void *src_addr, *dst_addr;

	if (PageUptodate(page))
		return;

	f2fs_bug_on(F2FS_P_SB(page), page->index);

	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_atomic(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	flush_dcache_page(page);
	kunmap_atomic(dst_addr);
	SetPageUptodate(page);
}

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

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

	if (!f2fs_has_inline_data(inode)) {
		f2fs_put_page(ipage, 1);
		return -EAGAIN;
	}

	if (page->index)
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	else
		read_inline_data(page, ipage);

	SetPageUptodate(page);
	f2fs_put_page(ipage, 1);
	unlock_page(page);
	return 0;
}

int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
{
	void *src_addr, *dst_addr;
	struct f2fs_io_info fio = {
		.type = DATA,
		.rw = WRITE_SYNC | REQ_PRIO,
	};
	int dirty, err;

	f2fs_bug_on(F2FS_I_SB(dn->inode), page->index);

	if (!f2fs_exist_data(dn->inode))
		goto clear_out;

	err = f2fs_reserve_block(dn, 0);
	if (err)
		return err;

	f2fs_wait_on_page_writeback(page, DATA);

	if (PageUptodate(page))
		goto no_update;

	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(dn->inode_page);
	dst_addr = kmap_atomic(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	flush_dcache_page(page);
	kunmap_atomic(dst_addr);
	SetPageUptodate(page);
no_update:
	/* clear dirty state */
	dirty = clear_page_dirty_for_io(page);

	/* write data page to try to make data consistent */
	set_page_writeback(page);
	fio.blk_addr = dn->data_blkaddr;
	write_data_page(page, dn, &fio);
	update_extent_cache(dn);
	f2fs_wait_on_page_writeback(page, DATA);
	if (dirty)
		inode_dec_dirty_pages(dn->inode);

	/* this converted inline_data should be recovered. */
	set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);

	/* clear inline data and flag after data writeback */
	truncate_inline_data(dn->inode_page, 0);
clear_out:
	stat_dec_inline_inode(dn->inode);
	f2fs_clear_inline_inode(dn->inode);
	sync_inode_page(dn);
	f2fs_put_dnode(dn);
	return 0;
}

int f2fs_convert_inline_inode(struct inode *inode)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	struct dnode_of_data dn;
	struct page *ipage, *page;
	int err = 0;

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

	f2fs_lock_op(sbi);

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

	set_new_dnode(&dn, inode, ipage, ipage, 0);

	if (f2fs_has_inline_data(inode))
		err = f2fs_convert_inline_page(&dn, page);

	f2fs_put_dnode(&dn);
out:
	f2fs_unlock_op(sbi);

	f2fs_put_page(page, 1);
	return err;
}

int f2fs_write_inline_data(struct inode *inode, struct page *page)
{
	void *src_addr, *dst_addr;
	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;

	if (!f2fs_has_inline_data(inode)) {
		f2fs_put_dnode(&dn);
		return -EAGAIN;
	}

	f2fs_bug_on(F2FS_I_SB(inode), page->index);

	f2fs_wait_on_page_writeback(dn.inode_page, NODE);
	src_addr = kmap_atomic(page);
	dst_addr = inline_data_addr(dn.inode_page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	kunmap_atomic(src_addr);

	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
	set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);

	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);
	return 0;
}

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

	if (from >= MAX_INLINE_DATA)
		return;

	f2fs_wait_on_page_writeback(ipage, NODE);

	addr = inline_data_addr(ipage);
	memset(addr + from, 0, MAX_INLINE_DATA - from);
}

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);

		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);

		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));
		truncate_inline_data(ipage, 0);
		f2fs_clear_inline_inode(inode);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
		truncate_blocks(inode, 0, false);
		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 f2fs_inline_dentry *inline_dentry;
	struct f2fs_dir_entry *de;
	struct f2fs_dentry_ptr d;
	struct page *ipage;

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

	inline_dentry = inline_data_addr(ipage);

	make_dentry_ptr(&d, (void *)inline_dentry, 2);
	de = find_target_dentry(name, NULL, &d);

	unlock_page(ipage);
	if (de)
		*res_page = ipage;
	else
		f2fs_put_page(ipage, 0);

	/*
	 * For the most part, it should be a bug when name_len is zero.
	 * We stop here for figuring out where the bugs has occurred.
	 */
	f2fs_bug_on(sbi, d.max < 0);
	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_dentry_ptr d;

	dentry_blk = inline_data_addr(ipage);

	make_dentry_ptr(&d, (void *)dentry_blk, 2);
	do_make_empty_dir(inode, parent, &d);

	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;
}

static 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_atomic(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_atomic(dentry_blk);
	SetPageUptodate(page);
	set_page_dirty(page);

	/* clear inline dir and flag after data writeback */
	truncate_inline_data(ipage, 0);

	stat_dec_inline_dir(dir);
	clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);

	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_for_filename(&dentry_blk->dentry_bitmap,
						slots, NR_INLINE_DENTRY);
	if (bit_pos >= NR_INLINE_DENTRY) {
		err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
		if (!err)
			err = -EAGAIN;
		goto out;
	}

	down_write(&F2FS_I(inode)->i_sem);
	page = init_inode_metadata(inode, dir, name, ipage);
	if (IS_ERR(page)) {
		err = PTR_ERR(page);
		goto fail;
	}

	f2fs_wait_on_page_writeback(ipage, NODE);
	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, NODE);

	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_inline_dentry *inline_dentry = NULL;
	struct page *ipage = NULL;
	struct f2fs_dentry_ptr d;

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

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

	inline_dentry = inline_data_addr(ipage);

	make_dentry_ptr(&d, (void *)inline_dentry, 2);

	if (!f2fs_fill_dentries(ctx, &d, 0))
		ctx->pos = NR_INLINE_DENTRY;

	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	{
4081363f	18	if (!test_opt(F2FS_I_SB(inode), INLINE_DATA))
e18c65b2 HL	19	return false;
e18c65b2 HL	20
88b88a66 JK	21	if (f2fs_is_atomic_file(inode))
	22	return false;
	23
b3d208f9	24	if (!S_ISREG(inode->i_mode))
e18c65b2 HL	25	return false;
e18c65b2 HL	26
92dffd01 JK	27	if (i_size_read(inode) > MAX_INLINE_DATA)
	28	return false;
	29
e18c65b2 HL	30	return true;
	31	}
	32
b3d208f9	33	void read_inline_data(struct page page, struct page ipage)
e18c65b2	34	{
e18c65b2 HL	35	void src_addr, dst_addr;
e18c65b2 HL	36
b3d208f9 JK	37	if (PageUptodate(page))
b3d208f9 JK	38	return;
04a17fb1	39
b3d208f9	40	f2fs_bug_on(F2FS_P_SB(page), page->index);
e18c65b2	41
18309aaa	42	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
e18c65b2 HL	43
	44	/* Copy the whole inline data block */
	45	src_addr = inline_data_addr(ipage);
f1e33a04	46	dst_addr = kmap_atomic(page);
e18c65b2	47	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
427a45c8	48	flush_dcache_page(page);
f1e33a04	49	kunmap_atomic(dst_addr);
e18c65b2	50	SetPageUptodate(page);
b3d208f9 JK	51	}
	52
	53	int f2fs_read_inline_data(struct inode inode, struct page page)
	54	{
	55	struct page *ipage;
	56
	57	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
	58	if (IS_ERR(ipage)) {
	59	unlock_page(page);
	60	return PTR_ERR(ipage);
	61	}
e18c65b2	62
b3d208f9 JK	63	if (!f2fs_has_inline_data(inode)) {
	64	f2fs_put_page(ipage, 1);
	65	return -EAGAIN;
	66	}
	67
	68	if (page->index)
	69	zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	70	else
	71	read_inline_data(page, ipage);
	72
	73	SetPageUptodate(page);
	74	f2fs_put_page(ipage, 1);
	75	unlock_page(page);
e18c65b2 HL	76	return 0;
	77	}
	78
b3d208f9	79	int f2fs_convert_inline_page(struct dnode_of_data dn, struct page page)
e18c65b2	80	{
e18c65b2	81	void src_addr, dst_addr;
e18c65b2 HL	82	struct f2fs_io_info fio = {
	83	.type = DATA,
	84	.rw = WRITE_SYNC \| REQ_PRIO,
	85	};
158c194c	86	int dirty, err;
e18c65b2	87
b3d208f9	88	f2fs_bug_on(F2FS_I_SB(dn->inode), page->index);
e18c65b2	89
b3d208f9 JK	90	if (!f2fs_exist_data(dn->inode))
b3d208f9 JK	91	goto clear_out;
ec4e7af4	92
b3d208f9	93	err = f2fs_reserve_block(dn, 0);
15c6e3aa	94	if (err)
b3d208f9	95	return err;
e18c65b2	96
9ac1349a	97	f2fs_wait_on_page_writeback(page, DATA);
b3d208f9 JK	98
	99	if (PageUptodate(page))
	100	goto no_update;
	101
18309aaa	102	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
e18c65b2 HL	103
e18c65b2 HL	104	/* Copy the whole inline data block */
b3d208f9	105	src_addr = inline_data_addr(dn->inode_page);
f1e33a04	106	dst_addr = kmap_atomic(page);
e18c65b2	107	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
09b8b3c8	108	flush_dcache_page(page);
f1e33a04	109	kunmap_atomic(dst_addr);
9e09fc85	110	SetPageUptodate(page);
b3d208f9	111	no_update:
158c194c JK	112	/* clear dirty state */
	113	dirty = clear_page_dirty_for_io(page);
	114
e18c65b2 HL	115	/* write data page to try to make data consistent */
e18c65b2 HL	116	set_page_writeback(page);
cf04e8eb JK	117	fio.blk_addr = dn->data_blkaddr;
cf04e8eb JK	118	write_data_page(page, dn, &fio);
e1509cf2	119	update_extent_cache(dn);
5514f0aa	120	f2fs_wait_on_page_writeback(page, DATA);
158c194c JK	121	if (dirty)
158c194c JK	122	inode_dec_dirty_pages(dn->inode);
e18c65b2	123
95f5b0fc JK	124	/* this converted inline_data should be recovered. */
	125	set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);
	126
e18c65b2	127	/* clear inline data and flag after data writeback */
b3d208f9 JK	128	truncate_inline_data(dn->inode_page, 0);
b3d208f9 JK	129	clear_out:
b3d208f9	130	stat_dec_inline_inode(dn->inode);
57e2a2c0	131	f2fs_clear_inline_inode(dn->inode);
b3d208f9 JK	132	sync_inode_page(dn);
	133	f2fs_put_dnode(dn);
	134	return 0;
e18c65b2 HL	135	}
e18c65b2 HL	136
b3d208f9	137	int f2fs_convert_inline_inode(struct inode *inode)
e18c65b2	138	{
b3d208f9 JK	139	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	140	struct dnode_of_data dn;
	141	struct page ipage, page;
	142	int err = 0;
e18c65b2	143
b3d208f9 JK	144	page = grab_cache_page(inode->i_mapping, 0);
	145	if (!page)
	146	return -ENOMEM;
e18c65b2	147
b3d208f9 JK	148	f2fs_lock_op(sbi);
	149
	150	ipage = get_node_page(sbi, inode->i_ino);
	151	if (IS_ERR(ipage)) {
6d20aff8 JK	152	err = PTR_ERR(ipage);
6d20aff8 JK	153	goto out;
b067ba1f	154	}
e18c65b2	155
b3d208f9 JK	156	set_new_dnode(&dn, inode, ipage, ipage, 0);
	157
	158	if (f2fs_has_inline_data(inode))
	159	err = f2fs_convert_inline_page(&dn, page);
	160
	161	f2fs_put_dnode(&dn);
6d20aff8	162	out:
b3d208f9 JK	163	f2fs_unlock_op(sbi);
	164
	165	f2fs_put_page(page, 1);
e18c65b2 HL	166	return err;
	167	}
	168
b3d208f9	169	int f2fs_write_inline_data(struct inode inode, struct page page)
e18c65b2 HL	170	{
e18c65b2 HL	171	void src_addr, dst_addr;
e18c65b2 HL	172	struct dnode_of_data dn;
	173	int err;
	174
	175	set_new_dnode(&dn, inode, NULL, NULL, 0);
	176	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	177	if (err)
	178	return err;
e18c65b2	179
c08a690b	180	if (!f2fs_has_inline_data(inode)) {
b3d208f9 JK	181	f2fs_put_dnode(&dn);
b3d208f9 JK	182	return -EAGAIN;
c08a690b JK	183	}
c08a690b JK	184
b3d208f9 JK	185	f2fs_bug_on(F2FS_I_SB(inode), page->index);
	186
	187	f2fs_wait_on_page_writeback(dn.inode_page, NODE);
f1e33a04	188	src_addr = kmap_atomic(page);
b3d208f9 JK	189	dst_addr = inline_data_addr(dn.inode_page);
b3d208f9 JK	190	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
f1e33a04	191	kunmap_atomic(src_addr);
e18c65b2	192
fff04f90	193	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
b3d208f9 JK	194	set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
b3d208f9 JK	195
e18c65b2 HL	196	sync_inode_page(&dn);
e18c65b2 HL	197	f2fs_put_dnode(&dn);
e18c65b2 HL	198	return 0;
e18c65b2 HL	199	}
1e1bb4ba	200
b3d208f9	201	void truncate_inline_data(struct page *ipage, u64 from)
8aa6f1c5	202	{
b3d208f9	203	void *addr;
8aa6f1c5 CY	204
	205	if (from >= MAX_INLINE_DATA)
	206	return;
	207
54b591df JK	208	f2fs_wait_on_page_writeback(ipage, NODE);
54b591df JK	209
b3d208f9 JK	210	addr = inline_data_addr(ipage);
b3d208f9 JK	211	memset(addr + from, 0, MAX_INLINE_DATA - from);
8aa6f1c5 CY	212	}
8aa6f1c5 CY	213
0342fd30	214	bool recover_inline_data(struct inode inode, struct page npage)
1e1bb4ba	215	{
4081363f	216	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
1e1bb4ba JK	217	struct f2fs_inode *ri = NULL;
	218	void src_addr, dst_addr;
	219	struct page *ipage;
	220
	221	/*
	222	* The inline_data recovery policy is as follows.
	223	* [prev.] [next] of inline_data flag
	224	* o o -> recover inline_data
	225	* o x -> remove inline_data, and then recover data blocks
	226	* x o -> remove inline_data, and then recover inline_data
	227	* x x -> recover data blocks
	228	*/
	229	if (IS_INODE(npage))
	230	ri = F2FS_INODE(npage);
	231
	232	if (f2fs_has_inline_data(inode) &&
0342fd30	233	ri && (ri->i_inline & F2FS_INLINE_DATA)) {
1e1bb4ba JK	234	process_inline:
1e1bb4ba JK	235	ipage = get_node_page(sbi, inode->i_ino);
9850cf4a	236	f2fs_bug_on(sbi, IS_ERR(ipage));
1e1bb4ba	237
54b591df JK	238	f2fs_wait_on_page_writeback(ipage, NODE);
54b591df JK	239
1e1bb4ba JK	240	src_addr = inline_data_addr(npage);
	241	dst_addr = inline_data_addr(ipage);
	242	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
b3d208f9 JK	243
	244	set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	245	set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
	246
1e1bb4ba JK	247	update_inode(inode, ipage);
1e1bb4ba JK	248	f2fs_put_page(ipage, 1);
0342fd30	249	return true;
1e1bb4ba JK	250	}
	251
	252	if (f2fs_has_inline_data(inode)) {
	253	ipage = get_node_page(sbi, inode->i_ino);
9850cf4a	254	f2fs_bug_on(sbi, IS_ERR(ipage));
b3d208f9 JK	255	truncate_inline_data(ipage, 0);
b3d208f9 JK	256	f2fs_clear_inline_inode(inode);
1e1bb4ba JK	257	update_inode(inode, ipage);
1e1bb4ba JK	258	f2fs_put_page(ipage, 1);
0342fd30	259	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
764aa3e9	260	truncate_blocks(inode, 0, false);
1e1bb4ba JK	261	goto process_inline;
1e1bb4ba JK	262	}
0342fd30	263	return false;
1e1bb4ba	264	}
201a05be CY	265
	266	struct f2fs_dir_entry find_in_inline_dir(struct inode dir,
	267	struct qstr name, struct page *res_page)
	268	{
	269	struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
4e6ebf6d	270	struct f2fs_inline_dentry *inline_dentry;
201a05be	271	struct f2fs_dir_entry *de;
7b3cd7d6	272	struct f2fs_dentry_ptr d;
4e6ebf6d	273	struct page *ipage;
201a05be CY	274
	275	ipage = get_node_page(sbi, dir->i_ino);
	276	if (IS_ERR(ipage))
	277	return NULL;
	278
4e6ebf6d	279	inline_dentry = inline_data_addr(ipage);
201a05be	280
7b3cd7d6 JK	281	make_dentry_ptr(&d, (void *)inline_dentry, 2);
	282	de = find_target_dentry(name, NULL, &d);
	283
201a05be	284	unlock_page(ipage);
4e6ebf6d JK	285	if (de)
	286	*res_page = ipage;
	287	else
	288	f2fs_put_page(ipage, 0);
	289
	290	/*
	291	* For the most part, it should be a bug when name_len is zero.
	292	* We stop here for figuring out where the bugs has occurred.
	293	*/
7b3cd7d6	294	f2fs_bug_on(sbi, d.max < 0);
201a05be CY	295	return de;
	296	}
	297
	298	struct f2fs_dir_entry f2fs_parent_inline_dir(struct inode dir,
	299	struct page **p)
	300	{
	301	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	302	struct page *ipage;
	303	struct f2fs_dir_entry *de;
	304	struct f2fs_inline_dentry *dentry_blk;
	305
	306	ipage = get_node_page(sbi, dir->i_ino);
	307	if (IS_ERR(ipage))
	308	return NULL;
	309
	310	dentry_blk = inline_data_addr(ipage);
	311	de = &dentry_blk->dentry[1];
	312	*p = ipage;
	313	unlock_page(ipage);
	314	return de;
	315	}
	316
	317	int make_empty_inline_dir(struct inode inode, struct inode parent,
	318	struct page *ipage)
	319	{
	320	struct f2fs_inline_dentry *dentry_blk;
062a3e7b	321	struct f2fs_dentry_ptr d;
201a05be CY	322
	323	dentry_blk = inline_data_addr(ipage);
	324
062a3e7b JK	325	make_dentry_ptr(&d, (void *)dentry_blk, 2);
062a3e7b JK	326	do_make_empty_dir(inode, parent, &d);
201a05be CY	327
	328	set_page_dirty(ipage);
	329
	330	/* update i_size to MAX_INLINE_DATA */
	331	if (i_size_read(inode) < MAX_INLINE_DATA) {
	332	i_size_write(inode, MAX_INLINE_DATA);
	333	set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
	334	}
	335	return 0;
	336	}
	337
d64948a4	338	static int f2fs_convert_inline_dir(struct inode dir, struct page ipage,
201a05be CY	339	struct f2fs_inline_dentry *inline_dentry)
	340	{
	341	struct page *page;
	342	struct dnode_of_data dn;
	343	struct f2fs_dentry_block *dentry_blk;
	344	int err;
	345
	346	page = grab_cache_page(dir->i_mapping, 0);
	347	if (!page)
	348	return -ENOMEM;
	349
	350	set_new_dnode(&dn, dir, ipage, NULL, 0);
	351	err = f2fs_reserve_block(&dn, 0);
	352	if (err)
	353	goto out;
	354
	355	f2fs_wait_on_page_writeback(page, DATA);
	356	zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	357
f1e33a04	358	dentry_blk = kmap_atomic(page);
201a05be CY	359
	360	/* copy data from inline dentry block to new dentry block */
	361	memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
	362	INLINE_DENTRY_BITMAP_SIZE);
	363	memcpy(dentry_blk->dentry, inline_dentry->dentry,
	364	sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
	365	memcpy(dentry_blk->filename, inline_dentry->filename,
	366	NR_INLINE_DENTRY * F2FS_SLOT_LEN);
	367
f1e33a04	368	kunmap_atomic(dentry_blk);
201a05be CY	369	SetPageUptodate(page);
	370	set_page_dirty(page);
	371
	372	/* clear inline dir and flag after data writeback */
b3d208f9 JK	373	truncate_inline_data(ipage, 0);
b3d208f9 JK	374
3289c061	375	stat_dec_inline_dir(dir);
622f28ae	376	clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
201a05be CY	377
	378	if (i_size_read(dir) < PAGE_CACHE_SIZE) {
	379	i_size_write(dir, PAGE_CACHE_SIZE);
	380	set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	381	}
	382
	383	sync_inode_page(&dn);
	384	out:
	385	f2fs_put_page(page, 1);
	386	return err;
	387	}
	388
	389	int f2fs_add_inline_entry(struct inode dir, const struct qstr name,
	390	struct inode *inode)
	391	{
	392	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	393	struct page *ipage;
	394	unsigned int bit_pos;
	395	f2fs_hash_t name_hash;
	396	struct f2fs_dir_entry *de;
	397	size_t namelen = name->len;
	398	struct f2fs_inline_dentry *dentry_blk = NULL;
	399	int slots = GET_DENTRY_SLOTS(namelen);
	400	struct page *page;
	401	int err = 0;
	402	int i;
	403
	404	name_hash = f2fs_dentry_hash(name);
	405
	406	ipage = get_node_page(sbi, dir->i_ino);
	407	if (IS_ERR(ipage))
	408	return PTR_ERR(ipage);
	409
	410	dentry_blk = inline_data_addr(ipage);
a82afa20 JK	411	bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
a82afa20 JK	412	slots, NR_INLINE_DENTRY);
201a05be CY	413	if (bit_pos >= NR_INLINE_DENTRY) {
	414	err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
	415	if (!err)
	416	err = -EAGAIN;
	417	goto out;
	418	}
	419
201a05be	420	down_write(&F2FS_I(inode)->i_sem);
bce8d112	421	page = init_inode_metadata(inode, dir, name, ipage);
201a05be CY	422	if (IS_ERR(page)) {
	423	err = PTR_ERR(page);
	424	goto fail;
	425	}
bce8d112 JK	426
bce8d112 JK	427	f2fs_wait_on_page_writeback(ipage, NODE);
201a05be CY	428	de = &dentry_blk->dentry[bit_pos];
	429	de->hash_code = name_hash;
	430	de->name_len = cpu_to_le16(namelen);
	431	memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
	432	de->ino = cpu_to_le32(inode->i_ino);
	433	set_de_type(de, inode);
	434	for (i = 0; i < slots; i++)
	435	test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
	436	set_page_dirty(ipage);
	437
	438	/* we don't need to mark_inode_dirty now */
	439	F2FS_I(inode)->i_pino = dir->i_ino;
	440	update_inode(inode, page);
	441	f2fs_put_page(page, 1);
	442
	443	update_parent_metadata(dir, inode, 0);
	444	fail:
	445	up_write(&F2FS_I(inode)->i_sem);
	446
	447	if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
	448	update_inode(dir, ipage);
	449	clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	450	}
	451	out:
	452	f2fs_put_page(ipage, 1);
	453	return err;
	454	}
	455
	456	void f2fs_delete_inline_entry(struct f2fs_dir_entry dentry, struct page page,
	457	struct inode dir, struct inode inode)
	458	{
	459	struct f2fs_inline_dentry *inline_dentry;
	460	int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
	461	unsigned int bit_pos;
	462	int i;
	463
	464	lock_page(page);
59a06155	465	f2fs_wait_on_page_writeback(page, NODE);
201a05be CY	466
	467	inline_dentry = inline_data_addr(page);
	468	bit_pos = dentry - inline_dentry->dentry;
	469	for (i = 0; i < slots; i++)
	470	test_and_clear_bit_le(bit_pos + i,
	471	&inline_dentry->dentry_bitmap);
	472
	473	set_page_dirty(page);
	474
	475	dir->i_ctime = dir->i_mtime = CURRENT_TIME;
	476
	477	if (inode)
	478	f2fs_drop_nlink(dir, inode, page);
	479
	480	f2fs_put_page(page, 1);
	481	}
	482
	483	bool f2fs_empty_inline_dir(struct inode *dir)
	484	{
	485	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	486	struct page *ipage;
	487	unsigned int bit_pos = 2;
	488	struct f2fs_inline_dentry *dentry_blk;
	489
	490	ipage = get_node_page(sbi, dir->i_ino);
	491	if (IS_ERR(ipage))
	492	return false;
	493
	494	dentry_blk = inline_data_addr(ipage);
	495	bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
	496	NR_INLINE_DENTRY,
	497	bit_pos);
	498
	499	f2fs_put_page(ipage, 1);
	500
	501	if (bit_pos < NR_INLINE_DENTRY)
	502	return false;
	503
	504	return true;
	505	}
	506
	507	int f2fs_read_inline_dir(struct file file, struct dir_context ctx)
	508	{
	509	struct inode *inode = file_inode(file);
201a05be	510	struct f2fs_inline_dentry *inline_dentry = NULL;
201a05be	511	struct page *ipage = NULL;
7b3cd7d6	512	struct f2fs_dentry_ptr d;
201a05be CY	513
	514	if (ctx->pos == NR_INLINE_DENTRY)
	515	return 0;
	516
38594de7	517	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
201a05be CY	518	if (IS_ERR(ipage))
	519	return PTR_ERR(ipage);
	520
201a05be	521	inline_dentry = inline_data_addr(ipage);
201a05be	522
7b3cd7d6 JK	523	make_dentry_ptr(&d, (void *)inline_dentry, 2);
	524
	525	if (!f2fs_fill_dentries(ctx, &d, 0))
38594de7	526	ctx->pos = NR_INLINE_DENTRY;
201a05be	527
38594de7	528	f2fs_put_page(ipage, 1);
201a05be CY	529	return 0;
201a05be CY	530	}