inline.c 12.6 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
/*
 * 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"

bool f2fs_may_inline(struct inode *inode)
{
	block_t nr_blocks;
	loff_t i_size;

21
	if (!test_opt(F2FS_I_SB(inode), INLINE_DATA))
22
23
		return false;

Jaegeuk Kim's avatar
Jaegeuk Kim committed
24
25
26
	if (f2fs_is_atomic_file(inode))
		return false;

27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
	nr_blocks = F2FS_I(inode)->i_xattr_nid ? 3 : 2;
	if (inode->i_blocks > nr_blocks)
		return false;

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

	return true;
}

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

43
44
45
46
47
	if (page->index) {
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
		goto out;
	}

48
	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
49
50
	if (IS_ERR(ipage)) {
		unlock_page(page);
51
		return PTR_ERR(ipage);
52
	}
53

54
	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
55
56
57

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(ipage);
58
	dst_addr = kmap_atomic(page);
59
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
60
	kunmap_atomic(dst_addr);
61
	f2fs_put_page(ipage, 1);
62
out:
63
64
65
66
67
68
69
70
	SetPageUptodate(page);
	unlock_page(page);

	return 0;
}

static int __f2fs_convert_inline_data(struct inode *inode, struct page *page)
{
71
	int err = 0;
72
73
74
75
	struct page *ipage;
	struct dnode_of_data dn;
	void *src_addr, *dst_addr;
	block_t new_blk_addr;
76
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
77
78
79
80
81
82
83
	struct f2fs_io_info fio = {
		.type = DATA,
		.rw = WRITE_SYNC | REQ_PRIO,
	};

	f2fs_lock_op(sbi);
	ipage = get_node_page(sbi, inode->i_ino);
84
85
86
87
	if (IS_ERR(ipage)) {
		err = PTR_ERR(ipage);
		goto out;
	}
88

89
90
91
92
	/* someone else converted inline_data already */
	if (!f2fs_has_inline_data(inode))
		goto out;

93
94
95
96
	/*
	 * i_addr[0] is not used for inline data,
	 * so reserving new block will not destroy inline data
	 */
97
	set_new_dnode(&dn, inode, ipage, NULL, 0);
98
	err = f2fs_reserve_block(&dn, 0);
99
100
	if (err)
		goto out;
101

102
	f2fs_wait_on_page_writeback(page, DATA);
103
	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
104
105
106

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(ipage);
107
	dst_addr = kmap_atomic(page);
108
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
109
	kunmap_atomic(dst_addr);
110
	SetPageUptodate(page);
111
112
113
114
115

	/* write data page to try to make data consistent */
	set_page_writeback(page);
	write_data_page(page, &dn, &new_blk_addr, &fio);
	update_extent_cache(new_blk_addr, &dn);
116
	f2fs_wait_on_page_writeback(page, DATA);
117
118
119
120
121

	/* clear inline data and flag after data writeback */
	zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
122
	stat_dec_inline_inode(inode);
123
124

	sync_inode_page(&dn);
125
	f2fs_put_dnode(&dn);
126
out:
127
128
129
130
	f2fs_unlock_op(sbi);
	return err;
}

131
132
int f2fs_convert_inline_data(struct inode *inode, pgoff_t to_size,
						struct page *page)
133
{
134
	struct page *new_page = page;
135
	int err;
136

137
138
139
140
	if (!f2fs_has_inline_data(inode))
		return 0;
	else if (to_size <= MAX_INLINE_DATA)
		return 0;
141

142
143
144
145
146
	if (!page || page->index != 0) {
		new_page = grab_cache_page(inode->i_mapping, 0);
		if (!new_page)
			return -ENOMEM;
	}
147

148
149
150
	err = __f2fs_convert_inline_data(inode, new_page);
	if (!page || page->index != 0)
		f2fs_put_page(new_page, 1);
151
152
153
154
	return err;
}

int f2fs_write_inline_data(struct inode *inode,
155
				struct page *page, unsigned size)
156
157
158
159
160
161
162
163
164
165
166
167
{
	void *src_addr, *dst_addr;
	struct page *ipage;
	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;
	ipage = dn.inode_page;

168
169
170
171
172
173
174
175
	/* Release any data block if it is allocated */
	if (!f2fs_has_inline_data(inode)) {
		int count = ADDRS_PER_PAGE(dn.node_page, F2FS_I(inode));
		truncate_data_blocks_range(&dn, count);
		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		stat_inc_inline_inode(inode);
	}

176
	f2fs_wait_on_page_writeback(ipage, NODE);
177
178
	zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
179
	src_addr = kmap_atomic(page);
180
181
	dst_addr = inline_data_addr(ipage);
	memcpy(dst_addr, src_addr, size);
182
	kunmap_atomic(src_addr);
183

184
	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
185
186
187
188
189
	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);

	return 0;
}
190

191
192
193
194
195
196
197
void truncate_inline_data(struct inode *inode, u64 from)
{
	struct page *ipage;

	if (from >= MAX_INLINE_DATA)
		return;

198
	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
199
200
201
	if (IS_ERR(ipage))
		return;

202
203
	f2fs_wait_on_page_writeback(ipage, NODE);

204
205
206
207
208
209
	zero_user_segment(ipage, INLINE_DATA_OFFSET + from,
				INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	set_page_dirty(ipage);
	f2fs_put_page(ipage, 1);
}

210
bool recover_inline_data(struct inode *inode, struct page *npage)
211
{
212
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
	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) &&
229
			ri && (ri->i_inline & F2FS_INLINE_DATA)) {
230
231
process_inline:
		ipage = get_node_page(sbi, inode->i_ino);
232
		f2fs_bug_on(sbi, IS_ERR(ipage));
233

234
235
		f2fs_wait_on_page_writeback(ipage, NODE);

236
237
238
239
240
		src_addr = inline_data_addr(npage);
		dst_addr = inline_data_addr(ipage);
		memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
241
		return true;
242
243
244
245
	}

	if (f2fs_has_inline_data(inode)) {
		ipage = get_node_page(sbi, inode->i_ino);
246
		f2fs_bug_on(sbi, IS_ERR(ipage));
247
		f2fs_wait_on_page_writeback(ipage, NODE);
248
249
250
251
252
		zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
		clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
253
	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
254
		truncate_blocks(inode, 0, false);
255
256
257
		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		goto process_inline;
	}
258
	return false;
259
}
260
261
262
263
264

struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
				struct qstr *name, struct page **res_page)
{
	struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
265
	struct f2fs_inline_dentry *inline_dentry;
266
	struct f2fs_dir_entry *de;
267
	struct f2fs_dentry_ptr d;
268
	struct page *ipage;
269
270
271
272
273

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

274
	inline_dentry = inline_data_addr(ipage);
275

276
277
278
	make_dentry_ptr(&d, (void *)inline_dentry, 2);
	de = find_target_dentry(name, NULL, &d);

279
	unlock_page(ipage);
280
281
282
283
284
285
286
287
288
	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.
	 */
289
	f2fs_bug_on(sbi, d.max < 0);
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
	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;
316
	struct f2fs_dentry_ptr d;
317
318
319

	dentry_blk = inline_data_addr(ipage);

320
321
	make_dentry_ptr(&d, (void *)dentry_blk, 2);
	do_make_empty_dir(inode, parent, &d);
322
323
324
325
326
327
328
329
330
331
332

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

333
static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
				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)
		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, 0, PAGE_CACHE_SIZE);

353
	dentry_blk = kmap_atomic(page);
354
355
356
357
358
359
360
361
362

	/* copy data from inline dentry block to new dentry block */
	memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
					INLINE_DENTRY_BITMAP_SIZE);
	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);

363
	kunmap_atomic(dentry_blk);
364
365
366
367
368
369
	SetPageUptodate(page);
	set_page_dirty(page);

	/* clear inline dir and flag after data writeback */
	zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
370
	stat_dec_inline_dir(dir);
Chao Yu's avatar
Chao Yu committed
371
	clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405

	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)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
	struct page *ipage;
	unsigned int bit_pos;
	f2fs_hash_t name_hash;
	struct f2fs_dir_entry *de;
	size_t namelen = name->len;
	struct f2fs_inline_dentry *dentry_blk = NULL;
	int slots = GET_DENTRY_SLOTS(namelen);
	struct page *page;
	int err = 0;
	int i;

	name_hash = f2fs_dentry_hash(name);

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

	dentry_blk = inline_data_addr(ipage);
406
407
	bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
						slots, NR_INLINE_DENTRY);
408
409
410
411
412
413
414
415
	if (bit_pos >= NR_INLINE_DENTRY) {
		err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
		if (!err)
			err = -EAGAIN;
		goto out;
	}

	down_write(&F2FS_I(inode)->i_sem);
416
	page = init_inode_metadata(inode, dir, name, ipage);
417
418
419
420
	if (IS_ERR(page)) {
		err = PTR_ERR(page);
		goto fail;
	}
421
422

	f2fs_wait_on_page_writeback(ipage, NODE);
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
	de = &dentry_blk->dentry[bit_pos];
	de->hash_code = name_hash;
	de->name_len = cpu_to_le16(namelen);
	memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
	de->ino = cpu_to_le32(inode->i_ino);
	set_de_type(de, inode);
	for (i = 0; i < slots; i++)
		test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
	set_page_dirty(ipage);

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

	update_parent_metadata(dir, inode, 0);
fail:
	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);
460
	f2fs_wait_on_page_writeback(page, NODE);
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506

	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 inode *inode = file_inode(file);
	struct f2fs_inline_dentry *inline_dentry = NULL;
	struct page *ipage = NULL;
507
	struct f2fs_dentry_ptr d;
508
509
510
511

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

512
	ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
513
514
515
516
517
	if (IS_ERR(ipage))
		return PTR_ERR(ipage);

	inline_dentry = inline_data_addr(ipage);

518
519
520
	make_dentry_ptr(&d, (void *)inline_dentry, 2);

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

523
	f2fs_put_page(ipage, 1);
524
525
	return 0;
}