f2fs.h 64.7 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>
J
Jaegeuk Kim 已提交
22
#include <linux/bio.h>
23

24
#ifdef CONFIG_F2FS_CHECK_FS
25
#define f2fs_bug_on(sbi, condition)	BUG_ON(condition)
J
Jaegeuk Kim 已提交
26
#define f2fs_down_write(x, y)	down_write_nest_lock(x, y)
27
#else
28 29 30 31
#define f2fs_bug_on(sbi, condition)					\
	do {								\
		if (unlikely(condition)) {				\
			WARN_ON(1);					\
32
			set_sbi_flag(sbi, SBI_NEED_FSCK);		\
33 34
		}							\
	} while (0)
J
Jaegeuk Kim 已提交
35
#define f2fs_down_write(x, y)	down_write(x)
36 37
#endif

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

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

64 65 66 67
typedef u32 block_t;	/*
			 * should not change u32, since it is the on-disk block
			 * address format, __le32.
			 */
68 69 70 71 72 73
typedef u32 nid_t;

struct f2fs_mount_info {
	unsigned int	opt;
};

74 75
#define F2FS_FEATURE_ENCRYPT	0x0001

76 77 78 79 80 81 82
#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)

J
Jaegeuk Kim 已提交
83 84 85
#define CRCPOLY_LE 0xedb88320

static inline __u32 f2fs_crc32(void *buf, size_t len)
86
{
J
Jaegeuk Kim 已提交
87 88 89 90 91 92 93 94 95 96
	unsigned char *p = (unsigned char *)buf;
	__u32 crc = F2FS_SUPER_MAGIC;
	int i;

	while (len--) {
		crc ^= *p++;
		for (i = 0; i < 8; i++)
			crc = (crc >> 1) ^ ((crc & 1) ? CRCPOLY_LE : 0);
	}
	return crc;
97 98
}

J
Jaegeuk Kim 已提交
99
static inline bool f2fs_crc_valid(__u32 blk_crc, void *buf, size_t buf_size)
100
{
J
Jaegeuk Kim 已提交
101
	return f2fs_crc32(buf, buf_size) == blk_crc;
102 103 104 105 106 107 108 109 110 111
}

/*
 * For checkpoint manager
 */
enum {
	NAT_BITMAP,
	SIT_BITMAP
};

112 113
enum {
	CP_UMOUNT,
114
	CP_FASTBOOT,
115
	CP_SYNC,
116
	CP_RECOVERY,
117
	CP_DISCARD,
118 119
};

J
Jaegeuk Kim 已提交
120 121 122
#define DEF_BATCHED_TRIM_SECTIONS	32
#define BATCHED_TRIM_SEGMENTS(sbi)	\
		(SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
123 124
#define BATCHED_TRIM_BLOCKS(sbi)	\
		(BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
J
Jaegeuk Kim 已提交
125

126 127
struct cp_control {
	int reason;
128 129 130 131
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
132 133
};

134
/*
135
 * For CP/NAT/SIT/SSA readahead
136 137 138 139
 */
enum {
	META_CP,
	META_NAT,
140
	META_SIT,
141 142
	META_SSA,
	META_POR,
143 144
};

J
Jaegeuk Kim 已提交
145 146 147
/* for the list of ino */
enum {
	ORPHAN_INO,		/* for orphan ino list */
148 149
	APPEND_INO,		/* for append ino list */
	UPDATE_INO,		/* for update ino list */
J
Jaegeuk Kim 已提交
150 151 152 153
	MAX_INO_ENTRY,		/* max. list */
};

struct ino_entry {
154 155 156 157
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

158 159 160 161 162 163 164 165
/*
 * for the list of directory inodes or gc inodes.
 * NOTE: there are two slab users for this structure, if we add/modify/delete
 * fields in structure for one of slab users, it may affect fields or size of
 * other one, in this condition, it's better to split both of slab and related
 * data structure.
 */
struct inode_entry {
166 167 168 169
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

170 171 172 173 174 175 176
/* 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 */
};

177 178 179 180
/* 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 */
181 182 183
	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 */
184 185 186 187 188 189 190 191 192 193
};

#define nats_in_cursum(sum)		(le16_to_cpu(sum->n_nats))
#define sits_in_cursum(sum)		(le16_to_cpu(sum->n_sits))

#define nat_in_journal(sum, i)		(sum->nat_j.entries[i].ne)
#define nid_in_journal(sum, i)		(sum->nat_j.entries[i].nid)
#define sit_in_journal(sum, i)		(sum->sit_j.entries[i].se)
#define segno_in_journal(sum, i)	(sum->sit_j.entries[i].segno)

194 195 196
#define MAX_NAT_JENTRIES(sum)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(sum))
#define MAX_SIT_JENTRIES(sum)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(sum))

197 198 199 200 201 202 203 204 205 206 207 208 209 210
static inline int update_nats_in_cursum(struct f2fs_summary_block *rs, int i)
{
	int before = nats_in_cursum(rs);
	rs->n_nats = cpu_to_le16(before + i);
	return before;
}

static inline int update_sits_in_cursum(struct f2fs_summary_block *rs, int i)
{
	int before = sits_in_cursum(rs);
	rs->n_sits = cpu_to_le16(before + i);
	return before;
}

211 212 213 214
static inline bool __has_cursum_space(struct f2fs_summary_block *sum, int size,
								int type)
{
	if (type == NAT_JOURNAL)
215 216
		return size <= MAX_NAT_JENTRIES(sum);
	return size <= MAX_SIT_JENTRIES(sum);
217 218
}

219 220 221
/*
 * ioctl commands
 */
J
Jaegeuk Kim 已提交
222 223
#define F2FS_IOC_GETFLAGS		FS_IOC_GETFLAGS
#define F2FS_IOC_SETFLAGS		FS_IOC_SETFLAGS
C
Chao Yu 已提交
224
#define F2FS_IOC_GETVERSION		FS_IOC_GETVERSION
J
Jaegeuk Kim 已提交
225 226 227 228

#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)
229
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
230 231
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
232
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
233

234 235 236 237 238 239 240
#define F2FS_IOC_SET_ENCRYPTION_POLICY					\
		_IOR('f', 19, struct f2fs_encryption_policy)
#define F2FS_IOC_GET_ENCRYPTION_PWSALT					\
		_IOW('f', 20, __u8[16])
#define F2FS_IOC_GET_ENCRYPTION_POLICY					\
		_IOW('f', 21, struct f2fs_encryption_policy)

J
Jaegeuk Kim 已提交
241 242 243 244 245 246 247 248 249
/*
 * 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 */

250 251 252 253 254 255 256 257
#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
/*
 * ioctl commands in 32 bit emulation
 */
#define F2FS_IOC32_GETFLAGS             FS_IOC32_GETFLAGS
#define F2FS_IOC32_SETFLAGS             FS_IOC32_SETFLAGS
#endif

258 259 260
/*
 * For INODE and NODE manager
 */
261
/* for directory operations */
262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280
struct f2fs_str {
	unsigned char *name;
	u32 len;
};

struct f2fs_filename {
	const struct qstr *usr_fname;
	struct f2fs_str disk_name;
	f2fs_hash_t hash;
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	struct f2fs_str crypto_buf;
#endif
};

#define FSTR_INIT(n, l)		{ .name = n, .len = l }
#define FSTR_TO_QSTR(f)		QSTR_INIT((f)->name, (f)->len)
#define fname_name(p)		((p)->disk_name.name)
#define fname_len(p)		((p)->disk_name.len)

281
struct f2fs_dentry_ptr {
282
	struct inode *inode;
283 284 285 286 287 288
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

289 290
static inline void make_dentry_ptr(struct inode *inode,
		struct f2fs_dentry_ptr *d, void *src, int type)
291
{
292 293
	d->inode = inode;

294 295 296 297 298 299 300 301 302 303 304 305 306 307 308
	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;
	}
}

309 310 311 312 313 314 315
/*
 * 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)
316 317 318 319 320
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 已提交
321
					 * by get_data_block.
322
					 */
323 324
};

325
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
326

327 328
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

329 330 331
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

332
/* for in-memory extent cache entry */
333 334 335 336
#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
337

338
struct extent_info {
339 340 341 342 343 344 345 346 347 348 349 350 351 352
	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 */
};

struct extent_tree {
	nid_t ino;			/* inode number */
	struct rb_root root;		/* root of extent info rb-tree */
353
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
354
	struct extent_info largest;	/* largested extent info */
355 356 357
	rwlock_t lock;			/* protect extent info rb-tree */
	atomic_t refcount;		/* reference count of rb-tree */
	unsigned int count;		/* # of extent node in rb-tree*/
358 359
};

J
Jaegeuk Kim 已提交
360 361 362 363 364 365 366
/*
 * 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)
367 368 369
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
370 371 372 373 374 375 376 377

struct f2fs_map_blocks {
	block_t m_pblk;
	block_t m_lblk;
	unsigned int m_len;
	unsigned int m_flags;
};

378 379 380 381
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
382
#define FADVISE_LOST_PINO_BIT	0x02
383
#define FADVISE_ENCRYPT_BIT	0x04
384
#define FADVISE_ENC_NAME_BIT	0x08
385

386 387 388 389 390 391
#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)
392 393 394
#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)
395 396
#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)
397 398 399 400 401 402 403

/* Encryption algorithms */
#define F2FS_ENCRYPTION_MODE_INVALID		0
#define F2FS_ENCRYPTION_MODE_AES_256_XTS	1
#define F2FS_ENCRYPTION_MODE_AES_256_GCM	2
#define F2FS_ENCRYPTION_MODE_AES_256_CBC	3
#define F2FS_ENCRYPTION_MODE_AES_256_CTS	4
404

405 406
#include "f2fs_crypto.h"

407 408
#define DEF_DIR_LEVEL		0

409 410 411 412
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 */
413
	unsigned char i_dir_level;	/* use for dentry level for large dir */
414
	unsigned int i_current_depth;	/* use only in directory structure */
415
	unsigned int i_pino;		/* parent inode number */
416 417 418 419
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
420
	struct rw_semaphore i_sem;	/* protect fi info */
421
	atomic_t dirty_pages;		/* # of dirty pages */
422 423 424
	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 */
425
	unsigned long long xattr_ver;	/* cp version of xattr modification */
426
	struct inode_entry *dirty_dir;	/* the pointer of dirty dir */
J
Jaegeuk Kim 已提交
427 428 429

	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
430

J
Jaegeuk Kim 已提交
431 432
	struct extent_tree *extent_tree;	/* cached extent_tree entry */

433 434 435 436
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	/* Encryption params */
	struct f2fs_crypt_info *i_crypt_info;
#endif
437 438 439 440 441 442
};

static inline void get_extent_info(struct extent_info *ext,
					struct f2fs_extent i_ext)
{
	ext->fofs = le32_to_cpu(i_ext.fofs);
443
	ext->blk = le32_to_cpu(i_ext.blk);
444 445 446 447 448 449 450
	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);
451
	i_ext->blk = cpu_to_le32(ext->blk);
452 453 454
	i_ext->len = cpu_to_le32(ext->len);
}

455 456 457 458 459 460 461 462
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;
}

463 464 465 466 467 468 469
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);
}

470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488
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);
}

489 490 491
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
492
	nid_t available_nids;		/* maximum available node ids */
493
	nid_t next_scan_nid;		/* the next nid to be scanned */
494
	unsigned int ram_thresh;	/* control the memory footprint */
495 496 497

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
498
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
499
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
500
	struct list_head nat_entries;	/* cached nat entry list (clean) */
501
	unsigned int nat_cnt;		/* the # of cached nat entries */
502
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
503 504

	/* free node ids management */
505
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
506 507 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
	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 */
	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)
{
534
	memset(dn, 0, sizeof(*dn));
535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564
	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 */
565 566
	NO_CHECK_TYPE,
	CURSEG_DIRECT_IO,	/* to use for the direct IO path */
567 568
};

569 570
struct flush_cmd {
	struct completion wait;
571
	struct llist_node llnode;
572 573 574
	int ret;
};

575 576 577
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
578 579
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
580 581
};

582 583 584 585 586 587 588 589 590 591 592 593 594 595
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 */
596 597 598

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
599 600 601 602 603

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

J
Jaegeuk Kim 已提交
605 606 607
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

608 609
	struct list_head sit_entry_set;	/* sit entry set list */

610 611
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
612
	unsigned int min_fsync_blocks;	/* threshold for fsync */
613 614

	/* for flush command control */
615 616
	struct flush_cmd_control *cmd_control_info;

617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632
};

/*
 * 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,
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
633
	F2FS_INMEM_PAGES,
634 635 636 637
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
638
 * The below are the page types of bios used in submit_bio().
639 640 641 642 643 644 645 646 647
 * 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.
 */
648
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
649 650 651 652 653 654
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
655 656 657 658
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
	IPU,
	OPU,
659 660
};

J
Jaegeuk Kim 已提交
661
struct f2fs_io_info {
662
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
663 664
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
	int rw;			/* contains R/RS/W/WS with REQ_META/REQ_PRIO */
665
	block_t blk_addr;	/* block address to be written */
666
	struct page *page;	/* page to be written */
667
	struct page *encrypted_page;	/* encrypted page */
J
Jaegeuk Kim 已提交
668 669
};

670
#define is_read_io(rw)	(((rw) & 1) == READ)
671
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
672
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
673 674
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
675
	struct f2fs_io_info fio;	/* store buffered io info. */
676
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
677 678
};

679 680 681 682 683 684 685 686
/* 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 */
};

687 688 689 690 691 692 693 694
/* 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 */
};

695 696
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
697
	struct proc_dir_entry *s_proc;		/* proc entry */
698 699
	struct buffer_head *raw_super_buf;	/* buffer head of raw sb */
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
700
	int s_flag;				/* flags for sbi */
701 702 703 704 705 706 707

	/* 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 */
708 709

	/* for bio operations */
710
	struct f2fs_bio_info read_io;			/* for read bios */
711
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
712 713 714 715

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
	struct inode *meta_inode;		/* cache meta blocks */
716
	struct mutex cp_mutex;			/* checkpoint procedure lock */
717
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
718
	struct rw_semaphore node_write;		/* locking node writes */
719
	struct mutex writepages;		/* mutex for writepages() */
720
	wait_queue_head_t cp_wait;
721

722
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
723 724

	/* for orphan inode, use 0'th array */
725
	unsigned int max_orphans;		/* max orphan inodes */
726 727 728 729 730

	/* for directory inode management */
	struct list_head dir_inode_list;	/* dir inode list */
	spinlock_t dir_inode_lock;		/* for dir inode list lock */

731 732 733 734 735 736 737 738
	/* 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 */
	int total_ext_tree;			/* extent tree count */
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
739
	/* basic filesystem units */
740 741 742 743 744 745 746 747 748 749 750 751 752 753 754
	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 */
	int active_logs;			/* # of active logs */
755
	int dir_level;				/* directory level */
756 757 758 759

	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 */
760
	block_t discard_blks;			/* discard command candidats */
761 762 763 764 765 766 767 768 769
	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 */
770
	unsigned int cur_victim_sec;		/* current victim section num */
771

772 773 774
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

775 776 777 778
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
779
#ifdef CONFIG_F2FS_STAT_FS
780 781 782
	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 */
783
	atomic_t inplace_count;		/* # of inplace update */
784 785
	atomic_t total_hit_ext;			/* # of lookup extent cache */
	atomic_t read_hit_ext;			/* # of hit extent cache */
C
Chao Yu 已提交
786
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
787 788
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
789
	int bg_gc;				/* background gc calls */
790 791 792
	unsigned int n_dirty_dirs;		/* # of dir inodes */
#endif
	unsigned int last_victim[2];		/* last victim segment # */
793
	spinlock_t stat_lock;			/* lock for stat operations */
794 795 796 797

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
798 799 800 801 802

	/* For shrinker support */
	struct list_head s_list;
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
803 804 805 806 807 808 809 810 811 812 813 814 815 816 817
};

/*
 * Inline functions
 */
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;
}

818 819 820 821 822 823 824 825 826 827 828 829 830 831 832
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);
}

833 834 835 836 837 838 839 840 841 842
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);
}

843 844 845 846 847
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

848 849 850 851 852
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877
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 已提交
878 879 880 881 882
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

883 884 885 886 887
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

888 889 890 891 892 893
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)
894
{
895
	sbi->s_flag |= (0x01 << type);
896 897
}

898
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
899
{
900
	sbi->s_flag &= ~(0x01 << type);
901 902
}

903 904 905 906 907
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927
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);
}

928
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
929
{
930
	down_read(&sbi->cp_rwsem);
931 932
}

933
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
934
{
935
	up_read(&sbi->cp_rwsem);
936 937
}

938
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
939
{
J
Jaegeuk Kim 已提交
940
	f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
941 942
}

943
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
944
{
945
	up_write(&sbi->cp_rwsem);
946 947
}

948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969
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));
}

970 971 972
/*
 * Check whether the given nid is within node id range.
 */
973
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
974
{
975 976
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
977
	if (unlikely(nid >= NM_I(sbi)->max_nid))
978 979
		return -EINVAL;
	return 0;
980 981 982 983 984 985 986 987 988 989
}

#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 已提交
990
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
991
	else
C
Chris Fries 已提交
992
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
993 994
}

995 996 997 998 999
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1000 1001 1002 1003 1004 1005 1006 1007
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;
1008
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1009 1010 1011 1012 1013 1014 1015 1016 1017 1018
		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;
}

1019
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1020 1021 1022 1023
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1024 1025
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1026 1027 1028 1029 1030 1031 1032 1033
	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]);
1034
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1035 1036
}

1037
static inline void inode_inc_dirty_pages(struct inode *inode)
1038
{
1039 1040 1041
	atomic_inc(&F2FS_I(inode)->dirty_pages);
	if (S_ISDIR(inode->i_mode))
		inc_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
1042 1043 1044 1045 1046 1047 1048
}

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

1049
static inline void inode_dec_dirty_pages(struct inode *inode)
1050
{
1051 1052
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1053 1054
		return;

1055 1056 1057 1058
	atomic_dec(&F2FS_I(inode)->dirty_pages);

	if (S_ISDIR(inode->i_mode))
		dec_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
1059 1060 1061 1062 1063 1064 1065
}

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

1066
static inline int get_dirty_pages(struct inode *inode)
1067
{
1068
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1069 1070
}

1071 1072 1073 1074 1075 1076 1077 1078
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
	unsigned int pages_per_sec = sbi->segs_per_sec *
					(1 << sbi->log_blocks_per_seg);
	return ((get_pages(sbi, block_type) + pages_per_sec - 1)
			>> sbi->log_blocks_per_seg) / sbi->segs_per_sec;
}

1079 1080
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1081
	return sbi->total_valid_block_count;
1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096
}

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 已提交
1097 1098 1099 1100 1101
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1102 1103 1104
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1105 1106
	int offset;

W
Wanpeng Li 已提交
1107
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1108 1109 1110
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1111
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1112 1113
	} else {
		offset = (flag == NAT_BITMAP) ?
1114
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1115 1116
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1117 1118 1119 1120 1121 1122
}

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

1125
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1126 1127 1128

	/*
	 * odd numbered checkpoint should at cp segment 0
A
arter97 已提交
1129
	 * and even segment must be at cp segment 1
1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142
	 */
	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,
1143
						struct inode *inode)
1144 1145 1146 1147 1148 1149
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1150
	valid_block_count = sbi->total_valid_block_count + 1;
1151
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1152 1153 1154 1155
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1156
	valid_node_count = sbi->total_valid_node_count + 1;
1157
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1158 1159 1160 1161 1162
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1163 1164 1165 1166 1167
		inode->i_blocks++;

	sbi->alloc_valid_block_count++;
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1168 1169 1170 1171 1172 1173
	spin_unlock(&sbi->stat_lock);

	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1174
						struct inode *inode)
1175 1176 1177
{
	spin_lock(&sbi->stat_lock);

1178 1179 1180
	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);
1181

1182 1183 1184
	inode->i_blocks--;
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1185 1186 1187 1188 1189 1190

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1191
	return sbi->total_valid_node_count;
1192 1193 1194 1195 1196
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
	spin_lock(&sbi->stat_lock);
1197
	f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
1198 1199 1200 1201
	sbi->total_valid_inode_count++;
	spin_unlock(&sbi->stat_lock);
}

1202
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1203 1204
{
	spin_lock(&sbi->stat_lock);
1205
	f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
1206 1207 1208 1209 1210 1211
	sbi->total_valid_inode_count--;
	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
{
1212
	return sbi->total_valid_inode_count;
1213 1214 1215 1216
}

static inline void f2fs_put_page(struct page *page, int unlock)
{
1217
	if (!page)
1218 1219 1220
		return;

	if (unlock) {
1221
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237
		unlock_page(page);
	}
	page_cache_release(page);
}

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,
1238
					size_t size)
1239
{
1240
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1241 1242
}

1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;
retry:
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry) {
		cond_resched();
		goto retry;
	}

	return entry;
}

J
Jaegeuk Kim 已提交
1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
retry:
	bio = bio_alloc(GFP_NOIO, npages);
	if (!bio) {
		cond_resched();
		goto retry;
	}
	return bio;
}

1271 1272 1273 1274 1275 1276 1277
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();
}

1278 1279 1280 1281
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1282
	struct f2fs_node *p = F2FS_NODE(page);
1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295
	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;
1296
	raw_node = F2FS_NODE(node_page);
1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309
	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;
}

1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327
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;
}

1328
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339
{
	int mask;
	int ret;

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

1340
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351
{
	int mask;
	int ret;

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

1352 1353 1354 1355 1356 1357 1358 1359 1360
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1361 1362 1363
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1364
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1365
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1366 1367 1368
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1369
	FI_FREE_NID,		/* free allocated nide */
1370
	FI_UPDATE_DIR,		/* should update inode block for consistency */
1371
	FI_DELAY_IPUT,		/* used for the recovery */
1372
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1373
	FI_INLINE_XATTR,	/* used for inline xattr */
1374
	FI_INLINE_DATA,		/* used for inline data*/
1375
	FI_INLINE_DENTRY,	/* used for inline dentry */
1376 1377
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1378 1379
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
1380
	FI_VOLATILE_FILE,	/* indicate volatile file */
1381
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1382
	FI_DROP_CACHE,		/* drop dirty page cache */
1383
	FI_DATA_EXIST,		/* indicate data exists */
1384
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
1385 1386 1387 1388
};

static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
{
J
Jaegeuk Kim 已提交
1389 1390
	if (!test_bit(flag, &fi->flags))
		set_bit(flag, &fi->flags);
1391 1392 1393 1394 1395 1396 1397 1398 1399
}

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 已提交
1400 1401
	if (test_bit(flag, &fi->flags))
		clear_bit(flag, &fi->flags);
1402 1403 1404 1405 1406 1407 1408 1409
}

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 已提交
1410 1411 1412 1413 1414
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);
1415 1416
	if (ri->i_inline & F2FS_INLINE_DATA)
		set_inode_flag(fi, FI_INLINE_DATA);
1417 1418
	if (ri->i_inline & F2FS_INLINE_DENTRY)
		set_inode_flag(fi, FI_INLINE_DENTRY);
1419 1420
	if (ri->i_inline & F2FS_DATA_EXIST)
		set_inode_flag(fi, FI_DATA_EXIST);
1421 1422
	if (ri->i_inline & F2FS_INLINE_DOTS)
		set_inode_flag(fi, FI_INLINE_DOTS);
J
Jaegeuk Kim 已提交
1423 1424 1425 1426 1427 1428 1429 1430 1431
}

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;
1432 1433
	if (is_inode_flag_set(fi, FI_INLINE_DATA))
		ri->i_inline |= F2FS_INLINE_DATA;
1434 1435
	if (is_inode_flag_set(fi, FI_INLINE_DENTRY))
		ri->i_inline |= F2FS_INLINE_DENTRY;
1436 1437
	if (is_inode_flag_set(fi, FI_DATA_EXIST))
		ri->i_inline |= F2FS_DATA_EXIST;
1438 1439
	if (is_inode_flag_set(fi, FI_INLINE_DOTS))
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1440 1441
}

1442 1443 1444 1445 1446
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
}

1447 1448
static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
{
1449
	if (f2fs_has_inline_xattr(&fi->vfs_inode))
1450 1451 1452 1453
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1454 1455
static inline void *inline_xattr_addr(struct page *page)
{
1456
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1457 1458 1459 1460 1461 1462
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1463
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1464 1465 1466 1467 1468
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1469 1470 1471 1472 1473
static inline int f2fs_has_inline_data(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
}

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

1485 1486 1487 1488 1489
static inline int f2fs_has_inline_dots(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DOTS);
}

J
Jaegeuk Kim 已提交
1490 1491 1492 1493 1494
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_ATOMIC_FILE);
}

1495 1496 1497 1498 1499
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_VOLATILE_FILE);
}

1500 1501 1502 1503 1504
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
}

1505 1506 1507 1508 1509
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_DROP_CACHE);
}

1510 1511
static inline void *inline_data_addr(struct page *page)
{
1512
	struct f2fs_inode *ri = F2FS_INODE(page);
1513 1514 1515
	return (void *)&(ri->i_addr[1]);
}

1516 1517 1518 1519 1520
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DENTRY);
}

1521 1522 1523 1524 1525 1526
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541
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 已提交
1542 1543 1544 1545 1546
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1547 1548 1549 1550 1551
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

1552 1553 1554 1555 1556 1557
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;
}

1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568
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 已提交
1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	mode_t mode = inode->i_mode;

	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
			is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT))
		return false;

	return S_ISREG(mode);
}

1580 1581 1582 1583
#define get_inode_mode(i) \
	((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1584 1585 1586 1587 1588 1589
/* get offset of first page in next direct node */
#define PGOFS_OF_NEXT_DNODE(pgofs, fi)				\
	((pgofs < ADDRS_PER_INODE(fi)) ? ADDRS_PER_INODE(fi) :	\
	(pgofs - ADDRS_PER_INODE(fi) + ADDRS_PER_BLOCK) /	\
	ADDRS_PER_BLOCK * ADDRS_PER_BLOCK + ADDRS_PER_INODE(fi))

1590 1591 1592 1593 1594
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1595
int truncate_blocks(struct inode *, u64, bool);
1596
void f2fs_truncate(struct inode *, bool);
1597
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1598 1599
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1600
int truncate_data_blocks_range(struct dnode_of_data *, int);
1601
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1602
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1603 1604 1605 1606 1607 1608

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1609
int try_to_free_nats(struct f2fs_sb_info *, int);
1610
void update_inode(struct inode *, struct page *);
1611
void update_inode_page(struct inode *);
1612 1613
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1614
void handle_failed_inode(struct inode *);
1615 1616 1617 1618 1619 1620 1621 1622 1623

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

/*
 * dir.c
 */
1624
extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
1625
void set_de_type(struct f2fs_dir_entry *, umode_t);
1626 1627 1628

struct f2fs_dir_entry *find_target_dentry(struct f2fs_filename *,
			f2fs_hash_t, int *, struct f2fs_dentry_ptr *);
1629
bool f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
1630
			unsigned int, struct f2fs_str *);
1631 1632
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
1633
struct page *init_inode_metadata(struct inode *, struct inode *,
1634
			const struct qstr *, struct page *);
1635
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
1636
int room_for_filename(const void *, int, int);
1637
void f2fs_drop_nlink(struct inode *, struct inode *, struct page *);
1638 1639 1640 1641 1642 1643
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 *);
1644
int update_dent_inode(struct inode *, struct inode *, const struct qstr *);
1645
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
1646
			const struct qstr *, f2fs_hash_t , unsigned int);
1647 1648
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
1649 1650
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
1651
int f2fs_do_tmpfile(struct inode *, struct inode *);
1652 1653
bool f2fs_empty_dir(struct inode *);

1654 1655
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
1656
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
1657
				inode, inode->i_ino, inode->i_mode);
1658 1659
}

1660 1661 1662
/*
 * super.c
 */
C
Chao Yu 已提交
1663
int f2fs_commit_super(struct f2fs_sb_info *, bool);
1664
int f2fs_sync_fs(struct super_block *, int);
1665 1666
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
1667 1668 1669 1670

/*
 * hash.c
 */
1671
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1672 1673 1674 1675 1676 1677 1678

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

1679
bool available_free_memory(struct f2fs_sb_info *, int);
J
Jaegeuk Kim 已提交
1680
int need_dentry_mark(struct f2fs_sb_info *, nid_t);
1681 1682
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
1683 1684 1685
void get_node_info(struct f2fs_sb_info *, nid_t, struct node_info *);
int get_dnode_of_data(struct dnode_of_data *, pgoff_t, int);
int truncate_inode_blocks(struct inode *, pgoff_t);
1686
int truncate_xattr_node(struct inode *, struct page *);
1687
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
G
Gu Zheng 已提交
1688
void remove_inode_page(struct inode *);
1689
struct page *new_inode_page(struct inode *);
1690
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
1691 1692 1693 1694 1695 1696 1697 1698
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 *);
int sync_node_pages(struct f2fs_sb_info *, nid_t, struct writeback_control *);
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 已提交
1699
int try_to_free_nids(struct f2fs_sb_info *, int);
1700
void recover_inline_xattr(struct inode *, struct page *);
1701
void recover_xattr_data(struct inode *, struct page *, block_t);
1702 1703 1704 1705 1706 1707
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 *);
1708
int __init create_node_manager_caches(void);
1709 1710 1711 1712 1713
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
1714
void register_inmem_page(struct inode *, struct page *);
1715
int commit_inmem_pages(struct inode *, bool);
1716
void f2fs_balance_fs(struct f2fs_sb_info *);
1717
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
1718
int f2fs_issue_flush(struct f2fs_sb_info *);
1719 1720
int create_flush_cmd_control(struct f2fs_sb_info *);
void destroy_flush_cmd_control(struct f2fs_sb_info *);
1721
void invalidate_blocks(struct f2fs_sb_info *, block_t);
1722
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
1723
void clear_prefree_segments(struct f2fs_sb_info *, struct cp_control *);
1724
void release_discard_addrs(struct f2fs_sb_info *);
C
Chao Yu 已提交
1725
bool discard_next_dnode(struct f2fs_sb_info *, block_t);
1726
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
1727
void allocate_new_segments(struct f2fs_sb_info *);
1728
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
1729
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
C
Chao Yu 已提交
1730
void update_meta_page(struct f2fs_sb_info *, void *, block_t);
1731
void write_meta_page(struct f2fs_sb_info *, struct page *);
1732 1733 1734
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 *);
1735 1736
void f2fs_replace_block(struct f2fs_sb_info *, struct dnode_of_data *,
				block_t, block_t, unsigned char, bool);
1737 1738
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
1739
void f2fs_wait_on_page_writeback(struct page *, enum page_type);
1740 1741 1742 1743
void write_data_summaries(struct f2fs_sb_info *, block_t);
void write_node_summaries(struct f2fs_sb_info *, block_t);
int lookup_journal_in_cursum(struct f2fs_summary_block *,
					int, unsigned int, int);
1744
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
1745 1746
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
1747 1748
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
1749 1750 1751 1752 1753 1754

/*
 * checkpoint.c
 */
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
1755
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
1756
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int);
1757
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
1758
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
1759 1760
void add_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
void remove_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
1761
void release_dirty_inode(struct f2fs_sb_info *);
1762
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
J
Jaegeuk Kim 已提交
1763 1764
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
1765 1766
void add_orphan_inode(struct f2fs_sb_info *, nid_t);
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
1767
int recover_orphan_inodes(struct f2fs_sb_info *);
1768
int get_valid_checkpoint(struct f2fs_sb_info *);
1769
void update_dirty_page(struct inode *, struct page *);
1770
void add_dirty_dir_inode(struct inode *);
1771 1772
void remove_dirty_dir_inode(struct inode *);
void sync_dirty_dir_inodes(struct f2fs_sb_info *);
1773
void write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
1774
void init_ino_entry_info(struct f2fs_sb_info *);
1775
int __init create_checkpoint_caches(void);
1776 1777 1778 1779 1780
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
1781
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
1782 1783
int f2fs_submit_page_bio(struct f2fs_io_info *);
void f2fs_submit_page_mbio(struct f2fs_io_info *);
1784
void set_data_blkaddr(struct dnode_of_data *);
1785
int reserve_new_block(struct dnode_of_data *);
1786
int f2fs_get_block(struct dnode_of_data *, pgoff_t);
1787
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
1788 1789
struct page *get_read_data_page(struct inode *, pgoff_t, int);
struct page *find_data_page(struct inode *, pgoff_t);
1790
struct page *get_lock_data_page(struct inode *, pgoff_t);
1791
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
1792
int do_write_data_page(struct f2fs_io_info *);
J
Jaegeuk Kim 已提交
1793
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
1794 1795
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
1796 1797 1798 1799 1800 1801

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
1802
block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
J
Jaegeuk Kim 已提交
1803
int f2fs_gc(struct f2fs_sb_info *);
1804 1805 1806 1807 1808
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
1809
int recover_fsync_data(struct f2fs_sb_info *);
1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820
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;
1821
	int hit_ext, total_ext, ext_tree, ext_node;
1822
	int ndirty_node, ndirty_dent, ndirty_dirs, ndirty_meta;
1823
	int nats, dirty_nats, sits, dirty_sits, fnids;
1824
	int total_count, utilization;
C
Chao Yu 已提交
1825 1826
	int bg_gc, inmem_pages, wb_pages;
	int inline_xattr, inline_inode, inline_dir;
1827 1828 1829 1830 1831
	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;
1832
	int prefree_count, call_count, cp_count;
1833
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
1834
	int bg_node_segs, bg_data_segs;
1835
	int tot_blks, data_blks, node_blks;
1836
	int bg_data_blks, bg_node_blks;
1837 1838 1839 1840 1841 1842
	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];
1843
	unsigned int inplace_count;
1844
	unsigned base_mem, cache_mem, page_mem;
1845 1846
};

1847 1848
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
1849
	return (struct f2fs_stat_info *)sbi->stat_info;
1850 1851
}

1852
#define stat_inc_cp_count(si)		((si)->cp_count++)
1853 1854 1855 1856
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
#define stat_inc_dirty_dir(sbi)		((sbi)->n_dirty_dirs++)
#define stat_dec_dirty_dir(sbi)		((sbi)->n_dirty_dirs--)
1857 1858
#define stat_inc_total_hit(sbi)		(atomic_inc(&(sbi)->total_hit_ext))
#define stat_inc_read_hit(sbi)		(atomic_inc(&(sbi)->read_hit_ext))
C
Chao Yu 已提交
1859 1860 1861 1862 1863 1864 1865 1866 1867 1868
#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)
1869 1870 1871
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1872
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
1873 1874 1875 1876
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1877
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
1878
	} while (0)
1879 1880 1881
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1882
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
1883 1884 1885 1886
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1887
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
1888
	} while (0)
1889 1890 1891 1892
#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]++)
1893 1894
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
1895
#define stat_inc_seg_count(sbi, type, gc_type)				\
1896
	do {								\
1897
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1898
		(si)->tot_segs++;					\
1899
		if (type == SUM_TYPE_DATA) {				\
1900
			si->data_segs++;				\
1901 1902
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
1903
			si->node_segs++;				\
1904 1905
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
1906 1907 1908 1909 1910
	} while (0)

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

1911
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
1912
	do {								\
1913
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1914 1915
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
1916
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
1917 1918
	} while (0)

1919
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
1920
	do {								\
1921
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1922 1923
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
1924
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
1925 1926 1927 1928
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
1929
void __init f2fs_create_root_stats(void);
1930
void f2fs_destroy_root_stats(void);
1931
#else
1932
#define stat_inc_cp_count(si)
1933
#define stat_inc_call_count(si)
1934 1935 1936 1937 1938
#define stat_inc_bggc_count(si)
#define stat_inc_dirty_dir(sbi)
#define stat_dec_dirty_dir(sbi)
#define stat_inc_total_hit(sb)
#define stat_inc_read_hit(sb)
C
Chao Yu 已提交
1939 1940
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
1941 1942
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
1943 1944
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
1945 1946
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
1947
#define stat_inc_inplace_blocks(sbi)
1948
#define stat_inc_seg_count(sbi, type, gc_type)
1949
#define stat_inc_tot_blk_count(si, blks)
1950 1951
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
1952 1953 1954

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
1955
static inline void __init f2fs_create_root_stats(void) { }
1956
static inline void f2fs_destroy_root_stats(void) { }
1957 1958 1959 1960 1961 1962 1963 1964 1965 1966
#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;
1967
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
1968
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
1969
extern struct kmem_cache *inode_entry_slab;
1970

1971 1972 1973
/*
 * inline.c
 */
1974 1975
bool f2fs_may_inline_data(struct inode *);
bool f2fs_may_inline_dentry(struct inode *);
1976
void read_inline_data(struct page *, struct page *);
1977
bool truncate_inline_inode(struct page *, u64);
1978
int f2fs_read_inline_data(struct inode *, struct page *);
1979 1980 1981
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 *);
1982
bool recover_inline_data(struct inode *, struct page *);
1983 1984
struct f2fs_dir_entry *find_in_inline_dir(struct inode *,
				struct f2fs_filename *, struct page **);
1985 1986
struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *, struct page **);
int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
1987 1988
int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *,
						nid_t, umode_t);
1989 1990 1991
void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
						struct inode *, struct inode *);
bool f2fs_empty_inline_dir(struct inode *);
1992 1993
int f2fs_read_inline_dir(struct file *, struct dir_context *,
						struct f2fs_str *);
1994

1995 1996 1997 1998 1999 2000 2001 2002
/*
 * 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 *);

2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016
/*
 * extent_cache.c
 */
unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
void f2fs_drop_largest_extent(struct inode *, pgoff_t);
void f2fs_init_extent_tree(struct inode *, struct f2fs_extent *);
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 *);
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052
/*
 * crypto support
 */
static inline int f2fs_encrypted_inode(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	return file_is_encrypt(inode);
#else
	return 0;
#endif
}

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)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	return unlikely(bio->bi_private != NULL);
#else
	return false;
#endif
}

static inline int f2fs_sb_has_crypto(struct super_block *sb)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_ENCRYPT);
#else
	return 0;
#endif
}
2053

2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	mode_t mode = inode->i_mode;

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

2065 2066 2067 2068 2069 2070
/* crypto_policy.c */
int f2fs_is_child_context_consistent_with_parent(struct inode *,
							struct inode *);
int f2fs_inherit_context(struct inode *, struct inode *, struct page *);
int f2fs_process_policy(const struct f2fs_encryption_policy *, struct inode *);
int f2fs_get_policy(struct inode *, struct f2fs_encryption_policy *);
2071 2072

/* crypt.c */
J
Jaegeuk Kim 已提交
2073
extern struct kmem_cache *f2fs_crypt_info_cachep;
2074 2075 2076 2077 2078 2079 2080 2081 2082
bool f2fs_valid_contents_enc_mode(uint32_t);
uint32_t f2fs_validate_encryption_key_size(uint32_t, uint32_t);
struct f2fs_crypto_ctx *f2fs_get_crypto_ctx(struct inode *);
void f2fs_release_crypto_ctx(struct f2fs_crypto_ctx *);
struct page *f2fs_encrypt(struct inode *, struct page *);
int f2fs_decrypt(struct f2fs_crypto_ctx *, struct page *);
int f2fs_decrypt_one(struct inode *, struct page *);
void f2fs_end_io_crypto_work(struct f2fs_crypto_ctx *, struct bio *);

2083
/* crypto_key.c */
2084
void f2fs_free_encryption_info(struct inode *, struct f2fs_crypt_info *);
2085 2086
int _f2fs_get_encryption_info(struct inode *inode);

2087 2088 2089 2090 2091 2092 2093 2094 2095
/* crypto_fname.c */
bool f2fs_valid_filenames_enc_mode(uint32_t);
u32 f2fs_fname_crypto_round_up(u32, u32);
int f2fs_fname_crypto_alloc_buffer(struct inode *, u32, struct f2fs_str *);
int f2fs_fname_disk_to_usr(struct inode *, f2fs_hash_t *,
			const struct f2fs_str *, struct f2fs_str *);
int f2fs_fname_usr_to_disk(struct inode *, const struct qstr *,
			struct f2fs_str *);

2096 2097 2098 2099
#ifdef CONFIG_F2FS_FS_ENCRYPTION
void f2fs_restore_and_release_control_page(struct page **);
void f2fs_restore_control_page(struct page *);

2100 2101
int __init f2fs_init_crypto(void);
int f2fs_crypto_initialize(void);
2102
void f2fs_exit_crypto(void);
2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117

int f2fs_has_encryption_key(struct inode *);

static inline int f2fs_get_encryption_info(struct inode *inode)
{
	struct f2fs_crypt_info *ci = F2FS_I(inode)->i_crypt_info;

	if (!ci ||
		(ci->ci_keyring_key &&
		 (ci->ci_keyring_key->flags & ((1 << KEY_FLAG_INVALIDATED) |
					       (1 << KEY_FLAG_REVOKED) |
					       (1 << KEY_FLAG_DEAD)))))
		return _f2fs_get_encryption_info(inode);
	return 0;
}
2118 2119 2120 2121 2122

void f2fs_fname_crypto_free_buffer(struct f2fs_str *);
int f2fs_fname_setup_filename(struct inode *, const struct qstr *,
				int lookup, struct f2fs_filename *);
void f2fs_fname_free_filename(struct f2fs_filename *);
2123 2124 2125 2126
#else
static inline void f2fs_restore_and_release_control_page(struct page **p) { }
static inline void f2fs_restore_control_page(struct page *p) { }

2127
static inline int __init f2fs_init_crypto(void) { return 0; }
2128
static inline void f2fs_exit_crypto(void) { }
2129 2130 2131

static inline int f2fs_has_encryption_key(struct inode *i) { return 0; }
static inline int f2fs_get_encryption_info(struct inode *i) { return 0; }
2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145
static inline void f2fs_fname_crypto_free_buffer(struct f2fs_str *p) { }

static inline int f2fs_fname_setup_filename(struct inode *dir,
					const struct qstr *iname,
					int lookup, struct f2fs_filename *fname)
{
	memset(fname, 0, sizeof(struct f2fs_filename));
	fname->usr_fname = iname;
	fname->disk_name.name = (unsigned char *)iname->name;
	fname->disk_name.len = iname->len;
	return 0;
}

static inline void f2fs_fname_free_filename(struct f2fs_filename *fname) { }
2146
#endif
2147
#endif