f2fs.h 83.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,
53
	FAULT_TRUNCATE,
C
Chao Yu 已提交
54
	FAULT_IO,
55
	FAULT_CHECKPOINT,
J
Jaegeuk Kim 已提交
56 57 58
	FAULT_MAX,
};

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

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

69 70 71 72 73 74 75 76 77 78
/*
 * 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 已提交
79
#define F2FS_MOUNT_INLINE_XATTR		0x00000080
80
#define F2FS_MOUNT_INLINE_DATA		0x00000100
81 82 83
#define F2FS_MOUNT_INLINE_DENTRY	0x00000200
#define F2FS_MOUNT_FLUSH_MERGE		0x00000400
#define F2FS_MOUNT_NOBARRIER		0x00000800
84
#define F2FS_MOUNT_FASTBOOT		0x00001000
85
#define F2FS_MOUNT_EXTENT_CACHE		0x00002000
86
#define F2FS_MOUNT_FORCE_FG_GC		0x00004000
87
#define F2FS_MOUNT_DATA_FLUSH		0x00008000
88
#define F2FS_MOUNT_FAULT_INJECTION	0x00010000
89 90
#define F2FS_MOUNT_ADAPTIVE		0x00020000
#define F2FS_MOUNT_LFS			0x00040000
91

92 93 94
#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)
95 96 97 98 99

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

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

struct f2fs_mount_info {
	unsigned int	opt;
};

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

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

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

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

136
#define DEF_BATCHED_TRIM_SECTIONS	2048
J
Jaegeuk Kim 已提交
137
#define BATCHED_TRIM_SEGMENTS(sbi)	\
138
		(GET_SEG_FROM_SEC(sbi, SM_I(sbi)->trim_sections))
139 140
#define BATCHED_TRIM_BLOCKS(sbi)	\
		(BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
141 142
#define MAX_DISCARD_BLOCKS(sbi)		BLKS_PER_SEC(sbi)
#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 */
};

C
Chao Yu 已提交
184
/* for the bitmap indicate blocks to be discarded */
185 186
struct discard_entry {
	struct list_head list;	/* list head */
C
Chao Yu 已提交
187 188
	block_t start_blkaddr;	/* start blockaddr of current segment */
	unsigned char discard_map[SIT_VBLOCK_MAP_SIZE];	/* segment discard bitmap */
189 190
};

C
Chao Yu 已提交
191 192 193 194 195
/* max discard pend list number */
#define MAX_PLIST_NUM		512
#define plist_idx(blk_num)	((blk_num) >= MAX_PLIST_NUM ?		\
					(MAX_PLIST_NUM - 1) : (blk_num - 1))

196 197 198 199 200 201
enum {
	D_PREP,
	D_SUBMIT,
	D_DONE,
};

202 203 204 205 206 207
struct discard_info {
	block_t lstart;			/* logical start address */
	block_t len;			/* length */
	block_t start;			/* actual start address in dev */
};

208
struct discard_cmd {
209 210 211 212 213 214 215 216 217 218
	struct rb_node rb_node;		/* rb node located in rb-tree */
	union {
		struct {
			block_t lstart;	/* logical start address */
			block_t len;	/* length */
			block_t start;	/* actual start address in dev */
		};
		struct discard_info di;	/* discard info */

	};
219 220
	struct list_head list;		/* command list */
	struct completion wait;		/* compleation */
221
	struct block_device *bdev;	/* bdev */
222
	int state;			/* state */
223
	int error;			/* bio error */
C
Chao Yu 已提交
224 225
};

226
struct discard_cmd_control {
227
	struct task_struct *f2fs_issue_discard;	/* discard thread */
228
	struct list_head entry_list;		/* 4KB discard entry list */
C
Chao Yu 已提交
229
	struct list_head pend_list[MAX_PLIST_NUM];/* store pending entries */
230
	struct list_head wait_list;		/* store on-flushing entries */
231 232
	wait_queue_head_t discard_wait_queue;	/* waiting queue for wake-up */
	struct mutex cmd_lock;
233
	int nr_discards;			/* # of discards in the list */
234
	int max_discards;			/* max. discards to be issued */
C
Chao Yu 已提交
235
	unsigned int undiscard_blks;		/* # of undiscard blocks */
C
Chao Yu 已提交
236 237
	atomic_t issued_discard;		/* # of issued discard */
	atomic_t issing_discard;		/* # of issing discard */
C
Chao Yu 已提交
238
	atomic_t discard_cmd_cnt;		/* # of cached cmd count */
239
	struct rb_root root;			/* root of discard rb-tree */
C
Chao Yu 已提交
240 241
};

242 243 244 245
/* 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 */
246 247
	block_t blkaddr;	/* block address locating the last fsync */
	block_t last_dentry;	/* block address locating the last dentry */
248 249
};

250 251
#define nats_in_cursum(jnl)		(le16_to_cpu((jnl)->n_nats))
#define sits_in_cursum(jnl)		(le16_to_cpu((jnl)->n_sits))
252

253 254 255 256
#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)
257

258 259
#define MAX_NAT_JENTRIES(jnl)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(jnl))
#define MAX_SIT_JENTRIES(jnl)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(jnl))
260

261
static inline int update_nats_in_cursum(struct f2fs_journal *journal, int i)
262
{
263
	int before = nats_in_cursum(journal);
264

265
	journal->n_nats = cpu_to_le16(before + i);
266 267 268
	return before;
}

269
static inline int update_sits_in_cursum(struct f2fs_journal *journal, int i)
270
{
271
	int before = sits_in_cursum(journal);
272

273
	journal->n_sits = cpu_to_le16(before + i);
274 275 276
	return before;
}

277 278
static inline bool __has_cursum_space(struct f2fs_journal *journal,
							int size, int type)
279 280
{
	if (type == NAT_JOURNAL)
281 282
		return size <= MAX_NAT_JENTRIES(journal);
	return size <= MAX_SIT_JENTRIES(journal);
283 284
}

285 286 287
/*
 * ioctl commands
 */
J
Jaegeuk Kim 已提交
288 289
#define F2FS_IOC_GETFLAGS		FS_IOC_GETFLAGS
#define F2FS_IOC_SETFLAGS		FS_IOC_SETFLAGS
C
Chao Yu 已提交
290
#define F2FS_IOC_GETVERSION		FS_IOC_GETVERSION
J
Jaegeuk Kim 已提交
291 292 293 294

#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)
295
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
296 297
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
298
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
299
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
C
Chao Yu 已提交
300
#define F2FS_IOC_DEFRAGMENT		_IO(F2FS_IOCTL_MAGIC, 8)
301 302
#define F2FS_IOC_MOVE_RANGE		_IOWR(F2FS_IOCTL_MAGIC, 9,	\
						struct f2fs_move_range)
303 304
#define F2FS_IOC_FLUSH_DEVICE		_IOW(F2FS_IOCTL_MAGIC, 10,	\
						struct f2fs_flush_device)
305

306 307 308
#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
309

J
Jaegeuk Kim 已提交
310 311 312 313 314 315 316 317
/*
 * 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 */
318
#define F2FS_GOING_DOWN_METAFLUSH	0x3	/* going down with meta flush */
J
Jaegeuk Kim 已提交
319

320 321 322 323
#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
/*
 * ioctl commands in 32 bit emulation
 */
324 325 326
#define F2FS_IOC32_GETFLAGS		FS_IOC32_GETFLAGS
#define F2FS_IOC32_SETFLAGS		FS_IOC32_SETFLAGS
#define F2FS_IOC32_GETVERSION		FS_IOC32_GETVERSION
327 328
#endif

C
Chao Yu 已提交
329 330 331 332 333
struct f2fs_defragment {
	u64 start;
	u64 len;
};

334 335 336 337 338 339 340
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 */
};

341 342 343 344 345
struct f2fs_flush_device {
	u32 dev_num;		/* device number to flush */
	u32 segments;		/* # of segments to flush */
};

346 347 348
/*
 * For INODE and NODE manager
 */
349 350
/* for directory operations */
struct f2fs_dentry_ptr {
351
	struct inode *inode;
352 353 354 355 356 357
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

358 359
static inline void make_dentry_ptr_block(struct inode *inode,
		struct f2fs_dentry_ptr *d, struct f2fs_dentry_block *t)
360
{
361
	d->inode = inode;
362 363 364 365 366
	d->max = NR_DENTRY_IN_BLOCK;
	d->bitmap = &t->dentry_bitmap;
	d->dentry = t->dentry;
	d->filename = t->filename;
}
367

368 369 370 371 372 373 374 375
static inline void make_dentry_ptr_inline(struct inode *inode,
		struct f2fs_dentry_ptr *d, struct f2fs_inline_dentry *t)
{
	d->inode = inode;
	d->max = NR_INLINE_DENTRY;
	d->bitmap = &t->dentry_bitmap;
	d->dentry = t->dentry;
	d->filename = t->filename;
376 377
}

378 379 380 381 382 383 384
/*
 * 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)
385 386 387 388 389
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 已提交
390
					 * by get_data_block.
391
					 */
392 393
};

394
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
395

396 397
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

398 399 400
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

401
/* for in-memory extent cache entry */
402 403 404 405
#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
406

407 408 409 410 411 412
struct rb_entry {
	struct rb_node rb_node;		/* rb node located in rb-tree */
	unsigned int ofs;		/* start offset of the entry */
	unsigned int len;		/* length of the entry */
};

413
struct extent_info {
414 415
	unsigned int fofs;		/* start offset in a file */
	unsigned int len;		/* length of the extent */
416
	u32 blk;			/* start block address of the extent */
417 418 419
};

struct extent_node {
420 421 422 423 424 425 426 427 428 429
	struct rb_node rb_node;
	union {
		struct {
			unsigned int fofs;
			unsigned int len;
			u32 blk;
		};
		struct extent_info ei;	/* extent info */

	};
430
	struct list_head list;		/* node in global extent list of sbi */
431
	struct extent_tree *et;		/* extent tree pointer */
432 433 434 435 436
};

struct extent_tree {
	nid_t ino;			/* inode number */
	struct rb_root root;		/* root of extent info rb-tree */
437
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
438
	struct extent_info largest;	/* largested extent info */
439
	struct list_head list;		/* to be used by sbi->zombie_list */
440
	rwlock_t lock;			/* protect extent info rb-tree */
441
	atomic_t node_cnt;		/* # of extent node in rb-tree*/
442 443
};

J
Jaegeuk Kim 已提交
444 445 446 447 448 449 450
/*
 * 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)
451 452 453
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
454 455 456 457 458 459

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

C
Chao Yu 已提交
463 464 465 466 467
/* 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
468
#define F2FS_GET_BLOCK_PRE_DIO		4
469
#define F2FS_GET_BLOCK_PRE_AIO		5
C
Chao Yu 已提交
470

471 472 473 474
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
475
#define FADVISE_LOST_PINO_BIT	0x02
476
#define FADVISE_ENCRYPT_BIT	0x04
477
#define FADVISE_ENC_NAME_BIT	0x08
478
#define FADVISE_KEEP_SIZE_BIT	0x10
479

480 481 482 483 484 485
#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)
486 487 488
#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)
489 490
#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)
491 492
#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)
493

494 495
#define DEF_DIR_LEVEL		0

496 497 498 499
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 */
500
	unsigned char i_dir_level;	/* use for dentry level for large dir */
501
	unsigned int i_current_depth;	/* use only in directory structure */
502
	unsigned int i_pino;		/* parent inode number */
503 504 505 506
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
507
	struct rw_semaphore i_sem;	/* protect fi info */
508
	atomic_t dirty_pages;		/* # of dirty pages */
509 510
	f2fs_hash_t chash;		/* hash value of given file name */
	unsigned int clevel;		/* maximum level of given file name */
511
	struct task_struct *task;	/* lookup and create consistency */
512
	nid_t i_xattr_nid;		/* node id that contains xattrs */
513
	loff_t	last_disk_size;		/* lastly written file size */
J
Jaegeuk Kim 已提交
514

515 516
	struct list_head dirty_list;	/* dirty list for dirs and files */
	struct list_head gdirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
517 518
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
J
Jaegeuk Kim 已提交
519
	struct extent_tree *extent_tree;	/* cached extent_tree entry */
520
	struct rw_semaphore dio_rwsem[2];/* avoid racing between dio and gc */
521 522 523
};

static inline void get_extent_info(struct extent_info *ext,
C
Chao Yu 已提交
524
					struct f2fs_extent *i_ext)
525
{
C
Chao Yu 已提交
526 527 528
	ext->fofs = le32_to_cpu(i_ext->fofs);
	ext->blk = le32_to_cpu(i_ext->blk);
	ext->len = le32_to_cpu(i_ext->len);
529 530 531 532 533 534
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	i_ext->fofs = cpu_to_le32(ext->fofs);
535
	i_ext->blk = cpu_to_le32(ext->blk);
536 537 538
	i_ext->len = cpu_to_le32(ext->len);
}

539 540 541 542 543 544 545 546
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;
}

547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564
static inline bool __is_discard_mergeable(struct discard_info *back,
						struct discard_info *front)
{
	return back->lstart + back->len == front->lstart;
}

static inline bool __is_discard_back_mergeable(struct discard_info *cur,
						struct discard_info *back)
{
	return __is_discard_mergeable(back, cur);
}

static inline bool __is_discard_front_mergeable(struct discard_info *cur,
						struct discard_info *front)
{
	return __is_discard_mergeable(cur, front);
}

565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583
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);
}

584
extern void f2fs_mark_inode_dirty_sync(struct inode *inode, bool sync);
585 586
static inline void __try_update_largest_extent(struct inode *inode,
			struct extent_tree *et, struct extent_node *en)
587
{
588
	if (en->ei.len > et->largest.len) {
589
		et->largest = en->ei;
590
		f2fs_mark_inode_dirty_sync(inode, true);
591
	}
592 593
}

C
Chao Yu 已提交
594 595 596 597 598 599
enum nid_list {
	FREE_NID_LIST,
	ALLOC_NID_LIST,
	MAX_NID_LIST,
};

600 601 602
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
603
	nid_t available_nids;		/* # of available node ids */
604
	nid_t next_scan_nid;		/* the next nid to be scanned */
605
	unsigned int ram_thresh;	/* control the memory footprint */
C
Chao Yu 已提交
606
	unsigned int ra_nid_pages;	/* # of nid pages to be readaheaded */
C
Chao Yu 已提交
607
	unsigned int dirty_nats_ratio;	/* control dirty nats ratio threshold */
608 609 610

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
611
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
612
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
613
	struct list_head nat_entries;	/* cached nat entry list (clean) */
614
	unsigned int nat_cnt;		/* the # of cached nat entries */
615
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
616
	unsigned int nat_blocks;	/* # of nat blocks */
617 618

	/* free node ids management */
619
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
C
Chao Yu 已提交
620 621 622
	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 */
623
	struct mutex build_lock;	/* lock for build free nids */
C
Chao Yu 已提交
624 625
	unsigned char (*free_nid_bitmap)[NAT_ENTRY_BITMAP_SIZE];
	unsigned char *nat_block_bitmap;
626
	unsigned short *free_nid_count;	/* free nid count of NAT block */
627 628 629

	/* for checkpoint */
	char *nat_bitmap;		/* NAT bitmap pointer */
630 631 632 633 634

	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 */
635 636 637
#ifdef CONFIG_F2FS_CHECK_FS
	char *nat_bitmap_mir;		/* NAT bitmap mirror */
#endif
638 639 640 641 642 643 644 645 646 647 648 649 650 651 652
	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 */
653
	bool node_changed;		/* is node block changed */
654 655
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
656 657 658 659 660 661
	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)
{
662
	memset(dn, 0, sizeof(*dn));
663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692
	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 */
693
	NO_CHECK_TYPE,
694 695
};

696 697
struct flush_cmd {
	struct completion wait;
698
	struct llist_node llnode;
699 700 701
	int ret;
};

702 703 704
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
C
Chao Yu 已提交
705 706
	atomic_t issued_flush;			/* # of issued flushes */
	atomic_t issing_flush;			/* # of issing flushes */
707 708
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
709 710
};

711 712 713 714 715 716 717 718 719 720 721 722 723 724
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 */
725 726 727

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

J
Jaegeuk Kim 已提交
729 730 731
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

732 733
	struct list_head sit_entry_set;	/* sit entry set list */

734 735
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
736
	unsigned int min_fsync_blocks;	/* threshold for fsync */
737
	unsigned int min_hot_blocks;	/* threshold for hot block allocation */
738 739

	/* for flush command control */
740
	struct flush_cmd_control *fcc_info;
741

742 743
	/* for discard command control */
	struct discard_cmd_control *dcc_info;
744 745 746 747 748 749 750 751 752 753 754
};

/*
 * 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.
 */
755
#define WB_DATA_TYPE(p)	(__is_cp_guaranteed(p) ? F2FS_WB_CP_DATA : F2FS_WB_DATA)
756 757
enum count_type {
	F2FS_DIRTY_DENTS,
758
	F2FS_DIRTY_DATA,
759 760
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
761
	F2FS_INMEM_PAGES,
762
	F2FS_DIRTY_IMETA,
763 764
	F2FS_WB_CP_DATA,
	F2FS_WB_DATA,
765 766 767 768
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
769
 * The below are the page types of bios used in submit_bio().
770 771 772 773 774 775 776 777 778
 * 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.
 */
779
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
780 781 782 783 784 785
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
786 787
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
788
	INMEM_INVALIDATE,
789
	INMEM_REVOKE,
790 791
	IPU,
	OPU,
792 793
};

J
Jaegeuk Kim 已提交
794
struct f2fs_io_info {
795
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
796
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
M
Mike Christie 已提交
797
	int op;			/* contains REQ_OP_ */
798
	int op_flags;		/* req_flag_bits */
799
	block_t new_blkaddr;	/* new block address to be written */
800
	block_t old_blkaddr;	/* old block address before Cow */
801
	struct page *page;	/* page to be written */
802
	struct page *encrypted_page;	/* encrypted page */
803
	bool submitted;		/* indicate IO submission */
804
	bool cp_rwsem_locked;	/* indicate cp_rwsem is held */
J
Jaegeuk Kim 已提交
805 806
};

807
#define is_read_io(rw) ((rw) == READ)
808
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
809
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
810 811
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
812
	struct f2fs_io_info fio;	/* store buffered io info. */
813
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
814 815
};

J
Jaegeuk Kim 已提交
816 817 818 819 820 821 822 823 824 825 826 827 828 829
#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
};

830 831 832
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
833
	DIRTY_META,			/* for all dirtied inode metadata */
834 835 836
	NR_INODE_TYPE,
};

837 838 839 840 841 842 843 844
/* 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 */
};

845 846 847 848 849 850
/* 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 */
851
	SBI_NEED_SB_WRITE,			/* need to recover superblock */
852
	SBI_NEED_CP,				/* need to checkpoint */
853 854
};

855 856
enum {
	CP_TIME,
857
	REQ_TIME,
858 859 860
	MAX_TIME,
};

861 862
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
863
	struct proc_dir_entry *s_proc;		/* proc entry */
864
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
865
	int valid_super_block;			/* valid super block no */
866
	unsigned long s_flag;				/* flags for sbi */
867

868 869 870 871 872
#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

873 874 875 876 877 878
	/* 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 */
879 880

	/* for bio operations */
881
	struct f2fs_bio_info read_io;			/* for read bios */
882
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
883
	struct mutex wio_mutex[NODE + 1];	/* bio ordering for NODE/DATA */
884 885
	int write_io_size_bits;			/* Write IO size bits */
	mempool_t *write_io_dummy;		/* Dummy pages */
886 887 888

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
889
	int cur_cp_pack;			/* remain current cp pack */
890
	spinlock_t cp_lock;			/* for flag in ckpt */
891
	struct inode *meta_inode;		/* cache meta blocks */
892
	struct mutex cp_mutex;			/* checkpoint procedure lock */
893
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
894
	struct rw_semaphore node_write;		/* locking node writes */
895
	struct rw_semaphore node_change;	/* locking node change */
896
	wait_queue_head_t cp_wait;
897 898
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
899

900
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
901 902

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

905 906 907
	/* 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 */
908

909 910
	/* for extent tree cache */
	struct radix_tree_root extent_tree_root;/* cache extent cache entries */
911
	struct mutex extent_tree_lock;	/* locking extent radix tree */
912 913
	struct list_head extent_list;		/* lru list for shrinker */
	spinlock_t extent_lock;			/* locking extent lru list */
914
	atomic_t total_ext_tree;		/* extent tree count */
915
	struct list_head zombie_list;		/* extent zombie tree list */
916
	atomic_t total_zombie_tree;		/* extent zombie tree count */
917 918
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
919
	/* basic filesystem units */
920 921 922 923 924 925 926 927 928 929 930 931 932
	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 已提交
933
	loff_t max_file_blocks;			/* max block index of file */
934
	int active_logs;			/* # of active logs */
935
	int dir_level;				/* directory level */
936 937 938

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
939
	block_t discard_blks;			/* discard command candidats */
940 941
	block_t last_valid_block_count;		/* for recovery */
	u32 s_next_generation;			/* for NFS support */
942 943

	/* # of pages, see count_type */
944
	atomic_t nr_pages[NR_COUNT_TYPE];
945 946
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
947

948 949 950
	/* writeback control */
	atomic_t wb_sync_req;			/* count # of WB_SYNC threads */

951 952 953
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

954 955 956 957 958
	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 */
959
	unsigned int cur_victim_sec;		/* current victim section num */
960

961 962 963
	/* threshold for converting bg victims for fg */
	u64 fggc_threshold;

964 965 966
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

967 968 969 970
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
971
#ifdef CONFIG_F2FS_STAT_FS
972 973 974
	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 */
975
	atomic_t inplace_count;		/* # of inplace update */
976 977 978 979
	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 已提交
980
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
981 982
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
983
	atomic_t aw_cnt;			/* # of atomic writes */
984
	atomic_t vw_cnt;			/* # of volatile writes */
985
	atomic_t max_aw_cnt;			/* max # of atomic writes */
986
	atomic_t max_vw_cnt;			/* max # of volatile writes */
987
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
988
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
989
#endif
990
	spinlock_t stat_lock;			/* lock for stat operations */
991 992 993 994

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
995 996 997

	/* For shrinker support */
	struct list_head s_list;
J
Jaegeuk Kim 已提交
998 999
	int s_ndevs;				/* number of devices */
	struct f2fs_dev_info *devs;		/* for device list */
1000 1001
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
1002 1003 1004 1005

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
1006 1007 1008

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
1009 1010 1011 1012 1013

	/* For fault injection */
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct f2fs_fault_info fault_info;
#endif
1014 1015
};

1016
#ifdef CONFIG_F2FS_FAULT_INJECTION
1017 1018 1019 1020
#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))
1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039
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

1040 1041 1042 1043
/* 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)						 \
1044 1045
(((u64)part_stat_read((s)->sb->s_bdev->bd_part, sectors[1]) -		 \
		(s)->sectors_written_start) >> 1)
1046

1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059
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);
}

1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071
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);
}

1072 1073 1074
/*
 * Inline functions
 */
K
Keith Mok 已提交
1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097
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;
}

1098 1099 1100 1101 1102 1103 1104 1105 1106 1107
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;
}

1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122
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);
}

1123 1124 1125 1126 1127 1128 1129 1130 1131 1132
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);
}

1133 1134 1135 1136 1137
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

1138 1139 1140 1141 1142
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167
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 已提交
1168 1169 1170 1171 1172
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

1173 1174 1175 1176 1177
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1178 1179
static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
{
1180
	return test_bit(type, &sbi->s_flag);
1181 1182 1183
}

static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1184
{
1185
	set_bit(type, &sbi->s_flag);
1186 1187
}

1188
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1189
{
1190
	clear_bit(type, &sbi->s_flag);
1191 1192
}

1193 1194 1195 1196 1197
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

1198 1199 1200 1201 1202 1203
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)));
}

1204
static inline bool __is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
1205 1206
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1207

1208 1209 1210
	return ckpt_flags & f;
}

1211
static inline bool is_set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1212
{
1213 1214 1215 1216 1217 1218 1219 1220
	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);
1221 1222 1223 1224
	ckpt_flags |= f;
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1225
static inline void set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1226
{
1227 1228 1229 1230 1231 1232 1233 1234 1235 1236
	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);
1237 1238 1239 1240
	ckpt_flags &= (~f);
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1241 1242 1243 1244 1245 1246 1247
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);
}

1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268
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;
}

1269
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1270
{
1271
	down_read(&sbi->cp_rwsem);
1272 1273
}

1274
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1275
{
1276
	up_read(&sbi->cp_rwsem);
1277 1278
}

1279
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1280
{
1281
	down_write(&sbi->cp_rwsem);
1282 1283
}

1284
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1285
{
1286
	up_write(&sbi->cp_rwsem);
1287 1288
}

1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306
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)
{
1307 1308
	return (is_set_ckpt_flags(sbi, CP_UMOUNT_FLAG) ||
			is_set_ckpt_flags(sbi, CP_FASTBOOT_FLAG));
1309 1310
}

1311 1312 1313
/*
 * Check whether the given nid is within node id range.
 */
1314
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1315
{
1316 1317
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1318
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1319 1320
		return -EINVAL;
	return 0;
1321 1322 1323 1324 1325 1326 1327 1328 1329 1330
}

#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 已提交
1331
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1332
	else
C
Chris Fries 已提交
1333
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1334 1335
}

1336 1337 1338 1339 1340
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1341
static inline void f2fs_i_blocks_write(struct inode *, blkcnt_t, bool);
1342
static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
1343
				 struct inode *inode, blkcnt_t *count)
1344
{
1345
	blkcnt_t diff;
1346

J
Jaegeuk Kim 已提交
1347
#ifdef CONFIG_F2FS_FAULT_INJECTION
1348 1349
	if (time_to_inject(sbi, FAULT_BLOCK)) {
		f2fs_show_injection_info(FAULT_BLOCK);
J
Jaegeuk Kim 已提交
1350
		return false;
1351
	}
J
Jaegeuk Kim 已提交
1352
#endif
1353 1354 1355 1356 1357 1358
	/*
	 * 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));

1359 1360 1361
	spin_lock(&sbi->stat_lock);
	sbi->total_valid_block_count += (block_t)(*count);
	if (unlikely(sbi->total_valid_block_count > sbi->user_block_count)) {
1362 1363
		diff = sbi->total_valid_block_count - sbi->user_block_count;
		*count -= diff;
1364
		sbi->total_valid_block_count = sbi->user_block_count;
1365 1366
		if (!*count) {
			spin_unlock(&sbi->stat_lock);
1367
			percpu_counter_sub(&sbi->alloc_valid_block_count, diff);
1368 1369
			return false;
		}
1370 1371
	}
	spin_unlock(&sbi->stat_lock);
1372

1373
	f2fs_i_blocks_write(inode, *count, true);
1374 1375 1376
	return true;
}

1377
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1378 1379 1380 1381
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1382 1383
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1384 1385
	sbi->total_valid_block_count -= (block_t)count;
	spin_unlock(&sbi->stat_lock);
1386
	f2fs_i_blocks_write(inode, count, false);
1387 1388 1389 1390
}

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

1393 1394
	if (count_type == F2FS_DIRTY_DATA || count_type == F2FS_INMEM_PAGES ||
		count_type == F2FS_WB_CP_DATA || count_type == F2FS_WB_DATA)
1395 1396
		return;

1397
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1398 1399
}

1400
static inline void inode_inc_dirty_pages(struct inode *inode)
1401
{
1402
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1403 1404
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1405 1406 1407 1408
}

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1409
	atomic_dec(&sbi->nr_pages[count_type]);
1410 1411
}

1412
static inline void inode_dec_dirty_pages(struct inode *inode)
1413
{
1414 1415
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1416 1417
		return;

1418
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1419 1420
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1421 1422
}

1423
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1424
{
1425
	return atomic_read(&sbi->nr_pages[count_type]);
1426 1427
}

1428
static inline int get_dirty_pages(struct inode *inode)
1429
{
1430
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1431 1432
}

1433 1434
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1435
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1436 1437 1438 1439
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1440 1441
}

1442 1443
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1444
	return sbi->total_valid_block_count;
1445 1446
}

1447 1448 1449 1450 1451
static inline block_t discard_blocks(struct f2fs_sb_info *sbi)
{
	return sbi->discard_blks;
}

1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464
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 已提交
1465 1466 1467 1468 1469
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1470 1471 1472
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1473 1474
	int offset;

W
Wanpeng Li 已提交
1475
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1476 1477 1478
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1479
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1480 1481
	} else {
		offset = (flag == NAT_BITMAP) ?
1482
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1483 1484
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1485 1486 1487 1488
}

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

1491
	if (sbi->cur_cp_pack == 2)
1492
		start_addr += sbi->blocks_per_seg;
1493 1494
	return start_addr;
}
1495

1496 1497 1498
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);
1499

1500 1501
	if (sbi->cur_cp_pack == 1)
		start_addr += sbi->blocks_per_seg;
1502 1503 1504
	return start_addr;
}

1505 1506 1507 1508 1509
static inline void __set_cp_next_pack(struct f2fs_sb_info *sbi)
{
	sbi->cur_cp_pack = (sbi->cur_cp_pack == 1) ? 2 : 1;
}

1510 1511 1512 1513 1514 1515
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,
1516
						struct inode *inode)
1517 1518 1519 1520 1521 1522
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1523
	valid_block_count = sbi->total_valid_block_count + 1;
1524
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1525 1526 1527 1528
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1529
	valid_node_count = sbi->total_valid_node_count + 1;
1530
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1531 1532 1533 1534 1535
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1536
		f2fs_i_blocks_write(inode, 1, true);
1537 1538 1539

	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1540 1541
	spin_unlock(&sbi->stat_lock);

1542
	percpu_counter_inc(&sbi->alloc_valid_block_count);
1543 1544 1545 1546
	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1547
						struct inode *inode)
1548 1549 1550
{
	spin_lock(&sbi->stat_lock);

1551 1552 1553
	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);
1554

1555
	f2fs_i_blocks_write(inode, 1, false);
1556 1557
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1558 1559 1560 1561 1562 1563

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1564
	return sbi->total_valid_node_count;
1565 1566 1567 1568
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1569
	percpu_counter_inc(&sbi->total_valid_inode_count);
1570 1571
}

1572
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1573
{
1574
	percpu_counter_dec(&sbi->total_valid_inode_count);
1575 1576
}

1577
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1578
{
1579
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1580 1581
}

1582 1583 1584
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1585 1586
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct page *page = find_lock_page(mapping, index);
1587

1588 1589 1590
	if (page)
		return page;

1591 1592
	if (time_to_inject(F2FS_M_SB(mapping), FAULT_PAGE_ALLOC)) {
		f2fs_show_injection_info(FAULT_PAGE_ALLOC);
1593
		return NULL;
1594
	}
1595
#endif
1596 1597 1598 1599 1600
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1601 1602 1603 1604 1605 1606 1607 1608 1609 1610
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);
}

1611 1612
static inline void f2fs_put_page(struct page *page, int unlock)
{
1613
	if (!page)
1614 1615 1616
		return;

	if (unlock) {
1617
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1618 1619
		unlock_page(page);
	}
1620
	put_page(page);
1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633
}

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,
1634
					size_t size)
1635
{
1636
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1637 1638
}

1639 1640 1641 1642 1643
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1644 1645 1646
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1647 1648 1649
	return entry;
}

J
Jaegeuk Kim 已提交
1650 1651 1652 1653 1654 1655
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1656 1657
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1658 1659 1660
	return bio;
}

1661 1662 1663 1664 1665 1666 1667
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();
}

1668 1669 1670 1671
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1672
	struct f2fs_node *p = F2FS_NODE(page);
1673

1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686
	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;
1687

1688
	raw_node = F2FS_NODE(node_page);
1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701
	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;
}

1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719
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;
}

1720
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731
{
	int mask;
	int ret;

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

1732
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743
{
	int mask;
	int ret;

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

1744 1745 1746 1747 1748 1749 1750 1751 1752
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1753 1754 1755
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1756
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1757
	FI_AUTO_RECOVER,	/* indicate inode is recoverable */
1758
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1759 1760 1761
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1762
	FI_FREE_NID,		/* free allocated nide */
1763
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1764
	FI_INLINE_XATTR,	/* used for inline xattr */
1765
	FI_INLINE_DATA,		/* used for inline data*/
1766
	FI_INLINE_DENTRY,	/* used for inline dentry */
1767 1768
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1769 1770
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
C
Chao Yu 已提交
1771
	FI_ATOMIC_COMMIT,	/* indicate the state of atomical committing */
1772
	FI_VOLATILE_FILE,	/* indicate volatile file */
1773
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1774
	FI_DROP_CACHE,		/* drop dirty page cache */
1775
	FI_DATA_EXIST,		/* indicate data exists */
1776
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1777
	FI_DO_DEFRAG,		/* indicate defragment is running */
1778
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1779
	FI_NO_PREALLOC,		/* indicate skipped preallocated blocks */
1780
	FI_HOT_DATA,		/* indicate file is hot */
1781 1782
};

1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793
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:
1794
		f2fs_mark_inode_dirty_sync(inode, true);
1795 1796 1797
	}
}

1798
static inline void set_inode_flag(struct inode *inode, int flag)
1799
{
1800 1801
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1802
	__mark_inode_dirty_flag(inode, flag, true);
1803 1804
}

1805
static inline int is_inode_flag_set(struct inode *inode, int flag)
1806
{
1807
	return test_bit(flag, &F2FS_I(inode)->flags);
1808 1809
}

1810
static inline void clear_inode_flag(struct inode *inode, int flag)
1811
{
1812 1813
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1814
	__mark_inode_dirty_flag(inode, flag, false);
1815 1816
}

1817
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1818
{
1819 1820
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1821
	f2fs_mark_inode_dirty_sync(inode, false);
1822 1823
}

1824
static inline void f2fs_i_links_write(struct inode *inode, bool inc)
1825
{
1826 1827 1828 1829
	if (inc)
		inc_nlink(inode);
	else
		drop_nlink(inode);
1830
	f2fs_mark_inode_dirty_sync(inode, true);
1831 1832
}

1833 1834 1835
static inline void f2fs_i_blocks_write(struct inode *inode,
					blkcnt_t diff, bool add)
{
1836 1837 1838
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1839 1840
	inode->i_blocks = add ? inode->i_blocks + diff :
				inode->i_blocks - diff;
1841
	f2fs_mark_inode_dirty_sync(inode, true);
1842 1843
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1844 1845
}

1846 1847
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1848 1849 1850
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1851 1852 1853 1854
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
1855
	f2fs_mark_inode_dirty_sync(inode, true);
1856 1857
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1858 1859
}

1860
static inline void f2fs_i_depth_write(struct inode *inode, unsigned int depth)
1861
{
1862
	F2FS_I(inode)->i_current_depth = depth;
1863
	f2fs_mark_inode_dirty_sync(inode, true);
1864 1865
}

1866
static inline void f2fs_i_xnid_write(struct inode *inode, nid_t xnid)
J
Jaegeuk Kim 已提交
1867
{
1868
	F2FS_I(inode)->i_xattr_nid = xnid;
1869
	f2fs_mark_inode_dirty_sync(inode, true);
1870 1871 1872 1873 1874
}

static inline void f2fs_i_pino_write(struct inode *inode, nid_t pino)
{
	F2FS_I(inode)->i_pino = pino;
1875
	f2fs_mark_inode_dirty_sync(inode, true);
1876 1877
}

1878
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1879
{
1880 1881
	struct f2fs_inode_info *fi = F2FS_I(inode);

J
Jaegeuk Kim 已提交
1882
	if (ri->i_inline & F2FS_INLINE_XATTR)
1883
		set_bit(FI_INLINE_XATTR, &fi->flags);
1884
	if (ri->i_inline & F2FS_INLINE_DATA)
1885
		set_bit(FI_INLINE_DATA, &fi->flags);
1886
	if (ri->i_inline & F2FS_INLINE_DENTRY)
1887
		set_bit(FI_INLINE_DENTRY, &fi->flags);
1888
	if (ri->i_inline & F2FS_DATA_EXIST)
1889
		set_bit(FI_DATA_EXIST, &fi->flags);
1890
	if (ri->i_inline & F2FS_INLINE_DOTS)
1891
		set_bit(FI_INLINE_DOTS, &fi->flags);
J
Jaegeuk Kim 已提交
1892 1893
}

1894
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1895 1896 1897
{
	ri->i_inline = 0;

1898
	if (is_inode_flag_set(inode, FI_INLINE_XATTR))
J
Jaegeuk Kim 已提交
1899
		ri->i_inline |= F2FS_INLINE_XATTR;
1900
	if (is_inode_flag_set(inode, FI_INLINE_DATA))
1901
		ri->i_inline |= F2FS_INLINE_DATA;
1902
	if (is_inode_flag_set(inode, FI_INLINE_DENTRY))
1903
		ri->i_inline |= F2FS_INLINE_DENTRY;
1904
	if (is_inode_flag_set(inode, FI_DATA_EXIST))
1905
		ri->i_inline |= F2FS_DATA_EXIST;
1906
	if (is_inode_flag_set(inode, FI_INLINE_DOTS))
1907
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1908 1909
}

1910 1911
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
1912
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
1913 1914
}

1915
static inline unsigned int addrs_per_inode(struct inode *inode)
1916
{
1917
	if (f2fs_has_inline_xattr(inode))
1918 1919 1920 1921
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1922 1923
static inline void *inline_xattr_addr(struct page *page)
{
1924
	struct f2fs_inode *ri = F2FS_INODE(page);
1925

J
Jaegeuk Kim 已提交
1926 1927 1928 1929 1930 1931
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1932
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1933 1934 1935 1936 1937
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1938 1939
static inline int f2fs_has_inline_data(struct inode *inode)
{
1940
	return is_inode_flag_set(inode, FI_INLINE_DATA);
1941 1942
}

1943 1944
static inline int f2fs_exist_data(struct inode *inode)
{
1945
	return is_inode_flag_set(inode, FI_DATA_EXIST);
1946 1947
}

1948 1949
static inline int f2fs_has_inline_dots(struct inode *inode)
{
1950
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
1951 1952
}

J
Jaegeuk Kim 已提交
1953 1954
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
1955
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
1956 1957
}

C
Chao Yu 已提交
1958 1959 1960 1961 1962
static inline bool f2fs_is_commit_atomic_write(struct inode *inode)
{
	return is_inode_flag_set(inode, FI_ATOMIC_COMMIT);
}

1963 1964
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
1965
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
1966 1967
}

1968 1969
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
1970
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
1971 1972
}

1973 1974
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
1975
	return is_inode_flag_set(inode, FI_DROP_CACHE);
1976 1977
}

1978 1979
static inline void *inline_data_addr(struct page *page)
{
1980
	struct f2fs_inode *ri = F2FS_INODE(page);
1981

1982 1983 1984
	return (void *)&(ri->i_addr[1]);
}

1985 1986
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
1987
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
1988 1989
}

1990 1991 1992 1993 1994 1995
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1996 1997 1998 1999 2000 2001 2002 2003
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;
2004
	f2fs_mark_inode_dirty_sync(inode, true);
2005 2006 2007 2008 2009
}

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

2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028
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);
2029 2030
}

J
Jaegeuk Kim 已提交
2031 2032 2033 2034 2035
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

2036 2037
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
2038
	return is_set_ckpt_flags(sbi, CP_ERROR_FLAG);
2039 2040
}

2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051
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 已提交
2052 2053 2054
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
2055
			is_inode_flag_set(inode, FI_NO_EXTENT))
J
Jaegeuk Kim 已提交
2056 2057
		return false;

A
Al Viro 已提交
2058
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
2059 2060
}

2061 2062
static inline void *f2fs_kmalloc(struct f2fs_sb_info *sbi,
					size_t size, gfp_t flags)
2063
{
J
Jaegeuk Kim 已提交
2064
#ifdef CONFIG_F2FS_FAULT_INJECTION
2065 2066
	if (time_to_inject(sbi, FAULT_KMALLOC)) {
		f2fs_show_injection_info(FAULT_KMALLOC);
J
Jaegeuk Kim 已提交
2067
		return NULL;
2068
	}
J
Jaegeuk Kim 已提交
2069
#endif
2070 2071 2072
	return kmalloc(size, flags);
}

2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092
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;
}

2093
#define get_inode_mode(i) \
2094
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
2095 2096
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

2097 2098 2099
/*
 * file.c
 */
2100 2101 2102 2103
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);
2104 2105
int f2fs_getattr(const struct path *path, struct kstat *stat,
			u32 request_mask, unsigned int flags);
2106 2107 2108 2109 2110
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);
2111 2112 2113 2114

/*
 * inode.c
 */
2115 2116 2117 2118 2119 2120 2121 2122 2123
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);
2124 2125 2126 2127 2128 2129 2130 2131 2132

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

/*
 * dir.c
 */
2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171
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);
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);
2172

2173 2174
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
2175
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
2176
				inode, inode->i_ino, inode->i_mode);
2177 2178
}

2179 2180 2181
/*
 * super.c
 */
2182 2183 2184 2185
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);
2186
extern __printf(3, 4)
2187
void f2fs_msg(struct super_block *sb, const char *level, const char *fmt, ...);
2188
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
2189 2190 2191 2192

/*
 * hash.c
 */
2193
f2fs_hash_t f2fs_dentry_hash(const struct qstr *name_info);
2194 2195 2196 2197 2198 2199 2200

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

2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221
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);
2222
void build_free_nids(struct f2fs_sb_info *sbi, bool sync, bool mount);
2223 2224 2225 2226 2227
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);
2228
int recover_xattr_data(struct inode *inode, struct page *page,
2229 2230 2231 2232
			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);
2233
void flush_nat_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc);
2234 2235
int build_node_manager(struct f2fs_sb_info *sbi);
void destroy_node_manager(struct f2fs_sb_info *sbi);
2236
int __init create_node_manager_caches(void);
2237 2238 2239 2240 2241
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
2242 2243
void register_inmem_page(struct inode *inode, struct page *page);
void drop_inmem_pages(struct inode *inode);
2244
void drop_inmem_page(struct inode *inode, struct page *page);
2245 2246 2247 2248 2249 2250 2251 2252 2253
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);
C
Chao Yu 已提交
2254
void f2fs_wait_discard_bios(struct f2fs_sb_info *sbi);
2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265
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);
2266
int rewrite_data_page(struct f2fs_io_info *fio);
2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287
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);
2288 2289
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
2290 2291 2292 2293

/*
 * checkpoint.c
 */
2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319
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);
2320
int __init create_checkpoint_caches(void);
2321 2322 2323 2324 2325
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
2326 2327 2328
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,
2329 2330
				struct inode *inode, nid_t ino, pgoff_t idx,
				enum page_type type, int rw);
2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359
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);
2360
#ifdef CONFIG_MIGRATION
2361 2362
int f2fs_migrate_page(struct address_space *mapping, struct page *newpage,
			struct page *page, enum migrate_mode mode);
2363
#endif
2364 2365 2366 2367

/*
 * gc.c
 */
2368 2369 2370
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);
2371 2372
int f2fs_gc(struct f2fs_sb_info *sbi, bool sync, bool background,
			unsigned int segno);
2373
void build_gc_manager(struct f2fs_sb_info *sbi);
2374 2375 2376 2377

/*
 * recovery.c
 */
2378 2379
int recover_fsync_data(struct f2fs_sb_info *sbi, bool check_only);
bool space_for_roll_forward(struct f2fs_sb_info *sbi);
2380 2381 2382 2383 2384 2385 2386 2387 2388 2389

/*
 * 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;
2390 2391
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
2392
	int ext_tree, zombie_tree, ext_node;
2393 2394
	int ndirty_node, ndirty_dent, ndirty_meta, ndirty_data, ndirty_imeta;
	int inmem_pages;
2395
	unsigned int ndirty_dirs, ndirty_files, ndirty_all;
C
Chao Yu 已提交
2396
	int nats, dirty_nats, sits, dirty_sits, free_nids, alloc_nids;
2397
	int total_count, utilization;
C
Chao Yu 已提交
2398 2399
	int bg_gc, nr_wb_cp_data, nr_wb_data;
	int nr_flushing, nr_flushed, nr_discarding, nr_discarded;
C
Chao Yu 已提交
2400
	int nr_discard_cmd;
C
Chao Yu 已提交
2401
	unsigned int undiscard_blks;
2402
	int inline_xattr, inline_inode, inline_dir, append, update, orphans;
2403
	int aw_cnt, max_aw_cnt, vw_cnt, max_vw_cnt;
2404
	unsigned int valid_count, valid_node_count, valid_inode_count, discard_blks;
2405 2406 2407 2408
	unsigned int bimodal, avg_vblocks;
	int util_free, util_valid, util_invalid;
	int rsvd_segs, overp_segs;
	int dirty_count, node_pages, meta_pages;
2409
	int prefree_count, call_count, cp_count, bg_cp_count;
2410
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
2411
	int bg_node_segs, bg_data_segs;
2412
	int tot_blks, data_blks, node_blks;
2413
	int bg_data_blks, bg_node_blks;
2414 2415 2416 2417 2418 2419
	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];
2420
	unsigned int inplace_count;
C
Chao Yu 已提交
2421
	unsigned long long base_mem, cache_mem, page_mem;
2422 2423
};

2424 2425
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2426
	return (struct f2fs_stat_info *)sbi->stat_info;
2427 2428
}

2429
#define stat_inc_cp_count(si)		((si)->cp_count++)
2430
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
2431 2432
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
2433 2434
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
2435 2436 2437 2438
#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 已提交
2439 2440 2441 2442 2443 2444 2445 2446 2447 2448
#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)
2449 2450 2451
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2452
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
2453 2454 2455 2456
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2457
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
2458
	} while (0)
2459 2460 2461
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2462
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
2463 2464 2465 2466
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2467
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
2468
	} while (0)
2469 2470 2471 2472
#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]++)
2473 2474
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2475
#define stat_inc_atomic_write(inode)					\
2476
		(atomic_inc(&F2FS_I_SB(inode)->aw_cnt))
2477
#define stat_dec_atomic_write(inode)					\
2478
		(atomic_dec(&F2FS_I_SB(inode)->aw_cnt))
2479 2480 2481 2482 2483 2484 2485
#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)
2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496
#define stat_inc_volatile_write(inode)					\
		(atomic_inc(&F2FS_I_SB(inode)->vw_cnt))
#define stat_dec_volatile_write(inode)					\
		(atomic_dec(&F2FS_I_SB(inode)->vw_cnt))
#define stat_update_max_volatile_write(inode)				\
	do {								\
		int cur = atomic_read(&F2FS_I_SB(inode)->vw_cnt);	\
		int max = atomic_read(&F2FS_I_SB(inode)->max_vw_cnt);	\
		if (cur > max)						\
			atomic_set(&F2FS_I_SB(inode)->max_vw_cnt, cur);	\
	} while (0)
2497
#define stat_inc_seg_count(sbi, type, gc_type)				\
2498
	do {								\
2499
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2500 2501
		si->tot_segs++;						\
		if ((type) == SUM_TYPE_DATA) {				\
2502
			si->data_segs++;				\
2503 2504
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2505
			si->node_segs++;				\
2506 2507
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2508 2509 2510
	} while (0)

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

2513
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2514
	do {								\
2515
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2516 2517
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2518
		si->bg_data_blks += ((gc_type) == BG_GC) ? (blks) : 0;	\
2519 2520
	} while (0)

2521
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2522
	do {								\
2523
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2524 2525
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2526
		si->bg_node_blks += ((gc_type) == BG_GC) ? (blks) : 0;	\
2527 2528
	} while (0)

2529 2530
int f2fs_build_stats(struct f2fs_sb_info *sbi);
void f2fs_destroy_stats(struct f2fs_sb_info *sbi);
2531
int __init f2fs_create_root_stats(void);
2532
void f2fs_destroy_root_stats(void);
2533
#else
2534
#define stat_inc_cp_count(si)
2535
#define stat_inc_bg_cp_count(si)
2536
#define stat_inc_call_count(si)
2537
#define stat_inc_bggc_count(si)
C
Chao Yu 已提交
2538 2539
#define stat_inc_dirty_inode(sbi, type)
#define stat_dec_dirty_inode(sbi, type)
2540
#define stat_inc_total_hit(sb)
2541
#define stat_inc_rbtree_node_hit(sb)
2542 2543
#define stat_inc_largest_node_hit(sbi)
#define stat_inc_cached_node_hit(sbi)
C
Chao Yu 已提交
2544 2545
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
2546 2547
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
2548 2549
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
2550 2551 2552
#define stat_inc_atomic_write(inode)
#define stat_dec_atomic_write(inode)
#define stat_update_max_atomic_write(inode)
2553 2554 2555
#define stat_inc_volatile_write(inode)
#define stat_dec_volatile_write(inode)
#define stat_update_max_volatile_write(inode)
2556 2557
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
2558
#define stat_inc_inplace_blocks(sbi)
2559
#define stat_inc_seg_count(sbi, type, gc_type)
2560
#define stat_inc_tot_blk_count(si, blks)
2561 2562
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
2563 2564 2565

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2566
static inline int __init f2fs_create_root_stats(void) { return 0; }
2567
static inline void f2fs_destroy_root_stats(void) { }
2568 2569 2570 2571 2572 2573 2574 2575 2576 2577
#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;
2578
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2579
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2580
extern struct kmem_cache *inode_entry_slab;
2581

2582 2583 2584
/*
 * inline.c
 */
2585 2586 2587
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);
2588
void truncate_inline_inode(struct inode *inode, struct page *ipage, u64 from);
2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608
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);
2609

2610 2611 2612
/*
 * shrinker.c
 */
2613 2614 2615 2616 2617 2618
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);
2619

2620 2621 2622
/*
 * extent_cache.c
 */
2623 2624 2625 2626 2627 2628 2629 2630 2631 2632
struct rb_entry *__lookup_rb_tree(struct rb_root *root,
				struct rb_entry *cached_re, unsigned int ofs);
struct rb_node **__lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi,
				struct rb_root *root, struct rb_node **parent,
				unsigned int ofs);
struct rb_entry *__lookup_rb_tree_ret(struct rb_root *root,
		struct rb_entry *cached_re, unsigned int ofs,
		struct rb_entry **prev_entry, struct rb_entry **next_entry,
		struct rb_node ***insert_p, struct rb_node **insert_parent,
		bool force);
2633 2634
bool __check_rb_tree_consistence(struct f2fs_sb_info *sbi,
						struct rb_root *root);
2635 2636 2637 2638 2639 2640 2641 2642
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 已提交
2643
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
2644 2645
			pgoff_t fofs, block_t blkaddr, unsigned int len);
void init_extent_cache_info(struct f2fs_sb_info *sbi);
2646 2647 2648
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2649 2650 2651
/*
 * crypto support
 */
2652
static inline bool f2fs_encrypted_inode(struct inode *inode)
2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665
{
	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)
{
2666
	return bio->bi_private != NULL;
2667 2668 2669 2670 2671 2672
}

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

2674
static inline int f2fs_sb_mounted_blkzoned(struct super_block *sb)
2675
{
2676
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_BLKZONED);
2677 2678
}

2679 2680
#ifdef CONFIG_BLK_DEV_ZONED
static inline int get_blkz_type(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
2681
			struct block_device *bdev, block_t blkaddr)
2682 2683
{
	unsigned int zno = blkaddr >> sbi->log_blocks_per_blkz;
J
Jaegeuk Kim 已提交
2684
	int i;
2685

J
Jaegeuk Kim 已提交
2686 2687 2688 2689
	for (i = 0; i < sbi->s_ndevs; i++)
		if (FDEV(i).bdev == bdev)
			return FDEV(i).blkz_type[zno];
	return -EINVAL;
2690 2691 2692
}
#endif

2693
static inline bool f2fs_discard_en(struct f2fs_sb_info *sbi)
2694
{
2695 2696 2697
	struct request_queue *q = bdev_get_queue(sbi->sb->s_bdev);

	return blk_queue_discard(q) || f2fs_sb_mounted_blkzoned(sbi->sb);
2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714
}

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

2715 2716 2717
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2718
	umode_t mode = inode->i_mode;
2719 2720 2721 2722 2723 2724 2725

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

2726
#endif