f2fs.h 72.1 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 116 117 118 119 120 121 122

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

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

struct f2fs_mount_info {
	unsigned int	opt;
};

133 134
#define F2FS_FEATURE_ENCRYPT	0x0001

135 136 137 138 139 140 141
#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)

142 143 144 145 146 147 148 149
/*
 * For checkpoint manager
 */
enum {
	NAT_BITMAP,
	SIT_BITMAP
};

150 151
enum {
	CP_UMOUNT,
152
	CP_FASTBOOT,
153
	CP_SYNC,
154
	CP_RECOVERY,
155
	CP_DISCARD,
156 157
};

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

166 167
struct cp_control {
	int reason;
168 169 170 171
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
172 173
};

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

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

struct ino_entry {
194 195 196 197
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

198
/* for the list of inodes to be GCed */
199
struct inode_entry {
200 201 202 203
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

204 205 206 207 208 209 210
/* 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 */
};

211 212 213 214
/* for the list of fsync inodes, used only during recovery */
struct fsync_inode_entry {
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
215 216
	block_t blkaddr;	/* block address locating the last fsync */
	block_t last_dentry;	/* block address locating the last dentry */
217 218
};

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

222 223 224 225
#define nat_in_journal(jnl, i)		(jnl->nat_j.entries[i].ne)
#define nid_in_journal(jnl, i)		(jnl->nat_j.entries[i].nid)
#define sit_in_journal(jnl, i)		(jnl->sit_j.entries[i].se)
#define segno_in_journal(jnl, i)	(jnl->sit_j.entries[i].segno)
226

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

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

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

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

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

#define F2FS_IOCTL_MAGIC		0xf5
#define F2FS_IOC_START_ATOMIC_WRITE	_IO(F2FS_IOCTL_MAGIC, 1)
#define F2FS_IOC_COMMIT_ATOMIC_WRITE	_IO(F2FS_IOCTL_MAGIC, 2)
262
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
263 264
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
265
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
266
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
C
Chao Yu 已提交
267
#define F2FS_IOC_DEFRAGMENT		_IO(F2FS_IOCTL_MAGIC, 8)
268

269 270 271
#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
272

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

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

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

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

309 310
static inline void make_dentry_ptr(struct inode *inode,
		struct f2fs_dentry_ptr *d, void *src, int type)
311
{
312 313
	d->inode = inode;

314 315 316 317 318 319 320 321 322 323 324 325 326 327 328
	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;
	}
}

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

345
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
346

347 348
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

349 350 351
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

352
/* for in-memory extent cache entry */
353 354 355 356
#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
357

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

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

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

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

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

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

416 417 418 419 420 421
#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)
422 423 424
#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)
425 426
#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)
427

428 429
#define DEF_DIR_LEVEL		0

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

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

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

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

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

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

480 481 482 483 484 485 486
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);
}

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

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

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;		/* maximum 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 */
534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555
	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 */
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 597
	NO_CHECK_TYPE,
	CURSEG_DIRECT_IO,	/* to use for the direct IO path */
598 599
};

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

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

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

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

	/* 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 */
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 660 661
};

/*
 * For superblock
 */
/*
 * COUNT_TYPE for monitoring
 *
 * f2fs monitors the number of several block types such as on-writeback,
 * dirty dentry blocks, dirty node blocks, and dirty meta blocks.
 */
enum count_type {
	F2FS_DIRTY_DENTS,
662
	F2FS_DIRTY_DATA,
663 664
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
665
	F2FS_INMEM_PAGES,
666
	F2FS_DIRTY_IMETA,
667 668 669 670
	NR_COUNT_TYPE,
};

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

J
Jaegeuk Kim 已提交
695
struct f2fs_io_info {
696
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
697 698
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
	int rw;			/* contains R/RS/W/WS with REQ_META/REQ_PRIO */
699
	block_t new_blkaddr;	/* new block address to be written */
700
	block_t old_blkaddr;	/* old block address before Cow */
701
	struct page *page;	/* page to be written */
702
	struct page *encrypted_page;	/* encrypted page */
J
Jaegeuk Kim 已提交
703 704
};

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

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

721 722 723 724 725 726 727 728
/* 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 */
};

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

738 739
enum {
	CP_TIME,
740
	REQ_TIME,
741 742 743
	MAX_TIME,
};

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

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

	/* for bio operations */
767
	struct f2fs_bio_info read_io;			/* for read bios */
768
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
769 770 771 772

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

780
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
781 782

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

785 786 787
	/* 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 */
788

789 790 791 792 793
	/* 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 */
794
	atomic_t total_ext_tree;		/* extent tree count */
795
	struct list_head zombie_list;		/* extent zombie tree list */
796
	atomic_t total_zombie_tree;		/* extent zombie tree count */
797 798
	atomic_t total_ext_node;		/* extent info count */

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

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
819
	block_t discard_blks;			/* discard command candidats */
820 821
	block_t last_valid_block_count;		/* for recovery */
	u32 s_next_generation;			/* for NFS support */
822
	atomic_t nr_wb_bios;			/* # of writeback bios */
823 824 825

	/* # of pages, see count_type */
	struct percpu_counter nr_pages[NR_COUNT_TYPE];
826 827
	/* # of allocated blocks */
	struct percpu_counter alloc_valid_block_count;
828

829 830 831
	/* valid inode count */
	struct percpu_counter total_valid_inode_count;

832 833 834 835 836
	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 */
837
	unsigned int cur_victim_sec;		/* current victim section num */
838

839 840 841
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

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

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
867 868 869 870 871

	/* For shrinker support */
	struct list_head s_list;
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
872 873 874 875

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
876 877 878

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
879 880
};

881 882 883 884 885 886 887
/* 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)

888 889 890 891 892 893 894 895 896 897 898 899 900
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);
}

901 902 903 904 905 906 907 908 909 910 911 912
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);
}

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

939 940 941 942 943 944 945 946 947 948
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;
}

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

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

974 975 976 977 978
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

979 980 981 982 983
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

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

1014 1015 1016 1017 1018
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

1019 1020 1021 1022 1023 1024
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)
1025
{
1026
	sbi->s_flag |= (0x01 << type);
1027 1028
}

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

1034 1035 1036 1037 1038
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058
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);
}

1059
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
1060
{
1061
	down_read(&sbi->cp_rwsem);
1062 1063
}

1064
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1065
{
1066
	up_read(&sbi->cp_rwsem);
1067 1068
}

1069
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1070
{
1071
	down_write(&sbi->cp_rwsem);
1072 1073
}

1074
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1075
{
1076
	up_write(&sbi->cp_rwsem);
1077 1078
}

1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100
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));
}

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

#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 已提交
1121
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1122
	else
C
Chris Fries 已提交
1123
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1124 1125
}

1126 1127 1128 1129 1130
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1131
static inline void f2fs_i_blocks_write(struct inode *, blkcnt_t, bool);
1132
static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
1133
				 struct inode *inode, blkcnt_t *count)
1134 1135 1136 1137
{
	block_t	valid_block_count;

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

	percpu_counter_add(&sbi->alloc_valid_block_count, (*count));
1160 1161 1162
	return true;
}

1163
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1164 1165 1166 1167
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1168 1169
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1170
	f2fs_i_blocks_write(inode, count, false);
1171 1172 1173 1174 1175 1176
	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)
{
1177
	percpu_counter_inc(&sbi->nr_pages[count_type]);
1178
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1179 1180
}

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

static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
{
1190
	percpu_counter_dec(&sbi->nr_pages[count_type]);
1191 1192
}

1193
static inline void inode_dec_dirty_pages(struct inode *inode)
1194
{
1195 1196
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1197 1198
		return;

1199
	percpu_counter_dec(&F2FS_I(inode)->dirty_pages);
1200 1201
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1202 1203
}

1204
static inline s64 get_pages(struct f2fs_sb_info *sbi, int count_type)
1205
{
1206
	return percpu_counter_sum_positive(&sbi->nr_pages[count_type]);
1207 1208
}

1209
static inline s64 get_dirty_pages(struct inode *inode)
1210
{
1211
	return percpu_counter_sum_positive(&F2FS_I(inode)->dirty_pages);
1212 1213
}

1214 1215
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1216
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1217 1218 1219 1220
	unsigned int segs = (get_pages(sbi, block_type) + pages_per_sec - 1) >>
						sbi->log_blocks_per_seg;

	return segs / sbi->segs_per_sec;
1221 1222
}

1223 1224
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1225
	return sbi->total_valid_block_count;
1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240
}

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 已提交
1241 1242 1243 1244 1245
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1246 1247 1248
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1249 1250
	int offset;

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

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

1269
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1270 1271 1272

	/*
	 * odd numbered checkpoint should at cp segment 0
A
arter97 已提交
1273
	 * and even segment must be at cp segment 1
1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286
	 */
	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,
1287
						struct inode *inode)
1288 1289 1290 1291 1292 1293
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1294
	valid_block_count = sbi->total_valid_block_count + 1;
1295
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1296 1297 1298 1299
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1300
	valid_node_count = sbi->total_valid_node_count + 1;
1301
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1302 1303 1304 1305 1306
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1307
		f2fs_i_blocks_write(inode, 1, true);
1308 1309 1310

	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1311 1312
	spin_unlock(&sbi->stat_lock);

1313
	percpu_counter_inc(&sbi->alloc_valid_block_count);
1314 1315 1316 1317
	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1318
						struct inode *inode)
1319 1320 1321
{
	spin_lock(&sbi->stat_lock);

1322 1323 1324
	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);
1325

1326
	f2fs_i_blocks_write(inode, 1, false);
1327 1328
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1329 1330 1331 1332 1333 1334

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1335
	return sbi->total_valid_node_count;
1336 1337 1338 1339
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
1340
	percpu_counter_inc(&sbi->total_valid_inode_count);
1341 1342
}

1343
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1344
{
1345
	percpu_counter_dec(&sbi->total_valid_inode_count);
1346 1347
}

1348
static inline s64 valid_inode_count(struct f2fs_sb_info *sbi)
1349
{
1350
	return percpu_counter_sum_positive(&sbi->total_valid_inode_count);
1351 1352
}

1353 1354 1355
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
1356 1357 1358 1359 1360 1361 1362 1363
#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
1364 1365 1366 1367 1368
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1369 1370 1371 1372 1373 1374 1375 1376 1377 1378
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);
}

1379 1380
static inline void f2fs_put_page(struct page *page, int unlock)
{
1381
	if (!page)
1382 1383 1384
		return;

	if (unlock) {
1385
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1386 1387
		unlock_page(page);
	}
1388
	put_page(page);
1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401
}

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,
1402
					size_t size)
1403
{
1404
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1405 1406
}

1407 1408 1409 1410 1411
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1412 1413 1414
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1415 1416 1417
	return entry;
}

J
Jaegeuk Kim 已提交
1418 1419 1420 1421 1422 1423
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1424 1425
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1426 1427 1428
	return bio;
}

1429 1430 1431 1432 1433 1434 1435
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();
}

1436 1437 1438 1439
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

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

1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485
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;
}

1486
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497
{
	int mask;
	int ret;

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

1498
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509
{
	int mask;
	int ret;

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

1510 1511 1512 1513 1514 1515 1516 1517 1518
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

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

1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560
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);
	}
}

1561
static inline void set_inode_flag(struct inode *inode, int flag)
1562
{
1563 1564
	if (!test_bit(flag, &F2FS_I(inode)->flags))
		set_bit(flag, &F2FS_I(inode)->flags);
1565
	__mark_inode_dirty_flag(inode, flag, true);
1566 1567
}

1568
static inline int is_inode_flag_set(struct inode *inode, int flag)
1569
{
1570
	return test_bit(flag, &F2FS_I(inode)->flags);
1571 1572
}

1573
static inline void clear_inode_flag(struct inode *inode, int flag)
1574
{
1575 1576
	if (test_bit(flag, &F2FS_I(inode)->flags))
		clear_bit(flag, &F2FS_I(inode)->flags);
1577
	__mark_inode_dirty_flag(inode, flag, false);
1578 1579
}

1580
static inline void set_acl_inode(struct inode *inode, umode_t mode)
1581
{
1582 1583
	F2FS_I(inode)->i_acl_mode = mode;
	set_inode_flag(inode, FI_ACL_MODE);
1584
	mark_inode_dirty_sync(inode);
1585 1586
}

1587 1588 1589 1590 1591 1592 1593 1594 1595
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);
}

1596 1597 1598
static inline void f2fs_i_blocks_write(struct inode *inode,
					blkcnt_t diff, bool add)
{
1599 1600 1601
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1602 1603 1604
	inode->i_blocks = add ? inode->i_blocks + diff :
				inode->i_blocks - diff;
	mark_inode_dirty_sync(inode);
1605 1606
	if (clean || recover)
		set_inode_flag(inode, FI_AUTO_RECOVER);
1607 1608
}

1609 1610
static inline void f2fs_i_size_write(struct inode *inode, loff_t i_size)
{
1611 1612 1613
	bool clean = !is_inode_flag_set(inode, FI_DIRTY_INODE);
	bool recover = is_inode_flag_set(inode, FI_AUTO_RECOVER);

1614 1615 1616 1617 1618
	if (i_size_read(inode) == i_size)
		return;

	i_size_write(inode, i_size);
	mark_inode_dirty_sync(inode);
1619 1620 1621 1622 1623 1624 1625 1626 1627
	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);
1628 1629
}

1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647
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);
}

1648
static inline void get_inline_info(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1649
{
1650 1651
	struct f2fs_inode_info *fi = F2FS_I(inode);

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

1664
static inline void set_raw_inline(struct inode *inode, struct f2fs_inode *ri)
J
Jaegeuk Kim 已提交
1665 1666 1667
{
	ri->i_inline = 0;

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

1680 1681
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
1682
	return is_inode_flag_set(inode, FI_INLINE_XATTR);
1683 1684
}

1685
static inline unsigned int addrs_per_inode(struct inode *inode)
1686
{
1687
	if (f2fs_has_inline_xattr(inode))
1688 1689 1690 1691
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

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

static inline int inline_xattr_size(struct inode *inode)
{
1701
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1702 1703 1704 1705 1706
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1707 1708
static inline int f2fs_has_inline_data(struct inode *inode)
{
1709
	return is_inode_flag_set(inode, FI_INLINE_DATA);
1710 1711
}

1712 1713
static inline void f2fs_clear_inline_inode(struct inode *inode)
{
1714 1715
	clear_inode_flag(inode, FI_INLINE_DATA);
	clear_inode_flag(inode, FI_DATA_EXIST);
1716 1717 1718 1719
}

static inline int f2fs_exist_data(struct inode *inode)
{
1720
	return is_inode_flag_set(inode, FI_DATA_EXIST);
1721 1722
}

1723 1724
static inline int f2fs_has_inline_dots(struct inode *inode)
{
1725
	return is_inode_flag_set(inode, FI_INLINE_DOTS);
1726 1727
}

J
Jaegeuk Kim 已提交
1728 1729
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
1730
	return is_inode_flag_set(inode, FI_ATOMIC_FILE);
J
Jaegeuk Kim 已提交
1731 1732
}

1733 1734
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
1735
	return is_inode_flag_set(inode, FI_VOLATILE_FILE);
1736 1737
}

1738 1739
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
1740
	return is_inode_flag_set(inode, FI_FIRST_BLOCK_WRITTEN);
1741 1742
}

1743 1744
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
1745
	return is_inode_flag_set(inode, FI_DROP_CACHE);
1746 1747
}

1748 1749
static inline void *inline_data_addr(struct page *page)
{
1750
	struct f2fs_inode *ri = F2FS_INODE(page);
1751 1752 1753
	return (void *)&(ri->i_addr[1]);
}

1754 1755
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
1756
	return is_inode_flag_set(inode, FI_INLINE_DENTRY);
1757 1758
}

1759 1760 1761 1762 1763 1764
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1765 1766 1767 1768 1769 1770 1771 1772
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;
1773
	mark_inode_dirty_sync(inode);
1774 1775 1776 1777 1778
}

static inline void clear_file(struct inode *inode, int type)
{
	F2FS_I(inode)->i_advise &= ~type;
1779
	mark_inode_dirty_sync(inode);
1780 1781
}

J
Jaegeuk Kim 已提交
1782 1783 1784 1785 1786
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1787 1788 1789 1790 1791
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

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

A
Al Viro 已提交
1809
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
1810 1811
}

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

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

1841
#define get_inode_mode(i) \
1842
	((is_inode_flag_set(i, FI_ACL_MODE)) ? \
1843 1844
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1845
/* get offset of first page in next direct node */
1846 1847 1848 1849
#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))
1850

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

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

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

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

1917 1918
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
1919
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
1920
				inode, inode->i_ino, inode->i_mode);
1921 1922
}

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

/*
 * hash.c
 */
1936
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1937 1938 1939 1940 1941 1942 1943

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

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

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

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

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

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
2083
block_t start_bidx_of_node(unsigned int, struct inode *);
C
Chao Yu 已提交
2084
int f2fs_gc(struct f2fs_sb_info *, bool);
2085 2086 2087 2088 2089
void build_gc_manager(struct f2fs_sb_info *);

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

2131 2132
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
2133
	return (struct f2fs_stat_info *)sbi->stat_info;
2134 2135
}

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

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

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

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

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

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

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

2287 2288 2289 2290 2291 2292 2293 2294
/*
 * 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 *);

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

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

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

2335 2336 2337
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2338
	umode_t mode = inode->i_mode;
2339 2340 2341 2342 2343 2344 2345

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

2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368
#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
2369
#endif
2370
#endif