f2fs.h 67.6 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

40 41 42 43 44 45 46 47 48 49
/*
 * 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 已提交
50
#define F2FS_MOUNT_INLINE_XATTR		0x00000080
51
#define F2FS_MOUNT_INLINE_DATA		0x00000100
52 53 54
#define F2FS_MOUNT_INLINE_DENTRY	0x00000200
#define F2FS_MOUNT_FLUSH_MERGE		0x00000400
#define F2FS_MOUNT_NOBARRIER		0x00000800
55
#define F2FS_MOUNT_FASTBOOT		0x00001000
56
#define F2FS_MOUNT_EXTENT_CACHE		0x00002000
57
#define F2FS_MOUNT_FORCE_FG_GC		0x00004000
58
#define F2FS_MOUNT_DATA_FLUSH		0x00008000
59 60 61 62 63 64 65 66 67

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

68 69 70 71
typedef u32 block_t;	/*
			 * should not change u32, since it is the on-disk block
			 * address format, __le32.
			 */
72 73 74 75 76 77
typedef u32 nid_t;

struct f2fs_mount_info {
	unsigned int	opt;
};

78 79
#define F2FS_FEATURE_ENCRYPT	0x0001

80 81 82 83 84 85 86
#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)

87 88 89 90 91 92 93 94
/*
 * For checkpoint manager
 */
enum {
	NAT_BITMAP,
	SIT_BITMAP
};

95 96
enum {
	CP_UMOUNT,
97
	CP_FASTBOOT,
98
	CP_SYNC,
99
	CP_RECOVERY,
100
	CP_DISCARD,
101 102
};

J
Jaegeuk Kim 已提交
103 104 105
#define DEF_BATCHED_TRIM_SECTIONS	32
#define BATCHED_TRIM_SEGMENTS(sbi)	\
		(SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
106 107
#define BATCHED_TRIM_BLOCKS(sbi)	\
		(BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
108
#define DEF_CP_INTERVAL			60	/* 60 secs */
109
#define DEF_IDLE_INTERVAL		120	/* 2 mins */
J
Jaegeuk Kim 已提交
110

111 112
struct cp_control {
	int reason;
113 114 115 116
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
117 118
};

119
/*
120
 * For CP/NAT/SIT/SSA readahead
121 122 123 124
 */
enum {
	META_CP,
	META_NAT,
125
	META_SIT,
126 127
	META_SSA,
	META_POR,
128 129
};

J
Jaegeuk Kim 已提交
130 131 132
/* for the list of ino */
enum {
	ORPHAN_INO,		/* for orphan ino list */
133 134
	APPEND_INO,		/* for append ino list */
	UPDATE_INO,		/* for update ino list */
J
Jaegeuk Kim 已提交
135 136 137 138
	MAX_INO_ENTRY,		/* max. list */
};

struct ino_entry {
139 140 141 142
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

143
/* for the list of inodes to be GCed */
144
struct inode_entry {
145 146 147 148
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

149 150 151 152 153 154 155
/* 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 */
};

156 157 158 159
/* 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 */
160 161 162
	block_t blkaddr;	/* block address locating the last fsync */
	block_t last_dentry;	/* block address locating the last dentry */
	block_t last_inode;	/* block address locating the last inode */
163 164
};

165 166
#define nats_in_cursum(jnl)		(le16_to_cpu(jnl->n_nats))
#define sits_in_cursum(jnl)		(le16_to_cpu(jnl->n_sits))
167

168 169 170 171
#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)
172

173 174
#define MAX_NAT_JENTRIES(jnl)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(jnl))
#define MAX_SIT_JENTRIES(jnl)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(jnl))
175

176
static inline int update_nats_in_cursum(struct f2fs_journal *journal, int i)
177
{
178 179
	int before = nats_in_cursum(journal);
	journal->n_nats = cpu_to_le16(before + i);
180 181 182
	return before;
}

183
static inline int update_sits_in_cursum(struct f2fs_journal *journal, int i)
184
{
185 186
	int before = sits_in_cursum(journal);
	journal->n_sits = cpu_to_le16(before + i);
187 188 189
	return before;
}

190 191
static inline bool __has_cursum_space(struct f2fs_journal *journal,
							int size, int type)
192 193
{
	if (type == NAT_JOURNAL)
194 195
		return size <= MAX_NAT_JENTRIES(journal);
	return size <= MAX_SIT_JENTRIES(journal);
196 197
}

198 199 200
/*
 * ioctl commands
 */
J
Jaegeuk Kim 已提交
201 202
#define F2FS_IOC_GETFLAGS		FS_IOC_GETFLAGS
#define F2FS_IOC_SETFLAGS		FS_IOC_SETFLAGS
C
Chao Yu 已提交
203
#define F2FS_IOC_GETVERSION		FS_IOC_GETVERSION
J
Jaegeuk Kim 已提交
204 205 206 207

#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)
208
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
209 210
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
211
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
212
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
C
Chao Yu 已提交
213
#define F2FS_IOC_DEFRAGMENT		_IO(F2FS_IOCTL_MAGIC, 8)
214

215 216 217
#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
218

J
Jaegeuk Kim 已提交
219 220 221 222 223 224 225 226
/*
 * 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 */
227
#define F2FS_GOING_DOWN_METAFLUSH	0x3	/* going down with meta flush */
J
Jaegeuk Kim 已提交
228

229 230 231 232
#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
/*
 * ioctl commands in 32 bit emulation
 */
233 234 235
#define F2FS_IOC32_GETFLAGS		FS_IOC32_GETFLAGS
#define F2FS_IOC32_SETFLAGS		FS_IOC32_SETFLAGS
#define F2FS_IOC32_GETVERSION		FS_IOC32_GETVERSION
236 237
#endif

C
Chao Yu 已提交
238 239 240 241 242
struct f2fs_defragment {
	u64 start;
	u64 len;
};

243 244 245
/*
 * For INODE and NODE manager
 */
246 247
/* for directory operations */
struct f2fs_dentry_ptr {
248
	struct inode *inode;
249 250 251 252 253 254
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

255 256
static inline void make_dentry_ptr(struct inode *inode,
		struct f2fs_dentry_ptr *d, void *src, int type)
257
{
258 259
	d->inode = inode;

260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
	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;
	}
}

275 276 277 278 279 280 281
/*
 * 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)
282 283 284 285 286
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 已提交
287
					 * by get_data_block.
288
					 */
289 290
};

291
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
292

293 294
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

295 296 297
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

298
/* for in-memory extent cache entry */
299 300 301 302
#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
303

304
struct extent_info {
305 306 307 308 309 310 311 312 313
	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 */
314
	struct extent_tree *et;		/* extent tree pointer */
315 316 317 318 319
};

struct extent_tree {
	nid_t ino;			/* inode number */
	struct rb_root root;		/* root of extent info rb-tree */
320
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
321
	struct extent_info largest;	/* largested extent info */
322
	struct list_head list;		/* to be used by sbi->zombie_list */
323
	rwlock_t lock;			/* protect extent info rb-tree */
324
	atomic_t node_cnt;		/* # of extent node in rb-tree*/
325 326
};

J
Jaegeuk Kim 已提交
327 328 329 330 331 332 333
/*
 * 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)
334 335 336
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
337 338 339 340 341 342

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

C
Chao Yu 已提交
346 347 348 349 350
/* 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
351
#define F2FS_GET_BLOCK_PRE_DIO		4
352
#define F2FS_GET_BLOCK_PRE_AIO		5
C
Chao Yu 已提交
353

354 355 356 357
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
358
#define FADVISE_LOST_PINO_BIT	0x02
359
#define FADVISE_ENCRYPT_BIT	0x04
360
#define FADVISE_ENC_NAME_BIT	0x08
361

362 363 364 365 366 367
#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)
368 369 370
#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)
371 372
#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)
373

374 375
#define DEF_DIR_LEVEL		0

376 377 378 379
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 */
380
	unsigned char i_dir_level;	/* use for dentry level for large dir */
381
	unsigned int i_current_depth;	/* use only in directory structure */
382
	unsigned int i_pino;		/* parent inode number */
383 384 385 386
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
387
	struct rw_semaphore i_sem;	/* protect fi info */
388
	atomic_t dirty_pages;		/* # of dirty pages */
389 390 391
	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 */
392
	unsigned long long xattr_ver;	/* cp version of xattr modification */
J
Jaegeuk Kim 已提交
393

394
	struct list_head dirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
395 396
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
J
Jaegeuk Kim 已提交
397
	struct extent_tree *extent_tree;	/* cached extent_tree entry */
398 399 400 401 402 403
};

static inline void get_extent_info(struct extent_info *ext,
					struct f2fs_extent i_ext)
{
	ext->fofs = le32_to_cpu(i_ext.fofs);
404
	ext->blk = le32_to_cpu(i_ext.blk);
405 406 407 408 409 410 411
	ext->len = le32_to_cpu(i_ext.len);
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	i_ext->fofs = cpu_to_le32(ext->fofs);
412
	i_ext->blk = cpu_to_le32(ext->blk);
413 414 415
	i_ext->len = cpu_to_le32(ext->len);
}

416 417 418 419 420 421 422 423
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;
}

424 425 426 427 428 429 430
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);
}

431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449
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);
}

450 451 452 453 454 455 456
static inline void __try_update_largest_extent(struct extent_tree *et,
						struct extent_node *en)
{
	if (en->ei.len > et->largest.len)
		et->largest = en->ei;
}

457 458 459
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
460
	nid_t available_nids;		/* maximum available node ids */
461
	nid_t next_scan_nid;		/* the next nid to be scanned */
462
	unsigned int ram_thresh;	/* control the memory footprint */
C
Chao Yu 已提交
463
	unsigned int ra_nid_pages;	/* # of nid pages to be readaheaded */
C
Chao Yu 已提交
464
	unsigned int dirty_nats_ratio;	/* control dirty nats ratio threshold */
465 466 467

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
468
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
469
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
470
	struct list_head nat_entries;	/* cached nat entry list (clean) */
471
	unsigned int nat_cnt;		/* the # of cached nat entries */
472
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
473 474

	/* free node ids management */
475
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497
	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 */
498
	bool node_changed;		/* is node block changed */
499 500
	char cur_level;			/* level of hole node page */
	char max_level;			/* level of current page located */
501 502 503 504 505 506
	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)
{
507
	memset(dn, 0, sizeof(*dn));
508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537
	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 */
538 539
	NO_CHECK_TYPE,
	CURSEG_DIRECT_IO,	/* to use for the direct IO path */
540 541
};

542 543
struct flush_cmd {
	struct completion wait;
544
	struct llist_node llnode;
545 546 547
	int ret;
};

548 549 550
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
551 552
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
553 554
};

555 556 557 558 559 560 561 562 563 564 565 566 567 568
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 */
569 570 571

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
572 573 574 575 576

	/* 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 */
577

J
Jaegeuk Kim 已提交
578 579 580
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

581 582
	struct list_head sit_entry_set;	/* sit entry set list */

583 584
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
585
	unsigned int min_fsync_blocks;	/* threshold for fsync */
586 587

	/* for flush command control */
588 589
	struct flush_cmd_control *cmd_control_info;

590 591 592 593 594 595 596 597 598 599 600 601 602 603
};

/*
 * 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_WRITEBACK,
	F2FS_DIRTY_DENTS,
604
	F2FS_DIRTY_DATA,
605 606
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
607
	F2FS_INMEM_PAGES,
608 609 610 611
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
612
 * The below are the page types of bios used in submit_bio().
613 614 615 616 617 618 619 620 621
 * 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.
 */
622
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
623 624 625 626 627 628
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
629 630
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
631
	INMEM_REVOKE,
632 633
	IPU,
	OPU,
634 635
};

J
Jaegeuk Kim 已提交
636
struct f2fs_io_info {
637
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
638 639
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
	int rw;			/* contains R/RS/W/WS with REQ_META/REQ_PRIO */
640
	block_t new_blkaddr;	/* new block address to be written */
641
	block_t old_blkaddr;	/* old block address before Cow */
642
	struct page *page;	/* page to be written */
643
	struct page *encrypted_page;	/* encrypted page */
J
Jaegeuk Kim 已提交
644 645
};

646
#define is_read_io(rw)	(((rw) & 1) == READ)
647
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
648
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
649 650
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
651
	struct f2fs_io_info fio;	/* store buffered io info. */
652
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
653 654
};

655 656 657 658 659 660
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
	NR_INODE_TYPE,
};

661 662 663 664 665 666 667 668
/* 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 */
};

669 670 671 672 673 674
/* 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 */
675
	SBI_NEED_SB_WRITE,			/* need to recover superblock */
676 677
};

678 679
enum {
	CP_TIME,
680
	REQ_TIME,
681 682 683
	MAX_TIME,
};

684 685
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
686
	struct proc_dir_entry *s_proc;		/* proc entry */
687
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
688
	int valid_super_block;			/* valid super block no */
689
	int s_flag;				/* flags for sbi */
690 691 692 693 694 695 696

	/* 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 */
697 698

	/* for bio operations */
699
	struct f2fs_bio_info read_io;			/* for read bios */
700
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
701 702 703 704

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
	struct inode *meta_inode;		/* cache meta blocks */
705
	struct mutex cp_mutex;			/* checkpoint procedure lock */
706
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
707
	struct rw_semaphore node_write;		/* locking node writes */
708
	struct mutex writepages;		/* mutex for writepages() */
709
	wait_queue_head_t cp_wait;
710 711
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
712

713
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
714 715

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

718 719 720
	/* 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 */
721

722 723 724 725 726
	/* 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 */
727
	atomic_t total_ext_tree;		/* extent tree count */
728
	struct list_head zombie_list;		/* extent zombie tree list */
729
	atomic_t total_zombie_tree;		/* extent zombie tree count */
730 731
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
732
	/* basic filesystem units */
733 734 735 736 737 738 739 740 741 742 743 744 745 746
	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 */
	unsigned int total_valid_inode_count;	/* valid inode count */
C
Chao Yu 已提交
747
	loff_t max_file_blocks;			/* max block index of file */
748
	int active_logs;			/* # of active logs */
749
	int dir_level;				/* directory level */
750 751 752 753

	block_t user_block_count;		/* # of user blocks */
	block_t total_valid_block_count;	/* # of valid blocks */
	block_t alloc_valid_block_count;	/* # of allocated blocks */
754
	block_t discard_blks;			/* discard command candidats */
755 756 757 758 759 760 761 762 763
	block_t last_valid_block_count;		/* for recovery */
	u32 s_next_generation;			/* for NFS support */
	atomic_t nr_pages[NR_COUNT_TYPE];	/* # of pages, see count_type */

	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 */
764
	unsigned int cur_victim_sec;		/* current victim section num */
765

766 767 768
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

769 770 771 772
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
773
#ifdef CONFIG_F2FS_STAT_FS
774 775 776
	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 */
777
	atomic_t inplace_count;		/* # of inplace update */
778 779 780 781
	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 已提交
782
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
783 784
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
785
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
786
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
787 788
#endif
	unsigned int last_victim[2];		/* last victim segment # */
789
	spinlock_t stat_lock;			/* lock for stat operations */
790 791 792 793

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
794 795 796 797 798

	/* For shrinker support */
	struct list_head s_list;
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
799 800 801 802

	/* For write statistics */
	u64 sectors_written_start;
	u64 kbytes_written;
K
Keith Mok 已提交
803 804 805

	/* Reference to checksum algorithm driver via cryptoapi */
	struct crypto_shash *s_chksum_driver;
806 807
};

808 809 810 811 812 813 814
/* 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)

815 816 817 818 819 820 821 822 823 824 825 826 827
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);
}

828 829 830 831 832 833 834 835 836 837 838 839
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);
}

840 841 842
/*
 * Inline functions
 */
K
Keith Mok 已提交
843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865
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;
}

866 867 868 869 870 871 872 873 874 875
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;
}

876 877 878 879 880 881 882 883 884 885 886 887 888 889 890
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);
}

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

901 902 903 904 905
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

906 907 908 909 910
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935
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 已提交
936 937 938 939 940
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

941 942 943 944 945
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

946 947 948 949 950 951
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)
952
{
953
	sbi->s_flag |= (0x01 << type);
954 955
}

956
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
957
{
958
	sbi->s_flag &= ~(0x01 << type);
959 960
}

961 962 963 964 965
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985
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);
}

986
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
987
{
988
	down_read(&sbi->cp_rwsem);
989 990
}

991
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
992
{
993
	up_read(&sbi->cp_rwsem);
994 995
}

996
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
997
{
998
	down_write(&sbi->cp_rwsem);
999 1000
}

1001
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1002
{
1003
	up_write(&sbi->cp_rwsem);
1004 1005
}

1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027
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));
}

1028 1029 1030
/*
 * Check whether the given nid is within node id range.
 */
1031
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1032
{
1033 1034
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1035
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1036 1037
		return -EINVAL;
	return 0;
1038 1039 1040 1041 1042 1043 1044 1045 1046 1047
}

#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 已提交
1048
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1049
	else
C
Chris Fries 已提交
1050
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1051 1052
}

1053 1054 1055 1056 1057
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1058 1059 1060 1061 1062 1063 1064 1065
static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
				 struct inode *inode, blkcnt_t count)
{
	block_t	valid_block_count;

	spin_lock(&sbi->stat_lock);
	valid_block_count =
		sbi->total_valid_block_count + (block_t)count;
1066
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1067 1068 1069 1070 1071 1072 1073 1074 1075 1076
		spin_unlock(&sbi->stat_lock);
		return false;
	}
	inode->i_blocks += count;
	sbi->total_valid_block_count = valid_block_count;
	sbi->alloc_valid_block_count += (block_t)count;
	spin_unlock(&sbi->stat_lock);
	return true;
}

1077
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1078 1079 1080 1081
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1082 1083
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1084 1085 1086 1087 1088 1089 1090 1091
	inode->i_blocks -= count;
	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)
{
	atomic_inc(&sbi->nr_pages[count_type]);
1092
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1093 1094
}

1095
static inline void inode_inc_dirty_pages(struct inode *inode)
1096
{
1097
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1098 1099
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1100 1101 1102 1103 1104 1105 1106
}

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

1107
static inline void inode_dec_dirty_pages(struct inode *inode)
1108
{
1109 1110
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1111 1112
		return;

1113
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1114 1115
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1116 1117 1118 1119 1120 1121 1122
}

static inline int get_pages(struct f2fs_sb_info *sbi, int count_type)
{
	return atomic_read(&sbi->nr_pages[count_type]);
}

1123
static inline int get_dirty_pages(struct inode *inode)
1124
{
1125
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1126 1127
}

1128 1129
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1130
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1131 1132 1133 1134
	return ((get_pages(sbi, block_type) + pages_per_sec - 1)
			>> sbi->log_blocks_per_seg) / sbi->segs_per_sec;
}

1135 1136
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1137
	return sbi->total_valid_block_count;
1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152
}

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 已提交
1153 1154 1155 1156 1157
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1158 1159 1160
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1161 1162
	int offset;

W
Wanpeng Li 已提交
1163
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1164 1165 1166
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1167
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1168 1169
	} else {
		offset = (flag == NAT_BITMAP) ?
1170
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1171 1172
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1173 1174 1175 1176 1177 1178
}

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

1181
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1182 1183 1184

	/*
	 * odd numbered checkpoint should at cp segment 0
A
arter97 已提交
1185
	 * and even segment must be at cp segment 1
1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198
	 */
	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,
1199
						struct inode *inode)
1200 1201 1202 1203 1204 1205
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1206
	valid_block_count = sbi->total_valid_block_count + 1;
1207
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1208 1209 1210 1211
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1212
	valid_node_count = sbi->total_valid_node_count + 1;
1213
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1214 1215 1216 1217 1218
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1219 1220 1221 1222 1223
		inode->i_blocks++;

	sbi->alloc_valid_block_count++;
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1224 1225 1226 1227 1228 1229
	spin_unlock(&sbi->stat_lock);

	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1230
						struct inode *inode)
1231 1232 1233
{
	spin_lock(&sbi->stat_lock);

1234 1235 1236
	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);
1237

1238 1239 1240
	inode->i_blocks--;
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1241 1242 1243 1244 1245 1246

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1247
	return sbi->total_valid_node_count;
1248 1249 1250 1251 1252
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
	spin_lock(&sbi->stat_lock);
1253
	f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
1254 1255 1256 1257
	sbi->total_valid_inode_count++;
	spin_unlock(&sbi->stat_lock);
}

1258
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1259 1260
{
	spin_lock(&sbi->stat_lock);
1261
	f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
1262 1263 1264 1265 1266 1267
	sbi->total_valid_inode_count--;
	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
{
1268
	return sbi->total_valid_inode_count;
1269 1270
}

1271 1272 1273 1274 1275 1276 1277 1278
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1279 1280 1281 1282 1283 1284 1285 1286 1287 1288
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);
}

1289 1290
static inline void f2fs_put_page(struct page *page, int unlock)
{
1291
	if (!page)
1292 1293 1294
		return;

	if (unlock) {
1295
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1296 1297
		unlock_page(page);
	}
1298
	put_page(page);
1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311
}

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,
1312
					size_t size)
1313
{
1314
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1315 1316
}

1317 1318 1319 1320 1321
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1322 1323 1324
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1325 1326 1327
	return entry;
}

J
Jaegeuk Kim 已提交
1328 1329 1330 1331 1332 1333
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1334 1335
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1336 1337 1338
	return bio;
}

1339 1340 1341 1342 1343 1344 1345
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();
}

1346 1347 1348 1349
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1350
	struct f2fs_node *p = F2FS_NODE(page);
1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363
	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;
1364
	raw_node = F2FS_NODE(node_page);
1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377
	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;
}

1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395
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;
}

1396
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407
{
	int mask;
	int ret;

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

1408
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419
{
	int mask;
	int ret;

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

1420 1421 1422 1423 1424 1425 1426 1427 1428
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1429 1430 1431
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1432
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1433
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1434 1435 1436
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1437
	FI_FREE_NID,		/* free allocated nide */
1438
	FI_UPDATE_DIR,		/* should update inode block for consistency */
1439
	FI_DELAY_IPUT,		/* used for the recovery */
1440
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1441
	FI_INLINE_XATTR,	/* used for inline xattr */
1442
	FI_INLINE_DATA,		/* used for inline data*/
1443
	FI_INLINE_DENTRY,	/* used for inline dentry */
1444 1445
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1446 1447
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
1448
	FI_VOLATILE_FILE,	/* indicate volatile file */
1449
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1450
	FI_DROP_CACHE,		/* drop dirty page cache */
1451
	FI_DATA_EXIST,		/* indicate data exists */
1452
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1453
	FI_DO_DEFRAG,		/* indicate defragment is running */
1454
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1455 1456 1457 1458
};

static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
{
J
Jaegeuk Kim 已提交
1459 1460
	if (!test_bit(flag, &fi->flags))
		set_bit(flag, &fi->flags);
1461 1462 1463 1464 1465 1466 1467 1468 1469
}

static inline int is_inode_flag_set(struct f2fs_inode_info *fi, int flag)
{
	return test_bit(flag, &fi->flags);
}

static inline void clear_inode_flag(struct f2fs_inode_info *fi, int flag)
{
J
Jaegeuk Kim 已提交
1470 1471
	if (test_bit(flag, &fi->flags))
		clear_bit(flag, &fi->flags);
1472 1473 1474 1475 1476 1477 1478 1479
}

static inline void set_acl_inode(struct f2fs_inode_info *fi, umode_t mode)
{
	fi->i_acl_mode = mode;
	set_inode_flag(fi, FI_ACL_MODE);
}

J
Jaegeuk Kim 已提交
1480 1481 1482 1483 1484
static inline void get_inline_info(struct f2fs_inode_info *fi,
					struct f2fs_inode *ri)
{
	if (ri->i_inline & F2FS_INLINE_XATTR)
		set_inode_flag(fi, FI_INLINE_XATTR);
1485 1486
	if (ri->i_inline & F2FS_INLINE_DATA)
		set_inode_flag(fi, FI_INLINE_DATA);
1487 1488
	if (ri->i_inline & F2FS_INLINE_DENTRY)
		set_inode_flag(fi, FI_INLINE_DENTRY);
1489 1490
	if (ri->i_inline & F2FS_DATA_EXIST)
		set_inode_flag(fi, FI_DATA_EXIST);
1491 1492
	if (ri->i_inline & F2FS_INLINE_DOTS)
		set_inode_flag(fi, FI_INLINE_DOTS);
J
Jaegeuk Kim 已提交
1493 1494 1495 1496 1497 1498 1499 1500 1501
}

static inline void set_raw_inline(struct f2fs_inode_info *fi,
					struct f2fs_inode *ri)
{
	ri->i_inline = 0;

	if (is_inode_flag_set(fi, FI_INLINE_XATTR))
		ri->i_inline |= F2FS_INLINE_XATTR;
1502 1503
	if (is_inode_flag_set(fi, FI_INLINE_DATA))
		ri->i_inline |= F2FS_INLINE_DATA;
1504 1505
	if (is_inode_flag_set(fi, FI_INLINE_DENTRY))
		ri->i_inline |= F2FS_INLINE_DENTRY;
1506 1507
	if (is_inode_flag_set(fi, FI_DATA_EXIST))
		ri->i_inline |= F2FS_DATA_EXIST;
1508 1509
	if (is_inode_flag_set(fi, FI_INLINE_DOTS))
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1510 1511
}

1512 1513 1514 1515 1516
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
}

1517
static inline unsigned int addrs_per_inode(struct inode *inode)
1518
{
1519
	if (f2fs_has_inline_xattr(inode))
1520 1521 1522 1523
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1524 1525
static inline void *inline_xattr_addr(struct page *page)
{
1526
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1527 1528 1529 1530 1531 1532
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1533
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1534 1535 1536 1537 1538
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1539 1540 1541 1542 1543
static inline int f2fs_has_inline_data(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
}

1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554
static inline void f2fs_clear_inline_inode(struct inode *inode)
{
	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	clear_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
}

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

1555 1556 1557 1558 1559
static inline int f2fs_has_inline_dots(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DOTS);
}

J
Jaegeuk Kim 已提交
1560 1561 1562 1563 1564
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_ATOMIC_FILE);
}

1565 1566 1567 1568 1569
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_VOLATILE_FILE);
}

1570 1571 1572 1573 1574
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
}

1575 1576 1577 1578 1579
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_DROP_CACHE);
}

1580 1581
static inline void *inline_data_addr(struct page *page)
{
1582
	struct f2fs_inode *ri = F2FS_INODE(page);
1583 1584 1585
	return (void *)&(ri->i_addr[1]);
}

1586 1587 1588 1589 1590
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DENTRY);
}

1591 1592 1593 1594 1595 1596
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611
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;
}

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

J
Jaegeuk Kim 已提交
1612 1613 1614 1615 1616
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1617 1618 1619 1620 1621
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

1622 1623 1624 1625 1626 1627
static inline void f2fs_stop_checkpoint(struct f2fs_sb_info *sbi)
{
	set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
	sbi->sb->s_flags |= MS_RDONLY;
}

1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638
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 已提交
1639 1640 1641 1642 1643 1644
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
			is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT))
		return false;

A
Al Viro 已提交
1645
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
1646 1647
}

1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667
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;
}

1668 1669 1670 1671
#define get_inode_mode(i) \
	((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1672
/* get offset of first page in next direct node */
1673 1674 1675 1676
#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))
1677

1678 1679 1680 1681 1682
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1683
int truncate_blocks(struct inode *, u64, bool);
1684
int f2fs_truncate(struct inode *, bool);
1685
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1686 1687
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1688
int truncate_data_blocks_range(struct dnode_of_data *, int);
1689
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1690
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1691 1692 1693 1694 1695 1696

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1697
int try_to_free_nats(struct f2fs_sb_info *, int);
1698 1699
int update_inode(struct inode *, struct page *);
int update_inode_page(struct inode *);
1700 1701
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1702
void handle_failed_inode(struct inode *);
1703 1704 1705 1706 1707 1708 1709 1710 1711

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

/*
 * dir.c
 */
1712
extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
1713
void set_de_type(struct f2fs_dir_entry *, umode_t);
1714
unsigned char get_de_type(struct f2fs_dir_entry *);
1715
struct f2fs_dir_entry *find_target_dentry(struct fscrypt_name *,
1716
			f2fs_hash_t, int *, struct f2fs_dentry_ptr *);
1717
bool f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
1718
			unsigned int, struct fscrypt_str *);
1719 1720
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
1721
struct page *init_inode_metadata(struct inode *, struct inode *,
1722
			const struct qstr *, struct page *);
1723
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
1724
int room_for_filename(const void *, int, int);
1725
void f2fs_drop_nlink(struct inode *, struct inode *, struct page *);
1726 1727 1728 1729 1730 1731
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 *);
1732
int update_dent_inode(struct inode *, struct inode *, const struct qstr *);
1733
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
1734
			const struct qstr *, f2fs_hash_t , unsigned int);
1735 1736
int f2fs_add_regular_entry(struct inode *, const struct qstr *,
						struct inode *, nid_t, umode_t);
1737 1738
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
1739 1740
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
1741
int f2fs_do_tmpfile(struct inode *, struct inode *);
1742 1743
bool f2fs_empty_dir(struct inode *);

1744 1745
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
1746
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
1747
				inode, inode->i_ino, inode->i_mode);
1748 1749
}

1750 1751 1752
/*
 * super.c
 */
C
Chao Yu 已提交
1753
int f2fs_commit_super(struct f2fs_sb_info *, bool);
1754
int f2fs_sync_fs(struct super_block *, int);
1755 1756
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
1757
int sanity_check_ckpt(struct f2fs_sb_info *sbi);
1758 1759 1760 1761

/*
 * hash.c
 */
1762
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1763 1764 1765 1766 1767 1768 1769

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

1770
bool available_free_memory(struct f2fs_sb_info *, int);
J
Jaegeuk Kim 已提交
1771
int need_dentry_mark(struct f2fs_sb_info *, nid_t);
1772 1773
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
1774
void get_node_info(struct f2fs_sb_info *, nid_t, struct node_info *);
1775
pgoff_t get_next_page_offset(struct dnode_of_data *, pgoff_t);
1776 1777
int get_dnode_of_data(struct dnode_of_data *, pgoff_t, int);
int truncate_inode_blocks(struct inode *, pgoff_t);
1778
int truncate_xattr_node(struct inode *, struct page *);
1779
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
C
Chao Yu 已提交
1780
int remove_inode_page(struct inode *);
1781
struct page *new_inode_page(struct inode *);
1782
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
1783 1784 1785 1786
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);
void sync_inode_page(struct dnode_of_data *);
1787 1788
int fsync_node_pages(struct f2fs_sb_info *, nid_t, struct writeback_control *);
int sync_node_pages(struct f2fs_sb_info *, struct writeback_control *);
1789 1790 1791
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 已提交
1792
int try_to_free_nids(struct f2fs_sb_info *, int);
1793
void recover_inline_xattr(struct inode *, struct page *);
1794
void recover_xattr_data(struct inode *, struct page *, block_t);
1795 1796 1797 1798 1799 1800
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 *);
1801
int __init create_node_manager_caches(void);
1802 1803 1804 1805 1806
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
1807
void register_inmem_page(struct inode *, struct page *);
1808 1809
void drop_inmem_pages(struct inode *);
int commit_inmem_pages(struct inode *);
J
Jaegeuk Kim 已提交
1810
void f2fs_balance_fs(struct f2fs_sb_info *, bool);
1811
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
1812
int f2fs_issue_flush(struct f2fs_sb_info *);
1813 1814
int create_flush_cmd_control(struct f2fs_sb_info *);
void destroy_flush_cmd_control(struct f2fs_sb_info *);
1815
void invalidate_blocks(struct f2fs_sb_info *, block_t);
1816
bool is_checkpointed_data(struct f2fs_sb_info *, block_t);
1817
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
1818
void clear_prefree_segments(struct f2fs_sb_info *, struct cp_control *);
1819
void release_discard_addrs(struct f2fs_sb_info *);
C
Chao Yu 已提交
1820
bool discard_next_dnode(struct f2fs_sb_info *, block_t);
1821
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
1822
void allocate_new_segments(struct f2fs_sb_info *);
1823
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
1824
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
C
Chao Yu 已提交
1825
void update_meta_page(struct f2fs_sb_info *, void *, block_t);
1826
void write_meta_page(struct f2fs_sb_info *, struct page *);
1827 1828 1829
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 *);
1830 1831
void __f2fs_replace_block(struct f2fs_sb_info *, struct f2fs_summary *,
					block_t, block_t, bool, bool);
1832
void f2fs_replace_block(struct f2fs_sb_info *, struct dnode_of_data *,
1833
				block_t, block_t, unsigned char, bool, bool);
1834 1835
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
1836
void f2fs_wait_on_page_writeback(struct page *, enum page_type, bool);
1837
void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *, block_t);
1838 1839
void write_data_summaries(struct f2fs_sb_info *, block_t);
void write_node_summaries(struct f2fs_sb_info *, block_t);
1840
int lookup_journal_in_cursum(struct f2fs_journal *, int, unsigned int, int);
1841
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
1842 1843
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
1844 1845
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
1846 1847 1848 1849 1850 1851

/*
 * checkpoint.c
 */
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
1852
struct page *get_tmp_page(struct f2fs_sb_info *, pgoff_t);
1853
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
1854
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int, bool);
1855
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
1856
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
1857 1858 1859
void add_ino_entry(struct f2fs_sb_info *, nid_t, int type);
void remove_ino_entry(struct f2fs_sb_info *, nid_t, int type);
void release_ino_entry(struct f2fs_sb_info *);
1860
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
J
Jaegeuk Kim 已提交
1861 1862
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
1863 1864
void add_orphan_inode(struct f2fs_sb_info *, nid_t);
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
1865
int recover_orphan_inodes(struct f2fs_sb_info *);
1866
int get_valid_checkpoint(struct f2fs_sb_info *);
1867
void update_dirty_page(struct inode *, struct page *);
1868
void add_dirty_dir_inode(struct inode *);
1869
void remove_dirty_inode(struct inode *);
C
Chao Yu 已提交
1870
int sync_dirty_inodes(struct f2fs_sb_info *, enum inode_type);
C
Chao Yu 已提交
1871
int write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
1872
void init_ino_entry_info(struct f2fs_sb_info *);
1873
int __init create_checkpoint_caches(void);
1874 1875 1876 1877 1878
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
1879
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
1880 1881
void f2fs_submit_merged_bio_cond(struct f2fs_sb_info *, struct inode *,
				struct page *, nid_t, enum page_type, int);
1882
void f2fs_flush_merged_bios(struct f2fs_sb_info *);
1883 1884
int f2fs_submit_page_bio(struct f2fs_io_info *);
void f2fs_submit_page_mbio(struct f2fs_io_info *);
1885
void set_data_blkaddr(struct dnode_of_data *);
1886
void f2fs_update_data_blkaddr(struct dnode_of_data *, block_t);
1887
int reserve_new_block(struct dnode_of_data *);
1888
int f2fs_get_block(struct dnode_of_data *, pgoff_t);
1889
ssize_t f2fs_preallocate_blocks(struct kiocb *, struct iov_iter *);
1890
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
1891
struct page *get_read_data_page(struct inode *, pgoff_t, int, bool);
1892
struct page *find_data_page(struct inode *, pgoff_t);
1893
struct page *get_lock_data_page(struct inode *, pgoff_t, bool);
1894
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
1895
int do_write_data_page(struct f2fs_io_info *);
C
Chao Yu 已提交
1896
int f2fs_map_blocks(struct inode *, struct f2fs_map_blocks *, int, int);
J
Jaegeuk Kim 已提交
1897
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
1898 1899
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
1900 1901 1902 1903 1904 1905

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
1906
block_t start_bidx_of_node(unsigned int, struct inode *);
C
Chao Yu 已提交
1907
int f2fs_gc(struct f2fs_sb_info *, bool);
1908 1909 1910 1911 1912
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
1913
int recover_fsync_data(struct f2fs_sb_info *, bool);
1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924
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;
1925 1926
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
1927
	int ext_tree, zombie_tree, ext_node;
C
Chao Yu 已提交
1928 1929
	int ndirty_node, ndirty_meta;
	int ndirty_dent, ndirty_dirs, ndirty_data, ndirty_files;
1930
	int nats, dirty_nats, sits, dirty_sits, fnids;
1931
	int total_count, utilization;
C
Chao Yu 已提交
1932 1933
	int bg_gc, inmem_pages, wb_pages;
	int inline_xattr, inline_inode, inline_dir;
1934 1935 1936 1937 1938
	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;
1939
	int prefree_count, call_count, cp_count, bg_cp_count;
1940
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
1941
	int bg_node_segs, bg_data_segs;
1942
	int tot_blks, data_blks, node_blks;
1943
	int bg_data_blks, bg_node_blks;
1944 1945 1946 1947 1948 1949
	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];
1950
	unsigned int inplace_count;
C
Chao Yu 已提交
1951
	unsigned long long base_mem, cache_mem, page_mem;
1952 1953
};

1954 1955
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
1956
	return (struct f2fs_stat_info *)sbi->stat_info;
1957 1958
}

1959
#define stat_inc_cp_count(si)		((si)->cp_count++)
1960
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
1961 1962
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
1963 1964
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
1965 1966 1967 1968
#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 已提交
1969 1970 1971 1972 1973 1974 1975 1976 1977 1978
#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)
1979 1980 1981
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1982
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
1983 1984 1985 1986
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1987
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
1988
	} while (0)
1989 1990 1991
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1992
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
1993 1994 1995 1996
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1997
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
1998
	} while (0)
1999 2000 2001 2002
#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]++)
2003 2004
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2005
#define stat_inc_seg_count(sbi, type, gc_type)				\
2006
	do {								\
2007
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2008
		(si)->tot_segs++;					\
2009
		if (type == SUM_TYPE_DATA) {				\
2010
			si->data_segs++;				\
2011 2012
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2013
			si->node_segs++;				\
2014 2015
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2016 2017 2018 2019 2020
	} while (0)

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

2021
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2022
	do {								\
2023
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2024 2025
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2026
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2027 2028
	} while (0)

2029
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2030
	do {								\
2031
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2032 2033
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2034
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2035 2036 2037 2038
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
2039
int __init f2fs_create_root_stats(void);
2040
void f2fs_destroy_root_stats(void);
2041
#else
2042
#define stat_inc_cp_count(si)
2043
#define stat_inc_bg_cp_count(si)
2044
#define stat_inc_call_count(si)
2045
#define stat_inc_bggc_count(si)
C
Chao Yu 已提交
2046 2047
#define stat_inc_dirty_inode(sbi, type)
#define stat_dec_dirty_inode(sbi, type)
2048
#define stat_inc_total_hit(sb)
2049
#define stat_inc_rbtree_node_hit(sb)
2050 2051
#define stat_inc_largest_node_hit(sbi)
#define stat_inc_cached_node_hit(sbi)
C
Chao Yu 已提交
2052 2053
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
2054 2055
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
2056 2057
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
2058 2059
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
2060
#define stat_inc_inplace_blocks(sbi)
2061
#define stat_inc_seg_count(sbi, type, gc_type)
2062
#define stat_inc_tot_blk_count(si, blks)
2063 2064
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
2065 2066 2067

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2068
static inline int __init f2fs_create_root_stats(void) { return 0; }
2069
static inline void f2fs_destroy_root_stats(void) { }
2070 2071 2072 2073 2074 2075 2076 2077 2078 2079
#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;
2080
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2081
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2082
extern struct kmem_cache *inode_entry_slab;
2083

2084 2085 2086
/*
 * inline.c
 */
2087 2088
bool f2fs_may_inline_data(struct inode *);
bool f2fs_may_inline_dentry(struct inode *);
2089
void read_inline_data(struct page *, struct page *);
2090
bool truncate_inline_inode(struct page *, u64);
2091
int f2fs_read_inline_data(struct inode *, struct page *);
2092 2093 2094
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 *);
2095
bool recover_inline_data(struct inode *, struct page *);
2096
struct f2fs_dir_entry *find_in_inline_dir(struct inode *,
2097
				struct fscrypt_name *, struct page **);
2098 2099
struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *, struct page **);
int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
2100 2101
int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *,
						nid_t, umode_t);
2102 2103 2104
void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
						struct inode *, struct inode *);
bool f2fs_empty_inline_dir(struct inode *);
2105
int f2fs_read_inline_dir(struct file *, struct dir_context *,
2106
						struct fscrypt_str *);
J
Jaegeuk Kim 已提交
2107 2108
int f2fs_inline_data_fiemap(struct inode *,
		struct fiemap_extent_info *, __u64, __u64);
2109

2110 2111 2112 2113 2114 2115 2116 2117
/*
 * 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 *);

2118 2119 2120 2121
/*
 * extent_cache.c
 */
unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
2122
bool f2fs_init_extent_tree(struct inode *, struct f2fs_extent *);
2123 2124 2125 2126
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 已提交
2127 2128
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
						pgoff_t, block_t, unsigned int);
2129 2130 2131 2132
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2133 2134 2135
/*
 * crypto support
 */
2136
static inline bool f2fs_encrypted_inode(struct inode *inode)
2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149
{
	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)
{
2150
	return bio->bi_private != NULL;
2151 2152 2153 2154 2155 2156
}

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

2158 2159 2160
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2161
	umode_t mode = inode->i_mode;
2162 2163 2164 2165 2166 2167 2168

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

2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191
#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
2192
#endif
2193
#endif