f2fs.h 80.1 KB
Newer Older
J
Jaegeuk Kim 已提交
1
/*
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
 * fs/f2fs/f2fs.h
 *
 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
 *             http://www.samsung.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.
 */
#ifndef _LINUX_F2FS_H
#define _LINUX_F2FS_H

#include <linux/types.h>
#include <linux/page-flags.h>
#include <linux/buffer_head.h>
#include <linux/slab.h>
#include <linux/crc32.h>
#include <linux/magic.h>
20
#include <linux/kobject.h>
21
#include <linux/sched.h>
22
#include <linux/vmalloc.h>
J
Jaegeuk Kim 已提交
23
#include <linux/bio.h>
24
#include <linux/blkdev.h>
25 26 27 28 29
#ifdef CONFIG_F2FS_FS_ENCRYPTION
#include <linux/fscrypt_supp.h>
#else
#include <linux/fscrypt_notsupp.h>
#endif
K
Keith Mok 已提交
30
#include <crypto/hash.h>
31

32
#ifdef CONFIG_F2FS_CHECK_FS
33
#define f2fs_bug_on(sbi, condition)	BUG_ON(condition)
34
#else
35 36 37 38
#define f2fs_bug_on(sbi, condition)					\
	do {								\
		if (unlikely(condition)) {				\
			WARN_ON(1);					\
39
			set_sbi_flag(sbi, SBI_NEED_FSCK);		\
40 41
		}							\
	} while (0)
42 43
#endif

J
Jaegeuk Kim 已提交
44 45 46
#ifdef CONFIG_F2FS_FAULT_INJECTION
enum {
	FAULT_KMALLOC,
47
	FAULT_PAGE_ALLOC,
J
Jaegeuk Kim 已提交
48 49 50 51
	FAULT_ALLOC_NID,
	FAULT_ORPHAN,
	FAULT_BLOCK,
	FAULT_DIR_DEPTH,
52
	FAULT_EVICT_INODE,
C
Chao Yu 已提交
53
	FAULT_IO,
54
	FAULT_CHECKPOINT,
J
Jaegeuk Kim 已提交
55 56 57
	FAULT_MAX,
};

S
Sheng Yong 已提交
58 59 60 61 62 63
struct f2fs_fault_info {
	atomic_t inject_ops;
	unsigned int inject_rate;
	unsigned int inject_type;
};

J
Jaegeuk Kim 已提交
64
extern char *fault_name[FAULT_MAX];
65
#define IS_FAULT_SET(fi, type) (fi->inject_type & (1 << (type)))
J
Jaegeuk Kim 已提交
66 67
#endif

68 69 70 71 72 73 74 75 76 77
/*
 * For mount options
 */
#define F2FS_MOUNT_BG_GC		0x00000001
#define F2FS_MOUNT_DISABLE_ROLL_FORWARD	0x00000002
#define F2FS_MOUNT_DISCARD		0x00000004
#define F2FS_MOUNT_NOHEAP		0x00000008
#define F2FS_MOUNT_XATTR_USER		0x00000010
#define F2FS_MOUNT_POSIX_ACL		0x00000020
#define F2FS_MOUNT_DISABLE_EXT_IDENTIFY	0x00000040
J
Jaegeuk Kim 已提交
78
#define F2FS_MOUNT_INLINE_XATTR		0x00000080
79
#define F2FS_MOUNT_INLINE_DATA		0x00000100
80 81 82
#define F2FS_MOUNT_INLINE_DENTRY	0x00000200
#define F2FS_MOUNT_FLUSH_MERGE		0x00000400
#define F2FS_MOUNT_NOBARRIER		0x00000800
83
#define F2FS_MOUNT_FASTBOOT		0x00001000
84
#define F2FS_MOUNT_EXTENT_CACHE		0x00002000
85
#define F2FS_MOUNT_FORCE_FG_GC		0x00004000
86
#define F2FS_MOUNT_DATA_FLUSH		0x00008000
87
#define F2FS_MOUNT_FAULT_INJECTION	0x00010000
88 89
#define F2FS_MOUNT_ADAPTIVE		0x00020000
#define F2FS_MOUNT_LFS			0x00040000
90 91 92 93 94 95 96 97 98

#define clear_opt(sbi, option)	(sbi->mount_opt.opt &= ~F2FS_MOUNT_##option)
#define set_opt(sbi, option)	(sbi->mount_opt.opt |= F2FS_MOUNT_##option)
#define test_opt(sbi, option)	(sbi->mount_opt.opt & F2FS_MOUNT_##option)

#define ver_after(a, b)	(typecheck(unsigned long long, a) &&		\
		typecheck(unsigned long long, b) &&			\
		((long long)((a) - (b)) > 0))

99 100 101 102
typedef u32 block_t;	/*
			 * should not change u32, since it is the on-disk block
			 * address format, __le32.
			 */
103 104 105 106 107 108
typedef u32 nid_t;

struct f2fs_mount_info {
	unsigned int	opt;
};

109
#define F2FS_FEATURE_ENCRYPT	0x0001
110
#define F2FS_FEATURE_BLKZONED	0x0002
111

112 113 114
#define F2FS_HAS_FEATURE(sb, mask)					\
	((F2FS_SB(sb)->raw_super->feature & cpu_to_le32(mask)) != 0)
#define F2FS_SET_FEATURE(sb, mask)					\
115
	(F2FS_SB(sb)->raw_super->feature |= cpu_to_le32(mask))
116
#define F2FS_CLEAR_FEATURE(sb, mask)					\
117
	(F2FS_SB(sb)->raw_super->feature &= ~cpu_to_le32(mask))
118

119 120 121 122 123 124 125 126
/*
 * For checkpoint manager
 */
enum {
	NAT_BITMAP,
	SIT_BITMAP
};

127 128
enum {
	CP_UMOUNT,
129
	CP_FASTBOOT,
130
	CP_SYNC,
131
	CP_RECOVERY,
132
	CP_DISCARD,
133 134
};

135
#define DEF_BATCHED_TRIM_SECTIONS	2048
J
Jaegeuk Kim 已提交
136 137
#define BATCHED_TRIM_SEGMENTS(sbi)	\
		(SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
138 139
#define BATCHED_TRIM_BLOCKS(sbi)	\
		(BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
140 141
#define MAX_DISCARD_BLOCKS(sbi)						\
		((1 << (sbi)->log_blocks_per_seg) * (sbi)->segs_per_sec)
142
#define DISCARD_ISSUE_RATE	8
143
#define DEF_CP_INTERVAL			60	/* 60 secs */
144
#define DEF_IDLE_INTERVAL		5	/* 5 secs */
J
Jaegeuk Kim 已提交
145

146 147
struct cp_control {
	int reason;
148 149 150 151
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
152 153
};

154
/*
155
 * For CP/NAT/SIT/SSA readahead
156 157 158 159
 */
enum {
	META_CP,
	META_NAT,
160
	META_SIT,
161 162
	META_SSA,
	META_POR,
163 164
};

J
Jaegeuk Kim 已提交
165 166 167
/* for the list of ino */
enum {
	ORPHAN_INO,		/* for orphan ino list */
168 169
	APPEND_INO,		/* for append ino list */
	UPDATE_INO,		/* for update ino list */
J
Jaegeuk Kim 已提交
170 171 172 173
	MAX_INO_ENTRY,		/* max. list */
};

struct ino_entry {
174 175 176 177
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

178
/* for the list of inodes to be GCed */
179
struct inode_entry {
180 181 182 183
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

184 185 186 187 188 189 190
/* for the list of blockaddresses to be discarded */
struct discard_entry {
	struct list_head list;	/* list head */
	block_t blkaddr;	/* block address to be discarded */
	int len;		/* # of consecutive blocks of the discard */
};

191 192 193 194 195 196
enum {
	D_PREP,
	D_SUBMIT,
	D_DONE,
};

197 198 199
struct discard_cmd {
	struct list_head list;		/* command list */
	struct completion wait;		/* compleation */
200
	struct block_device *bdev;	/* bdev */
201
	block_t lstart;			/* logical start address */
202
	block_t start;			/* actual start address in dev */
203
	block_t len;			/* length */
204
	int state;			/* state */
205
	int error;			/* bio error */
C
Chao Yu 已提交
206 207
};

208
struct discard_cmd_control {
209
	struct task_struct *f2fs_issue_discard;	/* discard thread */
210 211 212
	struct list_head discard_entry_list;	/* 4KB discard entry list */
	int nr_discards;			/* # of discards in the list */
	struct list_head discard_cmd_list;	/* discard cmd list */
213 214
	wait_queue_head_t discard_wait_queue;	/* waiting queue for wake-up */
	struct mutex cmd_lock;
215
	int max_discards;			/* max. discards to be issued */
216
	atomic_t submit_discard;		/* # of issued discard */
C
Chao Yu 已提交
217 218
};

219 220 221 222
/* for the list of fsync inodes, used only during recovery */
struct fsync_inode_entry {
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
223 224
	block_t blkaddr;	/* block address locating the last fsync */
	block_t last_dentry;	/* block address locating the last dentry */
225 226
};

227 228
#define nats_in_cursum(jnl)		(le16_to_cpu(jnl->n_nats))
#define sits_in_cursum(jnl)		(le16_to_cpu(jnl->n_sits))
229

230 231 232 233
#define nat_in_journal(jnl, i)		(jnl->nat_j.entries[i].ne)
#define nid_in_journal(jnl, i)		(jnl->nat_j.entries[i].nid)
#define sit_in_journal(jnl, i)		(jnl->sit_j.entries[i].se)
#define segno_in_journal(jnl, i)	(jnl->sit_j.entries[i].segno)
234

235 236
#define MAX_NAT_JENTRIES(jnl)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(jnl))
#define MAX_SIT_JENTRIES(jnl)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(jnl))
237

238
static inline int update_nats_in_cursum(struct f2fs_journal *journal, int i)
239
{
240
	int before = nats_in_cursum(journal);
241

242
	journal->n_nats = cpu_to_le16(before + i);
243 244 245
	return before;
}

246
static inline int update_sits_in_cursum(struct f2fs_journal *journal, int i)
247
{
248
	int before = sits_in_cursum(journal);
249

250
	journal->n_sits = cpu_to_le16(before + i);
251 252 253
	return before;
}

254 255
static inline bool __has_cursum_space(struct f2fs_journal *journal,
							int size, int type)
256 257
{
	if (type == NAT_JOURNAL)
258 259
		return size <= MAX_NAT_JENTRIES(journal);
	return size <= MAX_SIT_JENTRIES(journal);
260 261
}

262 263 264
/*
 * ioctl commands
 */
J
Jaegeuk Kim 已提交
265 266
#define F2FS_IOC_GETFLAGS		FS_IOC_GETFLAGS
#define F2FS_IOC_SETFLAGS		FS_IOC_SETFLAGS
C
Chao Yu 已提交
267
#define F2FS_IOC_GETVERSION		FS_IOC_GETVERSION
J
Jaegeuk Kim 已提交
268 269 270 271

#define F2FS_IOCTL_MAGIC		0xf5
#define F2FS_IOC_START_ATOMIC_WRITE	_IO(F2FS_IOCTL_MAGIC, 1)
#define F2FS_IOC_COMMIT_ATOMIC_WRITE	_IO(F2FS_IOCTL_MAGIC, 2)
272
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
273 274
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
275
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
276
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
C
Chao Yu 已提交
277
#define F2FS_IOC_DEFRAGMENT		_IO(F2FS_IOCTL_MAGIC, 8)
278 279
#define F2FS_IOC_MOVE_RANGE		_IOWR(F2FS_IOCTL_MAGIC, 9,	\
						struct f2fs_move_range)
280

281 282 283
#define F2FS_IOC_SET_ENCRYPTION_POLICY	FS_IOC_SET_ENCRYPTION_POLICY
#define F2FS_IOC_GET_ENCRYPTION_POLICY	FS_IOC_GET_ENCRYPTION_POLICY
#define F2FS_IOC_GET_ENCRYPTION_PWSALT	FS_IOC_GET_ENCRYPTION_PWSALT
284

J
Jaegeuk Kim 已提交
285 286 287 288 289 290 291 292
/*
 * should be same as XFS_IOC_GOINGDOWN.
 * Flags for going down operation used by FS_IOC_GOINGDOWN
 */
#define F2FS_IOC_SHUTDOWN	_IOR('X', 125, __u32)	/* Shutdown */
#define F2FS_GOING_DOWN_FULLSYNC	0x0	/* going down with full sync */
#define F2FS_GOING_DOWN_METASYNC	0x1	/* going down with metadata */
#define F2FS_GOING_DOWN_NOSYNC		0x2	/* going down */
293
#define F2FS_GOING_DOWN_METAFLUSH	0x3	/* going down with meta flush */
J
Jaegeuk Kim 已提交
294

295 296 297 298
#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
/*
 * ioctl commands in 32 bit emulation
 */
299 300 301
#define F2FS_IOC32_GETFLAGS		FS_IOC32_GETFLAGS
#define F2FS_IOC32_SETFLAGS		FS_IOC32_SETFLAGS
#define F2FS_IOC32_GETVERSION		FS_IOC32_GETVERSION
302 303
#endif

C
Chao Yu 已提交
304 305 306 307 308
struct f2fs_defragment {
	u64 start;
	u64 len;
};

309 310 311 312 313 314 315
struct f2fs_move_range {
	u32 dst_fd;		/* destination fd */
	u64 pos_in;		/* start position in src_fd */
	u64 pos_out;		/* start position in dst_fd */
	u64 len;		/* size to move */
};

316 317 318
/*
 * For INODE and NODE manager
 */
319 320
/* for directory operations */
struct f2fs_dentry_ptr {
321
	struct inode *inode;
322 323 324 325 326 327
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

328 329
static inline void make_dentry_ptr(struct inode *inode,
		struct f2fs_dentry_ptr *d, void *src, int type)
330
{
331 332
	d->inode = inode;

333 334
	if (type == 1) {
		struct f2fs_dentry_block *t = (struct f2fs_dentry_block *)src;
335

336 337 338 339 340 341
		d->max = NR_DENTRY_IN_BLOCK;
		d->bitmap = &t->dentry_bitmap;
		d->dentry = t->dentry;
		d->filename = t->filename;
	} else {
		struct f2fs_inline_dentry *t = (struct f2fs_inline_dentry *)src;
342

343 344 345 346 347 348 349
		d->max = NR_INLINE_DENTRY;
		d->bitmap = &t->dentry_bitmap;
		d->dentry = t->dentry;
		d->filename = t->filename;
	}
}

350 351 352 353 354 355 356
/*
 * XATTR_NODE_OFFSET stores xattrs to one node block per file keeping -1
 * as its node offset to distinguish from index node blocks.
 * But some bits are used to mark the node block.
 */
#define XATTR_NODE_OFFSET	((((unsigned int)-1) << OFFSET_BIT_SHIFT) \
				>> OFFSET_BIT_SHIFT)
357 358 359 360 361
enum {
	ALLOC_NODE,			/* allocate a new node page if needed */
	LOOKUP_NODE,			/* look up a node without readahead */
	LOOKUP_NODE_RA,			/*
					 * look up a node with readahead called
C
Chao Yu 已提交
362
					 * by get_data_block.
363
					 */
364 365
};

366
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
367

368 369
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

370 371 372
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

373
/* for in-memory extent cache entry */
374 375 376 377
#define F2FS_MIN_EXTENT_LEN	64	/* minimum extent length */

/* number of extent info in extent cache we try to shrink */
#define EXTENT_CACHE_SHRINK_NUMBER	128
378

379
struct extent_info {
380 381 382 383 384 385 386 387 388
	unsigned int fofs;		/* start offset in a file */
	u32 blk;			/* start block address of the extent */
	unsigned int len;		/* length of the extent */
};

struct extent_node {
	struct rb_node rb_node;		/* rb node located in rb-tree */
	struct list_head list;		/* node in global extent list of sbi */
	struct extent_info ei;		/* extent info */
389
	struct extent_tree *et;		/* extent tree pointer */
390 391 392 393 394
};

struct extent_tree {
	nid_t ino;			/* inode number */
	struct rb_root root;		/* root of extent info rb-tree */
395
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
396
	struct extent_info largest;	/* largested extent info */
397
	struct list_head list;		/* to be used by sbi->zombie_list */
398
	rwlock_t lock;			/* protect extent info rb-tree */
399
	atomic_t node_cnt;		/* # of extent node in rb-tree*/
400 401
};

J
Jaegeuk Kim 已提交
402 403 404 405 406 407 408
/*
 * This structure is taken from ext4_map_blocks.
 *
 * Note that, however, f2fs uses NEW and MAPPED flags for f2fs_map_blocks().
 */
#define F2FS_MAP_NEW		(1 << BH_New)
#define F2FS_MAP_MAPPED		(1 << BH_Mapped)
409 410 411
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
412 413 414 415 416 417

struct f2fs_map_blocks {
	block_t m_pblk;
	block_t m_lblk;
	unsigned int m_len;
	unsigned int m_flags;
418
	pgoff_t *m_next_pgofs;		/* point next possible non-hole pgofs */
J
Jaegeuk Kim 已提交
419 420
};

C
Chao Yu 已提交
421 422 423 424 425
/* for flag in get_data_block */
#define F2FS_GET_BLOCK_READ		0
#define F2FS_GET_BLOCK_DIO		1
#define F2FS_GET_BLOCK_FIEMAP		2
#define F2FS_GET_BLOCK_BMAP		3
426
#define F2FS_GET_BLOCK_PRE_DIO		4
427
#define F2FS_GET_BLOCK_PRE_AIO		5
C
Chao Yu 已提交
428

429 430 431 432
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
433
#define FADVISE_LOST_PINO_BIT	0x02
434
#define FADVISE_ENCRYPT_BIT	0x04
435
#define FADVISE_ENC_NAME_BIT	0x08
436
#define FADVISE_KEEP_SIZE_BIT	0x10
437

438 439 440 441 442 443
#define file_is_cold(inode)	is_file(inode, FADVISE_COLD_BIT)
#define file_wrong_pino(inode)	is_file(inode, FADVISE_LOST_PINO_BIT)
#define file_set_cold(inode)	set_file(inode, FADVISE_COLD_BIT)
#define file_lost_pino(inode)	set_file(inode, FADVISE_LOST_PINO_BIT)
#define file_clear_cold(inode)	clear_file(inode, FADVISE_COLD_BIT)
#define file_got_pino(inode)	clear_file(inode, FADVISE_LOST_PINO_BIT)
444 445 446
#define file_is_encrypt(inode)	is_file(inode, FADVISE_ENCRYPT_BIT)
#define file_set_encrypt(inode)	set_file(inode, FADVISE_ENCRYPT_BIT)
#define file_clear_encrypt(inode) clear_file(inode, FADVISE_ENCRYPT_BIT)
447 448
#define file_enc_name(inode)	is_file(inode, FADVISE_ENC_NAME_BIT)
#define file_set_enc_name(inode) set_file(inode, FADVISE_ENC_NAME_BIT)
449 450
#define file_keep_isize(inode)	is_file(inode, FADVISE_KEEP_SIZE_BIT)
#define file_set_keep_isize(inode) set_file(inode, FADVISE_KEEP_SIZE_BIT)
451

452 453
#define DEF_DIR_LEVEL		0

454 455 456 457
struct f2fs_inode_info {
	struct inode vfs_inode;		/* serve a vfs inode */
	unsigned long i_flags;		/* keep an inode flags for ioctl */
	unsigned char i_advise;		/* use to give file attribute hints */
458
	unsigned char i_dir_level;	/* use for dentry level for large dir */
459
	unsigned int i_current_depth;	/* use only in directory structure */
460
	unsigned int i_pino;		/* parent inode number */
461 462 463 464
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
465
	struct rw_semaphore i_sem;	/* protect fi info */
466
	atomic_t dirty_pages;		/* # of dirty pages */
467 468
	f2fs_hash_t chash;		/* hash value of given file name */
	unsigned int clevel;		/* maximum level of given file name */
469
	struct task_struct *task;	/* lookup and create consistency */
470
	nid_t i_xattr_nid;		/* node id that contains xattrs */
471
	loff_t	last_disk_size;		/* lastly written file size */
J
Jaegeuk Kim 已提交
472

473 474
	struct list_head dirty_list;	/* dirty list for dirs and files */
	struct list_head gdirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
475 476
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
J
Jaegeuk Kim 已提交
477
	struct extent_tree *extent_tree;	/* cached extent_tree entry */
478
	struct rw_semaphore dio_rwsem[2];/* avoid racing between dio and gc */
479 480 481
};

static inline void get_extent_info(struct extent_info *ext,
C
Chao Yu 已提交
482
					struct f2fs_extent *i_ext)
483
{
C
Chao Yu 已提交
484 485 486
	ext->fofs = le32_to_cpu(i_ext->fofs);
	ext->blk = le32_to_cpu(i_ext->blk);
	ext->len = le32_to_cpu(i_ext->len);
487 488 489 490 491 492
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	i_ext->fofs = cpu_to_le32(ext->fofs);
493
	i_ext->blk = cpu_to_le32(ext->blk);
494 495 496
	i_ext->len = cpu_to_le32(ext->len);
}

497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523
static inline void set_extent_info(struct extent_info *ei, unsigned int fofs,
						u32 blk, unsigned int len)
{
	ei->fofs = fofs;
	ei->blk = blk;
	ei->len = len;
}

static inline bool __is_extent_mergeable(struct extent_info *back,
						struct extent_info *front)
{
	return (back->fofs + back->len == front->fofs &&
			back->blk + back->len == front->blk);
}

static inline bool __is_back_mergeable(struct extent_info *cur,
						struct extent_info *back)
{
	return __is_extent_mergeable(back, cur);
}

static inline bool __is_front_mergeable(struct extent_info *cur,
						struct extent_info *front)
{
	return __is_extent_mergeable(cur, front);
}

524
extern void f2fs_mark_inode_dirty_sync(struct inode *inode, bool sync);
525 526
static inline void __try_update_largest_extent(struct inode *inode,
			struct extent_tree *et, struct extent_node *en)
527
{
528
	if (en->ei.len > et->largest.len) {
529
		et->largest = en->ei;
530
		f2fs_mark_inode_dirty_sync(inode, true);
531
	}
532 533
}

C
Chao Yu 已提交
534 535 536 537 538 539
enum nid_list {
	FREE_NID_LIST,
	ALLOC_NID_LIST,
	MAX_NID_LIST,
};

540 541 542
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
543
	nid_t available_nids;		/* # of available node ids */
544
	nid_t next_scan_nid;		/* the next nid to be scanned */
545
	unsigned int ram_thresh;	/* control the memory footprint */
C
Chao Yu 已提交
546
	unsigned int ra_nid_pages;	/* # of nid pages to be readaheaded */
C
Chao Yu 已提交
547
	unsigned int dirty_nats_ratio;	/* control dirty nats ratio threshold */
548 549 550

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
551
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
552
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
553
	struct list_head nat_entries;	/* cached nat entry list (clean) */
554
	unsigned int nat_cnt;		/* the # of cached nat entries */
555
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
556
	unsigned int nat_blocks;	/* # of nat blocks */
557 558

	/* free node ids management */
559
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
C
Chao Yu 已提交
560 561 562
	struct list_head nid_list[MAX_NID_LIST];/* lists for free nids */
	unsigned int nid_cnt[MAX_NID_LIST];	/* the number of free node id */
	spinlock_t nid_list_lock;	/* protect nid lists ops */
563
	struct mutex build_lock;	/* lock for build free nids */
C
Chao Yu 已提交
564 565
	unsigned char (*free_nid_bitmap)[NAT_ENTRY_BITMAP_SIZE];
	unsigned char *nat_block_bitmap;
566 567
	unsigned short *free_nid_count;	/* free nid count of NAT block */
	spinlock_t free_nid_lock;	/* protect updating of nid count */
568 569 570

	/* for checkpoint */
	char *nat_bitmap;		/* NAT bitmap pointer */
571 572 573 574 575

	unsigned int nat_bits_blocks;	/* # of nat bits blocks */
	unsigned char *nat_bits;	/* NAT bits blocks */
	unsigned char *full_nat_bits;	/* full NAT pages */
	unsigned char *empty_nat_bits;	/* empty NAT pages */
576 577 578
#ifdef CONFIG_F2FS_CHECK_FS
	char *nat_bitmap_mir;		/* NAT bitmap mirror */
#endif
579 580 581 582 583 584 585 586 587 588 589 590 591 592 593
	int bitmap_size;		/* bitmap size */
};

/*
 * this structure is used as one of function parameters.
 * all the information are dedicated to a given direct node block determined
 * by the data offset in a file.
 */
struct dnode_of_data {
	struct inode *inode;		/* vfs inode pointer */
	struct page *inode_page;	/* its inode page, NULL is possible */
	struct page *node_page;		/* cached direct node page */
	nid_t nid;			/* node id of the direct node block */
	unsigned int ofs_in_node;	/* data offset in the node page */
	bool inode_page_locked;		/* inode page is locked or not */
594
	bool node_changed;		/* is node block changed */
595 596
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
597 598 599 600 601 602
	block_t	data_blkaddr;		/* block address of the node block */
};

static inline void set_new_dnode(struct dnode_of_data *dn, struct inode *inode,
		struct page *ipage, struct page *npage, nid_t nid)
{
603
	memset(dn, 0, sizeof(*dn));
604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633
	dn->inode = inode;
	dn->inode_page = ipage;
	dn->node_page = npage;
	dn->nid = nid;
}

/*
 * For SIT manager
 *
 * By default, there are 6 active log areas across the whole main area.
 * When considering hot and cold data separation to reduce cleaning overhead,
 * we split 3 for data logs and 3 for node logs as hot, warm, and cold types,
 * respectively.
 * In the current design, you should not change the numbers intentionally.
 * Instead, as a mount option such as active_logs=x, you can use 2, 4, and 6
 * logs individually according to the underlying devices. (default: 6)
 * Just in case, on-disk layout covers maximum 16 logs that consist of 8 for
 * data and 8 for node logs.
 */
#define	NR_CURSEG_DATA_TYPE	(3)
#define NR_CURSEG_NODE_TYPE	(3)
#define NR_CURSEG_TYPE	(NR_CURSEG_DATA_TYPE + NR_CURSEG_NODE_TYPE)

enum {
	CURSEG_HOT_DATA	= 0,	/* directory entry blocks */
	CURSEG_WARM_DATA,	/* data blocks */
	CURSEG_COLD_DATA,	/* multimedia or GCed data blocks */
	CURSEG_HOT_NODE,	/* direct node blocks of directory files */
	CURSEG_WARM_NODE,	/* direct node blocks of normal files */
	CURSEG_COLD_NODE,	/* indirect node blocks */
634
	NO_CHECK_TYPE,
635 636
};

637 638
struct flush_cmd {
	struct completion wait;
639
	struct llist_node llnode;
640 641 642
	int ret;
};

643 644 645
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
646
	atomic_t submit_flush;			/* # of issued flushes */
647 648
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
649 650
};

651 652 653 654 655 656 657 658 659 660 661 662 663 664
struct f2fs_sm_info {
	struct sit_info *sit_info;		/* whole segment information */
	struct free_segmap_info *free_info;	/* free segment information */
	struct dirty_seglist_info *dirty_info;	/* dirty segment information */
	struct curseg_info *curseg_array;	/* active segment information */

	block_t seg0_blkaddr;		/* block address of 0'th segment */
	block_t main_blkaddr;		/* start block address of main area */
	block_t ssa_blkaddr;		/* start block address of SSA area */

	unsigned int segment_count;	/* total # of segments */
	unsigned int main_segments;	/* # of segments in main area */
	unsigned int reserved_segments;	/* # of reserved segments */
	unsigned int ovp_segments;	/* # of overprovision segments */
665 666 667

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
668

J
Jaegeuk Kim 已提交
669 670 671
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

672 673
	struct list_head sit_entry_set;	/* sit entry set list */

674 675
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
676
	unsigned int min_fsync_blocks;	/* threshold for fsync */
677 678

	/* for flush command control */
679
	struct flush_cmd_control *fcc_info;
680

681 682
	/* for discard command control */
	struct discard_cmd_control *dcc_info;
683 684 685 686 687 688 689 690 691 692 693
};

/*
 * For superblock
 */
/*
 * COUNT_TYPE for monitoring
 *
 * f2fs monitors the number of several block types such as on-writeback,
 * dirty dentry blocks, dirty node blocks, and dirty meta blocks.
 */
694
#define WB_DATA_TYPE(p)	(__is_cp_guaranteed(p) ? F2FS_WB_CP_DATA : F2FS_WB_DATA)
695 696
enum count_type {
	F2FS_DIRTY_DENTS,
697
	F2FS_DIRTY_DATA,
698 699
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
700
	F2FS_INMEM_PAGES,
701
	F2FS_DIRTY_IMETA,
702 703
	F2FS_WB_CP_DATA,
	F2FS_WB_DATA,
704 705 706 707
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
708
 * The below are the page types of bios used in submit_bio().
709 710 711 712 713 714 715 716 717
 * The available types are:
 * DATA			User data pages. It operates as async mode.
 * NODE			Node pages. It operates as async mode.
 * META			FS metadata pages such as SIT, NAT, CP.
 * NR_PAGE_TYPE		The number of page types.
 * META_FLUSH		Make sure the previous pages are written
 *			with waiting the bio's completion
 * ...			Only can be used with META.
 */
718
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
719 720 721 722 723 724
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
725 726
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
727
	INMEM_INVALIDATE,
728
	INMEM_REVOKE,
729 730
	IPU,
	OPU,
731 732
};

J
Jaegeuk Kim 已提交
733
struct f2fs_io_info {
734
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
735
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
M
Mike Christie 已提交
736
	int op;			/* contains REQ_OP_ */
737
	int op_flags;		/* req_flag_bits */
738
	block_t new_blkaddr;	/* new block address to be written */
739
	block_t old_blkaddr;	/* old block address before Cow */
740
	struct page *page;	/* page to be written */
741
	struct page *encrypted_page;	/* encrypted page */
742
	bool submitted;		/* indicate IO submission */
J
Jaegeuk Kim 已提交
743 744
};

M
Mike Christie 已提交
745
#define is_read_io(rw) (rw == READ)
746
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
747
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
748 749
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
750
	struct f2fs_io_info fio;	/* store buffered io info. */
751
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
752 753
};

J
Jaegeuk Kim 已提交
754 755 756 757 758 759 760 761 762 763 764 765 766 767
#define FDEV(i)				(sbi->devs[i])
#define RDEV(i)				(raw_super->devs[i])
struct f2fs_dev_info {
	struct block_device *bdev;
	char path[MAX_PATH_LEN];
	unsigned int total_segments;
	block_t start_blk;
	block_t end_blk;
#ifdef CONFIG_BLK_DEV_ZONED
	unsigned int nr_blkz;			/* Total number of zones */
	u8 *blkz_type;				/* Array of zones type */
#endif
};

768 769 770
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
771
	DIRTY_META,			/* for all dirtied inode metadata */
772 773 774
	NR_INODE_TYPE,
};

775 776 777 778 779 780 781 782
/* for inner inode cache management */
struct inode_management {
	struct radix_tree_root ino_root;	/* ino entry array */
	spinlock_t ino_lock;			/* for ino entry lock */
	struct list_head ino_list;		/* inode list head */
	unsigned long ino_num;			/* number of entries */
};

783 784 785 786 787 788
/* For s_flag in struct f2fs_sb_info */
enum {
	SBI_IS_DIRTY,				/* dirty flag for checkpoint */
	SBI_IS_CLOSE,				/* specify unmounting */
	SBI_NEED_FSCK,				/* need fsck.f2fs to fix */
	SBI_POR_DOING,				/* recovery is doing or not */
789
	SBI_NEED_SB_WRITE,			/* need to recover superblock */
790
	SBI_NEED_CP,				/* need to checkpoint */
791 792
};

793 794
enum {
	CP_TIME,
795
	REQ_TIME,
796 797 798
	MAX_TIME,
};

799 800
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
801
	struct proc_dir_entry *s_proc;		/* proc entry */
802
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
803
	int valid_super_block;			/* valid super block no */
804
	unsigned long s_flag;				/* flags for sbi */
805

806 807 808 809 810
#ifdef CONFIG_BLK_DEV_ZONED
	unsigned int blocks_per_blkz;		/* F2FS blocks per zone */
	unsigned int log_blocks_per_blkz;	/* log2 F2FS blocks per zone */
#endif

811 812 813 814 815 816
	/* for node-related operations */
	struct f2fs_nm_info *nm_info;		/* node manager */
	struct inode *node_inode;		/* cache node blocks */

	/* for segment-related operations */
	struct f2fs_sm_info *sm_info;		/* segment manager */
817 818

	/* for bio operations */
819
	struct f2fs_bio_info read_io;			/* for read bios */
820
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
821
	struct mutex wio_mutex[NODE + 1];	/* bio ordering for NODE/DATA */
822 823
	int write_io_size_bits;			/* Write IO size bits */
	mempool_t *write_io_dummy;		/* Dummy pages */
824 825 826

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
827
	int cur_cp_pack;			/* remain current cp pack */
828
	spinlock_t cp_lock;			/* for flag in ckpt */
829
	struct inode *meta_inode;		/* cache meta blocks */
830
	struct mutex cp_mutex;			/* checkpoint procedure lock */
831
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
832
	struct rw_semaphore node_write;		/* locking node writes */
833
	wait_queue_head_t cp_wait;
834 835
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
836

837
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
838 839

	/* for orphan inode, use 0'th array */
840
	unsigned int max_orphans;		/* max orphan inodes */
841

842 843 844
	/* for inode management */
	struct list_head inode_list[NR_INODE_TYPE];	/* dirty inode list */
	spinlock_t inode_lock[NR_INODE_TYPE];	/* for dirty inode list lock */
845

846 847
	/* for extent tree cache */
	struct radix_tree_root extent_tree_root;/* cache extent cache entries */
848
	struct mutex extent_tree_lock;	/* locking extent radix tree */
849 850
	struct list_head extent_list;		/* lru list for shrinker */
	spinlock_t extent_lock;			/* locking extent lru list */
851
	atomic_t total_ext_tree;		/* extent tree count */
852
	struct list_head zombie_list;		/* extent zombie tree list */
853
	atomic_t total_zombie_tree;		/* extent zombie tree count */
854 855
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
856
	/* basic filesystem units */
857 858 859 860 861 862 863 864 865 866 867 868 869
	unsigned int log_sectors_per_block;	/* log2 sectors per block */
	unsigned int log_blocksize;		/* log2 block size */
	unsigned int blocksize;			/* block size */
	unsigned int root_ino_num;		/* root inode number*/
	unsigned int node_ino_num;		/* node inode number*/
	unsigned int meta_ino_num;		/* meta inode number*/
	unsigned int log_blocks_per_seg;	/* log2 blocks per segment */
	unsigned int blocks_per_seg;		/* blocks per segment */
	unsigned int segs_per_sec;		/* segments per section */
	unsigned int secs_per_zone;		/* sections per zone */
	unsigned int total_sections;		/* total section count */
	unsigned int total_node_count;		/* total node block count */
	unsigned int total_valid_node_count;	/* valid node block count */
C
Chao Yu 已提交
870
	loff_t max_file_blocks;			/* max block index of file */
871
	int active_logs;			/* # of active logs */
872
	int dir_level;				/* directory level */
873 874 875

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
876
	block_t discard_blks;			/* discard command candidats */
877 878
	block_t last_valid_block_count;		/* for recovery */
	u32 s_next_generation;			/* for NFS support */
879 880

	/* # of pages, see count_type */
881
	atomic_t nr_pages[NR_COUNT_TYPE];
882 883
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
884

885 886 887
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

888 889 890 891 892
	struct f2fs_mount_info mount_opt;	/* mount options */

	/* for cleaning operations */
	struct mutex gc_mutex;			/* mutex for GC */
	struct f2fs_gc_kthread	*gc_thread;	/* GC thread */
893
	unsigned int cur_victim_sec;		/* current victim section num */
894

895 896 897
	/* threshold for converting bg victims for fg */
	u64 fggc_threshold;

898 899 900
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

901 902 903 904
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
905
#ifdef CONFIG_F2FS_STAT_FS
906 907 908
	struct f2fs_stat_info *stat_info;	/* FS status information */
	unsigned int segment_count[2];		/* # of allocated segments */
	unsigned int block_count[2];		/* # of allocated blocks */
909
	atomic_t inplace_count;		/* # of inplace update */
910 911 912 913
	atomic64_t total_hit_ext;		/* # of lookup extent cache */
	atomic64_t read_hit_rbtree;		/* # of hit rbtree extent node */
	atomic64_t read_hit_largest;		/* # of hit largest extent node */
	atomic64_t read_hit_cached;		/* # of hit cached extent node */
C
Chao Yu 已提交
914
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
915 916
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
917 918
	atomic_t aw_cnt;			/* # of atomic writes */
	atomic_t max_aw_cnt;			/* max # of atomic writes */
919
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
920
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
921 922
#endif
	unsigned int last_victim[2];		/* last victim segment # */
923
	spinlock_t stat_lock;			/* lock for stat operations */
924 925 926 927

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
928 929 930

	/* For shrinker support */
	struct list_head s_list;
J
Jaegeuk Kim 已提交
931 932
	int s_ndevs;				/* number of devices */
	struct f2fs_dev_info *devs;		/* for device list */
933 934
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
935 936 937 938

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
939 940 941

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
942 943 944 945 946

	/* For fault injection */
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct f2fs_fault_info fault_info;
#endif
947 948
};

949
#ifdef CONFIG_F2FS_FAULT_INJECTION
950 951 952 953
#define f2fs_show_injection_info(type)				\
	printk("%sF2FS-fs : inject %s in %s of %pF\n",		\
		KERN_INFO, fault_name[type],			\
		__func__, __builtin_return_address(0))
954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972
static inline bool time_to_inject(struct f2fs_sb_info *sbi, int type)
{
	struct f2fs_fault_info *ffi = &sbi->fault_info;

	if (!ffi->inject_rate)
		return false;

	if (!IS_FAULT_SET(ffi, type))
		return false;

	atomic_inc(&ffi->inject_ops);
	if (atomic_read(&ffi->inject_ops) >= ffi->inject_rate) {
		atomic_set(&ffi->inject_ops, 0);
		return true;
	}
	return false;
}
#endif

973 974 975 976 977 978 979
/* For write statistics. Suppose sector size is 512 bytes,
 * and the return value is in kbytes. s is of struct f2fs_sb_info.
 */
#define BD_PART_WRITTEN(s)						 \
(((u64)part_stat_read(s->sb->s_bdev->bd_part, sectors[1]) -		 \
		s->sectors_written_start) >> 1)

980 981 982 983 984 985 986 987 988 989 990 991 992
static inline void f2fs_update_time(struct f2fs_sb_info *sbi, int type)
{
	sbi->last_time[type] = jiffies;
}

static inline bool f2fs_time_over(struct f2fs_sb_info *sbi, int type)
{
	struct timespec ts = {sbi->interval_time[type], 0};
	unsigned long interval = timespec_to_jiffies(&ts);

	return time_after(jiffies, sbi->last_time[type] + interval);
}

993 994 995 996 997 998 999 1000 1001 1002 1003 1004
static inline bool is_idle(struct f2fs_sb_info *sbi)
{
	struct block_device *bdev = sbi->sb->s_bdev;
	struct request_queue *q = bdev_get_queue(bdev);
	struct request_list *rl = &q->root_rl;

	if (rl->count[BLK_RW_SYNC] || rl->count[BLK_RW_ASYNC])
		return 0;

	return f2fs_time_over(sbi, REQ_TIME);
}

1005 1006 1007
/*
 * Inline functions
 */
K
Keith Mok 已提交
1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030
static inline u32 f2fs_crc32(struct f2fs_sb_info *sbi, const void *address,
			   unsigned int length)
{
	SHASH_DESC_ON_STACK(shash, sbi->s_chksum_driver);
	u32 *ctx = (u32 *)shash_desc_ctx(shash);
	int err;

	shash->tfm = sbi->s_chksum_driver;
	shash->flags = 0;
	*ctx = F2FS_SUPER_MAGIC;

	err = crypto_shash_update(shash, address, length);
	BUG_ON(err);

	return *ctx;
}

static inline bool f2fs_crc_valid(struct f2fs_sb_info *sbi, __u32 blk_crc,
				  void *buf, size_t buf_size)
{
	return f2fs_crc32(sbi, buf, buf_size) == blk_crc;
}

1031 1032 1033 1034 1035 1036 1037 1038 1039 1040
static inline struct f2fs_inode_info *F2FS_I(struct inode *inode)
{
	return container_of(inode, struct f2fs_inode_info, vfs_inode);
}

static inline struct f2fs_sb_info *F2FS_SB(struct super_block *sb)
{
	return sb->s_fs_info;
}

1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055
static inline struct f2fs_sb_info *F2FS_I_SB(struct inode *inode)
{
	return F2FS_SB(inode->i_sb);
}

static inline struct f2fs_sb_info *F2FS_M_SB(struct address_space *mapping)
{
	return F2FS_I_SB(mapping->host);
}

static inline struct f2fs_sb_info *F2FS_P_SB(struct page *page)
{
	return F2FS_M_SB(page->mapping);
}

1056 1057 1058 1059 1060 1061 1062 1063 1064 1065
static inline struct f2fs_super_block *F2FS_RAW_SUPER(struct f2fs_sb_info *sbi)
{
	return (struct f2fs_super_block *)(sbi->raw_super);
}

static inline struct f2fs_checkpoint *F2FS_CKPT(struct f2fs_sb_info *sbi)
{
	return (struct f2fs_checkpoint *)(sbi->ckpt);
}

1066 1067 1068 1069 1070
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

1071 1072 1073 1074 1075
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100
static inline struct f2fs_nm_info *NM_I(struct f2fs_sb_info *sbi)
{
	return (struct f2fs_nm_info *)(sbi->nm_info);
}

static inline struct f2fs_sm_info *SM_I(struct f2fs_sb_info *sbi)
{
	return (struct f2fs_sm_info *)(sbi->sm_info);
}

static inline struct sit_info *SIT_I(struct f2fs_sb_info *sbi)
{
	return (struct sit_info *)(SM_I(sbi)->sit_info);
}

static inline struct free_segmap_info *FREE_I(struct f2fs_sb_info *sbi)
{
	return (struct free_segmap_info *)(SM_I(sbi)->free_info);
}

static inline struct dirty_seglist_info *DIRTY_I(struct f2fs_sb_info *sbi)
{
	return (struct dirty_seglist_info *)(SM_I(sbi)->dirty_info);
}

G
Gu Zheng 已提交
1101 1102 1103 1104 1105
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

1106 1107 1108 1109 1110
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1111 1112
static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
{
1113
	return test_bit(type, &sbi->s_flag);
1114 1115 1116
}

static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1117
{
1118
	set_bit(type, &sbi->s_flag);
1119 1120
}

1121
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1122
{
1123
	clear_bit(type, &sbi->s_flag);
1124 1125
}

1126 1127 1128 1129 1130
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

1131 1132 1133 1134 1135 1136
static inline __u64 cur_cp_crc(struct f2fs_checkpoint *cp)
{
	size_t crc_offset = le32_to_cpu(cp->checksum_offset);
	return le32_to_cpu(*((__le32 *)((unsigned char *)cp + crc_offset)));
}

1137
static inline bool __is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
1138 1139
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1140

1141 1142 1143
	return ckpt_flags & f;
}

1144
static inline bool is_set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1145
{
1146 1147 1148 1149 1150 1151 1152 1153
	return __is_set_ckpt_flags(F2FS_CKPT(sbi), f);
}

static inline void __set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
{
	unsigned int ckpt_flags;

	ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1154 1155 1156 1157
	ckpt_flags |= f;
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1158
static inline void set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1159
{
1160 1161 1162 1163 1164 1165 1166 1167 1168 1169
	spin_lock(&sbi->cp_lock);
	__set_ckpt_flags(F2FS_CKPT(sbi), f);
	spin_unlock(&sbi->cp_lock);
}

static inline void __clear_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
{
	unsigned int ckpt_flags;

	ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1170 1171 1172 1173
	ckpt_flags &= (~f);
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1174 1175 1176 1177 1178 1179 1180
static inline void clear_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
{
	spin_lock(&sbi->cp_lock);
	__clear_ckpt_flags(F2FS_CKPT(sbi), f);
	spin_unlock(&sbi->cp_lock);
}

1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201
static inline void disable_nat_bits(struct f2fs_sb_info *sbi, bool lock)
{
	set_sbi_flag(sbi, SBI_NEED_FSCK);

	if (lock)
		spin_lock(&sbi->cp_lock);
	__clear_ckpt_flags(F2FS_CKPT(sbi), CP_NAT_BITS_FLAG);
	kfree(NM_I(sbi)->nat_bits);
	NM_I(sbi)->nat_bits = NULL;
	if (lock)
		spin_unlock(&sbi->cp_lock);
}

static inline bool enabled_nat_bits(struct f2fs_sb_info *sbi,
					struct cp_control *cpc)
{
	bool set = is_set_ckpt_flags(sbi, CP_NAT_BITS_FLAG);

	return (cpc) ? (cpc->reason == CP_UMOUNT) && set : set;
}

1202
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1203
{
1204
	down_read(&sbi->cp_rwsem);
1205 1206
}

1207
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1208
{
1209
	up_read(&sbi->cp_rwsem);
1210 1211
}

1212
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1213
{
1214
	down_write(&sbi->cp_rwsem);
1215 1216
}

1217
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1218
{
1219
	up_write(&sbi->cp_rwsem);
1220 1221
}

1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239
static inline int __get_cp_reason(struct f2fs_sb_info *sbi)
{
	int reason = CP_SYNC;

	if (test_opt(sbi, FASTBOOT))
		reason = CP_FASTBOOT;
	if (is_sbi_flag_set(sbi, SBI_IS_CLOSE))
		reason = CP_UMOUNT;
	return reason;
}

static inline bool __remain_node_summaries(int reason)
{
	return (reason == CP_UMOUNT || reason == CP_FASTBOOT);
}

static inline bool __exist_node_summaries(struct f2fs_sb_info *sbi)
{
1240 1241
	return (is_set_ckpt_flags(sbi, CP_UMOUNT_FLAG) ||
			is_set_ckpt_flags(sbi, CP_FASTBOOT_FLAG));
1242 1243
}

1244 1245 1246
/*
 * Check whether the given nid is within node id range.
 */
1247
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1248
{
1249 1250
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1251
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1252 1253
		return -EINVAL;
	return 0;
1254 1255 1256 1257 1258 1259 1260 1261 1262 1263
}

#define F2FS_DEFAULT_ALLOCATED_BLOCKS	1

/*
 * Check whether the inode has blocks or not
 */
static inline int F2FS_HAS_BLOCKS(struct inode *inode)
{
	if (F2FS_I(inode)->i_xattr_nid)
C
Chris Fries 已提交
1264
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1265
	else
C
Chris Fries 已提交
1266
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1267 1268
}

1269 1270 1271 1272 1273
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1274
static inline void f2fs_i_blocks_write(struct inode *, blkcnt_t, bool);
1275
static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
1276
				 struct inode *inode, blkcnt_t *count)
1277
{
1278
	blkcnt_t diff;
1279

J
Jaegeuk Kim 已提交
1280
#ifdef CONFIG_F2FS_FAULT_INJECTION
1281 1282
	if (time_to_inject(sbi, FAULT_BLOCK)) {
		f2fs_show_injection_info(FAULT_BLOCK);
J
Jaegeuk Kim 已提交
1283
		return false;
1284
	}
J
Jaegeuk Kim 已提交
1285
#endif
1286 1287 1288 1289 1290 1291
	/*
	 * let's increase this in prior to actual block count change in order
	 * for f2fs_sync_file to avoid data races when deciding checkpoint.
	 */
	percpu_counter_add(&sbi->alloc_valid_block_count, (*count));

1292 1293 1294
	spin_lock(&sbi->stat_lock);
	sbi->total_valid_block_count += (block_t)(*count);
	if (unlikely(sbi->total_valid_block_count > sbi->user_block_count)) {
1295 1296
		diff = sbi->total_valid_block_count - sbi->user_block_count;
		*count -= diff;
1297
		sbi->total_valid_block_count = sbi->user_block_count;
1298 1299
		if (!*count) {
			spin_unlock(&sbi->stat_lock);
1300
			percpu_counter_sub(&sbi->alloc_valid_block_count, diff);
1301 1302
			return false;
		}
1303 1304
	}
	spin_unlock(&sbi->stat_lock);
1305

1306
	f2fs_i_blocks_write(inode, *count, true);
1307 1308 1309
	return true;
}

1310
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1311 1312 1313 1314
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1315 1316
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1317 1318
	sbi->total_valid_block_count -= (block_t)count;
	spin_unlock(&sbi->stat_lock);
1319
	f2fs_i_blocks_write(inode, count, false);
1320 1321 1322 1323
}

static inline void inc_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1324
	atomic_inc(&sbi->nr_pages[count_type]);
1325

1326 1327
	if (count_type == F2FS_DIRTY_DATA || count_type == F2FS_INMEM_PAGES ||
		count_type == F2FS_WB_CP_DATA || count_type == F2FS_WB_DATA)
1328 1329
		return;

1330
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1331 1332
}

1333
static inline void inode_inc_dirty_pages(struct inode *inode)
1334
{
1335
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1336 1337
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1338 1339 1340 1341
}

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1342
	atomic_dec(&sbi->nr_pages[count_type]);
1343 1344
}

1345
static inline void inode_dec_dirty_pages(struct inode *inode)
1346
{
1347 1348
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1349 1350
		return;

1351
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1352 1353
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1354 1355
}

1356
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1357
{
1358
	return atomic_read(&sbi->nr_pages[count_type]);
1359 1360
}

1361
static inline int get_dirty_pages(struct inode *inode)
1362
{
1363
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1364 1365
}

1366 1367
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1368
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1369 1370 1371 1372
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1373 1374
}

1375 1376
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1377
	return sbi->total_valid_block_count;
1378 1379
}

1380 1381 1382 1383 1384
static inline block_t discard_blocks(struct f2fs_sb_info *sbi)
{
	return sbi->discard_blks;
}

1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397
static inline unsigned long __bitmap_size(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);

	/* return NAT or SIT bitmap */
	if (flag == NAT_BITMAP)
		return le32_to_cpu(ckpt->nat_ver_bitmap_bytesize);
	else if (flag == SIT_BITMAP)
		return le32_to_cpu(ckpt->sit_ver_bitmap_bytesize);

	return 0;
}

W
Wanpeng Li 已提交
1398 1399 1400 1401 1402
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1403 1404 1405
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1406 1407
	int offset;

W
Wanpeng Li 已提交
1408
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1409 1410 1411
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1412
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1413 1414
	} else {
		offset = (flag == NAT_BITMAP) ?
1415
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1416 1417
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1418 1419 1420 1421
}

static inline block_t __start_cp_addr(struct f2fs_sb_info *sbi)
{
1422
	block_t start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1423

1424
	if (sbi->cur_cp_pack == 2)
1425
		start_addr += sbi->blocks_per_seg;
1426 1427
	return start_addr;
}
1428

1429 1430 1431
static inline block_t __start_cp_next_addr(struct f2fs_sb_info *sbi)
{
	block_t start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1432

1433 1434
	if (sbi->cur_cp_pack == 1)
		start_addr += sbi->blocks_per_seg;
1435 1436 1437
	return start_addr;
}

1438 1439 1440 1441 1442
static inline void __set_cp_next_pack(struct f2fs_sb_info *sbi)
{
	sbi->cur_cp_pack = (sbi->cur_cp_pack == 1) ? 2 : 1;
}

1443 1444 1445 1446 1447 1448
static inline block_t __start_sum_addr(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_CKPT(sbi)->cp_pack_start_sum);
}

static inline bool inc_valid_node_count(struct f2fs_sb_info *sbi,
1449
						struct inode *inode)
1450 1451 1452 1453 1454 1455
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1456
	valid_block_count = sbi->total_valid_block_count + 1;
1457
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1458 1459 1460 1461
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1462
	valid_node_count = sbi->total_valid_node_count + 1;
1463
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1464 1465 1466 1467 1468
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1469
		f2fs_i_blocks_write(inode, 1, true);
1470 1471 1472

	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1473 1474
	spin_unlock(&sbi->stat_lock);

1475
	percpu_counter_inc(&sbi->alloc_valid_block_count);
1476 1477 1478 1479
	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1480
						struct inode *inode)
1481 1482 1483
{
	spin_lock(&sbi->stat_lock);

1484 1485 1486
	f2fs_bug_on(sbi, !sbi->total_valid_block_count);
	f2fs_bug_on(sbi, !sbi->total_valid_node_count);
	f2fs_bug_on(sbi, !inode->i_blocks);
1487

1488
	f2fs_i_blocks_write(inode, 1, false);
1489 1490
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1491 1492 1493 1494 1495 1496

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1497
	return sbi->total_valid_node_count;
1498 1499 1500 1501
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1502
	percpu_counter_inc(&sbi->total_valid_inode_count);
1503 1504
}

1505
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1506
{
1507
	percpu_counter_dec(&sbi->total_valid_inode_count);
1508 1509
}

1510
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1511
{
1512
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1513 1514
}

1515 1516 1517
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1518 1519
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct page *page = find_lock_page(mapping, index);
1520

1521 1522 1523
	if (page)
		return page;

1524 1525
	if (time_to_inject(F2FS_M_SB(mapping), FAULT_PAGE_ALLOC)) {
		f2fs_show_injection_info(FAULT_PAGE_ALLOC);
1526
		return NULL;
1527
	}
1528
#endif
1529 1530 1531 1532 1533
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1534 1535 1536 1537 1538 1539 1540 1541 1542 1543
static inline void f2fs_copy_page(struct page *src, struct page *dst)
{
	char *src_kaddr = kmap(src);
	char *dst_kaddr = kmap(dst);

	memcpy(dst_kaddr, src_kaddr, PAGE_SIZE);
	kunmap(dst);
	kunmap(src);
}

1544 1545
static inline void f2fs_put_page(struct page *page, int unlock)
{
1546
	if (!page)
1547 1548 1549
		return;

	if (unlock) {
1550
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1551 1552
		unlock_page(page);
	}
1553
	put_page(page);
1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566
}

static inline void f2fs_put_dnode(struct dnode_of_data *dn)
{
	if (dn->node_page)
		f2fs_put_page(dn->node_page, 1);
	if (dn->inode_page && dn->node_page != dn->inode_page)
		f2fs_put_page(dn->inode_page, 0);
	dn->node_page = NULL;
	dn->inode_page = NULL;
}

static inline struct kmem_cache *f2fs_kmem_cache_create(const char *name,
1567
					size_t size)
1568
{
1569
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1570 1571
}

1572 1573 1574 1575 1576
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1577 1578 1579
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1580 1581 1582
	return entry;
}

J
Jaegeuk Kim 已提交
1583 1584 1585 1586 1587 1588
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1589 1590
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1591 1592 1593
	return bio;
}

1594 1595 1596 1597 1598 1599 1600
static inline void f2fs_radix_tree_insert(struct radix_tree_root *root,
				unsigned long index, void *item)
{
	while (radix_tree_insert(root, index, item))
		cond_resched();
}

1601 1602 1603 1604
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1605
	struct f2fs_node *p = F2FS_NODE(page);
1606

1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619
	return RAW_IS_INODE(p);
}

static inline __le32 *blkaddr_in_node(struct f2fs_node *node)
{
	return RAW_IS_INODE(node) ? node->i.i_addr : node->dn.addr;
}

static inline block_t datablock_addr(struct page *node_page,
		unsigned int offset)
{
	struct f2fs_node *raw_node;
	__le32 *addr_array;
1620

1621
	raw_node = F2FS_NODE(node_page);
1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634
	addr_array = blkaddr_in_node(raw_node);
	return le32_to_cpu(addr_array[offset]);
}

static inline int f2fs_test_bit(unsigned int nr, char *addr)
{
	int mask;

	addr += (nr >> 3);
	mask = 1 << (7 - (nr & 0x07));
	return mask & *addr;
}

1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652
static inline void f2fs_set_bit(unsigned int nr, char *addr)
{
	int mask;

	addr += (nr >> 3);
	mask = 1 << (7 - (nr & 0x07));
	*addr |= mask;
}

static inline void f2fs_clear_bit(unsigned int nr, char *addr)
{
	int mask;

	addr += (nr >> 3);
	mask = 1 << (7 - (nr & 0x07));
	*addr &= ~mask;
}

1653
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664
{
	int mask;
	int ret;

	addr += (nr >> 3);
	mask = 1 << (7 - (nr & 0x07));
	ret = mask & *addr;
	*addr |= mask;
	return ret;
}

1665
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676
{
	int mask;
	int ret;

	addr += (nr >> 3);
	mask = 1 << (7 - (nr & 0x07));
	ret = mask & *addr;
	*addr &= ~mask;
	return ret;
}

1677 1678 1679 1680 1681 1682 1683 1684 1685
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

	addr += (nr >> 3);
	mask = 1 << (7 - (nr & 0x07));
	*addr ^= mask;
}

1686 1687 1688
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1689
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1690
	FI_AUTO_RECOVER,	/* indicate inode is recoverable */
1691
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1692 1693 1694
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1695
	FI_FREE_NID,		/* free allocated nide */
1696
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1697
	FI_INLINE_XATTR,	/* used for inline xattr */
1698
	FI_INLINE_DATA,		/* used for inline data*/
1699
	FI_INLINE_DENTRY,	/* used for inline dentry */
1700 1701
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1702 1703
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
C
Chao Yu 已提交
1704
	FI_ATOMIC_COMMIT,	/* indicate the state of atomical committing */
1705
	FI_VOLATILE_FILE,	/* indicate volatile file */
1706
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1707
	FI_DROP_CACHE,		/* drop dirty page cache */
1708
	FI_DATA_EXIST,		/* indicate data exists */
1709
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1710
	FI_DO_DEFRAG,		/* indicate defragment is running */
1711
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1712
	FI_NO_PREALLOC,		/* indicate skipped preallocated blocks */
1713 1714
};

1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725
static inline void __mark_inode_dirty_flag(struct inode *inode,
						int flag, bool set)
{
	switch (flag) {
	case FI_INLINE_XATTR:
	case FI_INLINE_DATA:
	case FI_INLINE_DENTRY:
		if (set)
			return;
	case FI_DATA_EXIST:
	case FI_INLINE_DOTS:
1726
		f2fs_mark_inode_dirty_sync(inode, true);
1727 1728 1729
	}
}

1730
static inline void set_inode_flag(struct inode *inode, int flag)
1731
{
1732 1733
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1734
	__mark_inode_dirty_flag(inode, flag, true);
1735 1736
}

1737
static inline int is_inode_flag_set(struct inode *inode, int flag)
1738
{
1739
	return test_bit(flag, &F2FS_I(inode)->flags);
1740 1741
}

1742
static inline void clear_inode_flag(struct inode *inode, int flag)
1743
{
1744 1745
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1746
	__mark_inode_dirty_flag(inode, flag, false);
1747 1748
}

1749
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1750
{
1751 1752
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1753
	f2fs_mark_inode_dirty_sync(inode, false);
1754 1755
}

1756
static inline void f2fs_i_links_write(struct inode *inode, bool inc)
1757
{
1758 1759 1760 1761
	if (inc)
		inc_nlink(inode);
	else
		drop_nlink(inode);
1762
	f2fs_mark_inode_dirty_sync(inode, true);
1763 1764
}

1765 1766 1767
static inline void f2fs_i_blocks_write(struct inode *inode,
					blkcnt_t diff, bool add)
{
1768 1769 1770
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1771 1772
	inode->i_blocks = add ? inode->i_blocks + diff :
				inode->i_blocks - diff;
1773
	f2fs_mark_inode_dirty_sync(inode, true);
1774 1775
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1776 1777
}

1778 1779
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1780 1781 1782
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1783 1784 1785 1786
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
1787
	f2fs_mark_inode_dirty_sync(inode, true);
1788 1789
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1790 1791
}

1792
static inline void f2fs_i_depth_write(struct inode *inode, unsigned int depth)
1793
{
1794
	F2FS_I(inode)->i_current_depth = depth;
1795
	f2fs_mark_inode_dirty_sync(inode, true);
1796 1797
}

1798
static inline void f2fs_i_xnid_write(struct inode *inode, nid_t xnid)
J
Jaegeuk Kim 已提交
1799
{
1800
	F2FS_I(inode)->i_xattr_nid = xnid;
1801
	f2fs_mark_inode_dirty_sync(inode, true);
1802 1803 1804 1805 1806
}

static inline void f2fs_i_pino_write(struct inode *inode, nid_t pino)
{
	F2FS_I(inode)->i_pino = pino;
1807
	f2fs_mark_inode_dirty_sync(inode, true);
1808 1809
}

1810
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1811
{
1812 1813
	struct f2fs_inode_info *fi = F2FS_I(inode);

J
Jaegeuk Kim 已提交
1814
	if (ri->i_inline & F2FS_INLINE_XATTR)
1815
		set_bit(FI_INLINE_XATTR, &fi->flags);
1816
	if (ri->i_inline & F2FS_INLINE_DATA)
1817
		set_bit(FI_INLINE_DATA, &fi->flags);
1818
	if (ri->i_inline & F2FS_INLINE_DENTRY)
1819
		set_bit(FI_INLINE_DENTRY, &fi->flags);
1820
	if (ri->i_inline & F2FS_DATA_EXIST)
1821
		set_bit(FI_DATA_EXIST, &fi->flags);
1822
	if (ri->i_inline & F2FS_INLINE_DOTS)
1823
		set_bit(FI_INLINE_DOTS, &fi->flags);
J
Jaegeuk Kim 已提交
1824 1825
}

1826
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1827 1828 1829
{
	ri->i_inline = 0;

1830
	if (is_inode_flag_set(inode, FI_INLINE_XATTR))
J
Jaegeuk Kim 已提交
1831
		ri->i_inline |= F2FS_INLINE_XATTR;
1832
	if (is_inode_flag_set(inode, FI_INLINE_DATA))
1833
		ri->i_inline |= F2FS_INLINE_DATA;
1834
	if (is_inode_flag_set(inode, FI_INLINE_DENTRY))
1835
		ri->i_inline |= F2FS_INLINE_DENTRY;
1836
	if (is_inode_flag_set(inode, FI_DATA_EXIST))
1837
		ri->i_inline |= F2FS_DATA_EXIST;
1838
	if (is_inode_flag_set(inode, FI_INLINE_DOTS))
1839
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1840 1841
}

1842 1843
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
1844
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
1845 1846
}

1847
static inline unsigned int addrs_per_inode(struct inode *inode)
1848
{
1849
	if (f2fs_has_inline_xattr(inode))
1850 1851 1852 1853
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1854 1855
static inline void *inline_xattr_addr(struct page *page)
{
1856
	struct f2fs_inode *ri = F2FS_INODE(page);
1857

J
Jaegeuk Kim 已提交
1858 1859 1860 1861 1862 1863
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1864
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1865 1866 1867 1868 1869
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1870 1871
static inline int f2fs_has_inline_data(struct inode *inode)
{
1872
	return is_inode_flag_set(inode, FI_INLINE_DATA);
1873 1874
}

1875 1876
static inline void f2fs_clear_inline_inode(struct inode *inode)
{
1877 1878
	clear_inode_flag(inode, FI_INLINE_DATA);
	clear_inode_flag(inode, FI_DATA_EXIST);
1879 1880 1881 1882
}

static inline int f2fs_exist_data(struct inode *inode)
{
1883
	return is_inode_flag_set(inode, FI_DATA_EXIST);
1884 1885
}

1886 1887
static inline int f2fs_has_inline_dots(struct inode *inode)
{
1888
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
1889 1890
}

J
Jaegeuk Kim 已提交
1891 1892
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
1893
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
1894 1895
}

C
Chao Yu 已提交
1896 1897 1898 1899 1900
static inline bool f2fs_is_commit_atomic_write(struct inode *inode)
{
	return is_inode_flag_set(inode, FI_ATOMIC_COMMIT);
}

1901 1902
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
1903
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
1904 1905
}

1906 1907
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
1908
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
1909 1910
}

1911 1912
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
1913
	return is_inode_flag_set(inode, FI_DROP_CACHE);
1914 1915
}

1916 1917
static inline void *inline_data_addr(struct page *page)
{
1918
	struct f2fs_inode *ri = F2FS_INODE(page);
1919

1920 1921 1922
	return (void *)&(ri->i_addr[1]);
}

1923 1924
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
1925
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
1926 1927
}

1928 1929 1930 1931 1932 1933
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1934 1935 1936 1937 1938 1939 1940 1941
static inline int is_file(struct inode *inode, int type)
{
	return F2FS_I(inode)->i_advise & type;
}

static inline void set_file(struct inode *inode, int type)
{
	F2FS_I(inode)->i_advise |= type;
1942
	f2fs_mark_inode_dirty_sync(inode, true);
1943 1944 1945 1946 1947
}

static inline void clear_file(struct inode *inode, int type)
{
	F2FS_I(inode)->i_advise &= ~type;
1948
	f2fs_mark_inode_dirty_sync(inode, true);
1949 1950
}

1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966
static inline bool f2fs_skip_inode_update(struct inode *inode, int dsync)
{
	if (dsync) {
		struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
		bool ret;

		spin_lock(&sbi->inode_lock[DIRTY_META]);
		ret = list_empty(&F2FS_I(inode)->gdirty_list);
		spin_unlock(&sbi->inode_lock[DIRTY_META]);
		return ret;
	}
	if (!is_inode_flag_set(inode, FI_AUTO_RECOVER) ||
			file_keep_isize(inode) ||
			i_size_read(inode) & PAGE_MASK)
		return false;
	return F2FS_I(inode)->last_disk_size == i_size_read(inode);
1967 1968
}

J
Jaegeuk Kim 已提交
1969 1970 1971 1972 1973
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1974 1975
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
1976
	return is_set_ckpt_flags(sbi, CP_ERROR_FLAG);
1977 1978
}

1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989
static inline bool is_dot_dotdot(const struct qstr *str)
{
	if (str->len == 1 && str->name[0] == '.')
		return true;

	if (str->len == 2 && str->name[0] == '.' && str->name[1] == '.')
		return true;

	return false;
}

J
Jaegeuk Kim 已提交
1990 1991 1992
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
1993
			is_inode_flag_set(inode, FI_NO_EXTENT))
J
Jaegeuk Kim 已提交
1994 1995
		return false;

A
Al Viro 已提交
1996
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
1997 1998
}

1999 2000
static inline void *f2fs_kmalloc(struct f2fs_sb_info *sbi,
					size_t size, gfp_t flags)
2001
{
J
Jaegeuk Kim 已提交
2002
#ifdef CONFIG_F2FS_FAULT_INJECTION
2003 2004
	if (time_to_inject(sbi, FAULT_KMALLOC)) {
		f2fs_show_injection_info(FAULT_KMALLOC);
J
Jaegeuk Kim 已提交
2005
		return NULL;
2006
	}
J
Jaegeuk Kim 已提交
2007
#endif
2008 2009 2010
	return kmalloc(size, flags);
}

2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030
static inline void *f2fs_kvmalloc(size_t size, gfp_t flags)
{
	void *ret;

	ret = kmalloc(size, flags | __GFP_NOWARN);
	if (!ret)
		ret = __vmalloc(size, flags, PAGE_KERNEL);
	return ret;
}

static inline void *f2fs_kvzalloc(size_t size, gfp_t flags)
{
	void *ret;

	ret = kzalloc(size, flags | __GFP_NOWARN);
	if (!ret)
		ret = __vmalloc(size, flags | __GFP_ZERO, PAGE_KERNEL);
	return ret;
}

2031
#define get_inode_mode(i) \
2032
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
2033 2034
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

2035 2036 2037
/*
 * file.c
 */
2038 2039 2040 2041
int f2fs_sync_file(struct file *file, loff_t start, loff_t end, int datasync);
void truncate_data_blocks(struct dnode_of_data *dn);
int truncate_blocks(struct inode *inode, u64 from, bool lock);
int f2fs_truncate(struct inode *inode);
2042 2043
int f2fs_getattr(const struct path *path, struct kstat *stat,
			u32 request_mask, unsigned int flags);
2044 2045 2046 2047 2048
int f2fs_setattr(struct dentry *dentry, struct iattr *attr);
int truncate_hole(struct inode *inode, pgoff_t pg_start, pgoff_t pg_end);
int truncate_data_blocks_range(struct dnode_of_data *dn, int count);
long f2fs_ioctl(struct file *filp, unsigned int cmd, unsigned long arg);
long f2fs_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg);
2049 2050 2051 2052

/*
 * inode.c
 */
2053 2054 2055 2056 2057 2058 2059 2060 2061
void f2fs_set_inode_flags(struct inode *inode);
struct inode *f2fs_iget(struct super_block *sb, unsigned long ino);
struct inode *f2fs_iget_retry(struct super_block *sb, unsigned long ino);
int try_to_free_nats(struct f2fs_sb_info *sbi, int nr_shrink);
int update_inode(struct inode *inode, struct page *node_page);
int update_inode_page(struct inode *inode);
int f2fs_write_inode(struct inode *inode, struct writeback_control *wbc);
void f2fs_evict_inode(struct inode *inode);
void handle_failed_inode(struct inode *inode);
2062 2063 2064 2065 2066 2067 2068 2069 2070

/*
 * namei.c
 */
struct dentry *f2fs_get_parent(struct dentry *child);

/*
 * dir.c
 */
2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111
void set_de_type(struct f2fs_dir_entry *de, umode_t mode);
unsigned char get_de_type(struct f2fs_dir_entry *de);
struct f2fs_dir_entry *find_target_dentry(struct fscrypt_name *fname,
			f2fs_hash_t namehash, int *max_slots,
			struct f2fs_dentry_ptr *d);
int f2fs_fill_dentries(struct dir_context *ctx, struct f2fs_dentry_ptr *d,
			unsigned int start_pos, struct fscrypt_str *fstr);
void do_make_empty_dir(struct inode *inode, struct inode *parent,
			struct f2fs_dentry_ptr *d);
struct page *init_inode_metadata(struct inode *inode, struct inode *dir,
			const struct qstr *new_name,
			const struct qstr *orig_name, struct page *dpage);
void update_parent_metadata(struct inode *dir, struct inode *inode,
			unsigned int current_depth);
int room_for_filename(const void *bitmap, int slots, int max_slots);
void f2fs_drop_nlink(struct inode *dir, struct inode *inode);
struct f2fs_dir_entry *__f2fs_find_entry(struct inode *dir,
			struct fscrypt_name *fname, struct page **res_page);
struct f2fs_dir_entry *f2fs_find_entry(struct inode *dir,
			const struct qstr *child, struct page **res_page);
struct f2fs_dir_entry *f2fs_parent_dir(struct inode *dir, struct page **p);
ino_t f2fs_inode_by_name(struct inode *dir, const struct qstr *qstr,
			struct page **page);
void f2fs_set_link(struct inode *dir, struct f2fs_dir_entry *de,
			struct page *page, struct inode *inode);
int update_dent_inode(struct inode *inode, struct inode *to,
			const struct qstr *name);
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *d,
			const struct qstr *name, f2fs_hash_t name_hash,
			unsigned int bit_pos);
int f2fs_add_regular_entry(struct inode *dir, const struct qstr *new_name,
			const struct qstr *orig_name,
			struct inode *inode, nid_t ino, umode_t mode);
int __f2fs_do_add_link(struct inode *dir, struct fscrypt_name *fname,
			struct inode *inode, nid_t ino, umode_t mode);
int __f2fs_add_link(struct inode *dir, const struct qstr *name,
			struct inode *inode, nid_t ino, umode_t mode);
void f2fs_delete_entry(struct f2fs_dir_entry *dentry, struct page *page,
			struct inode *dir, struct inode *inode);
int f2fs_do_tmpfile(struct inode *inode, struct inode *dir);
bool f2fs_empty_dir(struct inode *dir);
2112

2113 2114
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
2115
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
2116
				inode, inode->i_ino, inode->i_mode);
2117 2118
}

2119 2120 2121
/*
 * super.c
 */
2122 2123 2124 2125
int f2fs_inode_dirtied(struct inode *inode, bool sync);
void f2fs_inode_synced(struct inode *inode);
int f2fs_commit_super(struct f2fs_sb_info *sbi, bool recover);
int f2fs_sync_fs(struct super_block *sb, int sync);
2126
extern __printf(3, 4)
2127
void f2fs_msg(struct super_block *sb, const char *level, const char *fmt, ...);
2128
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
2129 2130 2131 2132

/*
 * hash.c
 */
2133
f2fs_hash_t f2fs_dentry_hash(const struct qstr *name_info);
2134 2135 2136 2137 2138 2139 2140

/*
 * node.c
 */
struct dnode_of_data;
struct node_info;

2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161
bool available_free_memory(struct f2fs_sb_info *sbi, int type);
int need_dentry_mark(struct f2fs_sb_info *sbi, nid_t nid);
bool is_checkpointed_node(struct f2fs_sb_info *sbi, nid_t nid);
bool need_inode_block_update(struct f2fs_sb_info *sbi, nid_t ino);
void get_node_info(struct f2fs_sb_info *sbi, nid_t nid, struct node_info *ni);
pgoff_t get_next_page_offset(struct dnode_of_data *dn, pgoff_t pgofs);
int get_dnode_of_data(struct dnode_of_data *dn, pgoff_t index, int mode);
int truncate_inode_blocks(struct inode *inode, pgoff_t from);
int truncate_xattr_node(struct inode *inode, struct page *page);
int wait_on_node_pages_writeback(struct f2fs_sb_info *sbi, nid_t ino);
int remove_inode_page(struct inode *inode);
struct page *new_inode_page(struct inode *inode);
struct page *new_node_page(struct dnode_of_data *dn,
			unsigned int ofs, struct page *ipage);
void ra_node_page(struct f2fs_sb_info *sbi, nid_t nid);
struct page *get_node_page(struct f2fs_sb_info *sbi, pgoff_t nid);
struct page *get_node_page_ra(struct page *parent, int start);
void move_node_page(struct page *node_page, int gc_type);
int fsync_node_pages(struct f2fs_sb_info *sbi, struct inode *inode,
			struct writeback_control *wbc, bool atomic);
int sync_node_pages(struct f2fs_sb_info *sbi, struct writeback_control *wbc);
2162
void build_free_nids(struct f2fs_sb_info *sbi, bool sync, bool mount);
2163 2164 2165 2166 2167
bool alloc_nid(struct f2fs_sb_info *sbi, nid_t *nid);
void alloc_nid_done(struct f2fs_sb_info *sbi, nid_t nid);
void alloc_nid_failed(struct f2fs_sb_info *sbi, nid_t nid);
int try_to_free_nids(struct f2fs_sb_info *sbi, int nr_shrink);
void recover_inline_xattr(struct inode *inode, struct page *page);
2168
int recover_xattr_data(struct inode *inode, struct page *page,
2169 2170 2171 2172
			block_t blkaddr);
int recover_inode_page(struct f2fs_sb_info *sbi, struct page *page);
int restore_node_summary(struct f2fs_sb_info *sbi,
			unsigned int segno, struct f2fs_summary_block *sum);
2173
void flush_nat_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc);
2174 2175
int build_node_manager(struct f2fs_sb_info *sbi);
void destroy_node_manager(struct f2fs_sb_info *sbi);
2176
int __init create_node_manager_caches(void);
2177 2178 2179 2180 2181
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
2182 2183
void register_inmem_page(struct inode *inode, struct page *page);
void drop_inmem_pages(struct inode *inode);
2184
void drop_inmem_page(struct inode *inode, struct page *page);
2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227
int commit_inmem_pages(struct inode *inode);
void f2fs_balance_fs(struct f2fs_sb_info *sbi, bool need);
void f2fs_balance_fs_bg(struct f2fs_sb_info *sbi);
int f2fs_issue_flush(struct f2fs_sb_info *sbi);
int create_flush_cmd_control(struct f2fs_sb_info *sbi);
void destroy_flush_cmd_control(struct f2fs_sb_info *sbi, bool free);
void invalidate_blocks(struct f2fs_sb_info *sbi, block_t addr);
bool is_checkpointed_data(struct f2fs_sb_info *sbi, block_t blkaddr);
void refresh_sit_entry(struct f2fs_sb_info *sbi, block_t old, block_t new);
void f2fs_wait_discard_bio(struct f2fs_sb_info *sbi, block_t blkaddr);
void clear_prefree_segments(struct f2fs_sb_info *sbi, struct cp_control *cpc);
void release_discard_addrs(struct f2fs_sb_info *sbi);
int npages_for_summary_flush(struct f2fs_sb_info *sbi, bool for_ra);
void allocate_new_segments(struct f2fs_sb_info *sbi);
int f2fs_trim_fs(struct f2fs_sb_info *sbi, struct fstrim_range *range);
bool exist_trim_candidates(struct f2fs_sb_info *sbi, struct cp_control *cpc);
struct page *get_sum_page(struct f2fs_sb_info *sbi, unsigned int segno);
void update_meta_page(struct f2fs_sb_info *sbi, void *src, block_t blk_addr);
void write_meta_page(struct f2fs_sb_info *sbi, struct page *page);
void write_node_page(unsigned int nid, struct f2fs_io_info *fio);
void write_data_page(struct dnode_of_data *dn, struct f2fs_io_info *fio);
void rewrite_data_page(struct f2fs_io_info *fio);
void __f2fs_replace_block(struct f2fs_sb_info *sbi, struct f2fs_summary *sum,
			block_t old_blkaddr, block_t new_blkaddr,
			bool recover_curseg, bool recover_newaddr);
void f2fs_replace_block(struct f2fs_sb_info *sbi, struct dnode_of_data *dn,
			block_t old_addr, block_t new_addr,
			unsigned char version, bool recover_curseg,
			bool recover_newaddr);
void allocate_data_block(struct f2fs_sb_info *sbi, struct page *page,
			block_t old_blkaddr, block_t *new_blkaddr,
			struct f2fs_summary *sum, int type);
void f2fs_wait_on_page_writeback(struct page *page,
			enum page_type type, bool ordered);
void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *sbi,
			block_t blkaddr);
void write_data_summaries(struct f2fs_sb_info *sbi, block_t start_blk);
void write_node_summaries(struct f2fs_sb_info *sbi, block_t start_blk);
int lookup_journal_in_cursum(struct f2fs_journal *journal, int type,
			unsigned int val, int alloc);
void flush_sit_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc);
int build_segment_manager(struct f2fs_sb_info *sbi);
void destroy_segment_manager(struct f2fs_sb_info *sbi);
2228 2229
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
2230 2231 2232 2233

/*
 * checkpoint.c
 */
2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259
void f2fs_stop_checkpoint(struct f2fs_sb_info *sbi, bool end_io);
struct page *grab_meta_page(struct f2fs_sb_info *sbi, pgoff_t index);
struct page *get_meta_page(struct f2fs_sb_info *sbi, pgoff_t index);
struct page *get_tmp_page(struct f2fs_sb_info *sbi, pgoff_t index);
bool is_valid_blkaddr(struct f2fs_sb_info *sbi, block_t blkaddr, int type);
int ra_meta_pages(struct f2fs_sb_info *sbi, block_t start, int nrpages,
			int type, bool sync);
void ra_meta_pages_cond(struct f2fs_sb_info *sbi, pgoff_t index);
long sync_meta_pages(struct f2fs_sb_info *sbi, enum page_type type,
			long nr_to_write);
void add_ino_entry(struct f2fs_sb_info *sbi, nid_t ino, int type);
void remove_ino_entry(struct f2fs_sb_info *sbi, nid_t ino, int type);
void release_ino_entry(struct f2fs_sb_info *sbi, bool all);
bool exist_written_data(struct f2fs_sb_info *sbi, nid_t ino, int mode);
int f2fs_sync_inode_meta(struct f2fs_sb_info *sbi);
int acquire_orphan_inode(struct f2fs_sb_info *sbi);
void release_orphan_inode(struct f2fs_sb_info *sbi);
void add_orphan_inode(struct inode *inode);
void remove_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino);
int recover_orphan_inodes(struct f2fs_sb_info *sbi);
int get_valid_checkpoint(struct f2fs_sb_info *sbi);
void update_dirty_page(struct inode *inode, struct page *page);
void remove_dirty_inode(struct inode *inode);
int sync_dirty_inodes(struct f2fs_sb_info *sbi, enum inode_type type);
int write_checkpoint(struct f2fs_sb_info *sbi, struct cp_control *cpc);
void init_ino_entry_info(struct f2fs_sb_info *sbi);
2260
int __init create_checkpoint_caches(void);
2261 2262 2263 2264 2265
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
2266 2267 2268
void f2fs_submit_merged_bio(struct f2fs_sb_info *sbi, enum page_type type,
			int rw);
void f2fs_submit_merged_bio_cond(struct f2fs_sb_info *sbi,
2269 2270
				struct inode *inode, nid_t ino, pgoff_t idx,
				enum page_type type, int rw);
2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299
void f2fs_flush_merged_bios(struct f2fs_sb_info *sbi);
int f2fs_submit_page_bio(struct f2fs_io_info *fio);
int f2fs_submit_page_mbio(struct f2fs_io_info *fio);
struct block_device *f2fs_target_device(struct f2fs_sb_info *sbi,
			block_t blk_addr, struct bio *bio);
int f2fs_target_device_index(struct f2fs_sb_info *sbi, block_t blkaddr);
void set_data_blkaddr(struct dnode_of_data *dn);
void f2fs_update_data_blkaddr(struct dnode_of_data *dn, block_t blkaddr);
int reserve_new_blocks(struct dnode_of_data *dn, blkcnt_t count);
int reserve_new_block(struct dnode_of_data *dn);
int f2fs_get_block(struct dnode_of_data *dn, pgoff_t index);
int f2fs_preallocate_blocks(struct kiocb *iocb, struct iov_iter *from);
int f2fs_reserve_block(struct dnode_of_data *dn, pgoff_t index);
struct page *get_read_data_page(struct inode *inode, pgoff_t index,
			int op_flags, bool for_write);
struct page *find_data_page(struct inode *inode, pgoff_t index);
struct page *get_lock_data_page(struct inode *inode, pgoff_t index,
			bool for_write);
struct page *get_new_data_page(struct inode *inode,
			struct page *ipage, pgoff_t index, bool new_i_size);
int do_write_data_page(struct f2fs_io_info *fio);
int f2fs_map_blocks(struct inode *inode, struct f2fs_map_blocks *map,
			int create, int flag);
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
			u64 start, u64 len);
void f2fs_set_page_dirty_nobuffers(struct page *page);
void f2fs_invalidate_page(struct page *page, unsigned int offset,
			unsigned int length);
int f2fs_release_page(struct page *page, gfp_t wait);
2300
#ifdef CONFIG_MIGRATION
2301 2302
int f2fs_migrate_page(struct address_space *mapping, struct page *newpage,
			struct page *page, enum migrate_mode mode);
2303
#endif
2304 2305 2306 2307

/*
 * gc.c
 */
2308 2309 2310 2311 2312
int start_gc_thread(struct f2fs_sb_info *sbi);
void stop_gc_thread(struct f2fs_sb_info *sbi);
block_t start_bidx_of_node(unsigned int node_ofs, struct inode *inode);
int f2fs_gc(struct f2fs_sb_info *sbi, bool sync, bool background);
void build_gc_manager(struct f2fs_sb_info *sbi);
2313 2314 2315 2316

/*
 * recovery.c
 */
2317 2318
int recover_fsync_data(struct f2fs_sb_info *sbi, bool check_only);
bool space_for_roll_forward(struct f2fs_sb_info *sbi);
2319 2320 2321 2322 2323 2324 2325 2326 2327 2328

/*
 * debug.c
 */
#ifdef CONFIG_F2FS_STAT_FS
struct f2fs_stat_info {
	struct list_head stat_list;
	struct f2fs_sb_info *sbi;
	int all_area_segs, sit_area_segs, nat_area_segs, ssa_area_segs;
	int main_area_segs, main_area_sections, main_area_zones;
2329 2330
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
2331
	int ext_tree, zombie_tree, ext_node;
2332 2333
	int ndirty_node, ndirty_dent, ndirty_meta, ndirty_data, ndirty_imeta;
	int inmem_pages;
2334
	unsigned int ndirty_dirs, ndirty_files, ndirty_all;
C
Chao Yu 已提交
2335
	int nats, dirty_nats, sits, dirty_sits, free_nids, alloc_nids;
2336
	int total_count, utilization;
2337
	int bg_gc, nr_wb_cp_data, nr_wb_data, nr_flush, nr_discard;
2338
	int inline_xattr, inline_inode, inline_dir, append, update, orphans;
2339
	int aw_cnt, max_aw_cnt;
2340
	unsigned int valid_count, valid_node_count, valid_inode_count, discard_blks;
2341 2342 2343 2344
	unsigned int bimodal, avg_vblocks;
	int util_free, util_valid, util_invalid;
	int rsvd_segs, overp_segs;
	int dirty_count, node_pages, meta_pages;
2345
	int prefree_count, call_count, cp_count, bg_cp_count;
2346
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
2347
	int bg_node_segs, bg_data_segs;
2348
	int tot_blks, data_blks, node_blks;
2349
	int bg_data_blks, bg_node_blks;
2350 2351 2352 2353 2354 2355
	int curseg[NR_CURSEG_TYPE];
	int cursec[NR_CURSEG_TYPE];
	int curzone[NR_CURSEG_TYPE];

	unsigned int segment_count[2];
	unsigned int block_count[2];
2356
	unsigned int inplace_count;
C
Chao Yu 已提交
2357
	unsigned long long base_mem, cache_mem, page_mem;
2358 2359
};

2360 2361
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2362
	return (struct f2fs_stat_info *)sbi->stat_info;
2363 2364
}

2365
#define stat_inc_cp_count(si)		((si)->cp_count++)
2366
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
2367 2368
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
2369 2370
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
2371 2372 2373 2374
#define stat_inc_total_hit(sbi)		(atomic64_inc(&(sbi)->total_hit_ext))
#define stat_inc_rbtree_node_hit(sbi)	(atomic64_inc(&(sbi)->read_hit_rbtree))
#define stat_inc_largest_node_hit(sbi)	(atomic64_inc(&(sbi)->read_hit_largest))
#define stat_inc_cached_node_hit(sbi)	(atomic64_inc(&(sbi)->read_hit_cached))
C
Chao Yu 已提交
2375 2376 2377 2378 2379 2380 2381 2382 2383 2384
#define stat_inc_inline_xattr(inode)					\
	do {								\
		if (f2fs_has_inline_xattr(inode))			\
			(atomic_inc(&F2FS_I_SB(inode)->inline_xattr));	\
	} while (0)
#define stat_dec_inline_xattr(inode)					\
	do {								\
		if (f2fs_has_inline_xattr(inode))			\
			(atomic_dec(&F2FS_I_SB(inode)->inline_xattr));	\
	} while (0)
2385 2386 2387
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2388
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
2389 2390 2391 2392
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2393
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
2394
	} while (0)
2395 2396 2397
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2398
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
2399 2400 2401 2402
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2403
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
2404
	} while (0)
2405 2406 2407 2408
#define stat_inc_seg_type(sbi, curseg)					\
		((sbi)->segment_count[(curseg)->alloc_type]++)
#define stat_inc_block_count(sbi, curseg)				\
		((sbi)->block_count[(curseg)->alloc_type]++)
2409 2410
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2411
#define stat_inc_atomic_write(inode)					\
2412
		(atomic_inc(&F2FS_I_SB(inode)->aw_cnt))
2413
#define stat_dec_atomic_write(inode)					\
2414
		(atomic_dec(&F2FS_I_SB(inode)->aw_cnt))
2415 2416 2417 2418 2419 2420 2421
#define stat_update_max_atomic_write(inode)				\
	do {								\
		int cur = atomic_read(&F2FS_I_SB(inode)->aw_cnt);	\
		int max = atomic_read(&F2FS_I_SB(inode)->max_aw_cnt);	\
		if (cur > max)						\
			atomic_set(&F2FS_I_SB(inode)->max_aw_cnt, cur);	\
	} while (0)
2422
#define stat_inc_seg_count(sbi, type, gc_type)				\
2423
	do {								\
2424
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2425
		(si)->tot_segs++;					\
2426
		if (type == SUM_TYPE_DATA) {				\
2427
			si->data_segs++;				\
2428 2429
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2430
			si->node_segs++;				\
2431 2432
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2433 2434 2435 2436 2437
	} while (0)

#define stat_inc_tot_blk_count(si, blks)				\
	(si->tot_blks += (blks))

2438
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2439
	do {								\
2440
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2441 2442
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2443
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2444 2445
	} while (0)

2446
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2447
	do {								\
2448
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2449 2450
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2451
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2452 2453
	} while (0)

2454 2455
int f2fs_build_stats(struct f2fs_sb_info *sbi);
void f2fs_destroy_stats(struct f2fs_sb_info *sbi);
2456
int __init f2fs_create_root_stats(void);
2457
void f2fs_destroy_root_stats(void);
2458
#else
2459
#define stat_inc_cp_count(si)
2460
#define stat_inc_bg_cp_count(si)
2461
#define stat_inc_call_count(si)
2462
#define stat_inc_bggc_count(si)
C
Chao Yu 已提交
2463 2464
#define stat_inc_dirty_inode(sbi, type)
#define stat_dec_dirty_inode(sbi, type)
2465
#define stat_inc_total_hit(sb)
2466
#define stat_inc_rbtree_node_hit(sb)
2467 2468
#define stat_inc_largest_node_hit(sbi)
#define stat_inc_cached_node_hit(sbi)
C
Chao Yu 已提交
2469 2470
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
2471 2472
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
2473 2474
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
2475 2476 2477
#define stat_inc_atomic_write(inode)
#define stat_dec_atomic_write(inode)
#define stat_update_max_atomic_write(inode)
2478 2479
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
2480
#define stat_inc_inplace_blocks(sbi)
2481
#define stat_inc_seg_count(sbi, type, gc_type)
2482
#define stat_inc_tot_blk_count(si, blks)
2483 2484
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
2485 2486 2487

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2488
static inline int __init f2fs_create_root_stats(void) { return 0; }
2489
static inline void f2fs_destroy_root_stats(void) { }
2490 2491 2492 2493 2494 2495 2496 2497 2498 2499
#endif

extern const struct file_operations f2fs_dir_operations;
extern const struct file_operations f2fs_file_operations;
extern const struct inode_operations f2fs_file_inode_operations;
extern const struct address_space_operations f2fs_dblock_aops;
extern const struct address_space_operations f2fs_node_aops;
extern const struct address_space_operations f2fs_meta_aops;
extern const struct inode_operations f2fs_dir_inode_operations;
extern const struct inode_operations f2fs_symlink_inode_operations;
2500
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2501
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2502
extern struct kmem_cache *inode_entry_slab;
2503

2504 2505 2506
/*
 * inline.c
 */
2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530
bool f2fs_may_inline_data(struct inode *inode);
bool f2fs_may_inline_dentry(struct inode *inode);
void read_inline_data(struct page *page, struct page *ipage);
bool truncate_inline_inode(struct page *ipage, u64 from);
int f2fs_read_inline_data(struct inode *inode, struct page *page);
int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page);
int f2fs_convert_inline_inode(struct inode *inode);
int f2fs_write_inline_data(struct inode *inode, struct page *page);
bool recover_inline_data(struct inode *inode, struct page *npage);
struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
			struct fscrypt_name *fname, struct page **res_page);
int make_empty_inline_dir(struct inode *inode, struct inode *parent,
			struct page *ipage);
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);
void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
			struct inode *dir, struct inode *inode);
bool f2fs_empty_inline_dir(struct inode *dir);
int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
			struct fscrypt_str *fstr);
int f2fs_inline_data_fiemap(struct inode *inode,
			struct fiemap_extent_info *fieinfo,
			__u64 start, __u64 len);
2531

2532 2533 2534
/*
 * shrinker.c
 */
2535 2536 2537 2538 2539 2540
unsigned long f2fs_shrink_count(struct shrinker *shrink,
			struct shrink_control *sc);
unsigned long f2fs_shrink_scan(struct shrinker *shrink,
			struct shrink_control *sc);
void f2fs_join_shrinker(struct f2fs_sb_info *sbi);
void f2fs_leave_shrinker(struct f2fs_sb_info *sbi);
2541

2542 2543 2544
/*
 * extent_cache.c
 */
2545 2546 2547 2548 2549 2550 2551 2552
unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *sbi, int nr_shrink);
bool f2fs_init_extent_tree(struct inode *inode, struct f2fs_extent *i_ext);
void f2fs_drop_extent_tree(struct inode *inode);
unsigned int f2fs_destroy_extent_node(struct inode *inode);
void f2fs_destroy_extent_tree(struct inode *inode);
bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs,
			struct extent_info *ei);
void f2fs_update_extent_cache(struct dnode_of_data *dn);
C
Chao Yu 已提交
2553
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
2554 2555
			pgoff_t fofs, block_t blkaddr, unsigned int len);
void init_extent_cache_info(struct f2fs_sb_info *sbi);
2556 2557 2558
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2559 2560 2561
/*
 * crypto support
 */
2562
static inline bool f2fs_encrypted_inode(struct inode *inode)
2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575
{
	return file_is_encrypt(inode);
}

static inline void f2fs_set_encrypted_inode(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	file_set_encrypt(inode);
#endif
}

static inline bool f2fs_bio_encrypted(struct bio *bio)
{
2576
	return bio->bi_private != NULL;
2577 2578 2579 2580 2581 2582
}

static inline int f2fs_sb_has_crypto(struct super_block *sb)
{
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_ENCRYPT);
}
2583

2584
static inline int f2fs_sb_mounted_blkzoned(struct super_block *sb)
2585
{
2586
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_BLKZONED);
2587 2588
}

2589 2590
#ifdef CONFIG_BLK_DEV_ZONED
static inline int get_blkz_type(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
2591
			struct block_device *bdev, block_t blkaddr)
2592 2593
{
	unsigned int zno = blkaddr >> sbi->log_blocks_per_blkz;
J
Jaegeuk Kim 已提交
2594
	int i;
2595

J
Jaegeuk Kim 已提交
2596 2597 2598 2599
	for (i = 0; i < sbi->s_ndevs; i++)
		if (FDEV(i).bdev == bdev)
			return FDEV(i).blkz_type[zno];
	return -EINVAL;
2600 2601 2602
}
#endif

2603
static inline bool f2fs_discard_en(struct f2fs_sb_info *sbi)
2604
{
2605 2606 2607
	struct request_queue *q = bdev_get_queue(sbi->sb->s_bdev);

	return blk_queue_discard(q) || f2fs_sb_mounted_blkzoned(sbi->sb);
2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624
}

static inline void set_opt_mode(struct f2fs_sb_info *sbi, unsigned int mt)
{
	clear_opt(sbi, ADAPTIVE);
	clear_opt(sbi, LFS);

	switch (mt) {
	case F2FS_MOUNT_ADAPTIVE:
		set_opt(sbi, ADAPTIVE);
		break;
	case F2FS_MOUNT_LFS:
		set_opt(sbi, LFS);
		break;
	}
}

2625 2626 2627
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2628
	umode_t mode = inode->i_mode;
2629 2630 2631 2632 2633 2634 2635

	return (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode));
#else
	return 0;
#endif
}

2636
#endif