f2fs.h 72.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,
J
Jaegeuk Kim 已提交
49 50 51
	FAULT_MAX,
};

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

extern struct f2fs_fault_info f2fs_fault;
J
Jaegeuk Kim 已提交
59
extern char *fault_name[FAULT_MAX];
S
Sheng Yong 已提交
60
#define IS_FAULT_SET(type) (f2fs_fault.inject_type & (1 << (type)))
J
Jaegeuk Kim 已提交
61 62 63

static inline bool time_to_inject(int type)
{
S
Sheng Yong 已提交
64 65 66 67 68 69 70 71 72 73 74 75 76 77
	if (!f2fs_fault.inject_rate)
		return false;
	if (type == FAULT_KMALLOC && !IS_FAULT_SET(type))
		return false;
	else if (type == FAULT_PAGE_ALLOC && !IS_FAULT_SET(type))
		return false;
	else if (type == FAULT_ALLOC_NID && !IS_FAULT_SET(type))
		return false;
	else if (type == FAULT_ORPHAN && !IS_FAULT_SET(type))
		return false;
	else if (type == FAULT_BLOCK && !IS_FAULT_SET(type))
		return false;
	else if (type == FAULT_DIR_DEPTH && !IS_FAULT_SET(type))
		return false;
78 79
	else if (type == FAULT_EVICT_INODE && !IS_FAULT_SET(type))
		return false;
S
Sheng Yong 已提交
80 81 82 83

	atomic_inc(&f2fs_fault.inject_ops);
	if (atomic_read(&f2fs_fault.inject_ops) >= f2fs_fault.inject_rate) {
		atomic_set(&f2fs_fault.inject_ops, 0);
J
Jaegeuk Kim 已提交
84 85 86 87 88 89 90 91 92 93
		printk("%sF2FS-fs : inject %s in %pF\n",
				KERN_INFO,
				fault_name[type],
				__builtin_return_address(0));
		return true;
	}
	return false;
}
#endif

94 95 96 97 98 99 100 101 102 103
/*
 * 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 已提交
104
#define F2FS_MOUNT_INLINE_XATTR		0x00000080
105
#define F2FS_MOUNT_INLINE_DATA		0x00000100
106 107 108
#define F2FS_MOUNT_INLINE_DENTRY	0x00000200
#define F2FS_MOUNT_FLUSH_MERGE		0x00000400
#define F2FS_MOUNT_NOBARRIER		0x00000800
109
#define F2FS_MOUNT_FASTBOOT		0x00001000
110
#define F2FS_MOUNT_EXTENT_CACHE		0x00002000
111
#define F2FS_MOUNT_FORCE_FG_GC		0x00004000
112
#define F2FS_MOUNT_DATA_FLUSH		0x00008000
113
#define F2FS_MOUNT_FAULT_INJECTION	0x00010000
114 115
#define F2FS_MOUNT_ADAPTIVE		0x00020000
#define F2FS_MOUNT_LFS			0x00040000
116 117 118 119 120 121 122 123 124

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

125 126 127 128
typedef u32 block_t;	/*
			 * should not change u32, since it is the on-disk block
			 * address format, __le32.
			 */
129 130 131 132 133 134
typedef u32 nid_t;

struct f2fs_mount_info {
	unsigned int	opt;
};

135
#define F2FS_FEATURE_ENCRYPT	0x0001
136
#define F2FS_FEATURE_HMSMR	0x0002
137

138 139 140 141 142 143 144
#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)

145 146 147 148 149 150 151 152
/*
 * For checkpoint manager
 */
enum {
	NAT_BITMAP,
	SIT_BITMAP
};

153 154
enum {
	CP_UMOUNT,
155
	CP_FASTBOOT,
156
	CP_SYNC,
157
	CP_RECOVERY,
158
	CP_DISCARD,
159 160
};

J
Jaegeuk Kim 已提交
161 162 163
#define DEF_BATCHED_TRIM_SECTIONS	32
#define BATCHED_TRIM_SEGMENTS(sbi)	\
		(SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
164 165
#define BATCHED_TRIM_BLOCKS(sbi)	\
		(BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
166
#define DEF_CP_INTERVAL			60	/* 60 secs */
167
#define DEF_IDLE_INTERVAL		120	/* 2 mins */
J
Jaegeuk Kim 已提交
168

169 170
struct cp_control {
	int reason;
171 172 173 174
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
175 176
};

177
/*
178
 * For CP/NAT/SIT/SSA readahead
179 180 181 182
 */
enum {
	META_CP,
	META_NAT,
183
	META_SIT,
184 185
	META_SSA,
	META_POR,
186 187
};

J
Jaegeuk Kim 已提交
188 189 190
/* for the list of ino */
enum {
	ORPHAN_INO,		/* for orphan ino list */
191 192
	APPEND_INO,		/* for append ino list */
	UPDATE_INO,		/* for update ino list */
J
Jaegeuk Kim 已提交
193 194 195 196
	MAX_INO_ENTRY,		/* max. list */
};

struct ino_entry {
197 198 199 200
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

201
/* for the list of inodes to be GCed */
202
struct inode_entry {
203 204 205 206
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

207 208 209 210 211 212 213
/* 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 */
};

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

222 223
#define nats_in_cursum(jnl)		(le16_to_cpu(jnl->n_nats))
#define sits_in_cursum(jnl)		(le16_to_cpu(jnl->n_sits))
224

225 226 227 228
#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)
229

230 231
#define MAX_NAT_JENTRIES(jnl)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(jnl))
#define MAX_SIT_JENTRIES(jnl)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(jnl))
232

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

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

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

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

#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)
265
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
266 267
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
268
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
269
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
C
Chao Yu 已提交
270
#define F2FS_IOC_DEFRAGMENT		_IO(F2FS_IOCTL_MAGIC, 8)
271

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

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

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

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

300 301 302
/*
 * For INODE and NODE manager
 */
303 304
/* for directory operations */
struct f2fs_dentry_ptr {
305
	struct inode *inode;
306 307 308 309 310 311
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

312 313
static inline void make_dentry_ptr(struct inode *inode,
		struct f2fs_dentry_ptr *d, void *src, int type)
314
{
315 316
	d->inode = inode;

317 318 319 320 321 322 323 324 325 326 327 328 329 330 331
	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;
	}
}

332 333 334 335 336 337 338
/*
 * 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)
339 340 341 342 343
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 已提交
344
					 * by get_data_block.
345
					 */
346 347
};

348
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
349

350 351
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

352 353 354
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

355
/* for in-memory extent cache entry */
356 357 358 359
#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
360

361
struct extent_info {
362 363 364 365 366 367 368 369 370
	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 */
371
	struct extent_tree *et;		/* extent tree pointer */
372 373 374 375 376
};

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

J
Jaegeuk Kim 已提交
384 385 386 387 388 389 390
/*
 * 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)
391 392 393
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
394 395 396 397 398 399

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

C
Chao Yu 已提交
403 404 405 406 407
/* 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
408
#define F2FS_GET_BLOCK_PRE_DIO		4
409
#define F2FS_GET_BLOCK_PRE_AIO		5
C
Chao Yu 已提交
410

411 412 413 414
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
415
#define FADVISE_LOST_PINO_BIT	0x02
416
#define FADVISE_ENCRYPT_BIT	0x04
417
#define FADVISE_ENC_NAME_BIT	0x08
418

419 420 421 422 423 424
#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)
425 426 427
#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)
428 429
#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)
430

431 432
#define DEF_DIR_LEVEL		0

433 434 435 436
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 */
437
	unsigned char i_dir_level;	/* use for dentry level for large dir */
438
	unsigned int i_current_depth;	/* use only in directory structure */
439
	unsigned int i_pino;		/* parent inode number */
440 441 442 443
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
444
	struct rw_semaphore i_sem;	/* protect fi info */
445
	struct percpu_counter dirty_pages;	/* # of dirty pages */
446 447 448
	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 */
449
	unsigned long long xattr_ver;	/* cp version of xattr modification */
450
	loff_t	last_disk_size;		/* lastly written file size */
J
Jaegeuk Kim 已提交
451

452 453
	struct list_head dirty_list;	/* dirty list for dirs and files */
	struct list_head gdirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
454 455
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
J
Jaegeuk Kim 已提交
456
	struct extent_tree *extent_tree;	/* cached extent_tree entry */
457 458 459
};

static inline void get_extent_info(struct extent_info *ext,
C
Chao Yu 已提交
460
					struct f2fs_extent *i_ext)
461
{
C
Chao Yu 已提交
462 463 464
	ext->fofs = le32_to_cpu(i_ext->fofs);
	ext->blk = le32_to_cpu(i_ext->blk);
	ext->len = le32_to_cpu(i_ext->len);
465 466 467 468 469 470
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	i_ext->fofs = cpu_to_le32(ext->fofs);
471
	i_ext->blk = cpu_to_le32(ext->blk);
472 473 474
	i_ext->len = cpu_to_le32(ext->len);
}

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

483 484 485 486 487 488 489
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);
}

490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508
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);
}

509 510
static inline void __try_update_largest_extent(struct inode *inode,
			struct extent_tree *et, struct extent_node *en)
511
{
512
	if (en->ei.len > et->largest.len) {
513
		et->largest = en->ei;
514 515
		mark_inode_dirty_sync(inode);
	}
516 517
}

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

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

	/* free node ids management */
536
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
	struct list_head free_nid_list;	/* a list for free nids */
	spinlock_t free_nid_list_lock;	/* protect free nid list */
	unsigned int fcnt;		/* the number of free node id */
	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 */
559
	bool node_changed;		/* is node block changed */
560 561
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
562 563 564 565 566 567
	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)
{
568
	memset(dn, 0, sizeof(*dn));
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 598
	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 */
599 600
	NO_CHECK_TYPE,
	CURSEG_DIRECT_IO,	/* to use for the direct IO path */
601 602
};

603 604
struct flush_cmd {
	struct completion wait;
605
	struct llist_node llnode;
606 607 608
	int ret;
};

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

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

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
634 635 636 637 638

	/* for small discard management */
	struct list_head discard_list;		/* 4KB discard list */
	int nr_discards;			/* # of discards in the list */
	int max_discards;			/* max. discards to be issued */
639

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

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

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

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

652 653 654 655 656 657 658 659 660 661 662 663 664
};

/*
 * 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.
 */
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 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 701
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
	int rw;			/* contains R/RS/W/WS with REQ_META/REQ_PRIO */
702
	block_t new_blkaddr;	/* new block address to be written */
703
	block_t old_blkaddr;	/* old block address before Cow */
704
	struct page *page;	/* page to be written */
705
	struct page *encrypted_page;	/* encrypted page */
J
Jaegeuk Kim 已提交
706 707
};

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

717 718 719
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
720
	DIRTY_META,			/* for all dirtied inode metadata */
721 722 723
	NR_INODE_TYPE,
};

724 725 726 727 728 729 730 731
/* 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 */
};

732 733 734 735 736 737
/* 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 */
738
	SBI_NEED_SB_WRITE,			/* need to recover superblock */
739 740
};

741 742
enum {
	CP_TIME,
743
	REQ_TIME,
744 745 746
	MAX_TIME,
};

747 748 749 750
#ifdef CONFIG_F2FS_FS_ENCRYPTION
#define F2FS_KEY_DESC_PREFIX "f2fs:"
#define F2FS_KEY_DESC_PREFIX_SIZE 5
#endif
751 752
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
753
	struct proc_dir_entry *s_proc;		/* proc entry */
754
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
755
	int valid_super_block;			/* valid super block no */
756
	int s_flag;				/* flags for sbi */
757

758 759 760 761
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	u8 key_prefix[F2FS_KEY_DESC_PREFIX_SIZE];
	u8 key_prefix_size;
#endif
762 763 764 765 766 767
	/* 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 */
768 769

	/* for bio operations */
770
	struct f2fs_bio_info read_io;			/* for read bios */
771
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
772
	struct mutex wio_mutex[NODE + 1];	/* bio ordering for NODE/DATA */
773 774 775 776

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
	struct inode *meta_inode;		/* cache meta blocks */
777
	struct mutex cp_mutex;			/* checkpoint procedure lock */
778
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
779
	struct rw_semaphore node_write;		/* locking node writes */
780
	wait_queue_head_t cp_wait;
781 782
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
783

784
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
785 786

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

789 790 791
	/* 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 */
792

793 794 795 796 797
	/* 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 */
798
	atomic_t total_ext_tree;		/* extent tree count */
799
	struct list_head zombie_list;		/* extent zombie tree list */
800
	atomic_t total_zombie_tree;		/* extent zombie tree count */
801 802
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
803
	/* basic filesystem units */
804 805 806 807 808 809 810 811 812 813 814 815 816
	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 已提交
817
	loff_t max_file_blocks;			/* max block index of file */
818
	int active_logs;			/* # of active logs */
819
	int dir_level;				/* directory level */
820 821 822

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
823
	block_t discard_blks;			/* discard command candidats */
824 825
	block_t last_valid_block_count;		/* for recovery */
	u32 s_next_generation;			/* for NFS support */
826
	atomic_t nr_wb_bios;			/* # of writeback bios */
827 828 829

	/* # of pages, see count_type */
	struct percpu_counter nr_pages[NR_COUNT_TYPE];
830 831
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
832

833 834 835
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

836 837 838 839 840
	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 */
841
	unsigned int cur_victim_sec;		/* current victim section num */
842

843 844 845
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

846 847 848 849
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
850
#ifdef CONFIG_F2FS_STAT_FS
851 852 853
	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 */
854
	atomic_t inplace_count;		/* # of inplace update */
855 856 857 858
	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 已提交
859
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
860 861
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
862
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
863
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
864 865
#endif
	unsigned int last_victim[2];		/* last victim segment # */
866
	spinlock_t stat_lock;			/* lock for stat operations */
867 868 869 870

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
871 872 873 874 875

	/* For shrinker support */
	struct list_head s_list;
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
876 877 878 879

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
880 881 882

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
883 884
};

885 886 887 888 889 890 891
/* 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)

892 893 894 895 896 897 898 899 900 901 902 903 904
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);
}

905 906 907 908 909 910 911 912 913 914 915 916
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);
}

917 918 919
/*
 * Inline functions
 */
K
Keith Mok 已提交
920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942
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;
}

943 944 945 946 947 948 949 950 951 952
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;
}

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

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

978 979 980 981 982
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

983 984 985 986 987
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012
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 已提交
1013 1014 1015 1016 1017
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

1018 1019 1020 1021 1022
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1023 1024 1025 1026 1027 1028
static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
{
	return sbi->s_flag & (0x01 << type);
}

static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1029
{
1030
	sbi->s_flag |= (0x01 << type);
1031 1032
}

1033
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
1034
{
1035
	sbi->s_flag &= ~(0x01 << type);
1036 1037
}

1038 1039 1040 1041 1042
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062
static inline bool is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
	return ckpt_flags & f;
}

static inline void set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
	ckpt_flags |= f;
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

static inline void clear_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
{
	unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
	ckpt_flags &= (~f);
	cp->ckpt_flags = cpu_to_le32(ckpt_flags);
}

1063
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1064
{
1065
	down_read(&sbi->cp_rwsem);
1066 1067
}

1068
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1069
{
1070
	up_read(&sbi->cp_rwsem);
1071 1072
}

1073
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1074
{
1075
	down_write(&sbi->cp_rwsem);
1076 1077
}

1078
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1079
{
1080
	up_write(&sbi->cp_rwsem);
1081 1082
}

1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104
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)
{
	return (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_UMOUNT_FLAG) ||
			is_set_ckpt_flags(F2FS_CKPT(sbi), CP_FASTBOOT_FLAG));
}

1105 1106 1107
/*
 * Check whether the given nid is within node id range.
 */
1108
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1109
{
1110 1111
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1112
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1113 1114
		return -EINVAL;
	return 0;
1115 1116 1117 1118 1119 1120 1121 1122 1123 1124
}

#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 已提交
1125
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1126
	else
C
Chris Fries 已提交
1127
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1128 1129
}

1130 1131 1132 1133 1134
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1135
static inline void f2fs_i_blocks_write(struct inode *, blkcnt_t, bool);
1136
static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
1137
				 struct inode *inode, blkcnt_t *count)
1138 1139 1140 1141
{
	block_t	valid_block_count;

	spin_lock(&sbi->stat_lock);
J
Jaegeuk Kim 已提交
1142 1143 1144 1145 1146 1147
#ifdef CONFIG_F2FS_FAULT_INJECTION
	if (time_to_inject(FAULT_BLOCK)) {
		spin_unlock(&sbi->stat_lock);
		return false;
	}
#endif
1148
	valid_block_count =
1149
		sbi->total_valid_block_count + (block_t)(*count);
1150
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1151 1152 1153 1154 1155
		*count = sbi->user_block_count - sbi->total_valid_block_count;
		if (!*count) {
			spin_unlock(&sbi->stat_lock);
			return false;
		}
1156
	}
1157
	/* *count can be recalculated */
1158
	f2fs_i_blocks_write(inode, *count, true);
1159 1160
	sbi->total_valid_block_count =
		sbi->total_valid_block_count + (block_t)(*count);
1161
	spin_unlock(&sbi->stat_lock);
1162 1163

	percpu_counter_add(&sbi->alloc_valid_block_count, (*count));
1164 1165 1166
	return true;
}

1167
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1168 1169 1170 1171
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1172 1173
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1174
	f2fs_i_blocks_write(inode, count, false);
1175 1176 1177 1178 1179 1180
	sbi->total_valid_block_count -= (block_t)count;
	spin_unlock(&sbi->stat_lock);
}

static inline void inc_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1181
	percpu_counter_inc(&sbi->nr_pages[count_type]);
1182
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1183 1184
}

1185
static inline void inode_inc_dirty_pages(struct inode *inode)
1186
{
1187
	percpu_counter_inc(&F2FS_I(inode)->dirty_pages);
1188 1189
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1190 1191 1192 1193
}

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1194
	percpu_counter_dec(&sbi->nr_pages[count_type]);
1195 1196
}

1197
static inline void inode_dec_dirty_pages(struct inode *inode)
1198
{
1199 1200
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1201 1202
		return;

1203
	percpu_counter_dec(&F2FS_I(inode)->dirty_pages);
1204 1205
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1206 1207
}

1208
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1209
{
1210
	return percpu_counter_sum_positive(&sbi->nr_pages[count_type]);
1211 1212
}

1213
static inline s64 get_dirty_pages(struct inode *inode)
1214
{
1215
	return percpu_counter_sum_positive(&F2FS_I(inode)->dirty_pages);
1216 1217
}

1218 1219
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1220
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1221 1222 1223 1224
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1225 1226
}

1227 1228
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1229
	return sbi->total_valid_block_count;
1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244
}

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 已提交
1245 1246 1247 1248 1249
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1250 1251 1252
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1253 1254
	int offset;

W
Wanpeng Li 已提交
1255
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1256 1257 1258
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1259
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1260 1261
	} else {
		offset = (flag == NAT_BITMAP) ?
1262
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1263 1264
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1265 1266 1267 1268 1269 1270
}

static inline block_t __start_cp_addr(struct f2fs_sb_info *sbi)
{
	block_t start_addr;
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1271
	unsigned long long ckpt_version = cur_cp_version(ckpt);
1272

1273
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1274 1275 1276

	/*
	 * odd numbered checkpoint should at cp segment 0
A
arter97 已提交
1277
	 * and even segment must be at cp segment 1
1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290
	 */
	if (!(ckpt_version & 1))
		start_addr += sbi->blocks_per_seg;

	return start_addr;
}

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,
1291
						struct inode *inode)
1292 1293 1294 1295 1296 1297
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1298
	valid_block_count = sbi->total_valid_block_count + 1;
1299
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1300 1301 1302 1303
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1304
	valid_node_count = sbi->total_valid_node_count + 1;
1305
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1306 1307 1308 1309 1310
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1311
		f2fs_i_blocks_write(inode, 1, true);
1312 1313 1314

	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1315 1316
	spin_unlock(&sbi->stat_lock);

1317
	percpu_counter_inc(&sbi->alloc_valid_block_count);
1318 1319 1320 1321
	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1322
						struct inode *inode)
1323 1324 1325
{
	spin_lock(&sbi->stat_lock);

1326 1327 1328
	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);
1329

1330
	f2fs_i_blocks_write(inode, 1, false);
1331 1332
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1333 1334 1335 1336 1337 1338

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1339
	return sbi->total_valid_node_count;
1340 1341 1342 1343
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1344
	percpu_counter_inc(&sbi->total_valid_inode_count);
1345 1346
}

1347
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1348
{
1349
	percpu_counter_dec(&sbi->total_valid_inode_count);
1350 1351
}

1352
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1353
{
1354
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1355 1356
}

1357 1358 1359
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1360 1361 1362 1363 1364 1365 1366 1367
#ifdef CONFIG_F2FS_FAULT_INJECTION
	struct page *page = find_lock_page(mapping, index);
	if (page)
		return page;

	if (time_to_inject(FAULT_PAGE_ALLOC))
		return NULL;
#endif
1368 1369 1370 1371 1372
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1373 1374 1375 1376 1377 1378 1379 1380 1381 1382
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);
}

1383 1384
static inline void f2fs_put_page(struct page *page, int unlock)
{
1385
	if (!page)
1386 1387 1388
		return;

	if (unlock) {
1389
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1390 1391
		unlock_page(page);
	}
1392
	put_page(page);
1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405
}

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,
1406
					size_t size)
1407
{
1408
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1409 1410
}

1411 1412 1413 1414 1415
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1416 1417 1418
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1419 1420 1421
	return entry;
}

J
Jaegeuk Kim 已提交
1422 1423 1424 1425 1426 1427
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1428 1429
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1430 1431 1432
	return bio;
}

1433 1434 1435 1436 1437 1438 1439
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();
}

1440 1441 1442 1443
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1444
	struct f2fs_node *p = F2FS_NODE(page);
1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457
	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;
1458
	raw_node = F2FS_NODE(node_page);
1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471
	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;
}

1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489
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;
}

1490
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501
{
	int mask;
	int ret;

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

1502
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513
{
	int mask;
	int ret;

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

1514 1515 1516 1517 1518 1519 1520 1521 1522
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1523 1524 1525
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1526
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1527
	FI_AUTO_RECOVER,	/* indicate inode is recoverable */
1528
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1529 1530 1531
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1532
	FI_FREE_NID,		/* free allocated nide */
1533
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1534
	FI_INLINE_XATTR,	/* used for inline xattr */
1535
	FI_INLINE_DATA,		/* used for inline data*/
1536
	FI_INLINE_DENTRY,	/* used for inline dentry */
1537 1538
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1539 1540
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
1541
	FI_VOLATILE_FILE,	/* indicate volatile file */
1542
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1543
	FI_DROP_CACHE,		/* drop dirty page cache */
1544
	FI_DATA_EXIST,		/* indicate data exists */
1545
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1546
	FI_DO_DEFRAG,		/* indicate defragment is running */
1547
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1548 1549
};

1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564
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:
		mark_inode_dirty_sync(inode);
	}
}

1565
static inline void set_inode_flag(struct inode *inode, int flag)
1566
{
1567 1568
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1569
	__mark_inode_dirty_flag(inode, flag, true);
1570 1571
}

1572
static inline int is_inode_flag_set(struct inode *inode, int flag)
1573
{
1574
	return test_bit(flag, &F2FS_I(inode)->flags);
1575 1576
}

1577
static inline void clear_inode_flag(struct inode *inode, int flag)
1578
{
1579 1580
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1581
	__mark_inode_dirty_flag(inode, flag, false);
1582 1583
}

1584
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1585
{
1586 1587
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1588
	mark_inode_dirty_sync(inode);
1589 1590
}

1591 1592 1593 1594 1595 1596 1597 1598 1599
static inline void f2fs_i_links_write(struct inode *inode, bool inc)
{
	if (inc)
		inc_nlink(inode);
	else
		drop_nlink(inode);
	mark_inode_dirty_sync(inode);
}

1600 1601 1602
static inline void f2fs_i_blocks_write(struct inode *inode,
					blkcnt_t diff, bool add)
{
1603 1604 1605
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1606 1607 1608
	inode->i_blocks = add ? inode->i_blocks + diff :
				inode->i_blocks - diff;
	mark_inode_dirty_sync(inode);
1609 1610
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1611 1612
}

1613 1614
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1615 1616 1617
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1618 1619 1620 1621 1622
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
	mark_inode_dirty_sync(inode);
1623 1624 1625 1626 1627 1628 1629 1630 1631
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
}

static inline bool f2fs_skip_inode_update(struct inode *inode)
{
	if (!is_inode_flag_set(inode, FI_AUTO_RECOVER))
		return false;
	return F2FS_I(inode)->last_disk_size == i_size_read(inode);
1632 1633
}

1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651
static inline void f2fs_i_depth_write(struct inode *inode, unsigned int depth)
{
	F2FS_I(inode)->i_current_depth = depth;
	mark_inode_dirty_sync(inode);
}

static inline void f2fs_i_xnid_write(struct inode *inode, nid_t xnid)
{
	F2FS_I(inode)->i_xattr_nid = xnid;
	mark_inode_dirty_sync(inode);
}

static inline void f2fs_i_pino_write(struct inode *inode, nid_t pino)
{
	F2FS_I(inode)->i_pino = pino;
	mark_inode_dirty_sync(inode);
}

1652
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1653
{
1654 1655
	struct f2fs_inode_info *fi = F2FS_I(inode);

J
Jaegeuk Kim 已提交
1656
	if (ri->i_inline & F2FS_INLINE_XATTR)
1657
		set_bit(FI_INLINE_XATTR, &fi->flags);
1658
	if (ri->i_inline & F2FS_INLINE_DATA)
1659
		set_bit(FI_INLINE_DATA, &fi->flags);
1660
	if (ri->i_inline & F2FS_INLINE_DENTRY)
1661
		set_bit(FI_INLINE_DENTRY, &fi->flags);
1662
	if (ri->i_inline & F2FS_DATA_EXIST)
1663
		set_bit(FI_DATA_EXIST, &fi->flags);
1664
	if (ri->i_inline & F2FS_INLINE_DOTS)
1665
		set_bit(FI_INLINE_DOTS, &fi->flags);
J
Jaegeuk Kim 已提交
1666 1667
}

1668
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1669 1670 1671
{
	ri->i_inline = 0;

1672
	if (is_inode_flag_set(inode, FI_INLINE_XATTR))
J
Jaegeuk Kim 已提交
1673
		ri->i_inline |= F2FS_INLINE_XATTR;
1674
	if (is_inode_flag_set(inode, FI_INLINE_DATA))
1675
		ri->i_inline |= F2FS_INLINE_DATA;
1676
	if (is_inode_flag_set(inode, FI_INLINE_DENTRY))
1677
		ri->i_inline |= F2FS_INLINE_DENTRY;
1678
	if (is_inode_flag_set(inode, FI_DATA_EXIST))
1679
		ri->i_inline |= F2FS_DATA_EXIST;
1680
	if (is_inode_flag_set(inode, FI_INLINE_DOTS))
1681
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1682 1683
}

1684 1685
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
1686
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
1687 1688
}

1689
static inline unsigned int addrs_per_inode(struct inode *inode)
1690
{
1691
	if (f2fs_has_inline_xattr(inode))
1692 1693 1694 1695
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1696 1697
static inline void *inline_xattr_addr(struct page *page)
{
1698
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1699 1700 1701 1702 1703 1704
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1705
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1706 1707 1708 1709 1710
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1711 1712
static inline int f2fs_has_inline_data(struct inode *inode)
{
1713
	return is_inode_flag_set(inode, FI_INLINE_DATA);
1714 1715
}

1716 1717
static inline void f2fs_clear_inline_inode(struct inode *inode)
{
1718 1719
	clear_inode_flag(inode, FI_INLINE_DATA);
	clear_inode_flag(inode, FI_DATA_EXIST);
1720 1721 1722 1723
}

static inline int f2fs_exist_data(struct inode *inode)
{
1724
	return is_inode_flag_set(inode, FI_DATA_EXIST);
1725 1726
}

1727 1728
static inline int f2fs_has_inline_dots(struct inode *inode)
{
1729
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
1730 1731
}

J
Jaegeuk Kim 已提交
1732 1733
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
1734
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
1735 1736
}

1737 1738
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
1739
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
1740 1741
}

1742 1743
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
1744
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
1745 1746
}

1747 1748
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
1749
	return is_inode_flag_set(inode, FI_DROP_CACHE);
1750 1751
}

1752 1753
static inline void *inline_data_addr(struct page *page)
{
1754
	struct f2fs_inode *ri = F2FS_INODE(page);
1755 1756 1757
	return (void *)&(ri->i_addr[1]);
}

1758 1759
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
1760
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
1761 1762
}

1763 1764 1765 1766 1767 1768
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1769 1770 1771 1772 1773 1774 1775 1776
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;
1777
	mark_inode_dirty_sync(inode);
1778 1779 1780 1781 1782
}

static inline void clear_file(struct inode *inode, int type)
{
	F2FS_I(inode)->i_advise &= ~type;
1783
	mark_inode_dirty_sync(inode);
1784 1785
}

J
Jaegeuk Kim 已提交
1786 1787 1788 1789 1790
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1791 1792 1793 1794 1795
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806
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 已提交
1807 1808 1809
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
1810
			is_inode_flag_set(inode, FI_NO_EXTENT))
J
Jaegeuk Kim 已提交
1811 1812
		return false;

A
Al Viro 已提交
1813
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
1814 1815
}

1816 1817
static inline void *f2fs_kmalloc(size_t size, gfp_t flags)
{
J
Jaegeuk Kim 已提交
1818 1819 1820 1821
#ifdef CONFIG_F2FS_FAULT_INJECTION
	if (time_to_inject(FAULT_KMALLOC))
		return NULL;
#endif
1822 1823 1824
	return kmalloc(size, flags);
}

1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844
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;
}

1845
#define get_inode_mode(i) \
1846
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
1847 1848
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1849
/* get offset of first page in next direct node */
1850 1851 1852 1853
#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))
1854

1855 1856 1857 1858 1859
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1860
int truncate_blocks(struct inode *, u64, bool);
1861
int f2fs_truncate(struct inode *);
1862
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1863 1864
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1865
int truncate_data_blocks_range(struct dnode_of_data *, int);
1866
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1867
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1868 1869 1870 1871 1872 1873

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1874
int try_to_free_nats(struct f2fs_sb_info *, int);
1875 1876
int update_inode(struct inode *, struct page *);
int update_inode_page(struct inode *);
1877 1878
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1879
void handle_failed_inode(struct inode *);
1880 1881 1882 1883 1884 1885 1886 1887 1888

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

/*
 * dir.c
 */
1889
extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
1890
void set_de_type(struct f2fs_dir_entry *, umode_t);
1891
unsigned char get_de_type(struct f2fs_dir_entry *);
1892
struct f2fs_dir_entry *find_target_dentry(struct fscrypt_name *,
1893
			f2fs_hash_t, int *, struct f2fs_dentry_ptr *);
1894
bool f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
1895
			unsigned int, struct fscrypt_str *);
1896 1897
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
1898
struct page *init_inode_metadata(struct inode *, struct inode *,
1899
			const struct qstr *, struct page *);
1900
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
1901
int room_for_filename(const void *, int, int);
J
Jaegeuk Kim 已提交
1902
void f2fs_drop_nlink(struct inode *, struct inode *);
1903 1904 1905 1906 1907 1908
struct f2fs_dir_entry *f2fs_find_entry(struct inode *, struct qstr *,
							struct page **);
struct f2fs_dir_entry *f2fs_parent_dir(struct inode *, struct page **);
ino_t f2fs_inode_by_name(struct inode *, struct qstr *);
void f2fs_set_link(struct inode *, struct f2fs_dir_entry *,
				struct page *, struct inode *);
1909
int update_dent_inode(struct inode *, struct inode *, const struct qstr *);
1910
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
1911
			const struct qstr *, f2fs_hash_t , unsigned int);
1912 1913
int f2fs_add_regular_entry(struct inode *, const struct qstr *,
						struct inode *, nid_t, umode_t);
1914 1915
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
1916 1917
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
1918
int f2fs_do_tmpfile(struct inode *, struct inode *);
1919 1920
bool f2fs_empty_dir(struct inode *);

1921 1922
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
1923
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
1924
				inode, inode->i_ino, inode->i_mode);
1925 1926
}

1927 1928 1929
/*
 * super.c
 */
1930
void f2fs_inode_synced(struct inode *);
C
Chao Yu 已提交
1931
int f2fs_commit_super(struct f2fs_sb_info *, bool);
1932
int f2fs_sync_fs(struct super_block *, int);
1933 1934
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
1935
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
1936 1937 1938 1939

/*
 * hash.c
 */
1940
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1941 1942 1943 1944 1945 1946 1947

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

1948
bool available_free_memory(struct f2fs_sb_info *, int);
J
Jaegeuk Kim 已提交
1949
int need_dentry_mark(struct f2fs_sb_info *, nid_t);
1950 1951
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
1952
void get_node_info(struct f2fs_sb_info *, nid_t, struct node_info *);
1953
pgoff_t get_next_page_offset(struct dnode_of_data *, pgoff_t);
1954 1955
int get_dnode_of_data(struct dnode_of_data *, pgoff_t, int);
int truncate_inode_blocks(struct inode *, pgoff_t);
1956
int truncate_xattr_node(struct inode *, struct page *);
1957
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
C
Chao Yu 已提交
1958
int remove_inode_page(struct inode *);
1959
struct page *new_inode_page(struct inode *);
1960
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
1961 1962 1963
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);
1964
void move_node_page(struct page *, int);
1965 1966
int fsync_node_pages(struct f2fs_sb_info *, struct inode *,
			struct writeback_control *, bool);
1967
int sync_node_pages(struct f2fs_sb_info *, struct writeback_control *);
1968 1969 1970
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 已提交
1971
int try_to_free_nids(struct f2fs_sb_info *, int);
1972
void recover_inline_xattr(struct inode *, struct page *);
1973
void recover_xattr_data(struct inode *, struct page *, block_t);
1974 1975 1976 1977 1978 1979
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 *);
1980
int __init create_node_manager_caches(void);
1981 1982 1983 1984 1985
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
1986
void register_inmem_page(struct inode *, struct page *);
1987 1988
void drop_inmem_pages(struct inode *);
int commit_inmem_pages(struct inode *);
J
Jaegeuk Kim 已提交
1989
void f2fs_balance_fs(struct f2fs_sb_info *, bool);
1990
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
1991
int f2fs_issue_flush(struct f2fs_sb_info *);
1992 1993
int create_flush_cmd_control(struct f2fs_sb_info *);
void destroy_flush_cmd_control(struct f2fs_sb_info *);
1994
void invalidate_blocks(struct f2fs_sb_info *, block_t);
1995
bool is_checkpointed_data(struct f2fs_sb_info *, block_t);
1996
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
1997
void clear_prefree_segments(struct f2fs_sb_info *, struct cp_control *);
1998
void release_discard_addrs(struct f2fs_sb_info *);
C
Chao Yu 已提交
1999
bool discard_next_dnode(struct f2fs_sb_info *, block_t);
2000
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
2001
void allocate_new_segments(struct f2fs_sb_info *);
2002
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
2003
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
C
Chao Yu 已提交
2004
void update_meta_page(struct f2fs_sb_info *, void *, block_t);
2005
void write_meta_page(struct f2fs_sb_info *, struct page *);
2006 2007 2008
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 *);
2009 2010
void __f2fs_replace_block(struct f2fs_sb_info *, struct f2fs_summary *,
					block_t, block_t, bool, bool);
2011
void f2fs_replace_block(struct f2fs_sb_info *, struct dnode_of_data *,
2012
				block_t, block_t, unsigned char, bool, bool);
2013 2014
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
2015
void f2fs_wait_on_page_writeback(struct page *, enum page_type, bool);
2016
void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *, block_t);
2017 2018
void write_data_summaries(struct f2fs_sb_info *, block_t);
void write_node_summaries(struct f2fs_sb_info *, block_t);
2019
int lookup_journal_in_cursum(struct f2fs_journal *, int, unsigned int, int);
2020
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
2021 2022
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
2023 2024
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
2025 2026 2027 2028

/*
 * checkpoint.c
 */
2029
void f2fs_stop_checkpoint(struct f2fs_sb_info *, bool);
2030 2031
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
2032
struct page *get_tmp_page(struct f2fs_sb_info *, pgoff_t);
2033
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
2034
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int, bool);
2035
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
2036
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
2037 2038
void add_ino_entry(struct f2fs_sb_info *, nid_t, int type);
void remove_ino_entry(struct f2fs_sb_info *, nid_t, int type);
2039
void release_ino_entry(struct f2fs_sb_info *, bool);
2040
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
2041
int f2fs_sync_inode_meta(struct f2fs_sb_info *);
J
Jaegeuk Kim 已提交
2042 2043
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
2044
void add_orphan_inode(struct inode *);
2045
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
2046
int recover_orphan_inodes(struct f2fs_sb_info *);
2047
int get_valid_checkpoint(struct f2fs_sb_info *);
2048
void update_dirty_page(struct inode *, struct page *);
2049
void remove_dirty_inode(struct inode *);
C
Chao Yu 已提交
2050
int sync_dirty_inodes(struct f2fs_sb_info *, enum inode_type);
C
Chao Yu 已提交
2051
int write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
2052
void init_ino_entry_info(struct f2fs_sb_info *);
2053
int __init create_checkpoint_caches(void);
2054 2055 2056 2057 2058
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
2059
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
2060 2061
void f2fs_submit_merged_bio_cond(struct f2fs_sb_info *, struct inode *,
				struct page *, nid_t, enum page_type, int);
2062
void f2fs_flush_merged_bios(struct f2fs_sb_info *);
2063 2064
int f2fs_submit_page_bio(struct f2fs_io_info *);
void f2fs_submit_page_mbio(struct f2fs_io_info *);
2065
void set_data_blkaddr(struct dnode_of_data *);
2066
void f2fs_update_data_blkaddr(struct dnode_of_data *, block_t);
2067
int reserve_new_blocks(struct dnode_of_data *, blkcnt_t);
2068
int reserve_new_block(struct dnode_of_data *);
2069
int f2fs_get_block(struct dnode_of_data *, pgoff_t);
2070
ssize_t f2fs_preallocate_blocks(struct kiocb *, struct iov_iter *);
2071
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
2072
struct page *get_read_data_page(struct inode *, pgoff_t, int, bool);
2073
struct page *find_data_page(struct inode *, pgoff_t);
2074
struct page *get_lock_data_page(struct inode *, pgoff_t, bool);
2075
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
2076
int do_write_data_page(struct f2fs_io_info *);
C
Chao Yu 已提交
2077
int f2fs_map_blocks(struct inode *, struct f2fs_map_blocks *, int, int);
J
Jaegeuk Kim 已提交
2078
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
2079 2080
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
2081 2082 2083 2084 2085 2086

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
2087
block_t start_bidx_of_node(unsigned int, struct inode *);
C
Chao Yu 已提交
2088
int f2fs_gc(struct f2fs_sb_info *, bool);
2089 2090 2091 2092 2093
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
2094
int recover_fsync_data(struct f2fs_sb_info *, bool);
2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105
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;
2106 2107
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
2108
	int ext_tree, zombie_tree, ext_node;
2109
	s64 ndirty_node, ndirty_dent, ndirty_meta, ndirty_data, inmem_pages;
2110
	unsigned int ndirty_dirs, ndirty_files, ndirty_all;
2111
	int nats, dirty_nats, sits, dirty_sits, fnids;
2112
	int total_count, utilization;
2113
	int bg_gc, wb_bios;
J
Jaegeuk Kim 已提交
2114
	int inline_xattr, inline_inode, inline_dir, orphans;
2115 2116 2117 2118 2119
	unsigned int valid_count, valid_node_count, valid_inode_count;
	unsigned int bimodal, avg_vblocks;
	int util_free, util_valid, util_invalid;
	int rsvd_segs, overp_segs;
	int dirty_count, node_pages, meta_pages;
2120
	int prefree_count, call_count, cp_count, bg_cp_count;
2121
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
2122
	int bg_node_segs, bg_data_segs;
2123
	int tot_blks, data_blks, node_blks;
2124
	int bg_data_blks, bg_node_blks;
2125 2126 2127 2128 2129 2130
	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];
2131
	unsigned int inplace_count;
C
Chao Yu 已提交
2132
	unsigned long long base_mem, cache_mem, page_mem;
2133 2134
};

2135 2136
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2137
	return (struct f2fs_stat_info *)sbi->stat_info;
2138 2139
}

2140
#define stat_inc_cp_count(si)		((si)->cp_count++)
2141
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
2142 2143
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
2144 2145
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
2146 2147 2148 2149
#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 已提交
2150 2151 2152 2153 2154 2155 2156 2157 2158 2159
#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)
2160 2161 2162
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2163
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
2164 2165 2166 2167
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
2168
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
2169
	} while (0)
2170 2171 2172
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2173
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
2174 2175 2176 2177
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
2178
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
2179
	} while (0)
2180 2181 2182 2183
#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]++)
2184 2185
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2186
#define stat_inc_seg_count(sbi, type, gc_type)				\
2187
	do {								\
2188
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2189
		(si)->tot_segs++;					\
2190
		if (type == SUM_TYPE_DATA) {				\
2191
			si->data_segs++;				\
2192 2193
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2194
			si->node_segs++;				\
2195 2196
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2197 2198 2199 2200 2201
	} while (0)

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

2202
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2203
	do {								\
2204
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2205 2206
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2207
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2208 2209
	} while (0)

2210
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2211
	do {								\
2212
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2213 2214
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2215
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2216 2217 2218 2219
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
2220
int __init f2fs_create_root_stats(void);
2221
void f2fs_destroy_root_stats(void);
2222
#else
2223
#define stat_inc_cp_count(si)
2224
#define stat_inc_bg_cp_count(si)
2225
#define stat_inc_call_count(si)
2226
#define stat_inc_bggc_count(si)
C
Chao Yu 已提交
2227 2228
#define stat_inc_dirty_inode(sbi, type)
#define stat_dec_dirty_inode(sbi, type)
2229
#define stat_inc_total_hit(sb)
2230
#define stat_inc_rbtree_node_hit(sb)
2231 2232
#define stat_inc_largest_node_hit(sbi)
#define stat_inc_cached_node_hit(sbi)
C
Chao Yu 已提交
2233 2234
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
2235 2236
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
2237 2238
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
2239 2240
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
2241
#define stat_inc_inplace_blocks(sbi)
2242
#define stat_inc_seg_count(sbi, type, gc_type)
2243
#define stat_inc_tot_blk_count(si, blks)
2244 2245
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
2246 2247 2248

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2249
static inline int __init f2fs_create_root_stats(void) { return 0; }
2250
static inline void f2fs_destroy_root_stats(void) { }
2251 2252 2253 2254 2255 2256 2257 2258 2259 2260
#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;
2261
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2262
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2263
extern struct kmem_cache *inode_entry_slab;
2264

2265 2266 2267
/*
 * inline.c
 */
2268 2269
bool f2fs_may_inline_data(struct inode *);
bool f2fs_may_inline_dentry(struct inode *);
2270
void read_inline_data(struct page *, struct page *);
2271
bool truncate_inline_inode(struct page *, u64);
2272
int f2fs_read_inline_data(struct inode *, struct page *);
2273 2274 2275
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 *);
2276
bool recover_inline_data(struct inode *, struct page *);
2277
struct f2fs_dir_entry *find_in_inline_dir(struct inode *,
2278
				struct fscrypt_name *, struct page **);
2279
int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
2280 2281
int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *,
						nid_t, umode_t);
2282 2283 2284
void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
						struct inode *, struct inode *);
bool f2fs_empty_inline_dir(struct inode *);
2285
int f2fs_read_inline_dir(struct file *, struct dir_context *,
2286
						struct fscrypt_str *);
J
Jaegeuk Kim 已提交
2287 2288
int f2fs_inline_data_fiemap(struct inode *,
		struct fiemap_extent_info *, __u64, __u64);
2289

2290 2291 2292 2293 2294 2295 2296 2297
/*
 * 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 *);

2298 2299 2300 2301
/*
 * extent_cache.c
 */
unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
2302
bool f2fs_init_extent_tree(struct inode *, struct f2fs_extent *);
2303 2304 2305 2306
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 已提交
2307 2308
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
						pgoff_t, block_t, unsigned int);
2309 2310 2311 2312
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2313 2314 2315
/*
 * crypto support
 */
2316
static inline bool f2fs_encrypted_inode(struct inode *inode)
2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329
{
	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)
{
2330
	return bio->bi_private != NULL;
2331 2332 2333 2334 2335 2336
}

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

2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357
static inline int f2fs_sb_mounted_hmsmr(struct super_block *sb)
{
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_HMSMR);
}

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

2358 2359 2360
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2361
	umode_t mode = inode->i_mode;
2362 2363 2364 2365 2366 2367 2368

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

2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391
#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
#define fscrypt_process_policy		fscrypt_notsupp_process_policy
#define fscrypt_get_policy		fscrypt_notsupp_get_policy
#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
2392
#endif
2393
#endif