[mirror_ubuntu-eoan-kernel.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);
	SetPageUptodate(page);
}

bool truncate_inline_inode(struct page *ipage, u64 from)
{
	void *addr;

	if (from >= MAX_INLINE_DATA)
		return false;

	addr = inline_data_addr(ipage);

	f2fs_wait_on_page_writeback(ipage, NODE, true);
	memset(addr + from, 0, MAX_INLINE_DATA - from);

	return true;
}

int f2fs_read_inline_data(struct inode *inode, struct page *page)
{
	struct page *ipage;

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

	if (!f2fs_has_inline_data(inode)) {
		f2fs_put_page(ipage, 1);
		return -EAGAIN;
	}

	if (page->index)
		zero_user_segment(page, 0, PAGE_SIZE);
	else
		read_inline_data(page, ipage);

	SetPageUptodate(page);
	f2fs_put_page(ipage, 1);
	unlock_page(page);
	return 0;
}

int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
{
	struct f2fs_io_info fio = {
		.sbi = F2FS_I_SB(dn->inode),
		.type = DATA,
		.rw = WRITE_SYNC | REQ_PRIO,
		.page = page,
		.encrypted_page = NULL,
	};
	int dirty, err;

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

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

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

	read_inline_data(page, dn->inode_page);
	set_page_dirty(page);

	/* clear dirty state */
	dirty = clear_page_dirty_for_io(page);

	/* write data page to try to make data consistent */
	set_page_writeback(page);
	fio.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(F2FS_I(dn->inode), FI_APPEND_WRITE);

	/* clear inline data and flag after data writeback */
	truncate_inline_inode(dn->inode_page, 0);
	clear_inline_node(dn->inode_page);
clear_out:
	stat_dec_inline_inode(dn->inode);
	f2fs_clear_inline_inode(dn->inode);
	sync_inode_page(dn);
	f2fs_put_dnode(dn);
	return 0;
}

int f2fs_convert_inline_inode(struct inode *inode)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	struct dnode_of_data dn;
	struct page *ipage, *page;
	int err = 0;

	if (!f2fs_has_inline_data(inode))
		return 0;

	page = grab_cache_page(inode->i_mapping, 0);
	if (!page)
		return -ENOMEM;

	f2fs_lock_op(sbi);

	ipage = get_node_page(sbi, inode->i_ino);
	if (IS_ERR(ipage)) {
		err = PTR_ERR(ipage);
		goto out;
	}

	set_new_dnode(&dn, inode, ipage, ipage, 0);

	if (f2fs_has_inline_data(inode))
		err = f2fs_convert_inline_page(&dn, page);

	f2fs_put_dnode(&dn);
out:
	f2fs_unlock_op(sbi);

	f2fs_put_page(page, 1);

	f2fs_balance_fs(sbi, dn.node_changed);

	return err;
}

int f2fs_write_inline_data(struct inode *inode, struct page *page)
{
	void *src_addr, *dst_addr;
	struct dnode_of_data dn;
	int err;

	set_new_dnode(&dn, inode, NULL, NULL, 0);
	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	if (err)
		return err;

	if (!f2fs_has_inline_data(inode)) {
		f2fs_put_dnode(&dn);
		return -EAGAIN;
	}

	f2fs_bug_on(F2FS_I_SB(inode), page->index);

	f2fs_wait_on_page_writeback(dn.inode_page, NODE, true);
	src_addr = kmap_atomic(page);
	dst_addr = inline_data_addr(dn.inode_page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	kunmap_atomic(src_addr);

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

	sync_inode_page(&dn);
	clear_inline_node(dn.inode_page);
	f2fs_put_dnode(&dn);
	return 0;
}

bool recover_inline_data(struct inode *inode, struct page *npage)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	struct f2fs_inode *ri = NULL;
	void *src_addr, *dst_addr;
	struct page *ipage;

	/*
	 * The inline_data recovery policy is as follows.
	 * [prev.] [next] of inline_data flag
	 *    o       o  -> recover inline_data
	 *    o       x  -> remove inline_data, and then recover data blocks
	 *    x       o  -> remove inline_data, and then recover inline_data
	 *    x       x  -> recover data blocks
	 */
	if (IS_INODE(npage))
		ri = F2FS_INODE(npage);

	if (f2fs_has_inline_data(inode) &&
			ri && (ri->i_inline & F2FS_INLINE_DATA)) {
process_inline:
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(sbi, IS_ERR(ipage));

		f2fs_wait_on_page_writeback(ipage, NODE, true);

		src_addr = inline_data_addr(npage);
		dst_addr = inline_data_addr(ipage);
		memcpy(dst_addr, src_addr, MAX_INLINE_DATA);

		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);

		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
		return true;
	}

	if (f2fs_has_inline_data(inode)) {
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(sbi, IS_ERR(ipage));
		if (!truncate_inline_inode(ipage, 0))
			return false;
		f2fs_clear_inline_inode(inode);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
		if (truncate_blocks(inode, 0, false))
			return false;
		goto process_inline;
	}
	return false;
}

struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
			struct 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))
		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;
}

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_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 = grab_cache_page(dir->i_mapping, 0);
	if (!page) {
		f2fs_put_page(ipage, 1);
		return -ENOMEM;
	}

	set_new_dnode(&dn, dir, ipage, NULL, 0);
	err = f2fs_reserve_block(&dn, 0);
	if (err)
		goto out;

	f2fs_wait_on_page_writeback(page, DATA, true);
	zero_user_segment(page, MAX_INLINE_DATA, PAGE_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_SIZE) {
		i_size_write(dir, PAGE_SIZE);
		set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	}

	sync_inode_page(&dn);
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 = kmalloc(sizeof(struct f2fs_inline_dentry),
							GFP_F2FS_ZERO);
	if (!backup_dentry)
		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(F2FS_I(dir), FI_INLINE_DENTRY);
	update_inode(dir, ipage);
	kfree(backup_dentry);
	return 0;
recover:
	lock_page(ipage);
	memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA);
	i_size_write(dir, MAX_INLINE_DATA);
	update_inode(dir, 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(inode)->i_pino = dir->i_ino;
		update_inode(inode, page);
		f2fs_put_page(page, 1);
	}

	update_parent_metadata(dir, inode, 0);
fail:
	if (inode)
		up_write(&F2FS_I(inode)->i_sem);

	if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
		update_inode(dir, ipage);
		clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	}
out:
	f2fs_put_page(ipage, 1);
	return err;
}

void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
					struct inode *dir, struct inode *inode)
{
	struct f2fs_inline_dentry *inline_dentry;
	int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
	unsigned int bit_pos;
	int i;

	lock_page(page);
	f2fs_wait_on_page_writeback(page, NODE, true);

	inline_dentry = inline_data_addr(page);
	bit_pos = dentry - inline_dentry->dentry;
	for (i = 0; i < slots; i++)
		test_and_clear_bit_le(bit_pos + i,
				&inline_dentry->dentry_bitmap);

	set_page_dirty(page);

	dir->i_ctime = dir->i_mtime = CURRENT_TIME;

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

	f2fs_put_page(page, 1);
}

bool f2fs_empty_inline_dir(struct inode *dir)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	unsigned int bit_pos = 2;
	struct f2fs_inline_dentry *dentry_blk;

	ipage = get_node_page(sbi, dir->i_ino);
	if (IS_ERR(ipage))
		return false;

	dentry_blk = inline_data_addr(ipage);
	bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
					NR_INLINE_DENTRY,
					bit_pos);

	f2fs_put_page(ipage, 1);

	if (bit_pos < NR_INLINE_DENTRY)
		return false;

	return true;
}

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