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

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

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