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

/*
 * fs/f2fs/inline.c
 * Copyright (c) 2013, Intel Corporation
 * Authors: Huajun Li <[email protected]>
 *          Haicheng Li <[email protected]>
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */

#include <linux/fs.h>
#include <linux/f2fs_fs.h>

#include "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;
	block_t new_blk_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);

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