[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_data(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) && !S_ISLNK(inode->i_mode))
		return false;

	if (i_size_read(inode) > MAX_INLINE_DATA)
		return false;

	if (f2fs_encrypted_inode(inode) && S_ISREG(inode->i_mode))
		return false;

	return true;
}

bool f2fs_may_inline_dentry(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), INLINE_DENTRY))
		return false;

	if (!S_ISDIR(inode->i_mode))
		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 = {
		.sbi = F2FS_I_SB(dn->inode),
		.type = DATA,
		.rw = WRITE_SYNC | REQ_PRIO,
		.page = page,
		.encrypted_page = NULL,
	};
	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(dn, &fio);
	set_data_blkaddr(dn);
	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(NULL, &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(NULL, &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, nid_t ino, umode_t mode)
{
	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 = NULL;
	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;
	}

	if (inode) {
		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(NULL, &d, (void *)dentry_blk, 2);
	f2fs_update_dentry(ino, mode, &d, name, name_hash, bit_pos);

	set_page_dirty(ipage);

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

	update_parent_metadata(dir, inode, 0);
fail:
	if (inode)
		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 f2fs_str *fstr)
{
	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(inode, &d, (void *)inline_dentry, 2);

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