f2fs.h 77.3 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
#define DEF_CP_INTERVAL			60	/* 60 secs */
137
#define DEF_IDLE_INTERVAL		5	/* 5 secs */
J
Jaegeuk Kim 已提交
138

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

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

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

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

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

177 178 179 180 181 182 183
/* 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 */
};

C
Chao Yu 已提交
184 185
struct bio_entry {
	struct list_head list;
186 187
	block_t lstart;
	block_t len;
C
Chao Yu 已提交
188 189 190 191 192
	struct bio *bio;
	struct completion event;
	int error;
};

193 194 195 196
/* 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 */
197 198
	block_t blkaddr;	/* block address locating the last fsync */
	block_t last_dentry;	/* block address locating the last dentry */
199 200
};

201 202
#define nats_in_cursum(jnl)		(le16_to_cpu(jnl->n_nats))
#define sits_in_cursum(jnl)		(le16_to_cpu(jnl->n_sits))
203

204 205 206 207
#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)
208

209 210
#define MAX_NAT_JENTRIES(jnl)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(jnl))
#define MAX_SIT_JENTRIES(jnl)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(jnl))
211

212
static inline int update_nats_in_cursum(struct f2fs_journal *journal, int i)
213
{
214 215
	int before = nats_in_cursum(journal);
	journal->n_nats = cpu_to_le16(before + i);
216 217 218
	return before;
}

219
static inline int update_sits_in_cursum(struct f2fs_journal *journal, int i)
220
{
221 222
	int before = sits_in_cursum(journal);
	journal->n_sits = cpu_to_le16(before + i);
223 224 225
	return before;
}

226 227
static inline bool __has_cursum_space(struct f2fs_journal *journal,
							int size, int type)
228 229
{
	if (type == NAT_JOURNAL)
230 231
		return size <= MAX_NAT_JENTRIES(journal);
	return size <= MAX_SIT_JENTRIES(journal);
232 233
}

234 235 236
/*
 * ioctl commands
 */
J
Jaegeuk Kim 已提交
237 238
#define F2FS_IOC_GETFLAGS		FS_IOC_GETFLAGS
#define F2FS_IOC_SETFLAGS		FS_IOC_SETFLAGS
C
Chao Yu 已提交
239
#define F2FS_IOC_GETVERSION		FS_IOC_GETVERSION
J
Jaegeuk Kim 已提交
240 241 242 243

#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)
244
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
245 246
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
247
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
248
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
C
Chao Yu 已提交
249
#define F2FS_IOC_DEFRAGMENT		_IO(F2FS_IOCTL_MAGIC, 8)
250 251
#define F2FS_IOC_MOVE_RANGE		_IOWR(F2FS_IOCTL_MAGIC, 9,	\
						struct f2fs_move_range)
252

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

J
Jaegeuk Kim 已提交
257 258 259 260 261 262 263 264
/*
 * 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 */
265
#define F2FS_GOING_DOWN_METAFLUSH	0x3	/* going down with meta flush */
J
Jaegeuk Kim 已提交
266

267 268 269 270
#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
/*
 * ioctl commands in 32 bit emulation
 */
271 272 273
#define F2FS_IOC32_GETFLAGS		FS_IOC32_GETFLAGS
#define F2FS_IOC32_SETFLAGS		FS_IOC32_SETFLAGS
#define F2FS_IOC32_GETVERSION		FS_IOC32_GETVERSION
274 275
#endif

C
Chao Yu 已提交
276 277 278 279 280
struct f2fs_defragment {
	u64 start;
	u64 len;
};

281 282 283 284 285 286 287
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 */
};

288 289 290
/*
 * For INODE and NODE manager
 */
291 292
/* for directory operations */
struct f2fs_dentry_ptr {
293
	struct inode *inode;
294 295 296 297 298 299
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

300 301
static inline void make_dentry_ptr(struct inode *inode,
		struct f2fs_dentry_ptr *d, void *src, int type)
302
{
303 304
	d->inode = inode;

305 306 307 308 309 310 311 312 313 314 315 316 317 318 319
	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;
	}
}

320 321 322 323 324 325 326
/*
 * 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)
327 328 329 330 331
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 已提交
332
					 * by get_data_block.
333
					 */
334 335
};

336
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
337

338 339
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

340 341 342
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

343
/* for in-memory extent cache entry */
344 345 346 347
#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
348

349
struct extent_info {
350 351 352 353 354 355 356 357 358
	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 */
359
	struct extent_tree *et;		/* extent tree pointer */
360 361 362 363 364
};

struct extent_tree {
	nid_t ino;			/* inode number */
	struct rb_root root;		/* root of extent info rb-tree */
365
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
366
	struct extent_info largest;	/* largested extent info */
367
	struct list_head list;		/* to be used by sbi->zombie_list */
368
	rwlock_t lock;			/* protect extent info rb-tree */
369
	atomic_t node_cnt;		/* # of extent node in rb-tree*/
370 371
};

J
Jaegeuk Kim 已提交
372 373 374 375 376 377 378
/*
 * 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)
379 380 381
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
382 383 384 385 386 387

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

C
Chao Yu 已提交
391 392 393 394 395
/* 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
396
#define F2FS_GET_BLOCK_PRE_DIO		4
397
#define F2FS_GET_BLOCK_PRE_AIO		5
C
Chao Yu 已提交
398

399 400 401 402
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
403
#define FADVISE_LOST_PINO_BIT	0x02
404
#define FADVISE_ENCRYPT_BIT	0x04
405
#define FADVISE_ENC_NAME_BIT	0x08
406
#define FADVISE_KEEP_SIZE_BIT	0x10
407

408 409 410 411 412 413
#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)
414 415 416
#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)
417 418
#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)
419 420
#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)
421

422 423
#define DEF_DIR_LEVEL		0

424 425 426 427
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 */
428
	unsigned char i_dir_level;	/* use for dentry level for large dir */
429
	unsigned int i_current_depth;	/* use only in directory structure */
430
	unsigned int i_pino;		/* parent inode number */
431 432 433 434
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
435
	struct rw_semaphore i_sem;	/* protect fi info */
436
	atomic_t dirty_pages;		/* # of dirty pages */
437 438 439
	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 */
440
	unsigned long long xattr_ver;	/* cp version of xattr modification */
441
	loff_t	last_disk_size;		/* lastly written file size */
J
Jaegeuk Kim 已提交
442

443 444
	struct list_head dirty_list;	/* dirty list for dirs and files */
	struct list_head gdirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
445 446
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
J
Jaegeuk Kim 已提交
447
	struct extent_tree *extent_tree;	/* cached extent_tree entry */
448
	struct rw_semaphore dio_rwsem[2];/* avoid racing between dio and gc */
449 450 451
};

static inline void get_extent_info(struct extent_info *ext,
C
Chao Yu 已提交
452
					struct f2fs_extent *i_ext)
453
{
C
Chao Yu 已提交
454 455 456
	ext->fofs = le32_to_cpu(i_ext->fofs);
	ext->blk = le32_to_cpu(i_ext->blk);
	ext->len = le32_to_cpu(i_ext->len);
457 458 459 460 461 462
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	i_ext->fofs = cpu_to_le32(ext->fofs);
463
	i_ext->blk = cpu_to_le32(ext->blk);
464 465 466
	i_ext->len = cpu_to_le32(ext->len);
}

467 468 469 470 471 472 473 474
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;
}

475 476 477 478 479 480 481
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);
}

482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500
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);
}

501
extern void f2fs_mark_inode_dirty_sync(struct inode *, bool);
502 503
static inline void __try_update_largest_extent(struct inode *inode,
			struct extent_tree *et, struct extent_node *en)
504
{
505
	if (en->ei.len > et->largest.len) {
506
		et->largest = en->ei;
507
		f2fs_mark_inode_dirty_sync(inode, true);
508
	}
509 510
}

C
Chao Yu 已提交
511 512 513 514 515 516
enum nid_list {
	FREE_NID_LIST,
	ALLOC_NID_LIST,
	MAX_NID_LIST,
};

517 518 519
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
520
	nid_t available_nids;		/* # of available node ids */
521
	nid_t next_scan_nid;		/* the next nid to be scanned */
522
	unsigned int ram_thresh;	/* control the memory footprint */
C
Chao Yu 已提交
523
	unsigned int ra_nid_pages;	/* # of nid pages to be readaheaded */
C
Chao Yu 已提交
524
	unsigned int dirty_nats_ratio;	/* control dirty nats ratio threshold */
525 526 527

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
528
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
529
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
530
	struct list_head nat_entries;	/* cached nat entry list (clean) */
531
	unsigned int nat_cnt;		/* the # of cached nat entries */
532
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
533 534

	/* free node ids management */
535
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
C
Chao Yu 已提交
536 537 538
	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 */
539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557
	struct mutex build_lock;	/* lock for build free nids */

	/* for checkpoint */
	char *nat_bitmap;		/* NAT bitmap pointer */
	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 */
558
	bool node_changed;		/* is node block changed */
559 560
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
561 562 563 564 565 566
	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)
{
567
	memset(dn, 0, sizeof(*dn));
568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597
	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 */
598
	NO_CHECK_TYPE,
599 600
};

601 602
struct flush_cmd {
	struct completion wait;
603
	struct llist_node llnode;
604 605 606
	int ret;
};

607 608 609
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
610
	atomic_t submit_flush;			/* # of issued flushes */
611 612
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
613 614
};

615 616 617 618 619 620 621 622 623 624 625 626 627 628
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 */
629 630 631

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
632 633 634

	/* for small discard management */
	struct list_head discard_list;		/* 4KB discard list */
C
Chao Yu 已提交
635
	struct list_head wait_list;		/* linked with issued discard bio */
636 637
	int nr_discards;			/* # of discards in the list */
	int max_discards;			/* max. discards to be issued */
638

J
Jaegeuk Kim 已提交
639 640 641
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

642 643
	struct list_head sit_entry_set;	/* sit entry set list */

644 645
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
646
	unsigned int min_fsync_blocks;	/* threshold for fsync */
647 648

	/* for flush command control */
649 650
	struct flush_cmd_control *cmd_control_info;

651 652 653 654 655 656 657 658 659 660 661
};

/*
 * 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.
 */
662
#define WB_DATA_TYPE(p)	(__is_cp_guaranteed(p) ? F2FS_WB_CP_DATA : F2FS_WB_DATA)
663 664
enum count_type {
	F2FS_DIRTY_DENTS,
665
	F2FS_DIRTY_DATA,
666 667
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
668
	F2FS_INMEM_PAGES,
669
	F2FS_DIRTY_IMETA,
670 671
	F2FS_WB_CP_DATA,
	F2FS_WB_DATA,
672 673 674 675
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
676
 * The below are the page types of bios used in submit_bio().
677 678 679 680 681 682 683 684 685
 * 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.
 */
686
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
687 688 689 690 691 692
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
693 694
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
695
	INMEM_REVOKE,
696 697
	IPU,
	OPU,
698 699
};

J
Jaegeuk Kim 已提交
700
struct f2fs_io_info {
701
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
702
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
M
Mike Christie 已提交
703
	int op;			/* contains REQ_OP_ */
704
	int op_flags;		/* req_flag_bits */
705
	block_t new_blkaddr;	/* new block address to be written */
706
	block_t old_blkaddr;	/* old block address before Cow */
707
	struct page *page;	/* page to be written */
708
	struct page *encrypted_page;	/* encrypted page */
J
Jaegeuk Kim 已提交
709 710
};

M
Mike Christie 已提交
711
#define is_read_io(rw) (rw == READ)
712
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
713
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
714 715
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
716
	struct f2fs_io_info fio;	/* store buffered io info. */
717
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
718 719
};

J
Jaegeuk Kim 已提交
720 721 722 723 724 725 726 727 728 729 730 731 732 733
#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
};

734 735 736
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
737
	DIRTY_META,			/* for all dirtied inode metadata */
738 739 740
	NR_INODE_TYPE,
};

741 742 743 744 745 746 747 748
/* 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 */
};

749 750 751 752 753 754
/* 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 */
755
	SBI_NEED_SB_WRITE,			/* need to recover superblock */
756
	SBI_NEED_CP,				/* need to checkpoint */
757 758
};

759 760
enum {
	CP_TIME,
761
	REQ_TIME,
762 763 764
	MAX_TIME,
};

765 766 767 768
#ifdef CONFIG_F2FS_FS_ENCRYPTION
#define F2FS_KEY_DESC_PREFIX "f2fs:"
#define F2FS_KEY_DESC_PREFIX_SIZE 5
#endif
769 770
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
771
	struct proc_dir_entry *s_proc;		/* proc entry */
772
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
773
	int valid_super_block;			/* valid super block no */
774
	unsigned long s_flag;				/* flags for sbi */
775

776 777 778 779
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	u8 key_prefix[F2FS_KEY_DESC_PREFIX_SIZE];
	u8 key_prefix_size;
#endif
780 781 782 783 784 785

#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

786 787 788 789 790 791
	/* 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 */
792 793

	/* for bio operations */
794
	struct f2fs_bio_info read_io;			/* for read bios */
795
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
796
	struct mutex wio_mutex[NODE + 1];	/* bio ordering for NODE/DATA */
797 798
	int write_io_size_bits;			/* Write IO size bits */
	mempool_t *write_io_dummy;		/* Dummy pages */
799 800 801

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
802
	int cur_cp_pack;			/* remain current cp pack */
803
	spinlock_t cp_lock;			/* for flag in ckpt */
804
	struct inode *meta_inode;		/* cache meta blocks */
805
	struct mutex cp_mutex;			/* checkpoint procedure lock */
806
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
807
	struct rw_semaphore node_write;		/* locking node writes */
808
	wait_queue_head_t cp_wait;
809 810
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
811

812
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
813 814

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

817 818 819
	/* 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 */
820

821 822 823 824 825
	/* 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 */
826
	atomic_t total_ext_tree;		/* extent tree count */
827
	struct list_head zombie_list;		/* extent zombie tree list */
828
	atomic_t total_zombie_tree;		/* extent zombie tree count */
829 830
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
831
	/* basic filesystem units */
832 833 834 835 836 837 838 839 840 841 842 843 844
	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 已提交
845
	loff_t max_file_blocks;			/* max block index of file */
846
	int active_logs;			/* # of active logs */
847
	int dir_level;				/* directory level */
848 849 850

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
851
	block_t discard_blks;			/* discard command candidats */
852 853
	block_t last_valid_block_count;		/* for recovery */
	u32 s_next_generation;			/* for NFS support */
854 855

	/* # of pages, see count_type */
856
	atomic_t nr_pages[NR_COUNT_TYPE];
857 858
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
859

860 861 862
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

863 864 865 866 867
	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 */
868
	unsigned int cur_victim_sec;		/* current victim section num */
869

870 871 872
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

873 874 875 876
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
877
#ifdef CONFIG_F2FS_STAT_FS
878 879 880
	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 */
881
	atomic_t inplace_count;		/* # of inplace update */
882 883 884 885
	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 已提交
886
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
887 888
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
889 890
	atomic_t aw_cnt;			/* # of atomic writes */
	atomic_t max_aw_cnt;			/* max # of atomic writes */
891
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
892
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
893 894
#endif
	unsigned int last_victim[2];		/* last victim segment # */
895
	spinlock_t stat_lock;			/* lock for stat operations */
896 897 898 899

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
900 901 902

	/* For shrinker support */
	struct list_head s_list;
J
Jaegeuk Kim 已提交
903 904
	int s_ndevs;				/* number of devices */
	struct f2fs_dev_info *devs;		/* for device list */
905 906
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
907 908 909 910

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
911 912 913

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
914 915 916 917 918

	/* For fault injection */
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct f2fs_fault_info fault_info;
#endif
919 920
};

921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944
#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

945 946 947 948 949 950 951
/* 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)

952 953 954 955 956 957 958 959 960 961 962 963 964
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);
}

965 966 967 968 969 970 971 972 973 974 975 976
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);
}

977 978 979
/*
 * Inline functions
 */
K
Keith Mok 已提交
980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002
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;
}

1003 1004 1005 1006 1007 1008 1009 1010 1011 1012
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;
}

1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027
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);
}

1028 1029 1030 1031 1032 1033 1034 1035 1036 1037
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);
}

1038 1039 1040 1041 1042
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

1043 1044 1045 1046 1047
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072
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 已提交
1073 1074 1075 1076 1077
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

1078 1079 1080 1081 1082
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1083 1084
static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
{
1085
	return test_bit(type, &sbi->s_flag);
1086 1087 1088
}

static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1089
{
1090
	set_bit(type, &sbi->s_flag);
1091 1092
}

1093
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1094
{
1095
	clear_bit(type, &sbi->s_flag);
1096 1097
}

1098 1099 1100 1101 1102
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

1103
static inline bool __is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
1104 1105
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1106

1107 1108 1109
	return ckpt_flags & f;
}

1110
static inline bool is_set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1111
{
1112 1113 1114 1115 1116 1117 1118 1119
	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);
1120 1121 1122 1123
	ckpt_flags |= f;
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

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

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

1147
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1148
{
1149
	down_read(&sbi->cp_rwsem);
1150 1151
}

1152
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1153
{
1154
	up_read(&sbi->cp_rwsem);
1155 1156
}

1157
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1158
{
1159
	down_write(&sbi->cp_rwsem);
1160 1161
}

1162
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1163
{
1164
	up_write(&sbi->cp_rwsem);
1165 1166
}

1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184
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)
{
1185 1186
	return (is_set_ckpt_flags(sbi, CP_UMOUNT_FLAG) ||
			is_set_ckpt_flags(sbi, CP_FASTBOOT_FLAG));
1187 1188
}

1189 1190 1191
/*
 * Check whether the given nid is within node id range.
 */
1192
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1193
{
1194 1195
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1196
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1197 1198
		return -EINVAL;
	return 0;
1199 1200 1201 1202 1203 1204 1205 1206 1207 1208
}

#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 已提交
1209
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1210
	else
C
Chris Fries 已提交
1211
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1212 1213
}

1214 1215 1216 1217 1218
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1219
static inline void f2fs_i_blocks_write(struct inode *, blkcnt_t, bool);
1220
static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
1221
				 struct inode *inode, blkcnt_t *count)
1222
{
1223
	blkcnt_t diff;
1224

J
Jaegeuk Kim 已提交
1225
#ifdef CONFIG_F2FS_FAULT_INJECTION
1226
	if (time_to_inject(sbi, FAULT_BLOCK))
J
Jaegeuk Kim 已提交
1227 1228
		return false;
#endif
1229 1230 1231 1232 1233 1234
	/*
	 * 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));

1235 1236 1237
	spin_lock(&sbi->stat_lock);
	sbi->total_valid_block_count += (block_t)(*count);
	if (unlikely(sbi->total_valid_block_count > sbi->user_block_count)) {
1238 1239
		diff = sbi->total_valid_block_count - sbi->user_block_count;
		*count -= diff;
1240
		sbi->total_valid_block_count = sbi->user_block_count;
1241 1242
		if (!*count) {
			spin_unlock(&sbi->stat_lock);
1243
			percpu_counter_sub(&sbi->alloc_valid_block_count, diff);
1244 1245
			return false;
		}
1246 1247
	}
	spin_unlock(&sbi->stat_lock);
1248

1249
	f2fs_i_blocks_write(inode, *count, true);
1250 1251 1252
	return true;
}

1253
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1254 1255 1256 1257
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1258 1259
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1260 1261
	sbi->total_valid_block_count -= (block_t)count;
	spin_unlock(&sbi->stat_lock);
1262
	f2fs_i_blocks_write(inode, count, false);
1263 1264 1265 1266
}

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

1269 1270
	if (count_type == F2FS_DIRTY_DATA || count_type == F2FS_INMEM_PAGES ||
		count_type == F2FS_WB_CP_DATA || count_type == F2FS_WB_DATA)
1271 1272
		return;

1273
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1274 1275
}

1276
static inline void inode_inc_dirty_pages(struct inode *inode)
1277
{
1278
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1279 1280
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1281 1282 1283 1284
}

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1285
	atomic_dec(&sbi->nr_pages[count_type]);
1286 1287
}

1288
static inline void inode_dec_dirty_pages(struct inode *inode)
1289
{
1290 1291
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1292 1293
		return;

1294
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1295 1296
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1297 1298
}

1299
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1300
{
1301
	return atomic_read(&sbi->nr_pages[count_type]);
1302 1303
}

1304
static inline int get_dirty_pages(struct inode *inode)
1305
{
1306
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1307 1308
}

1309 1310
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1311
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1312 1313 1314 1315
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1316 1317
}

1318 1319
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1320
	return sbi->total_valid_block_count;
1321 1322
}

1323 1324 1325 1326 1327
static inline block_t discard_blocks(struct f2fs_sb_info *sbi)
{
	return sbi->discard_blks;
}

1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340
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 已提交
1341 1342 1343 1344 1345
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1346 1347 1348
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1349 1350
	int offset;

W
Wanpeng Li 已提交
1351
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1352 1353 1354
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1355
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1356 1357
	} else {
		offset = (flag == NAT_BITMAP) ?
1358
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1359 1360
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1361 1362 1363 1364
}

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

1367
	if (sbi->cur_cp_pack == 2)
1368
		start_addr += sbi->blocks_per_seg;
1369 1370
	return start_addr;
}
1371

1372 1373 1374
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);
1375

1376 1377
	if (sbi->cur_cp_pack == 1)
		start_addr += sbi->blocks_per_seg;
1378 1379 1380
	return start_addr;
}

1381 1382 1383 1384 1385
static inline void __set_cp_next_pack(struct f2fs_sb_info *sbi)
{
	sbi->cur_cp_pack = (sbi->cur_cp_pack == 1) ? 2 : 1;
}

1386 1387 1388 1389 1390 1391
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,
1392
						struct inode *inode)
1393 1394 1395 1396 1397 1398
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1399
	valid_block_count = sbi->total_valid_block_count + 1;
1400
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1401 1402 1403 1404
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1405
	valid_node_count = sbi->total_valid_node_count + 1;
1406
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1407 1408 1409 1410 1411
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1412
		f2fs_i_blocks_write(inode, 1, true);
1413 1414 1415

	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1416 1417
	spin_unlock(&sbi->stat_lock);

1418
	percpu_counter_inc(&sbi->alloc_valid_block_count);
1419 1420 1421 1422
	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1423
						struct inode *inode)
1424 1425 1426
{
	spin_lock(&sbi->stat_lock);

1427 1428 1429
	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);
1430

1431
	f2fs_i_blocks_write(inode, 1, false);
1432 1433
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1434 1435 1436 1437 1438 1439

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1440
	return sbi->total_valid_node_count;
1441 1442 1443 1444
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1445
	percpu_counter_inc(&sbi->total_valid_inode_count);
1446 1447
}

1448
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1449
{
1450
	percpu_counter_dec(&sbi->total_valid_inode_count);
1451 1452
}

1453
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1454
{
1455
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1456 1457
}

1458 1459 1460
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1461 1462 1463 1464 1465
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct page *page = find_lock_page(mapping, index);
	if (page)
		return page;

1466
	if (time_to_inject(F2FS_M_SB(mapping), FAULT_PAGE_ALLOC))
1467 1468
		return NULL;
#endif
1469 1470 1471 1472 1473
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1474 1475 1476 1477 1478 1479 1480 1481 1482 1483
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);
}

1484 1485
static inline void f2fs_put_page(struct page *page, int unlock)
{
1486
	if (!page)
1487 1488 1489
		return;

	if (unlock) {
1490
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1491 1492
		unlock_page(page);
	}
1493
	put_page(page);
1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506
}

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,
1507
					size_t size)
1508
{
1509
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1510 1511
}

1512 1513 1514 1515 1516
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1517 1518 1519
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1520 1521 1522
	return entry;
}

J
Jaegeuk Kim 已提交
1523 1524 1525 1526 1527 1528
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1529 1530
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1531 1532 1533
	return bio;
}

1534 1535 1536 1537 1538 1539 1540
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();
}

1541 1542 1543 1544
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1545
	struct f2fs_node *p = F2FS_NODE(page);
1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558
	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;
1559
	raw_node = F2FS_NODE(node_page);
1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572
	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;
}

1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590
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;
}

1591
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602
{
	int mask;
	int ret;

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

1603
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614
{
	int mask;
	int ret;

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

1615 1616 1617 1618 1619 1620 1621 1622 1623
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1624 1625 1626
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1627
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1628
	FI_AUTO_RECOVER,	/* indicate inode is recoverable */
1629
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1630 1631 1632
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1633
	FI_FREE_NID,		/* free allocated nide */
1634
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1635
	FI_INLINE_XATTR,	/* used for inline xattr */
1636
	FI_INLINE_DATA,		/* used for inline data*/
1637
	FI_INLINE_DENTRY,	/* used for inline dentry */
1638 1639
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1640 1641
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
1642
	FI_VOLATILE_FILE,	/* indicate volatile file */
1643
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1644
	FI_DROP_CACHE,		/* drop dirty page cache */
1645
	FI_DATA_EXIST,		/* indicate data exists */
1646
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1647
	FI_DO_DEFRAG,		/* indicate defragment is running */
1648
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1649 1650
};

1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661
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:
1662
		f2fs_mark_inode_dirty_sync(inode, true);
1663 1664 1665
	}
}

1666
static inline void set_inode_flag(struct inode *inode, int flag)
1667
{
1668 1669
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1670
	__mark_inode_dirty_flag(inode, flag, true);
1671 1672
}

1673
static inline int is_inode_flag_set(struct inode *inode, int flag)
1674
{
1675
	return test_bit(flag, &F2FS_I(inode)->flags);
1676 1677
}

1678
static inline void clear_inode_flag(struct inode *inode, int flag)
1679
{
1680 1681
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1682
	__mark_inode_dirty_flag(inode, flag, false);
1683 1684
}

1685
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1686
{
1687 1688
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1689
	f2fs_mark_inode_dirty_sync(inode, false);
1690 1691
}

1692
static inline void f2fs_i_links_write(struct inode *inode, bool inc)
1693
{
1694 1695 1696 1697
	if (inc)
		inc_nlink(inode);
	else
		drop_nlink(inode);
1698
	f2fs_mark_inode_dirty_sync(inode, true);
1699 1700
}

1701 1702 1703
static inline void f2fs_i_blocks_write(struct inode *inode,
					blkcnt_t diff, bool add)
{
1704 1705 1706
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1707 1708
	inode->i_blocks = add ? inode->i_blocks + diff :
				inode->i_blocks - diff;
1709
	f2fs_mark_inode_dirty_sync(inode, true);
1710 1711
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1712 1713
}

1714 1715
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1716 1717 1718
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1719 1720 1721 1722
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
1723
	f2fs_mark_inode_dirty_sync(inode, true);
1724 1725
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1726 1727
}

1728
static inline void f2fs_i_depth_write(struct inode *inode, unsigned int depth)
1729
{
1730
	F2FS_I(inode)->i_current_depth = depth;
1731
	f2fs_mark_inode_dirty_sync(inode, true);
1732 1733
}

1734
static inline void f2fs_i_xnid_write(struct inode *inode, nid_t xnid)
J
Jaegeuk Kim 已提交
1735
{
1736
	F2FS_I(inode)->i_xattr_nid = xnid;
1737
	f2fs_mark_inode_dirty_sync(inode, true);
1738 1739 1740 1741 1742
}

static inline void f2fs_i_pino_write(struct inode *inode, nid_t pino)
{
	F2FS_I(inode)->i_pino = pino;
1743
	f2fs_mark_inode_dirty_sync(inode, true);
1744 1745
}

1746
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1747
{
1748 1749
	struct f2fs_inode_info *fi = F2FS_I(inode);

J
Jaegeuk Kim 已提交
1750
	if (ri->i_inline & F2FS_INLINE_XATTR)
1751
		set_bit(FI_INLINE_XATTR, &fi->flags);
1752
	if (ri->i_inline & F2FS_INLINE_DATA)
1753
		set_bit(FI_INLINE_DATA, &fi->flags);
1754
	if (ri->i_inline & F2FS_INLINE_DENTRY)
1755
		set_bit(FI_INLINE_DENTRY, &fi->flags);
1756
	if (ri->i_inline & F2FS_DATA_EXIST)
1757
		set_bit(FI_DATA_EXIST, &fi->flags);
1758
	if (ri->i_inline & F2FS_INLINE_DOTS)
1759
		set_bit(FI_INLINE_DOTS, &fi->flags);
J
Jaegeuk Kim 已提交
1760 1761
}

1762
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1763 1764 1765
{
	ri->i_inline = 0;

1766
	if (is_inode_flag_set(inode, FI_INLINE_XATTR))
J
Jaegeuk Kim 已提交
1767
		ri->i_inline |= F2FS_INLINE_XATTR;
1768
	if (is_inode_flag_set(inode, FI_INLINE_DATA))
1769
		ri->i_inline |= F2FS_INLINE_DATA;
1770
	if (is_inode_flag_set(inode, FI_INLINE_DENTRY))
1771
		ri->i_inline |= F2FS_INLINE_DENTRY;
1772
	if (is_inode_flag_set(inode, FI_DATA_EXIST))
1773
		ri->i_inline |= F2FS_DATA_EXIST;
1774
	if (is_inode_flag_set(inode, FI_INLINE_DOTS))
1775
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1776 1777
}

1778 1779
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
1780
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
1781 1782
}

1783
static inline unsigned int addrs_per_inode(struct inode *inode)
1784
{
1785
	if (f2fs_has_inline_xattr(inode))
1786 1787 1788 1789
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1790 1791
static inline void *inline_xattr_addr(struct page *page)
{
1792
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1793 1794 1795 1796 1797 1798
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1799
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1800 1801 1802 1803 1804
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1805 1806
static inline int f2fs_has_inline_data(struct inode *inode)
{
1807
	return is_inode_flag_set(inode, FI_INLINE_DATA);
1808 1809
}

1810 1811
static inline void f2fs_clear_inline_inode(struct inode *inode)
{
1812 1813
	clear_inode_flag(inode, FI_INLINE_DATA);
	clear_inode_flag(inode, FI_DATA_EXIST);
1814 1815 1816 1817
}

static inline int f2fs_exist_data(struct inode *inode)
{
1818
	return is_inode_flag_set(inode, FI_DATA_EXIST);
1819 1820
}

1821 1822
static inline int f2fs_has_inline_dots(struct inode *inode)
{
1823
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
1824 1825
}

J
Jaegeuk Kim 已提交
1826 1827
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
1828
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
1829 1830
}

1831 1832
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
1833
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
1834 1835
}

1836 1837
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
1838
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
1839 1840
}

1841 1842
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
1843
	return is_inode_flag_set(inode, FI_DROP_CACHE);
1844 1845
}

1846 1847
static inline void *inline_data_addr(struct page *page)
{
1848
	struct f2fs_inode *ri = F2FS_INODE(page);
1849 1850 1851
	return (void *)&(ri->i_addr[1]);
}

1852 1853
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
1854
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
1855 1856
}

1857 1858 1859 1860 1861 1862
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1863 1864 1865 1866 1867 1868 1869 1870
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;
1871
	f2fs_mark_inode_dirty_sync(inode, true);
1872 1873 1874 1875 1876
}

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

1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895
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);
1896 1897
}

J
Jaegeuk Kim 已提交
1898 1899 1900 1901 1902
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1903 1904
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
1905
	return is_set_ckpt_flags(sbi, CP_ERROR_FLAG);
1906 1907
}

1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918
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 已提交
1919 1920 1921
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
1922
			is_inode_flag_set(inode, FI_NO_EXTENT))
J
Jaegeuk Kim 已提交
1923 1924
		return false;

A
Al Viro 已提交
1925
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
1926 1927
}

1928 1929
static inline void *f2fs_kmalloc(struct f2fs_sb_info *sbi,
					size_t size, gfp_t flags)
1930
{
J
Jaegeuk Kim 已提交
1931
#ifdef CONFIG_F2FS_FAULT_INJECTION
1932
	if (time_to_inject(sbi, FAULT_KMALLOC))
J
Jaegeuk Kim 已提交
1933 1934
		return NULL;
#endif
1935 1936 1937
	return kmalloc(size, flags);
}

1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957
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;
}

1958
#define get_inode_mode(i) \
1959
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
1960 1961
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1962
/* get offset of first page in next direct node */
1963 1964 1965 1966
#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))
1967

1968 1969 1970 1971 1972
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1973
int truncate_blocks(struct inode *, u64, bool);
1974
int f2fs_truncate(struct inode *);
1975
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1976 1977
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1978
int truncate_data_blocks_range(struct dnode_of_data *, int);
1979
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1980
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1981 1982 1983 1984 1985 1986

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1987
struct inode *f2fs_iget_retry(struct super_block *, unsigned long);
1988
int try_to_free_nats(struct f2fs_sb_info *, int);
1989 1990
int update_inode(struct inode *, struct page *);
int update_inode_page(struct inode *);
1991 1992
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1993
void handle_failed_inode(struct inode *);
1994 1995 1996 1997 1998 1999 2000 2001 2002

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

/*
 * dir.c
 */
2003
void set_de_type(struct f2fs_dir_entry *, umode_t);
2004
unsigned char get_de_type(struct f2fs_dir_entry *);
2005
struct f2fs_dir_entry *find_target_dentry(struct fscrypt_name *,
2006
			f2fs_hash_t, int *, struct f2fs_dentry_ptr *);
C
Chao Yu 已提交
2007
int f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
2008
			unsigned int, struct fscrypt_str *);
2009 2010
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
2011
struct page *init_inode_metadata(struct inode *, struct inode *,
2012
		const struct qstr *, const struct qstr *, struct page *);
2013
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
2014
int room_for_filename(const void *, int, int);
J
Jaegeuk Kim 已提交
2015
void f2fs_drop_nlink(struct inode *, struct inode *);
2016 2017
struct f2fs_dir_entry *__f2fs_find_entry(struct inode *, struct fscrypt_name *,
							struct page **);
A
Al Viro 已提交
2018
struct f2fs_dir_entry *f2fs_find_entry(struct inode *, const struct qstr *,
2019 2020
							struct page **);
struct f2fs_dir_entry *f2fs_parent_dir(struct inode *, struct page **);
2021
ino_t f2fs_inode_by_name(struct inode *, const struct qstr *, struct page **);
2022 2023
void f2fs_set_link(struct inode *, struct f2fs_dir_entry *,
				struct page *, struct inode *);
2024
int update_dent_inode(struct inode *, struct inode *, const struct qstr *);
2025
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
2026
			const struct qstr *, f2fs_hash_t , unsigned int);
2027
int f2fs_add_regular_entry(struct inode *, const struct qstr *,
2028
			const struct qstr *, struct inode *, nid_t, umode_t);
2029 2030
int __f2fs_do_add_link(struct inode *, struct fscrypt_name*, struct inode *,
			nid_t, umode_t);
2031 2032
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
2033 2034
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
2035
int f2fs_do_tmpfile(struct inode *, struct inode *);
2036 2037
bool f2fs_empty_dir(struct inode *);

2038 2039
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
2040
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
2041
				inode, inode->i_ino, inode->i_mode);
2042 2043
}

2044 2045 2046
/*
 * super.c
 */
2047
int f2fs_inode_dirtied(struct inode *, bool);
2048
void f2fs_inode_synced(struct inode *);
C
Chao Yu 已提交
2049
int f2fs_commit_super(struct f2fs_sb_info *, bool);
2050
int f2fs_sync_fs(struct super_block *, int);
2051 2052
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
2053
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
2054 2055 2056 2057

/*
 * hash.c
 */
2058
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
2059 2060 2061 2062 2063 2064 2065

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

2066
bool available_free_memory(struct f2fs_sb_info *, int);
J
Jaegeuk Kim 已提交
2067
int need_dentry_mark(struct f2fs_sb_info *, nid_t);
2068 2069
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
2070
void get_node_info(struct f2fs_sb_info *, nid_t, struct node_info *);
2071
pgoff_t get_next_page_offset(struct dnode_of_data *, pgoff_t);
2072 2073
int get_dnode_of_data(struct dnode_of_data *, pgoff_t, int);
int truncate_inode_blocks(struct inode *, pgoff_t);
2074
int truncate_xattr_node(struct inode *, struct page *);
2075
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
C
Chao Yu 已提交
2076
int remove_inode_page(struct inode *);
2077
struct page *new_inode_page(struct inode *);
2078
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
2079 2080 2081
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);
2082
void move_node_page(struct page *, int);
2083 2084
int fsync_node_pages(struct f2fs_sb_info *, struct inode *,
			struct writeback_control *, bool);
2085
int sync_node_pages(struct f2fs_sb_info *, struct writeback_control *);
2086
void build_free_nids(struct f2fs_sb_info *, bool);
2087 2088 2089
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 已提交
2090
int try_to_free_nids(struct f2fs_sb_info *, int);
2091
void recover_inline_xattr(struct inode *, struct page *);
2092
void recover_xattr_data(struct inode *, struct page *, block_t);
2093 2094 2095 2096 2097 2098
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 *);
2099
int __init create_node_manager_caches(void);
2100 2101 2102 2103 2104
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
2105
void register_inmem_page(struct inode *, struct page *);
2106 2107
void drop_inmem_pages(struct inode *);
int commit_inmem_pages(struct inode *);
J
Jaegeuk Kim 已提交
2108
void f2fs_balance_fs(struct f2fs_sb_info *, bool);
2109
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
2110
int f2fs_issue_flush(struct f2fs_sb_info *);
2111
int create_flush_cmd_control(struct f2fs_sb_info *);
2112
void destroy_flush_cmd_control(struct f2fs_sb_info *, bool);
2113
void invalidate_blocks(struct f2fs_sb_info *, block_t);
2114
bool is_checkpointed_data(struct f2fs_sb_info *, block_t);
2115
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
2116
void f2fs_wait_discard_bio(struct f2fs_sb_info *, block_t);
2117
void clear_prefree_segments(struct f2fs_sb_info *, struct cp_control *);
2118
void release_discard_addrs(struct f2fs_sb_info *);
2119
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
2120
void allocate_new_segments(struct f2fs_sb_info *);
2121
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
2122
bool exist_trim_candidates(struct f2fs_sb_info *, struct cp_control *);
2123
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
C
Chao Yu 已提交
2124
void update_meta_page(struct f2fs_sb_info *, void *, block_t);
2125
void write_meta_page(struct f2fs_sb_info *, struct page *);
2126 2127 2128
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 *);
2129 2130
void __f2fs_replace_block(struct f2fs_sb_info *, struct f2fs_summary *,
					block_t, block_t, bool, bool);
2131
void f2fs_replace_block(struct f2fs_sb_info *, struct dnode_of_data *,
2132
				block_t, block_t, unsigned char, bool, bool);
2133 2134
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
2135
void f2fs_wait_on_page_writeback(struct page *, enum page_type, bool);
2136
void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *, block_t);
2137 2138
void write_data_summaries(struct f2fs_sb_info *, block_t);
void write_node_summaries(struct f2fs_sb_info *, block_t);
2139
int lookup_journal_in_cursum(struct f2fs_journal *, int, unsigned int, int);
2140
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
2141 2142
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
2143 2144
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
2145 2146 2147 2148

/*
 * checkpoint.c
 */
2149
void f2fs_stop_checkpoint(struct f2fs_sb_info *, bool);
2150 2151
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
2152
struct page *get_tmp_page(struct f2fs_sb_info *, pgoff_t);
2153
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
2154
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int, bool);
2155
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
2156
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
2157 2158
void add_ino_entry(struct f2fs_sb_info *, nid_t, int type);
void remove_ino_entry(struct f2fs_sb_info *, nid_t, int type);
2159
void release_ino_entry(struct f2fs_sb_info *, bool);
2160
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
2161
int f2fs_sync_inode_meta(struct f2fs_sb_info *);
J
Jaegeuk Kim 已提交
2162 2163
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
2164
void add_orphan_inode(struct inode *);
2165
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
2166
int recover_orphan_inodes(struct f2fs_sb_info *);
2167
int get_valid_checkpoint(struct f2fs_sb_info *);
2168
void update_dirty_page(struct inode *, struct page *);
2169
void remove_dirty_inode(struct inode *);
C
Chao Yu 已提交
2170
int sync_dirty_inodes(struct f2fs_sb_info *, enum inode_type);
C
Chao Yu 已提交
2171
int write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
2172
void init_ino_entry_info(struct f2fs_sb_info *);
2173
int __init create_checkpoint_caches(void);
2174 2175 2176 2177 2178
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
2179
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
2180 2181
void f2fs_submit_merged_bio_cond(struct f2fs_sb_info *, struct inode *,
				struct page *, nid_t, enum page_type, int);
2182
void f2fs_flush_merged_bios(struct f2fs_sb_info *);
2183
int f2fs_submit_page_bio(struct f2fs_io_info *);
2184
int f2fs_submit_page_mbio(struct f2fs_io_info *);
J
Jaegeuk Kim 已提交
2185 2186 2187
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);
2188
void set_data_blkaddr(struct dnode_of_data *);
2189
void f2fs_update_data_blkaddr(struct dnode_of_data *, block_t);
2190
int reserve_new_blocks(struct dnode_of_data *, blkcnt_t);
2191
int reserve_new_block(struct dnode_of_data *);
2192
int f2fs_get_block(struct dnode_of_data *, pgoff_t);
2193
int f2fs_preallocate_blocks(struct kiocb *, struct iov_iter *);
2194
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
2195
struct page *get_read_data_page(struct inode *, pgoff_t, int, bool);
2196
struct page *find_data_page(struct inode *, pgoff_t);
2197
struct page *get_lock_data_page(struct inode *, pgoff_t, bool);
2198
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
2199
int do_write_data_page(struct f2fs_io_info *);
C
Chao Yu 已提交
2200
int f2fs_map_blocks(struct inode *, struct f2fs_map_blocks *, int, int);
J
Jaegeuk Kim 已提交
2201
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
2202
void f2fs_set_page_dirty_nobuffers(struct page *);
2203 2204
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
2205 2206 2207 2208
#ifdef CONFIG_MIGRATION
int f2fs_migrate_page(struct address_space *, struct page *, struct page *,
				enum migrate_mode);
#endif
2209 2210 2211 2212 2213 2214

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
2215
block_t start_bidx_of_node(unsigned int, struct inode *);
J
Jaegeuk Kim 已提交
2216
int f2fs_gc(struct f2fs_sb_info *, bool, bool);
2217 2218 2219 2220 2221
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
2222
int recover_fsync_data(struct f2fs_sb_info *, bool);
2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233
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;
2234 2235
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
2236
	int ext_tree, zombie_tree, ext_node;
2237 2238
	int ndirty_node, ndirty_dent, ndirty_meta, ndirty_data, ndirty_imeta;
	int inmem_pages;
2239
	unsigned int ndirty_dirs, ndirty_files, ndirty_all;
C
Chao Yu 已提交
2240
	int nats, dirty_nats, sits, dirty_sits, free_nids, alloc_nids;
2241
	int total_count, utilization;
2242
	int bg_gc, nr_wb_cp_data, nr_wb_data;
J
Jaegeuk Kim 已提交
2243
	int inline_xattr, inline_inode, inline_dir, orphans;
2244
	int aw_cnt, max_aw_cnt;
2245
	unsigned int valid_count, valid_node_count, valid_inode_count, discard_blks;
2246 2247 2248 2249
	unsigned int bimodal, avg_vblocks;
	int util_free, util_valid, util_invalid;
	int rsvd_segs, overp_segs;
	int dirty_count, node_pages, meta_pages;
2250
	int prefree_count, call_count, cp_count, bg_cp_count;
2251
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
2252
	int bg_node_segs, bg_data_segs;
2253
	int tot_blks, data_blks, node_blks;
2254
	int bg_data_blks, bg_node_blks;
2255 2256 2257 2258 2259 2260
	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];
2261
	unsigned int inplace_count;
C
Chao Yu 已提交
2262
	unsigned long long base_mem, cache_mem, page_mem;
2263 2264
};

2265 2266
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2267
	return (struct f2fs_stat_info *)sbi->stat_info;
2268 2269
}

2270
#define stat_inc_cp_count(si)		((si)->cp_count++)
2271
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
2272 2273
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
2274 2275
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
2276 2277 2278 2279
#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 已提交
2280 2281 2282 2283 2284 2285 2286 2287 2288 2289
#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)
2290 2291 2292
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2293
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
2294 2295 2296 2297
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2298
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
2299
	} while (0)
2300 2301 2302
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2303
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
2304 2305 2306 2307
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2308
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
2309
	} while (0)
2310 2311 2312 2313
#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]++)
2314 2315
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326
#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)
2327
#define stat_inc_seg_count(sbi, type, gc_type)				\
2328
	do {								\
2329
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2330
		(si)->tot_segs++;					\
2331
		if (type == SUM_TYPE_DATA) {				\
2332
			si->data_segs++;				\
2333 2334
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2335
			si->node_segs++;				\
2336 2337
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2338 2339 2340 2341 2342
	} while (0)

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

2343
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2344
	do {								\
2345
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2346 2347
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2348
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2349 2350
	} while (0)

2351
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2352
	do {								\
2353
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2354 2355
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2356
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2357 2358 2359 2360
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
2361
int __init f2fs_create_root_stats(void);
2362
void f2fs_destroy_root_stats(void);
2363
#else
2364
#define stat_inc_cp_count(si)
2365
#define stat_inc_bg_cp_count(si)
2366
#define stat_inc_call_count(si)
2367
#define stat_inc_bggc_count(si)
C
Chao Yu 已提交
2368 2369
#define stat_inc_dirty_inode(sbi, type)
#define stat_dec_dirty_inode(sbi, type)
2370
#define stat_inc_total_hit(sb)
2371
#define stat_inc_rbtree_node_hit(sb)
2372 2373
#define stat_inc_largest_node_hit(sbi)
#define stat_inc_cached_node_hit(sbi)
C
Chao Yu 已提交
2374 2375
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
2376 2377
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
2378 2379
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
2380 2381 2382
#define stat_inc_atomic_write(inode)
#define stat_dec_atomic_write(inode)
#define stat_update_max_atomic_write(inode)
2383 2384
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
2385
#define stat_inc_inplace_blocks(sbi)
2386
#define stat_inc_seg_count(sbi, type, gc_type)
2387
#define stat_inc_tot_blk_count(si, blks)
2388 2389
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
2390 2391 2392

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2393
static inline int __init f2fs_create_root_stats(void) { return 0; }
2394
static inline void f2fs_destroy_root_stats(void) { }
2395 2396 2397 2398 2399 2400 2401 2402 2403 2404
#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;
2405
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2406
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2407
extern struct kmem_cache *inode_entry_slab;
2408

2409 2410 2411
/*
 * inline.c
 */
2412 2413
bool f2fs_may_inline_data(struct inode *);
bool f2fs_may_inline_dentry(struct inode *);
2414
void read_inline_data(struct page *, struct page *);
2415
bool truncate_inline_inode(struct page *, u64);
2416
int f2fs_read_inline_data(struct inode *, struct page *);
2417 2418 2419
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 *);
2420
bool recover_inline_data(struct inode *, struct page *);
2421
struct f2fs_dir_entry *find_in_inline_dir(struct inode *,
2422
				struct fscrypt_name *, struct page **);
2423
int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
2424 2425
int f2fs_add_inline_entry(struct inode *, const struct qstr *,
		const struct qstr *, struct inode *, nid_t, umode_t);
2426 2427 2428
void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
						struct inode *, struct inode *);
bool f2fs_empty_inline_dir(struct inode *);
2429
int f2fs_read_inline_dir(struct file *, struct dir_context *,
2430
						struct fscrypt_str *);
J
Jaegeuk Kim 已提交
2431 2432
int f2fs_inline_data_fiemap(struct inode *,
		struct fiemap_extent_info *, __u64, __u64);
2433

2434 2435 2436 2437 2438 2439 2440 2441
/*
 * 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 *);

2442 2443 2444 2445
/*
 * extent_cache.c
 */
unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
2446
bool f2fs_init_extent_tree(struct inode *, struct f2fs_extent *);
2447
void f2fs_drop_extent_tree(struct inode *);
2448 2449 2450 2451
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 已提交
2452 2453
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
						pgoff_t, block_t, unsigned int);
2454 2455 2456 2457
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2458 2459 2460
/*
 * crypto support
 */
2461
static inline bool f2fs_encrypted_inode(struct inode *inode)
2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474
{
	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)
{
2475
	return bio->bi_private != NULL;
2476 2477 2478 2479 2480 2481
}

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

2483
static inline int f2fs_sb_mounted_blkzoned(struct super_block *sb)
2484
{
2485
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_BLKZONED);
2486 2487
}

2488 2489
#ifdef CONFIG_BLK_DEV_ZONED
static inline int get_blkz_type(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
2490
			struct block_device *bdev, block_t blkaddr)
2491 2492
{
	unsigned int zno = blkaddr >> sbi->log_blocks_per_blkz;
J
Jaegeuk Kim 已提交
2493
	int i;
2494

J
Jaegeuk Kim 已提交
2495 2496 2497 2498
	for (i = 0; i < sbi->s_ndevs; i++)
		if (FDEV(i).bdev == bdev)
			return FDEV(i).blkz_type[zno];
	return -EINVAL;
2499 2500 2501
}
#endif

2502
static inline bool f2fs_discard_en(struct f2fs_sb_info *sbi)
2503
{
2504 2505 2506
	struct request_queue *q = bdev_get_queue(sbi->sb->s_bdev);

	return blk_queue_discard(q) || f2fs_sb_mounted_blkzoned(sbi->sb);
2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523
}

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

2524 2525 2526
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2527
	umode_t mode = inode->i_mode;
2528 2529 2530 2531 2532 2533 2534

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

2535 2536 2537 2538 2539 2540 2541 2542 2543 2544
#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
2545 2546
#define fscrypt_ioctl_set_policy	fscrypt_notsupp_ioctl_set_policy
#define fscrypt_ioctl_get_policy	fscrypt_notsupp_ioctl_get_policy
2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557
#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
2558
#endif
2559
#endif