f2fs.h 56.1 KB
Newer Older
J
Jaegeuk Kim 已提交
1
/*
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
 * fs/f2fs/f2fs.h
 *
 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
 *             http://www.samsung.com/
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */
#ifndef _LINUX_F2FS_H
#define _LINUX_F2FS_H

#include <linux/types.h>
#include <linux/page-flags.h>
#include <linux/buffer_head.h>
#include <linux/slab.h>
#include <linux/crc32.h>
#include <linux/magic.h>
20
#include <linux/kobject.h>
21
#include <linux/sched.h>
22

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 324 325 326 327
};

/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
328
#define FADVISE_LOST_PINO_BIT	0x02
329

330 331 332 333 334 335 336
#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)

337 338
#define DEF_DIR_LEVEL		0

339 340 341 342
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 */
343
	unsigned char i_dir_level;	/* use for dentry level for large dir */
344
	unsigned int i_current_depth;	/* use only in directory structure */
345
	unsigned int i_pino;		/* parent inode number */
346 347 348 349
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
350
	struct rw_semaphore i_sem;	/* protect fi info */
351
	atomic_t dirty_pages;		/* # of dirty pages */
352 353 354
	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 */
355
	unsigned long long xattr_ver;	/* cp version of xattr modification */
356
	struct extent_info ext;		/* in-memory extent cache entry */
357
	rwlock_t ext_lock;		/* rwlock for single extent cache */
358
	struct inode_entry *dirty_dir;	/* the pointer of dirty dir */
J
Jaegeuk Kim 已提交
359

360
	struct radix_tree_root inmem_root;	/* radix tree for inmem pages */
J
Jaegeuk Kim 已提交
361 362
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
363 364 365 366 367 368
};

static inline void get_extent_info(struct extent_info *ext,
					struct f2fs_extent i_ext)
{
	ext->fofs = le32_to_cpu(i_ext.fofs);
369
	ext->blk = le32_to_cpu(i_ext.blk);
370 371 372 373 374 375 376
	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);
377
	i_ext->blk = cpu_to_le32(ext->blk);
378 379 380
	i_ext->len = cpu_to_le32(ext->len);
}

381 382 383 384 385 386 387 388
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;
}

389 390 391 392 393 394 395
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);
}

396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414
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);
}

415 416 417
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
418
	nid_t available_nids;		/* maximum available node ids */
419
	nid_t next_scan_nid;		/* the next nid to be scanned */
420
	unsigned int ram_thresh;	/* control the memory footprint */
421 422 423

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
424
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
425
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
426
	struct list_head nat_entries;	/* cached nat entry list (clean) */
427
	unsigned int nat_cnt;		/* the # of cached nat entries */
428
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
429 430

	/* free node ids management */
431
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459
	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)
{
460
	memset(dn, 0, sizeof(*dn));
461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490
	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 */
491 492
	NO_CHECK_TYPE,
	CURSEG_DIRECT_IO,	/* to use for the direct IO path */
493 494
};

495 496
struct flush_cmd {
	struct completion wait;
497
	struct llist_node llnode;
498 499 500
	int ret;
};

501 502 503
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
504 505
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
506 507
};

508 509 510 511 512 513 514 515 516 517 518 519 520 521
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 */
522 523 524

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
525 526 527 528 529

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

J
Jaegeuk Kim 已提交
531 532 533
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

534 535
	struct list_head sit_entry_set;	/* sit entry set list */

536 537
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
538
	unsigned int min_fsync_blocks;	/* threshold for fsync */
539 540

	/* for flush command control */
541 542
	struct flush_cmd_control *cmd_control_info;

543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
};

/*
 * 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,
559
	F2FS_INMEM_PAGES,
560 561 562 563
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
564
 * The below are the page types of bios used in submit_bio().
565 566 567 568 569 570 571 572 573
 * 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.
 */
574
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
575 576 577 578 579 580
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
581 582 583 584
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
	IPU,
	OPU,
585 586
};

J
Jaegeuk Kim 已提交
587
struct f2fs_io_info {
588 589
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
	int rw;			/* contains R/RS/W/WS with REQ_META/REQ_PRIO */
590
	block_t blk_addr;	/* block address to be written */
J
Jaegeuk Kim 已提交
591 592
};

593
#define is_read_io(rw)	(((rw) & 1) == READ)
594
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
595
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
596 597
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
598
	struct f2fs_io_info fio;	/* store buffered io info. */
599
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
600 601
};

602 603 604 605 606 607 608 609
/* 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 */
};

610 611 612 613 614 615 616 617
/* 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 */
};

618 619
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
620
	struct proc_dir_entry *s_proc;		/* proc entry */
621 622
	struct buffer_head *raw_super_buf;	/* buffer head of raw sb */
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
623
	int s_flag;				/* flags for sbi */
624 625 626 627 628 629 630

	/* 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 */
631 632

	/* for bio operations */
633
	struct f2fs_bio_info read_io;			/* for read bios */
634
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
635 636 637 638

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
	struct inode *meta_inode;		/* cache meta blocks */
639
	struct mutex cp_mutex;			/* checkpoint procedure lock */
640
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
641
	struct rw_semaphore node_write;		/* locking node writes */
642
	struct mutex writepages;		/* mutex for writepages() */
643
	wait_queue_head_t cp_wait;
644

645
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
646 647

	/* for orphan inode, use 0'th array */
648
	unsigned int max_orphans;		/* max orphan inodes */
649 650 651 652 653

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

654 655 656 657 658 659 660 661
	/* 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 已提交
662
	/* basic filesystem units */
663 664 665 666 667 668 669 670 671 672 673 674 675 676 677
	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 */
678
	int dir_level;				/* directory level */
679 680 681 682 683 684 685 686 687 688 689 690 691

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

694 695 696
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

697 698 699 700
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
701
#ifdef CONFIG_F2FS_STAT_FS
702 703 704
	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 */
705
	atomic_t inplace_count;		/* # of inplace update */
706
	int total_hit_ext, read_hit_ext;	/* extent cache hit ratio */
707 708
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
709
	int bg_gc;				/* background gc calls */
710 711 712
	unsigned int n_dirty_dirs;		/* # of dir inodes */
#endif
	unsigned int last_victim[2];		/* last victim segment # */
713
	spinlock_t stat_lock;			/* lock for stat operations */
714 715 716 717

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
718 719 720 721 722 723 724 725 726 727 728 729 730 731 732
};

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

733 734 735 736 737 738 739 740 741 742 743 744 745 746 747
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);
}

748 749 750 751 752 753 754 755 756 757
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);
}

758 759 760 761 762
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

763 764 765 766 767
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792
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 已提交
793 794 795 796 797
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

798 799 800 801 802
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

803 804 805 806 807 808
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)
809
{
810
	sbi->s_flag |= (0x01 << type);
811 812
}

813
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
814
{
815
	sbi->s_flag &= ~(0x01 << type);
816 817
}

818 819 820 821 822
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842
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);
}

843
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
844
{
845
	down_read(&sbi->cp_rwsem);
846 847
}

848
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
849
{
850
	up_read(&sbi->cp_rwsem);
851 852
}

853
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
854
{
J
Jaegeuk Kim 已提交
855
	f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
856 857
}

858
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
859
{
860
	up_write(&sbi->cp_rwsem);
861 862
}

863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884
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));
}

885 886 887
/*
 * Check whether the given nid is within node id range.
 */
888
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
889
{
890 891
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
892
	if (unlikely(nid >= NM_I(sbi)->max_nid))
893 894
		return -EINVAL;
	return 0;
895 896 897 898 899 900 901 902 903 904
}

#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 已提交
905
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
906
	else
C
Chris Fries 已提交
907
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
908 909
}

910 911 912 913 914
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

915 916 917 918 919 920 921 922
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;
923
	if (unlikely(valid_block_count > sbi->user_block_count)) {
924 925 926 927 928 929 930 931 932 933
		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;
}

934
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
935 936 937 938
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
939 940
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
941 942 943 944 945 946 947 948
	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]);
949
	set_sbi_flag(sbi, SBI_IS_DIRTY);
950 951
}

952
static inline void inode_inc_dirty_pages(struct inode *inode)
953
{
954 955 956
	atomic_inc(&F2FS_I(inode)->dirty_pages);
	if (S_ISDIR(inode->i_mode))
		inc_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
957 958 959 960 961 962 963
}

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

964
static inline void inode_dec_dirty_pages(struct inode *inode)
965
{
966
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode))
967 968
		return;

969 970 971 972
	atomic_dec(&F2FS_I(inode)->dirty_pages);

	if (S_ISDIR(inode->i_mode))
		dec_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
973 974 975 976 977 978 979
}

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

980
static inline int get_dirty_pages(struct inode *inode)
981
{
982
	return atomic_read(&F2FS_I(inode)->dirty_pages);
983 984
}

985 986 987 988 989 990 991 992
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;
}

993 994
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
995
	return sbi->total_valid_block_count;
996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010
}

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 已提交
1011 1012 1013 1014 1015
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1016 1017 1018
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1019 1020
	int offset;

W
Wanpeng Li 已提交
1021
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1022 1023 1024
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1025
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1026 1027
	} else {
		offset = (flag == NAT_BITMAP) ?
1028
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1029 1030
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1031 1032 1033 1034 1035 1036
}

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

1039
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1040 1041 1042

	/*
	 * odd numbered checkpoint should at cp segment 0
A
arter97 已提交
1043
	 * and even segment must be at cp segment 1
1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056
	 */
	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,
1057
						struct inode *inode)
1058 1059 1060 1061 1062 1063
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1064
	valid_block_count = sbi->total_valid_block_count + 1;
1065
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1066 1067 1068 1069
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1070
	valid_node_count = sbi->total_valid_node_count + 1;
1071
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1072 1073 1074 1075 1076
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1077 1078 1079 1080 1081
		inode->i_blocks++;

	sbi->alloc_valid_block_count++;
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1082 1083 1084 1085 1086 1087
	spin_unlock(&sbi->stat_lock);

	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1088
						struct inode *inode)
1089 1090 1091
{
	spin_lock(&sbi->stat_lock);

1092 1093 1094
	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);
1095

1096 1097 1098
	inode->i_blocks--;
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1099 1100 1101 1102 1103 1104

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1105
	return sbi->total_valid_node_count;
1106 1107 1108 1109 1110
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
	spin_lock(&sbi->stat_lock);
1111
	f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
1112 1113 1114 1115
	sbi->total_valid_inode_count++;
	spin_unlock(&sbi->stat_lock);
}

1116
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1117 1118
{
	spin_lock(&sbi->stat_lock);
1119
	f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
1120 1121 1122 1123 1124 1125
	sbi->total_valid_inode_count--;
	spin_unlock(&sbi->stat_lock);
}

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

static inline void f2fs_put_page(struct page *page, int unlock)
{
1131
	if (!page)
1132 1133 1134
		return;

	if (unlock) {
1135
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151
		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,
1152
					size_t size)
1153
{
1154
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1155 1156
}

1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170
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;
}

1171 1172 1173 1174 1175 1176 1177
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();
}

1178 1179 1180 1181
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1182
	struct f2fs_node *p = F2FS_NODE(page);
1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195
	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;
1196
	raw_node = F2FS_NODE(node_page);
1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209
	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;
}

1210
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221
{
	int mask;
	int ret;

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

1222
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233
{
	int mask;
	int ret;

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

1234 1235 1236 1237 1238 1239 1240 1241 1242
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1243 1244 1245
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1246
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1247
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1248 1249 1250
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1251
	FI_UPDATE_DIR,		/* should update inode block for consistency */
1252
	FI_DELAY_IPUT,		/* used for the recovery */
1253
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1254
	FI_INLINE_XATTR,	/* used for inline xattr */
1255
	FI_INLINE_DATA,		/* used for inline data*/
1256
	FI_INLINE_DENTRY,	/* used for inline dentry */
1257 1258
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1259 1260
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
1261
	FI_VOLATILE_FILE,	/* indicate volatile file */
1262
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1263
	FI_DROP_CACHE,		/* drop dirty page cache */
1264
	FI_DATA_EXIST,		/* indicate data exists */
1265
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
1266 1267 1268 1269
};

static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
{
J
Jaegeuk Kim 已提交
1270 1271
	if (!test_bit(flag, &fi->flags))
		set_bit(flag, &fi->flags);
1272 1273 1274 1275 1276 1277 1278 1279 1280
}

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 已提交
1281 1282
	if (test_bit(flag, &fi->flags))
		clear_bit(flag, &fi->flags);
1283 1284 1285 1286 1287 1288 1289 1290
}

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 已提交
1291 1292 1293 1294 1295
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);
1296 1297
	if (ri->i_inline & F2FS_INLINE_DATA)
		set_inode_flag(fi, FI_INLINE_DATA);
1298 1299
	if (ri->i_inline & F2FS_INLINE_DENTRY)
		set_inode_flag(fi, FI_INLINE_DENTRY);
1300 1301
	if (ri->i_inline & F2FS_DATA_EXIST)
		set_inode_flag(fi, FI_DATA_EXIST);
1302 1303
	if (ri->i_inline & F2FS_INLINE_DOTS)
		set_inode_flag(fi, FI_INLINE_DOTS);
J
Jaegeuk Kim 已提交
1304 1305 1306 1307 1308 1309 1310 1311 1312
}

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;
1313 1314
	if (is_inode_flag_set(fi, FI_INLINE_DATA))
		ri->i_inline |= F2FS_INLINE_DATA;
1315 1316
	if (is_inode_flag_set(fi, FI_INLINE_DENTRY))
		ri->i_inline |= F2FS_INLINE_DENTRY;
1317 1318
	if (is_inode_flag_set(fi, FI_DATA_EXIST))
		ri->i_inline |= F2FS_DATA_EXIST;
1319 1320
	if (is_inode_flag_set(fi, FI_INLINE_DOTS))
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1321 1322
}

1323 1324 1325 1326 1327
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
}

1328 1329
static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
{
1330
	if (f2fs_has_inline_xattr(&fi->vfs_inode))
1331 1332 1333 1334
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1335 1336
static inline void *inline_xattr_addr(struct page *page)
{
1337
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1338 1339 1340 1341 1342 1343
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1344
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1345 1346 1347 1348 1349
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1350 1351 1352 1353 1354
static inline int f2fs_has_inline_data(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
}

1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365
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);
}

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

J
Jaegeuk Kim 已提交
1371 1372 1373 1374 1375
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_ATOMIC_FILE);
}

1376 1377 1378 1379 1380
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_VOLATILE_FILE);
}

1381 1382 1383 1384 1385
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
}

1386 1387 1388 1389 1390
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_DROP_CACHE);
}

1391 1392
static inline void *inline_data_addr(struct page *page)
{
1393
	struct f2fs_inode *ri = F2FS_INODE(page);
1394 1395 1396
	return (void *)&(ri->i_addr[1]);
}

1397 1398 1399 1400 1401
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DENTRY);
}

1402 1403 1404 1405 1406 1407
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422
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 已提交
1423 1424 1425 1426 1427
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1428 1429 1430 1431 1432
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

1433 1434 1435 1436 1437 1438
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;
}

1439 1440 1441 1442
#define get_inode_mode(i) \
	((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1443 1444 1445 1446 1447 1448
/* 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))

1449 1450 1451 1452 1453
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1454
int truncate_blocks(struct inode *, u64, bool);
1455
void f2fs_truncate(struct inode *);
1456
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1457 1458
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1459
int truncate_data_blocks_range(struct dnode_of_data *, int);
1460
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1461
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1462 1463 1464 1465 1466 1467

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1468
int try_to_free_nats(struct f2fs_sb_info *, int);
1469
void update_inode(struct inode *, struct page *);
1470
void update_inode_page(struct inode *);
1471 1472
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1473
void handle_failed_inode(struct inode *);
1474 1475 1476 1477 1478 1479 1480 1481 1482

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

/*
 * dir.c
 */
1483
extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
1484
void set_de_type(struct f2fs_dir_entry *, umode_t);
1485 1486 1487 1488
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);
1489 1490
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
1491
struct page *init_inode_metadata(struct inode *, struct inode *,
1492
			const struct qstr *, struct page *);
1493
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
1494
int room_for_filename(const void *, int, int);
1495
void f2fs_drop_nlink(struct inode *, struct inode *, struct page *);
1496 1497 1498 1499 1500 1501
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 *);
1502
int update_dent_inode(struct inode *, const struct qstr *);
1503
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
1504
			const struct qstr *, f2fs_hash_t , unsigned int);
1505 1506
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
1507 1508
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
1509
int f2fs_do_tmpfile(struct inode *, struct inode *);
1510 1511 1512
int f2fs_make_empty(struct inode *, struct inode *);
bool f2fs_empty_dir(struct inode *);

1513 1514
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
1515
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
1516
				inode, inode->i_ino, inode->i_mode);
1517 1518
}

1519 1520 1521 1522
/*
 * super.c
 */
int f2fs_sync_fs(struct super_block *, int);
1523 1524
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
1525 1526 1527 1528

/*
 * hash.c
 */
1529
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1530 1531 1532 1533 1534 1535 1536

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

1537
bool available_free_memory(struct f2fs_sb_info *, int);
1538 1539
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
1540 1541 1542
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);
1543
int truncate_xattr_node(struct inode *, struct page *);
1544
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
G
Gu Zheng 已提交
1545
void remove_inode_page(struct inode *);
1546
struct page *new_inode_page(struct inode *);
1547
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
1548 1549 1550 1551 1552 1553 1554 1555
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);
1556
void recover_inline_xattr(struct inode *, struct page *);
1557
void recover_xattr_data(struct inode *, struct page *, block_t);
1558 1559 1560 1561 1562 1563
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 *);
1564
int __init create_node_manager_caches(void);
1565 1566 1567 1568 1569
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
1570 1571
void register_inmem_page(struct inode *, struct page *);
void commit_inmem_pages(struct inode *, bool);
1572
void f2fs_balance_fs(struct f2fs_sb_info *);
1573
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
1574
int f2fs_issue_flush(struct f2fs_sb_info *);
1575 1576
int create_flush_cmd_control(struct f2fs_sb_info *);
void destroy_flush_cmd_control(struct f2fs_sb_info *);
1577
void invalidate_blocks(struct f2fs_sb_info *, block_t);
1578
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
1579
void clear_prefree_segments(struct f2fs_sb_info *);
1580
void release_discard_addrs(struct f2fs_sb_info *);
1581
void discard_next_dnode(struct f2fs_sb_info *, block_t);
1582
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
1583
void allocate_new_segments(struct f2fs_sb_info *);
1584
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
1585
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
1586
void write_meta_page(struct f2fs_sb_info *, struct page *);
1587
void write_node_page(struct f2fs_sb_info *, struct page *,
1588 1589 1590 1591
				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 *);
1592 1593
void recover_data_page(struct f2fs_sb_info *, struct page *,
				struct f2fs_summary *, block_t, block_t);
1594 1595
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
1596
void f2fs_wait_on_page_writeback(struct page *, enum page_type);
1597 1598 1599 1600
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);
1601
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
1602 1603
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
1604 1605
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
1606 1607 1608 1609 1610 1611

/*
 * checkpoint.c
 */
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
1612
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
1613
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int);
1614
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
1615
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
1616 1617
void add_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
void remove_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
1618
void release_dirty_inode(struct f2fs_sb_info *);
1619
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
J
Jaegeuk Kim 已提交
1620 1621
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
1622 1623
void add_orphan_inode(struct f2fs_sb_info *, nid_t);
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
1624
void recover_orphan_inodes(struct f2fs_sb_info *);
1625
int get_valid_checkpoint(struct f2fs_sb_info *);
1626
void update_dirty_page(struct inode *, struct page *);
1627
void add_dirty_dir_inode(struct inode *);
1628 1629
void remove_dirty_dir_inode(struct inode *);
void sync_dirty_dir_inodes(struct f2fs_sb_info *);
1630
void write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
1631
void init_ino_entry_info(struct f2fs_sb_info *);
1632
int __init create_checkpoint_caches(void);
1633 1634 1635 1636 1637
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
1638
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
1639 1640 1641
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 已提交
1642
						struct f2fs_io_info *);
1643
void set_data_blkaddr(struct dnode_of_data *);
1644
int reserve_new_block(struct dnode_of_data *);
1645
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
1646 1647
void f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
void f2fs_destroy_extent_tree(struct inode *);
1648
void f2fs_init_extent_cache(struct inode *, struct f2fs_extent *);
1649
void f2fs_update_extent_cache(struct dnode_of_data *);
1650
void f2fs_preserve_extent_tree(struct inode *);
1651
struct page *find_data_page(struct inode *, pgoff_t, bool);
1652
struct page *get_lock_data_page(struct inode *, pgoff_t);
1653
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
J
Jaegeuk Kim 已提交
1654
int do_write_data_page(struct page *, struct f2fs_io_info *);
J
Jaegeuk Kim 已提交
1655
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
1656 1657 1658
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);
1659 1660
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
1661 1662 1663 1664 1665 1666

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
1667
block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
J
Jaegeuk Kim 已提交
1668
int f2fs_gc(struct f2fs_sb_info *);
1669 1670 1671 1672 1673
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
1674
int recover_fsync_data(struct f2fs_sb_info *);
1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685
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;
1686
	int hit_ext, total_ext, ext_tree, ext_node;
1687
	int ndirty_node, ndirty_dent, ndirty_dirs, ndirty_meta;
1688
	int nats, dirty_nats, sits, dirty_sits, fnids;
1689
	int total_count, utilization;
1690
	int bg_gc, inline_inode, inline_dir, inmem_pages, wb_pages;
1691 1692 1693 1694 1695
	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;
1696
	int prefree_count, call_count, cp_count;
1697
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
1698
	int bg_node_segs, bg_data_segs;
1699
	int tot_blks, data_blks, node_blks;
1700
	int bg_data_blks, bg_node_blks;
1701 1702 1703 1704 1705 1706
	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];
1707
	unsigned int inplace_count;
1708
	unsigned base_mem, cache_mem, page_mem;
1709 1710
};

1711 1712
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
1713
	return (struct f2fs_stat_info *)sbi->stat_info;
1714 1715
}

1716
#define stat_inc_cp_count(si)		((si)->cp_count++)
1717 1718 1719 1720 1721 1722
#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++)
1723 1724 1725
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1726
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
1727 1728 1729 1730
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1731
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
1732
	} while (0)
1733 1734 1735
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1736
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
1737 1738 1739 1740
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1741
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
1742
	} while (0)
1743 1744 1745 1746
#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]++)
1747 1748
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
1749
#define stat_inc_seg_count(sbi, type, gc_type)				\
1750
	do {								\
1751
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1752
		(si)->tot_segs++;					\
1753
		if (type == SUM_TYPE_DATA) {				\
1754
			si->data_segs++;				\
1755 1756
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
1757
			si->node_segs++;				\
1758 1759
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
1760 1761 1762 1763 1764
	} while (0)

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

1765
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
1766
	do {								\
1767
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1768 1769
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
1770
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
1771 1772
	} while (0)

1773
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
1774
	do {								\
1775
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1776 1777
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
1778
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
1779 1780 1781 1782
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
1783
void __init f2fs_create_root_stats(void);
1784
void f2fs_destroy_root_stats(void);
1785
#else
1786
#define stat_inc_cp_count(si)
1787
#define stat_inc_call_count(si)
1788 1789 1790 1791 1792
#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)
1793 1794
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
1795 1796
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
1797 1798
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
1799
#define stat_inc_inplace_blocks(sbi)
1800
#define stat_inc_seg_count(sbi, type, gc_type)
1801
#define stat_inc_tot_blk_count(si, blks)
1802 1803
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
1804 1805 1806

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
1807
static inline void __init f2fs_create_root_stats(void) { }
1808
static inline void f2fs_destroy_root_stats(void) { }
1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819
#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 已提交
1820
extern struct kmem_cache *inode_entry_slab;
1821

1822 1823 1824 1825
/*
 * inline.c
 */
bool f2fs_may_inline(struct inode *);
1826
void read_inline_data(struct page *, struct page *);
1827
bool truncate_inline_inode(struct page *, u64);
1828
int f2fs_read_inline_data(struct inode *, struct page *);
1829 1830 1831
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 *);
1832
bool recover_inline_data(struct inode *, struct page *);
1833 1834 1835 1836
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 *);
1837 1838
int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *,
						nid_t, umode_t);
1839 1840 1841 1842
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 *);
1843
#endif