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

#include <linux/types.h>
#include <linux/page-flags.h>
#include <linux/buffer_head.h>
#include <linux/slab.h>
#include <linux/crc32.h>
#include <linux/magic.h>
20
#include <linux/kobject.h>
21
#include <linux/sched.h>
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 31 32 33
#define f2fs_bug_on(sbi, condition)					\
	do {								\
		if (unlikely(condition)) {				\
			WARN_ON(1);					\
			sbi->need_fsck = true;				\
		}							\
	} 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
#define F2FS_MOUNT_FLUSH_MERGE		0x00000200
J
Jaegeuk Kim 已提交
50
#define F2FS_MOUNT_NOBARRIER		0x00000400
51 52 53 54 55 56 57 58 59

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

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

struct f2fs_mount_info {
	unsigned int	opt;
};

J
Jaegeuk Kim 已提交
70 71 72
#define CRCPOLY_LE 0xedb88320

static inline __u32 f2fs_crc32(void *buf, size_t len)
73
{
J
Jaegeuk Kim 已提交
74 75 76 77 78 79 80 81 82 83
	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;
84 85
}

J
Jaegeuk Kim 已提交
86
static inline bool f2fs_crc_valid(__u32 blk_crc, void *buf, size_t buf_size)
87
{
J
Jaegeuk Kim 已提交
88
	return f2fs_crc32(buf, buf_size) == blk_crc;
89 90 91 92 93 94 95 96 97 98
}

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

99 100 101
enum {
	CP_UMOUNT,
	CP_SYNC,
102
	CP_DISCARD,
103 104 105 106
};

struct cp_control {
	int reason;
107 108 109 110
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
111 112
};

113
/*
114
 * For CP/NAT/SIT/SSA readahead
115 116 117 118
 */
enum {
	META_CP,
	META_NAT,
119
	META_SIT,
120 121
	META_SSA,
	META_POR,
122 123
};

J
Jaegeuk Kim 已提交
124 125 126
/* for the list of ino */
enum {
	ORPHAN_INO,		/* for orphan ino list */
127 128
	APPEND_INO,		/* for append ino list */
	UPDATE_INO,		/* for update ino list */
J
Jaegeuk Kim 已提交
129 130 131 132
	MAX_INO_ENTRY,		/* max. list */
};

struct ino_entry {
133 134 135 136 137 138 139 140 141 142
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

/* for the list of directory inodes */
struct dir_inode_entry {
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

143 144 145 146 147 148 149
/* 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 */
};

150 151 152 153
/* 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 */
154 155 156
	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 */
157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180
};

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

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

181 182 183 184 185 186 187 188 189
static inline bool __has_cursum_space(struct f2fs_summary_block *sum, int size,
								int type)
{
	if (type == NAT_JOURNAL)
		return nats_in_cursum(sum) + size <= NAT_JOURNAL_ENTRIES;

	return sits_in_cursum(sum) + size <= SIT_JOURNAL_ENTRIES;
}

190 191 192 193 194 195 196 197 198 199 200 201 202 203
/*
 * ioctl commands
 */
#define F2FS_IOC_GETFLAGS               FS_IOC_GETFLAGS
#define F2FS_IOC_SETFLAGS               FS_IOC_SETFLAGS

#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

204 205 206
/*
 * For INODE and NODE manager
 */
207 208 209 210 211 212 213
/*
 * 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)
214 215 216 217 218
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 已提交
219
					 * by get_data_block.
220
					 */
221 222
};

223 224
#define F2FS_LINK_MAX		32000	/* maximum link count per file */

225 226
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

227
/* for in-memory extent cache entry */
228 229
#define F2FS_MIN_EXTENT_LEN	16	/* minimum extent length */

230 231 232 233
struct extent_info {
	rwlock_t ext_lock;	/* rwlock for consistency */
	unsigned int fofs;	/* start offset in a file */
	u32 blk_addr;		/* start block address of the extent */
M
Masanari Iida 已提交
234
	unsigned int len;	/* length of the extent */
235 236 237 238 239 240
};

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

243 244
#define DEF_DIR_LEVEL		0

245 246 247 248
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 */
249
	unsigned char i_dir_level;	/* use for dentry level for large dir */
250
	unsigned int i_current_depth;	/* use only in directory structure */
251
	unsigned int i_pino;		/* parent inode number */
252 253 254 255
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
256
	struct rw_semaphore i_sem;	/* protect fi info */
257
	atomic_t dirty_pages;		/* # of dirty pages */
258 259 260
	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 */
261
	unsigned long long xattr_ver;	/* cp version of xattr modification */
262
	struct extent_info ext;		/* in-memory extent cache entry */
263
	struct dir_inode_entry *dirty_dir;	/* the pointer of dirty dir */
264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288
};

static inline void get_extent_info(struct extent_info *ext,
					struct f2fs_extent i_ext)
{
	write_lock(&ext->ext_lock);
	ext->fofs = le32_to_cpu(i_ext.fofs);
	ext->blk_addr = le32_to_cpu(i_ext.blk_addr);
	ext->len = le32_to_cpu(i_ext.len);
	write_unlock(&ext->ext_lock);
}

static inline void set_raw_extent(struct extent_info *ext,
					struct f2fs_extent *i_ext)
{
	read_lock(&ext->ext_lock);
	i_ext->fofs = cpu_to_le32(ext->fofs);
	i_ext->blk_addr = cpu_to_le32(ext->blk_addr);
	i_ext->len = cpu_to_le32(ext->len);
	read_unlock(&ext->ext_lock);
}

struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
289
	nid_t available_nids;		/* maximum available node ids */
290
	nid_t next_scan_nid;		/* the next nid to be scanned */
291
	unsigned int ram_thresh;	/* control the memory footprint */
292 293 294 295 296 297 298

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
	rwlock_t nat_tree_lock;		/* protect nat_tree_lock */
	unsigned int nat_cnt;		/* the # of cached nat entries */
	struct list_head nat_entries;	/* cached nat entry list (clean) */
	struct list_head dirty_nat_entries; /* cached nat entry list (dirty) */
299 300
	struct list_head nat_entry_set;	/* nat entry set list */
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
301 302

	/* free node ids management */
303
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331
	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)
{
332
	memset(dn, 0, sizeof(*dn));
333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365
	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 */
	NO_CHECK_TYPE
};

366 367
struct flush_cmd {
	struct completion wait;
368
	struct llist_node llnode;
369 370 371
	int ret;
};

372 373 374
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
375 376
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
377 378
};

379 380 381 382 383 384 385 386 387 388 389 390 391 392
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 */
393 394 395

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
396 397 398 399 400

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

402 403
	struct list_head sit_entry_set;	/* sit entry set list */

404 405
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
406
	unsigned int min_fsync_blocks;	/* threshold for fsync */
407 408

	/* for flush command control */
409 410
	struct flush_cmd_control *cmd_control_info;

411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430
};

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

/*
A
arter97 已提交
431
 * The below are the page types of bios used in submit_bio().
432 433 434 435 436 437 438 439 440
 * 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.
 */
441
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
442 443 444 445 446 447 448 449
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
};

J
Jaegeuk Kim 已提交
450
struct f2fs_io_info {
451 452
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
	int rw;			/* contains R/RS/W/WS with REQ_META/REQ_PRIO */
J
Jaegeuk Kim 已提交
453 454
};

455
#define is_read_io(rw)	(((rw) & 1) == READ)
456
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
457
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
458 459
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
460
	struct f2fs_io_info fio;	/* store buffered io info. */
461
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
462 463
};

464 465
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
466
	struct proc_dir_entry *s_proc;		/* proc entry */
467 468 469
	struct buffer_head *raw_super_buf;	/* buffer head of raw sb */
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
	int s_dirty;				/* dirty flag for checkpoint */
470
	bool need_fsck;				/* need fsck.f2fs to fix */
471 472 473 474 475 476 477

	/* 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 */
478 479

	/* for bio operations */
480
	struct f2fs_bio_info read_io;			/* for read bios */
481
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
482
	struct completion *wait_io;		/* for completion bios */
483 484 485 486

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
	struct inode *meta_inode;		/* cache meta blocks */
487
	struct mutex cp_mutex;			/* checkpoint procedure lock */
488
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
489
	struct rw_semaphore node_write;		/* locking node writes */
490
	struct mutex writepages;		/* mutex for writepages() */
H
Haicheng Li 已提交
491
	bool por_doing;				/* recovery is doing or not */
492
	wait_queue_head_t cp_wait;
493

J
Jaegeuk Kim 已提交
494
	/* for inode management */
495
	struct radix_tree_root ino_root[MAX_INO_ENTRY];	/* ino entry array */
J
Jaegeuk Kim 已提交
496 497 498 499
	spinlock_t ino_lock[MAX_INO_ENTRY];		/* for ino entry lock */
	struct list_head ino_list[MAX_INO_ENTRY];	/* inode list head */

	/* for orphan inode, use 0'th array */
500
	unsigned int n_orphans;			/* # of orphan inodes */
501
	unsigned int max_orphans;		/* max orphan inodes */
502 503 504 505 506

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

A
arter97 已提交
507
	/* basic filesystem units */
508 509 510 511 512 513 514 515 516 517 518 519 520 521 522
	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 */
523
	int dir_level;				/* directory level */
524 525 526 527 528 529 530 531 532 533 534 535 536

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

539 540 541
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

542 543 544 545
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
546
#ifdef CONFIG_F2FS_STAT_FS
547 548 549 550
	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 */
	int total_hit_ext, read_hit_ext;	/* extent cache hit ratio */
551
	int inline_inode;			/* # of inline_data inodes */
552
	int bg_gc;				/* background gc calls */
553 554 555
	unsigned int n_dirty_dirs;		/* # of dir inodes */
#endif
	unsigned int last_victim[2];		/* last victim segment # */
556
	spinlock_t stat_lock;			/* lock for stat operations */
557 558 559 560

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
561 562 563 564 565 566 567 568 569 570 571 572 573 574 575
};

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

576 577 578 579 580 581 582 583 584 585 586 587 588 589 590
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);
}

591 592 593 594 595 596 597 598 599 600
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);
}

601 602 603 604 605
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

606 607 608 609 610
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635
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 已提交
636 637 638 639 640
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

641 642 643 644 645
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

646 647 648 649 650 651 652 653 654 655
static inline void F2FS_SET_SB_DIRT(struct f2fs_sb_info *sbi)
{
	sbi->s_dirty = 1;
}

static inline void F2FS_RESET_SB_DIRT(struct f2fs_sb_info *sbi)
{
	sbi->s_dirty = 0;
}

656 657 658 659 660
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680
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);
}

681
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
682
{
683
	down_read(&sbi->cp_rwsem);
684 685
}

686
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
687
{
688
	up_read(&sbi->cp_rwsem);
689 690
}

691
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
692
{
J
Jaegeuk Kim 已提交
693
	f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
694 695
}

696
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
697
{
698
	up_write(&sbi->cp_rwsem);
699 700 701 702 703
}

/*
 * Check whether the given nid is within node id range.
 */
704
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
705
{
706 707
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
708
	if (unlikely(nid >= NM_I(sbi)->max_nid))
709 710
		return -EINVAL;
	return 0;
711 712 713 714 715 716 717 718 719 720
}

#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 已提交
721
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
722
	else
C
Chris Fries 已提交
723
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
724 725
}

726 727 728 729 730
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

731 732 733 734 735 736 737 738
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;
739
	if (unlikely(valid_block_count > sbi->user_block_count)) {
740 741 742 743 744 745 746 747 748 749
		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;
}

750
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
751 752 753 754
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
755 756
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
757 758 759 760 761 762 763 764 765 766 767
	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]);
	F2FS_SET_SB_DIRT(sbi);
}

768
static inline void inode_inc_dirty_pages(struct inode *inode)
769
{
770 771 772
	atomic_inc(&F2FS_I(inode)->dirty_pages);
	if (S_ISDIR(inode->i_mode))
		inc_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
773 774 775 776 777 778 779
}

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

780
static inline void inode_dec_dirty_pages(struct inode *inode)
781
{
782
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode))
783 784
		return;

785 786 787 788
	atomic_dec(&F2FS_I(inode)->dirty_pages);

	if (S_ISDIR(inode->i_mode))
		dec_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
789 790 791 792 793 794 795
}

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

796
static inline int get_dirty_pages(struct inode *inode)
797
{
798
	return atomic_read(&F2FS_I(inode)->dirty_pages);
799 800
}

801 802 803 804 805 806 807 808
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;
}

809 810
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
811
	return sbi->total_valid_block_count;
812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829
}

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

static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
830 831 832 833 834 835
	int offset;

	if (le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload) > 0) {
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
836
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
837 838
	} else {
		offset = (flag == NAT_BITMAP) ?
839
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
840 841
		return &ckpt->sit_nat_version_bitmap + offset;
	}
842 843 844 845 846 847
}

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

850
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
851 852 853

	/*
	 * odd numbered checkpoint should at cp segment 0
A
arter97 已提交
854
	 * and even segment must be at cp segment 1
855 856 857 858 859 860 861 862 863 864 865 866 867
	 */
	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,
868
						struct inode *inode)
869 870 871 872 873 874
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

875
	valid_block_count = sbi->total_valid_block_count + 1;
876
	if (unlikely(valid_block_count > sbi->user_block_count)) {
877 878 879 880
		spin_unlock(&sbi->stat_lock);
		return false;
	}

881
	valid_node_count = sbi->total_valid_node_count + 1;
882
	if (unlikely(valid_node_count > sbi->total_node_count)) {
883 884 885 886 887
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
888 889 890 891 892
		inode->i_blocks++;

	sbi->alloc_valid_block_count++;
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
893 894 895 896 897 898
	spin_unlock(&sbi->stat_lock);

	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
899
						struct inode *inode)
900 901 902
{
	spin_lock(&sbi->stat_lock);

903 904 905
	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);
906

907 908 909
	inode->i_blocks--;
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
910 911 912 913 914 915

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
916
	return sbi->total_valid_node_count;
917 918 919 920 921
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
	spin_lock(&sbi->stat_lock);
922
	f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
923 924 925 926
	sbi->total_valid_inode_count++;
	spin_unlock(&sbi->stat_lock);
}

927
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
928 929
{
	spin_lock(&sbi->stat_lock);
930
	f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
931 932 933 934 935 936
	sbi->total_valid_inode_count--;
	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
{
937
	return sbi->total_valid_inode_count;
938 939 940 941
}

static inline void f2fs_put_page(struct page *page, int unlock)
{
942
	if (!page)
943 944 945
		return;

	if (unlock) {
946
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962
		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,
963
					size_t size)
964
{
965
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
966 967
}

968 969 970 971 972 973 974 975 976 977 978 979 980 981
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;
}

982 983 984 985
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
986
	struct f2fs_node *p = F2FS_NODE(page);
987 988 989 990 991 992 993 994 995 996 997 998 999
	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;
1000
	raw_node = F2FS_NODE(node_page);
1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040
	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;
}

static inline int f2fs_set_bit(unsigned int nr, char *addr)
{
	int mask;
	int ret;

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

static inline int f2fs_clear_bit(unsigned int nr, char *addr)
{
	int mask;
	int ret;

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

/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1041
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1042
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1043 1044 1045
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1046
	FI_UPDATE_DIR,		/* should update inode block for consistency */
1047
	FI_DELAY_IPUT,		/* used for the recovery */
1048
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1049
	FI_INLINE_XATTR,	/* used for inline xattr */
1050
	FI_INLINE_DATA,		/* used for inline data*/
1051 1052
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
1053
	FI_NEED_IPU,		/* used fo ipu for fdatasync */
1054 1055 1056 1057
};

static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
{
J
Jaegeuk Kim 已提交
1058 1059
	if (!test_bit(flag, &fi->flags))
		set_bit(flag, &fi->flags);
1060 1061 1062 1063 1064 1065 1066 1067 1068
}

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 已提交
1069 1070
	if (test_bit(flag, &fi->flags))
		clear_bit(flag, &fi->flags);
1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087
}

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);
}

static inline int cond_clear_inode_flag(struct f2fs_inode_info *fi, int flag)
{
	if (is_inode_flag_set(fi, FI_ACL_MODE)) {
		clear_inode_flag(fi, FI_ACL_MODE);
		return 1;
	}
	return 0;
}

J
Jaegeuk Kim 已提交
1088 1089 1090 1091 1092
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);
1093 1094
	if (ri->i_inline & F2FS_INLINE_DATA)
		set_inode_flag(fi, FI_INLINE_DATA);
J
Jaegeuk Kim 已提交
1095 1096 1097 1098 1099 1100 1101 1102 1103
}

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;
1104 1105
	if (is_inode_flag_set(fi, FI_INLINE_DATA))
		ri->i_inline |= F2FS_INLINE_DATA;
J
Jaegeuk Kim 已提交
1106 1107
}

1108 1109 1110 1111 1112
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
}

1113 1114
static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
{
1115
	if (f2fs_has_inline_xattr(&fi->vfs_inode))
1116 1117 1118 1119
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1120 1121
static inline void *inline_xattr_addr(struct page *page)
{
1122
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1123 1124 1125 1126 1127 1128
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1129
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1130 1131 1132 1133 1134
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1135 1136 1137 1138 1139
static inline int f2fs_has_inline_data(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
}

1140 1141
static inline void *inline_data_addr(struct page *page)
{
1142
	struct f2fs_inode *ri = F2FS_INODE(page);
1143 1144 1145
	return (void *)&(ri->i_addr[1]);
}

J
Jaegeuk Kim 已提交
1146 1147 1148 1149 1150
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1151 1152 1153 1154 1155
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

1156 1157 1158 1159 1160 1161
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;
}

1162 1163 1164 1165
#define get_inode_mode(i) \
	((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1166 1167 1168 1169 1170 1171
/* 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))

1172 1173 1174 1175 1176
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1177
int truncate_blocks(struct inode *, u64, bool);
1178
void f2fs_truncate(struct inode *);
1179
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1180 1181
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1182
int truncate_data_blocks_range(struct dnode_of_data *, int);
1183
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1184
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1185 1186 1187 1188 1189 1190

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1191
int try_to_free_nats(struct f2fs_sb_info *, int);
1192
void update_inode(struct inode *, struct page *);
1193
void update_inode_page(struct inode *);
1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);

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

/*
 * dir.c
 */
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 *);
1211
int update_dent_inode(struct inode *, const struct qstr *);
1212
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *);
1213
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *);
1214
int f2fs_do_tmpfile(struct inode *, struct inode *);
1215 1216 1217
int f2fs_make_empty(struct inode *, struct inode *);
bool f2fs_empty_dir(struct inode *);

1218 1219 1220 1221 1222 1223
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
	return __f2fs_add_link(dentry->d_parent->d_inode, &dentry->d_name,
				inode);
}

1224 1225 1226 1227
/*
 * super.c
 */
int f2fs_sync_fs(struct super_block *, int);
1228 1229
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
1230 1231 1232 1233

/*
 * hash.c
 */
1234
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1235 1236 1237 1238 1239 1240 1241

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

1242
bool available_free_memory(struct f2fs_sb_info *, int);
1243 1244 1245
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool has_fsynced_inode(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
1246 1247 1248
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);
1249
int truncate_xattr_node(struct inode *, struct page *);
1250
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
G
Gu Zheng 已提交
1251
void remove_inode_page(struct inode *);
1252
struct page *new_inode_page(struct inode *);
1253
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
1254 1255 1256 1257 1258 1259 1260 1261
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);
1262
void recover_inline_xattr(struct inode *, struct page *);
1263
void recover_xattr_data(struct inode *, struct page *, block_t);
1264 1265 1266 1267 1268 1269
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 *);
1270
int __init create_node_manager_caches(void);
1271 1272 1273 1274 1275 1276
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
void f2fs_balance_fs(struct f2fs_sb_info *);
1277
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
1278
int f2fs_issue_flush(struct f2fs_sb_info *);
1279 1280
int create_flush_cmd_control(struct f2fs_sb_info *);
void destroy_flush_cmd_control(struct f2fs_sb_info *);
1281
void invalidate_blocks(struct f2fs_sb_info *, block_t);
1282
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
1283
void clear_prefree_segments(struct f2fs_sb_info *);
1284
void release_discard_addrs(struct f2fs_sb_info *);
1285
void discard_next_dnode(struct f2fs_sb_info *, block_t);
1286 1287
int npages_for_summary_flush(struct f2fs_sb_info *);
void allocate_new_segments(struct f2fs_sb_info *);
1288
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
1289
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
1290
void write_meta_page(struct f2fs_sb_info *, struct page *);
1291 1292
void write_node_page(struct f2fs_sb_info *, struct page *,
		struct f2fs_io_info *, unsigned int, block_t, block_t *);
J
Jaegeuk Kim 已提交
1293 1294 1295
void write_data_page(struct page *, struct dnode_of_data *, block_t *,
					struct f2fs_io_info *);
void rewrite_data_page(struct page *, block_t, struct f2fs_io_info *);
1296 1297
void recover_data_page(struct f2fs_sb_info *, struct page *,
				struct f2fs_summary *, block_t, block_t);
1298 1299
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
1300
void f2fs_wait_on_page_writeback(struct page *, enum page_type);
1301 1302 1303 1304
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);
1305
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
1306 1307
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
1308 1309
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
1310 1311 1312 1313 1314 1315

/*
 * checkpoint.c
 */
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
1316 1317
struct page *get_meta_page_ra(struct f2fs_sb_info *, pgoff_t);
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int);
1318
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
1319 1320
void add_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
void remove_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
1321
void release_dirty_inode(struct f2fs_sb_info *);
1322
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
J
Jaegeuk Kim 已提交
1323 1324
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
1325 1326
void add_orphan_inode(struct f2fs_sb_info *, nid_t);
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
1327
void recover_orphan_inodes(struct f2fs_sb_info *);
1328
int get_valid_checkpoint(struct f2fs_sb_info *);
1329
void update_dirty_page(struct inode *, struct page *);
1330
void add_dirty_dir_inode(struct inode *);
1331 1332
void remove_dirty_dir_inode(struct inode *);
void sync_dirty_dir_inodes(struct f2fs_sb_info *);
1333
void write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
1334
void init_ino_entry_info(struct f2fs_sb_info *);
1335
int __init create_checkpoint_caches(void);
1336 1337 1338 1339 1340
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
J
Jaegeuk Kim 已提交
1341
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
1342 1343
int f2fs_submit_page_bio(struct f2fs_sb_info *, struct page *, block_t, int);
void f2fs_submit_page_mbio(struct f2fs_sb_info *, struct page *, block_t,
J
Jaegeuk Kim 已提交
1344
						struct f2fs_io_info *);
1345
int reserve_new_block(struct dnode_of_data *);
1346
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
1347
void update_extent_cache(block_t, struct dnode_of_data *);
1348
struct page *find_data_page(struct inode *, pgoff_t, bool);
1349
struct page *get_lock_data_page(struct inode *, pgoff_t);
1350
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
J
Jaegeuk Kim 已提交
1351
int do_write_data_page(struct page *, struct f2fs_io_info *);
J
Jaegeuk Kim 已提交
1352
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
1353 1354 1355 1356 1357 1358

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
1359
block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
J
Jaegeuk Kim 已提交
1360
int f2fs_gc(struct f2fs_sb_info *);
1361
void build_gc_manager(struct f2fs_sb_info *);
1362
int __init create_gc_caches(void);
1363 1364 1365 1366 1367
void destroy_gc_caches(void);

/*
 * recovery.c
 */
1368
int recover_fsync_data(struct f2fs_sb_info *);
1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383
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;
	int hit_ext, total_ext;
	int ndirty_node, ndirty_dent, ndirty_dirs, ndirty_meta;
	int nats, sits, fnids;
	int total_count, utilization;
1384
	int bg_gc, inline_inode;
1385 1386 1387 1388 1389
	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;
1390
	int prefree_count, call_count, cp_count;
1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
	int tot_blks, data_blks, node_blks;
	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];
	unsigned base_mem, cache_mem;
};

1402 1403
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
1404
	return (struct f2fs_stat_info *)sbi->stat_info;
1405 1406
}

1407
#define stat_inc_cp_count(si)		((si)->cp_count++)
1408 1409 1410 1411 1412 1413
#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++)
1414 1415 1416
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1417
			((F2FS_I_SB(inode))->inline_inode++);		\
1418 1419 1420 1421
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1422
			((F2FS_I_SB(inode))->inline_inode--);		\
1423 1424
	} while (0)

1425 1426 1427 1428
#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]++)
1429 1430 1431

#define stat_inc_seg_count(sbi, type)					\
	do {								\
1432
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444
		(si)->tot_segs++;					\
		if (type == SUM_TYPE_DATA)				\
			si->data_segs++;				\
		else							\
			si->node_segs++;				\
	} while (0)

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

#define stat_inc_data_blk_count(sbi, blks)				\
	do {								\
1445
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1446 1447 1448 1449 1450 1451
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
	} while (0)

#define stat_inc_node_blk_count(sbi, blks)				\
	do {								\
1452
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
1453 1454 1455 1456 1457 1458
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
1459
void __init f2fs_create_root_stats(void);
1460
void f2fs_destroy_root_stats(void);
1461
#else
1462
#define stat_inc_cp_count(si)
1463
#define stat_inc_call_count(si)
1464 1465 1466 1467 1468
#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)
1469 1470
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
1471 1472
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
1473 1474 1475 1476 1477 1478 1479
#define stat_inc_seg_count(si, type)
#define stat_inc_tot_blk_count(si, blks)
#define stat_inc_data_blk_count(si, blks)
#define stat_inc_node_blk_count(sbi, blks)

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
1480
static inline void __init f2fs_create_root_stats(void) { }
1481
static inline void f2fs_destroy_root_stats(void) { }
1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492
#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;
1493

1494 1495 1496 1497 1498
/*
 * inline.c
 */
bool f2fs_may_inline(struct inode *);
int f2fs_read_inline_data(struct inode *, struct page *);
1499
int f2fs_convert_inline_data(struct inode *, pgoff_t, struct page *);
1500
int f2fs_write_inline_data(struct inode *, struct page *, unsigned int);
1501
void truncate_inline_data(struct inode *, u64);
1502
bool recover_inline_data(struct inode *, struct page *);
1503
#endif