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