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

	if (dn.node_changed)
		f2fs_balance_fs(sbi);

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

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