f2fs.h 78.0 KB
Newer Older
J
Jaegeuk Kim 已提交
1
/*
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
 * fs/f2fs/f2fs.h
 *
 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
 *             http://www.samsung.com/
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */
#ifndef _LINUX_F2FS_H
#define _LINUX_F2FS_H

#include <linux/types.h>
#include <linux/page-flags.h>
#include <linux/buffer_head.h>
#include <linux/slab.h>
#include <linux/crc32.h>
#include <linux/magic.h>
20
#include <linux/kobject.h>
21
#include <linux/sched.h>
22
#include <linux/vmalloc.h>
J
Jaegeuk Kim 已提交
23
#include <linux/bio.h>
24
#include <linux/blkdev.h>
25
#include <linux/fscrypto.h>
K
Keith Mok 已提交
26
#include <crypto/hash.h>
27

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

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

S
Sheng Yong 已提交
54 55 56 57 58 59
struct f2fs_fault_info {
	atomic_t inject_ops;
	unsigned int inject_rate;
	unsigned int inject_type;
};

J
Jaegeuk Kim 已提交
60
extern char *fault_name[FAULT_MAX];
61
#define IS_FAULT_SET(fi, type) (fi->inject_type & (1 << (type)))
J
Jaegeuk Kim 已提交
62 63
#endif

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

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

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

95 96 97 98
typedef u32 block_t;	/*
			 * should not change u32, since it is the on-disk block
			 * address format, __le32.
			 */
99 100 101 102 103 104
typedef u32 nid_t;

struct f2fs_mount_info {
	unsigned int	opt;
};

105
#define F2FS_FEATURE_ENCRYPT	0x0001
106
#define F2FS_FEATURE_BLKZONED	0x0002
107

108 109 110 111 112 113 114
#define F2FS_HAS_FEATURE(sb, mask)					\
	((F2FS_SB(sb)->raw_super->feature & cpu_to_le32(mask)) != 0)
#define F2FS_SET_FEATURE(sb, mask)					\
	F2FS_SB(sb)->raw_super->feature |= cpu_to_le32(mask)
#define F2FS_CLEAR_FEATURE(sb, mask)					\
	F2FS_SB(sb)->raw_super->feature &= ~cpu_to_le32(mask)

115 116 117 118 119 120 121 122
/*
 * For checkpoint manager
 */
enum {
	NAT_BITMAP,
	SIT_BITMAP
};

123 124
enum {
	CP_UMOUNT,
125
	CP_FASTBOOT,
126
	CP_SYNC,
127
	CP_RECOVERY,
128
	CP_DISCARD,
129 130
};

J
Jaegeuk Kim 已提交
131
#define DEF_BATCHED_TRIM_SECTIONS	2
J
Jaegeuk Kim 已提交
132 133
#define BATCHED_TRIM_SEGMENTS(sbi)	\
		(SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
134 135
#define BATCHED_TRIM_BLOCKS(sbi)	\
		(BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
136 137

#define DISCARD_ISSUE_RATE	8
138
#define DEF_CP_INTERVAL			60	/* 60 secs */
139
#define DEF_IDLE_INTERVAL		5	/* 5 secs */
J
Jaegeuk Kim 已提交
140

141 142
struct cp_control {
	int reason;
143 144 145 146
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
147 148
};

149
/*
150
 * For CP/NAT/SIT/SSA readahead
151 152 153 154
 */
enum {
	META_CP,
	META_NAT,
155
	META_SIT,
156 157
	META_SSA,
	META_POR,
158 159
};

J
Jaegeuk Kim 已提交
160 161 162
/* for the list of ino */
enum {
	ORPHAN_INO,		/* for orphan ino list */
163 164
	APPEND_INO,		/* for append ino list */
	UPDATE_INO,		/* for update ino list */
J
Jaegeuk Kim 已提交
165 166 167 168
	MAX_INO_ENTRY,		/* max. list */
};

struct ino_entry {
169 170 171 172
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

173
/* for the list of inodes to be GCed */
174
struct inode_entry {
175 176 177 178
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

179 180 181 182 183 184 185
/* for the list of blockaddresses to be discarded */
struct discard_entry {
	struct list_head list;	/* list head */
	block_t blkaddr;	/* block address to be discarded */
	int len;		/* # of consecutive blocks of the discard */
};

186 187 188 189 190 191
enum {
	D_PREP,
	D_SUBMIT,
	D_DONE,
};

192 193 194 195 196 197
struct discard_cmd {
	struct list_head list;		/* command list */
	struct completion wait;		/* compleation */
	block_t lstart;			/* logical start address */
	block_t len;			/* length */
	struct bio *bio;		/* bio */
198
	int state;			/* state */
C
Chao Yu 已提交
199 200
};

201
struct discard_cmd_control {
202
	struct task_struct *f2fs_issue_discard;	/* discard thread */
203 204 205
	struct list_head discard_entry_list;	/* 4KB discard entry list */
	int nr_discards;			/* # of discards in the list */
	struct list_head discard_cmd_list;	/* discard cmd list */
206 207
	wait_queue_head_t discard_wait_queue;	/* waiting queue for wake-up */
	struct mutex cmd_lock;
208 209 210
	int max_discards;			/* max. discards to be issued */
};

211 212 213 214
/* 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 */
215 216
	block_t blkaddr;	/* block address locating the last fsync */
	block_t last_dentry;	/* block address locating the last dentry */
217 218
};

219 220
#define nats_in_cursum(jnl)		(le16_to_cpu(jnl->n_nats))
#define sits_in_cursum(jnl)		(le16_to_cpu(jnl->n_sits))
221

222 223 224 225
#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)
226

227 228
#define MAX_NAT_JENTRIES(jnl)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(jnl))
#define MAX_SIT_JENTRIES(jnl)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(jnl))
229

230
static inline int update_nats_in_cursum(struct f2fs_journal *journal, int i)
231
{
232 233
	int before = nats_in_cursum(journal);
	journal->n_nats = cpu_to_le16(before + i);
234 235 236
	return before;
}

237
static inline int update_sits_in_cursum(struct f2fs_journal *journal, int i)
238
{
239 240
	int before = sits_in_cursum(journal);
	journal->n_sits = cpu_to_le16(before + i);
241 242 243
	return before;
}

244 245
static inline bool __has_cursum_space(struct f2fs_journal *journal,
							int size, int type)
246 247
{
	if (type == NAT_JOURNAL)
248 249
		return size <= MAX_NAT_JENTRIES(journal);
	return size <= MAX_SIT_JENTRIES(journal);
250 251
}

252 253 254
/*
 * ioctl commands
 */
J
Jaegeuk Kim 已提交
255 256
#define F2FS_IOC_GETFLAGS		FS_IOC_GETFLAGS
#define F2FS_IOC_SETFLAGS		FS_IOC_SETFLAGS
C
Chao Yu 已提交
257
#define F2FS_IOC_GETVERSION		FS_IOC_GETVERSION
J
Jaegeuk Kim 已提交
258 259 260 261

#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)
262
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
263 264
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
265
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
266
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
C
Chao Yu 已提交
267
#define F2FS_IOC_DEFRAGMENT		_IO(F2FS_IOCTL_MAGIC, 8)
268 269
#define F2FS_IOC_MOVE_RANGE		_IOWR(F2FS_IOCTL_MAGIC, 9,	\
						struct f2fs_move_range)
270

271 272 273
#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
274

J
Jaegeuk Kim 已提交
275 276 277 278 279 280 281 282
/*
 * 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 */
283
#define F2FS_GOING_DOWN_METAFLUSH	0x3	/* going down with meta flush */
J
Jaegeuk Kim 已提交
284

285 286 287 288
#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
/*
 * ioctl commands in 32 bit emulation
 */
289 290 291
#define F2FS_IOC32_GETFLAGS		FS_IOC32_GETFLAGS
#define F2FS_IOC32_SETFLAGS		FS_IOC32_SETFLAGS
#define F2FS_IOC32_GETVERSION		FS_IOC32_GETVERSION
292 293
#endif

C
Chao Yu 已提交
294 295 296 297 298
struct f2fs_defragment {
	u64 start;
	u64 len;
};

299 300 301 302 303 304 305
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 */
};

306 307 308
/*
 * For INODE and NODE manager
 */
309 310
/* for directory operations */
struct f2fs_dentry_ptr {
311
	struct inode *inode;
312 313 314 315 316 317
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

318 319
static inline void make_dentry_ptr(struct inode *inode,
		struct f2fs_dentry_ptr *d, void *src, int type)
320
{
321 322
	d->inode = inode;

323 324 325 326 327 328 329 330 331 332 333 334 335 336 337
	if (type == 1) {
		struct f2fs_dentry_block *t = (struct f2fs_dentry_block *)src;
		d->max = NR_DENTRY_IN_BLOCK;
		d->bitmap = &t->dentry_bitmap;
		d->dentry = t->dentry;
		d->filename = t->filename;
	} else {
		struct f2fs_inline_dentry *t = (struct f2fs_inline_dentry *)src;
		d->max = NR_INLINE_DENTRY;
		d->bitmap = &t->dentry_bitmap;
		d->dentry = t->dentry;
		d->filename = t->filename;
	}
}

338 339 340 341 342 343 344
/*
 * 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)
345 346 347 348 349
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 已提交
350
					 * by get_data_block.
351
					 */
352 353
};

354
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
355

356 357
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

358 359 360
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

361
/* for in-memory extent cache entry */
362 363 364 365
#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
366

367
struct extent_info {
368 369 370 371 372 373 374 375 376
	unsigned int fofs;		/* start offset in a file */
	u32 blk;			/* start block address of the extent */
	unsigned int len;		/* length of the extent */
};

struct extent_node {
	struct rb_node rb_node;		/* rb node located in rb-tree */
	struct list_head list;		/* node in global extent list of sbi */
	struct extent_info ei;		/* extent info */
377
	struct extent_tree *et;		/* extent tree pointer */
378 379 380 381 382
};

struct extent_tree {
	nid_t ino;			/* inode number */
	struct rb_root root;		/* root of extent info rb-tree */
383
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
384
	struct extent_info largest;	/* largested extent info */
385
	struct list_head list;		/* to be used by sbi->zombie_list */
386
	rwlock_t lock;			/* protect extent info rb-tree */
387
	atomic_t node_cnt;		/* # of extent node in rb-tree*/
388 389
};

J
Jaegeuk Kim 已提交
390 391 392 393 394 395 396
/*
 * 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)
397 398 399
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
400 401 402 403 404 405

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

C
Chao Yu 已提交
409 410 411 412 413
/* 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
414
#define F2FS_GET_BLOCK_PRE_DIO		4
415
#define F2FS_GET_BLOCK_PRE_AIO		5
C
Chao Yu 已提交
416

417 418 419 420
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
421
#define FADVISE_LOST_PINO_BIT	0x02
422
#define FADVISE_ENCRYPT_BIT	0x04
423
#define FADVISE_ENC_NAME_BIT	0x08
424
#define FADVISE_KEEP_SIZE_BIT	0x10
425

426 427 428 429 430 431
#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)
432 433 434
#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)
435 436
#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)
437 438
#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)
439

440 441
#define DEF_DIR_LEVEL		0

442 443 444 445
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 */
446
	unsigned char i_dir_level;	/* use for dentry level for large dir */
447
	unsigned int i_current_depth;	/* use only in directory structure */
448
	unsigned int i_pino;		/* parent inode number */
449 450 451 452
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
453
	struct rw_semaphore i_sem;	/* protect fi info */
454
	atomic_t dirty_pages;		/* # of dirty pages */
455 456 457
	f2fs_hash_t chash;		/* hash value of given file name */
	unsigned int clevel;		/* maximum level of given file name */
	nid_t i_xattr_nid;		/* node id that contains xattrs */
458
	unsigned long long xattr_ver;	/* cp version of xattr modification */
459
	loff_t	last_disk_size;		/* lastly written file size */
J
Jaegeuk Kim 已提交
460

461 462
	struct list_head dirty_list;	/* dirty list for dirs and files */
	struct list_head gdirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
463 464
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
J
Jaegeuk Kim 已提交
465
	struct extent_tree *extent_tree;	/* cached extent_tree entry */
466
	struct rw_semaphore dio_rwsem[2];/* avoid racing between dio and gc */
467 468 469
};

static inline void get_extent_info(struct extent_info *ext,
C
Chao Yu 已提交
470
					struct f2fs_extent *i_ext)
471
{
C
Chao Yu 已提交
472 473 474
	ext->fofs = le32_to_cpu(i_ext->fofs);
	ext->blk = le32_to_cpu(i_ext->blk);
	ext->len = le32_to_cpu(i_ext->len);
475 476 477 478 479 480
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	i_ext->fofs = cpu_to_le32(ext->fofs);
481
	i_ext->blk = cpu_to_le32(ext->blk);
482 483 484
	i_ext->len = cpu_to_le32(ext->len);
}

485 486 487 488 489 490 491 492
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;
}

493 494 495 496 497 498 499
static inline bool __is_extent_same(struct extent_info *ei1,
						struct extent_info *ei2)
{
	return (ei1->fofs == ei2->fofs && ei1->blk == ei2->blk &&
						ei1->len == ei2->len);
}

500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518
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);
}

519
extern void f2fs_mark_inode_dirty_sync(struct inode *, bool);
520 521
static inline void __try_update_largest_extent(struct inode *inode,
			struct extent_tree *et, struct extent_node *en)
522
{
523
	if (en->ei.len > et->largest.len) {
524
		et->largest = en->ei;
525
		f2fs_mark_inode_dirty_sync(inode, true);
526
	}
527 528
}

C
Chao Yu 已提交
529 530 531 532 533 534
enum nid_list {
	FREE_NID_LIST,
	ALLOC_NID_LIST,
	MAX_NID_LIST,
};

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

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
546
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
547
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
548
	struct list_head nat_entries;	/* cached nat entry list (clean) */
549
	unsigned int nat_cnt;		/* the # of cached nat entries */
550
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
551 552

	/* free node ids management */
553
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
C
Chao Yu 已提交
554 555 556
	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 */
557 558 559 560
	struct mutex build_lock;	/* lock for build free nids */

	/* for checkpoint */
	char *nat_bitmap;		/* NAT bitmap pointer */
561 562 563
#ifdef CONFIG_F2FS_CHECK_FS
	char *nat_bitmap_mir;		/* NAT bitmap mirror */
#endif
564 565 566 567 568 569 570 571 572 573 574 575 576 577 578
	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 */
579
	bool node_changed;		/* is node block changed */
580 581
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
582 583 584 585 586 587
	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)
{
588
	memset(dn, 0, sizeof(*dn));
589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618
	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 */
619
	NO_CHECK_TYPE,
620 621
};

622 623
struct flush_cmd {
	struct completion wait;
624
	struct llist_node llnode;
625 626 627
	int ret;
};

628 629 630
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
631
	atomic_t submit_flush;			/* # of issued flushes */
632 633
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
634 635
};

636 637 638 639 640 641 642 643 644 645 646 647 648 649
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 */
650 651 652

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

J
Jaegeuk Kim 已提交
654 655 656
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

657 658
	struct list_head sit_entry_set;	/* sit entry set list */

659 660
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
661
	unsigned int min_fsync_blocks;	/* threshold for fsync */
662 663

	/* for flush command control */
664
	struct flush_cmd_control *fcc_info;
665 666 667

	/* for discard command control */
	struct discard_cmd_control *dcc_info;
668 669 670 671 672 673 674 675 676 677 678
};

/*
 * 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.
 */
679
#define WB_DATA_TYPE(p)	(__is_cp_guaranteed(p) ? F2FS_WB_CP_DATA : F2FS_WB_DATA)
680 681
enum count_type {
	F2FS_DIRTY_DENTS,
682
	F2FS_DIRTY_DATA,
683 684
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
685
	F2FS_INMEM_PAGES,
686
	F2FS_DIRTY_IMETA,
687 688
	F2FS_WB_CP_DATA,
	F2FS_WB_DATA,
689 690 691 692
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
693
 * The below are the page types of bios used in submit_bio().
694 695 696 697 698 699 700 701 702
 * 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.
 */
703
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
704 705 706 707 708 709
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
710 711
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
712
	INMEM_REVOKE,
713 714
	IPU,
	OPU,
715 716
};

J
Jaegeuk Kim 已提交
717
struct f2fs_io_info {
718
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
719
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
M
Mike Christie 已提交
720
	int op;			/* contains REQ_OP_ */
721
	int op_flags;		/* req_flag_bits */
722
	block_t new_blkaddr;	/* new block address to be written */
723
	block_t old_blkaddr;	/* old block address before Cow */
724
	struct page *page;	/* page to be written */
725
	struct page *encrypted_page;	/* encrypted page */
J
Jaegeuk Kim 已提交
726 727
};

M
Mike Christie 已提交
728
#define is_read_io(rw) (rw == READ)
729
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
730
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
731 732
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
733
	struct f2fs_io_info fio;	/* store buffered io info. */
734
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
735 736
};

J
Jaegeuk Kim 已提交
737 738 739 740 741 742 743 744 745 746 747 748 749 750
#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
};

751 752 753
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
754
	DIRTY_META,			/* for all dirtied inode metadata */
755 756 757
	NR_INODE_TYPE,
};

758 759 760 761 762 763 764 765
/* 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 */
};

766 767 768 769 770 771
/* 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 */
772
	SBI_NEED_SB_WRITE,			/* need to recover superblock */
773
	SBI_NEED_CP,				/* need to checkpoint */
774 775
};

776 777
enum {
	CP_TIME,
778
	REQ_TIME,
779 780 781
	MAX_TIME,
};

782 783 784 785
#ifdef CONFIG_F2FS_FS_ENCRYPTION
#define F2FS_KEY_DESC_PREFIX "f2fs:"
#define F2FS_KEY_DESC_PREFIX_SIZE 5
#endif
786 787
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
788
	struct proc_dir_entry *s_proc;		/* proc entry */
789
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
790
	int valid_super_block;			/* valid super block no */
791
	unsigned long s_flag;				/* flags for sbi */
792

793 794 795 796
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	u8 key_prefix[F2FS_KEY_DESC_PREFIX_SIZE];
	u8 key_prefix_size;
#endif
797 798 799 800 801 802

#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

803 804 805 806 807 808
	/* 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 */
809 810

	/* for bio operations */
811
	struct f2fs_bio_info read_io;			/* for read bios */
812
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
813
	struct mutex wio_mutex[NODE + 1];	/* bio ordering for NODE/DATA */
814 815
	int write_io_size_bits;			/* Write IO size bits */
	mempool_t *write_io_dummy;		/* Dummy pages */
816 817 818

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
819
	int cur_cp_pack;			/* remain current cp pack */
820
	spinlock_t cp_lock;			/* for flag in ckpt */
821
	struct inode *meta_inode;		/* cache meta blocks */
822
	struct mutex cp_mutex;			/* checkpoint procedure lock */
823
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
824
	struct rw_semaphore node_write;		/* locking node writes */
825
	wait_queue_head_t cp_wait;
826 827
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
828

829
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
830 831

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

834 835 836
	/* 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 */
837

838 839 840 841 842
	/* for extent tree cache */
	struct radix_tree_root extent_tree_root;/* cache extent cache entries */
	struct rw_semaphore extent_tree_lock;	/* locking extent radix tree */
	struct list_head extent_list;		/* lru list for shrinker */
	spinlock_t extent_lock;			/* locking extent lru list */
843
	atomic_t total_ext_tree;		/* extent tree count */
844
	struct list_head zombie_list;		/* extent zombie tree list */
845
	atomic_t total_zombie_tree;		/* extent zombie tree count */
846 847
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
848
	/* basic filesystem units */
849 850 851 852 853 854 855 856 857 858 859 860 861
	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 已提交
862
	loff_t max_file_blocks;			/* max block index of file */
863
	int active_logs;			/* # of active logs */
864
	int dir_level;				/* directory level */
865 866 867

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
868
	block_t discard_blks;			/* discard command candidats */
869 870
	block_t last_valid_block_count;		/* for recovery */
	u32 s_next_generation;			/* for NFS support */
871 872

	/* # of pages, see count_type */
873
	atomic_t nr_pages[NR_COUNT_TYPE];
874 875
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
876

877 878 879
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

880 881 882 883 884
	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 */
885
	unsigned int cur_victim_sec;		/* current victim section num */
886

887 888 889
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

890 891 892 893
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
894
#ifdef CONFIG_F2FS_STAT_FS
895 896 897
	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 */
898
	atomic_t inplace_count;		/* # of inplace update */
899 900 901 902
	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 已提交
903
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
904 905
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
906 907
	atomic_t aw_cnt;			/* # of atomic writes */
	atomic_t max_aw_cnt;			/* max # of atomic writes */
908
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
909
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
910 911
#endif
	unsigned int last_victim[2];		/* last victim segment # */
912
	spinlock_t stat_lock;			/* lock for stat operations */
913 914 915 916

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
917 918 919

	/* For shrinker support */
	struct list_head s_list;
J
Jaegeuk Kim 已提交
920 921
	int s_ndevs;				/* number of devices */
	struct f2fs_dev_info *devs;		/* for device list */
922 923
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
924 925 926 927

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
928 929 930

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
931 932 933 934 935

	/* For fault injection */
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct f2fs_fault_info fault_info;
#endif
936 937
};

938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961
#ifdef CONFIG_F2FS_FAULT_INJECTION
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);
		printk("%sF2FS-fs : inject %s in %pF\n",
				KERN_INFO,
				fault_name[type],
				__builtin_return_address(0));
		return true;
	}
	return false;
}
#endif

962 963 964 965 966 967 968
/* For write statistics. Suppose sector size is 512 bytes,
 * and the return value is in kbytes. s is of struct f2fs_sb_info.
 */
#define BD_PART_WRITTEN(s)						 \
(((u64)part_stat_read(s->sb->s_bdev->bd_part, sectors[1]) -		 \
		s->sectors_written_start) >> 1)

969 970 971 972 973 974 975 976 977 978 979 980 981
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);
}

982 983 984 985 986 987 988 989 990 991 992 993
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);
}

994 995 996
/*
 * Inline functions
 */
K
Keith Mok 已提交
997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019
static inline u32 f2fs_crc32(struct f2fs_sb_info *sbi, const void *address,
			   unsigned int length)
{
	SHASH_DESC_ON_STACK(shash, sbi->s_chksum_driver);
	u32 *ctx = (u32 *)shash_desc_ctx(shash);
	int err;

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

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

	return *ctx;
}

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

1020 1021 1022 1023 1024 1025 1026 1027 1028 1029
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;
}

1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044
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);
}

1045 1046 1047 1048 1049 1050 1051 1052 1053 1054
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);
}

1055 1056 1057 1058 1059
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

1060 1061 1062 1063 1064
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089
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 已提交
1090 1091 1092 1093 1094
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

1095 1096 1097 1098 1099
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1100 1101
static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
{
1102
	return test_bit(type, &sbi->s_flag);
1103 1104 1105
}

static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1106
{
1107
	set_bit(type, &sbi->s_flag);
1108 1109
}

1110
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1111
{
1112
	clear_bit(type, &sbi->s_flag);
1113 1114
}

1115 1116 1117 1118 1119
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

1120
static inline bool __is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
1121 1122
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1123

1124 1125 1126
	return ckpt_flags & f;
}

1127
static inline bool is_set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1128
{
1129 1130 1131 1132 1133 1134 1135 1136
	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);
1137 1138 1139 1140
	ckpt_flags |= f;
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1141
static inline void set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1142
{
1143 1144 1145 1146 1147 1148 1149 1150 1151 1152
	spin_lock(&sbi->cp_lock);
	__set_ckpt_flags(F2FS_CKPT(sbi), f);
	spin_unlock(&sbi->cp_lock);
}

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

	ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1153 1154 1155 1156
	ckpt_flags &= (~f);
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1157 1158 1159 1160 1161 1162 1163
static inline void clear_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
{
	spin_lock(&sbi->cp_lock);
	__clear_ckpt_flags(F2FS_CKPT(sbi), f);
	spin_unlock(&sbi->cp_lock);
}

1164
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1165
{
1166
	down_read(&sbi->cp_rwsem);
1167 1168
}

1169
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1170
{
1171
	up_read(&sbi->cp_rwsem);
1172 1173
}

1174
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1175
{
1176
	down_write(&sbi->cp_rwsem);
1177 1178
}

1179
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1180
{
1181
	up_write(&sbi->cp_rwsem);
1182 1183
}

1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201
static inline int __get_cp_reason(struct f2fs_sb_info *sbi)
{
	int reason = CP_SYNC;

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

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

static inline bool __exist_node_summaries(struct f2fs_sb_info *sbi)
{
1202 1203
	return (is_set_ckpt_flags(sbi, CP_UMOUNT_FLAG) ||
			is_set_ckpt_flags(sbi, CP_FASTBOOT_FLAG));
1204 1205
}

1206 1207 1208
/*
 * Check whether the given nid is within node id range.
 */
1209
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1210
{
1211 1212
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1213
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1214 1215
		return -EINVAL;
	return 0;
1216 1217 1218 1219 1220 1221 1222 1223 1224 1225
}

#define F2FS_DEFAULT_ALLOCATED_BLOCKS	1

/*
 * Check whether the inode has blocks or not
 */
static inline int F2FS_HAS_BLOCKS(struct inode *inode)
{
	if (F2FS_I(inode)->i_xattr_nid)
C
Chris Fries 已提交
1226
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1227
	else
C
Chris Fries 已提交
1228
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1229 1230
}

1231 1232 1233 1234 1235
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1236
static inline void f2fs_i_blocks_write(struct inode *, blkcnt_t, bool);
1237
static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
1238
				 struct inode *inode, blkcnt_t *count)
1239
{
1240
	blkcnt_t diff;
1241

J
Jaegeuk Kim 已提交
1242
#ifdef CONFIG_F2FS_FAULT_INJECTION
1243
	if (time_to_inject(sbi, FAULT_BLOCK))
J
Jaegeuk Kim 已提交
1244 1245
		return false;
#endif
1246 1247 1248 1249 1250 1251
	/*
	 * 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));

1252 1253 1254
	spin_lock(&sbi->stat_lock);
	sbi->total_valid_block_count += (block_t)(*count);
	if (unlikely(sbi->total_valid_block_count > sbi->user_block_count)) {
1255 1256
		diff = sbi->total_valid_block_count - sbi->user_block_count;
		*count -= diff;
1257
		sbi->total_valid_block_count = sbi->user_block_count;
1258 1259
		if (!*count) {
			spin_unlock(&sbi->stat_lock);
1260
			percpu_counter_sub(&sbi->alloc_valid_block_count, diff);
1261 1262
			return false;
		}
1263 1264
	}
	spin_unlock(&sbi->stat_lock);
1265

1266
	f2fs_i_blocks_write(inode, *count, true);
1267 1268 1269
	return true;
}

1270
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1271 1272 1273 1274
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1275 1276
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1277 1278
	sbi->total_valid_block_count -= (block_t)count;
	spin_unlock(&sbi->stat_lock);
1279
	f2fs_i_blocks_write(inode, count, false);
1280 1281 1282 1283
}

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

1286 1287
	if (count_type == F2FS_DIRTY_DATA || count_type == F2FS_INMEM_PAGES ||
		count_type == F2FS_WB_CP_DATA || count_type == F2FS_WB_DATA)
1288 1289
		return;

1290
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1291 1292
}

1293
static inline void inode_inc_dirty_pages(struct inode *inode)
1294
{
1295
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1296 1297
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1298 1299 1300 1301
}

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1302
	atomic_dec(&sbi->nr_pages[count_type]);
1303 1304
}

1305
static inline void inode_dec_dirty_pages(struct inode *inode)
1306
{
1307 1308
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1309 1310
		return;

1311
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1312 1313
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1314 1315
}

1316
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1317
{
1318
	return atomic_read(&sbi->nr_pages[count_type]);
1319 1320
}

1321
static inline int get_dirty_pages(struct inode *inode)
1322
{
1323
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1324 1325
}

1326 1327
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1328
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1329 1330 1331 1332
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1333 1334
}

1335 1336
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1337
	return sbi->total_valid_block_count;
1338 1339
}

1340 1341 1342 1343 1344
static inline block_t discard_blocks(struct f2fs_sb_info *sbi)
{
	return sbi->discard_blks;
}

1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357
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 已提交
1358 1359 1360 1361 1362
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1363 1364 1365
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1366 1367
	int offset;

W
Wanpeng Li 已提交
1368
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1369 1370 1371
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1372
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1373 1374
	} else {
		offset = (flag == NAT_BITMAP) ?
1375
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1376 1377
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1378 1379 1380 1381
}

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

1384
	if (sbi->cur_cp_pack == 2)
1385
		start_addr += sbi->blocks_per_seg;
1386 1387
	return start_addr;
}
1388

1389 1390 1391
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);
1392

1393 1394
	if (sbi->cur_cp_pack == 1)
		start_addr += sbi->blocks_per_seg;
1395 1396 1397
	return start_addr;
}

1398 1399 1400 1401 1402
static inline void __set_cp_next_pack(struct f2fs_sb_info *sbi)
{
	sbi->cur_cp_pack = (sbi->cur_cp_pack == 1) ? 2 : 1;
}

1403 1404 1405 1406 1407 1408
static inline block_t __start_sum_addr(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_CKPT(sbi)->cp_pack_start_sum);
}

static inline bool inc_valid_node_count(struct f2fs_sb_info *sbi,
1409
						struct inode *inode)
1410 1411 1412 1413 1414 1415
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1416
	valid_block_count = sbi->total_valid_block_count + 1;
1417
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1418 1419 1420 1421
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1422
	valid_node_count = sbi->total_valid_node_count + 1;
1423
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1424 1425 1426 1427 1428
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1429
		f2fs_i_blocks_write(inode, 1, true);
1430 1431 1432

	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1433 1434
	spin_unlock(&sbi->stat_lock);

1435
	percpu_counter_inc(&sbi->alloc_valid_block_count);
1436 1437 1438 1439
	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1440
						struct inode *inode)
1441 1442 1443
{
	spin_lock(&sbi->stat_lock);

1444 1445 1446
	f2fs_bug_on(sbi, !sbi->total_valid_block_count);
	f2fs_bug_on(sbi, !sbi->total_valid_node_count);
	f2fs_bug_on(sbi, !inode->i_blocks);
1447

1448
	f2fs_i_blocks_write(inode, 1, false);
1449 1450
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1451 1452 1453 1454 1455 1456

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1457
	return sbi->total_valid_node_count;
1458 1459 1460 1461
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1462
	percpu_counter_inc(&sbi->total_valid_inode_count);
1463 1464
}

1465
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1466
{
1467
	percpu_counter_dec(&sbi->total_valid_inode_count);
1468 1469
}

1470
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1471
{
1472
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1473 1474
}

1475 1476 1477
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1478 1479 1480 1481 1482
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct page *page = find_lock_page(mapping, index);
	if (page)
		return page;

1483
	if (time_to_inject(F2FS_M_SB(mapping), FAULT_PAGE_ALLOC))
1484 1485
		return NULL;
#endif
1486 1487 1488 1489 1490
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1491 1492 1493 1494 1495 1496 1497 1498 1499 1500
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);
}

1501 1502
static inline void f2fs_put_page(struct page *page, int unlock)
{
1503
	if (!page)
1504 1505 1506
		return;

	if (unlock) {
1507
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1508 1509
		unlock_page(page);
	}
1510
	put_page(page);
1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523
}

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,
1524
					size_t size)
1525
{
1526
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1527 1528
}

1529 1530 1531 1532 1533
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1534 1535 1536
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1537 1538 1539
	return entry;
}

J
Jaegeuk Kim 已提交
1540 1541 1542 1543 1544 1545
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1546 1547
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1548 1549 1550
	return bio;
}

1551 1552 1553 1554 1555 1556 1557
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();
}

1558 1559 1560 1561
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1562
	struct f2fs_node *p = F2FS_NODE(page);
1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575
	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;
1576
	raw_node = F2FS_NODE(node_page);
1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589
	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;
}

1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607
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;
}

1608
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619
{
	int mask;
	int ret;

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

1620
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631
{
	int mask;
	int ret;

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

1632 1633 1634 1635 1636 1637 1638 1639 1640
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1641 1642 1643
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1644
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1645
	FI_AUTO_RECOVER,	/* indicate inode is recoverable */
1646
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1647 1648 1649
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1650
	FI_FREE_NID,		/* free allocated nide */
1651
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1652
	FI_INLINE_XATTR,	/* used for inline xattr */
1653
	FI_INLINE_DATA,		/* used for inline data*/
1654
	FI_INLINE_DENTRY,	/* used for inline dentry */
1655 1656
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1657 1658
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
C
Chao Yu 已提交
1659
	FI_ATOMIC_COMMIT,	/* indicate the state of atomical committing */
1660
	FI_VOLATILE_FILE,	/* indicate volatile file */
1661
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1662
	FI_DROP_CACHE,		/* drop dirty page cache */
1663
	FI_DATA_EXIST,		/* indicate data exists */
1664
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1665
	FI_DO_DEFRAG,		/* indicate defragment is running */
1666
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1667 1668
};

1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679
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:
1680
		f2fs_mark_inode_dirty_sync(inode, true);
1681 1682 1683
	}
}

1684
static inline void set_inode_flag(struct inode *inode, int flag)
1685
{
1686 1687
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1688
	__mark_inode_dirty_flag(inode, flag, true);
1689 1690
}

1691
static inline int is_inode_flag_set(struct inode *inode, int flag)
1692
{
1693
	return test_bit(flag, &F2FS_I(inode)->flags);
1694 1695
}

1696
static inline void clear_inode_flag(struct inode *inode, int flag)
1697
{
1698 1699
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1700
	__mark_inode_dirty_flag(inode, flag, false);
1701 1702
}

1703
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1704
{
1705 1706
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1707
	f2fs_mark_inode_dirty_sync(inode, false);
1708 1709
}

1710
static inline void f2fs_i_links_write(struct inode *inode, bool inc)
1711
{
1712 1713 1714 1715
	if (inc)
		inc_nlink(inode);
	else
		drop_nlink(inode);
1716
	f2fs_mark_inode_dirty_sync(inode, true);
1717 1718
}

1719 1720 1721
static inline void f2fs_i_blocks_write(struct inode *inode,
					blkcnt_t diff, bool add)
{
1722 1723 1724
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1725 1726
	inode->i_blocks = add ? inode->i_blocks + diff :
				inode->i_blocks - diff;
1727
	f2fs_mark_inode_dirty_sync(inode, true);
1728 1729
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1730 1731
}

1732 1733
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1734 1735 1736
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1737 1738 1739 1740
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
1741
	f2fs_mark_inode_dirty_sync(inode, true);
1742 1743
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1744 1745
}

1746
static inline void f2fs_i_depth_write(struct inode *inode, unsigned int depth)
1747
{
1748
	F2FS_I(inode)->i_current_depth = depth;
1749
	f2fs_mark_inode_dirty_sync(inode, true);
1750 1751
}

1752
static inline void f2fs_i_xnid_write(struct inode *inode, nid_t xnid)
J
Jaegeuk Kim 已提交
1753
{
1754
	F2FS_I(inode)->i_xattr_nid = xnid;
1755
	f2fs_mark_inode_dirty_sync(inode, true);
1756 1757 1758 1759 1760
}

static inline void f2fs_i_pino_write(struct inode *inode, nid_t pino)
{
	F2FS_I(inode)->i_pino = pino;
1761
	f2fs_mark_inode_dirty_sync(inode, true);
1762 1763
}

1764
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1765
{
1766 1767
	struct f2fs_inode_info *fi = F2FS_I(inode);

J
Jaegeuk Kim 已提交
1768
	if (ri->i_inline & F2FS_INLINE_XATTR)
1769
		set_bit(FI_INLINE_XATTR, &fi->flags);
1770
	if (ri->i_inline & F2FS_INLINE_DATA)
1771
		set_bit(FI_INLINE_DATA, &fi->flags);
1772
	if (ri->i_inline & F2FS_INLINE_DENTRY)
1773
		set_bit(FI_INLINE_DENTRY, &fi->flags);
1774
	if (ri->i_inline & F2FS_DATA_EXIST)
1775
		set_bit(FI_DATA_EXIST, &fi->flags);
1776
	if (ri->i_inline & F2FS_INLINE_DOTS)
1777
		set_bit(FI_INLINE_DOTS, &fi->flags);
J
Jaegeuk Kim 已提交
1778 1779
}

1780
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1781 1782 1783
{
	ri->i_inline = 0;

1784
	if (is_inode_flag_set(inode, FI_INLINE_XATTR))
J
Jaegeuk Kim 已提交
1785
		ri->i_inline |= F2FS_INLINE_XATTR;
1786
	if (is_inode_flag_set(inode, FI_INLINE_DATA))
1787
		ri->i_inline |= F2FS_INLINE_DATA;
1788
	if (is_inode_flag_set(inode, FI_INLINE_DENTRY))
1789
		ri->i_inline |= F2FS_INLINE_DENTRY;
1790
	if (is_inode_flag_set(inode, FI_DATA_EXIST))
1791
		ri->i_inline |= F2FS_DATA_EXIST;
1792
	if (is_inode_flag_set(inode, FI_INLINE_DOTS))
1793
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1794 1795
}

1796 1797
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
1798
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
1799 1800
}

1801
static inline unsigned int addrs_per_inode(struct inode *inode)
1802
{
1803
	if (f2fs_has_inline_xattr(inode))
1804 1805 1806 1807
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1808 1809
static inline void *inline_xattr_addr(struct page *page)
{
1810
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1811 1812 1813 1814 1815 1816
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1817
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1818 1819 1820 1821 1822
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1823 1824
static inline int f2fs_has_inline_data(struct inode *inode)
{
1825
	return is_inode_flag_set(inode, FI_INLINE_DATA);
1826 1827
}

1828 1829
static inline void f2fs_clear_inline_inode(struct inode *inode)
{
1830 1831
	clear_inode_flag(inode, FI_INLINE_DATA);
	clear_inode_flag(inode, FI_DATA_EXIST);
1832 1833 1834 1835
}

static inline int f2fs_exist_data(struct inode *inode)
{
1836
	return is_inode_flag_set(inode, FI_DATA_EXIST);
1837 1838
}

1839 1840
static inline int f2fs_has_inline_dots(struct inode *inode)
{
1841
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
1842 1843
}

J
Jaegeuk Kim 已提交
1844 1845
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
1846
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
1847 1848
}

C
Chao Yu 已提交
1849 1850 1851 1852 1853
static inline bool f2fs_is_commit_atomic_write(struct inode *inode)
{
	return is_inode_flag_set(inode, FI_ATOMIC_COMMIT);
}

1854 1855
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
1856
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
1857 1858
}

1859 1860
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
1861
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
1862 1863
}

1864 1865
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
1866
	return is_inode_flag_set(inode, FI_DROP_CACHE);
1867 1868
}

1869 1870
static inline void *inline_data_addr(struct page *page)
{
1871
	struct f2fs_inode *ri = F2FS_INODE(page);
1872 1873 1874
	return (void *)&(ri->i_addr[1]);
}

1875 1876
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
1877
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
1878 1879
}

1880 1881 1882 1883 1884 1885
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1886 1887 1888 1889 1890 1891 1892 1893
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;
1894
	f2fs_mark_inode_dirty_sync(inode, true);
1895 1896 1897 1898 1899
}

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

1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918
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);
1919 1920
}

J
Jaegeuk Kim 已提交
1921 1922 1923 1924 1925
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1926 1927
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
1928
	return is_set_ckpt_flags(sbi, CP_ERROR_FLAG);
1929 1930
}

1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941
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 已提交
1942 1943 1944
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
1945
			is_inode_flag_set(inode, FI_NO_EXTENT))
J
Jaegeuk Kim 已提交
1946 1947
		return false;

A
Al Viro 已提交
1948
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
1949 1950
}

1951 1952
static inline void *f2fs_kmalloc(struct f2fs_sb_info *sbi,
					size_t size, gfp_t flags)
1953
{
J
Jaegeuk Kim 已提交
1954
#ifdef CONFIG_F2FS_FAULT_INJECTION
1955
	if (time_to_inject(sbi, FAULT_KMALLOC))
J
Jaegeuk Kim 已提交
1956 1957
		return NULL;
#endif
1958 1959 1960
	return kmalloc(size, flags);
}

1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980
static inline void *f2fs_kvmalloc(size_t size, gfp_t flags)
{
	void *ret;

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

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

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

1981
#define get_inode_mode(i) \
1982
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
1983 1984
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1985
/* get offset of first page in next direct node */
1986 1987 1988 1989
#define PGOFS_OF_NEXT_DNODE(pgofs, inode)				\
	((pgofs < ADDRS_PER_INODE(inode)) ? ADDRS_PER_INODE(inode) :	\
	(pgofs - ADDRS_PER_INODE(inode) + ADDRS_PER_BLOCK) /	\
	ADDRS_PER_BLOCK * ADDRS_PER_BLOCK + ADDRS_PER_INODE(inode))
1990

1991 1992 1993 1994 1995
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1996
int truncate_blocks(struct inode *, u64, bool);
1997
int f2fs_truncate(struct inode *);
1998
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1999 2000
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
2001
int truncate_data_blocks_range(struct dnode_of_data *, int);
2002
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
2003
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
2004 2005 2006 2007 2008 2009

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
2010
struct inode *f2fs_iget_retry(struct super_block *, unsigned long);
2011
int try_to_free_nats(struct f2fs_sb_info *, int);
2012 2013
int update_inode(struct inode *, struct page *);
int update_inode_page(struct inode *);
2014 2015
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
2016
void handle_failed_inode(struct inode *);
2017 2018 2019 2020 2021 2022 2023 2024 2025

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

/*
 * dir.c
 */
2026
void set_de_type(struct f2fs_dir_entry *, umode_t);
2027
unsigned char get_de_type(struct f2fs_dir_entry *);
2028
struct f2fs_dir_entry *find_target_dentry(struct fscrypt_name *,
2029
			f2fs_hash_t, int *, struct f2fs_dentry_ptr *);
C
Chao Yu 已提交
2030
int f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
2031
			unsigned int, struct fscrypt_str *);
2032 2033
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
2034
struct page *init_inode_metadata(struct inode *, struct inode *,
2035
		const struct qstr *, const struct qstr *, struct page *);
2036
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
2037
int room_for_filename(const void *, int, int);
J
Jaegeuk Kim 已提交
2038
void f2fs_drop_nlink(struct inode *, struct inode *);
2039 2040
struct f2fs_dir_entry *__f2fs_find_entry(struct inode *, struct fscrypt_name *,
							struct page **);
A
Al Viro 已提交
2041
struct f2fs_dir_entry *f2fs_find_entry(struct inode *, const struct qstr *,
2042 2043
							struct page **);
struct f2fs_dir_entry *f2fs_parent_dir(struct inode *, struct page **);
2044
ino_t f2fs_inode_by_name(struct inode *, const struct qstr *, struct page **);
2045 2046
void f2fs_set_link(struct inode *, struct f2fs_dir_entry *,
				struct page *, struct inode *);
2047
int update_dent_inode(struct inode *, struct inode *, const struct qstr *);
2048
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
2049
			const struct qstr *, f2fs_hash_t , unsigned int);
2050
int f2fs_add_regular_entry(struct inode *, const struct qstr *,
2051
			const struct qstr *, struct inode *, nid_t, umode_t);
2052 2053
int __f2fs_do_add_link(struct inode *, struct fscrypt_name*, struct inode *,
			nid_t, umode_t);
2054 2055
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
2056 2057
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
2058
int f2fs_do_tmpfile(struct inode *, struct inode *);
2059 2060
bool f2fs_empty_dir(struct inode *);

2061 2062
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
2063
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
2064
				inode, inode->i_ino, inode->i_mode);
2065 2066
}

2067 2068 2069
/*
 * super.c
 */
2070
int f2fs_inode_dirtied(struct inode *, bool);
2071
void f2fs_inode_synced(struct inode *);
C
Chao Yu 已提交
2072
int f2fs_commit_super(struct f2fs_sb_info *, bool);
2073
int f2fs_sync_fs(struct super_block *, int);
2074 2075
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
2076
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
2077 2078 2079 2080

/*
 * hash.c
 */
2081
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
2082 2083 2084 2085 2086 2087 2088

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

2089
bool available_free_memory(struct f2fs_sb_info *, int);
J
Jaegeuk Kim 已提交
2090
int need_dentry_mark(struct f2fs_sb_info *, nid_t);
2091 2092
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
2093
void get_node_info(struct f2fs_sb_info *, nid_t, struct node_info *);
2094
pgoff_t get_next_page_offset(struct dnode_of_data *, pgoff_t);
2095 2096
int get_dnode_of_data(struct dnode_of_data *, pgoff_t, int);
int truncate_inode_blocks(struct inode *, pgoff_t);
2097
int truncate_xattr_node(struct inode *, struct page *);
2098
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
C
Chao Yu 已提交
2099
int remove_inode_page(struct inode *);
2100
struct page *new_inode_page(struct inode *);
2101
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
2102 2103 2104
void ra_node_page(struct f2fs_sb_info *, nid_t);
struct page *get_node_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_node_page_ra(struct page *, int);
2105
void move_node_page(struct page *, int);
2106 2107
int fsync_node_pages(struct f2fs_sb_info *, struct inode *,
			struct writeback_control *, bool);
2108
int sync_node_pages(struct f2fs_sb_info *, struct writeback_control *);
2109
void build_free_nids(struct f2fs_sb_info *, bool);
2110 2111 2112
bool alloc_nid(struct f2fs_sb_info *, nid_t *);
void alloc_nid_done(struct f2fs_sb_info *, nid_t);
void alloc_nid_failed(struct f2fs_sb_info *, nid_t);
C
Chao Yu 已提交
2113
int try_to_free_nids(struct f2fs_sb_info *, int);
2114
void recover_inline_xattr(struct inode *, struct page *);
2115
void recover_xattr_data(struct inode *, struct page *, block_t);
2116 2117 2118 2119 2120 2121
int recover_inode_page(struct f2fs_sb_info *, struct page *);
int restore_node_summary(struct f2fs_sb_info *, unsigned int,
				struct f2fs_summary_block *);
void flush_nat_entries(struct f2fs_sb_info *);
int build_node_manager(struct f2fs_sb_info *);
void destroy_node_manager(struct f2fs_sb_info *);
2122
int __init create_node_manager_caches(void);
2123 2124 2125 2126 2127
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
2128
void register_inmem_page(struct inode *, struct page *);
2129 2130
void drop_inmem_pages(struct inode *);
int commit_inmem_pages(struct inode *);
J
Jaegeuk Kim 已提交
2131
void f2fs_balance_fs(struct f2fs_sb_info *, bool);
2132
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
2133
int f2fs_issue_flush(struct f2fs_sb_info *);
2134
int create_flush_cmd_control(struct f2fs_sb_info *);
2135
void destroy_flush_cmd_control(struct f2fs_sb_info *, bool);
2136
void invalidate_blocks(struct f2fs_sb_info *, block_t);
2137
bool is_checkpointed_data(struct f2fs_sb_info *, block_t);
2138
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
2139
void f2fs_wait_discard_bio(struct f2fs_sb_info *, block_t);
2140
void clear_prefree_segments(struct f2fs_sb_info *, struct cp_control *);
2141
void release_discard_addrs(struct f2fs_sb_info *);
2142
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
2143
void allocate_new_segments(struct f2fs_sb_info *);
2144
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
2145
bool exist_trim_candidates(struct f2fs_sb_info *, struct cp_control *);
2146
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
C
Chao Yu 已提交
2147
void update_meta_page(struct f2fs_sb_info *, void *, block_t);
2148
void write_meta_page(struct f2fs_sb_info *, struct page *);
2149 2150 2151
void write_node_page(unsigned int, struct f2fs_io_info *);
void write_data_page(struct dnode_of_data *, struct f2fs_io_info *);
void rewrite_data_page(struct f2fs_io_info *);
2152 2153
void __f2fs_replace_block(struct f2fs_sb_info *, struct f2fs_summary *,
					block_t, block_t, bool, bool);
2154
void f2fs_replace_block(struct f2fs_sb_info *, struct dnode_of_data *,
2155
				block_t, block_t, unsigned char, bool, bool);
2156 2157
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
2158
void f2fs_wait_on_page_writeback(struct page *, enum page_type, bool);
2159
void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *, block_t);
2160 2161
void write_data_summaries(struct f2fs_sb_info *, block_t);
void write_node_summaries(struct f2fs_sb_info *, block_t);
2162
int lookup_journal_in_cursum(struct f2fs_journal *, int, unsigned int, int);
2163
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
2164 2165
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
2166 2167
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
2168 2169 2170 2171

/*
 * checkpoint.c
 */
2172
void f2fs_stop_checkpoint(struct f2fs_sb_info *, bool);
2173 2174
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
2175
struct page *get_tmp_page(struct f2fs_sb_info *, pgoff_t);
2176
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
2177
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int, bool);
2178
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
2179
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
2180 2181
void add_ino_entry(struct f2fs_sb_info *, nid_t, int type);
void remove_ino_entry(struct f2fs_sb_info *, nid_t, int type);
2182
void release_ino_entry(struct f2fs_sb_info *, bool);
2183
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
2184
int f2fs_sync_inode_meta(struct f2fs_sb_info *);
J
Jaegeuk Kim 已提交
2185 2186
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
2187
void add_orphan_inode(struct inode *);
2188
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
2189
int recover_orphan_inodes(struct f2fs_sb_info *);
2190
int get_valid_checkpoint(struct f2fs_sb_info *);
2191
void update_dirty_page(struct inode *, struct page *);
2192
void remove_dirty_inode(struct inode *);
C
Chao Yu 已提交
2193
int sync_dirty_inodes(struct f2fs_sb_info *, enum inode_type);
C
Chao Yu 已提交
2194
int write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
2195
void init_ino_entry_info(struct f2fs_sb_info *);
2196
int __init create_checkpoint_caches(void);
2197 2198 2199 2200 2201
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
2202
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
2203 2204
void f2fs_submit_merged_bio_cond(struct f2fs_sb_info *, struct inode *,
				struct page *, nid_t, enum page_type, int);
2205
void f2fs_flush_merged_bios(struct f2fs_sb_info *);
2206
int f2fs_submit_page_bio(struct f2fs_io_info *);
2207
int f2fs_submit_page_mbio(struct f2fs_io_info *);
J
Jaegeuk Kim 已提交
2208 2209 2210
struct block_device *f2fs_target_device(struct f2fs_sb_info *,
				block_t, struct bio *);
int f2fs_target_device_index(struct f2fs_sb_info *, block_t);
2211
void set_data_blkaddr(struct dnode_of_data *);
2212
void f2fs_update_data_blkaddr(struct dnode_of_data *, block_t);
2213
int reserve_new_blocks(struct dnode_of_data *, blkcnt_t);
2214
int reserve_new_block(struct dnode_of_data *);
2215
int f2fs_get_block(struct dnode_of_data *, pgoff_t);
2216
int f2fs_preallocate_blocks(struct kiocb *, struct iov_iter *);
2217
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
2218
struct page *get_read_data_page(struct inode *, pgoff_t, int, bool);
2219
struct page *find_data_page(struct inode *, pgoff_t);
2220
struct page *get_lock_data_page(struct inode *, pgoff_t, bool);
2221
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
2222
int do_write_data_page(struct f2fs_io_info *);
C
Chao Yu 已提交
2223
int f2fs_map_blocks(struct inode *, struct f2fs_map_blocks *, int, int);
J
Jaegeuk Kim 已提交
2224
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
2225
void f2fs_set_page_dirty_nobuffers(struct page *);
2226 2227
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
2228 2229 2230 2231
#ifdef CONFIG_MIGRATION
int f2fs_migrate_page(struct address_space *, struct page *, struct page *,
				enum migrate_mode);
#endif
2232 2233 2234 2235 2236 2237

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
2238
block_t start_bidx_of_node(unsigned int, struct inode *);
J
Jaegeuk Kim 已提交
2239
int f2fs_gc(struct f2fs_sb_info *, bool, bool);
2240 2241 2242 2243 2244
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
2245
int recover_fsync_data(struct f2fs_sb_info *, bool);
2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256
bool space_for_roll_forward(struct f2fs_sb_info *);

/*
 * 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;
2257 2258
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
2259
	int ext_tree, zombie_tree, ext_node;
2260 2261
	int ndirty_node, ndirty_dent, ndirty_meta, ndirty_data, ndirty_imeta;
	int inmem_pages;
2262
	unsigned int ndirty_dirs, ndirty_files, ndirty_all;
C
Chao Yu 已提交
2263
	int nats, dirty_nats, sits, dirty_sits, free_nids, alloc_nids;
2264
	int total_count, utilization;
2265
	int bg_gc, nr_wb_cp_data, nr_wb_data;
J
Jaegeuk Kim 已提交
2266
	int inline_xattr, inline_inode, inline_dir, orphans;
2267
	int aw_cnt, max_aw_cnt;
2268
	unsigned int valid_count, valid_node_count, valid_inode_count, discard_blks;
2269 2270 2271 2272
	unsigned int bimodal, avg_vblocks;
	int util_free, util_valid, util_invalid;
	int rsvd_segs, overp_segs;
	int dirty_count, node_pages, meta_pages;
2273
	int prefree_count, call_count, cp_count, bg_cp_count;
2274
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
2275
	int bg_node_segs, bg_data_segs;
2276
	int tot_blks, data_blks, node_blks;
2277
	int bg_data_blks, bg_node_blks;
2278 2279 2280 2281 2282 2283
	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];
2284
	unsigned int inplace_count;
C
Chao Yu 已提交
2285
	unsigned long long base_mem, cache_mem, page_mem;
2286 2287
};

2288 2289
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2290
	return (struct f2fs_stat_info *)sbi->stat_info;
2291 2292
}

2293
#define stat_inc_cp_count(si)		((si)->cp_count++)
2294
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
2295 2296
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
2297 2298
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
2299 2300 2301 2302
#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 已提交
2303 2304 2305 2306 2307 2308 2309 2310 2311 2312
#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)
2313 2314 2315
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2316
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
2317 2318 2319 2320
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2321
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
2322
	} while (0)
2323 2324 2325
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2326
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
2327 2328 2329 2330
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2331
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
2332
	} while (0)
2333 2334 2335 2336
#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]++)
2337 2338
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349
#define stat_inc_atomic_write(inode)					\
		(atomic_inc(&F2FS_I_SB(inode)->aw_cnt));
#define stat_dec_atomic_write(inode)					\
		(atomic_dec(&F2FS_I_SB(inode)->aw_cnt));
#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)
2350
#define stat_inc_seg_count(sbi, type, gc_type)				\
2351
	do {								\
2352
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2353
		(si)->tot_segs++;					\
2354
		if (type == SUM_TYPE_DATA) {				\
2355
			si->data_segs++;				\
2356 2357
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2358
			si->node_segs++;				\
2359 2360
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2361 2362 2363 2364 2365
	} while (0)

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

2366
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2367
	do {								\
2368
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2369 2370
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2371
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2372 2373
	} while (0)

2374
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2375
	do {								\
2376
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2377 2378
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2379
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2380 2381 2382 2383
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
2384
int __init f2fs_create_root_stats(void);
2385
void f2fs_destroy_root_stats(void);
2386
#else
2387
#define stat_inc_cp_count(si)
2388
#define stat_inc_bg_cp_count(si)
2389
#define stat_inc_call_count(si)
2390
#define stat_inc_bggc_count(si)
C
Chao Yu 已提交
2391 2392
#define stat_inc_dirty_inode(sbi, type)
#define stat_dec_dirty_inode(sbi, type)
2393
#define stat_inc_total_hit(sb)
2394
#define stat_inc_rbtree_node_hit(sb)
2395 2396
#define stat_inc_largest_node_hit(sbi)
#define stat_inc_cached_node_hit(sbi)
C
Chao Yu 已提交
2397 2398
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
2399 2400
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
2401 2402
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
2403 2404 2405
#define stat_inc_atomic_write(inode)
#define stat_dec_atomic_write(inode)
#define stat_update_max_atomic_write(inode)
2406 2407
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
2408
#define stat_inc_inplace_blocks(sbi)
2409
#define stat_inc_seg_count(sbi, type, gc_type)
2410
#define stat_inc_tot_blk_count(si, blks)
2411 2412
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
2413 2414 2415

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2416
static inline int __init f2fs_create_root_stats(void) { return 0; }
2417
static inline void f2fs_destroy_root_stats(void) { }
2418 2419 2420 2421 2422 2423 2424 2425 2426 2427
#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;
2428
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2429
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2430
extern struct kmem_cache *inode_entry_slab;
2431

2432 2433 2434
/*
 * inline.c
 */
2435 2436
bool f2fs_may_inline_data(struct inode *);
bool f2fs_may_inline_dentry(struct inode *);
2437
void read_inline_data(struct page *, struct page *);
2438
bool truncate_inline_inode(struct page *, u64);
2439
int f2fs_read_inline_data(struct inode *, struct page *);
2440 2441 2442
int f2fs_convert_inline_page(struct dnode_of_data *, struct page *);
int f2fs_convert_inline_inode(struct inode *);
int f2fs_write_inline_data(struct inode *, struct page *);
2443
bool recover_inline_data(struct inode *, struct page *);
2444
struct f2fs_dir_entry *find_in_inline_dir(struct inode *,
2445
				struct fscrypt_name *, struct page **);
2446
int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
2447 2448
int f2fs_add_inline_entry(struct inode *, const struct qstr *,
		const struct qstr *, struct inode *, nid_t, umode_t);
2449 2450 2451
void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
						struct inode *, struct inode *);
bool f2fs_empty_inline_dir(struct inode *);
2452
int f2fs_read_inline_dir(struct file *, struct dir_context *,
2453
						struct fscrypt_str *);
J
Jaegeuk Kim 已提交
2454 2455
int f2fs_inline_data_fiemap(struct inode *,
		struct fiemap_extent_info *, __u64, __u64);
2456

2457 2458 2459 2460 2461 2462 2463 2464
/*
 * shrinker.c
 */
unsigned long f2fs_shrink_count(struct shrinker *, struct shrink_control *);
unsigned long f2fs_shrink_scan(struct shrinker *, struct shrink_control *);
void f2fs_join_shrinker(struct f2fs_sb_info *);
void f2fs_leave_shrinker(struct f2fs_sb_info *);

2465 2466 2467 2468
/*
 * extent_cache.c
 */
unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
2469
bool f2fs_init_extent_tree(struct inode *, struct f2fs_extent *);
2470
void f2fs_drop_extent_tree(struct inode *);
2471 2472 2473 2474
unsigned int f2fs_destroy_extent_node(struct inode *);
void f2fs_destroy_extent_tree(struct inode *);
bool f2fs_lookup_extent_cache(struct inode *, pgoff_t, struct extent_info *);
void f2fs_update_extent_cache(struct dnode_of_data *);
C
Chao Yu 已提交
2475 2476
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
						pgoff_t, block_t, unsigned int);
2477 2478 2479 2480
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2481 2482 2483
/*
 * crypto support
 */
2484
static inline bool f2fs_encrypted_inode(struct inode *inode)
2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497
{
	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)
{
2498
	return bio->bi_private != NULL;
2499 2500 2501 2502 2503 2504
}

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

2506
static inline int f2fs_sb_mounted_blkzoned(struct super_block *sb)
2507
{
2508
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_BLKZONED);
2509 2510
}

2511 2512
#ifdef CONFIG_BLK_DEV_ZONED
static inline int get_blkz_type(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
2513
			struct block_device *bdev, block_t blkaddr)
2514 2515
{
	unsigned int zno = blkaddr >> sbi->log_blocks_per_blkz;
J
Jaegeuk Kim 已提交
2516
	int i;
2517

J
Jaegeuk Kim 已提交
2518 2519 2520 2521
	for (i = 0; i < sbi->s_ndevs; i++)
		if (FDEV(i).bdev == bdev)
			return FDEV(i).blkz_type[zno];
	return -EINVAL;
2522 2523 2524
}
#endif

2525
static inline bool f2fs_discard_en(struct f2fs_sb_info *sbi)
2526
{
2527 2528 2529
	struct request_queue *q = bdev_get_queue(sbi->sb->s_bdev);

	return blk_queue_discard(q) || f2fs_sb_mounted_blkzoned(sbi->sb);
2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546
}

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

2547 2548 2549
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2550
	umode_t mode = inode->i_mode;
2551 2552 2553 2554 2555 2556 2557

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

2558 2559 2560 2561 2562 2563 2564 2565 2566 2567
#ifndef CONFIG_F2FS_FS_ENCRYPTION
#define fscrypt_set_d_op(i)
#define fscrypt_get_ctx			fscrypt_notsupp_get_ctx
#define fscrypt_release_ctx		fscrypt_notsupp_release_ctx
#define fscrypt_encrypt_page		fscrypt_notsupp_encrypt_page
#define fscrypt_decrypt_page		fscrypt_notsupp_decrypt_page
#define fscrypt_decrypt_bio_pages	fscrypt_notsupp_decrypt_bio_pages
#define fscrypt_pullback_bio_page	fscrypt_notsupp_pullback_bio_page
#define fscrypt_restore_control_page	fscrypt_notsupp_restore_control_page
#define fscrypt_zeroout_range		fscrypt_notsupp_zeroout_range
2568 2569
#define fscrypt_ioctl_set_policy	fscrypt_notsupp_ioctl_set_policy
#define fscrypt_ioctl_get_policy	fscrypt_notsupp_ioctl_get_policy
2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580
#define fscrypt_has_permitted_context	fscrypt_notsupp_has_permitted_context
#define fscrypt_inherit_context		fscrypt_notsupp_inherit_context
#define fscrypt_get_encryption_info	fscrypt_notsupp_get_encryption_info
#define fscrypt_put_encryption_info	fscrypt_notsupp_put_encryption_info
#define fscrypt_setup_filename		fscrypt_notsupp_setup_filename
#define fscrypt_free_filename		fscrypt_notsupp_free_filename
#define fscrypt_fname_encrypted_size	fscrypt_notsupp_fname_encrypted_size
#define fscrypt_fname_alloc_buffer	fscrypt_notsupp_fname_alloc_buffer
#define fscrypt_fname_free_buffer	fscrypt_notsupp_fname_free_buffer
#define fscrypt_fname_disk_to_usr	fscrypt_notsupp_fname_disk_to_usr
#define fscrypt_fname_usr_to_disk	fscrypt_notsupp_fname_usr_to_disk
2581
#endif
2582
#endif