f2fs.h 76.5 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 186 187 188 189 190
struct bio_entry {
	struct list_head list;
	struct bio *bio;
	struct completion event;
	int error;
};

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

199 200
#define nats_in_cursum(jnl)		(le16_to_cpu(jnl->n_nats))
#define sits_in_cursum(jnl)		(le16_to_cpu(jnl->n_sits))
201

202 203 204 205
#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)
206

207 208
#define MAX_NAT_JENTRIES(jnl)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(jnl))
#define MAX_SIT_JENTRIES(jnl)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(jnl))
209

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

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

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

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

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

251 252 253
#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
254

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

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

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

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

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

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

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

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

334
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
335

336 337
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

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

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

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

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

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

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

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

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

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

420 421
#define DEF_DIR_LEVEL		0

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

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

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

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

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

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

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

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

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

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

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

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

	/* free node ids management */
533
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
C
Chao Yu 已提交
534 535 536
	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 */
537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555
	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 */
556
	bool node_changed;		/* is node block changed */
557 558
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
559 560 561 562 563 564
	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)
{
565
	memset(dn, 0, sizeof(*dn));
566 567 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
	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 */
596
	NO_CHECK_TYPE,
597 598
};

599 600
struct flush_cmd {
	struct completion wait;
601
	struct llist_node llnode;
602 603 604
	int ret;
};

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

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

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
630 631 632

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

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

640 641
	struct list_head sit_entry_set;	/* sit entry set list */

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

	/* for flush command control */
647 648
	struct flush_cmd_control *cmd_control_info;

649 650 651 652 653 654 655 656 657 658 659
};

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

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

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

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

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

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

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

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

757 758
enum {
	CP_TIME,
759
	REQ_TIME,
760 761 762
	MAX_TIME,
};

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

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

#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

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

	/* for bio operations */
792
	struct f2fs_bio_info read_io;			/* for read bios */
793
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
794
	struct mutex wio_mutex[NODE + 1];	/* bio ordering for NODE/DATA */
795 796 797

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

808
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
809 810

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

813 814 815
	/* 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 */
816

817 818 819 820 821
	/* 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 */
822
	atomic_t total_ext_tree;		/* extent tree count */
823
	struct list_head zombie_list;		/* extent zombie tree list */
824
	atomic_t total_zombie_tree;		/* extent zombie tree count */
825 826
	atomic_t total_ext_node;		/* extent info count */

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

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
847
	block_t discard_blks;			/* discard command candidats */
848 849
	block_t last_valid_block_count;		/* for recovery */
	u32 s_next_generation;			/* for NFS support */
850 851

	/* # of pages, see count_type */
852
	atomic_t nr_pages[NR_COUNT_TYPE];
853 854
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
855

856 857 858
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

859 860 861 862 863
	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 */
864
	unsigned int cur_victim_sec;		/* current victim section num */
865

866 867 868
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

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

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
894 895 896

	/* For shrinker support */
	struct list_head s_list;
J
Jaegeuk Kim 已提交
897 898
	int s_ndevs;				/* number of devices */
	struct f2fs_dev_info *devs;		/* for device list */
899 900
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
901 902 903 904

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
905 906 907

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
908 909 910 911 912

	/* For fault injection */
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct f2fs_fault_info fault_info;
#endif
913 914
};

915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938
#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

939 940 941 942 943 944 945
/* 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)

946 947 948 949 950 951 952 953 954 955 956 957 958
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);
}

959 960 961 962 963 964 965 966 967 968 969 970
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);
}

971 972 973
/*
 * Inline functions
 */
K
Keith Mok 已提交
974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996
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;
}

997 998 999 1000 1001 1002 1003 1004 1005 1006
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;
}

1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021
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);
}

1022 1023 1024 1025 1026 1027 1028 1029 1030 1031
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);
}

1032 1033 1034 1035 1036
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

1037 1038 1039 1040 1041
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

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

1072 1073 1074 1075 1076
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1077 1078
static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
{
1079
	return test_bit(type, &sbi->s_flag);
1080 1081 1082
}

static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1083
{
1084
	set_bit(type, &sbi->s_flag);
1085 1086
}

1087
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1088
{
1089
	clear_bit(type, &sbi->s_flag);
1090 1091
}

1092 1093 1094 1095 1096
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

1097
static inline bool __is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
1098 1099
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
1100

1101 1102 1103
	return ckpt_flags & f;
}

1104
static inline bool is_set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1105
{
1106 1107 1108 1109 1110 1111 1112 1113
	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);
1114 1115 1116 1117
	ckpt_flags |= f;
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1118
static inline void set_ckpt_flags(struct f2fs_sb_info *sbi, unsigned int f)
1119
{
1120 1121 1122 1123 1124 1125 1126 1127 1128 1129
	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);
1130 1131 1132 1133
	ckpt_flags &= (~f);
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1134 1135 1136 1137 1138 1139 1140
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);
}

1141
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1142
{
1143
	down_read(&sbi->cp_rwsem);
1144 1145
}

1146
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1147
{
1148
	up_read(&sbi->cp_rwsem);
1149 1150
}

1151
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1152
{
1153
	down_write(&sbi->cp_rwsem);
1154 1155
}

1156
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1157
{
1158
	up_write(&sbi->cp_rwsem);
1159 1160
}

1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178
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)
{
1179 1180
	return (is_set_ckpt_flags(sbi, CP_UMOUNT_FLAG) ||
			is_set_ckpt_flags(sbi, CP_FASTBOOT_FLAG));
1181 1182
}

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

#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 已提交
1203
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1204
	else
C
Chris Fries 已提交
1205
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1206 1207
}

1208 1209 1210 1211 1212
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1213
static inline void f2fs_i_blocks_write(struct inode *, blkcnt_t, bool);
1214
static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
1215
				 struct inode *inode, blkcnt_t *count)
1216
{
1217
	blkcnt_t diff;
1218

J
Jaegeuk Kim 已提交
1219
#ifdef CONFIG_F2FS_FAULT_INJECTION
1220
	if (time_to_inject(sbi, FAULT_BLOCK))
J
Jaegeuk Kim 已提交
1221 1222
		return false;
#endif
1223 1224 1225 1226 1227 1228
	/*
	 * 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));

1229 1230 1231
	spin_lock(&sbi->stat_lock);
	sbi->total_valid_block_count += (block_t)(*count);
	if (unlikely(sbi->total_valid_block_count > sbi->user_block_count)) {
1232 1233
		diff = sbi->total_valid_block_count - sbi->user_block_count;
		*count -= diff;
1234
		sbi->total_valid_block_count = sbi->user_block_count;
1235 1236
		if (!*count) {
			spin_unlock(&sbi->stat_lock);
1237
			percpu_counter_sub(&sbi->alloc_valid_block_count, diff);
1238 1239
			return false;
		}
1240 1241
	}
	spin_unlock(&sbi->stat_lock);
1242

1243
	f2fs_i_blocks_write(inode, *count, true);
1244 1245 1246
	return true;
}

1247
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1248 1249 1250 1251
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1252 1253
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1254 1255
	sbi->total_valid_block_count -= (block_t)count;
	spin_unlock(&sbi->stat_lock);
1256
	f2fs_i_blocks_write(inode, count, false);
1257 1258 1259 1260
}

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

1263 1264
	if (count_type == F2FS_DIRTY_DATA || count_type == F2FS_INMEM_PAGES ||
		count_type == F2FS_WB_CP_DATA || count_type == F2FS_WB_DATA)
1265 1266
		return;

1267
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1268 1269
}

1270
static inline void inode_inc_dirty_pages(struct inode *inode)
1271
{
1272
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1273 1274
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1275 1276 1277 1278
}

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1279
	atomic_dec(&sbi->nr_pages[count_type]);
1280 1281
}

1282
static inline void inode_dec_dirty_pages(struct inode *inode)
1283
{
1284 1285
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1286 1287
		return;

1288
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1289 1290
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1291 1292
}

1293
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1294
{
1295
	return atomic_read(&sbi->nr_pages[count_type]);
1296 1297
}

1298
static inline int get_dirty_pages(struct inode *inode)
1299
{
1300
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1301 1302
}

1303 1304
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1305
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1306 1307 1308 1309
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1310 1311
}

1312 1313
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1314
	return sbi->total_valid_block_count;
1315 1316
}

1317 1318 1319 1320 1321
static inline block_t discard_blocks(struct f2fs_sb_info *sbi)
{
	return sbi->discard_blks;
}

1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334
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 已提交
1335 1336 1337 1338 1339
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1340 1341 1342
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1343 1344
	int offset;

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

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

1361
	if (sbi->cur_cp_pack == 2)
1362
		start_addr += sbi->blocks_per_seg;
1363 1364
	return start_addr;
}
1365

1366 1367 1368
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);
1369

1370 1371
	if (sbi->cur_cp_pack == 1)
		start_addr += sbi->blocks_per_seg;
1372 1373 1374
	return start_addr;
}

1375 1376 1377 1378 1379
static inline void __set_cp_next_pack(struct f2fs_sb_info *sbi)
{
	sbi->cur_cp_pack = (sbi->cur_cp_pack == 1) ? 2 : 1;
}

1380 1381 1382 1383 1384 1385
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,
1386
						struct inode *inode)
1387 1388 1389 1390 1391 1392
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1393
	valid_block_count = sbi->total_valid_block_count + 1;
1394
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1395 1396 1397 1398
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1399
	valid_node_count = sbi->total_valid_node_count + 1;
1400
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1401 1402 1403 1404 1405
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1406
		f2fs_i_blocks_write(inode, 1, true);
1407 1408 1409

	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1410 1411
	spin_unlock(&sbi->stat_lock);

1412
	percpu_counter_inc(&sbi->alloc_valid_block_count);
1413 1414 1415 1416
	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1417
						struct inode *inode)
1418 1419 1420
{
	spin_lock(&sbi->stat_lock);

1421 1422 1423
	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);
1424

1425
	f2fs_i_blocks_write(inode, 1, false);
1426 1427
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1428 1429 1430 1431 1432 1433

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1434
	return sbi->total_valid_node_count;
1435 1436 1437 1438
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1439
	percpu_counter_inc(&sbi->total_valid_inode_count);
1440 1441
}

1442
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1443
{
1444
	percpu_counter_dec(&sbi->total_valid_inode_count);
1445 1446
}

1447
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1448
{
1449
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1450 1451
}

1452 1453 1454
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1455 1456 1457 1458 1459
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct page *page = find_lock_page(mapping, index);
	if (page)
		return page;

1460
	if (time_to_inject(F2FS_M_SB(mapping), FAULT_PAGE_ALLOC))
1461 1462
		return NULL;
#endif
1463 1464 1465 1466 1467
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1468 1469 1470 1471 1472 1473 1474 1475 1476 1477
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);
}

1478 1479
static inline void f2fs_put_page(struct page *page, int unlock)
{
1480
	if (!page)
1481 1482 1483
		return;

	if (unlock) {
1484
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1485 1486
		unlock_page(page);
	}
1487
	put_page(page);
1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500
}

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,
1501
					size_t size)
1502
{
1503
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1504 1505
}

1506 1507 1508 1509 1510
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1511 1512 1513
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1514 1515 1516
	return entry;
}

J
Jaegeuk Kim 已提交
1517 1518 1519 1520 1521 1522
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1523 1524
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1525 1526 1527
	return bio;
}

1528 1529 1530 1531 1532 1533 1534
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();
}

1535 1536 1537 1538
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

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

1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584
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;
}

1585
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596
{
	int mask;
	int ret;

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

1597
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608
{
	int mask;
	int ret;

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

1609 1610 1611 1612 1613 1614 1615 1616 1617
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

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

1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655
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:
1656
		f2fs_mark_inode_dirty_sync(inode, true);
1657 1658 1659
	}
}

1660
static inline void set_inode_flag(struct inode *inode, int flag)
1661
{
1662 1663
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1664
	__mark_inode_dirty_flag(inode, flag, true);
1665 1666
}

1667
static inline int is_inode_flag_set(struct inode *inode, int flag)
1668
{
1669
	return test_bit(flag, &F2FS_I(inode)->flags);
1670 1671
}

1672
static inline void clear_inode_flag(struct inode *inode, int flag)
1673
{
1674 1675
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1676
	__mark_inode_dirty_flag(inode, flag, false);
1677 1678
}

1679
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1680
{
1681 1682
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1683
	f2fs_mark_inode_dirty_sync(inode, false);
1684 1685
}

1686
static inline void f2fs_i_links_write(struct inode *inode, bool inc)
1687
{
1688 1689 1690 1691
	if (inc)
		inc_nlink(inode);
	else
		drop_nlink(inode);
1692
	f2fs_mark_inode_dirty_sync(inode, true);
1693 1694
}

1695 1696 1697
static inline void f2fs_i_blocks_write(struct inode *inode,
					blkcnt_t diff, bool add)
{
1698 1699 1700
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1701 1702
	inode->i_blocks = add ? inode->i_blocks + diff :
				inode->i_blocks - diff;
1703
	f2fs_mark_inode_dirty_sync(inode, true);
1704 1705
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1706 1707
}

1708 1709
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1710 1711 1712
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1713 1714 1715 1716
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
1717
	f2fs_mark_inode_dirty_sync(inode, true);
1718 1719
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1720 1721
}

1722
static inline void f2fs_i_depth_write(struct inode *inode, unsigned int depth)
1723
{
1724
	F2FS_I(inode)->i_current_depth = depth;
1725
	f2fs_mark_inode_dirty_sync(inode, true);
1726 1727
}

1728
static inline void f2fs_i_xnid_write(struct inode *inode, nid_t xnid)
J
Jaegeuk Kim 已提交
1729
{
1730
	F2FS_I(inode)->i_xattr_nid = xnid;
1731
	f2fs_mark_inode_dirty_sync(inode, true);
1732 1733 1734 1735 1736
}

static inline void f2fs_i_pino_write(struct inode *inode, nid_t pino)
{
	F2FS_I(inode)->i_pino = pino;
1737
	f2fs_mark_inode_dirty_sync(inode, true);
1738 1739
}

1740
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1741
{
1742 1743
	struct f2fs_inode_info *fi = F2FS_I(inode);

J
Jaegeuk Kim 已提交
1744
	if (ri->i_inline & F2FS_INLINE_XATTR)
1745
		set_bit(FI_INLINE_XATTR, &fi->flags);
1746
	if (ri->i_inline & F2FS_INLINE_DATA)
1747
		set_bit(FI_INLINE_DATA, &fi->flags);
1748
	if (ri->i_inline & F2FS_INLINE_DENTRY)
1749
		set_bit(FI_INLINE_DENTRY, &fi->flags);
1750
	if (ri->i_inline & F2FS_DATA_EXIST)
1751
		set_bit(FI_DATA_EXIST, &fi->flags);
1752
	if (ri->i_inline & F2FS_INLINE_DOTS)
1753
		set_bit(FI_INLINE_DOTS, &fi->flags);
J
Jaegeuk Kim 已提交
1754 1755
}

1756
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1757 1758 1759
{
	ri->i_inline = 0;

1760
	if (is_inode_flag_set(inode, FI_INLINE_XATTR))
J
Jaegeuk Kim 已提交
1761
		ri->i_inline |= F2FS_INLINE_XATTR;
1762
	if (is_inode_flag_set(inode, FI_INLINE_DATA))
1763
		ri->i_inline |= F2FS_INLINE_DATA;
1764
	if (is_inode_flag_set(inode, FI_INLINE_DENTRY))
1765
		ri->i_inline |= F2FS_INLINE_DENTRY;
1766
	if (is_inode_flag_set(inode, FI_DATA_EXIST))
1767
		ri->i_inline |= F2FS_DATA_EXIST;
1768
	if (is_inode_flag_set(inode, FI_INLINE_DOTS))
1769
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1770 1771
}

1772 1773
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
1774
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
1775 1776
}

1777
static inline unsigned int addrs_per_inode(struct inode *inode)
1778
{
1779
	if (f2fs_has_inline_xattr(inode))
1780 1781 1782 1783
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1784 1785
static inline void *inline_xattr_addr(struct page *page)
{
1786
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1787 1788 1789 1790 1791 1792
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1793
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1794 1795 1796 1797 1798
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1799 1800
static inline int f2fs_has_inline_data(struct inode *inode)
{
1801
	return is_inode_flag_set(inode, FI_INLINE_DATA);
1802 1803
}

1804 1805
static inline void f2fs_clear_inline_inode(struct inode *inode)
{
1806 1807
	clear_inode_flag(inode, FI_INLINE_DATA);
	clear_inode_flag(inode, FI_DATA_EXIST);
1808 1809 1810 1811
}

static inline int f2fs_exist_data(struct inode *inode)
{
1812
	return is_inode_flag_set(inode, FI_DATA_EXIST);
1813 1814
}

1815 1816
static inline int f2fs_has_inline_dots(struct inode *inode)
{
1817
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
1818 1819
}

J
Jaegeuk Kim 已提交
1820 1821
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
1822
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
1823 1824
}

1825 1826
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
1827
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
1828 1829
}

1830 1831
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
1832
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
1833 1834
}

1835 1836
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
1837
	return is_inode_flag_set(inode, FI_DROP_CACHE);
1838 1839
}

1840 1841
static inline void *inline_data_addr(struct page *page)
{
1842
	struct f2fs_inode *ri = F2FS_INODE(page);
1843 1844 1845
	return (void *)&(ri->i_addr[1]);
}

1846 1847
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
1848
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
1849 1850
}

1851 1852 1853 1854 1855 1856
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1857 1858 1859 1860 1861 1862 1863 1864
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;
1865
	f2fs_mark_inode_dirty_sync(inode, true);
1866 1867 1868 1869 1870
}

static inline void clear_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 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889
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);
1890 1891
}

J
Jaegeuk Kim 已提交
1892 1893 1894 1895 1896
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1897 1898
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
1899
	return is_set_ckpt_flags(sbi, CP_ERROR_FLAG);
1900 1901
}

1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912
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 已提交
1913 1914 1915
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
1916
			is_inode_flag_set(inode, FI_NO_EXTENT))
J
Jaegeuk Kim 已提交
1917 1918
		return false;

A
Al Viro 已提交
1919
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
1920 1921
}

1922 1923
static inline void *f2fs_kmalloc(struct f2fs_sb_info *sbi,
					size_t size, gfp_t flags)
1924
{
J
Jaegeuk Kim 已提交
1925
#ifdef CONFIG_F2FS_FAULT_INJECTION
1926
	if (time_to_inject(sbi, FAULT_KMALLOC))
J
Jaegeuk Kim 已提交
1927 1928
		return NULL;
#endif
1929 1930 1931
	return kmalloc(size, flags);
}

1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951
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;
}

1952
#define get_inode_mode(i) \
1953
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
1954 1955
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1956
/* get offset of first page in next direct node */
1957 1958 1959 1960
#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))
1961

1962 1963 1964 1965 1966
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1967
int truncate_blocks(struct inode *, u64, bool);
1968
int f2fs_truncate(struct inode *);
1969
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1970 1971
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1972
int truncate_data_blocks_range(struct dnode_of_data *, int);
1973
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1974
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1975 1976 1977 1978 1979 1980

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1981
struct inode *f2fs_iget_retry(struct super_block *, unsigned long);
1982
int try_to_free_nats(struct f2fs_sb_info *, int);
1983 1984
int update_inode(struct inode *, struct page *);
int update_inode_page(struct inode *);
1985 1986
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1987
void handle_failed_inode(struct inode *);
1988 1989 1990 1991 1992 1993 1994 1995 1996

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

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

2032 2033
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
2034
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
2035
				inode, inode->i_ino, inode->i_mode);
2036 2037
}

2038 2039 2040
/*
 * super.c
 */
2041
int f2fs_inode_dirtied(struct inode *, bool);
2042
void f2fs_inode_synced(struct inode *);
C
Chao Yu 已提交
2043
int f2fs_commit_super(struct f2fs_sb_info *, bool);
2044
int f2fs_sync_fs(struct super_block *, int);
2045 2046
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
2047
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
2048 2049 2050 2051

/*
 * hash.c
 */
2052
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
2053 2054 2055 2056 2057 2058 2059

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

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

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

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

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

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
2208
block_t start_bidx_of_node(unsigned int, struct inode *);
J
Jaegeuk Kim 已提交
2209
int f2fs_gc(struct f2fs_sb_info *, bool, bool);
2210 2211 2212 2213 2214
void build_gc_manager(struct f2fs_sb_info *);

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

2257 2258
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2259
	return (struct f2fs_stat_info *)sbi->stat_info;
2260 2261
}

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

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

2324
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2325
	do {								\
2326
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2327 2328
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2329
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2330 2331
	} while (0)

2332
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2333
	do {								\
2334
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2335 2336
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2337
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2338 2339 2340 2341
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
2342
int __init f2fs_create_root_stats(void);
2343
void f2fs_destroy_root_stats(void);
2344
#else
2345
#define stat_inc_cp_count(si)
2346
#define stat_inc_bg_cp_count(si)
2347
#define stat_inc_call_count(si)
2348
#define stat_inc_bggc_count(si)
C
Chao Yu 已提交
2349 2350
#define stat_inc_dirty_inode(sbi, type)
#define stat_dec_dirty_inode(sbi, type)
2351
#define stat_inc_total_hit(sb)
2352
#define stat_inc_rbtree_node_hit(sb)
2353 2354
#define stat_inc_largest_node_hit(sbi)
#define stat_inc_cached_node_hit(sbi)
C
Chao Yu 已提交
2355 2356
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
2357 2358
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
2359 2360
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
2361 2362
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
2363
#define stat_inc_inplace_blocks(sbi)
2364
#define stat_inc_seg_count(sbi, type, gc_type)
2365
#define stat_inc_tot_blk_count(si, blks)
2366 2367
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
2368 2369 2370

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2371
static inline int __init f2fs_create_root_stats(void) { return 0; }
2372
static inline void f2fs_destroy_root_stats(void) { }
2373 2374 2375 2376 2377 2378 2379 2380 2381 2382
#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;
2383
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2384
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2385
extern struct kmem_cache *inode_entry_slab;
2386

2387 2388 2389
/*
 * inline.c
 */
2390 2391
bool f2fs_may_inline_data(struct inode *);
bool f2fs_may_inline_dentry(struct inode *);
2392
void read_inline_data(struct page *, struct page *);
2393
bool truncate_inline_inode(struct page *, u64);
2394
int f2fs_read_inline_data(struct inode *, struct page *);
2395 2396 2397
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 *);
2398
bool recover_inline_data(struct inode *, struct page *);
2399
struct f2fs_dir_entry *find_in_inline_dir(struct inode *,
2400
				struct fscrypt_name *, struct page **);
2401
int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
2402 2403
int f2fs_add_inline_entry(struct inode *, const struct qstr *,
		const struct qstr *, struct inode *, nid_t, umode_t);
2404 2405 2406
void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
						struct inode *, struct inode *);
bool f2fs_empty_inline_dir(struct inode *);
2407
int f2fs_read_inline_dir(struct file *, struct dir_context *,
2408
						struct fscrypt_str *);
J
Jaegeuk Kim 已提交
2409 2410
int f2fs_inline_data_fiemap(struct inode *,
		struct fiemap_extent_info *, __u64, __u64);
2411

2412 2413 2414 2415 2416 2417 2418 2419
/*
 * 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 *);

2420 2421 2422 2423
/*
 * extent_cache.c
 */
unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
2424
bool f2fs_init_extent_tree(struct inode *, struct f2fs_extent *);
2425
void f2fs_drop_extent_tree(struct inode *);
2426 2427 2428 2429
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 已提交
2430 2431
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
						pgoff_t, block_t, unsigned int);
2432 2433 2434 2435
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2436 2437 2438
/*
 * crypto support
 */
2439
static inline bool f2fs_encrypted_inode(struct inode *inode)
2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452
{
	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)
{
2453
	return bio->bi_private != NULL;
2454 2455 2456 2457 2458 2459
}

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

2461
static inline int f2fs_sb_mounted_blkzoned(struct super_block *sb)
2462
{
2463
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_BLKZONED);
2464 2465
}

2466 2467
#ifdef CONFIG_BLK_DEV_ZONED
static inline int get_blkz_type(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
2468
			struct block_device *bdev, block_t blkaddr)
2469 2470
{
	unsigned int zno = blkaddr >> sbi->log_blocks_per_blkz;
J
Jaegeuk Kim 已提交
2471
	int i;
2472

J
Jaegeuk Kim 已提交
2473 2474 2475 2476
	for (i = 0; i < sbi->s_ndevs; i++)
		if (FDEV(i).bdev == bdev)
			return FDEV(i).blkz_type[zno];
	return -EINVAL;
2477 2478 2479
}
#endif

2480
static inline bool f2fs_discard_en(struct f2fs_sb_info *sbi)
2481
{
2482 2483 2484
	struct request_queue *q = bdev_get_queue(sbi->sb->s_bdev);

	return blk_queue_discard(q) || f2fs_sb_mounted_blkzoned(sbi->sb);
2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501
}

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

2502 2503 2504
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2505
	umode_t mode = inode->i_mode;
2506 2507 2508 2509 2510 2511 2512

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

2513 2514 2515 2516 2517 2518 2519 2520 2521 2522
#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
2523 2524
#define fscrypt_ioctl_set_policy	fscrypt_notsupp_ioctl_set_policy
#define fscrypt_ioctl_get_policy	fscrypt_notsupp_ioctl_get_policy
2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535
#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
2536
#endif
2537
#endif