f2fs.h 85.8 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>
C
Chao Yu 已提交
25
#include <linux/quotaops.h>
26 27 28 29 30
#ifdef CONFIG_F2FS_FS_ENCRYPTION
#include <linux/fscrypt_supp.h>
#else
#include <linux/fscrypt_notsupp.h>
#endif
K
Keith Mok 已提交
31
#include <crypto/hash.h>
32

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

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

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

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

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

95 96 97
#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)
98 99 100 101 102

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

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

struct f2fs_mount_info {
	unsigned int	opt;
};

113
#define F2FS_FEATURE_ENCRYPT	0x0001
114
#define F2FS_FEATURE_BLKZONED	0x0002
115

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

123 124 125 126 127 128 129 130
/*
 * For checkpoint manager
 */
enum {
	NAT_BITMAP,
	SIT_BITMAP
};

131 132 133 134 135
#define	CP_UMOUNT	0x00000001
#define	CP_FASTBOOT	0x00000002
#define	CP_SYNC		0x00000004
#define	CP_RECOVERY	0x00000008
#define	CP_DISCARD	0x00000010
136
#define CP_TRIMMED	0x00000020
137

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

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

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

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

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

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

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

C
Chao Yu 已提交
193 194 195 196 197
/* 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))

198 199 200 201 202 203
enum {
	D_PREP,
	D_SUBMIT,
	D_DONE,
};

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

210
struct discard_cmd {
211 212 213 214 215 216 217 218 219 220
	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 */

	};
221 222
	struct list_head list;		/* command list */
	struct completion wait;		/* compleation */
223
	struct block_device *bdev;	/* bdev */
224
	unsigned short ref;		/* reference count */
225
	unsigned char state;		/* state */
226
	int error;			/* bio error */
C
Chao Yu 已提交
227 228
};

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

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

253 254
#define nats_in_cursum(jnl)		(le16_to_cpu((jnl)->n_nats))
#define sits_in_cursum(jnl)		(le16_to_cpu((jnl)->n_sits))
255

256 257 258 259
#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)
260

261 262
#define MAX_NAT_JENTRIES(jnl)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(jnl))
#define MAX_SIT_JENTRIES(jnl)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(jnl))
263

264
static inline int update_nats_in_cursum(struct f2fs_journal *journal, int i)
265
{
266
	int before = nats_in_cursum(journal);
267

268
	journal->n_nats = cpu_to_le16(before + i);
269 270 271
	return before;
}

272
static inline int update_sits_in_cursum(struct f2fs_journal *journal, int i)
273
{
274
	int before = sits_in_cursum(journal);
275

276
	journal->n_sits = cpu_to_le16(before + i);
277 278 279
	return before;
}

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

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

#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)
298
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
299 300
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
J
Jaegeuk Kim 已提交
301
#define F2FS_IOC_GARBAGE_COLLECT	_IOW(F2FS_IOCTL_MAGIC, 6, __u32)
302
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
J
Jaegeuk Kim 已提交
303 304
#define F2FS_IOC_DEFRAGMENT		_IOWR(F2FS_IOCTL_MAGIC, 8,	\
						struct f2fs_defragment)
305 306
#define F2FS_IOC_MOVE_RANGE		_IOWR(F2FS_IOCTL_MAGIC, 9,	\
						struct f2fs_move_range)
307 308
#define F2FS_IOC_FLUSH_DEVICE		_IOW(F2FS_IOCTL_MAGIC, 10,	\
						struct f2fs_flush_device)
309 310
#define F2FS_IOC_GARBAGE_COLLECT_RANGE	_IOW(F2FS_IOCTL_MAGIC, 11,	\
						struct f2fs_gc_range)
311

312 313 314
#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
315

J
Jaegeuk Kim 已提交
316 317 318 319 320 321 322 323
/*
 * 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 */
324
#define F2FS_GOING_DOWN_METAFLUSH	0x3	/* going down with meta flush */
J
Jaegeuk Kim 已提交
325

326 327 328 329
#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
/*
 * ioctl commands in 32 bit emulation
 */
330 331 332
#define F2FS_IOC32_GETFLAGS		FS_IOC32_GETFLAGS
#define F2FS_IOC32_SETFLAGS		FS_IOC32_SETFLAGS
#define F2FS_IOC32_GETVERSION		FS_IOC32_GETVERSION
333 334
#endif

335 336 337 338 339 340
struct f2fs_gc_range {
	u32 sync;
	u64 start;
	u64 len;
};

C
Chao Yu 已提交
341 342 343 344 345
struct f2fs_defragment {
	u64 start;
	u64 len;
};

346 347 348 349 350 351 352
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 */
};

353 354 355 356 357
struct f2fs_flush_device {
	u32 dev_num;		/* device number to flush */
	u32 segments;		/* # of segments to flush */
};

358 359 360
/*
 * For INODE and NODE manager
 */
361 362
/* for directory operations */
struct f2fs_dentry_ptr {
363
	struct inode *inode;
364 365 366 367 368 369
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

370 371
static inline void make_dentry_ptr_block(struct inode *inode,
		struct f2fs_dentry_ptr *d, struct f2fs_dentry_block *t)
372
{
373
	d->inode = inode;
374 375 376 377 378
	d->max = NR_DENTRY_IN_BLOCK;
	d->bitmap = &t->dentry_bitmap;
	d->dentry = t->dentry;
	d->filename = t->filename;
}
379

380 381 382 383 384 385 386 387
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;
388 389
}

390 391 392 393 394 395 396
/*
 * 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)
397 398 399 400 401
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 已提交
402
					 * by get_data_block.
403
					 */
404 405
};

406
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
407

408 409
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

410 411 412
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

413
/* for in-memory extent cache entry */
414 415 416 417
#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
418

419 420 421 422 423 424
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 */
};

425
struct extent_info {
426 427
	unsigned int fofs;		/* start offset in a file */
	unsigned int len;		/* length of the extent */
428
	u32 blk;			/* start block address of the extent */
429 430 431
};

struct extent_node {
432 433 434 435 436 437 438 439 440 441
	struct rb_node rb_node;
	union {
		struct {
			unsigned int fofs;
			unsigned int len;
			u32 blk;
		};
		struct extent_info ei;	/* extent info */

	};
442
	struct list_head list;		/* node in global extent list of sbi */
443
	struct extent_tree *et;		/* extent tree pointer */
444 445 446 447 448
};

struct extent_tree {
	nid_t ino;			/* inode number */
	struct rb_root root;		/* root of extent info rb-tree */
449
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
450
	struct extent_info largest;	/* largested extent info */
451
	struct list_head list;		/* to be used by sbi->zombie_list */
452
	rwlock_t lock;			/* protect extent info rb-tree */
453
	atomic_t node_cnt;		/* # of extent node in rb-tree*/
454 455
};

J
Jaegeuk Kim 已提交
456 457 458 459 460 461 462
/*
 * 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)
463 464 465
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
466 467 468 469 470 471

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

C
Chao Yu 已提交
475 476 477 478 479
/* 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
480
#define F2FS_GET_BLOCK_PRE_DIO		4
481
#define F2FS_GET_BLOCK_PRE_AIO		5
C
Chao Yu 已提交
482

483 484 485 486
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
487
#define FADVISE_LOST_PINO_BIT	0x02
488
#define FADVISE_ENCRYPT_BIT	0x04
489
#define FADVISE_ENC_NAME_BIT	0x08
490
#define FADVISE_KEEP_SIZE_BIT	0x10
491

492 493 494 495 496 497
#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)
498 499 500
#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)
501 502
#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)
503 504
#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)
505

506 507
#define DEF_DIR_LEVEL		0

508 509 510 511
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 */
512
	unsigned char i_dir_level;	/* use for dentry level for large dir */
513
	unsigned int i_current_depth;	/* use only in directory structure */
514
	unsigned int i_pino;		/* parent inode number */
515 516 517 518
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
519
	struct rw_semaphore i_sem;	/* protect fi info */
520
	atomic_t dirty_pages;		/* # of dirty pages */
521 522
	f2fs_hash_t chash;		/* hash value of given file name */
	unsigned int clevel;		/* maximum level of given file name */
523
	struct task_struct *task;	/* lookup and create consistency */
524
	nid_t i_xattr_nid;		/* node id that contains xattrs */
525
	loff_t	last_disk_size;		/* lastly written file size */
J
Jaegeuk Kim 已提交
526

C
Chao Yu 已提交
527 528 529 530 531 532
#ifdef CONFIG_QUOTA
	struct dquot *i_dquot[MAXQUOTAS];

	/* quota space reservation, managed internally by quota code */
	qsize_t i_reserved_quota;
#endif
533 534
	struct list_head dirty_list;	/* dirty list for dirs and files */
	struct list_head gdirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
535 536
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
J
Jaegeuk Kim 已提交
537
	struct extent_tree *extent_tree;	/* cached extent_tree entry */
538
	struct rw_semaphore dio_rwsem[2];/* avoid racing between dio and gc */
539
	struct rw_semaphore i_mmap_sem;
540 541 542
};

static inline void get_extent_info(struct extent_info *ext,
C
Chao Yu 已提交
543
					struct f2fs_extent *i_ext)
544
{
C
Chao Yu 已提交
545 546 547
	ext->fofs = le32_to_cpu(i_ext->fofs);
	ext->blk = le32_to_cpu(i_ext->blk);
	ext->len = le32_to_cpu(i_ext->len);
548 549 550 551 552 553
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	i_ext->fofs = cpu_to_le32(ext->fofs);
554
	i_ext->blk = cpu_to_le32(ext->blk);
555 556 557
	i_ext->len = cpu_to_le32(ext->len);
}

558 559 560 561 562 563 564 565
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;
}

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

584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602
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);
}

603
extern void f2fs_mark_inode_dirty_sync(struct inode *inode, bool sync);
604 605
static inline void __try_update_largest_extent(struct inode *inode,
			struct extent_tree *et, struct extent_node *en)
606
{
607
	if (en->ei.len > et->largest.len) {
608
		et->largest = en->ei;
609
		f2fs_mark_inode_dirty_sync(inode, true);
610
	}
611 612
}

C
Chao Yu 已提交
613 614 615 616 617 618
enum nid_list {
	FREE_NID_LIST,
	ALLOC_NID_LIST,
	MAX_NID_LIST,
};

619 620 621
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
622
	nid_t available_nids;		/* # of available node ids */
623
	nid_t next_scan_nid;		/* the next nid to be scanned */
624
	unsigned int ram_thresh;	/* control the memory footprint */
C
Chao Yu 已提交
625
	unsigned int ra_nid_pages;	/* # of nid pages to be readaheaded */
C
Chao Yu 已提交
626
	unsigned int dirty_nats_ratio;	/* control dirty nats ratio threshold */
627 628 629

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
630
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
631
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
632
	struct list_head nat_entries;	/* cached nat entry list (clean) */
633
	unsigned int nat_cnt;		/* the # of cached nat entries */
634
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
635
	unsigned int nat_blocks;	/* # of nat blocks */
636 637

	/* free node ids management */
638
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
C
Chao Yu 已提交
639 640 641
	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 */
642
	struct mutex build_lock;	/* lock for build free nids */
C
Chao Yu 已提交
643 644
	unsigned char (*free_nid_bitmap)[NAT_ENTRY_BITMAP_SIZE];
	unsigned char *nat_block_bitmap;
645
	unsigned short *free_nid_count;	/* free nid count of NAT block */
646 647 648

	/* for checkpoint */
	char *nat_bitmap;		/* NAT bitmap pointer */
649 650 651 652 653

	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 */
654 655 656
#ifdef CONFIG_F2FS_CHECK_FS
	char *nat_bitmap_mir;		/* NAT bitmap mirror */
#endif
657 658 659 660 661 662 663 664 665 666 667 668 669 670 671
	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 */
672
	bool node_changed;		/* is node block changed */
673 674
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
675 676 677 678 679 680
	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)
{
681
	memset(dn, 0, sizeof(*dn));
682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711
	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 */
712
	NO_CHECK_TYPE,
713 714
};

715 716
struct flush_cmd {
	struct completion wait;
717
	struct llist_node llnode;
718 719 720
	int ret;
};

721 722 723
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 已提交
724 725
	atomic_t issued_flush;			/* # of issued flushes */
	atomic_t issing_flush;			/* # of issing flushes */
726 727
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
728 729
};

730 731 732 733 734 735 736 737 738 739 740 741 742 743
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 */
744 745 746

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

J
Jaegeuk Kim 已提交
748 749 750
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

751 752
	struct list_head sit_entry_set;	/* sit entry set list */

753 754
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
755
	unsigned int min_fsync_blocks;	/* threshold for fsync */
756
	unsigned int min_hot_blocks;	/* threshold for hot block allocation */
757 758

	/* for flush command control */
759
	struct flush_cmd_control *fcc_info;
760

761 762
	/* for discard command control */
	struct discard_cmd_control *dcc_info;
763 764 765 766 767 768 769 770 771 772 773
};

/*
 * 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.
 */
774
#define WB_DATA_TYPE(p)	(__is_cp_guaranteed(p) ? F2FS_WB_CP_DATA : F2FS_WB_DATA)
775 776
enum count_type {
	F2FS_DIRTY_DENTS,
777
	F2FS_DIRTY_DATA,
778 779
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
780
	F2FS_INMEM_PAGES,
781
	F2FS_DIRTY_IMETA,
782 783
	F2FS_WB_CP_DATA,
	F2FS_WB_DATA,
784 785 786 787
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
788
 * The below are the page types of bios used in submit_bio().
789 790 791 792 793 794 795 796 797
 * 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.
 */
798
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
799 800 801 802 803 804
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
805 806
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
807
	INMEM_INVALIDATE,
808
	INMEM_REVOKE,
809 810
	IPU,
	OPU,
811 812
};

J
Jaegeuk Kim 已提交
813 814 815 816 817 818 819
enum temp_type {
	HOT = 0,	/* must be zero for meta bio */
	WARM,
	COLD,
	NR_TEMP_TYPE,
};

820 821 822 823 824 825
enum need_lock_type {
	LOCK_REQ = 0,
	LOCK_DONE,
	LOCK_RETRY,
};

J
Jaegeuk Kim 已提交
826
struct f2fs_io_info {
827
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
828
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
J
Jaegeuk Kim 已提交
829
	enum temp_type temp;	/* contains HOT/WARM/COLD */
M
Mike Christie 已提交
830
	int op;			/* contains REQ_OP_ */
831
	int op_flags;		/* req_flag_bits */
832
	block_t new_blkaddr;	/* new block address to be written */
833
	block_t old_blkaddr;	/* old block address before Cow */
834
	struct page *page;	/* page to be written */
835
	struct page *encrypted_page;	/* encrypted page */
836
	struct list_head list;		/* serialize IOs */
837
	bool submitted;		/* indicate IO submission */
838
	int need_lock;		/* indicate we need to lock cp_rwsem */
839
	bool in_list;		/* indicate fio is in io_list */
J
Jaegeuk Kim 已提交
840 841
};

842
#define is_read_io(rw) ((rw) == READ)
843
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
844
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
845 846
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
847
	struct f2fs_io_info fio;	/* store buffered io info. */
848
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
849 850
	spinlock_t io_lock;		/* serialize DATA/NODE IOs */
	struct list_head io_list;	/* track fios */
851 852
};

J
Jaegeuk Kim 已提交
853 854 855 856 857 858 859 860 861 862 863 864 865 866
#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
};

867 868 869
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
870
	DIRTY_META,			/* for all dirtied inode metadata */
871 872 873
	NR_INODE_TYPE,
};

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

882 883 884 885 886 887
/* 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 */
888
	SBI_NEED_SB_WRITE,			/* need to recover superblock */
889
	SBI_NEED_CP,				/* need to checkpoint */
890 891
};

892 893
enum {
	CP_TIME,
894
	REQ_TIME,
895 896 897
	MAX_TIME,
};

898 899
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
900
	struct proc_dir_entry *s_proc;		/* proc entry */
901
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
902
	int valid_super_block;			/* valid super block no */
903
	unsigned long s_flag;				/* flags for sbi */
904

905 906 907 908 909
#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

910 911 912 913 914 915
	/* 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 */
916 917

	/* for bio operations */
J
Jaegeuk Kim 已提交
918
	struct f2fs_bio_info *write_io[NR_PAGE_TYPE];	/* for write bios */
C
Chao Yu 已提交
919 920
	struct mutex wio_mutex[NR_PAGE_TYPE - 1][NR_TEMP_TYPE];
						/* bio ordering for NODE/DATA */
921 922
	int write_io_size_bits;			/* Write IO size bits */
	mempool_t *write_io_dummy;		/* Dummy pages */
923 924 925

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
926
	int cur_cp_pack;			/* remain current cp pack */
927
	spinlock_t cp_lock;			/* for flag in ckpt */
928
	struct inode *meta_inode;		/* cache meta blocks */
929
	struct mutex cp_mutex;			/* checkpoint procedure lock */
930
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
931
	struct rw_semaphore node_write;		/* locking node writes */
932
	struct rw_semaphore node_change;	/* locking node change */
933
	wait_queue_head_t cp_wait;
934 935
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
936

937
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
938 939

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

942 943 944
	/* 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 */
945

946 947
	/* for extent tree cache */
	struct radix_tree_root extent_tree_root;/* cache extent cache entries */
948
	struct mutex extent_tree_lock;	/* locking extent radix tree */
949 950
	struct list_head extent_list;		/* lru list for shrinker */
	spinlock_t extent_lock;			/* locking extent lru list */
951
	atomic_t total_ext_tree;		/* extent tree count */
952
	struct list_head zombie_list;		/* extent zombie tree list */
953
	atomic_t total_zombie_tree;		/* extent zombie tree count */
954 955
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
956
	/* basic filesystem units */
957 958 959 960 961 962 963 964 965 966 967 968 969
	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 已提交
970
	loff_t max_file_blocks;			/* max block index of file */
971
	int active_logs;			/* # of active logs */
972
	int dir_level;				/* directory level */
973 974 975

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
976
	block_t discard_blks;			/* discard command candidats */
977
	block_t last_valid_block_count;		/* for recovery */
978 979
	block_t reserved_blocks;		/* configurable reserved blocks */

980
	u32 s_next_generation;			/* for NFS support */
981 982

	/* # of pages, see count_type */
983
	atomic_t nr_pages[NR_COUNT_TYPE];
984 985
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
986

987 988 989
	/* writeback control */
	atomic_t wb_sync_req;			/* count # of WB_SYNC threads */

990 991 992
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

993 994 995 996 997
	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 */
998
	unsigned int cur_victim_sec;		/* current victim section num */
999

1000 1001 1002
	/* threshold for converting bg victims for fg */
	u64 fggc_threshold;

1003 1004 1005
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

1006 1007 1008 1009
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
1010
#ifdef CONFIG_F2FS_STAT_FS
1011 1012 1013
	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 */
1014
	atomic_t inplace_count;		/* # of inplace update */
1015 1016 1017 1018
	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 已提交
1019
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
1020 1021
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
1022
	atomic_t aw_cnt;			/* # of atomic writes */
1023
	atomic_t vw_cnt;			/* # of volatile writes */
1024
	atomic_t max_aw_cnt;			/* max # of atomic writes */
1025
	atomic_t max_vw_cnt;			/* max # of volatile writes */
1026
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
1027
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
1028
#endif
1029
	spinlock_t stat_lock;			/* lock for stat operations */
1030 1031 1032 1033

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
1034 1035 1036

	/* For shrinker support */
	struct list_head s_list;
J
Jaegeuk Kim 已提交
1037 1038
	int s_ndevs;				/* number of devices */
	struct f2fs_dev_info *devs;		/* for device list */
1039 1040
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
1041 1042 1043 1044

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
1045 1046 1047

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
1048 1049 1050 1051 1052

	/* For fault injection */
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct f2fs_fault_info fault_info;
#endif
1053 1054
};

1055
#ifdef CONFIG_F2FS_FAULT_INJECTION
1056 1057 1058 1059
#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))
1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078
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

1079 1080 1081 1082
/* 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)						 \
1083 1084
(((u64)part_stat_read((s)->sb->s_bdev->bd_part, sectors[1]) -		 \
		(s)->sectors_written_start) >> 1)
1085

1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098
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);
}

1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110
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);
}

1111 1112 1113
/*
 * Inline functions
 */
K
Keith Mok 已提交
1114 1115 1116 1117 1118
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);
1119
	u32 retval;
K
Keith Mok 已提交
1120 1121 1122 1123 1124 1125 1126 1127 1128
	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);

1129 1130 1131
	retval = *ctx;
	barrier_data(ctx);
	return retval;
K
Keith Mok 已提交
1132 1133 1134 1135 1136 1137 1138 1139
}

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

1140 1141 1142 1143 1144 1145 1146 1147 1148 1149
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;
}

1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164
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);
}

1165 1166 1167 1168 1169 1170 1171 1172 1173 1174
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);
}

1175 1176 1177 1178 1179
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

1180 1181 1182 1183 1184
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209
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 已提交
1210 1211 1212 1213 1214
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

1215 1216 1217 1218 1219
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1220 1221
static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
{
1222
	return test_bit(type, &sbi->s_flag);
1223 1224 1225
}

static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1226
{
1227
	set_bit(type, &sbi->s_flag);
1228 1229
}

1230
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1231
{
1232
	clear_bit(type, &sbi->s_flag);
1233 1234
}

1235 1236 1237 1238 1239
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

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

1246
static inline bool __is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
1247 1248
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1249

1250 1251 1252
	return ckpt_flags & f;
}

1253
static inline bool is_set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1254
{
1255 1256 1257 1258 1259 1260 1261 1262
	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);
1263 1264 1265 1266
	ckpt_flags |= f;
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1267
static inline void set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1268
{
1269 1270 1271
	unsigned long flags;

	spin_lock_irqsave(&sbi->cp_lock, flags);
1272
	__set_ckpt_flags(F2FS_CKPT(sbi), f);
1273
	spin_unlock_irqrestore(&sbi->cp_lock, flags);
1274 1275 1276 1277 1278 1279 1280
}

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);
1281 1282 1283 1284
	ckpt_flags &= (~f);
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1285 1286
static inline void clear_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
{
1287 1288 1289
	unsigned long flags;

	spin_lock_irqsave(&sbi->cp_lock, flags);
1290
	__clear_ckpt_flags(F2FS_CKPT(sbi), f);
1291
	spin_unlock_irqrestore(&sbi->cp_lock, flags);
1292 1293
}

1294 1295
static inline void disable_nat_bits(struct f2fs_sb_info *sbi, bool lock)
{
1296 1297
	unsigned long flags;

1298 1299 1300
	set_sbi_flag(sbi, SBI_NEED_FSCK);

	if (lock)
1301
		spin_lock_irqsave(&sbi->cp_lock, flags);
1302 1303 1304 1305
	__clear_ckpt_flags(F2FS_CKPT(sbi), CP_NAT_BITS_FLAG);
	kfree(NM_I(sbi)->nat_bits);
	NM_I(sbi)->nat_bits = NULL;
	if (lock)
1306
		spin_unlock_irqrestore(&sbi->cp_lock, flags);
1307 1308 1309 1310 1311 1312 1313
}

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

1314
	return (cpc) ? (cpc->reason & CP_UMOUNT) && set : set;
1315 1316
}

1317
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1318
{
1319
	down_read(&sbi->cp_rwsem);
1320 1321
}

1322 1323 1324 1325 1326
static inline int f2fs_trylock_op(struct f2fs_sb_info *sbi)
{
	return down_read_trylock(&sbi->cp_rwsem);
}

1327
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1328
{
1329
	up_read(&sbi->cp_rwsem);
1330 1331
}

1332
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1333
{
1334
	down_write(&sbi->cp_rwsem);
1335 1336
}

1337
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1338
{
1339
	up_write(&sbi->cp_rwsem);
1340 1341
}

1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354
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)
{
1355
	return (reason & (CP_UMOUNT | CP_FASTBOOT));
1356 1357 1358 1359
}

static inline bool __exist_node_summaries(struct f2fs_sb_info *sbi)
{
1360 1361
	return (is_set_ckpt_flags(sbi, CP_UMOUNT_FLAG) ||
			is_set_ckpt_flags(sbi, CP_FASTBOOT_FLAG));
1362 1363
}

1364 1365 1366
/*
 * Check whether the given nid is within node id range.
 */
1367
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1368
{
1369 1370
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1371
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1372 1373
		return -EINVAL;
	return 0;
1374 1375 1376 1377 1378 1379 1380
}

/*
 * Check whether the inode has blocks or not
 */
static inline int F2FS_HAS_BLOCKS(struct inode *inode)
{
1381 1382
	block_t xattr_block = F2FS_I(inode)->i_xattr_nid ? 1 : 0;

1383
	return (inode->i_blocks >> F2FS_LOG_SECTORS_PER_BLOCK) > xattr_block;
1384 1385
}

1386 1387 1388 1389 1390
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

C
Chao Yu 已提交
1391 1392
static inline void f2fs_i_blocks_write(struct inode *, block_t, bool, bool);
static inline int inc_valid_block_count(struct f2fs_sb_info *sbi,
1393
				 struct inode *inode, blkcnt_t *count)
1394
{
C
Chao Yu 已提交
1395
	blkcnt_t diff = 0, release = 0;
1396
	block_t avail_user_block_count;
C
Chao Yu 已提交
1397 1398 1399 1400 1401
	int ret;

	ret = dquot_reserve_block(inode, *count);
	if (ret)
		return ret;
1402

J
Jaegeuk Kim 已提交
1403
#ifdef CONFIG_F2FS_FAULT_INJECTION
1404 1405
	if (time_to_inject(sbi, FAULT_BLOCK)) {
		f2fs_show_injection_info(FAULT_BLOCK);
C
Chao Yu 已提交
1406 1407
		release = *count;
		goto enospc;
1408
	}
J
Jaegeuk Kim 已提交
1409
#endif
1410 1411 1412 1413 1414 1415
	/*
	 * 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));

1416 1417
	spin_lock(&sbi->stat_lock);
	sbi->total_valid_block_count += (block_t)(*count);
1418 1419 1420
	avail_user_block_count = sbi->user_block_count - sbi->reserved_blocks;
	if (unlikely(sbi->total_valid_block_count > avail_user_block_count)) {
		diff = sbi->total_valid_block_count - avail_user_block_count;
1421
		*count -= diff;
C
Chao Yu 已提交
1422
		release = diff;
1423
		sbi->total_valid_block_count = avail_user_block_count;
1424 1425
		if (!*count) {
			spin_unlock(&sbi->stat_lock);
1426
			percpu_counter_sub(&sbi->alloc_valid_block_count, diff);
C
Chao Yu 已提交
1427
			goto enospc;
1428
		}
1429 1430
	}
	spin_unlock(&sbi->stat_lock);
1431

C
Chao Yu 已提交
1432 1433 1434 1435 1436 1437 1438 1439
	if (release)
		dquot_release_reservation_block(inode, release);
	f2fs_i_blocks_write(inode, *count, true, true);
	return 0;

enospc:
	dquot_release_reservation_block(inode, release);
	return -ENOSPC;
1440 1441
}

1442
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1443
						struct inode *inode,
1444
						block_t count)
1445
{
1446 1447
	blkcnt_t sectors = count << F2FS_LOG_SECTORS_PER_BLOCK;

1448
	spin_lock(&sbi->stat_lock);
1449
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
1450
	f2fs_bug_on(sbi, inode->i_blocks < sectors);
1451 1452
	sbi->total_valid_block_count -= (block_t)count;
	spin_unlock(&sbi->stat_lock);
C
Chao Yu 已提交
1453
	f2fs_i_blocks_write(inode, count, false, true);
1454 1455 1456 1457
}

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

1460 1461
	if (count_type == F2FS_DIRTY_DATA || count_type == F2FS_INMEM_PAGES ||
		count_type == F2FS_WB_CP_DATA || count_type == F2FS_WB_DATA)
1462 1463
		return;

1464
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1465 1466
}

1467
static inline void inode_inc_dirty_pages(struct inode *inode)
1468
{
1469
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1470 1471
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1472 1473 1474 1475
}

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1476
	atomic_dec(&sbi->nr_pages[count_type]);
1477 1478
}

1479
static inline void inode_dec_dirty_pages(struct inode *inode)
1480
{
1481 1482
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1483 1484
		return;

1485
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1486 1487
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1488 1489
}

1490
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1491
{
1492
	return atomic_read(&sbi->nr_pages[count_type]);
1493 1494
}

1495
static inline int get_dirty_pages(struct inode *inode)
1496
{
1497
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1498 1499
}

1500 1501
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1502
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1503 1504 1505 1506
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1507 1508
}

1509 1510
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1511
	return sbi->total_valid_block_count;
1512 1513
}

1514 1515 1516 1517 1518
static inline block_t discard_blocks(struct f2fs_sb_info *sbi)
{
	return sbi->discard_blks;
}

1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531
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 已提交
1532 1533 1534 1535 1536
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1537 1538 1539
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1540 1541
	int offset;

W
Wanpeng Li 已提交
1542
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1543 1544 1545
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1546
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1547 1548
	} else {
		offset = (flag == NAT_BITMAP) ?
1549
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1550 1551
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1552 1553 1554 1555
}

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

1558
	if (sbi->cur_cp_pack == 2)
1559
		start_addr += sbi->blocks_per_seg;
1560 1561
	return start_addr;
}
1562

1563 1564 1565
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);
1566

1567 1568
	if (sbi->cur_cp_pack == 1)
		start_addr += sbi->blocks_per_seg;
1569 1570 1571
	return start_addr;
}

1572 1573 1574 1575 1576
static inline void __set_cp_next_pack(struct f2fs_sb_info *sbi)
{
	sbi->cur_cp_pack = (sbi->cur_cp_pack == 1) ? 2 : 1;
}

1577 1578 1579 1580 1581
static inline block_t __start_sum_addr(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_CKPT(sbi)->cp_pack_start_sum);
}

C
Chao Yu 已提交
1582
static inline int inc_valid_node_count(struct f2fs_sb_info *sbi,
1583
					struct inode *inode, bool is_inode)
1584 1585 1586
{
	block_t	valid_block_count;
	unsigned int valid_node_count;
C
Chao Yu 已提交
1587 1588 1589 1590 1591 1592 1593
	bool quota = inode && !is_inode;

	if (quota) {
		int ret = dquot_reserve_block(inode, 1);
		if (ret)
			return ret;
	}
1594 1595 1596

	spin_lock(&sbi->stat_lock);

1597
	valid_block_count = sbi->total_valid_block_count + 1;
1598 1599
	if (unlikely(valid_block_count + sbi->reserved_blocks >
						sbi->user_block_count)) {
1600
		spin_unlock(&sbi->stat_lock);
C
Chao Yu 已提交
1601
		goto enospc;
1602 1603
	}

1604
	valid_node_count = sbi->total_valid_node_count + 1;
1605
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1606
		spin_unlock(&sbi->stat_lock);
C
Chao Yu 已提交
1607
		goto enospc;
1608 1609
	}

1610 1611
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1612 1613
	spin_unlock(&sbi->stat_lock);

1614 1615 1616 1617
	if (inode) {
		if (is_inode)
			f2fs_mark_inode_dirty_sync(inode, true);
		else
C
Chao Yu 已提交
1618
			f2fs_i_blocks_write(inode, 1, true, true);
1619
	}
1620

1621
	percpu_counter_inc(&sbi->alloc_valid_block_count);
C
Chao Yu 已提交
1622 1623 1624 1625 1626 1627
	return 0;

enospc:
	if (quota)
		dquot_release_reservation_block(inode, 1);
	return -ENOSPC;
1628 1629 1630
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1631
					struct inode *inode, bool is_inode)
1632 1633 1634
{
	spin_lock(&sbi->stat_lock);

1635 1636
	f2fs_bug_on(sbi, !sbi->total_valid_block_count);
	f2fs_bug_on(sbi, !sbi->total_valid_node_count);
1637
	f2fs_bug_on(sbi, !is_inode && !inode->i_blocks);
1638

1639 1640
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1641 1642

	spin_unlock(&sbi->stat_lock);
C
Chao Yu 已提交
1643 1644 1645

	if (!is_inode)
		f2fs_i_blocks_write(inode, 1, false, true);
1646 1647 1648 1649
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1650
	return sbi->total_valid_node_count;
1651 1652 1653 1654
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1655
	percpu_counter_inc(&sbi->total_valid_inode_count);
1656 1657
}

1658
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1659
{
1660
	percpu_counter_dec(&sbi->total_valid_inode_count);
1661 1662
}

1663
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1664
{
1665
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1666 1667
}

1668 1669 1670
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1671 1672
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct page *page = find_lock_page(mapping, index);
1673

1674 1675 1676
	if (page)
		return page;

1677 1678
	if (time_to_inject(F2FS_M_SB(mapping), FAULT_PAGE_ALLOC)) {
		f2fs_show_injection_info(FAULT_PAGE_ALLOC);
1679
		return NULL;
1680
	}
1681
#endif
1682 1683 1684 1685 1686
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1687 1688 1689 1690 1691 1692 1693 1694 1695 1696
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);
}

1697 1698
static inline void f2fs_put_page(struct page *page, int unlock)
{
1699
	if (!page)
1700 1701 1702
		return;

	if (unlock) {
1703
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1704 1705
		unlock_page(page);
	}
1706
	put_page(page);
1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719
}

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,
1720
					size_t size)
1721
{
1722
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1723 1724
}

1725 1726 1727 1728 1729
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1730 1731 1732
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1733 1734 1735
	return entry;
}

J
Jaegeuk Kim 已提交
1736 1737 1738 1739 1740 1741
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1742 1743
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1744 1745 1746
	return bio;
}

1747 1748 1749 1750 1751 1752 1753
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();
}

1754 1755 1756 1757
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1758
	struct f2fs_node *p = F2FS_NODE(page);
1759

1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772
	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;
1773

1774
	raw_node = F2FS_NODE(node_page);
1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787
	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;
}

1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805
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;
}

1806
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817
{
	int mask;
	int ret;

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

1818
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829
{
	int mask;
	int ret;

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

1830 1831 1832 1833 1834 1835 1836 1837 1838
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1839 1840 1841
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1842
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1843
	FI_AUTO_RECOVER,	/* indicate inode is recoverable */
1844
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1845 1846 1847
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1848
	FI_FREE_NID,		/* free allocated nide */
1849
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1850
	FI_INLINE_XATTR,	/* used for inline xattr */
1851
	FI_INLINE_DATA,		/* used for inline data*/
1852
	FI_INLINE_DENTRY,	/* used for inline dentry */
1853 1854
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1855 1856
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
C
Chao Yu 已提交
1857
	FI_ATOMIC_COMMIT,	/* indicate the state of atomical committing */
1858
	FI_VOLATILE_FILE,	/* indicate volatile file */
1859
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1860
	FI_DROP_CACHE,		/* drop dirty page cache */
1861
	FI_DATA_EXIST,		/* indicate data exists */
1862
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1863
	FI_DO_DEFRAG,		/* indicate defragment is running */
1864
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1865
	FI_NO_PREALLOC,		/* indicate skipped preallocated blocks */
1866
	FI_HOT_DATA,		/* indicate file is hot */
1867 1868
};

1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879
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:
1880
		f2fs_mark_inode_dirty_sync(inode, true);
1881 1882 1883
	}
}

1884
static inline void set_inode_flag(struct inode *inode, int flag)
1885
{
1886 1887
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1888
	__mark_inode_dirty_flag(inode, flag, true);
1889 1890
}

1891
static inline int is_inode_flag_set(struct inode *inode, int flag)
1892
{
1893
	return test_bit(flag, &F2FS_I(inode)->flags);
1894 1895
}

1896
static inline void clear_inode_flag(struct inode *inode, int flag)
1897
{
1898 1899
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1900
	__mark_inode_dirty_flag(inode, flag, false);
1901 1902
}

1903
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1904
{
1905 1906
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1907
	f2fs_mark_inode_dirty_sync(inode, false);
1908 1909
}

1910
static inline void f2fs_i_links_write(struct inode *inode, bool inc)
1911
{
1912 1913 1914 1915
	if (inc)
		inc_nlink(inode);
	else
		drop_nlink(inode);
1916
	f2fs_mark_inode_dirty_sync(inode, true);
1917 1918
}

1919
static inline void f2fs_i_blocks_write(struct inode *inode,
C
Chao Yu 已提交
1920
					block_t diff, bool add, bool claim)
1921
{
1922 1923 1924
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

C
Chao Yu 已提交
1925 1926 1927 1928 1929 1930 1931 1932 1933 1934
	/* add = 1, claim = 1 should be dquot_reserve_block in pair */
	if (add) {
		if (claim)
			dquot_claim_block(inode, diff);
		else
			dquot_alloc_block_nofail(inode, diff);
	} else {
		dquot_free_block(inode, diff);
	}

1935
	f2fs_mark_inode_dirty_sync(inode, true);
1936 1937
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1938 1939
}

1940 1941
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1942 1943 1944
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1945 1946 1947 1948
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
1949
	f2fs_mark_inode_dirty_sync(inode, true);
1950 1951
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1952 1953
}

1954
static inline void f2fs_i_depth_write(struct inode *inode, unsigned int depth)
1955
{
1956
	F2FS_I(inode)->i_current_depth = depth;
1957
	f2fs_mark_inode_dirty_sync(inode, true);
1958 1959
}

1960
static inline void f2fs_i_xnid_write(struct inode *inode, nid_t xnid)
J
Jaegeuk Kim 已提交
1961
{
1962
	F2FS_I(inode)->i_xattr_nid = xnid;
1963
	f2fs_mark_inode_dirty_sync(inode, true);
1964 1965 1966 1967 1968
}

static inline void f2fs_i_pino_write(struct inode *inode, nid_t pino)
{
	F2FS_I(inode)->i_pino = pino;
1969
	f2fs_mark_inode_dirty_sync(inode, true);
1970 1971
}

1972
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1973
{
1974 1975
	struct f2fs_inode_info *fi = F2FS_I(inode);

J
Jaegeuk Kim 已提交
1976
	if (ri->i_inline & F2FS_INLINE_XATTR)
1977
		set_bit(FI_INLINE_XATTR, &fi->flags);
1978
	if (ri->i_inline & F2FS_INLINE_DATA)
1979
		set_bit(FI_INLINE_DATA, &fi->flags);
1980
	if (ri->i_inline & F2FS_INLINE_DENTRY)
1981
		set_bit(FI_INLINE_DENTRY, &fi->flags);
1982
	if (ri->i_inline & F2FS_DATA_EXIST)
1983
		set_bit(FI_DATA_EXIST, &fi->flags);
1984
	if (ri->i_inline & F2FS_INLINE_DOTS)
1985
		set_bit(FI_INLINE_DOTS, &fi->flags);
J
Jaegeuk Kim 已提交
1986 1987
}

1988
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1989 1990 1991
{
	ri->i_inline = 0;

1992
	if (is_inode_flag_set(inode, FI_INLINE_XATTR))
J
Jaegeuk Kim 已提交
1993
		ri->i_inline |= F2FS_INLINE_XATTR;
1994
	if (is_inode_flag_set(inode, FI_INLINE_DATA))
1995
		ri->i_inline |= F2FS_INLINE_DATA;
1996
	if (is_inode_flag_set(inode, FI_INLINE_DENTRY))
1997
		ri->i_inline |= F2FS_INLINE_DENTRY;
1998
	if (is_inode_flag_set(inode, FI_DATA_EXIST))
1999
		ri->i_inline |= F2FS_DATA_EXIST;
2000
	if (is_inode_flag_set(inode, FI_INLINE_DOTS))
2001
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
2002 2003
}

2004 2005
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
2006
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
2007 2008
}

2009
static inline unsigned int addrs_per_inode(struct inode *inode)
2010
{
2011
	if (f2fs_has_inline_xattr(inode))
2012 2013 2014 2015
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
2016 2017
static inline void *inline_xattr_addr(struct page *page)
{
2018
	struct f2fs_inode *ri = F2FS_INODE(page);
2019

J
Jaegeuk Kim 已提交
2020 2021 2022 2023 2024 2025
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
2026
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
2027 2028 2029 2030 2031
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

2032 2033
static inline int f2fs_has_inline_data(struct inode *inode)
{
2034
	return is_inode_flag_set(inode, FI_INLINE_DATA);
2035 2036
}

2037 2038
static inline int f2fs_exist_data(struct inode *inode)
{
2039
	return is_inode_flag_set(inode, FI_DATA_EXIST);
2040 2041
}

2042 2043
static inline int f2fs_has_inline_dots(struct inode *inode)
{
2044
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
2045 2046
}

J
Jaegeuk Kim 已提交
2047 2048
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
2049
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
2050 2051
}

C
Chao Yu 已提交
2052 2053 2054 2055 2056
static inline bool f2fs_is_commit_atomic_write(struct inode *inode)
{
	return is_inode_flag_set(inode, FI_ATOMIC_COMMIT);
}

2057 2058
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
2059
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
2060 2061
}

2062 2063
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
2064
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
2065 2066
}

2067 2068
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
2069
	return is_inode_flag_set(inode, FI_DROP_CACHE);
2070 2071
}

2072 2073
static inline void *inline_data_addr(struct page *page)
{
2074
	struct f2fs_inode *ri = F2FS_INODE(page);
2075

2076 2077 2078
	return (void *)&(ri->i_addr[1]);
}

2079 2080
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
2081
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
2082 2083
}

2084 2085 2086 2087 2088 2089
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

2090 2091 2092 2093 2094 2095 2096 2097
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;
2098
	f2fs_mark_inode_dirty_sync(inode, true);
2099 2100 2101 2102 2103
}

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

2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122
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);
2123 2124
}

J
Jaegeuk Kim 已提交
2125 2126 2127 2128 2129
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

2130 2131
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
2132
	return is_set_ckpt_flags(sbi, CP_ERROR_FLAG);
2133 2134
}

2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145
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 已提交
2146 2147 2148
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
2149
			is_inode_flag_set(inode, FI_NO_EXTENT))
J
Jaegeuk Kim 已提交
2150 2151
		return false;

A
Al Viro 已提交
2152
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
2153 2154
}

2155 2156
static inline void *f2fs_kmalloc(struct f2fs_sb_info *sbi,
					size_t size, gfp_t flags)
2157
{
J
Jaegeuk Kim 已提交
2158
#ifdef CONFIG_F2FS_FAULT_INJECTION
2159 2160
	if (time_to_inject(sbi, FAULT_KMALLOC)) {
		f2fs_show_injection_info(FAULT_KMALLOC);
J
Jaegeuk Kim 已提交
2161
		return NULL;
2162
	}
J
Jaegeuk Kim 已提交
2163
#endif
2164 2165 2166
	return kmalloc(size, flags);
}

2167
#define get_inode_mode(i) \
2168
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
2169 2170
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

2171 2172 2173
/*
 * file.c
 */
2174 2175 2176 2177
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);
2178 2179
int f2fs_getattr(const struct path *path, struct kstat *stat,
			u32 request_mask, unsigned int flags);
2180 2181 2182 2183 2184
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);
2185 2186 2187 2188

/*
 * inode.c
 */
2189 2190 2191 2192 2193 2194 2195 2196 2197
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);
2198 2199 2200 2201 2202 2203 2204 2205 2206

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

/*
 * dir.c
 */
2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245
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);
2246

2247 2248
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
2249
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
2250
				inode, inode->i_ino, inode->i_mode);
2251 2252
}

2253 2254 2255
/*
 * super.c
 */
2256 2257 2258 2259
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);
2260
extern __printf(3, 4)
2261
void f2fs_msg(struct super_block *sb, const char *level, const char *fmt, ...);
2262
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
2263 2264 2265 2266

/*
 * hash.c
 */
2267 2268
f2fs_hash_t f2fs_dentry_hash(const struct qstr *name_info,
				struct fscrypt_name *fname);
2269 2270 2271 2272 2273 2274 2275

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

2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296
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);
2297
void build_free_nids(struct f2fs_sb_info *sbi, bool sync, bool mount);
2298 2299 2300 2301 2302
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);
2303
int recover_xattr_data(struct inode *inode, struct page *page,
2304 2305 2306 2307
			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);
2308
void flush_nat_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc);
2309 2310
int build_node_manager(struct f2fs_sb_info *sbi);
void destroy_node_manager(struct f2fs_sb_info *sbi);
2311
int __init create_node_manager_caches(void);
2312 2313 2314 2315 2316
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
2317 2318
void register_inmem_page(struct inode *inode, struct page *page);
void drop_inmem_pages(struct inode *inode);
2319
void drop_inmem_page(struct inode *inode, struct page *page);
2320 2321 2322 2323 2324 2325 2326 2327 2328
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);
2329
void stop_discard_thread(struct f2fs_sb_info *sbi);
C
Chao Yu 已提交
2330
void f2fs_wait_discard_bios(struct f2fs_sb_info *sbi);
2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341
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);
2342
int rewrite_data_page(struct f2fs_io_info *fio);
2343 2344 2345 2346 2347 2348 2349 2350 2351
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,
2352 2353
			struct f2fs_summary *sum, int type,
			struct f2fs_io_info *fio, bool add_list);
2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364
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);
2365 2366
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
2367 2368 2369 2370

/*
 * checkpoint.c
 */
2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396
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);
2397
int __init create_checkpoint_caches(void);
2398 2399 2400 2401 2402
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
2403 2404
void f2fs_submit_merged_write(struct f2fs_sb_info *sbi, enum page_type type);
void f2fs_submit_merged_write_cond(struct f2fs_sb_info *sbi,
2405
				struct inode *inode, nid_t ino, pgoff_t idx,
2406 2407
				enum page_type type);
void f2fs_flush_merged_writes(struct f2fs_sb_info *sbi);
2408
int f2fs_submit_page_bio(struct f2fs_io_info *fio);
2409
int f2fs_submit_page_write(struct f2fs_io_info *fio);
2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435
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);
2436
#ifdef CONFIG_MIGRATION
2437 2438
int f2fs_migrate_page(struct address_space *mapping, struct page *newpage,
			struct page *page, enum migrate_mode mode);
2439
#endif
2440 2441 2442 2443

/*
 * gc.c
 */
2444 2445 2446
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);
2447 2448
int f2fs_gc(struct f2fs_sb_info *sbi, bool sync, bool background,
			unsigned int segno);
2449
void build_gc_manager(struct f2fs_sb_info *sbi);
2450 2451 2452 2453

/*
 * recovery.c
 */
2454 2455
int recover_fsync_data(struct f2fs_sb_info *sbi, bool check_only);
bool space_for_roll_forward(struct f2fs_sb_info *sbi);
2456 2457 2458 2459 2460 2461 2462 2463 2464 2465

/*
 * 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;
2466 2467
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
2468
	int ext_tree, zombie_tree, ext_node;
2469 2470
	int ndirty_node, ndirty_dent, ndirty_meta, ndirty_data, ndirty_imeta;
	int inmem_pages;
2471
	unsigned int ndirty_dirs, ndirty_files, ndirty_all;
2472 2473
	int nats, dirty_nats, sits, dirty_sits;
	int free_nids, avail_nids, alloc_nids;
2474
	int total_count, utilization;
C
Chao Yu 已提交
2475 2476
	int bg_gc, nr_wb_cp_data, nr_wb_data;
	int nr_flushing, nr_flushed, nr_discarding, nr_discarded;
C
Chao Yu 已提交
2477
	int nr_discard_cmd;
C
Chao Yu 已提交
2478
	unsigned int undiscard_blks;
2479
	int inline_xattr, inline_inode, inline_dir, append, update, orphans;
2480
	int aw_cnt, max_aw_cnt, vw_cnt, max_vw_cnt;
2481
	unsigned int valid_count, valid_node_count, valid_inode_count, discard_blks;
2482 2483 2484 2485
	unsigned int bimodal, avg_vblocks;
	int util_free, util_valid, util_invalid;
	int rsvd_segs, overp_segs;
	int dirty_count, node_pages, meta_pages;
2486
	int prefree_count, call_count, cp_count, bg_cp_count;
2487
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
2488
	int bg_node_segs, bg_data_segs;
2489
	int tot_blks, data_blks, node_blks;
2490
	int bg_data_blks, bg_node_blks;
2491 2492 2493 2494 2495 2496
	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];
2497
	unsigned int inplace_count;
C
Chao Yu 已提交
2498
	unsigned long long base_mem, cache_mem, page_mem;
2499 2500
};

2501 2502
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2503
	return (struct f2fs_stat_info *)sbi->stat_info;
2504 2505
}

2506
#define stat_inc_cp_count(si)		((si)->cp_count++)
2507
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
2508 2509
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
2510 2511
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
2512 2513 2514 2515
#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 已提交
2516 2517 2518 2519 2520 2521 2522 2523 2524 2525
#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)
2526 2527 2528
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2529
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
2530 2531 2532 2533
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2534
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
2535
	} while (0)
2536 2537 2538
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2539
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
2540 2541 2542 2543
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2544
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
2545
	} while (0)
2546 2547 2548 2549
#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]++)
2550 2551
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2552
#define stat_inc_atomic_write(inode)					\
2553
		(atomic_inc(&F2FS_I_SB(inode)->aw_cnt))
2554
#define stat_dec_atomic_write(inode)					\
2555
		(atomic_dec(&F2FS_I_SB(inode)->aw_cnt))
2556 2557 2558 2559 2560 2561 2562
#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)
2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573
#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)
2574
#define stat_inc_seg_count(sbi, type, gc_type)				\
2575
	do {								\
2576
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2577 2578
		si->tot_segs++;						\
		if ((type) == SUM_TYPE_DATA) {				\
2579
			si->data_segs++;				\
2580 2581
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2582
			si->node_segs++;				\
2583 2584
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2585 2586 2587
	} while (0)

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

2590
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2591
	do {								\
2592
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2593 2594
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2595
		si->bg_data_blks += ((gc_type) == BG_GC) ? (blks) : 0;	\
2596 2597
	} while (0)

2598
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2599
	do {								\
2600
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2601 2602
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2603
		si->bg_node_blks += ((gc_type) == BG_GC) ? (blks) : 0;	\
2604 2605
	} while (0)

2606 2607
int f2fs_build_stats(struct f2fs_sb_info *sbi);
void f2fs_destroy_stats(struct f2fs_sb_info *sbi);
2608
int __init f2fs_create_root_stats(void);
2609
void f2fs_destroy_root_stats(void);
2610
#else
2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639
#define stat_inc_cp_count(si)				do { } while (0)
#define stat_inc_bg_cp_count(si)			do { } while (0)
#define stat_inc_call_count(si)				do { } while (0)
#define stat_inc_bggc_count(si)				do { } while (0)
#define stat_inc_dirty_inode(sbi, type)			do { } while (0)
#define stat_dec_dirty_inode(sbi, type)			do { } while (0)
#define stat_inc_total_hit(sb)				do { } while (0)
#define stat_inc_rbtree_node_hit(sb)			do { } while (0)
#define stat_inc_largest_node_hit(sbi)			do { } while (0)
#define stat_inc_cached_node_hit(sbi)			do { } while (0)
#define stat_inc_inline_xattr(inode)			do { } while (0)
#define stat_dec_inline_xattr(inode)			do { } while (0)
#define stat_inc_inline_inode(inode)			do { } while (0)
#define stat_dec_inline_inode(inode)			do { } while (0)
#define stat_inc_inline_dir(inode)			do { } while (0)
#define stat_dec_inline_dir(inode)			do { } while (0)
#define stat_inc_atomic_write(inode)			do { } while (0)
#define stat_dec_atomic_write(inode)			do { } while (0)
#define stat_update_max_atomic_write(inode)		do { } while (0)
#define stat_inc_volatile_write(inode)			do { } while (0)
#define stat_dec_volatile_write(inode)			do { } while (0)
#define stat_update_max_volatile_write(inode)		do { } while (0)
#define stat_inc_seg_type(sbi, curseg)			do { } while (0)
#define stat_inc_block_count(sbi, curseg)		do { } while (0)
#define stat_inc_inplace_blocks(sbi)			do { } while (0)
#define stat_inc_seg_count(sbi, type, gc_type)		do { } while (0)
#define stat_inc_tot_blk_count(si, blks)		do { } while (0)
#define stat_inc_data_blk_count(sbi, blks, gc_type)	do { } while (0)
#define stat_inc_node_blk_count(sbi, blks, gc_type)	do { } while (0)
2640 2641 2642

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2643
static inline int __init f2fs_create_root_stats(void) { return 0; }
2644
static inline void f2fs_destroy_root_stats(void) { }
2645 2646 2647 2648 2649 2650 2651 2652 2653 2654
#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;
2655
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2656
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2657
extern struct kmem_cache *inode_entry_slab;
2658

2659 2660 2661
/*
 * inline.c
 */
2662 2663 2664
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);
2665
void truncate_inline_inode(struct inode *inode, struct page *ipage, u64 from);
2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685
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);
2686

2687 2688 2689
/*
 * shrinker.c
 */
2690 2691 2692 2693 2694 2695
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);
2696

2697 2698 2699
/*
 * extent_cache.c
 */
2700 2701 2702 2703 2704 2705 2706 2707 2708 2709
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);
2710 2711
bool __check_rb_tree_consistence(struct f2fs_sb_info *sbi,
						struct rb_root *root);
2712 2713 2714 2715 2716 2717 2718 2719
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 已提交
2720
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
2721 2722
			pgoff_t fofs, block_t blkaddr, unsigned int len);
void init_extent_cache_info(struct f2fs_sb_info *sbi);
2723 2724 2725
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2726 2727 2728 2729 2730 2731 2732 2733
/*
 * sysfs.c
 */
int __init f2fs_register_sysfs(void);
void f2fs_unregister_sysfs(void);
int f2fs_init_sysfs(struct f2fs_sb_info *sbi);
void f2fs_exit_sysfs(struct f2fs_sb_info *sbi);

2734 2735 2736
/*
 * crypto support
 */
2737
static inline bool f2fs_encrypted_inode(struct inode *inode)
2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750
{
	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)
{
2751
	return bio->bi_private != NULL;
2752 2753 2754 2755 2756 2757
}

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

2759
static inline int f2fs_sb_mounted_blkzoned(struct super_block *sb)
2760
{
2761
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_BLKZONED);
2762 2763
}

2764 2765
#ifdef CONFIG_BLK_DEV_ZONED
static inline int get_blkz_type(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
2766
			struct block_device *bdev, block_t blkaddr)
2767 2768
{
	unsigned int zno = blkaddr >> sbi->log_blocks_per_blkz;
J
Jaegeuk Kim 已提交
2769
	int i;
2770

J
Jaegeuk Kim 已提交
2771 2772 2773 2774
	for (i = 0; i < sbi->s_ndevs; i++)
		if (FDEV(i).bdev == bdev)
			return FDEV(i).blkz_type[zno];
	return -EINVAL;
2775 2776 2777
}
#endif

2778
static inline bool f2fs_discard_en(struct f2fs_sb_info *sbi)
2779
{
2780 2781 2782
	struct request_queue *q = bdev_get_queue(sbi->sb->s_bdev);

	return blk_queue_discard(q) || f2fs_sb_mounted_blkzoned(sbi->sb);
2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799
}

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

2800 2801 2802
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2803
	umode_t mode = inode->i_mode;
2804 2805 2806 2807 2808 2809 2810

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

2811
#endif