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

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