[GitHub/exynos8895/android_kernel_samsung_universal8895.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);
}

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

	if (from >= MAX_INLINE_DATA)
		return false;

	addr = inline_data_addr(ipage);

	f2fs_wait_on_page_writeback(ipage, NODE);
	memset(addr + from, 0, MAX_INLINE_DATA - from);

	return true;
}

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

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