[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"
#include "node.h"

bool f2fs_may_inline_data(struct inode *inode)
{
	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, true);
	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)
{
	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;

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

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

	f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));

	read_inline_data(page, dn->inode_page);
	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, true);
	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_inline_node(dn->inode_page);
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;

	if (!f2fs_has_inline_data(inode))
		return 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);

	f2fs_balance_fs(sbi, dn.node_changed);

	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, true);
	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);
	clear_inline_node(dn.inode_page);
	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, true);

		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, true);
	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, true);

	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, true);

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

int f2fs_inline_data_fiemap(struct inode *inode,
		struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
{
	__u64 byteaddr, ilen;
	__u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
		FIEMAP_EXTENT_LAST;
	struct node_info ni;
	struct page *ipage;
	int err = 0;

	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
	if (IS_ERR(ipage))
		return PTR_ERR(ipage);

	if (!f2fs_has_inline_data(inode)) {
		err = -EAGAIN;
		goto out;
	}

	ilen = min_t(size_t, MAX_INLINE_DATA, i_size_read(inode));
	if (start >= ilen)
		goto out;
	if (start + len < ilen)
		ilen = start + len;
	ilen -= start;

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