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

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 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);
	kunmap_atomic(dst_addr);
	SetPageUptodate(page);
no_update:
	/* write data page to try to make data consistent */
	set_page_writeback(page);

	write_data_page(page, dn, &new_blk_addr, &fio);
	update_extent_cache(new_blk_addr, dn);
	f2fs_wait_on_page_writeback(page, DATA);

	/* clear inline data and flag after data writeback */
	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)) {
		f2fs_unlock_op(sbi);
		return PTR_ERR(ipage);
	}

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

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