[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,
		.op = REQ_OP_WRITE,
		.op_flags = 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, 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 *new_name,
				const struct qstr *orig_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;
	struct f2fs_inline_dentry *dentry_blk = NULL;
	struct f2fs_dentry_ptr d;
	int slots = GET_DENTRY_SLOTS(new_name->len);
	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, new_name,
						orig_name, ipage);
		if (IS_ERR(page)) {
			err = PTR_ERR(page);
			goto fail;
		}
		if (f2fs_encrypted_inode(dir))
			file_set_enc_name(inode);
	}

	f2fs_wait_on_page_writeback(ipage, NODE, true);

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