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

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

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

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

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

struct f2fs_mount_info {
	unsigned int	opt;
};

73 74 75 76 77 78 79
#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 已提交
80 81 82
#define CRCPOLY_LE 0xedb88320

static inline __u32 f2fs_crc32(void *buf, size_t len)
83
{
J
Jaegeuk Kim 已提交
84 85 86 87 88 89 90 91 92 93
	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;
94 95
}

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

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

109 110
enum {
	CP_UMOUNT,
111
	CP_FASTBOOT,
112
	CP_SYNC,
113
	CP_RECOVERY,
114
	CP_DISCARD,
115 116
};

J
Jaegeuk Kim 已提交
117 118 119 120
#define DEF_BATCHED_TRIM_SECTIONS	32
#define BATCHED_TRIM_SEGMENTS(sbi)	\
		(SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)

121 122
struct cp_control {
	int reason;
123 124 125 126
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
127 128
};

129
/*
130
 * For CP/NAT/SIT/SSA readahead
131 132 133 134
 */
enum {
	META_CP,
	META_NAT,
135
	META_SIT,
136 137
	META_SSA,
	META_POR,
138 139
};

J
Jaegeuk Kim 已提交
140 141 142
/* for the list of ino */
enum {
	ORPHAN_INO,		/* for orphan ino list */
143 144
	APPEND_INO,		/* for append ino list */
	UPDATE_INO,		/* for update ino list */
J
Jaegeuk Kim 已提交
145 146 147 148
	MAX_INO_ENTRY,		/* max. list */
};

struct ino_entry {
149 150 151 152
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

153 154 155 156 157 158 159 160
/*
 * 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 {
161 162 163 164
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

165 166 167 168 169 170 171
/* 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 */
};

172 173 174 175
/* 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 */
176 177 178
	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 */
179 180 181 182 183 184 185 186 187 188
};

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

189 190 191
#define MAX_NAT_JENTRIES(sum)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(sum))
#define MAX_SIT_JENTRIES(sum)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(sum))

192 193 194 195 196 197 198 199 200 201 202 203 204 205
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;
}

206 207 208 209
static inline bool __has_cursum_space(struct f2fs_summary_block *sum, int size,
								int type)
{
	if (type == NAT_JOURNAL)
210 211
		return size <= MAX_NAT_JENTRIES(sum);
	return size <= MAX_SIT_JENTRIES(sum);
212 213
}

214 215 216
/*
 * ioctl commands
 */
J
Jaegeuk Kim 已提交
217 218
#define F2FS_IOC_GETFLAGS		FS_IOC_GETFLAGS
#define F2FS_IOC_SETFLAGS		FS_IOC_SETFLAGS
C
Chao Yu 已提交
219
#define F2FS_IOC_GETVERSION		FS_IOC_GETVERSION
J
Jaegeuk Kim 已提交
220 221 222 223

#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)
224
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
225 226
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
227

J
Jaegeuk Kim 已提交
228 229 230 231 232 233 234 235 236
/*
 * 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 */

237 238 239 240 241 242 243 244
#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

245 246 247
/*
 * For INODE and NODE manager
 */
248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273
/* for directory operations */
struct f2fs_dentry_ptr {
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

static inline void make_dentry_ptr(struct f2fs_dentry_ptr *d,
					void *src, int type)
{
	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;
	}
}

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

290 291
#define F2FS_LINK_MAX		32000	/* maximum link count per file */

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

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

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

303
struct extent_info {
304 305 306 307 308 309 310 311 312 313 314 315 316 317
	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 */
318
	struct extent_node *cached_en;	/* recently accessed extent node */
319 320 321
	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*/
322 323
};

J
Jaegeuk Kim 已提交
324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
/*
 * 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)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED)

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

340 341 342 343
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
344
#define FADVISE_LOST_PINO_BIT	0x02
345

346 347 348 349 350 351 352
#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)

353 354
#define DEF_DIR_LEVEL		0

355 356 357 358
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 */
359
	unsigned char i_dir_level;	/* use for dentry level for large dir */
360
	unsigned int i_current_depth;	/* use only in directory structure */
361
	unsigned int i_pino;		/* parent inode number */
362 363 364 365
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
366
	struct rw_semaphore i_sem;	/* protect fi info */
367
	atomic_t dirty_pages;		/* # of dirty pages */
368 369 370
	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 */
371
	unsigned long long xattr_ver;	/* cp version of xattr modification */
372
	struct extent_info ext;		/* in-memory extent cache entry */
373
	rwlock_t ext_lock;		/* rwlock for single extent cache */
374
	struct inode_entry *dirty_dir;	/* the pointer of dirty dir */
J
Jaegeuk Kim 已提交
375

376
	struct radix_tree_root inmem_root;	/* radix tree for inmem pages */
J
Jaegeuk Kim 已提交
377 378
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
379 380 381 382 383 384
};

static inline void get_extent_info(struct extent_info *ext,
					struct f2fs_extent i_ext)
{
	ext->fofs = le32_to_cpu(i_ext.fofs);
385
	ext->blk = le32_to_cpu(i_ext.blk);
386 387 388 389 390 391 392
	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);
393
	i_ext->blk = cpu_to_le32(ext->blk);
394 395 396
	i_ext->len = cpu_to_le32(ext->len);
}

397 398 399 400 401 402 403 404
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;
}

405 406 407 408 409 410 411
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);
}

412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430
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);
}

431 432 433
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
434
	nid_t available_nids;		/* maximum available node ids */
435
	nid_t next_scan_nid;		/* the next nid to be scanned */
436
	unsigned int ram_thresh;	/* control the memory footprint */
437 438 439

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
440
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
441
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
442
	struct list_head nat_entries;	/* cached nat entry list (clean) */
443
	unsigned int nat_cnt;		/* the # of cached nat entries */
444
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
445 446

	/* free node ids management */
447
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475
	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)
{
476
	memset(dn, 0, sizeof(*dn));
477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506
	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 */
507 508
	NO_CHECK_TYPE,
	CURSEG_DIRECT_IO,	/* to use for the direct IO path */
509 510
};

511 512
struct flush_cmd {
	struct completion wait;
513
	struct llist_node llnode;
514 515 516
	int ret;
};

517 518 519
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
520 521
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
522 523
};

524 525 526 527 528 529 530 531 532 533 534 535 536 537
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 */
538 539 540

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
541 542 543 544 545

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

J
Jaegeuk Kim 已提交
547 548 549
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

550 551
	struct list_head sit_entry_set;	/* sit entry set list */

552 553
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
554
	unsigned int min_fsync_blocks;	/* threshold for fsync */
555 556

	/* for flush command control */
557 558
	struct flush_cmd_control *cmd_control_info;

559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574
};

/*
 * 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,
575
	F2FS_INMEM_PAGES,
576 577 578 579
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
580
 * The below are the page types of bios used in submit_bio().
581 582 583 584 585 586 587 588 589
 * 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.
 */
590
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
591 592 593 594 595 596
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
597 598 599 600
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
	IPU,
	OPU,
601 602
};

J
Jaegeuk Kim 已提交
603
struct f2fs_io_info {
604 605
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
	int rw;			/* contains R/RS/W/WS with REQ_META/REQ_PRIO */
606
	block_t blk_addr;	/* block address to be written */
J
Jaegeuk Kim 已提交
607 608
};

609
#define is_read_io(rw)	(((rw) & 1) == READ)
610
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
611
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
612 613
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
614
	struct f2fs_io_info fio;	/* store buffered io info. */
615
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
616 617
};

618 619 620 621 622 623 624 625
/* 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 */
};

626 627 628 629 630 631 632 633
/* 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 */
};

634 635
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
636
	struct proc_dir_entry *s_proc;		/* proc entry */
637 638
	struct buffer_head *raw_super_buf;	/* buffer head of raw sb */
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
639
	int s_flag;				/* flags for sbi */
640 641 642 643 644 645 646

	/* 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 */
647 648

	/* for bio operations */
649
	struct f2fs_bio_info read_io;			/* for read bios */
650
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
651 652 653 654

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
	struct inode *meta_inode;		/* cache meta blocks */
655
	struct mutex cp_mutex;			/* checkpoint procedure lock */
656
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
657
	struct rw_semaphore node_write;		/* locking node writes */
658
	struct mutex writepages;		/* mutex for writepages() */
659
	wait_queue_head_t cp_wait;
660

661
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
662 663

	/* for orphan inode, use 0'th array */
664
	unsigned int max_orphans;		/* max orphan inodes */
665 666 667 668 669

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

670 671 672 673 674 675 676 677
	/* 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 已提交
678
	/* basic filesystem units */
679 680 681 682 683 684 685 686 687 688 689 690 691 692 693
	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 */
694
	int dir_level;				/* directory level */
695 696 697 698 699 700 701 702 703 704 705 706 707

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

710 711 712
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

713 714 715 716
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
717
#ifdef CONFIG_F2FS_STAT_FS
718 719 720
	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 */
721
	atomic_t inplace_count;		/* # of inplace update */
722
	int total_hit_ext, read_hit_ext;	/* extent cache hit ratio */
723 724
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
725
	int bg_gc;				/* background gc calls */
726 727 728
	unsigned int n_dirty_dirs;		/* # of dir inodes */
#endif
	unsigned int last_victim[2];		/* last victim segment # */
729
	spinlock_t stat_lock;			/* lock for stat operations */
730 731 732 733

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
734 735 736 737 738 739 740 741 742 743 744 745 746 747 748
};

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

749 750 751 752 753 754 755 756 757 758 759 760 761 762 763
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);
}

764 765 766 767 768 769 770 771 772 773
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);
}

774 775 776 777 778
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

779 780 781 782 783
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808
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 已提交
809 810 811 812 813
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

814 815 816 817 818
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

819 820 821 822 823 824
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)
825
{
826
	sbi->s_flag |= (0x01 << type);
827 828
}

829
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
830
{
831
	sbi->s_flag &= ~(0x01 << type);
832 833
}

834 835 836 837 838
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858
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);
}

859
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
860
{
861
	down_read(&sbi->cp_rwsem);
862 863
}

864
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
865
{
866
	up_read(&sbi->cp_rwsem);
867 868
}

869
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
870
{
J
Jaegeuk Kim 已提交
871
	f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
872 873
}

874
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
875
{
876
	up_write(&sbi->cp_rwsem);
877 878
}

879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900
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));
}

901 902 903
/*
 * Check whether the given nid is within node id range.
 */
904
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
905
{
906 907
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
908
	if (unlikely(nid >= NM_I(sbi)->max_nid))
909 910
		return -EINVAL;
	return 0;
911 912 913 914 915 916 917 918 919 920
}

#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 已提交
921
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
922
	else
C
Chris Fries 已提交
923
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
924 925
}

926 927 928 929 930
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

931 932 933 934 935 936 937 938
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;
939
	if (unlikely(valid_block_count > sbi->user_block_count)) {
940 941 942 943 944 945 946 947 948 949
		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;
}

950
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
951 952 953 954
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
955 956
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
957 958 959 960 961 962 963 964
	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]);
965
	set_sbi_flag(sbi, SBI_IS_DIRTY);
966 967
}

968
static inline void inode_inc_dirty_pages(struct inode *inode)
969
{
970 971 972
	atomic_inc(&F2FS_I(inode)->dirty_pages);
	if (S_ISDIR(inode->i_mode))
		inc_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
973 974 975 976 977 978 979
}

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

980
static inline void inode_dec_dirty_pages(struct inode *inode)
981
{
982
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode))
983 984
		return;

985 986 987 988
	atomic_dec(&F2FS_I(inode)->dirty_pages);

	if (S_ISDIR(inode->i_mode))
		dec_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
989 990 991 992 993 994 995
}

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

996
static inline int get_dirty_pages(struct inode *inode)
997
{
998
	return atomic_read(&F2FS_I(inode)->dirty_pages);
999 1000
}

1001 1002 1003 1004 1005 1006 1007 1008
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;
}

1009 1010
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1011
	return sbi->total_valid_block_count;
1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026
}

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 已提交
1027 1028 1029 1030 1031
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1032 1033 1034
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1035 1036
	int offset;

W
Wanpeng Li 已提交
1037
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1038 1039 1040
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1041
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1042 1043
	} else {
		offset = (flag == NAT_BITMAP) ?
1044
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1045 1046
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1047 1048 1049 1050 1051 1052
}

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

1055
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1056 1057 1058

	/*
	 * odd numbered checkpoint should at cp segment 0
A
arter97 已提交
1059
	 * and even segment must be at cp segment 1
1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072
	 */
	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,
1073
						struct inode *inode)
1074 1075 1076 1077 1078 1079
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1080
	valid_block_count = sbi->total_valid_block_count + 1;
1081
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1082 1083 1084 1085
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1086
	valid_node_count = sbi->total_valid_node_count + 1;
1087
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1088 1089 1090 1091 1092
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1093 1094 1095 1096 1097
		inode->i_blocks++;

	sbi->alloc_valid_block_count++;
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1098 1099 1100 1101 1102 1103
	spin_unlock(&sbi->stat_lock);

	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1104
						struct inode *inode)
1105 1106 1107
{
	spin_lock(&sbi->stat_lock);

1108 1109 1110
	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);
1111

1112 1113 1114
	inode->i_blocks--;
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1115 1116 1117 1118 1119 1120

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1121
	return sbi->total_valid_node_count;
1122 1123 1124 1125 1126
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
	spin_lock(&sbi->stat_lock);
1127
	f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
1128 1129 1130 1131
	sbi->total_valid_inode_count++;
	spin_unlock(&sbi->stat_lock);
}

1132
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1133 1134
{
	spin_lock(&sbi->stat_lock);
1135
	f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
1136 1137 1138 1139 1140 1141
	sbi->total_valid_inode_count--;
	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
{
1142
	return sbi->total_valid_inode_count;
1143 1144 1145 1146
}

static inline void f2fs_put_page(struct page *page, int unlock)
{
1147
	if (!page)
1148 1149 1150
		return;

	if (unlock) {
1151
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167
		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,
1168
					size_t size)
1169
{
1170
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1171 1172
}

1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186
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;
}

1187 1188 1189 1190 1191 1192 1193
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();
}

1194 1195 1196 1197
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1198
	struct f2fs_node *p = F2FS_NODE(page);
1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211
	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;
1212
	raw_node = F2FS_NODE(node_page);
1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225
	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;
}

1226
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237
{
	int mask;
	int ret;

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

1238
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249
{
	int mask;
	int ret;

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

1250 1251 1252 1253 1254 1255 1256 1257 1258
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1259 1260 1261
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1262
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1263
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1264 1265 1266
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1267
	FI_UPDATE_DIR,		/* should update inode block for consistency */
1268
	FI_DELAY_IPUT,		/* used for the recovery */
1269
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1270
	FI_INLINE_XATTR,	/* used for inline xattr */
1271
	FI_INLINE_DATA,		/* used for inline data*/
1272
	FI_INLINE_DENTRY,	/* used for inline dentry */
1273 1274
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1275 1276
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
1277
	FI_VOLATILE_FILE,	/* indicate volatile file */
1278
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1279
	FI_DROP_CACHE,		/* drop dirty page cache */
1280
	FI_DATA_EXIST,		/* indicate data exists */
1281
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
1282 1283 1284 1285
};

static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
{
J
Jaegeuk Kim 已提交
1286 1287
	if (!test_bit(flag, &fi->flags))
		set_bit(flag, &fi->flags);
1288 1289 1290 1291 1292 1293 1294 1295 1296
}

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 已提交
1297 1298
	if (test_bit(flag, &fi->flags))
		clear_bit(flag, &fi->flags);
1299 1300 1301 1302 1303 1304 1305 1306
}

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 已提交
1307 1308 1309 1310 1311
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);
1312 1313
	if (ri->i_inline & F2FS_INLINE_DATA)
		set_inode_flag(fi, FI_INLINE_DATA);
1314 1315
	if (ri->i_inline & F2FS_INLINE_DENTRY)
		set_inode_flag(fi, FI_INLINE_DENTRY);
1316 1317
	if (ri->i_inline & F2FS_DATA_EXIST)
		set_inode_flag(fi, FI_DATA_EXIST);
1318 1319
	if (ri->i_inline & F2FS_INLINE_DOTS)
		set_inode_flag(fi, FI_INLINE_DOTS);
J
Jaegeuk Kim 已提交
1320 1321 1322 1323 1324 1325 1326 1327 1328
}

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;
1329 1330
	if (is_inode_flag_set(fi, FI_INLINE_DATA))
		ri->i_inline |= F2FS_INLINE_DATA;
1331 1332
	if (is_inode_flag_set(fi, FI_INLINE_DENTRY))
		ri->i_inline |= F2FS_INLINE_DENTRY;
1333 1334
	if (is_inode_flag_set(fi, FI_DATA_EXIST))
		ri->i_inline |= F2FS_DATA_EXIST;
1335 1336
	if (is_inode_flag_set(fi, FI_INLINE_DOTS))
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1337 1338
}

1339 1340 1341 1342 1343
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
}

1344 1345
static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
{
1346
	if (f2fs_has_inline_xattr(&fi->vfs_inode))
1347 1348 1349 1350
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1351 1352
static inline void *inline_xattr_addr(struct page *page)
{
1353
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1354 1355 1356 1357 1358 1359
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1360
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1361 1362 1363 1364 1365
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1366 1367 1368 1369 1370
static inline int f2fs_has_inline_data(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
}

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

1382 1383 1384 1385 1386
static inline int f2fs_has_inline_dots(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DOTS);
}

J
Jaegeuk Kim 已提交
1387 1388 1389 1390 1391
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_ATOMIC_FILE);
}

1392 1393 1394 1395 1396
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_VOLATILE_FILE);
}

1397 1398 1399 1400 1401
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
}

1402 1403 1404 1405 1406
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_DROP_CACHE);
}

1407 1408
static inline void *inline_data_addr(struct page *page)
{
1409
	struct f2fs_inode *ri = F2FS_INODE(page);
1410 1411 1412
	return (void *)&(ri->i_addr[1]);
}

1413 1414 1415 1416 1417
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DENTRY);
}

1418 1419 1420 1421 1422 1423
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438
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 已提交
1439 1440 1441 1442 1443
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1444 1445 1446 1447 1448
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

1449 1450 1451 1452 1453 1454
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;
}

1455 1456 1457 1458
#define get_inode_mode(i) \
	((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1459 1460 1461 1462 1463 1464
/* 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))

1465 1466 1467 1468 1469
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1470
int truncate_blocks(struct inode *, u64, bool);
1471
void f2fs_truncate(struct inode *);
1472
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1473 1474
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1475
int truncate_data_blocks_range(struct dnode_of_data *, int);
1476
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1477
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1478 1479 1480 1481 1482 1483

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1484
int try_to_free_nats(struct f2fs_sb_info *, int);
1485
void update_inode(struct inode *, struct page *);
1486
void update_inode_page(struct inode *);
1487 1488
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1489
void handle_failed_inode(struct inode *);
1490 1491 1492 1493 1494 1495 1496 1497 1498

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

/*
 * dir.c
 */
1499
extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
1500
void set_de_type(struct f2fs_dir_entry *, umode_t);
1501 1502 1503 1504
struct f2fs_dir_entry *find_target_dentry(struct qstr *, int *,
			struct f2fs_dentry_ptr *);
bool f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
			unsigned int);
1505 1506
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
1507
struct page *init_inode_metadata(struct inode *, struct inode *,
1508
			const struct qstr *, struct page *);
1509
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
1510
int room_for_filename(const void *, int, int);
1511
void f2fs_drop_nlink(struct inode *, struct inode *, struct page *);
1512 1513 1514 1515 1516 1517
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 *);
1518
int update_dent_inode(struct inode *, const struct qstr *);
1519
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
1520
			const struct qstr *, f2fs_hash_t , unsigned int);
1521 1522
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
1523 1524
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
1525
int f2fs_do_tmpfile(struct inode *, struct inode *);
1526 1527 1528
int f2fs_make_empty(struct inode *, struct inode *);
bool f2fs_empty_dir(struct inode *);

1529 1530
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
1531
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
1532
				inode, inode->i_ino, inode->i_mode);
1533 1534
}

1535 1536 1537 1538
/*
 * super.c
 */
int f2fs_sync_fs(struct super_block *, int);
1539 1540
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
1541 1542 1543 1544

/*
 * hash.c
 */
1545
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1546 1547 1548 1549 1550 1551 1552

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

1553
bool available_free_memory(struct f2fs_sb_info *, int);
1554 1555
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
1556 1557 1558
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);
1559
int truncate_xattr_node(struct inode *, struct page *);
1560
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
G
Gu Zheng 已提交
1561
void remove_inode_page(struct inode *);
1562
struct page *new_inode_page(struct inode *);
1563
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
1564 1565 1566 1567 1568 1569 1570 1571
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);
1572
void recover_inline_xattr(struct inode *, struct page *);
1573
void recover_xattr_data(struct inode *, struct page *, block_t);
1574 1575 1576 1577 1578 1579
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 *);
1580
int __init create_node_manager_caches(void);
1581 1582 1583 1584 1585
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
1586 1587
void register_inmem_page(struct inode *, struct page *);
void commit_inmem_pages(struct inode *, bool);
1588
void f2fs_balance_fs(struct f2fs_sb_info *);
1589
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
1590
int f2fs_issue_flush(struct f2fs_sb_info *);
1591 1592
int create_flush_cmd_control(struct f2fs_sb_info *);
void destroy_flush_cmd_control(struct f2fs_sb_info *);
1593
void invalidate_blocks(struct f2fs_sb_info *, block_t);
1594
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
1595
void clear_prefree_segments(struct f2fs_sb_info *);
1596
void release_discard_addrs(struct f2fs_sb_info *);
1597
void discard_next_dnode(struct f2fs_sb_info *, block_t);
1598
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
1599
void allocate_new_segments(struct f2fs_sb_info *);
1600
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
1601
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
1602
void write_meta_page(struct f2fs_sb_info *, struct page *);
1603
void write_node_page(struct f2fs_sb_info *, struct page *,
1604 1605 1606 1607
				unsigned int, struct f2fs_io_info *);
void write_data_page(struct page *, struct dnode_of_data *,
			struct f2fs_io_info *);
void rewrite_data_page(struct page *, struct f2fs_io_info *);
1608 1609
void recover_data_page(struct f2fs_sb_info *, struct page *,
				struct f2fs_summary *, block_t, block_t);
1610 1611
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
1612
void f2fs_wait_on_page_writeback(struct page *, enum page_type);
1613 1614 1615 1616
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);
1617
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
1618 1619
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
1620 1621
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
1622 1623 1624 1625 1626 1627

/*
 * checkpoint.c
 */
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
1628
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
1629
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int);
1630
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
1631
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
1632 1633
void add_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
void remove_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
1634
void release_dirty_inode(struct f2fs_sb_info *);
1635
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
J
Jaegeuk Kim 已提交
1636 1637
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
1638 1639
void add_orphan_inode(struct f2fs_sb_info *, nid_t);
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
1640
void recover_orphan_inodes(struct f2fs_sb_info *);
1641
int get_valid_checkpoint(struct f2fs_sb_info *);
1642
void update_dirty_page(struct inode *, struct page *);
1643
void add_dirty_dir_inode(struct inode *);
1644 1645
void remove_dirty_dir_inode(struct inode *);
void sync_dirty_dir_inodes(struct f2fs_sb_info *);
1646
void write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
1647
void init_ino_entry_info(struct f2fs_sb_info *);
1648
int __init create_checkpoint_caches(void);
1649 1650 1651 1652 1653
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
1654
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
1655 1656 1657
int f2fs_submit_page_bio(struct f2fs_sb_info *, struct page *,
						struct f2fs_io_info *);
void f2fs_submit_page_mbio(struct f2fs_sb_info *, struct page *,
J
Jaegeuk Kim 已提交
1658
						struct f2fs_io_info *);
1659
void set_data_blkaddr(struct dnode_of_data *);
1660
int reserve_new_block(struct dnode_of_data *);
1661
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
1662 1663
void f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
void f2fs_destroy_extent_tree(struct inode *);
1664
void f2fs_init_extent_cache(struct inode *, struct f2fs_extent *);
1665
void f2fs_update_extent_cache(struct dnode_of_data *);
1666
void f2fs_preserve_extent_tree(struct inode *);
1667
struct page *find_data_page(struct inode *, pgoff_t, bool);
1668
struct page *get_lock_data_page(struct inode *, pgoff_t);
1669
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
J
Jaegeuk Kim 已提交
1670
int do_write_data_page(struct page *, struct f2fs_io_info *);
J
Jaegeuk Kim 已提交
1671
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
1672 1673 1674
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);
1675 1676
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
1677 1678 1679 1680 1681 1682

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
1683
block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
J
Jaegeuk Kim 已提交
1684
int f2fs_gc(struct f2fs_sb_info *);
1685 1686 1687 1688 1689
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
1690
int recover_fsync_data(struct f2fs_sb_info *);
1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701
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;
1702
	int hit_ext, total_ext, ext_tree, ext_node;
1703
	int ndirty_node, ndirty_dent, ndirty_dirs, ndirty_meta;
1704
	int nats, dirty_nats, sits, dirty_sits, fnids;
1705
	int total_count, utilization;
1706
	int bg_gc, inline_inode, inline_dir, inmem_pages, wb_pages;
1707 1708 1709 1710 1711
	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;
1712
	int prefree_count, call_count, cp_count;
1713
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
1714
	int bg_node_segs, bg_data_segs;
1715
	int tot_blks, data_blks, node_blks;
1716
	int bg_data_blks, bg_node_blks;
1717 1718 1719 1720 1721 1722
	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];
1723
	unsigned int inplace_count;
1724
	unsigned base_mem, cache_mem, page_mem;
1725 1726
};

1727 1728
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
1729
	return (struct f2fs_stat_info *)sbi->stat_info;
1730 1731
}

1732
#define stat_inc_cp_count(si)		((si)->cp_count++)
1733 1734 1735 1736 1737 1738
#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--)
#define stat_inc_total_hit(sb)		((F2FS_SB(sb))->total_hit_ext++)
#define stat_inc_read_hit(sb)		((F2FS_SB(sb))->read_hit_ext++)
1739 1740 1741
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1742
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
1743 1744 1745 1746
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1747
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
1748
	} while (0)
1749 1750 1751
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1752
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
1753 1754 1755 1756
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1757
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
1758
	} while (0)
1759 1760 1761 1762
#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]++)
1763 1764
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
1765
#define stat_inc_seg_count(sbi, type, gc_type)				\
1766
	do {								\
1767
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1768
		(si)->tot_segs++;					\
1769
		if (type == SUM_TYPE_DATA) {				\
1770
			si->data_segs++;				\
1771 1772
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
1773
			si->node_segs++;				\
1774 1775
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
1776 1777 1778 1779 1780
	} while (0)

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

1781
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
1782
	do {								\
1783
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1784 1785
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
1786
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
1787 1788
	} while (0)

1789
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
1790
	do {								\
1791
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1792 1793
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
1794
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
1795 1796 1797 1798
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
1799
void __init f2fs_create_root_stats(void);
1800
void f2fs_destroy_root_stats(void);
1801
#else
1802
#define stat_inc_cp_count(si)
1803
#define stat_inc_call_count(si)
1804 1805 1806 1807 1808
#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)
1809 1810
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
1811 1812
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
1813 1814
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
1815
#define stat_inc_inplace_blocks(sbi)
1816
#define stat_inc_seg_count(sbi, type, gc_type)
1817
#define stat_inc_tot_blk_count(si, blks)
1818 1819
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
1820 1821 1822

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
1823
static inline void __init f2fs_create_root_stats(void) { }
1824
static inline void f2fs_destroy_root_stats(void) { }
1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835
#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;
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
1836
extern struct kmem_cache *inode_entry_slab;
1837

1838 1839 1840 1841
/*
 * inline.c
 */
bool f2fs_may_inline(struct inode *);
1842
void read_inline_data(struct page *, struct page *);
1843
bool truncate_inline_inode(struct page *, u64);
1844
int f2fs_read_inline_data(struct inode *, struct page *);
1845 1846 1847
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 *);
1848
bool recover_inline_data(struct inode *, struct page *);
1849 1850 1851 1852
struct f2fs_dir_entry *find_in_inline_dir(struct inode *, struct qstr *,
							struct page **);
struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *, struct page **);
int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
1853 1854
int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *,
						nid_t, umode_t);
1855 1856 1857 1858
void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
						struct inode *, struct inode *);
bool f2fs_empty_inline_dir(struct inode *);
int f2fs_read_inline_dir(struct file *, struct dir_context *);
1859
#endif