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