[mirror_ubuntu-artful-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);
	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 = REQ_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);
		remove_dirty_inode(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 = le16_to_cpu(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(F2FS_I_SB(dir),
			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(dir);
	f2fs_mark_inode_dirty_sync(dir, false);

	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;
	int err;

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

	err = f2fs_fill_dentries(ctx, &d, 0, fstr);
	if (!err)
		ctx->pos = NR_INLINE_DENTRY;

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