f2fs.h 57.2 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
#define DEF_BATCHED_TRIM_SECTIONS	32
#define BATCHED_TRIM_SEGMENTS(sbi)	\
		(SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
120 121
#define BATCHED_TRIM_BLOCKS(sbi)	\
		(BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
J
Jaegeuk Kim 已提交
122

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

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

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

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

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

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

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

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

191 192 193
#define MAX_NAT_JENTRIES(sum)	(NAT_JOURNAL_ENTRIES - nats_in_cursum(sum))
#define MAX_SIT_JENTRIES(sum)	(SIT_JOURNAL_ENTRIES - sits_in_cursum(sum))

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

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

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

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

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

239 240 241 242 243 244 245 246
#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

247 248 249
/*
 * For INODE and NODE manager
 */
250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275
/* 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;
	}
}

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

292 293
#define F2FS_LINK_MAX		32000	/* maximum link count per file */

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

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

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

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

J
Jaegeuk Kim 已提交
326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341
/*
 * 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;
};

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

348 349 350 351 352 353 354
#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)

355 356
#define DEF_DIR_LEVEL		0

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

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

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

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

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

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

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

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

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

	/* free node ids management */
449
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
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 476 477
	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)
{
478
	memset(dn, 0, sizeof(*dn));
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 507 508
	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 */
509 510
	NO_CHECK_TYPE,
	CURSEG_DIRECT_IO,	/* to use for the direct IO path */
511 512
};

513 514
struct flush_cmd {
	struct completion wait;
515
	struct llist_node llnode;
516 517 518
	int ret;
};

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

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

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
543 544 545 546 547

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

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

552 553
	struct list_head sit_entry_set;	/* sit entry set list */

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

	/* for flush command control */
559 560
	struct flush_cmd_control *cmd_control_info;

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

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

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

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

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

622 623 624 625 626 627 628 629
/* 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 */
};

630 631 632 633 634 635 636 637
/* 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 */
};

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

	/* 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 */
651 652

	/* for bio operations */
653
	struct f2fs_bio_info read_io;			/* for read bios */
654
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
655 656 657 658

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

665
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
666 667

	/* for orphan inode, use 0'th array */
668
	unsigned int max_orphans;		/* max orphan inodes */
669 670 671 672 673

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

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

	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 */
703
	block_t discard_blks;			/* discard command candidats */
704 705 706 707 708 709 710 711 712
	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 */
713
	unsigned int cur_victim_sec;		/* current victim section num */
714

715 716 717
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

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

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
739 740 741 742 743 744 745 746 747 748 749 750 751 752 753
};

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

754 755 756 757 758 759 760 761 762 763 764 765 766 767 768
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);
}

769 770 771 772 773 774 775 776 777 778
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);
}

779 780 781 782 783
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

784 785 786 787 788
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

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

819 820 821 822 823
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

824 825 826 827 828 829
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)
830
{
831
	sbi->s_flag |= (0x01 << type);
832 833
}

834
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
835
{
836
	sbi->s_flag &= ~(0x01 << type);
837 838
}

839 840 841 842 843
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863
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);
}

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

869
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
870
{
871
	up_read(&sbi->cp_rwsem);
872 873
}

874
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
875
{
J
Jaegeuk Kim 已提交
876
	f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
877 878
}

879
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
880
{
881
	up_write(&sbi->cp_rwsem);
882 883
}

884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905
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));
}

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

#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 已提交
926
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
927
	else
C
Chris Fries 已提交
928
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
929 930
}

931 932 933 934 935
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

936 937 938 939 940 941 942 943
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;
944
	if (unlikely(valid_block_count > sbi->user_block_count)) {
945 946 947 948 949 950 951 952 953 954
		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;
}

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

973
static inline void inode_inc_dirty_pages(struct inode *inode)
974
{
975 976 977
	atomic_inc(&F2FS_I(inode)->dirty_pages);
	if (S_ISDIR(inode->i_mode))
		inc_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
978 979 980 981 982 983 984
}

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

985
static inline void inode_dec_dirty_pages(struct inode *inode)
986
{
987
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode))
988 989
		return;

990 991 992 993
	atomic_dec(&F2FS_I(inode)->dirty_pages);

	if (S_ISDIR(inode->i_mode))
		dec_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
994 995 996 997 998 999 1000
}

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

1001
static inline int get_dirty_pages(struct inode *inode)
1002
{
1003
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1004 1005
}

1006 1007 1008 1009 1010 1011 1012 1013
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;
}

1014 1015
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1016
	return sbi->total_valid_block_count;
1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031
}

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 已提交
1032 1033 1034 1035 1036
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1037 1038 1039
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1040 1041
	int offset;

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

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

1060
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1061 1062 1063

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

	spin_lock(&sbi->stat_lock);

1085
	valid_block_count = sbi->total_valid_block_count + 1;
1086
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1087 1088 1089 1090
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1091
	valid_node_count = sbi->total_valid_node_count + 1;
1092
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1093 1094 1095 1096 1097
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1098 1099 1100 1101 1102
		inode->i_blocks++;

	sbi->alloc_valid_block_count++;
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1103 1104 1105 1106 1107 1108
	spin_unlock(&sbi->stat_lock);

	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1109
						struct inode *inode)
1110 1111 1112
{
	spin_lock(&sbi->stat_lock);

1113 1114 1115
	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);
1116

1117 1118 1119
	inode->i_blocks--;
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1120 1121 1122 1123 1124 1125

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1126
	return sbi->total_valid_node_count;
1127 1128 1129 1130 1131
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
	spin_lock(&sbi->stat_lock);
1132
	f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
1133 1134 1135 1136
	sbi->total_valid_inode_count++;
	spin_unlock(&sbi->stat_lock);
}

1137
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1138 1139
{
	spin_lock(&sbi->stat_lock);
1140
	f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
1141 1142 1143 1144 1145 1146
	sbi->total_valid_inode_count--;
	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
{
1147
	return sbi->total_valid_inode_count;
1148 1149 1150 1151
}

static inline void f2fs_put_page(struct page *page, int unlock)
{
1152
	if (!page)
1153 1154 1155
		return;

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

1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191
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;
}

1192 1193 1194 1195 1196 1197 1198
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();
}

1199 1200 1201 1202
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

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

1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248
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;
}

1249
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260
{
	int mask;
	int ret;

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

1261
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272
{
	int mask;
	int ret;

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

1273 1274 1275 1276 1277 1278 1279 1280 1281
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1282 1283 1284
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1285
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1286
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1287 1288 1289
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1290
	FI_UPDATE_DIR,		/* should update inode block for consistency */
1291
	FI_DELAY_IPUT,		/* used for the recovery */
1292
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1293
	FI_INLINE_XATTR,	/* used for inline xattr */
1294
	FI_INLINE_DATA,		/* used for inline data*/
1295
	FI_INLINE_DENTRY,	/* used for inline dentry */
1296 1297
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1298 1299
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
1300
	FI_VOLATILE_FILE,	/* indicate volatile file */
1301
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1302
	FI_DROP_CACHE,		/* drop dirty page cache */
1303
	FI_DATA_EXIST,		/* indicate data exists */
1304
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
1305 1306 1307 1308
};

static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
{
J
Jaegeuk Kim 已提交
1309 1310
	if (!test_bit(flag, &fi->flags))
		set_bit(flag, &fi->flags);
1311 1312 1313 1314 1315 1316 1317 1318 1319
}

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 已提交
1320 1321
	if (test_bit(flag, &fi->flags))
		clear_bit(flag, &fi->flags);
1322 1323 1324 1325 1326 1327 1328 1329
}

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 已提交
1330 1331 1332 1333 1334
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);
1335 1336
	if (ri->i_inline & F2FS_INLINE_DATA)
		set_inode_flag(fi, FI_INLINE_DATA);
1337 1338
	if (ri->i_inline & F2FS_INLINE_DENTRY)
		set_inode_flag(fi, FI_INLINE_DENTRY);
1339 1340
	if (ri->i_inline & F2FS_DATA_EXIST)
		set_inode_flag(fi, FI_DATA_EXIST);
1341 1342
	if (ri->i_inline & F2FS_INLINE_DOTS)
		set_inode_flag(fi, FI_INLINE_DOTS);
J
Jaegeuk Kim 已提交
1343 1344 1345 1346 1347 1348 1349 1350 1351
}

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;
1352 1353
	if (is_inode_flag_set(fi, FI_INLINE_DATA))
		ri->i_inline |= F2FS_INLINE_DATA;
1354 1355
	if (is_inode_flag_set(fi, FI_INLINE_DENTRY))
		ri->i_inline |= F2FS_INLINE_DENTRY;
1356 1357
	if (is_inode_flag_set(fi, FI_DATA_EXIST))
		ri->i_inline |= F2FS_DATA_EXIST;
1358 1359
	if (is_inode_flag_set(fi, FI_INLINE_DOTS))
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1360 1361
}

1362 1363 1364 1365 1366
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
}

1367 1368
static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
{
1369
	if (f2fs_has_inline_xattr(&fi->vfs_inode))
1370 1371 1372 1373
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1374 1375
static inline void *inline_xattr_addr(struct page *page)
{
1376
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1377 1378 1379 1380 1381 1382
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1383
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1384 1385 1386 1387 1388
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1389 1390 1391 1392 1393
static inline int f2fs_has_inline_data(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
}

1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404
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);
}

1405 1406 1407 1408 1409
static inline int f2fs_has_inline_dots(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DOTS);
}

J
Jaegeuk Kim 已提交
1410 1411 1412 1413 1414
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_ATOMIC_FILE);
}

1415 1416 1417 1418 1419
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_VOLATILE_FILE);
}

1420 1421 1422 1423 1424
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
}

1425 1426 1427 1428 1429
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_DROP_CACHE);
}

1430 1431
static inline void *inline_data_addr(struct page *page)
{
1432
	struct f2fs_inode *ri = F2FS_INODE(page);
1433 1434 1435
	return (void *)&(ri->i_addr[1]);
}

1436 1437 1438 1439 1440
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DENTRY);
}

1441 1442 1443 1444 1445 1446
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461
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 已提交
1462 1463 1464 1465 1466
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1467 1468 1469 1470 1471
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

1472 1473 1474 1475 1476 1477
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;
}

1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488
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;
}

1489 1490 1491 1492
#define get_inode_mode(i) \
	((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1493 1494 1495 1496 1497 1498
/* 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))

1499 1500 1501 1502 1503
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1504
int truncate_blocks(struct inode *, u64, bool);
1505
void f2fs_truncate(struct inode *);
1506
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1507 1508
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1509
int truncate_data_blocks_range(struct dnode_of_data *, int);
1510
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1511
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1512 1513 1514 1515 1516 1517

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1518
int try_to_free_nats(struct f2fs_sb_info *, int);
1519
void update_inode(struct inode *, struct page *);
1520
void update_inode_page(struct inode *);
1521 1522
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1523
void handle_failed_inode(struct inode *);
1524 1525 1526 1527 1528 1529 1530 1531 1532

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

/*
 * dir.c
 */
1533
extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
1534
void set_de_type(struct f2fs_dir_entry *, umode_t);
1535 1536 1537 1538
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);
1539 1540
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
1541
struct page *init_inode_metadata(struct inode *, struct inode *,
1542
			const struct qstr *, struct page *);
1543
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
1544
int room_for_filename(const void *, int, int);
1545
void f2fs_drop_nlink(struct inode *, struct inode *, struct page *);
1546 1547 1548 1549 1550 1551
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 *);
1552
int update_dent_inode(struct inode *, const struct qstr *);
1553
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
1554
			const struct qstr *, f2fs_hash_t , unsigned int);
1555 1556
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
1557 1558
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
1559
int f2fs_do_tmpfile(struct inode *, struct inode *);
1560 1561
bool f2fs_empty_dir(struct inode *);

1562 1563
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
1564
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
1565
				inode, inode->i_ino, inode->i_mode);
1566 1567
}

1568 1569 1570
/*
 * super.c
 */
J
Jaegeuk Kim 已提交
1571
int f2fs_commit_super(struct f2fs_sb_info *);
1572
int f2fs_sync_fs(struct super_block *, int);
1573 1574
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
1575 1576 1577 1578

/*
 * hash.c
 */
1579
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1580 1581 1582 1583 1584 1585 1586

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

1587
bool available_free_memory(struct f2fs_sb_info *, int);
J
Jaegeuk Kim 已提交
1588
int need_dentry_mark(struct f2fs_sb_info *, nid_t);
1589 1590
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
1591 1592 1593
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);
1594
int truncate_xattr_node(struct inode *, struct page *);
1595
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
G
Gu Zheng 已提交
1596
void remove_inode_page(struct inode *);
1597
struct page *new_inode_page(struct inode *);
1598
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
1599 1600 1601 1602 1603 1604 1605 1606
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);
1607
void recover_inline_xattr(struct inode *, struct page *);
1608
void recover_xattr_data(struct inode *, struct page *, block_t);
1609 1610 1611 1612 1613 1614
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 *);
1615
int __init create_node_manager_caches(void);
1616 1617 1618 1619 1620
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
1621 1622
void register_inmem_page(struct inode *, struct page *);
void commit_inmem_pages(struct inode *, bool);
1623
void f2fs_balance_fs(struct f2fs_sb_info *);
1624
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
1625
int f2fs_issue_flush(struct f2fs_sb_info *);
1626 1627
int create_flush_cmd_control(struct f2fs_sb_info *);
void destroy_flush_cmd_control(struct f2fs_sb_info *);
1628
void invalidate_blocks(struct f2fs_sb_info *, block_t);
1629
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
1630
void clear_prefree_segments(struct f2fs_sb_info *, struct cp_control *);
1631
void release_discard_addrs(struct f2fs_sb_info *);
1632
void discard_next_dnode(struct f2fs_sb_info *, block_t);
1633
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
1634
void allocate_new_segments(struct f2fs_sb_info *);
1635
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
1636
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
1637
void write_meta_page(struct f2fs_sb_info *, struct page *);
1638 1639 1640
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 *);
1641 1642
void recover_data_page(struct f2fs_sb_info *, struct page *,
				struct f2fs_summary *, block_t, block_t);
1643 1644
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
1645
void f2fs_wait_on_page_writeback(struct page *, enum page_type);
1646 1647 1648 1649
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);
1650
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
1651 1652
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
1653 1654
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
1655 1656 1657 1658 1659 1660

/*
 * checkpoint.c
 */
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
1661
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
1662
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int);
1663
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
1664
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
1665 1666
void add_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
void remove_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
1667
void release_dirty_inode(struct f2fs_sb_info *);
1668
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
J
Jaegeuk Kim 已提交
1669 1670
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
1671 1672
void add_orphan_inode(struct f2fs_sb_info *, nid_t);
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
1673
void recover_orphan_inodes(struct f2fs_sb_info *);
1674
int get_valid_checkpoint(struct f2fs_sb_info *);
1675
void update_dirty_page(struct inode *, struct page *);
1676
void add_dirty_dir_inode(struct inode *);
1677 1678
void remove_dirty_dir_inode(struct inode *);
void sync_dirty_dir_inodes(struct f2fs_sb_info *);
1679
void write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
1680
void init_ino_entry_info(struct f2fs_sb_info *);
1681
int __init create_checkpoint_caches(void);
1682 1683 1684 1685 1686
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
1687
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
1688 1689
int f2fs_submit_page_bio(struct f2fs_io_info *);
void f2fs_submit_page_mbio(struct f2fs_io_info *);
1690
void set_data_blkaddr(struct dnode_of_data *);
1691
int reserve_new_block(struct dnode_of_data *);
1692
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
1693 1694
void f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
void f2fs_destroy_extent_tree(struct inode *);
1695
void f2fs_init_extent_cache(struct inode *, struct f2fs_extent *);
1696
void f2fs_update_extent_cache(struct dnode_of_data *);
1697
void f2fs_preserve_extent_tree(struct inode *);
1698 1699
struct page *get_read_data_page(struct inode *, pgoff_t, int);
struct page *find_data_page(struct inode *, pgoff_t);
1700
struct page *get_lock_data_page(struct inode *, pgoff_t);
1701
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
1702
int do_write_data_page(struct f2fs_io_info *);
J
Jaegeuk Kim 已提交
1703
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
1704 1705 1706
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);
1707 1708
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
1709 1710 1711 1712 1713 1714

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
1715
block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
J
Jaegeuk Kim 已提交
1716
int f2fs_gc(struct f2fs_sb_info *);
1717 1718 1719 1720 1721
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
1722
int recover_fsync_data(struct f2fs_sb_info *);
1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733
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;
1734
	int hit_ext, total_ext, ext_tree, ext_node;
1735
	int ndirty_node, ndirty_dent, ndirty_dirs, ndirty_meta;
1736
	int nats, dirty_nats, sits, dirty_sits, fnids;
1737
	int total_count, utilization;
1738
	int bg_gc, inline_inode, inline_dir, inmem_pages, wb_pages;
1739 1740 1741 1742 1743
	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;
1744
	int prefree_count, call_count, cp_count;
1745
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
1746
	int bg_node_segs, bg_data_segs;
1747
	int tot_blks, data_blks, node_blks;
1748
	int bg_data_blks, bg_node_blks;
1749 1750 1751 1752 1753 1754
	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];
1755
	unsigned int inplace_count;
1756
	unsigned base_mem, cache_mem, page_mem;
1757 1758
};

1759 1760
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
1761
	return (struct f2fs_stat_info *)sbi->stat_info;
1762 1763
}

1764
#define stat_inc_cp_count(si)		((si)->cp_count++)
1765 1766 1767 1768 1769 1770
#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++)
1771 1772 1773
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1774
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
1775 1776 1777 1778
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1779
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
1780
	} while (0)
1781 1782 1783
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1784
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
1785 1786 1787 1788
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1789
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
1790
	} while (0)
1791 1792 1793 1794
#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]++)
1795 1796
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
1797
#define stat_inc_seg_count(sbi, type, gc_type)				\
1798
	do {								\
1799
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1800
		(si)->tot_segs++;					\
1801
		if (type == SUM_TYPE_DATA) {				\
1802
			si->data_segs++;				\
1803 1804
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
1805
			si->node_segs++;				\
1806 1807
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
1808 1809 1810 1811 1812
	} while (0)

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

1813
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
1814
	do {								\
1815
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1816 1817
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
1818
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
1819 1820
	} while (0)

1821
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
1822
	do {								\
1823
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1824 1825
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
1826
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
1827 1828 1829 1830
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
1831
void __init f2fs_create_root_stats(void);
1832
void f2fs_destroy_root_stats(void);
1833
#else
1834
#define stat_inc_cp_count(si)
1835
#define stat_inc_call_count(si)
1836 1837 1838 1839 1840
#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)
1841 1842
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
1843 1844
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
1845 1846
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
1847
#define stat_inc_inplace_blocks(sbi)
1848
#define stat_inc_seg_count(sbi, type, gc_type)
1849
#define stat_inc_tot_blk_count(si, blks)
1850 1851
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
1852 1853 1854

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
1855
static inline void __init f2fs_create_root_stats(void) { }
1856
static inline void f2fs_destroy_root_stats(void) { }
1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867
#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 已提交
1868
extern struct kmem_cache *inode_entry_slab;
1869

1870 1871 1872
/*
 * inline.c
 */
1873 1874
bool f2fs_may_inline_data(struct inode *);
bool f2fs_may_inline_dentry(struct inode *);
1875
void read_inline_data(struct page *, struct page *);
1876
bool truncate_inline_inode(struct page *, u64);
1877
int f2fs_read_inline_data(struct inode *, struct page *);
1878 1879 1880
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 *);
1881
bool recover_inline_data(struct inode *, struct page *);
1882 1883 1884 1885
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 *);
1886 1887
int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *,
						nid_t, umode_t);
1888 1889 1890 1891
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 *);
1892
#endif