f2fs.h 87.2 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
#define F2FS_FEATURE_ATOMIC_WRITE 0x0004
116

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

314 315 316
#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
317

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

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

337 338 339 340 341 342
struct f2fs_gc_range {
	u32 sync;
	u64 start;
	u64 len;
};

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

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

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

C
Chao Yu 已提交
360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378
/* for inline stuff */
#define DEF_INLINE_RESERVED_SIZE	1

static inline int get_inline_reserved_size(struct inode *inode);
#define MAX_INLINE_DATA(inode)	(sizeof(__le32) * (DEF_ADDRS_PER_INODE -\
				get_inline_reserved_size(inode) -\
				F2FS_INLINE_XATTR_ADDRS))

/* for inline dir */
#define NR_INLINE_DENTRY(inode)	(MAX_INLINE_DATA(inode) * BITS_PER_BYTE / \
				((SIZE_OF_DIR_ENTRY + F2FS_SLOT_LEN) * \
				BITS_PER_BYTE + 1))
#define INLINE_DENTRY_BITMAP_SIZE(inode)	((NR_INLINE_DENTRY(inode) + \
					BITS_PER_BYTE - 1) / BITS_PER_BYTE)
#define INLINE_RESERVED_SIZE(inode)	(MAX_INLINE_DATA(inode) - \
				((SIZE_OF_DIR_ENTRY + F2FS_SLOT_LEN) * \
				NR_INLINE_DENTRY(inode) + \
				INLINE_DENTRY_BITMAP_SIZE(inode)))

379 380 381
/*
 * For INODE and NODE manager
 */
382 383
/* for directory operations */
struct f2fs_dentry_ptr {
384
	struct inode *inode;
385
	void *bitmap;
386 387 388
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
389
	int nr_bitmap;
390 391
};

392 393
static inline void make_dentry_ptr_block(struct inode *inode,
		struct f2fs_dentry_ptr *d, struct f2fs_dentry_block *t)
394
{
395
	d->inode = inode;
396
	d->max = NR_DENTRY_IN_BLOCK;
397
	d->nr_bitmap = SIZE_OF_DENTRY_BITMAP;
398 399 400 401
	d->bitmap = &t->dentry_bitmap;
	d->dentry = t->dentry;
	d->filename = t->filename;
}
402

403
static inline void make_dentry_ptr_inline(struct inode *inode,
C
Chao Yu 已提交
404
					struct f2fs_dentry_ptr *d, void *t)
405
{
C
Chao Yu 已提交
406 407 408 409
	int entry_cnt = NR_INLINE_DENTRY(inode);
	int bitmap_size = INLINE_DENTRY_BITMAP_SIZE(inode);
	int reserved_size = INLINE_RESERVED_SIZE(inode);

410
	d->inode = inode;
C
Chao Yu 已提交
411 412 413 414 415 416
	d->max = entry_cnt;
	d->nr_bitmap = bitmap_size;
	d->bitmap = t;
	d->dentry = t + bitmap_size + reserved_size;
	d->filename = t + bitmap_size + reserved_size +
					SIZE_OF_DIR_ENTRY * entry_cnt;
417 418
}

419 420 421 422 423 424 425
/*
 * 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)
426 427 428 429 430
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 已提交
431
					 * by get_data_block.
432
					 */
433 434
};

435
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
436

437 438
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

439 440 441
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

442
/* for in-memory extent cache entry */
443 444 445 446
#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
447

448 449 450 451 452 453
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 */
};

454
struct extent_info {
455 456
	unsigned int fofs;		/* start offset in a file */
	unsigned int len;		/* length of the extent */
457
	u32 blk;			/* start block address of the extent */
458 459 460
};

struct extent_node {
461 462 463 464 465 466 467 468 469 470
	struct rb_node rb_node;
	union {
		struct {
			unsigned int fofs;
			unsigned int len;
			u32 blk;
		};
		struct extent_info ei;	/* extent info */

	};
471
	struct list_head list;		/* node in global extent list of sbi */
472
	struct extent_tree *et;		/* extent tree pointer */
473 474 475 476 477
};

struct extent_tree {
	nid_t ino;			/* inode number */
	struct rb_root root;		/* root of extent info rb-tree */
478
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
479
	struct extent_info largest;	/* largested extent info */
480
	struct list_head list;		/* to be used by sbi->zombie_list */
481
	rwlock_t lock;			/* protect extent info rb-tree */
482
	atomic_t node_cnt;		/* # of extent node in rb-tree*/
483 484
};

J
Jaegeuk Kim 已提交
485 486 487 488 489 490 491
/*
 * 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)
492 493 494
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
495 496 497 498 499 500

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

C
Chao Yu 已提交
504 505 506 507 508
/* 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
509
#define F2FS_GET_BLOCK_PRE_DIO		4
510
#define F2FS_GET_BLOCK_PRE_AIO		5
C
Chao Yu 已提交
511

512 513 514 515
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
516
#define FADVISE_LOST_PINO_BIT	0x02
517
#define FADVISE_ENCRYPT_BIT	0x04
518
#define FADVISE_ENC_NAME_BIT	0x08
519
#define FADVISE_KEEP_SIZE_BIT	0x10
520

521 522 523 524 525 526
#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)
527 528 529
#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)
530 531
#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)
532 533
#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)
534

535 536
#define DEF_DIR_LEVEL		0

537 538 539 540
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 */
541
	unsigned char i_dir_level;	/* use for dentry level for large dir */
542
	unsigned int i_current_depth;	/* use only in directory structure */
543
	unsigned int i_pino;		/* parent inode number */
544 545 546 547
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
548
	struct rw_semaphore i_sem;	/* protect fi info */
549
	atomic_t dirty_pages;		/* # of dirty pages */
550 551
	f2fs_hash_t chash;		/* hash value of given file name */
	unsigned int clevel;		/* maximum level of given file name */
552
	struct task_struct *task;	/* lookup and create consistency */
553
	nid_t i_xattr_nid;		/* node id that contains xattrs */
554
	loff_t	last_disk_size;		/* lastly written file size */
J
Jaegeuk Kim 已提交
555

C
Chao Yu 已提交
556 557 558 559 560 561
#ifdef CONFIG_QUOTA
	struct dquot *i_dquot[MAXQUOTAS];

	/* quota space reservation, managed internally by quota code */
	qsize_t i_reserved_quota;
#endif
562 563
	struct list_head dirty_list;	/* dirty list for dirs and files */
	struct list_head gdirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
564
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
565
	struct task_struct *inmem_task;	/* store inmemory task */
J
Jaegeuk Kim 已提交
566
	struct mutex inmem_lock;	/* lock for inmemory pages */
J
Jaegeuk Kim 已提交
567
	struct extent_tree *extent_tree;	/* cached extent_tree entry */
568
	struct rw_semaphore dio_rwsem[2];/* avoid racing between dio and gc */
569
	struct rw_semaphore i_mmap_sem;
C
Chao Yu 已提交
570 571

	int i_inline_reserved;		/* reserved size in inline data */
572 573 574
};

static inline void get_extent_info(struct extent_info *ext,
C
Chao Yu 已提交
575
					struct f2fs_extent *i_ext)
576
{
C
Chao Yu 已提交
577 578 579
	ext->fofs = le32_to_cpu(i_ext->fofs);
	ext->blk = le32_to_cpu(i_ext->blk);
	ext->len = le32_to_cpu(i_ext->len);
580 581 582 583 584 585
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	i_ext->fofs = cpu_to_le32(ext->fofs);
586
	i_ext->blk = cpu_to_le32(ext->blk);
587 588 589
	i_ext->len = cpu_to_le32(ext->len);
}

590 591 592 593 594 595 596 597
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;
}

598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615
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);
}

616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634
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);
}

635
extern void f2fs_mark_inode_dirty_sync(struct inode *inode, bool sync);
636 637
static inline void __try_update_largest_extent(struct inode *inode,
			struct extent_tree *et, struct extent_node *en)
638
{
639
	if (en->ei.len > et->largest.len) {
640
		et->largest = en->ei;
641
		f2fs_mark_inode_dirty_sync(inode, true);
642
	}
643 644
}

C
Chao Yu 已提交
645 646 647 648 649 650
enum nid_list {
	FREE_NID_LIST,
	ALLOC_NID_LIST,
	MAX_NID_LIST,
};

651 652 653
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
654
	nid_t available_nids;		/* # of available node ids */
655
	nid_t next_scan_nid;		/* the next nid to be scanned */
656
	unsigned int ram_thresh;	/* control the memory footprint */
C
Chao Yu 已提交
657
	unsigned int ra_nid_pages;	/* # of nid pages to be readaheaded */
C
Chao Yu 已提交
658
	unsigned int dirty_nats_ratio;	/* control dirty nats ratio threshold */
659 660 661

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
662
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
663
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
664
	struct list_head nat_entries;	/* cached nat entry list (clean) */
665
	unsigned int nat_cnt;		/* the # of cached nat entries */
666
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
667
	unsigned int nat_blocks;	/* # of nat blocks */
668 669

	/* free node ids management */
670
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
C
Chao Yu 已提交
671 672 673
	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 */
674
	struct mutex build_lock;	/* lock for build free nids */
C
Chao Yu 已提交
675 676
	unsigned char (*free_nid_bitmap)[NAT_ENTRY_BITMAP_SIZE];
	unsigned char *nat_block_bitmap;
677
	unsigned short *free_nid_count;	/* free nid count of NAT block */
678 679 680

	/* for checkpoint */
	char *nat_bitmap;		/* NAT bitmap pointer */
681 682 683 684 685

	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 */
686 687 688
#ifdef CONFIG_F2FS_CHECK_FS
	char *nat_bitmap_mir;		/* NAT bitmap mirror */
#endif
689 690 691 692 693 694 695 696 697 698 699 700 701 702 703
	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 */
704
	bool node_changed;		/* is node block changed */
705 706
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
707 708 709 710 711 712
	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)
{
713
	memset(dn, 0, sizeof(*dn));
714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743
	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 */
744
	NO_CHECK_TYPE,
745 746
};

747 748
struct flush_cmd {
	struct completion wait;
749
	struct llist_node llnode;
750 751 752
	int ret;
};

753 754 755
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 已提交
756 757
	atomic_t issued_flush;			/* # of issued flushes */
	atomic_t issing_flush;			/* # of issing flushes */
758 759
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
760 761
};

762 763 764 765 766 767 768 769 770 771 772 773 774 775
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 */
776 777 778

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

J
Jaegeuk Kim 已提交
780 781 782
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

783 784
	struct list_head sit_entry_set;	/* sit entry set list */

785 786
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
787
	unsigned int min_fsync_blocks;	/* threshold for fsync */
788
	unsigned int min_hot_blocks;	/* threshold for hot block allocation */
789 790

	/* for flush command control */
791
	struct flush_cmd_control *fcc_info;
792

793 794
	/* for discard command control */
	struct discard_cmd_control *dcc_info;
795 796 797 798 799 800 801 802 803 804 805
};

/*
 * 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.
 */
806
#define WB_DATA_TYPE(p)	(__is_cp_guaranteed(p) ? F2FS_WB_CP_DATA : F2FS_WB_DATA)
807 808
enum count_type {
	F2FS_DIRTY_DENTS,
809
	F2FS_DIRTY_DATA,
810 811
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
812
	F2FS_INMEM_PAGES,
813
	F2FS_DIRTY_IMETA,
814 815
	F2FS_WB_CP_DATA,
	F2FS_WB_DATA,
816 817 818 819
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
820
 * The below are the page types of bios used in submit_bio().
821 822 823 824 825 826 827 828 829
 * 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.
 */
830
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
831 832 833 834 835 836
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
837 838
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
839
	INMEM_INVALIDATE,
840
	INMEM_REVOKE,
841 842
	IPU,
	OPU,
843 844
};

J
Jaegeuk Kim 已提交
845 846 847 848 849 850 851
enum temp_type {
	HOT = 0,	/* must be zero for meta bio */
	WARM,
	COLD,
	NR_TEMP_TYPE,
};

852 853 854 855 856 857
enum need_lock_type {
	LOCK_REQ = 0,
	LOCK_DONE,
	LOCK_RETRY,
};

J
Jaegeuk Kim 已提交
858
struct f2fs_io_info {
859
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
860
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
J
Jaegeuk Kim 已提交
861
	enum temp_type temp;	/* contains HOT/WARM/COLD */
M
Mike Christie 已提交
862
	int op;			/* contains REQ_OP_ */
863
	int op_flags;		/* req_flag_bits */
864
	block_t new_blkaddr;	/* new block address to be written */
865
	block_t old_blkaddr;	/* old block address before Cow */
866
	struct page *page;	/* page to be written */
867
	struct page *encrypted_page;	/* encrypted page */
868
	struct list_head list;		/* serialize IOs */
869
	bool submitted;		/* indicate IO submission */
870
	int need_lock;		/* indicate we need to lock cp_rwsem */
871
	bool in_list;		/* indicate fio is in io_list */
J
Jaegeuk Kim 已提交
872 873
};

874
#define is_read_io(rw) ((rw) == READ)
875
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
876
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
877 878
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
879
	struct f2fs_io_info fio;	/* store buffered io info. */
880
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
881 882
	spinlock_t io_lock;		/* serialize DATA/NODE IOs */
	struct list_head io_list;	/* track fios */
883 884
};

J
Jaegeuk Kim 已提交
885 886 887 888 889 890 891 892 893 894 895 896 897 898
#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
};

899 900 901
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
902
	DIRTY_META,			/* for all dirtied inode metadata */
903 904 905
	NR_INODE_TYPE,
};

906 907 908 909 910 911 912 913
/* 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 */
};

914 915 916 917 918 919
/* 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 */
920
	SBI_NEED_SB_WRITE,			/* need to recover superblock */
921
	SBI_NEED_CP,				/* need to checkpoint */
922 923
};

924 925
enum {
	CP_TIME,
926
	REQ_TIME,
927 928 929
	MAX_TIME,
};

930 931
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
932
	struct proc_dir_entry *s_proc;		/* proc entry */
933
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
934
	int valid_super_block;			/* valid super block no */
935
	unsigned long s_flag;				/* flags for sbi */
936

937 938 939 940 941
#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

942 943 944 945 946 947
	/* 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 */
948 949

	/* for bio operations */
J
Jaegeuk Kim 已提交
950
	struct f2fs_bio_info *write_io[NR_PAGE_TYPE];	/* for write bios */
C
Chao Yu 已提交
951 952
	struct mutex wio_mutex[NR_PAGE_TYPE - 1][NR_TEMP_TYPE];
						/* bio ordering for NODE/DATA */
953 954
	int write_io_size_bits;			/* Write IO size bits */
	mempool_t *write_io_dummy;		/* Dummy pages */
955 956 957

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
958
	int cur_cp_pack;			/* remain current cp pack */
959
	spinlock_t cp_lock;			/* for flag in ckpt */
960
	struct inode *meta_inode;		/* cache meta blocks */
961
	struct mutex cp_mutex;			/* checkpoint procedure lock */
962
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
963
	struct rw_semaphore node_write;		/* locking node writes */
964
	struct rw_semaphore node_change;	/* locking node change */
965
	wait_queue_head_t cp_wait;
966 967
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
968

969
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
970 971

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

974 975 976
	/* 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 */
977

978 979
	/* for extent tree cache */
	struct radix_tree_root extent_tree_root;/* cache extent cache entries */
980
	struct mutex extent_tree_lock;	/* locking extent radix tree */
981 982
	struct list_head extent_list;		/* lru list for shrinker */
	spinlock_t extent_lock;			/* locking extent lru list */
983
	atomic_t total_ext_tree;		/* extent tree count */
984
	struct list_head zombie_list;		/* extent zombie tree list */
985
	atomic_t total_zombie_tree;		/* extent zombie tree count */
986 987
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
988
	/* basic filesystem units */
989 990 991 992 993 994 995 996 997 998 999 1000 1001
	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 已提交
1002
	loff_t max_file_blocks;			/* max block index of file */
1003
	int active_logs;			/* # of active logs */
1004
	int dir_level;				/* directory level */
1005 1006 1007

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
1008
	block_t discard_blks;			/* discard command candidats */
1009
	block_t last_valid_block_count;		/* for recovery */
1010 1011
	block_t reserved_blocks;		/* configurable reserved blocks */

1012
	u32 s_next_generation;			/* for NFS support */
1013 1014

	/* # of pages, see count_type */
1015
	atomic_t nr_pages[NR_COUNT_TYPE];
1016 1017
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
1018

1019 1020 1021
	/* writeback control */
	atomic_t wb_sync_req;			/* count # of WB_SYNC threads */

1022 1023 1024
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

1025 1026 1027 1028 1029
	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 */
1030
	unsigned int cur_victim_sec;		/* current victim section num */
1031

1032 1033 1034
	/* threshold for converting bg victims for fg */
	u64 fggc_threshold;

1035 1036 1037
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

1038 1039 1040 1041
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
1042
#ifdef CONFIG_F2FS_STAT_FS
1043 1044 1045
	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 */
1046
	atomic_t inplace_count;		/* # of inplace update */
1047 1048 1049 1050
	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 已提交
1051
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
1052 1053
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
1054
	atomic_t aw_cnt;			/* # of atomic writes */
1055
	atomic_t vw_cnt;			/* # of volatile writes */
1056
	atomic_t max_aw_cnt;			/* max # of atomic writes */
1057
	atomic_t max_vw_cnt;			/* max # of volatile writes */
1058
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
1059
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
1060
#endif
1061
	spinlock_t stat_lock;			/* lock for stat operations */
1062 1063 1064 1065

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
1066 1067 1068

	/* For shrinker support */
	struct list_head s_list;
J
Jaegeuk Kim 已提交
1069 1070
	int s_ndevs;				/* number of devices */
	struct f2fs_dev_info *devs;		/* for device list */
1071 1072
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
1073 1074 1075 1076

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
1077 1078 1079

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
1080 1081 1082 1083 1084

	/* For fault injection */
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct f2fs_fault_info fault_info;
#endif
1085 1086
};

1087
#ifdef CONFIG_F2FS_FAULT_INJECTION
1088 1089 1090 1091
#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))
1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110
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

1111 1112 1113 1114
/* 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)						 \
1115 1116
(((u64)part_stat_read((s)->sb->s_bdev->bd_part, sectors[1]) -		 \
		(s)->sectors_written_start) >> 1)
1117

1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130
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);
}

1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142
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);
}

1143 1144 1145
/*
 * Inline functions
 */
K
Keith Mok 已提交
1146 1147 1148 1149 1150
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);
1151
	u32 retval;
K
Keith Mok 已提交
1152 1153 1154 1155 1156 1157 1158 1159 1160
	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);

1161 1162 1163
	retval = *ctx;
	barrier_data(ctx);
	return retval;
K
Keith Mok 已提交
1164 1165 1166 1167 1168 1169 1170 1171
}

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

1172 1173 1174 1175 1176 1177 1178 1179 1180 1181
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;
}

1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196
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);
}

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

1207 1208 1209 1210 1211
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

1212 1213 1214 1215 1216
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241
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 已提交
1242 1243 1244 1245 1246
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

1247 1248 1249 1250 1251
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1252 1253
static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
{
1254
	return test_bit(type, &sbi->s_flag);
1255 1256 1257
}

static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1258
{
1259
	set_bit(type, &sbi->s_flag);
1260 1261
}

1262
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1263
{
1264
	clear_bit(type, &sbi->s_flag);
1265 1266
}

1267 1268 1269 1270 1271
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

1272 1273 1274 1275 1276 1277
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)));
}

1278
static inline bool __is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
1279 1280
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1281

1282 1283 1284
	return ckpt_flags & f;
}

1285
static inline bool is_set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1286
{
1287 1288 1289 1290 1291 1292 1293 1294
	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);
1295 1296 1297 1298
	ckpt_flags |= f;
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1299
static inline void set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1300
{
1301 1302 1303
	unsigned long flags;

	spin_lock_irqsave(&sbi->cp_lock, flags);
1304
	__set_ckpt_flags(F2FS_CKPT(sbi), f);
1305
	spin_unlock_irqrestore(&sbi->cp_lock, flags);
1306 1307 1308 1309 1310 1311 1312
}

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);
1313 1314 1315 1316
	ckpt_flags &= (~f);
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1317 1318
static inline void clear_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
{
1319 1320 1321
	unsigned long flags;

	spin_lock_irqsave(&sbi->cp_lock, flags);
1322
	__clear_ckpt_flags(F2FS_CKPT(sbi), f);
1323
	spin_unlock_irqrestore(&sbi->cp_lock, flags);
1324 1325
}

1326 1327
static inline void disable_nat_bits(struct f2fs_sb_info *sbi, bool lock)
{
1328 1329
	unsigned long flags;

1330 1331 1332
	set_sbi_flag(sbi, SBI_NEED_FSCK);

	if (lock)
1333
		spin_lock_irqsave(&sbi->cp_lock, flags);
1334 1335 1336 1337
	__clear_ckpt_flags(F2FS_CKPT(sbi), CP_NAT_BITS_FLAG);
	kfree(NM_I(sbi)->nat_bits);
	NM_I(sbi)->nat_bits = NULL;
	if (lock)
1338
		spin_unlock_irqrestore(&sbi->cp_lock, flags);
1339 1340 1341 1342 1343 1344 1345
}

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

1346
	return (cpc) ? (cpc->reason & CP_UMOUNT) && set : set;
1347 1348
}

1349
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1350
{
1351
	down_read(&sbi->cp_rwsem);
1352 1353
}

1354 1355 1356 1357 1358
static inline int f2fs_trylock_op(struct f2fs_sb_info *sbi)
{
	return down_read_trylock(&sbi->cp_rwsem);
}

1359
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1360
{
1361
	up_read(&sbi->cp_rwsem);
1362 1363
}

1364
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1365
{
1366
	down_write(&sbi->cp_rwsem);
1367 1368
}

1369
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1370
{
1371
	up_write(&sbi->cp_rwsem);
1372 1373
}

1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386
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)
{
1387
	return (reason & (CP_UMOUNT | CP_FASTBOOT));
1388 1389 1390 1391
}

static inline bool __exist_node_summaries(struct f2fs_sb_info *sbi)
{
1392 1393
	return (is_set_ckpt_flags(sbi, CP_UMOUNT_FLAG) ||
			is_set_ckpt_flags(sbi, CP_FASTBOOT_FLAG));
1394 1395
}

1396 1397 1398
/*
 * Check whether the given nid is within node id range.
 */
1399
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1400
{
1401 1402
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1403
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1404 1405
		return -EINVAL;
	return 0;
1406 1407 1408 1409 1410 1411 1412
}

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

1415
	return (inode->i_blocks >> F2FS_LOG_SECTORS_PER_BLOCK) > xattr_block;
1416 1417
}

1418 1419 1420 1421 1422
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

C
Chao Yu 已提交
1423 1424
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,
1425
				 struct inode *inode, blkcnt_t *count)
1426
{
C
Chao Yu 已提交
1427
	blkcnt_t diff = 0, release = 0;
1428
	block_t avail_user_block_count;
C
Chao Yu 已提交
1429 1430 1431 1432 1433
	int ret;

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

J
Jaegeuk Kim 已提交
1435
#ifdef CONFIG_F2FS_FAULT_INJECTION
1436 1437
	if (time_to_inject(sbi, FAULT_BLOCK)) {
		f2fs_show_injection_info(FAULT_BLOCK);
C
Chao Yu 已提交
1438 1439
		release = *count;
		goto enospc;
1440
	}
J
Jaegeuk Kim 已提交
1441
#endif
1442 1443 1444 1445 1446 1447
	/*
	 * 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));

1448 1449
	spin_lock(&sbi->stat_lock);
	sbi->total_valid_block_count += (block_t)(*count);
1450 1451 1452
	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;
1453
		*count -= diff;
C
Chao Yu 已提交
1454
		release = diff;
1455
		sbi->total_valid_block_count = avail_user_block_count;
1456 1457
		if (!*count) {
			spin_unlock(&sbi->stat_lock);
1458
			percpu_counter_sub(&sbi->alloc_valid_block_count, diff);
C
Chao Yu 已提交
1459
			goto enospc;
1460
		}
1461 1462
	}
	spin_unlock(&sbi->stat_lock);
1463

C
Chao Yu 已提交
1464 1465 1466 1467 1468 1469 1470 1471
	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;
1472 1473
}

1474
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1475
						struct inode *inode,
1476
						block_t count)
1477
{
1478 1479
	blkcnt_t sectors = count << F2FS_LOG_SECTORS_PER_BLOCK;

1480
	spin_lock(&sbi->stat_lock);
1481
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
1482
	f2fs_bug_on(sbi, inode->i_blocks < sectors);
1483 1484
	sbi->total_valid_block_count -= (block_t)count;
	spin_unlock(&sbi->stat_lock);
C
Chao Yu 已提交
1485
	f2fs_i_blocks_write(inode, count, false, true);
1486 1487 1488 1489
}

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

1492 1493
	if (count_type == F2FS_DIRTY_DATA || count_type == F2FS_INMEM_PAGES ||
		count_type == F2FS_WB_CP_DATA || count_type == F2FS_WB_DATA)
1494 1495
		return;

1496
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1497 1498
}

1499
static inline void inode_inc_dirty_pages(struct inode *inode)
1500
{
1501
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1502 1503
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1504 1505 1506 1507
}

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1508
	atomic_dec(&sbi->nr_pages[count_type]);
1509 1510
}

1511
static inline void inode_dec_dirty_pages(struct inode *inode)
1512
{
1513 1514
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1515 1516
		return;

1517
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1518 1519
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1520 1521
}

1522
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1523
{
1524
	return atomic_read(&sbi->nr_pages[count_type]);
1525 1526
}

1527
static inline int get_dirty_pages(struct inode *inode)
1528
{
1529
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1530 1531
}

1532 1533
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1534
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1535 1536 1537 1538
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1539 1540
}

1541 1542
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1543
	return sbi->total_valid_block_count;
1544 1545
}

1546 1547 1548 1549 1550
static inline block_t discard_blocks(struct f2fs_sb_info *sbi)
{
	return sbi->discard_blks;
}

1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563
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 已提交
1564 1565 1566 1567 1568
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1569 1570 1571
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1572 1573
	int offset;

W
Wanpeng Li 已提交
1574
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1575 1576 1577
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1578
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1579 1580
	} else {
		offset = (flag == NAT_BITMAP) ?
1581
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1582 1583
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1584 1585 1586 1587
}

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

1590
	if (sbi->cur_cp_pack == 2)
1591
		start_addr += sbi->blocks_per_seg;
1592 1593
	return start_addr;
}
1594

1595 1596 1597
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);
1598

1599 1600
	if (sbi->cur_cp_pack == 1)
		start_addr += sbi->blocks_per_seg;
1601 1602 1603
	return start_addr;
}

1604 1605 1606 1607 1608
static inline void __set_cp_next_pack(struct f2fs_sb_info *sbi)
{
	sbi->cur_cp_pack = (sbi->cur_cp_pack == 1) ? 2 : 1;
}

1609 1610 1611 1612 1613
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 已提交
1614
static inline int inc_valid_node_count(struct f2fs_sb_info *sbi,
1615
					struct inode *inode, bool is_inode)
1616 1617 1618
{
	block_t	valid_block_count;
	unsigned int valid_node_count;
C
Chao Yu 已提交
1619 1620 1621 1622 1623 1624 1625
	bool quota = inode && !is_inode;

	if (quota) {
		int ret = dquot_reserve_block(inode, 1);
		if (ret)
			return ret;
	}
1626 1627 1628

	spin_lock(&sbi->stat_lock);

1629
	valid_block_count = sbi->total_valid_block_count + 1;
1630 1631
	if (unlikely(valid_block_count + sbi->reserved_blocks >
						sbi->user_block_count)) {
1632
		spin_unlock(&sbi->stat_lock);
C
Chao Yu 已提交
1633
		goto enospc;
1634 1635
	}

1636
	valid_node_count = sbi->total_valid_node_count + 1;
1637
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1638
		spin_unlock(&sbi->stat_lock);
C
Chao Yu 已提交
1639
		goto enospc;
1640 1641
	}

1642 1643
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1644 1645
	spin_unlock(&sbi->stat_lock);

1646 1647 1648 1649
	if (inode) {
		if (is_inode)
			f2fs_mark_inode_dirty_sync(inode, true);
		else
C
Chao Yu 已提交
1650
			f2fs_i_blocks_write(inode, 1, true, true);
1651
	}
1652

1653
	percpu_counter_inc(&sbi->alloc_valid_block_count);
C
Chao Yu 已提交
1654 1655 1656 1657 1658 1659
	return 0;

enospc:
	if (quota)
		dquot_release_reservation_block(inode, 1);
	return -ENOSPC;
1660 1661 1662
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1663
					struct inode *inode, bool is_inode)
1664 1665 1666
{
	spin_lock(&sbi->stat_lock);

1667 1668
	f2fs_bug_on(sbi, !sbi->total_valid_block_count);
	f2fs_bug_on(sbi, !sbi->total_valid_node_count);
1669
	f2fs_bug_on(sbi, !is_inode && !inode->i_blocks);
1670

1671 1672
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1673 1674

	spin_unlock(&sbi->stat_lock);
C
Chao Yu 已提交
1675 1676 1677

	if (!is_inode)
		f2fs_i_blocks_write(inode, 1, false, true);
1678 1679 1680 1681
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1682
	return sbi->total_valid_node_count;
1683 1684 1685 1686
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1687
	percpu_counter_inc(&sbi->total_valid_inode_count);
1688 1689
}

1690
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1691
{
1692
	percpu_counter_dec(&sbi->total_valid_inode_count);
1693 1694
}

1695
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1696
{
1697
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1698 1699
}

1700 1701 1702
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1703 1704
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct page *page = find_lock_page(mapping, index);
1705

1706 1707 1708
	if (page)
		return page;

1709 1710
	if (time_to_inject(F2FS_M_SB(mapping), FAULT_PAGE_ALLOC)) {
		f2fs_show_injection_info(FAULT_PAGE_ALLOC);
1711
		return NULL;
1712
	}
1713
#endif
1714 1715 1716 1717 1718
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1719 1720 1721 1722 1723 1724 1725 1726 1727 1728
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);
}

1729 1730
static inline void f2fs_put_page(struct page *page, int unlock)
{
1731
	if (!page)
1732 1733 1734
		return;

	if (unlock) {
1735
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1736 1737
		unlock_page(page);
	}
1738
	put_page(page);
1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751
}

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,
1752
					size_t size)
1753
{
1754
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1755 1756
}

1757 1758 1759 1760 1761
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1762 1763 1764
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1765 1766 1767
	return entry;
}

J
Jaegeuk Kim 已提交
1768 1769 1770 1771 1772 1773
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1774 1775
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1776 1777 1778
	return bio;
}

1779 1780 1781 1782 1783 1784 1785
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();
}

1786 1787 1788 1789
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1790
	struct f2fs_node *p = F2FS_NODE(page);
1791

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

1806
	raw_node = F2FS_NODE(node_page);
1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819
	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;
}

1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837
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;
}

1838
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849
{
	int mask;
	int ret;

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

1850
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861
{
	int mask;
	int ret;

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

1862 1863 1864 1865 1866 1867 1868 1869 1870
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1871 1872 1873
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1874
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1875
	FI_AUTO_RECOVER,	/* indicate inode is recoverable */
1876
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1877 1878 1879
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1880
	FI_FREE_NID,		/* free allocated nide */
1881
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1882
	FI_INLINE_XATTR,	/* used for inline xattr */
1883
	FI_INLINE_DATA,		/* used for inline data*/
1884
	FI_INLINE_DENTRY,	/* used for inline dentry */
1885 1886
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1887 1888
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
C
Chao Yu 已提交
1889
	FI_ATOMIC_COMMIT,	/* indicate the state of atomical committing */
1890
	FI_VOLATILE_FILE,	/* indicate volatile file */
1891
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1892
	FI_DROP_CACHE,		/* drop dirty page cache */
1893
	FI_DATA_EXIST,		/* indicate data exists */
1894
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1895
	FI_DO_DEFRAG,		/* indicate defragment is running */
1896
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1897
	FI_NO_PREALLOC,		/* indicate skipped preallocated blocks */
1898
	FI_HOT_DATA,		/* indicate file is hot */
1899 1900
};

1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911
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:
1912
		f2fs_mark_inode_dirty_sync(inode, true);
1913 1914 1915
	}
}

1916
static inline void set_inode_flag(struct inode *inode, int flag)
1917
{
1918 1919
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1920
	__mark_inode_dirty_flag(inode, flag, true);
1921 1922
}

1923
static inline int is_inode_flag_set(struct inode *inode, int flag)
1924
{
1925
	return test_bit(flag, &F2FS_I(inode)->flags);
1926 1927
}

1928
static inline void clear_inode_flag(struct inode *inode, int flag)
1929
{
1930 1931
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1932
	__mark_inode_dirty_flag(inode, flag, false);
1933 1934
}

1935
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1936
{
1937 1938
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1939
	f2fs_mark_inode_dirty_sync(inode, false);
1940 1941
}

1942
static inline void f2fs_i_links_write(struct inode *inode, bool inc)
1943
{
1944 1945 1946 1947
	if (inc)
		inc_nlink(inode);
	else
		drop_nlink(inode);
1948
	f2fs_mark_inode_dirty_sync(inode, true);
1949 1950
}

1951
static inline void f2fs_i_blocks_write(struct inode *inode,
C
Chao Yu 已提交
1952
					block_t diff, bool add, bool claim)
1953
{
1954 1955 1956
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

C
Chao Yu 已提交
1957 1958 1959 1960 1961 1962 1963 1964 1965 1966
	/* 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);
	}

1967
	f2fs_mark_inode_dirty_sync(inode, true);
1968 1969
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1970 1971
}

1972 1973
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1974 1975 1976
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1977 1978 1979 1980
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
1981
	f2fs_mark_inode_dirty_sync(inode, true);
1982 1983
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1984 1985
}

1986
static inline void f2fs_i_depth_write(struct inode *inode, unsigned int depth)
1987
{
1988
	F2FS_I(inode)->i_current_depth = depth;
1989
	f2fs_mark_inode_dirty_sync(inode, true);
1990 1991
}

1992
static inline void f2fs_i_xnid_write(struct inode *inode, nid_t xnid)
J
Jaegeuk Kim 已提交
1993
{
1994
	F2FS_I(inode)->i_xattr_nid = xnid;
1995
	f2fs_mark_inode_dirty_sync(inode, true);
1996 1997 1998 1999 2000
}

static inline void f2fs_i_pino_write(struct inode *inode, nid_t pino)
{
	F2FS_I(inode)->i_pino = pino;
2001
	f2fs_mark_inode_dirty_sync(inode, true);
2002 2003
}

2004
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
2005
{
2006 2007
	struct f2fs_inode_info *fi = F2FS_I(inode);

J
Jaegeuk Kim 已提交
2008
	if (ri->i_inline & F2FS_INLINE_XATTR)
2009
		set_bit(FI_INLINE_XATTR, &fi->flags);
2010
	if (ri->i_inline & F2FS_INLINE_DATA)
2011
		set_bit(FI_INLINE_DATA, &fi->flags);
2012
	if (ri->i_inline & F2FS_INLINE_DENTRY)
2013
		set_bit(FI_INLINE_DENTRY, &fi->flags);
2014
	if (ri->i_inline & F2FS_DATA_EXIST)
2015
		set_bit(FI_DATA_EXIST, &fi->flags);
2016
	if (ri->i_inline & F2FS_INLINE_DOTS)
2017
		set_bit(FI_INLINE_DOTS, &fi->flags);
J
Jaegeuk Kim 已提交
2018 2019
}

2020
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
2021 2022 2023
{
	ri->i_inline = 0;

2024
	if (is_inode_flag_set(inode, FI_INLINE_XATTR))
J
Jaegeuk Kim 已提交
2025
		ri->i_inline |= F2FS_INLINE_XATTR;
2026
	if (is_inode_flag_set(inode, FI_INLINE_DATA))
2027
		ri->i_inline |= F2FS_INLINE_DATA;
2028
	if (is_inode_flag_set(inode, FI_INLINE_DENTRY))
2029
		ri->i_inline |= F2FS_INLINE_DENTRY;
2030
	if (is_inode_flag_set(inode, FI_DATA_EXIST))
2031
		ri->i_inline |= F2FS_DATA_EXIST;
2032
	if (is_inode_flag_set(inode, FI_INLINE_DOTS))
2033
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
2034 2035
}

2036 2037
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
2038
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
2039 2040
}

2041
static inline unsigned int addrs_per_inode(struct inode *inode)
2042
{
2043
	if (f2fs_has_inline_xattr(inode))
2044 2045 2046 2047
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
2048 2049
static inline void *inline_xattr_addr(struct page *page)
{
2050
	struct f2fs_inode *ri = F2FS_INODE(page);
2051

J
Jaegeuk Kim 已提交
2052 2053 2054 2055 2056 2057
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
2058
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
2059 2060 2061 2062 2063
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

2064 2065
static inline int f2fs_has_inline_data(struct inode *inode)
{
2066
	return is_inode_flag_set(inode, FI_INLINE_DATA);
2067 2068
}

2069 2070
static inline int f2fs_exist_data(struct inode *inode)
{
2071
	return is_inode_flag_set(inode, FI_DATA_EXIST);
2072 2073
}

2074 2075
static inline int f2fs_has_inline_dots(struct inode *inode)
{
2076
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
2077 2078
}

J
Jaegeuk Kim 已提交
2079 2080
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
2081
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
2082 2083
}

C
Chao Yu 已提交
2084 2085 2086 2087 2088
static inline bool f2fs_is_commit_atomic_write(struct inode *inode)
{
	return is_inode_flag_set(inode, FI_ATOMIC_COMMIT);
}

2089 2090
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
2091
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
2092 2093
}

2094 2095
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
2096
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
2097 2098
}

2099 2100
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
2101
	return is_inode_flag_set(inode, FI_DROP_CACHE);
2102 2103
}

C
Chao Yu 已提交
2104
static inline void *inline_data_addr(struct inode *inode, struct page *page)
2105
{
2106
	struct f2fs_inode *ri = F2FS_INODE(page);
C
Chao Yu 已提交
2107
	int reserved_size = get_inline_reserved_size(inode);
2108

C
Chao Yu 已提交
2109
	return (void *)&(ri->i_addr[reserved_size]);
2110 2111
}

2112 2113
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
2114
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
2115 2116
}

2117 2118 2119 2120 2121 2122
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

2123 2124 2125 2126 2127 2128 2129 2130
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;
2131
	f2fs_mark_inode_dirty_sync(inode, true);
2132 2133 2134 2135 2136
}

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

2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155
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);
2156 2157
}

J
Jaegeuk Kim 已提交
2158 2159 2160 2161 2162
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

2163 2164
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
2165
	return is_set_ckpt_flags(sbi, CP_ERROR_FLAG);
2166 2167
}

2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178
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 已提交
2179 2180 2181
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
2182
			is_inode_flag_set(inode, FI_NO_EXTENT))
J
Jaegeuk Kim 已提交
2183 2184
		return false;

A
Al Viro 已提交
2185
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
2186 2187
}

2188 2189
static inline void *f2fs_kmalloc(struct f2fs_sb_info *sbi,
					size_t size, gfp_t flags)
2190
{
J
Jaegeuk Kim 已提交
2191
#ifdef CONFIG_F2FS_FAULT_INJECTION
2192 2193
	if (time_to_inject(sbi, FAULT_KMALLOC)) {
		f2fs_show_injection_info(FAULT_KMALLOC);
J
Jaegeuk Kim 已提交
2194
		return NULL;
2195
	}
J
Jaegeuk Kim 已提交
2196
#endif
2197 2198 2199
	return kmalloc(size, flags);
}

C
Chao Yu 已提交
2200 2201 2202 2203 2204
static inline int get_inline_reserved_size(struct inode *inode)
{
	return F2FS_I(inode)->i_inline_reserved;
}

2205
#define get_inode_mode(i) \
2206
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
2207 2208
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

2209 2210 2211
/*
 * file.c
 */
2212 2213 2214 2215
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);
2216 2217
int f2fs_getattr(const struct path *path, struct kstat *stat,
			u32 request_mask, unsigned int flags);
2218 2219 2220 2221 2222
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);
2223 2224 2225 2226

/*
 * inode.c
 */
2227 2228 2229 2230 2231 2232 2233 2234 2235
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);
2236 2237 2238 2239 2240 2241 2242 2243 2244

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

/*
 * dir.c
 */
2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283
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);
2284

2285 2286
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
2287
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
2288
				inode, inode->i_ino, inode->i_mode);
2289 2290
}

2291 2292 2293
/*
 * super.c
 */
2294 2295 2296 2297
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);
2298
extern __printf(3, 4)
2299
void f2fs_msg(struct super_block *sb, const char *level, const char *fmt, ...);
2300
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
2301 2302 2303 2304

/*
 * hash.c
 */
2305 2306
f2fs_hash_t f2fs_dentry_hash(const struct qstr *name_info,
				struct fscrypt_name *fname);
2307 2308 2309 2310 2311 2312 2313

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

2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325
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);
Y
Yunlei He 已提交
2326
struct page *new_node_page(struct dnode_of_data *dn, unsigned int ofs);
2327 2328 2329 2330 2331 2332 2333
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);
2334
void build_free_nids(struct f2fs_sb_info *sbi, bool sync, bool mount);
2335 2336 2337 2338 2339
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);
2340
int recover_xattr_data(struct inode *inode, struct page *page,
2341 2342 2343 2344
			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);
2345
void flush_nat_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc);
2346 2347
int build_node_manager(struct f2fs_sb_info *sbi);
void destroy_node_manager(struct f2fs_sb_info *sbi);
2348
int __init create_node_manager_caches(void);
2349 2350 2351 2352 2353
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
2354 2355
void register_inmem_page(struct inode *inode, struct page *page);
void drop_inmem_pages(struct inode *inode);
2356
void drop_inmem_page(struct inode *inode, struct page *page);
2357 2358 2359 2360 2361 2362 2363 2364 2365
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);
2366
void stop_discard_thread(struct f2fs_sb_info *sbi);
C
Chao Yu 已提交
2367
void f2fs_wait_discard_bios(struct f2fs_sb_info *sbi);
2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378
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);
2379
int rewrite_data_page(struct f2fs_io_info *fio);
2380 2381 2382 2383 2384 2385 2386 2387 2388
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,
2389 2390
			struct f2fs_summary *sum, int type,
			struct f2fs_io_info *fio, bool add_list);
2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401
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);
2402 2403
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
2404 2405 2406 2407

/*
 * checkpoint.c
 */
2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433
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);
2434
int __init create_checkpoint_caches(void);
2435 2436 2437 2438 2439
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
2440 2441
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,
2442
				struct inode *inode, nid_t ino, pgoff_t idx,
2443 2444
				enum page_type type);
void f2fs_flush_merged_writes(struct f2fs_sb_info *sbi);
2445
int f2fs_submit_page_bio(struct f2fs_io_info *fio);
2446
int f2fs_submit_page_write(struct f2fs_io_info *fio);
2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472
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);
2473
#ifdef CONFIG_MIGRATION
2474 2475
int f2fs_migrate_page(struct address_space *mapping, struct page *newpage,
			struct page *page, enum migrate_mode mode);
2476
#endif
2477 2478 2479 2480

/*
 * gc.c
 */
2481 2482 2483
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);
2484 2485
int f2fs_gc(struct f2fs_sb_info *sbi, bool sync, bool background,
			unsigned int segno);
2486
void build_gc_manager(struct f2fs_sb_info *sbi);
2487 2488 2489 2490

/*
 * recovery.c
 */
2491 2492
int recover_fsync_data(struct f2fs_sb_info *sbi, bool check_only);
bool space_for_roll_forward(struct f2fs_sb_info *sbi);
2493 2494 2495 2496 2497 2498 2499 2500 2501 2502

/*
 * 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;
2503 2504
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
2505
	int ext_tree, zombie_tree, ext_node;
2506 2507
	int ndirty_node, ndirty_dent, ndirty_meta, ndirty_data, ndirty_imeta;
	int inmem_pages;
2508
	unsigned int ndirty_dirs, ndirty_files, ndirty_all;
2509 2510
	int nats, dirty_nats, sits, dirty_sits;
	int free_nids, avail_nids, alloc_nids;
2511
	int total_count, utilization;
C
Chao Yu 已提交
2512 2513
	int bg_gc, nr_wb_cp_data, nr_wb_data;
	int nr_flushing, nr_flushed, nr_discarding, nr_discarded;
C
Chao Yu 已提交
2514
	int nr_discard_cmd;
C
Chao Yu 已提交
2515
	unsigned int undiscard_blks;
2516
	int inline_xattr, inline_inode, inline_dir, append, update, orphans;
2517
	int aw_cnt, max_aw_cnt, vw_cnt, max_vw_cnt;
2518
	unsigned int valid_count, valid_node_count, valid_inode_count, discard_blks;
2519 2520 2521 2522
	unsigned int bimodal, avg_vblocks;
	int util_free, util_valid, util_invalid;
	int rsvd_segs, overp_segs;
	int dirty_count, node_pages, meta_pages;
2523
	int prefree_count, call_count, cp_count, bg_cp_count;
2524
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
2525
	int bg_node_segs, bg_data_segs;
2526
	int tot_blks, data_blks, node_blks;
2527
	int bg_data_blks, bg_node_blks;
2528 2529 2530 2531 2532 2533
	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];
2534
	unsigned int inplace_count;
C
Chao Yu 已提交
2535
	unsigned long long base_mem, cache_mem, page_mem;
2536 2537
};

2538 2539
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2540
	return (struct f2fs_stat_info *)sbi->stat_info;
2541 2542
}

2543
#define stat_inc_cp_count(si)		((si)->cp_count++)
2544
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
2545 2546
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
2547 2548
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
2549 2550 2551 2552
#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 已提交
2553 2554 2555 2556 2557 2558 2559 2560 2561 2562
#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)
2563 2564 2565
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2566
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
2567 2568 2569 2570
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2571
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
2572
	} while (0)
2573 2574 2575
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2576
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
2577 2578 2579 2580
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2581
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
2582
	} while (0)
2583 2584 2585 2586
#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]++)
2587 2588
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2589
#define stat_inc_atomic_write(inode)					\
2590
		(atomic_inc(&F2FS_I_SB(inode)->aw_cnt))
2591
#define stat_dec_atomic_write(inode)					\
2592
		(atomic_dec(&F2FS_I_SB(inode)->aw_cnt))
2593 2594 2595 2596 2597 2598 2599
#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)
2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610
#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)
2611
#define stat_inc_seg_count(sbi, type, gc_type)				\
2612
	do {								\
2613
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2614 2615
		si->tot_segs++;						\
		if ((type) == SUM_TYPE_DATA) {				\
2616
			si->data_segs++;				\
2617 2618
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2619
			si->node_segs++;				\
2620 2621
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2622 2623 2624
	} while (0)

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

2627
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2628
	do {								\
2629
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2630 2631
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2632
		si->bg_data_blks += ((gc_type) == BG_GC) ? (blks) : 0;	\
2633 2634
	} while (0)

2635
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2636
	do {								\
2637
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2638 2639
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2640
		si->bg_node_blks += ((gc_type) == BG_GC) ? (blks) : 0;	\
2641 2642
	} while (0)

2643 2644
int f2fs_build_stats(struct f2fs_sb_info *sbi);
void f2fs_destroy_stats(struct f2fs_sb_info *sbi);
2645
int __init f2fs_create_root_stats(void);
2646
void f2fs_destroy_root_stats(void);
2647
#else
2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676
#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)
2677 2678 2679

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2680
static inline int __init f2fs_create_root_stats(void) { return 0; }
2681
static inline void f2fs_destroy_root_stats(void) { }
2682 2683 2684 2685 2686 2687 2688 2689 2690 2691
#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;
2692
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2693
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2694
extern struct kmem_cache *inode_entry_slab;
2695

2696 2697 2698
/*
 * inline.c
 */
2699 2700 2701
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);
2702
void truncate_inline_inode(struct inode *inode, struct page *ipage, u64 from);
2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722
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);
2723

2724 2725 2726
/*
 * shrinker.c
 */
2727 2728 2729 2730 2731 2732
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);
2733

2734 2735 2736
/*
 * extent_cache.c
 */
2737 2738 2739 2740 2741 2742 2743 2744 2745 2746
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);
2747 2748
bool __check_rb_tree_consistence(struct f2fs_sb_info *sbi,
						struct rb_root *root);
2749 2750 2751 2752 2753 2754 2755 2756
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 已提交
2757
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
2758 2759
			pgoff_t fofs, block_t blkaddr, unsigned int len);
void init_extent_cache_info(struct f2fs_sb_info *sbi);
2760 2761 2762
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2763 2764 2765 2766 2767 2768 2769 2770
/*
 * 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);

2771 2772 2773
/*
 * crypto support
 */
2774
static inline bool f2fs_encrypted_inode(struct inode *inode)
2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787
{
	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)
{
2788
	return bio->bi_private != NULL;
2789 2790 2791 2792 2793 2794
}

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

2796
static inline int f2fs_sb_mounted_blkzoned(struct super_block *sb)
2797
{
2798
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_BLKZONED);
2799 2800
}

2801 2802
#ifdef CONFIG_BLK_DEV_ZONED
static inline int get_blkz_type(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
2803
			struct block_device *bdev, block_t blkaddr)
2804 2805
{
	unsigned int zno = blkaddr >> sbi->log_blocks_per_blkz;
J
Jaegeuk Kim 已提交
2806
	int i;
2807

J
Jaegeuk Kim 已提交
2808 2809 2810 2811
	for (i = 0; i < sbi->s_ndevs; i++)
		if (FDEV(i).bdev == bdev)
			return FDEV(i).blkz_type[zno];
	return -EINVAL;
2812 2813 2814
}
#endif

2815
static inline bool f2fs_discard_en(struct f2fs_sb_info *sbi)
2816
{
2817 2818 2819
	struct request_queue *q = bdev_get_queue(sbi->sb->s_bdev);

	return blk_queue_discard(q) || f2fs_sb_mounted_blkzoned(sbi->sb);
2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836
}

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

2837 2838 2839
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2840
	umode_t mode = inode->i_mode;
2841 2842 2843 2844 2845 2846 2847

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

2848
#endif