[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 (!test_opt(F2FS_I_SB(inode), INLINE_DATA))
		return false;

	if (f2fs_is_atomic_file(inode))
		return false;

	if (!S_ISREG(inode->i_mode) && !S_ISLNK(inode->i_mode))
		return false;

	if (i_size_read(inode) > MAX_INLINE_DATA)
		return false;

	if (f2fs_encrypted_inode(inode) && S_ISREG(inode->i_mode))
		return false;

	return true;
}

bool f2fs_may_inline_dentry(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), INLINE_DENTRY))
		return false;

	if (!S_ISDIR(inode->i_mode))
		return false;

	return true;
}

void read_inline_data(struct page *page, struct page *ipage)
{
	void *src_addr, *dst_addr;

	if (PageUptodate(page))
		return;

	f2fs_bug_on(F2FS_P_SB(page), page->index);

	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(ipage);
	dst_addr = kmap_atomic(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	flush_dcache_page(page);
	kunmap_atomic(dst_addr);
	SetPageUptodate(page);
}

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

	if (from >= MAX_INLINE_DATA)
		return false;

	addr = inline_data_addr(ipage);

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

	return true;
}

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

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

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

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

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

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

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

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

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

	f2fs_wait_on_page_writeback(page, DATA);

	if (PageUptodate(page))
		goto no_update;

	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(dn->inode_page);
	dst_addr = kmap_atomic(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	flush_dcache_page(page);
	kunmap_atomic(dst_addr);
	SetPageUptodate(page);
no_update:
	set_page_dirty(page);

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

	/* write data page to try to make data consistent */
	set_page_writeback(page);
	fio.blk_addr = dn->data_blkaddr;
	write_data_page(dn, &fio);
	set_data_blkaddr(dn);
	f2fs_update_extent_cache(dn);
	f2fs_wait_on_page_writeback(page, DATA);
	if (dirty)
		inode_dec_dirty_pages(dn->inode);

	/* this converted inline_data should be recovered. */
	set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);

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

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

	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);
	return err;
}

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

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

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

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

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

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

	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);
	return 0;
}

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

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

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

		f2fs_wait_on_page_writeback(ipage, NODE);

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

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

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

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

struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
			struct f2fs_filename *fname, struct page **res_page)
{
	struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
	struct f2fs_inline_dentry *inline_dentry;
	struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
	struct f2fs_dir_entry *de;
	struct f2fs_dentry_ptr d;
	struct page *ipage;
	f2fs_hash_t namehash;

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

	namehash = f2fs_dentry_hash(&name);

	inline_dentry = inline_data_addr(ipage);

	make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
	de = find_target_dentry(fname, namehash, NULL, &d);
	unlock_page(ipage);
	if (de)
		*res_page = ipage;
	else
		f2fs_put_page(ipage, 0);

	/*
	 * For the most part, it should be a bug when name_len is zero.
	 * We stop here for figuring out where the bugs has occurred.
	 */
	f2fs_bug_on(sbi, d.max < 0);
	return de;
}

struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *dir,
							struct page **p)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	struct f2fs_dir_entry *de;
	struct f2fs_inline_dentry *dentry_blk;

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

	dentry_blk = inline_data_addr(ipage);
	de = &dentry_blk->dentry[1];
	*p = ipage;
	unlock_page(ipage);
	return de;
}

int make_empty_inline_dir(struct inode *inode, struct inode *parent,
							struct page *ipage)
{
	struct f2fs_inline_dentry *dentry_blk;
	struct f2fs_dentry_ptr d;

	dentry_blk = inline_data_addr(ipage);

	make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
	do_make_empty_dir(inode, parent, &d);

	set_page_dirty(ipage);

	/* update i_size to MAX_INLINE_DATA */
	if (i_size_read(inode) < MAX_INLINE_DATA) {
		i_size_write(inode, MAX_INLINE_DATA);
		set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
	}
	return 0;
}

/*
 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
 * release ipage in this function.
 */
static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
				struct f2fs_inline_dentry *inline_dentry)
{
	struct page *page;
	struct dnode_of_data dn;
	struct f2fs_dentry_block *dentry_blk;
	int err;

	page = grab_cache_page(dir->i_mapping, 0);
	if (!page) {
		f2fs_put_page(ipage, 1);
		return -ENOMEM;
	}

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

	f2fs_wait_on_page_writeback(page, DATA);
	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	dentry_blk = kmap_atomic(page);

	/* copy data from inline dentry block to new dentry block */
	memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
					INLINE_DENTRY_BITMAP_SIZE);
	memset(dentry_blk->dentry_bitmap + INLINE_DENTRY_BITMAP_SIZE, 0,
			SIZE_OF_DENTRY_BITMAP - INLINE_DENTRY_BITMAP_SIZE);
	/*
	 * we do not need to zero out remainder part of dentry and filename
	 * field, since we have used bitmap for marking the usage status of
	 * them, besides, we can also ignore copying/zeroing reserved space
	 * of dentry block, because them haven't been used so far.
	 */
	memcpy(dentry_blk->dentry, inline_dentry->dentry,
			sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
	memcpy(dentry_blk->filename, inline_dentry->filename,
					NR_INLINE_DENTRY * F2FS_SLOT_LEN);

	kunmap_atomic(dentry_blk);
	SetPageUptodate(page);
	set_page_dirty(page);

	/* clear inline dir and flag after data writeback */
	truncate_inline_inode(ipage, 0);

	stat_dec_inline_dir(dir);
	clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);

	if (i_size_read(dir) < PAGE_CACHE_SIZE) {
		i_size_write(dir, PAGE_CACHE_SIZE);
		set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	}

	sync_inode_page(&dn);
out:
	f2fs_put_page(page, 1);
	return err;
}

int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
			struct inode *inode, nid_t ino, umode_t mode)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	unsigned int bit_pos;
	f2fs_hash_t name_hash;
	size_t namelen = name->len;
	struct f2fs_inline_dentry *dentry_blk = NULL;
	struct f2fs_dentry_ptr d;
	int slots = GET_DENTRY_SLOTS(namelen);
	struct page *page = NULL;
	int err = 0;

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

	dentry_blk = inline_data_addr(ipage);
	bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
						slots, NR_INLINE_DENTRY);
	if (bit_pos >= NR_INLINE_DENTRY) {
		err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
		if (err)
			return err;
		err = -EAGAIN;
		goto out;
	}

	if (inode) {
		down_write(&F2FS_I(inode)->i_sem);
		page = init_inode_metadata(inode, dir, name, ipage);
		if (IS_ERR(page)) {
			err = PTR_ERR(page);
			goto fail;
		}
	}

	f2fs_wait_on_page_writeback(ipage, NODE);

	name_hash = f2fs_dentry_hash(name);
	make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
	f2fs_update_dentry(ino, mode, &d, name, name_hash, bit_pos);

	set_page_dirty(ipage);

	/* we don't need to mark_inode_dirty now */
	if (inode) {
		F2FS_I(inode)->i_pino = dir->i_ino;
		update_inode(inode, page);
		f2fs_put_page(page, 1);
	}

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

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

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

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

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

	set_page_dirty(page);

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

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

	f2fs_put_page(page, 1);
}

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

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

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

	f2fs_put_page(ipage, 1);

	if (bit_pos < NR_INLINE_DENTRY)
		return false;

	return true;
}

int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
				struct f2fs_str *fstr)
{
	struct inode *inode = file_inode(file);
	struct f2fs_inline_dentry *inline_dentry = NULL;
	struct page *ipage = NULL;
	struct f2fs_dentry_ptr d;

	if (ctx->pos == NR_INLINE_DENTRY)
		return 0;

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

	inline_dentry = inline_data_addr(ipage);

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

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

	f2fs_put_page(ipage, 1);
	return 0;
}

int f2fs_inline_data_fiemap(struct inode *inode,
		struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
{
	__u64 byteaddr, ilen;
	__u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
		FIEMAP_EXTENT_LAST;
	struct node_info ni;
	struct page *ipage;
	int err = 0;

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

	if (!f2fs_has_inline_data(inode)) {
		err = -EAGAIN;
		goto out;
	}

	ilen = min_t(size_t, MAX_INLINE_DATA, i_size_read(inode));
	if (start >= ilen)
		goto out;
	if (start + len < ilen)
		ilen = start + len;
	ilen -= start;

	get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
	byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
	byteaddr += (char *)inline_data_addr(ipage) - (char *)F2FS_INODE(ipage);
	err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
out:
	f2fs_put_page(ipage, 1);
	return err;
}
Commit	Line	Data
e18c65b2 HL	1	/*
	2	* fs/f2fs/inline.c
	3	* Copyright (c) 2013, Intel Corporation
	4	* Authors: Huajun Li <huajun.li@intel.com>
	5	* Haicheng Li <haicheng.li@intel.com>
	6	* This program is free software; you can redistribute it and/or modify
	7	* it under the terms of the GNU General Public License version 2 as
	8	* published by the Free Software Foundation.
	9	*/
	10
	11	#include <linux/fs.h>
	12	#include <linux/f2fs_fs.h>
	13
	14	#include "f2fs.h"
67f8cf3c	15	#include "node.h"
e18c65b2	16
01b960e9	17	bool f2fs_may_inline_data(struct inode *inode)
e18c65b2	18	{
4081363f	19	if (!test_opt(F2FS_I_SB(inode), INLINE_DATA))
e18c65b2 HL	20	return false;
e18c65b2 HL	21
88b88a66 JK	22	if (f2fs_is_atomic_file(inode))
	23	return false;
	24
368a0e40	25	if (!S_ISREG(inode->i_mode) && !S_ISLNK(inode->i_mode))
e18c65b2 HL	26	return false;
e18c65b2 HL	27
92dffd01 JK	28	if (i_size_read(inode) > MAX_INLINE_DATA)
	29	return false;
	30
fcc85a4d JK	31	if (f2fs_encrypted_inode(inode) && S_ISREG(inode->i_mode))
	32	return false;
	33
e18c65b2 HL	34	return true;
	35	}
	36
01b960e9 JK	37	bool f2fs_may_inline_dentry(struct inode *inode)
	38	{
	39	if (!test_opt(F2FS_I_SB(inode), INLINE_DENTRY))
	40	return false;
	41
	42	if (!S_ISDIR(inode->i_mode))
	43	return false;
	44
	45	return true;
	46	}
	47
b3d208f9	48	void read_inline_data(struct page page, struct page ipage)
e18c65b2	49	{
e18c65b2 HL	50	void src_addr, dst_addr;
e18c65b2 HL	51
b3d208f9 JK	52	if (PageUptodate(page))
b3d208f9 JK	53	return;
04a17fb1	54
b3d208f9	55	f2fs_bug_on(F2FS_P_SB(page), page->index);
e18c65b2	56
18309aaa	57	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
e18c65b2 HL	58
	59	/* Copy the whole inline data block */
	60	src_addr = inline_data_addr(ipage);
f1e33a04	61	dst_addr = kmap_atomic(page);
e18c65b2	62	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
427a45c8	63	flush_dcache_page(page);
f1e33a04	64	kunmap_atomic(dst_addr);
e18c65b2	65	SetPageUptodate(page);
b3d208f9 JK	66	}
b3d208f9 JK	67
0bfcfcca	68	bool truncate_inline_inode(struct page *ipage, u64 from)
feeb0deb	69	{
0bfcfcca CY	70	void *addr;
0bfcfcca CY	71
0bfcfcca CY	72	if (from >= MAX_INLINE_DATA)
	73	return false;
	74
	75	addr = inline_data_addr(ipage);
	76
feeb0deb	77	f2fs_wait_on_page_writeback(ipage, NODE);
0bfcfcca CY	78	memset(addr + from, 0, MAX_INLINE_DATA - from);
	79
	80	return true;
feeb0deb CY	81	}
feeb0deb CY	82
b3d208f9 JK	83	int f2fs_read_inline_data(struct inode inode, struct page page)
	84	{
	85	struct page *ipage;
	86
	87	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
	88	if (IS_ERR(ipage)) {
	89	unlock_page(page);
	90	return PTR_ERR(ipage);
	91	}
e18c65b2	92
b3d208f9 JK	93	if (!f2fs_has_inline_data(inode)) {
	94	f2fs_put_page(ipage, 1);
	95	return -EAGAIN;
	96	}
	97
	98	if (page->index)
	99	zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	100	else
	101	read_inline_data(page, ipage);
	102
	103	SetPageUptodate(page);
	104	f2fs_put_page(ipage, 1);
	105	unlock_page(page);
e18c65b2 HL	106	return 0;
	107	}
	108
b3d208f9	109	int f2fs_convert_inline_page(struct dnode_of_data dn, struct page page)
e18c65b2	110	{
e18c65b2	111	void src_addr, dst_addr;
e18c65b2	112	struct f2fs_io_info fio = {
05ca3632	113	.sbi = F2FS_I_SB(dn->inode),
e18c65b2 HL	114	.type = DATA,
e18c65b2 HL	115	.rw = WRITE_SYNC \| REQ_PRIO,
05ca3632	116	.page = page,
4375a336	117	.encrypted_page = NULL,
e18c65b2	118	};
158c194c	119	int dirty, err;
e18c65b2	120
b3d208f9	121	f2fs_bug_on(F2FS_I_SB(dn->inode), page->index);
e18c65b2	122
b3d208f9 JK	123	if (!f2fs_exist_data(dn->inode))
b3d208f9 JK	124	goto clear_out;
ec4e7af4	125
b3d208f9	126	err = f2fs_reserve_block(dn, 0);
15c6e3aa	127	if (err)
b3d208f9	128	return err;
e18c65b2	129
9ac1349a	130	f2fs_wait_on_page_writeback(page, DATA);
b3d208f9 JK	131
	132	if (PageUptodate(page))
	133	goto no_update;
	134
18309aaa	135	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
e18c65b2 HL	136
e18c65b2 HL	137	/* Copy the whole inline data block */
b3d208f9	138	src_addr = inline_data_addr(dn->inode_page);
f1e33a04	139	dst_addr = kmap_atomic(page);
e18c65b2	140	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
09b8b3c8	141	flush_dcache_page(page);
f1e33a04	142	kunmap_atomic(dst_addr);
9e09fc85	143	SetPageUptodate(page);
b3d208f9	144	no_update:
6282adbf JK	145	set_page_dirty(page);
6282adbf JK	146
158c194c JK	147	/* clear dirty state */
	148	dirty = clear_page_dirty_for_io(page);
	149
e18c65b2 HL	150	/* write data page to try to make data consistent */
e18c65b2 HL	151	set_page_writeback(page);
cf04e8eb	152	fio.blk_addr = dn->data_blkaddr;
05ca3632	153	write_data_page(dn, &fio);
216a620a	154	set_data_blkaddr(dn);
7e4dde79	155	f2fs_update_extent_cache(dn);
5514f0aa	156	f2fs_wait_on_page_writeback(page, DATA);
158c194c JK	157	if (dirty)
158c194c JK	158	inode_dec_dirty_pages(dn->inode);
e18c65b2	159
95f5b0fc JK	160	/* this converted inline_data should be recovered. */
	161	set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);
	162
e18c65b2	163	/* clear inline data and flag after data writeback */
0bfcfcca	164	truncate_inline_inode(dn->inode_page, 0);
b3d208f9	165	clear_out:
b3d208f9	166	stat_dec_inline_inode(dn->inode);
57e2a2c0	167	f2fs_clear_inline_inode(dn->inode);
b3d208f9 JK	168	sync_inode_page(dn);
	169	f2fs_put_dnode(dn);
	170	return 0;
e18c65b2 HL	171	}
e18c65b2 HL	172
b3d208f9	173	int f2fs_convert_inline_inode(struct inode *inode)
e18c65b2	174	{
b3d208f9 JK	175	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	176	struct dnode_of_data dn;
	177	struct page ipage, page;
	178	int err = 0;
e18c65b2	179
b3d208f9 JK	180	page = grab_cache_page(inode->i_mapping, 0);
	181	if (!page)
	182	return -ENOMEM;
e18c65b2	183
b3d208f9 JK	184	f2fs_lock_op(sbi);
	185
	186	ipage = get_node_page(sbi, inode->i_ino);
	187	if (IS_ERR(ipage)) {
6d20aff8 JK	188	err = PTR_ERR(ipage);
6d20aff8 JK	189	goto out;
b067ba1f	190	}
e18c65b2	191
b3d208f9 JK	192	set_new_dnode(&dn, inode, ipage, ipage, 0);
	193
	194	if (f2fs_has_inline_data(inode))
	195	err = f2fs_convert_inline_page(&dn, page);
	196
	197	f2fs_put_dnode(&dn);
6d20aff8	198	out:
b3d208f9 JK	199	f2fs_unlock_op(sbi);
	200
	201	f2fs_put_page(page, 1);
e18c65b2 HL	202	return err;
	203	}
	204
b3d208f9	205	int f2fs_write_inline_data(struct inode inode, struct page page)
e18c65b2 HL	206	{
e18c65b2 HL	207	void src_addr, dst_addr;
e18c65b2 HL	208	struct dnode_of_data dn;
	209	int err;
	210
	211	set_new_dnode(&dn, inode, NULL, NULL, 0);
	212	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	213	if (err)
	214	return err;
e18c65b2	215
c08a690b	216	if (!f2fs_has_inline_data(inode)) {
b3d208f9 JK	217	f2fs_put_dnode(&dn);
b3d208f9 JK	218	return -EAGAIN;
c08a690b JK	219	}
c08a690b JK	220
b3d208f9 JK	221	f2fs_bug_on(F2FS_I_SB(inode), page->index);
	222
	223	f2fs_wait_on_page_writeback(dn.inode_page, NODE);
f1e33a04	224	src_addr = kmap_atomic(page);
b3d208f9 JK	225	dst_addr = inline_data_addr(dn.inode_page);
b3d208f9 JK	226	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
f1e33a04	227	kunmap_atomic(src_addr);
e18c65b2	228
fff04f90	229	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
b3d208f9 JK	230	set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
b3d208f9 JK	231
e18c65b2 HL	232	sync_inode_page(&dn);
e18c65b2 HL	233	f2fs_put_dnode(&dn);
e18c65b2 HL	234	return 0;
e18c65b2 HL	235	}
1e1bb4ba	236
0342fd30	237	bool recover_inline_data(struct inode inode, struct page npage)
1e1bb4ba	238	{
4081363f	239	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
1e1bb4ba JK	240	struct f2fs_inode *ri = NULL;
	241	void src_addr, dst_addr;
	242	struct page *ipage;
	243
	244	/*
	245	* The inline_data recovery policy is as follows.
	246	* [prev.] [next] of inline_data flag
	247	* o o -> recover inline_data
	248	* o x -> remove inline_data, and then recover data blocks
	249	* x o -> remove inline_data, and then recover inline_data
	250	* x x -> recover data blocks
	251	*/
	252	if (IS_INODE(npage))
	253	ri = F2FS_INODE(npage);
	254
	255	if (f2fs_has_inline_data(inode) &&
0342fd30	256	ri && (ri->i_inline & F2FS_INLINE_DATA)) {
1e1bb4ba JK	257	process_inline:
1e1bb4ba JK	258	ipage = get_node_page(sbi, inode->i_ino);
9850cf4a	259	f2fs_bug_on(sbi, IS_ERR(ipage));
1e1bb4ba	260
54b591df JK	261	f2fs_wait_on_page_writeback(ipage, NODE);
54b591df JK	262
1e1bb4ba JK	263	src_addr = inline_data_addr(npage);
	264	dst_addr = inline_data_addr(ipage);
	265	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
b3d208f9 JK	266
	267	set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	268	set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
	269
1e1bb4ba JK	270	update_inode(inode, ipage);
1e1bb4ba JK	271	f2fs_put_page(ipage, 1);
0342fd30	272	return true;
1e1bb4ba JK	273	}
	274
	275	if (f2fs_has_inline_data(inode)) {
	276	ipage = get_node_page(sbi, inode->i_ino);
9850cf4a	277	f2fs_bug_on(sbi, IS_ERR(ipage));
545fe421 NK	278	if (!truncate_inline_inode(ipage, 0))
545fe421 NK	279	return false;
b3d208f9	280	f2fs_clear_inline_inode(inode);
1e1bb4ba JK	281	update_inode(inode, ipage);
1e1bb4ba JK	282	f2fs_put_page(ipage, 1);
0342fd30	283	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
545fe421 NK	284	if (truncate_blocks(inode, 0, false))
545fe421 NK	285	return false;
1e1bb4ba JK	286	goto process_inline;
1e1bb4ba JK	287	}
0342fd30	288	return false;
1e1bb4ba	289	}
201a05be CY	290
201a05be CY	291	struct f2fs_dir_entry find_in_inline_dir(struct inode dir,
6e22c691	292	struct f2fs_filename fname, struct page *res_page)
201a05be CY	293	{
201a05be CY	294	struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
4e6ebf6d	295	struct f2fs_inline_dentry *inline_dentry;
6e22c691	296	struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
201a05be	297	struct f2fs_dir_entry *de;
7b3cd7d6	298	struct f2fs_dentry_ptr d;
4e6ebf6d	299	struct page *ipage;
6e22c691	300	f2fs_hash_t namehash;
201a05be CY	301
	302	ipage = get_node_page(sbi, dir->i_ino);
	303	if (IS_ERR(ipage))
	304	return NULL;
	305
6e22c691 JK	306	namehash = f2fs_dentry_hash(&name);
6e22c691 JK	307
4e6ebf6d	308	inline_dentry = inline_data_addr(ipage);
201a05be	309
d8c6822a	310	make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
6e22c691	311	de = find_target_dentry(fname, namehash, NULL, &d);
201a05be	312	unlock_page(ipage);
4e6ebf6d JK	313	if (de)
	314	*res_page = ipage;
	315	else
	316	f2fs_put_page(ipage, 0);
	317
	318	/*
	319	* For the most part, it should be a bug when name_len is zero.
	320	* We stop here for figuring out where the bugs has occurred.
	321	*/
7b3cd7d6	322	f2fs_bug_on(sbi, d.max < 0);
201a05be CY	323	return de;
	324	}
	325
	326	struct f2fs_dir_entry f2fs_parent_inline_dir(struct inode dir,
	327	struct page **p)
	328	{
	329	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	330	struct page *ipage;
	331	struct f2fs_dir_entry *de;
	332	struct f2fs_inline_dentry *dentry_blk;
	333
	334	ipage = get_node_page(sbi, dir->i_ino);
	335	if (IS_ERR(ipage))
	336	return NULL;
	337
	338	dentry_blk = inline_data_addr(ipage);
	339	de = &dentry_blk->dentry[1];
	340	*p = ipage;
	341	unlock_page(ipage);
	342	return de;
	343	}
	344
	345	int make_empty_inline_dir(struct inode inode, struct inode parent,
	346	struct page *ipage)
	347	{
	348	struct f2fs_inline_dentry *dentry_blk;
062a3e7b	349	struct f2fs_dentry_ptr d;
201a05be CY	350
	351	dentry_blk = inline_data_addr(ipage);
	352
d8c6822a	353	make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
062a3e7b	354	do_make_empty_dir(inode, parent, &d);
201a05be CY	355
	356	set_page_dirty(ipage);
	357
	358	/* update i_size to MAX_INLINE_DATA */
	359	if (i_size_read(inode) < MAX_INLINE_DATA) {
	360	i_size_write(inode, MAX_INLINE_DATA);
	361	set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
	362	}
	363	return 0;
	364	}
	365
470f00e9 CY	366	/*
	367	* NOTE: ipage is grabbed by caller, but if any error occurs, we should
	368	* release ipage in this function.
	369	*/
d64948a4	370	static int f2fs_convert_inline_dir(struct inode dir, struct page ipage,
201a05be CY	371	struct f2fs_inline_dentry *inline_dentry)
	372	{
	373	struct page *page;
	374	struct dnode_of_data dn;
	375	struct f2fs_dentry_block *dentry_blk;
	376	int err;
	377
	378	page = grab_cache_page(dir->i_mapping, 0);
470f00e9 CY	379	if (!page) {
470f00e9 CY	380	f2fs_put_page(ipage, 1);
201a05be	381	return -ENOMEM;
470f00e9	382	}
201a05be CY	383
	384	set_new_dnode(&dn, dir, ipage, NULL, 0);
	385	err = f2fs_reserve_block(&dn, 0);
	386	if (err)
	387	goto out;
	388
	389	f2fs_wait_on_page_writeback(page, DATA);
4ec17d68	390	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
201a05be	391
f1e33a04	392	dentry_blk = kmap_atomic(page);
201a05be CY	393
	394	/* copy data from inline dentry block to new dentry block */
	395	memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
	396	INLINE_DENTRY_BITMAP_SIZE);
4ec17d68 CY	397	memset(dentry_blk->dentry_bitmap + INLINE_DENTRY_BITMAP_SIZE, 0,
	398	SIZE_OF_DENTRY_BITMAP - INLINE_DENTRY_BITMAP_SIZE);
	399	/*
	400	* we do not need to zero out remainder part of dentry and filename
	401	* field, since we have used bitmap for marking the usage status of
	402	* them, besides, we can also ignore copying/zeroing reserved space
	403	* of dentry block, because them haven't been used so far.
	404	*/
201a05be CY	405	memcpy(dentry_blk->dentry, inline_dentry->dentry,
	406	sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
	407	memcpy(dentry_blk->filename, inline_dentry->filename,
	408	NR_INLINE_DENTRY * F2FS_SLOT_LEN);
	409
f1e33a04	410	kunmap_atomic(dentry_blk);
201a05be CY	411	SetPageUptodate(page);
	412	set_page_dirty(page);
	413
	414	/* clear inline dir and flag after data writeback */
0bfcfcca	415	truncate_inline_inode(ipage, 0);
b3d208f9	416
3289c061	417	stat_dec_inline_dir(dir);
622f28ae	418	clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
201a05be CY	419
	420	if (i_size_read(dir) < PAGE_CACHE_SIZE) {
	421	i_size_write(dir, PAGE_CACHE_SIZE);
	422	set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	423	}
	424
	425	sync_inode_page(&dn);
	426	out:
	427	f2fs_put_page(page, 1);
	428	return err;
	429	}
	430
	431	int f2fs_add_inline_entry(struct inode dir, const struct qstr name,
510022a8	432	struct inode *inode, nid_t ino, umode_t mode)
201a05be CY	433	{
	434	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	435	struct page *ipage;
	436	unsigned int bit_pos;
	437	f2fs_hash_t name_hash;
201a05be CY	438	size_t namelen = name->len;
201a05be CY	439	struct f2fs_inline_dentry *dentry_blk = NULL;
3b4d732a	440	struct f2fs_dentry_ptr d;
201a05be	441	int slots = GET_DENTRY_SLOTS(namelen);
510022a8	442	struct page *page = NULL;
201a05be	443	int err = 0;
201a05be CY	444
	445	ipage = get_node_page(sbi, dir->i_ino);
	446	if (IS_ERR(ipage))
	447	return PTR_ERR(ipage);
	448
	449	dentry_blk = inline_data_addr(ipage);
a82afa20 JK	450	bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
a82afa20 JK	451	slots, NR_INLINE_DENTRY);
201a05be CY	452	if (bit_pos >= NR_INLINE_DENTRY) {
201a05be CY	453	err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
470f00e9 CY	454	if (err)
	455	return err;
	456	err = -EAGAIN;
201a05be CY	457	goto out;
	458	}
	459
510022a8 JK	460	if (inode) {
	461	down_write(&F2FS_I(inode)->i_sem);
	462	page = init_inode_metadata(inode, dir, name, ipage);
	463	if (IS_ERR(page)) {
	464	err = PTR_ERR(page);
	465	goto fail;
	466	}
201a05be	467	}
bce8d112 JK	468
bce8d112 JK	469	f2fs_wait_on_page_writeback(ipage, NODE);
3b4d732a CY	470
3b4d732a CY	471	name_hash = f2fs_dentry_hash(name);
d8c6822a	472	make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
510022a8	473	f2fs_update_dentry(ino, mode, &d, name, name_hash, bit_pos);
3b4d732a	474
201a05be CY	475	set_page_dirty(ipage);
	476
	477	/* we don't need to mark_inode_dirty now */
510022a8 JK	478	if (inode) {
	479	F2FS_I(inode)->i_pino = dir->i_ino;
	480	update_inode(inode, page);
	481	f2fs_put_page(page, 1);
	482	}
201a05be CY	483
	484	update_parent_metadata(dir, inode, 0);
	485	fail:
510022a8 JK	486	if (inode)
510022a8 JK	487	up_write(&F2FS_I(inode)->i_sem);
201a05be CY	488
	489	if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
	490	update_inode(dir, ipage);
	491	clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
	492	}
	493	out:
	494	f2fs_put_page(ipage, 1);
	495	return err;
	496	}
	497
	498	void f2fs_delete_inline_entry(struct f2fs_dir_entry dentry, struct page page,
	499	struct inode dir, struct inode inode)
	500	{
	501	struct f2fs_inline_dentry *inline_dentry;
	502	int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
	503	unsigned int bit_pos;
	504	int i;
	505
	506	lock_page(page);
59a06155	507	f2fs_wait_on_page_writeback(page, NODE);
201a05be CY	508
	509	inline_dentry = inline_data_addr(page);
	510	bit_pos = dentry - inline_dentry->dentry;
	511	for (i = 0; i < slots; i++)
	512	test_and_clear_bit_le(bit_pos + i,
	513	&inline_dentry->dentry_bitmap);
	514
	515	set_page_dirty(page);
	516
	517	dir->i_ctime = dir->i_mtime = CURRENT_TIME;
	518
	519	if (inode)
	520	f2fs_drop_nlink(dir, inode, page);
	521
	522	f2fs_put_page(page, 1);
	523	}
	524
	525	bool f2fs_empty_inline_dir(struct inode *dir)
	526	{
	527	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	528	struct page *ipage;
	529	unsigned int bit_pos = 2;
	530	struct f2fs_inline_dentry *dentry_blk;
	531
	532	ipage = get_node_page(sbi, dir->i_ino);
	533	if (IS_ERR(ipage))
	534	return false;
	535
	536	dentry_blk = inline_data_addr(ipage);
	537	bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
	538	NR_INLINE_DENTRY,
	539	bit_pos);
	540
	541	f2fs_put_page(ipage, 1);
	542
	543	if (bit_pos < NR_INLINE_DENTRY)
	544	return false;
	545
	546	return true;
	547	}
	548
d8c6822a JK	549	int f2fs_read_inline_dir(struct file file, struct dir_context ctx,
d8c6822a JK	550	struct f2fs_str *fstr)
201a05be CY	551	{
201a05be CY	552	struct inode *inode = file_inode(file);
201a05be	553	struct f2fs_inline_dentry *inline_dentry = NULL;
201a05be	554	struct page *ipage = NULL;
7b3cd7d6	555	struct f2fs_dentry_ptr d;
201a05be CY	556
	557	if (ctx->pos == NR_INLINE_DENTRY)
	558	return 0;
	559
38594de7	560	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
201a05be CY	561	if (IS_ERR(ipage))
	562	return PTR_ERR(ipage);
	563
201a05be	564	inline_dentry = inline_data_addr(ipage);
201a05be	565
d8c6822a	566	make_dentry_ptr(inode, &d, (void *)inline_dentry, 2);
7b3cd7d6	567
d8c6822a	568	if (!f2fs_fill_dentries(ctx, &d, 0, fstr))
38594de7	569	ctx->pos = NR_INLINE_DENTRY;
201a05be	570
38594de7	571	f2fs_put_page(ipage, 1);
201a05be CY	572	return 0;
201a05be CY	573	}
67f8cf3c JK	574
	575	int f2fs_inline_data_fiemap(struct inode *inode,
	576	struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
	577	{
	578	__u64 byteaddr, ilen;
	579	__u32 flags = FIEMAP_EXTENT_DATA_INLINE \| FIEMAP_EXTENT_NOT_ALIGNED \|
	580	FIEMAP_EXTENT_LAST;
	581	struct node_info ni;
	582	struct page *ipage;
	583	int err = 0;
	584
	585	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
	586	if (IS_ERR(ipage))
	587	return PTR_ERR(ipage);
	588
	589	if (!f2fs_has_inline_data(inode)) {
	590	err = -EAGAIN;
	591	goto out;
	592	}
	593
	594	ilen = min_t(size_t, MAX_INLINE_DATA, i_size_read(inode));
	595	if (start >= ilen)
	596	goto out;
	597	if (start + len < ilen)
	598	ilen = start + len;
	599	ilen -= start;
	600
	601	get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
	602	byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
	603	byteaddr += (char )inline_data_addr(ipage) - (char )F2FS_INODE(ipage);
	604	err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
	605	out:
	606	f2fs_put_page(ipage, 1);
	607	return err;
	608	}