[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)
{
	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);
}

static void truncate_inline_data(struct page *ipage)
{
	f2fs_wait_on_page_writeback(ipage, NODE);
	memset(inline_data_addr(ipage), 0, MAX_INLINE_DATA);
}

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

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

	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;
	size_t namelen = name->len;
	struct f2fs_inline_dentry *dentry_blk = NULL;
	struct f2fs_dentry_ptr d;
	int slots = GET_DENTRY_SLOTS(namelen);
	struct page *page;
	int err = 0;

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

	name_hash = f2fs_dentry_hash(name);
	make_dentry_ptr(&d, (void *)dentry_blk, 2);
	f2fs_update_dentry(inode, &d, name, name_hash, bit_pos);

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