[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_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);
	if (!PageUptodate(page))
		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);
	set_page_dirty(ipage);
	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_SIZE);
	else
		read_inline_data(page, ipage);

	if (!PageUptodate(page))
		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.old_blkaddr = dn->data_blkaddr;
	write_data_page(dn, &fio);
	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(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);
	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 = f2fs_grab_cache_page(inode->i_mapping, 0, false);
	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_page_dirty(dn.inode_page);

	set_inode_flag(inode, FI_APPEND_WRITE);
	set_inode_flag(inode, FI_DATA_EXIST);

	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(inode, FI_INLINE_DATA);
		set_inode_flag(inode, FI_DATA_EXIST);

		set_page_dirty(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);
		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 fscrypt_name *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)) {
		*res_page = 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);

	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)
		f2fs_i_size_write(inode, MAX_INLINE_DATA);
	return 0;
}

/*
 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
 * release ipage in this function.
 */
static int f2fs_move_inline_dirents(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 = f2fs_grab_cache_page(dir->i_mapping, 0, false);
	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_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);
	if (!PageUptodate(page))
		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(dir, FI_INLINE_DENTRY);

	f2fs_i_depth_write(dir, 1);
	if (i_size_read(dir) < PAGE_SIZE)
		f2fs_i_size_write(dir, PAGE_SIZE);
out:
	f2fs_put_page(page, 1);
	return err;
}

static int f2fs_add_inline_entries(struct inode *dir,
			struct f2fs_inline_dentry *inline_dentry)
{
	struct f2fs_dentry_ptr d;
	unsigned long bit_pos = 0;
	int err = 0;

	make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);

	while (bit_pos < d.max) {
		struct f2fs_dir_entry *de;
		struct qstr new_name;
		nid_t ino;
		umode_t fake_mode;

		if (!test_bit_le(bit_pos, d.bitmap)) {
			bit_pos++;
			continue;
		}

		de = &d.dentry[bit_pos];

		if (unlikely(!de->name_len)) {
			bit_pos++;
			continue;
		}

		new_name.name = d.filename[bit_pos];
		new_name.len = de->name_len;

		ino = le32_to_cpu(de->ino);
		fake_mode = get_de_type(de) << S_SHIFT;

		err = f2fs_add_regular_entry(dir, &new_name, NULL,
							ino, fake_mode);
		if (err)
			goto punch_dentry_pages;

		bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
	}
	return 0;
punch_dentry_pages:
	truncate_inode_pages(&dir->i_data, 0);
	truncate_blocks(dir, 0, false);
	remove_dirty_inode(dir);
	return err;
}

static int f2fs_move_rehashed_dirents(struct inode *dir, struct page *ipage,
				struct f2fs_inline_dentry *inline_dentry)
{
	struct f2fs_inline_dentry *backup_dentry;
	int err;

	backup_dentry = f2fs_kmalloc(sizeof(struct f2fs_inline_dentry),
							GFP_F2FS_ZERO);
	if (!backup_dentry) {
		f2fs_put_page(ipage, 1);
		return -ENOMEM;
	}

	memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA);
	truncate_inline_inode(ipage, 0);

	unlock_page(ipage);

	err = f2fs_add_inline_entries(dir, backup_dentry);
	if (err)
		goto recover;

	lock_page(ipage);

	stat_dec_inline_dir(dir);
	clear_inode_flag(dir, FI_INLINE_DENTRY);
	kfree(backup_dentry);
	return 0;
recover:
	lock_page(ipage);
	memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA);
	f2fs_i_depth_write(dir, 0);
	f2fs_i_size_write(dir, MAX_INLINE_DATA);
	set_page_dirty(ipage);
	f2fs_put_page(ipage, 1);

	kfree(backup_dentry);
	return err;
}

static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
				struct f2fs_inline_dentry *inline_dentry)
{
	if (!F2FS_I(dir)->i_dir_level)
		return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
	else
		return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
}

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_pino_write(inode, dir->i_ino);
		f2fs_put_page(page, 1);
	}

	update_parent_metadata(dir, inode, 0);
fail:
	if (inode)
		up_write(&F2FS_I(inode)->i_sem);
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);
	f2fs_put_page(page, 1);

	dir->i_ctime = dir->i_mtime = CURRENT_TIME;
	mark_inode_dirty_sync(dir);

	if (inode)
		f2fs_drop_nlink(dir, inode);
}

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 fscrypt_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
09cbfeaf	54	zero_user_segment(page, MAX_INLINE_DATA, PAGE_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);
237c0790 JK	62	if (!PageUptodate(page))
237c0790 JK	63	SetPageUptodate(page);
b3d208f9 JK	64	}
b3d208f9 JK	65
0bfcfcca	66	bool truncate_inline_inode(struct page *ipage, u64 from)
feeb0deb	67	{
0bfcfcca CY	68	void *addr;
0bfcfcca CY	69
0bfcfcca CY	70	if (from >= MAX_INLINE_DATA)
	71	return false;
	72
	73	addr = inline_data_addr(ipage);
	74
fec1d657	75	f2fs_wait_on_page_writeback(ipage, NODE, true);
0bfcfcca	76	memset(addr + from, 0, MAX_INLINE_DATA - from);
ee6d182f	77	set_page_dirty(ipage);
0bfcfcca	78	return true;
feeb0deb CY	79	}
feeb0deb CY	80
b3d208f9 JK	81	int f2fs_read_inline_data(struct inode inode, struct page page)
	82	{
	83	struct page *ipage;
	84
	85	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
	86	if (IS_ERR(ipage)) {
	87	unlock_page(page);
	88	return PTR_ERR(ipage);
	89	}
e18c65b2	90
b3d208f9 JK	91	if (!f2fs_has_inline_data(inode)) {
	92	f2fs_put_page(ipage, 1);
	93	return -EAGAIN;
	94	}
	95
	96	if (page->index)
09cbfeaf	97	zero_user_segment(page, 0, PAGE_SIZE);
b3d208f9 JK	98	else
	99	read_inline_data(page, ipage);
	100
237c0790 JK	101	if (!PageUptodate(page))
237c0790 JK	102	SetPageUptodate(page);
b3d208f9 JK	103	f2fs_put_page(ipage, 1);
b3d208f9 JK	104	unlock_page(page);
e18c65b2 HL	105	return 0;
	106	}
	107
b3d208f9	108	int f2fs_convert_inline_page(struct dnode_of_data dn, struct page page)
e18c65b2	109	{
e18c65b2	110	struct f2fs_io_info fio = {
05ca3632	111	.sbi = F2FS_I_SB(dn->inode),
e18c65b2 HL	112	.type = DATA,
e18c65b2 HL	113	.rw = WRITE_SYNC \| REQ_PRIO,
05ca3632	114	.page = page,
4375a336	115	.encrypted_page = NULL,
e18c65b2	116	};
158c194c	117	int dirty, err;
e18c65b2	118
b3d208f9 JK	119	if (!f2fs_exist_data(dn->inode))
b3d208f9 JK	120	goto clear_out;
ec4e7af4	121
b3d208f9	122	err = f2fs_reserve_block(dn, 0);
15c6e3aa	123	if (err)
b3d208f9	124	return err;
e18c65b2	125
85ead818	126	f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
b3d208f9	127
8060656a	128	read_inline_data(page, dn->inode_page);
6282adbf JK	129	set_page_dirty(page);
6282adbf JK	130
158c194c JK	131	/* clear dirty state */
	132	dirty = clear_page_dirty_for_io(page);
	133
e18c65b2 HL	134	/* write data page to try to make data consistent */
e18c65b2 HL	135	set_page_writeback(page);
7a9d7548	136	fio.old_blkaddr = dn->data_blkaddr;
05ca3632	137	write_data_page(dn, &fio);
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	142	/* this converted inline_data should be recovered. */
91942321	143	set_inode_flag(dn->inode, FI_APPEND_WRITE);
95f5b0fc	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	f2fs_put_dnode(dn);
b3d208f9 JK	152	return 0;
e18c65b2 HL	153	}
e18c65b2 HL	154
b3d208f9	155	int f2fs_convert_inline_inode(struct inode *inode)
e18c65b2	156	{
b3d208f9 JK	157	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	158	struct dnode_of_data dn;
	159	struct page ipage, page;
	160	int err = 0;
e18c65b2	161
b9d777b8 JK	162	if (!f2fs_has_inline_data(inode))
	163	return 0;
	164
300e129c	165	page = f2fs_grab_cache_page(inode->i_mapping, 0, false);
b3d208f9 JK	166	if (!page)
b3d208f9 JK	167	return -ENOMEM;
e18c65b2	168
b3d208f9 JK	169	f2fs_lock_op(sbi);
	170
	171	ipage = get_node_page(sbi, inode->i_ino);
	172	if (IS_ERR(ipage)) {
6d20aff8 JK	173	err = PTR_ERR(ipage);
6d20aff8 JK	174	goto out;
b067ba1f	175	}
e18c65b2	176
b3d208f9 JK	177	set_new_dnode(&dn, inode, ipage, ipage, 0);
	178
	179	if (f2fs_has_inline_data(inode))
	180	err = f2fs_convert_inline_page(&dn, page);
	181
	182	f2fs_put_dnode(&dn);
6d20aff8	183	out:
b3d208f9 JK	184	f2fs_unlock_op(sbi);
	185
	186	f2fs_put_page(page, 1);
2a340760	187
2c4db1a6	188	f2fs_balance_fs(sbi, dn.node_changed);
2a340760	189
e18c65b2 HL	190	return err;
	191	}
	192
b3d208f9	193	int f2fs_write_inline_data(struct inode inode, struct page page)
e18c65b2 HL	194	{
e18c65b2 HL	195	void src_addr, dst_addr;
e18c65b2 HL	196	struct dnode_of_data dn;
	197	int err;
	198
	199	set_new_dnode(&dn, inode, NULL, NULL, 0);
	200	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	201	if (err)
	202	return err;
e18c65b2	203
c08a690b	204	if (!f2fs_has_inline_data(inode)) {
b3d208f9 JK	205	f2fs_put_dnode(&dn);
b3d208f9 JK	206	return -EAGAIN;
c08a690b JK	207	}
c08a690b JK	208
b3d208f9 JK	209	f2fs_bug_on(F2FS_I_SB(inode), page->index);
b3d208f9 JK	210
fec1d657	211	f2fs_wait_on_page_writeback(dn.inode_page, NODE, true);
f1e33a04	212	src_addr = kmap_atomic(page);
b3d208f9 JK	213	dst_addr = inline_data_addr(dn.inode_page);
b3d208f9 JK	214	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
f1e33a04	215	kunmap_atomic(src_addr);
ee6d182f	216	set_page_dirty(dn.inode_page);
e18c65b2	217
91942321 JK	218	set_inode_flag(inode, FI_APPEND_WRITE);
91942321 JK	219	set_inode_flag(inode, FI_DATA_EXIST);
b3d208f9	220
2049d4fc	221	clear_inline_node(dn.inode_page);
e18c65b2	222	f2fs_put_dnode(&dn);
e18c65b2 HL	223	return 0;
e18c65b2 HL	224	}
1e1bb4ba	225
0342fd30	226	bool recover_inline_data(struct inode inode, struct page npage)
1e1bb4ba	227	{
4081363f	228	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
1e1bb4ba JK	229	struct f2fs_inode *ri = NULL;
	230	void src_addr, dst_addr;
	231	struct page *ipage;
	232
	233	/*
	234	* The inline_data recovery policy is as follows.
	235	* [prev.] [next] of inline_data flag
	236	* o o -> recover inline_data
	237	* o x -> remove inline_data, and then recover data blocks
	238	* x o -> remove inline_data, and then recover inline_data
	239	* x x -> recover data blocks
	240	*/
	241	if (IS_INODE(npage))
	242	ri = F2FS_INODE(npage);
	243
	244	if (f2fs_has_inline_data(inode) &&
0342fd30	245	ri && (ri->i_inline & F2FS_INLINE_DATA)) {
1e1bb4ba JK	246	process_inline:
1e1bb4ba JK	247	ipage = get_node_page(sbi, inode->i_ino);
9850cf4a	248	f2fs_bug_on(sbi, IS_ERR(ipage));
1e1bb4ba	249
fec1d657	250	f2fs_wait_on_page_writeback(ipage, NODE, true);
54b591df	251
1e1bb4ba JK	252	src_addr = inline_data_addr(npage);
	253	dst_addr = inline_data_addr(ipage);
	254	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
b3d208f9	255
91942321 JK	256	set_inode_flag(inode, FI_INLINE_DATA);
91942321 JK	257	set_inode_flag(inode, FI_DATA_EXIST);
b3d208f9	258
ee6d182f	259	set_page_dirty(ipage);
1e1bb4ba	260	f2fs_put_page(ipage, 1);
0342fd30	261	return true;
1e1bb4ba JK	262	}
	263
	264	if (f2fs_has_inline_data(inode)) {
	265	ipage = get_node_page(sbi, inode->i_ino);
9850cf4a	266	f2fs_bug_on(sbi, IS_ERR(ipage));
545fe421 NK	267	if (!truncate_inline_inode(ipage, 0))
545fe421 NK	268	return false;
b3d208f9	269	f2fs_clear_inline_inode(inode);
1e1bb4ba	270	f2fs_put_page(ipage, 1);
0342fd30	271	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
545fe421 NK	272	if (truncate_blocks(inode, 0, false))
545fe421 NK	273	return false;
1e1bb4ba JK	274	goto process_inline;
1e1bb4ba JK	275	}
0342fd30	276	return false;
1e1bb4ba	277	}
201a05be CY	278
201a05be CY	279	struct f2fs_dir_entry find_in_inline_dir(struct inode dir,
0b81d077	280	struct fscrypt_name fname, struct page *res_page)
201a05be CY	281	{
201a05be CY	282	struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
4e6ebf6d	283	struct f2fs_inline_dentry *inline_dentry;
6e22c691	284	struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
201a05be	285	struct f2fs_dir_entry *de;
7b3cd7d6	286	struct f2fs_dentry_ptr d;
4e6ebf6d	287	struct page *ipage;
6e22c691	288	f2fs_hash_t namehash;
201a05be CY	289
201a05be CY	290	ipage = get_node_page(sbi, dir->i_ino);
42d96401 JK	291	if (IS_ERR(ipage)) {
42d96401 JK	292	*res_page = ipage;
201a05be	293	return NULL;
42d96401	294	}
201a05be	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
201a05be CY	308	return de;
	309	}
	310
201a05be CY	311	int make_empty_inline_dir(struct inode inode, struct inode parent,
	312	struct page *ipage)
	313	{
	314	struct f2fs_inline_dentry *dentry_blk;
062a3e7b	315	struct f2fs_dentry_ptr d;
201a05be CY	316
	317	dentry_blk = inline_data_addr(ipage);
	318
d8c6822a	319	make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
062a3e7b	320	do_make_empty_dir(inode, parent, &d);
201a05be CY	321
	322	set_page_dirty(ipage);
	323
	324	/* update i_size to MAX_INLINE_DATA */
ee6d182f	325	if (i_size_read(inode) < MAX_INLINE_DATA)
fc9581c8	326	f2fs_i_size_write(inode, MAX_INLINE_DATA);
201a05be CY	327	return 0;
	328	}
	329
470f00e9 CY	330	/*
	331	* NOTE: ipage is grabbed by caller, but if any error occurs, we should
	332	* release ipage in this function.
	333	*/
675f10bd	334	static int f2fs_move_inline_dirents(struct inode dir, struct page ipage,
201a05be CY	335	struct f2fs_inline_dentry *inline_dentry)
	336	{
	337	struct page *page;
	338	struct dnode_of_data dn;
	339	struct f2fs_dentry_block *dentry_blk;
	340	int err;
	341
300e129c	342	page = f2fs_grab_cache_page(dir->i_mapping, 0, false);
470f00e9 CY	343	if (!page) {
470f00e9 CY	344	f2fs_put_page(ipage, 1);
201a05be	345	return -ENOMEM;
470f00e9	346	}
201a05be CY	347
	348	set_new_dnode(&dn, dir, ipage, NULL, 0);
	349	err = f2fs_reserve_block(&dn, 0);
	350	if (err)
	351	goto out;
	352
fec1d657	353	f2fs_wait_on_page_writeback(page, DATA, true);
09cbfeaf	354	zero_user_segment(page, MAX_INLINE_DATA, PAGE_SIZE);
201a05be	355
f1e33a04	356	dentry_blk = kmap_atomic(page);
201a05be CY	357
	358	/* copy data from inline dentry block to new dentry block */
	359	memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
	360	INLINE_DENTRY_BITMAP_SIZE);
4ec17d68 CY	361	memset(dentry_blk->dentry_bitmap + INLINE_DENTRY_BITMAP_SIZE, 0,
	362	SIZE_OF_DENTRY_BITMAP - INLINE_DENTRY_BITMAP_SIZE);
	363	/*
	364	* we do not need to zero out remainder part of dentry and filename
	365	* field, since we have used bitmap for marking the usage status of
	366	* them, besides, we can also ignore copying/zeroing reserved space
	367	* of dentry block, because them haven't been used so far.
	368	*/
201a05be CY	369	memcpy(dentry_blk->dentry, inline_dentry->dentry,
	370	sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
	371	memcpy(dentry_blk->filename, inline_dentry->filename,
	372	NR_INLINE_DENTRY * F2FS_SLOT_LEN);
	373
f1e33a04	374	kunmap_atomic(dentry_blk);
237c0790 JK	375	if (!PageUptodate(page))
237c0790 JK	376	SetPageUptodate(page);
201a05be CY	377	set_page_dirty(page);
	378
	379	/* clear inline dir and flag after data writeback */
0bfcfcca	380	truncate_inline_inode(ipage, 0);
b3d208f9	381
3289c061	382	stat_dec_inline_dir(dir);
91942321	383	clear_inode_flag(dir, FI_INLINE_DENTRY);
201a05be	384
205b9822	385	f2fs_i_depth_write(dir, 1);
ee6d182f	386	if (i_size_read(dir) < PAGE_SIZE)
fc9581c8	387	f2fs_i_size_write(dir, PAGE_SIZE);
201a05be CY	388	out:
	389	f2fs_put_page(page, 1);
	390	return err;
	391	}
	392
675f10bd CY	393	static int f2fs_add_inline_entries(struct inode *dir,
	394	struct f2fs_inline_dentry *inline_dentry)
	395	{
	396	struct f2fs_dentry_ptr d;
	397	unsigned long bit_pos = 0;
	398	int err = 0;
	399
	400	make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
	401
	402	while (bit_pos < d.max) {
	403	struct f2fs_dir_entry *de;
	404	struct qstr new_name;
	405	nid_t ino;
	406	umode_t fake_mode;
	407
	408	if (!test_bit_le(bit_pos, d.bitmap)) {
	409	bit_pos++;
	410	continue;
	411	}
	412
	413	de = &d.dentry[bit_pos];
a4a13f58 CY	414
	415	if (unlikely(!de->name_len)) {
	416	bit_pos++;
	417	continue;
	418	}
	419
675f10bd CY	420	new_name.name = d.filename[bit_pos];
	421	new_name.len = de->name_len;
	422
	423	ino = le32_to_cpu(de->ino);
	424	fake_mode = get_de_type(de) << S_SHIFT;
	425
	426	err = f2fs_add_regular_entry(dir, &new_name, NULL,
	427	ino, fake_mode);
	428	if (err)
	429	goto punch_dentry_pages;
	430
675f10bd CY	431	bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
	432	}
	433	return 0;
	434	punch_dentry_pages:
	435	truncate_inode_pages(&dir->i_data, 0);
	436	truncate_blocks(dir, 0, false);
	437	remove_dirty_inode(dir);
	438	return err;
	439	}
	440
	441	static int f2fs_move_rehashed_dirents(struct inode dir, struct page ipage,
	442	struct f2fs_inline_dentry *inline_dentry)
	443	{
	444	struct f2fs_inline_dentry *backup_dentry;
	445	int err;
	446
0414b004	447	backup_dentry = f2fs_kmalloc(sizeof(struct f2fs_inline_dentry),
675f10bd	448	GFP_F2FS_ZERO);
8975bdf4 CY	449	if (!backup_dentry) {
8975bdf4 CY	450	f2fs_put_page(ipage, 1);
675f10bd	451	return -ENOMEM;
8975bdf4	452	}
675f10bd CY	453
	454	memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA);
	455	truncate_inline_inode(ipage, 0);
	456
	457	unlock_page(ipage);
	458
	459	err = f2fs_add_inline_entries(dir, backup_dentry);
	460	if (err)
	461	goto recover;
	462
	463	lock_page(ipage);
	464
	465	stat_dec_inline_dir(dir);
91942321	466	clear_inode_flag(dir, FI_INLINE_DENTRY);
675f10bd CY	467	kfree(backup_dentry);
	468	return 0;
	469	recover:
	470	lock_page(ipage);
	471	memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA);
205b9822	472	f2fs_i_depth_write(dir, 0);
fc9581c8	473	f2fs_i_size_write(dir, MAX_INLINE_DATA);
ee6d182f	474	set_page_dirty(ipage);
675f10bd CY	475	f2fs_put_page(ipage, 1);
	476
	477	kfree(backup_dentry);
	478	return err;
	479	}
	480
	481	static int f2fs_convert_inline_dir(struct inode dir, struct page ipage,
	482	struct f2fs_inline_dentry *inline_dentry)
	483	{
	484	if (!F2FS_I(dir)->i_dir_level)
	485	return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
	486	else
	487	return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
	488	}
	489
201a05be	490	int f2fs_add_inline_entry(struct inode dir, const struct qstr name,
510022a8	491	struct inode *inode, nid_t ino, umode_t mode)
201a05be CY	492	{
	493	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	494	struct page *ipage;
	495	unsigned int bit_pos;
	496	f2fs_hash_t name_hash;
201a05be CY	497	size_t namelen = name->len;
201a05be CY	498	struct f2fs_inline_dentry *dentry_blk = NULL;
3b4d732a	499	struct f2fs_dentry_ptr d;
201a05be	500	int slots = GET_DENTRY_SLOTS(namelen);
510022a8	501	struct page *page = NULL;
201a05be	502	int err = 0;
201a05be CY	503
	504	ipage = get_node_page(sbi, dir->i_ino);
	505	if (IS_ERR(ipage))
	506	return PTR_ERR(ipage);
	507
	508	dentry_blk = inline_data_addr(ipage);
a82afa20 JK	509	bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
a82afa20 JK	510	slots, NR_INLINE_DENTRY);
201a05be CY	511	if (bit_pos >= NR_INLINE_DENTRY) {
201a05be CY	512	err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
470f00e9 CY	513	if (err)
	514	return err;
	515	err = -EAGAIN;
201a05be CY	516	goto out;
	517	}
	518
510022a8 JK	519	if (inode) {
	520	down_write(&F2FS_I(inode)->i_sem);
	521	page = init_inode_metadata(inode, dir, name, ipage);
	522	if (IS_ERR(page)) {
	523	err = PTR_ERR(page);
	524	goto fail;
	525	}
201a05be	526	}
bce8d112	527
fec1d657	528	f2fs_wait_on_page_writeback(ipage, NODE, true);
3b4d732a CY	529
3b4d732a CY	530	name_hash = f2fs_dentry_hash(name);
d8c6822a	531	make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
510022a8	532	f2fs_update_dentry(ino, mode, &d, name, name_hash, bit_pos);
3b4d732a	533
201a05be CY	534	set_page_dirty(ipage);
	535
	536	/* we don't need to mark_inode_dirty now */
510022a8	537	if (inode) {
205b9822	538	f2fs_i_pino_write(inode, dir->i_ino);
510022a8 JK	539	f2fs_put_page(page, 1);
510022a8 JK	540	}
201a05be CY	541
	542	update_parent_metadata(dir, inode, 0);
	543	fail:
510022a8 JK	544	if (inode)
510022a8 JK	545	up_write(&F2FS_I(inode)->i_sem);
201a05be CY	546	out:
	547	f2fs_put_page(ipage, 1);
	548	return err;
	549	}
	550
	551	void f2fs_delete_inline_entry(struct f2fs_dir_entry dentry, struct page page,
	552	struct inode dir, struct inode inode)
	553	{
	554	struct f2fs_inline_dentry *inline_dentry;
	555	int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
	556	unsigned int bit_pos;
	557	int i;
	558
	559	lock_page(page);
fec1d657	560	f2fs_wait_on_page_writeback(page, NODE, true);
201a05be CY	561
	562	inline_dentry = inline_data_addr(page);
	563	bit_pos = dentry - inline_dentry->dentry;
	564	for (i = 0; i < slots; i++)
	565	test_and_clear_bit_le(bit_pos + i,
	566	&inline_dentry->dentry_bitmap);
	567
	568	set_page_dirty(page);
9f7c45cc	569	f2fs_put_page(page, 1);
201a05be CY	570
201a05be CY	571	dir->i_ctime = dir->i_mtime = CURRENT_TIME;
205b9822	572	mark_inode_dirty_sync(dir);
201a05be CY	573
201a05be CY	574	if (inode)
9f7c45cc	575	f2fs_drop_nlink(dir, inode);
201a05be CY	576	}
	577
	578	bool f2fs_empty_inline_dir(struct inode *dir)
	579	{
	580	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	581	struct page *ipage;
	582	unsigned int bit_pos = 2;
	583	struct f2fs_inline_dentry *dentry_blk;
	584
	585	ipage = get_node_page(sbi, dir->i_ino);
	586	if (IS_ERR(ipage))
	587	return false;
	588
	589	dentry_blk = inline_data_addr(ipage);
	590	bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
	591	NR_INLINE_DENTRY,
	592	bit_pos);
	593
	594	f2fs_put_page(ipage, 1);
	595
	596	if (bit_pos < NR_INLINE_DENTRY)
	597	return false;
	598
	599	return true;
	600	}
	601
d8c6822a	602	int f2fs_read_inline_dir(struct file file, struct dir_context ctx,
0b81d077	603	struct fscrypt_str *fstr)
201a05be CY	604	{
201a05be CY	605	struct inode *inode = file_inode(file);
201a05be	606	struct f2fs_inline_dentry *inline_dentry = NULL;
201a05be	607	struct page *ipage = NULL;
7b3cd7d6	608	struct f2fs_dentry_ptr d;
201a05be CY	609
	610	if (ctx->pos == NR_INLINE_DENTRY)
	611	return 0;
	612
38594de7	613	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
201a05be CY	614	if (IS_ERR(ipage))
	615	return PTR_ERR(ipage);
	616
201a05be	617	inline_dentry = inline_data_addr(ipage);
201a05be	618
d8c6822a	619	make_dentry_ptr(inode, &d, (void *)inline_dentry, 2);
7b3cd7d6	620
d8c6822a	621	if (!f2fs_fill_dentries(ctx, &d, 0, fstr))
38594de7	622	ctx->pos = NR_INLINE_DENTRY;
201a05be	623
38594de7	624	f2fs_put_page(ipage, 1);
201a05be CY	625	return 0;
201a05be CY	626	}
67f8cf3c JK	627
	628	int f2fs_inline_data_fiemap(struct inode *inode,
	629	struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
	630	{
	631	__u64 byteaddr, ilen;
	632	__u32 flags = FIEMAP_EXTENT_DATA_INLINE \| FIEMAP_EXTENT_NOT_ALIGNED \|
	633	FIEMAP_EXTENT_LAST;
	634	struct node_info ni;
	635	struct page *ipage;
	636	int err = 0;
	637
	638	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
	639	if (IS_ERR(ipage))
	640	return PTR_ERR(ipage);
	641
	642	if (!f2fs_has_inline_data(inode)) {
	643	err = -EAGAIN;
	644	goto out;
	645	}
	646
	647	ilen = min_t(size_t, MAX_INLINE_DATA, i_size_read(inode));
	648	if (start >= ilen)
	649	goto out;
	650	if (start + len < ilen)
	651	ilen = start + len;
	652	ilen -= start;
	653
	654	get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
	655	byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
	656	byteaddr += (char )inline_data_addr(ipage) - (char )F2FS_INODE(ipage);
	657	err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
	658	out:
	659	f2fs_put_page(ipage, 1);
	660	return err;
	661	}