[mirror_ubuntu-artful-kernel.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:
	set_page_dirty(page);

	/* 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));
		if (!truncate_inline_inode(ipage, 0))
			return false;
		f2fs_clear_inline_inode(inode);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
		if (truncate_blocks(inode, 0, false))
			return false;
		goto process_inline;
	}
	return false;
}

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

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

	namehash = f2fs_dentry_hash(&name);

	inline_dentry = inline_data_addr(ipage);

	make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
	de = find_target_dentry(fname, namehash, 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;
}

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