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.
12 #include <linux/f2fs_fs.h>
16 inline int f2fs_has_inline_data(struct inode *inode)
18 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
21 bool f2fs_may_inline(struct inode *inode)
23 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
27 if (!test_opt(sbi, INLINE_DATA))
30 nr_blocks = F2FS_I(inode)->i_xattr_nid ? 3 : 2;
31 if (inode->i_blocks > nr_blocks)
34 i_size = i_size_read(inode);
35 if (i_size > MAX_INLINE_DATA)
41 int f2fs_read_inline_data(struct inode *inode, struct page *page)
43 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
45 void *src_addr, *dst_addr;
47 ipage = get_node_page(sbi, inode->i_ino);
49 return PTR_ERR(ipage);
51 zero_user_segment(page, INLINE_DATA_OFFSET,
52 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
54 /* Copy the whole inline data block */
55 src_addr = inline_data_addr(ipage);
56 dst_addr = kmap(page);
57 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
59 f2fs_put_page(ipage, 1);
61 SetPageUptodate(page);
67 static int __f2fs_convert_inline_data(struct inode *inode, struct page *page)
71 struct dnode_of_data dn;
72 void *src_addr, *dst_addr;
74 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
75 struct f2fs_io_info fio = {
77 .rw = WRITE_SYNC | REQ_PRIO,
81 ipage = get_node_page(sbi, inode->i_ino);
83 return PTR_ERR(ipage);
86 * i_addr[0] is not used for inline data,
87 * so reserving new block will not destroy inline data
89 set_new_dnode(&dn, inode, ipage, ipage, 0);
90 err = f2fs_reserve_block(&dn, 0);
92 f2fs_put_page(ipage, 1);
97 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
99 /* Copy the whole inline data block */
100 src_addr = inline_data_addr(ipage);
101 dst_addr = kmap(page);
102 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
105 /* write data page to try to make data consistent */
106 set_page_writeback(page);
107 write_data_page(page, &dn, &new_blk_addr, &fio);
108 update_extent_cache(new_blk_addr, &dn);
109 f2fs_wait_on_page_writeback(page, DATA, true);
111 /* clear inline data and flag after data writeback */
112 zero_user_segment(ipage, INLINE_DATA_OFFSET,
113 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
114 clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
116 sync_inode_page(&dn);
117 f2fs_put_page(ipage, 1);
123 int f2fs_convert_inline_data(struct inode *inode,
124 struct page *p, unsigned flags)
129 if (!p || p->index) {
130 page = grab_cache_page_write_begin(inode->i_mapping, 0, flags);
132 return PTR_ERR(page);
137 err = __f2fs_convert_inline_data(inode, page);
140 f2fs_put_page(page, 1);
145 int f2fs_write_inline_data(struct inode *inode,
146 struct page *page, unsigned size)
148 void *src_addr, *dst_addr;
150 struct dnode_of_data dn;
153 set_new_dnode(&dn, inode, NULL, NULL, 0);
154 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
157 ipage = dn.inode_page;
159 zero_user_segment(ipage, INLINE_DATA_OFFSET,
160 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
161 src_addr = kmap(page);
162 dst_addr = inline_data_addr(ipage);
163 memcpy(dst_addr, src_addr, size);
166 /* Release the first data block if it is allocated */
167 if (!f2fs_has_inline_data(inode)) {
168 truncate_data_blocks_range(&dn, 1);
169 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
172 sync_inode_page(&dn);