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

	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 = {
		.type = DATA,
		.rw = WRITE_SYNC | REQ_PRIO,
	};
	int dirty, err;

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

	if (!f2fs_exist_data(dn->inode))
		goto clear_out;

	err = f2fs_reserve_block(dn, 0);
	if (err)
		return err;

	f2fs_wait_on_page_writeback(page, DATA);

	if (PageUptodate(page))
		goto no_update;

	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(dn->inode_page);
	dst_addr = kmap_atomic(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	flush_dcache_page(page);
	kunmap_atomic(dst_addr);
	SetPageUptodate(page);
no_update:
	/* clear dirty state */
	dirty = clear_page_dirty_for_io(page);

	/* write data page to try to make data consistent */
	set_page_writeback(page);
	fio.blk_addr = dn->data_blkaddr;
	write_data_page(page, dn, &fio);
	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(&d, (void *)inline_dentry, 2);
	de = find_target_dentry(name, NULL, &d);

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

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

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

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

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

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

	dentry_blk = inline_data_addr(ipage);

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

	set_page_dirty(ipage);

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

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

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

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

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

	dentry_blk = kmap_atomic(page);

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

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

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

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

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

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

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