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

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

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

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

	f2fs_lock_op(sbi);

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

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

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

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

	f2fs_put_page(page, 1);
	return err;
}

int f2fs_write_inline_data(struct inode *inode, struct page *page)
{
	void *src_addr, *dst_addr;
	struct dnode_of_data dn;
	int err;

	set_new_dnode(&dn, inode, NULL, NULL, 0);
	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	if (err)
		return err;

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

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

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

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

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

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

	if (from >= MAX_INLINE_DATA)
		return;

	f2fs_wait_on_page_writeback(ipage, NODE);

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

bool recover_inline_data(struct inode *inode, struct page *npage)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	struct f2fs_inode *ri = NULL;
	void *src_addr, *dst_addr;
	struct page *ipage;

	/*
	 * The inline_data recovery policy is as follows.
	 * [prev.] [next] of inline_data flag
	 *    o       o  -> recover inline_data
	 *    o       x  -> remove inline_data, and then recover data blocks
	 *    x       o  -> remove inline_data, and then recover inline_data
	 *    x       x  -> recover data blocks
	 */
	if (IS_INODE(npage))
		ri = F2FS_INODE(npage);

	if (f2fs_has_inline_data(inode) &&
			ri && (ri->i_inline & F2FS_INLINE_DATA)) {
process_inline:
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(sbi, IS_ERR(ipage));

		f2fs_wait_on_page_writeback(ipage, NODE);

		src_addr = inline_data_addr(npage);
		dst_addr = inline_data_addr(ipage);
		memcpy(dst_addr, src_addr, MAX_INLINE_DATA);

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

		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
		return true;
	}

	if (f2fs_has_inline_data(inode)) {
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(sbi, IS_ERR(ipage));
		truncate_inline_data(ipage, 0);
		f2fs_clear_inline_inode(inode);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
		truncate_blocks(inode, 0, false);
		goto process_inline;
	}
	return false;
}

struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
				struct qstr *name, struct page **res_page)
{
	struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
	struct f2fs_inline_dentry *inline_dentry;
	struct f2fs_dir_entry *de;
	struct f2fs_dentry_ptr d;
	struct page *ipage;

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

	inline_dentry = inline_data_addr(ipage);

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

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

	/*
	 * For the most part, it should be a bug when name_len is zero.
	 * We stop here for figuring out where the bugs has occurred.
	 */
	f2fs_bug_on(sbi, d.max < 0);
	return de;
}

struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *dir,
							struct page **p)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	struct f2fs_dir_entry *de;
	struct f2fs_inline_dentry *dentry_blk;

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

	dentry_blk = inline_data_addr(ipage);
	de = &dentry_blk->dentry[1];
	*p = ipage;
	unlock_page(ipage);
	return de;
}

int make_empty_inline_dir(struct inode *inode, struct inode *parent,
							struct page *ipage)
{
	struct f2fs_inline_dentry *dentry_blk;
	struct f2fs_dentry_ptr d;

	dentry_blk = inline_data_addr(ipage);

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

	set_page_dirty(ipage);

	/* update i_size to MAX_INLINE_DATA */
	if (i_size_read(inode) < MAX_INLINE_DATA) {
		i_size_write(inode, MAX_INLINE_DATA);
		set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
	}
	return 0;
}

static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
				struct f2fs_inline_dentry *inline_dentry)
{
	struct page *page;
	struct dnode_of_data dn;
	struct f2fs_dentry_block *dentry_blk;
	int err;

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

	set_new_dnode(&dn, dir, ipage, NULL, 0);
	err = f2fs_reserve_block(&dn, 0);
	if (err)
		goto out;

	f2fs_wait_on_page_writeback(page, DATA);
	zero_user_segment(page, 0, PAGE_CACHE_SIZE);

	dentry_blk = kmap_atomic(page);

	/* copy data from inline dentry block to new dentry block */
	memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
					INLINE_DENTRY_BITMAP_SIZE);
	memcpy(dentry_blk->dentry, inline_dentry->dentry,
			sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
	memcpy(dentry_blk->filename, inline_dentry->filename,
					NR_INLINE_DENTRY * F2FS_SLOT_LEN);

	kunmap_atomic(dentry_blk);
	SetPageUptodate(page);
	set_page_dirty(page);

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

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

	if (i_size_read(dir) < PAGE_CACHE_SIZE) {
		i_size_write(dir, PAGE_CACHE_SIZE);
		set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	}

	sync_inode_page(&dn);
out:
	f2fs_put_page(page, 1);
	return err;
}

int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
						struct inode *inode)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	unsigned int bit_pos;
	f2fs_hash_t name_hash;
	struct f2fs_dir_entry *de;
	size_t namelen = name->len;
	struct f2fs_inline_dentry *dentry_blk = NULL;
	int slots = GET_DENTRY_SLOTS(namelen);
	struct page *page;
	int err = 0;
	int i;

	name_hash = f2fs_dentry_hash(name);

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

	dentry_blk = inline_data_addr(ipage);
	bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
						slots, NR_INLINE_DENTRY);
	if (bit_pos >= NR_INLINE_DENTRY) {
		err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
		if (!err)
			err = -EAGAIN;
		goto out;
	}

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

	f2fs_wait_on_page_writeback(ipage, NODE);
	de = &dentry_blk->dentry[bit_pos];
	de->hash_code = name_hash;
	de->name_len = cpu_to_le16(namelen);
	memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
	de->ino = cpu_to_le32(inode->i_ino);
	set_de_type(de, inode);
	for (i = 0; i < slots; i++)
		test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
	set_page_dirty(ipage);

	/* we don't need to mark_inode_dirty now */
	F2FS_I(inode)->i_pino = dir->i_ino;
	update_inode(inode, page);
	f2fs_put_page(page, 1);

	update_parent_metadata(dir, inode, 0);
fail:
	up_write(&F2FS_I(inode)->i_sem);

	if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
		update_inode(dir, ipage);
		clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	}
out:
	f2fs_put_page(ipage, 1);
	return err;
}

void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
					struct inode *dir, struct inode *inode)
{
	struct f2fs_inline_dentry *inline_dentry;
	int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
	unsigned int bit_pos;
	int i;

	lock_page(page);
	f2fs_wait_on_page_writeback(page, NODE);

	inline_dentry = inline_data_addr(page);
	bit_pos = dentry - inline_dentry->dentry;
	for (i = 0; i < slots; i++)
		test_and_clear_bit_le(bit_pos + i,
				&inline_dentry->dentry_bitmap);

	set_page_dirty(page);

	dir->i_ctime = dir->i_mtime = CURRENT_TIME;

	if (inode)
		f2fs_drop_nlink(dir, inode, page);

	f2fs_put_page(page, 1);
}

bool f2fs_empty_inline_dir(struct inode *dir)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	unsigned int bit_pos = 2;
	struct f2fs_inline_dentry *dentry_blk;

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

	dentry_blk = inline_data_addr(ipage);
	bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
					NR_INLINE_DENTRY,
					bit_pos);

	f2fs_put_page(ipage, 1);

	if (bit_pos < NR_INLINE_DENTRY)
		return false;

	return true;
}

int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx)
{
	struct inode *inode = file_inode(file);
	struct f2fs_inline_dentry *inline_dentry = NULL;
	struct page *ipage = NULL;
	struct f2fs_dentry_ptr d;

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

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

	inline_dentry = inline_data_addr(ipage);

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

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

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