f2fs.h 68.6 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
#include <linux/vmalloc.h>
J
Jaegeuk Kim 已提交
23
#include <linux/bio.h>
24
#include <linux/blkdev.h>
25

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

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

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

68 69 70 71
typedef u32 block_t;	/*
			 * should not change u32, since it is the on-disk block
			 * address format, __le32.
			 */
72 73 74 75 76 77
typedef u32 nid_t;

struct f2fs_mount_info {
	unsigned int	opt;
};

78 79
#define F2FS_FEATURE_ENCRYPT	0x0001

80 81 82 83 84 85 86
#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 已提交
87 88 89
#define CRCPOLY_LE 0xedb88320

static inline __u32 f2fs_crc32(void *buf, size_t len)
90
{
J
Jaegeuk Kim 已提交
91 92 93 94 95 96 97 98 99 100
	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;
101 102
}

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

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

116 117
enum {
	CP_UMOUNT,
118
	CP_FASTBOOT,
119
	CP_SYNC,
120
	CP_RECOVERY,
121
	CP_DISCARD,
122 123
};

J
Jaegeuk Kim 已提交
124 125 126
#define DEF_BATCHED_TRIM_SECTIONS	32
#define BATCHED_TRIM_SEGMENTS(sbi)	\
		(SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
127 128
#define BATCHED_TRIM_BLOCKS(sbi)	\
		(BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
129
#define DEF_CP_INTERVAL			60	/* 60 secs */
130
#define DEF_IDLE_INTERVAL		120	/* 2 mins */
J
Jaegeuk Kim 已提交
131

132 133
struct cp_control {
	int reason;
134 135 136 137
	__u64 trim_start;
	__u64 trim_end;
	__u64 trim_minlen;
	__u64 trimmed;
138 139
};

140
/*
141
 * For CP/NAT/SIT/SSA readahead
142 143 144 145
 */
enum {
	META_CP,
	META_NAT,
146
	META_SIT,
147 148
	META_SSA,
	META_POR,
149 150
};

J
Jaegeuk Kim 已提交
151 152 153
/* for the list of ino */
enum {
	ORPHAN_INO,		/* for orphan ino list */
154 155
	APPEND_INO,		/* for append ino list */
	UPDATE_INO,		/* for update ino list */
J
Jaegeuk Kim 已提交
156 157 158 159
	MAX_INO_ENTRY,		/* max. list */
};

struct ino_entry {
160 161 162 163
	struct list_head list;	/* list head */
	nid_t ino;		/* inode number */
};

164
/* for the list of inodes to be GCed */
165
struct inode_entry {
166 167 168 169
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
};

170 171 172 173 174 175 176
/* for the list of blockaddresses to be discarded */
struct discard_entry {
	struct list_head list;	/* list head */
	block_t blkaddr;	/* block address to be discarded */
	int len;		/* # of consecutive blocks of the discard */
};

177 178 179 180
/* for the list of fsync inodes, used only during recovery */
struct fsync_inode_entry {
	struct list_head list;	/* list head */
	struct inode *inode;	/* vfs inode pointer */
181 182 183
	block_t blkaddr;	/* block address locating the last fsync */
	block_t last_dentry;	/* block address locating the last dentry */
	block_t last_inode;	/* block address locating the last inode */
184 185 186 187 188 189 190 191 192 193
};

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

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

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

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

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

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

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

#define F2FS_IOCTL_MAGIC		0xf5
#define F2FS_IOC_START_ATOMIC_WRITE	_IO(F2FS_IOCTL_MAGIC, 1)
#define F2FS_IOC_COMMIT_ATOMIC_WRITE	_IO(F2FS_IOCTL_MAGIC, 2)
229
#define F2FS_IOC_START_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 3)
230 231
#define F2FS_IOC_RELEASE_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 4)
#define F2FS_IOC_ABORT_VOLATILE_WRITE	_IO(F2FS_IOCTL_MAGIC, 5)
232
#define F2FS_IOC_GARBAGE_COLLECT	_IO(F2FS_IOCTL_MAGIC, 6)
233
#define F2FS_IOC_WRITE_CHECKPOINT	_IO(F2FS_IOCTL_MAGIC, 7)
C
Chao Yu 已提交
234
#define F2FS_IOC_DEFRAGMENT		_IO(F2FS_IOCTL_MAGIC, 8)
235

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

J
Jaegeuk Kim 已提交
243 244 245 246 247 248 249 250
/*
 * 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 */
251
#define F2FS_GOING_DOWN_METAFLUSH	0x3	/* going down with meta flush */
J
Jaegeuk Kim 已提交
252

253 254 255 256
#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
/*
 * ioctl commands in 32 bit emulation
 */
257 258 259
#define F2FS_IOC32_GETFLAGS		FS_IOC32_GETFLAGS
#define F2FS_IOC32_SETFLAGS		FS_IOC32_SETFLAGS
#define F2FS_IOC32_GETVERSION		FS_IOC32_GETVERSION
260 261
#endif

C
Chao Yu 已提交
262 263 264 265 266
struct f2fs_defragment {
	u64 start;
	u64 len;
};

267 268 269
/*
 * For INODE and NODE manager
 */
270
/* for directory operations */
271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289
struct f2fs_str {
	unsigned char *name;
	u32 len;
};

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

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

290
struct f2fs_dentry_ptr {
291
	struct inode *inode;
292 293 294 295 296 297
	const void *bitmap;
	struct f2fs_dir_entry *dentry;
	__u8 (*filename)[F2FS_SLOT_LEN];
	int max;
};

298 299
static inline void make_dentry_ptr(struct inode *inode,
		struct f2fs_dentry_ptr *d, void *src, int type)
300
{
301 302
	d->inode = inode;

303 304 305 306 307 308 309 310 311 312 313 314 315 316 317
	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;
	}
}

318 319 320 321 322 323 324
/*
 * 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)
325 326 327 328 329
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 已提交
330
					 * by get_data_block.
331
					 */
332 333
};

334
#define F2FS_LINK_MAX	0xffffffff	/* maximum link count per file */
335

336 337
#define MAX_DIR_RA_PAGES	4	/* maximum ra pages of dir */

338 339 340
/* vector size for gang look-up from extent cache that consists of radix tree */
#define EXT_TREE_VEC_SIZE	64

341
/* for in-memory extent cache entry */
342 343 344 345
#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
346

347
struct extent_info {
348 349 350 351 352 353 354 355 356 357 358 359 360 361
	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 */
362
	struct extent_node *cached_en;	/* recently accessed extent node */
J
Jaegeuk Kim 已提交
363
	struct extent_info largest;	/* largested extent info */
364
	struct list_head list;		/* to be used by sbi->zombie_list */
365
	rwlock_t lock;			/* protect extent info rb-tree */
366
	atomic_t node_cnt;		/* # of extent node in rb-tree*/
367 368
};

J
Jaegeuk Kim 已提交
369 370 371 372 373 374 375
/*
 * This structure is taken from ext4_map_blocks.
 *
 * Note that, however, f2fs uses NEW and MAPPED flags for f2fs_map_blocks().
 */
#define F2FS_MAP_NEW		(1 << BH_New)
#define F2FS_MAP_MAPPED		(1 << BH_Mapped)
376 377 378
#define F2FS_MAP_UNWRITTEN	(1 << BH_Unwritten)
#define F2FS_MAP_FLAGS		(F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
				F2FS_MAP_UNWRITTEN)
J
Jaegeuk Kim 已提交
379 380 381 382 383 384 385 386

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

C
Chao Yu 已提交
387 388 389 390 391 392
/* for flag in get_data_block */
#define F2FS_GET_BLOCK_READ		0
#define F2FS_GET_BLOCK_DIO		1
#define F2FS_GET_BLOCK_FIEMAP		2
#define F2FS_GET_BLOCK_BMAP		3

393 394 395 396
/*
 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
 */
#define FADVISE_COLD_BIT	0x01
397
#define FADVISE_LOST_PINO_BIT	0x02
398
#define FADVISE_ENCRYPT_BIT	0x04
399
#define FADVISE_ENC_NAME_BIT	0x08
400

401 402 403 404 405 406
#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)
407 408 409
#define file_is_encrypt(inode)	is_file(inode, FADVISE_ENCRYPT_BIT)
#define file_set_encrypt(inode)	set_file(inode, FADVISE_ENCRYPT_BIT)
#define file_clear_encrypt(inode) clear_file(inode, FADVISE_ENCRYPT_BIT)
410 411
#define file_enc_name(inode)	is_file(inode, FADVISE_ENC_NAME_BIT)
#define file_set_enc_name(inode) set_file(inode, FADVISE_ENC_NAME_BIT)
412 413 414 415 416 417 418

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

420 421
#include "f2fs_crypto.h"

422 423
#define DEF_DIR_LEVEL		0

424 425 426 427
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 */
428
	unsigned char i_dir_level;	/* use for dentry level for large dir */
429
	unsigned int i_current_depth;	/* use only in directory structure */
430
	unsigned int i_pino;		/* parent inode number */
431 432 433 434
	umode_t i_acl_mode;		/* keep file acl mode temporarily */

	/* Use below internally in f2fs*/
	unsigned long flags;		/* use to pass per-file flags */
435
	struct rw_semaphore i_sem;	/* protect fi info */
436
	atomic_t dirty_pages;		/* # of dirty pages */
437 438 439
	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 */
440
	unsigned long long xattr_ver;	/* cp version of xattr modification */
J
Jaegeuk Kim 已提交
441

442
	struct list_head dirty_list;	/* linked in global dirty list */
J
Jaegeuk Kim 已提交
443 444
	struct list_head inmem_pages;	/* inmemory pages managed by f2fs */
	struct mutex inmem_lock;	/* lock for inmemory pages */
445

J
Jaegeuk Kim 已提交
446 447
	struct extent_tree *extent_tree;	/* cached extent_tree entry */

448 449 450 451
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	/* Encryption params */
	struct f2fs_crypt_info *i_crypt_info;
#endif
452 453 454 455 456 457
};

static inline void get_extent_info(struct extent_info *ext,
					struct f2fs_extent i_ext)
{
	ext->fofs = le32_to_cpu(i_ext.fofs);
458
	ext->blk = le32_to_cpu(i_ext.blk);
459 460 461 462 463 464 465
	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);
466
	i_ext->blk = cpu_to_le32(ext->blk);
467 468 469
	i_ext->len = cpu_to_le32(ext->len);
}

470 471 472 473 474 475 476 477
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;
}

478 479 480 481 482 483 484
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);
}

485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503
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);
}

504 505 506 507 508 509 510
static inline void __try_update_largest_extent(struct extent_tree *et,
						struct extent_node *en)
{
	if (en->ei.len > et->largest.len)
		et->largest = en->ei;
}

511 512 513
struct f2fs_nm_info {
	block_t nat_blkaddr;		/* base disk address of NAT */
	nid_t max_nid;			/* maximum possible node ids */
514
	nid_t available_nids;		/* maximum available node ids */
515
	nid_t next_scan_nid;		/* the next nid to be scanned */
516
	unsigned int ram_thresh;	/* control the memory footprint */
C
Chao Yu 已提交
517
	unsigned int ra_nid_pages;	/* # of nid pages to be readaheaded */
C
Chao Yu 已提交
518
	unsigned int dirty_nats_ratio;	/* control dirty nats ratio threshold */
519 520 521

	/* NAT cache management */
	struct radix_tree_root nat_root;/* root of the nat entry cache */
522
	struct radix_tree_root nat_set_root;/* root of the nat set cache */
523
	struct rw_semaphore nat_tree_lock;	/* protect nat_tree_lock */
524
	struct list_head nat_entries;	/* cached nat entry list (clean) */
525
	unsigned int nat_cnt;		/* the # of cached nat entries */
526
	unsigned int dirty_nat_cnt;	/* total num of nat entries in set */
527 528

	/* free node ids management */
529
	struct radix_tree_root free_nid_root;/* root of the free_nid cache */
530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551
	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 */
552
	bool node_changed;		/* is node block changed */
553 554 555 556 557 558
	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)
{
559
	memset(dn, 0, sizeof(*dn));
560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589
	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 */
590 591
	NO_CHECK_TYPE,
	CURSEG_DIRECT_IO,	/* to use for the direct IO path */
592 593
};

594 595
struct flush_cmd {
	struct completion wait;
596
	struct llist_node llnode;
597 598 599
	int ret;
};

600 601 602
struct flush_cmd_control {
	struct task_struct *f2fs_issue_flush;	/* flush thread */
	wait_queue_head_t flush_wait_queue;	/* waiting queue for wake-up */
603 604
	struct llist_head issue_list;		/* list for command issue */
	struct llist_node *dispatch_list;	/* list for command dispatch */
605 606
};

607 608 609 610 611 612 613 614 615 616 617 618 619 620
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 */
621 622 623

	/* a threshold to reclaim prefree segments */
	unsigned int rec_prefree_segments;
624 625 626 627 628

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

J
Jaegeuk Kim 已提交
630 631 632
	/* for batched trimming */
	unsigned int trim_sections;		/* # of sections to trim */

633 634
	struct list_head sit_entry_set;	/* sit entry set list */

635 636
	unsigned int ipu_policy;	/* in-place-update policy */
	unsigned int min_ipu_util;	/* in-place-update threshold */
637
	unsigned int min_fsync_blocks;	/* threshold for fsync */
638 639

	/* for flush command control */
640 641
	struct flush_cmd_control *cmd_control_info;

642 643 644 645 646 647 648 649 650 651 652 653 654 655
};

/*
 * 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,
656
	F2FS_DIRTY_DATA,
657 658
	F2FS_DIRTY_NODES,
	F2FS_DIRTY_META,
659
	F2FS_INMEM_PAGES,
660 661 662 663
	NR_COUNT_TYPE,
};

/*
A
arter97 已提交
664
 * The below are the page types of bios used in submit_bio().
665 666 667 668 669 670 671 672 673
 * 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.
 */
674
#define PAGE_TYPE_OF_BIO(type)	((type) > META ? META : (type))
675 676 677 678 679 680
enum page_type {
	DATA,
	NODE,
	META,
	NR_PAGE_TYPE,
	META_FLUSH,
681 682 683 684
	INMEM,		/* the below types are used by tracepoints only. */
	INMEM_DROP,
	IPU,
	OPU,
685 686
};

J
Jaegeuk Kim 已提交
687
struct f2fs_io_info {
688
	struct f2fs_sb_info *sbi;	/* f2fs_sb_info pointer */
689 690
	enum page_type type;	/* contains DATA/NODE/META/META_FLUSH */
	int rw;			/* contains R/RS/W/WS with REQ_META/REQ_PRIO */
691
	block_t blk_addr;	/* block address to be written */
692
	struct page *page;	/* page to be written */
693
	struct page *encrypted_page;	/* encrypted page */
J
Jaegeuk Kim 已提交
694 695
};

696
#define is_read_io(rw)	(((rw) & 1) == READ)
697
struct f2fs_bio_info {
J
Jaegeuk Kim 已提交
698
	struct f2fs_sb_info *sbi;	/* f2fs superblock */
699 700
	struct bio *bio;		/* bios to merge */
	sector_t last_block_in_bio;	/* last block number */
J
Jaegeuk Kim 已提交
701
	struct f2fs_io_info fio;	/* store buffered io info. */
702
	struct rw_semaphore io_rwsem;	/* blocking op for bio */
703 704
};

705 706 707 708 709 710
enum inode_type {
	DIR_INODE,			/* for dirty dir inode */
	FILE_INODE,			/* for dirty regular/symlink inode */
	NR_INODE_TYPE,
};

711 712 713 714 715 716 717 718
/* 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 */
};

719 720 721 722 723 724 725 726
/* 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 */
};

727 728
enum {
	CP_TIME,
729
	REQ_TIME,
730 731 732
	MAX_TIME,
};

733 734
struct f2fs_sb_info {
	struct super_block *sb;			/* pointer to VFS super block */
735
	struct proc_dir_entry *s_proc;		/* proc entry */
736
	struct f2fs_super_block *raw_super;	/* raw super block pointer */
737
	int valid_super_block;			/* valid super block no */
738
	int s_flag;				/* flags for sbi */
739 740 741 742 743 744 745

	/* 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 */
746 747

	/* for bio operations */
748
	struct f2fs_bio_info read_io;			/* for read bios */
749
	struct f2fs_bio_info write_io[NR_PAGE_TYPE];	/* for write bios */
750 751 752 753

	/* for checkpoint */
	struct f2fs_checkpoint *ckpt;		/* raw checkpoint pointer */
	struct inode *meta_inode;		/* cache meta blocks */
754
	struct mutex cp_mutex;			/* checkpoint procedure lock */
755
	struct rw_semaphore cp_rwsem;		/* blocking FS operations */
756
	struct rw_semaphore node_write;		/* locking node writes */
757
	struct mutex writepages;		/* mutex for writepages() */
758
	wait_queue_head_t cp_wait;
759 760
	unsigned long last_time[MAX_TIME];	/* to store time in jiffies */
	long interval_time[MAX_TIME];		/* to store thresholds */
761

762
	struct inode_management im[MAX_INO_ENTRY];      /* manage inode cache */
J
Jaegeuk Kim 已提交
763 764

	/* for orphan inode, use 0'th array */
765
	unsigned int max_orphans;		/* max orphan inodes */
766

767 768 769
	/* for inode management */
	struct list_head inode_list[NR_INODE_TYPE];	/* dirty inode list */
	spinlock_t inode_lock[NR_INODE_TYPE];	/* for dirty inode list lock */
770

771 772 773 774 775
	/* 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 */
776
	atomic_t total_ext_tree;		/* extent tree count */
777
	struct list_head zombie_list;		/* extent zombie tree list */
778
	atomic_t total_zombie_tree;		/* extent zombie tree count */
779 780
	atomic_t total_ext_node;		/* extent info count */

A
arter97 已提交
781
	/* basic filesystem units */
782 783 784 785 786 787 788 789 790 791 792 793 794 795
	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 */
C
Chao Yu 已提交
796
	loff_t max_file_blocks;			/* max block index of file */
797
	int active_logs;			/* # of active logs */
798
	int dir_level;				/* directory level */
799 800 801 802

	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 */
803
	block_t discard_blks;			/* discard command candidats */
804 805 806 807 808 809 810 811 812
	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 */
813
	unsigned int cur_victim_sec;		/* current victim section num */
814

815 816 817
	/* maximum # of trials to find a victim segment for SSR and GC */
	unsigned int max_victim_search;

818 819 820 821
	/*
	 * for stat information.
	 * one is for the LFS mode, and the other is for the SSR mode.
	 */
822
#ifdef CONFIG_F2FS_STAT_FS
823 824 825
	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 */
826
	atomic_t inplace_count;		/* # of inplace update */
827 828 829 830
	atomic64_t total_hit_ext;		/* # of lookup extent cache */
	atomic64_t read_hit_rbtree;		/* # of hit rbtree extent node */
	atomic64_t read_hit_largest;		/* # of hit largest extent node */
	atomic64_t read_hit_cached;		/* # of hit cached extent node */
C
Chao Yu 已提交
831
	atomic_t inline_xattr;			/* # of inline_xattr inodes */
832 833
	atomic_t inline_inode;			/* # of inline_data inodes */
	atomic_t inline_dir;			/* # of inline_dentry inodes */
834
	int bg_gc;				/* background gc calls */
C
Chao Yu 已提交
835
	unsigned int ndirty_inode[NR_INODE_TYPE];	/* # of dirty inodes */
836 837
#endif
	unsigned int last_victim[2];		/* last victim segment # */
838
	spinlock_t stat_lock;			/* lock for stat operations */
839 840 841 842

	/* For sysfs suppport */
	struct kobject s_kobj;
	struct completion s_kobj_unregister;
843 844 845 846 847

	/* For shrinker support */
	struct list_head s_list;
	struct mutex umount_mutex;
	unsigned int shrinker_run_no;
848 849
};

850 851 852 853 854 855 856 857 858 859 860 861 862
static inline void f2fs_update_time(struct f2fs_sb_info *sbi, int type)
{
	sbi->last_time[type] = jiffies;
}

static inline bool f2fs_time_over(struct f2fs_sb_info *sbi, int type)
{
	struct timespec ts = {sbi->interval_time[type], 0};
	unsigned long interval = timespec_to_jiffies(&ts);

	return time_after(jiffies, sbi->last_time[type] + interval);
}

863 864 865 866 867 868 869 870 871 872 873 874
static inline bool is_idle(struct f2fs_sb_info *sbi)
{
	struct block_device *bdev = sbi->sb->s_bdev;
	struct request_queue *q = bdev_get_queue(bdev);
	struct request_list *rl = &q->root_rl;

	if (rl->count[BLK_RW_SYNC] || rl->count[BLK_RW_ASYNC])
		return 0;

	return f2fs_time_over(sbi, REQ_TIME);
}

875 876 877 878 879 880 881 882 883 884 885 886 887
/*
 * 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;
}

888 889 890 891 892 893 894 895 896 897 898 899 900 901 902
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);
}

903 904 905 906 907 908 909 910 911 912
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);
}

913 914 915 916 917
static inline struct f2fs_node *F2FS_NODE(struct page *page)
{
	return (struct f2fs_node *)page_address(page);
}

918 919 920 921 922
static inline struct f2fs_inode *F2FS_INODE(struct page *page)
{
	return &((struct f2fs_node *)page_address(page))->i;
}

923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947
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 已提交
948 949 950 951 952
static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->meta_inode->i_mapping;
}

953 954 955 956 957
static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
{
	return sbi->node_inode->i_mapping;
}

958 959 960 961 962 963
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)
964
{
965
	sbi->s_flag |= (0x01 << type);
966 967
}

968
static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
969
{
970
	sbi->s_flag &= ~(0x01 << type);
971 972
}

973 974 975 976 977
static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
{
	return le64_to_cpu(cp->checkpoint_ver);
}

978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997
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);
}

998
static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
999
{
1000
	down_read(&sbi->cp_rwsem);
1001 1002
}

1003
static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
1004
{
1005
	up_read(&sbi->cp_rwsem);
1006 1007
}

1008
static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
1009
{
J
Jaegeuk Kim 已提交
1010
	f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
1011 1012
}

1013
static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
1014
{
1015
	up_write(&sbi->cp_rwsem);
1016 1017
}

1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039
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));
}

1040 1041 1042
/*
 * Check whether the given nid is within node id range.
 */
1043
static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
1044
{
1045 1046
	if (unlikely(nid < F2FS_ROOT_INO(sbi)))
		return -EINVAL;
1047
	if (unlikely(nid >= NM_I(sbi)->max_nid))
1048 1049
		return -EINVAL;
	return 0;
1050 1051 1052 1053 1054 1055 1056 1057 1058 1059
}

#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 已提交
1060
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
1061
	else
C
Chris Fries 已提交
1062
		return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
1063 1064
}

1065 1066 1067 1068 1069
static inline bool f2fs_has_xattr_block(unsigned int ofs)
{
	return ofs == XATTR_NODE_OFFSET;
}

1070 1071 1072 1073 1074 1075 1076 1077
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;
1078
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1079 1080 1081 1082 1083 1084 1085 1086 1087 1088
		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;
}

1089
static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
1090 1091 1092 1093
						struct inode *inode,
						blkcnt_t count)
{
	spin_lock(&sbi->stat_lock);
1094 1095
	f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
	f2fs_bug_on(sbi, inode->i_blocks < count);
1096 1097 1098 1099 1100 1101 1102 1103
	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]);
1104
	set_sbi_flag(sbi, SBI_IS_DIRTY);
1105 1106
}

1107
static inline void inode_inc_dirty_pages(struct inode *inode)
1108
{
1109
	atomic_inc(&F2FS_I(inode)->dirty_pages);
1110 1111
	inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1112 1113 1114 1115 1116 1117 1118
}

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

1119
static inline void inode_dec_dirty_pages(struct inode *inode)
1120
{
1121 1122
	if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
			!S_ISLNK(inode->i_mode))
1123 1124
		return;

1125
	atomic_dec(&F2FS_I(inode)->dirty_pages);
1126 1127
	dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
				F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
1128 1129 1130 1131 1132 1133 1134
}

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

1135
static inline int get_dirty_pages(struct inode *inode)
1136
{
1137
	return atomic_read(&F2FS_I(inode)->dirty_pages);
1138 1139
}

1140 1141
static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
{
1142
	unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
1143 1144 1145 1146
	return ((get_pages(sbi, block_type) + pages_per_sec - 1)
			>> sbi->log_blocks_per_seg) / sbi->segs_per_sec;
}

1147 1148
static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
{
1149
	return sbi->total_valid_block_count;
1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164
}

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 已提交
1165 1166 1167 1168 1169
static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
{
	return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
}

1170 1171 1172
static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
{
	struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
C
Changman Lee 已提交
1173 1174
	int offset;

W
Wanpeng Li 已提交
1175
	if (__cp_payload(sbi) > 0) {
C
Changman Lee 已提交
1176 1177 1178
		if (flag == NAT_BITMAP)
			return &ckpt->sit_nat_version_bitmap;
		else
J
Jaegeuk Kim 已提交
1179
			return (unsigned char *)ckpt + F2FS_BLKSIZE;
C
Changman Lee 已提交
1180 1181
	} else {
		offset = (flag == NAT_BITMAP) ?
1182
			le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
C
Changman Lee 已提交
1183 1184
		return &ckpt->sit_nat_version_bitmap + offset;
	}
1185 1186 1187 1188 1189 1190
}

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

1193
	start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
1194 1195 1196

	/*
	 * odd numbered checkpoint should at cp segment 0
A
arter97 已提交
1197
	 * and even segment must be at cp segment 1
1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210
	 */
	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,
1211
						struct inode *inode)
1212 1213 1214 1215 1216 1217
{
	block_t	valid_block_count;
	unsigned int valid_node_count;

	spin_lock(&sbi->stat_lock);

1218
	valid_block_count = sbi->total_valid_block_count + 1;
1219
	if (unlikely(valid_block_count > sbi->user_block_count)) {
1220 1221 1222 1223
		spin_unlock(&sbi->stat_lock);
		return false;
	}

1224
	valid_node_count = sbi->total_valid_node_count + 1;
1225
	if (unlikely(valid_node_count > sbi->total_node_count)) {
1226 1227 1228 1229 1230
		spin_unlock(&sbi->stat_lock);
		return false;
	}

	if (inode)
1231 1232 1233 1234 1235
		inode->i_blocks++;

	sbi->alloc_valid_block_count++;
	sbi->total_valid_node_count++;
	sbi->total_valid_block_count++;
1236 1237 1238 1239 1240 1241
	spin_unlock(&sbi->stat_lock);

	return true;
}

static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
1242
						struct inode *inode)
1243 1244 1245
{
	spin_lock(&sbi->stat_lock);

1246 1247 1248
	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);
1249

1250 1251 1252
	inode->i_blocks--;
	sbi->total_valid_node_count--;
	sbi->total_valid_block_count--;
1253 1254 1255 1256 1257 1258

	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
{
1259
	return sbi->total_valid_node_count;
1260 1261 1262 1263 1264
}

static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
{
	spin_lock(&sbi->stat_lock);
1265
	f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
1266 1267 1268 1269
	sbi->total_valid_inode_count++;
	spin_unlock(&sbi->stat_lock);
}

1270
static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
1271 1272
{
	spin_lock(&sbi->stat_lock);
1273
	f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
1274 1275 1276 1277 1278 1279
	sbi->total_valid_inode_count--;
	spin_unlock(&sbi->stat_lock);
}

static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
{
1280
	return sbi->total_valid_inode_count;
1281 1282
}

1283 1284 1285 1286 1287 1288 1289 1290
static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
						pgoff_t index, bool for_write)
{
	if (!for_write)
		return grab_cache_page(mapping, index);
	return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
}

1291 1292 1293 1294 1295 1296 1297 1298 1299 1300
static inline void f2fs_copy_page(struct page *src, struct page *dst)
{
	char *src_kaddr = kmap(src);
	char *dst_kaddr = kmap(dst);

	memcpy(dst_kaddr, src_kaddr, PAGE_SIZE);
	kunmap(dst);
	kunmap(src);
}

1301 1302
static inline void f2fs_put_page(struct page *page, int unlock)
{
1303
	if (!page)
1304 1305 1306
		return;

	if (unlock) {
1307
		f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323
		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,
1324
					size_t size)
1325
{
1326
	return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
1327 1328
}

1329 1330 1331 1332 1333
static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
						gfp_t flags)
{
	void *entry;

1334 1335 1336
	entry = kmem_cache_alloc(cachep, flags);
	if (!entry)
		entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
1337 1338 1339
	return entry;
}

J
Jaegeuk Kim 已提交
1340 1341 1342 1343 1344 1345
static inline struct bio *f2fs_bio_alloc(int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
1346 1347
	if (!bio)
		bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
J
Jaegeuk Kim 已提交
1348 1349 1350
	return bio;
}

1351 1352 1353 1354 1355 1356 1357
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();
}

1358 1359 1360 1361
#define RAW_IS_INODE(p)	((p)->footer.nid == (p)->footer.ino)

static inline bool IS_INODE(struct page *page)
{
1362
	struct f2fs_node *p = F2FS_NODE(page);
1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375
	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;
1376
	raw_node = F2FS_NODE(node_page);
1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389
	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;
}

1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407
static inline void f2fs_set_bit(unsigned int nr, char *addr)
{
	int mask;

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

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

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

1408
static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419
{
	int mask;
	int ret;

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

1420
static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431
{
	int mask;
	int ret;

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

1432 1433 1434 1435 1436 1437 1438 1439 1440
static inline void f2fs_change_bit(unsigned int nr, char *addr)
{
	int mask;

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

1441 1442 1443
/* used for f2fs_inode_info->flags */
enum {
	FI_NEW_INODE,		/* indicate newly allocated inode */
1444
	FI_DIRTY_INODE,		/* indicate inode is dirty or not */
1445
	FI_DIRTY_DIR,		/* indicate directory has dirty pages */
1446 1447 1448
	FI_INC_LINK,		/* need to increment i_nlink */
	FI_ACL_MODE,		/* indicate acl mode */
	FI_NO_ALLOC,		/* should not allocate any blocks */
1449
	FI_FREE_NID,		/* free allocated nide */
1450
	FI_UPDATE_DIR,		/* should update inode block for consistency */
1451
	FI_DELAY_IPUT,		/* used for the recovery */
1452
	FI_NO_EXTENT,		/* not to use the extent cache */
J
Jaegeuk Kim 已提交
1453
	FI_INLINE_XATTR,	/* used for inline xattr */
1454
	FI_INLINE_DATA,		/* used for inline data*/
1455
	FI_INLINE_DENTRY,	/* used for inline dentry */
1456 1457
	FI_APPEND_WRITE,	/* inode has appended data */
	FI_UPDATE_WRITE,	/* inode has in-place-update data */
J
Jaegeuk Kim 已提交
1458 1459
	FI_NEED_IPU,		/* used for ipu per file */
	FI_ATOMIC_FILE,		/* indicate atomic file */
1460
	FI_VOLATILE_FILE,	/* indicate volatile file */
1461
	FI_FIRST_BLOCK_WRITTEN,	/* indicate #0 data block was written */
1462
	FI_DROP_CACHE,		/* drop dirty page cache */
1463
	FI_DATA_EXIST,		/* indicate data exists */
1464
	FI_INLINE_DOTS,		/* indicate inline dot dentries */
C
Chao Yu 已提交
1465
	FI_DO_DEFRAG,		/* indicate defragment is running */
1466
	FI_DIRTY_FILE,		/* indicate regular/symlink has dirty pages */
1467 1468 1469 1470
};

static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
{
J
Jaegeuk Kim 已提交
1471 1472
	if (!test_bit(flag, &fi->flags))
		set_bit(flag, &fi->flags);
1473 1474 1475 1476 1477 1478 1479 1480 1481
}

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 已提交
1482 1483
	if (test_bit(flag, &fi->flags))
		clear_bit(flag, &fi->flags);
1484 1485 1486 1487 1488 1489 1490 1491
}

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 已提交
1492 1493 1494 1495 1496
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);
1497 1498
	if (ri->i_inline & F2FS_INLINE_DATA)
		set_inode_flag(fi, FI_INLINE_DATA);
1499 1500
	if (ri->i_inline & F2FS_INLINE_DENTRY)
		set_inode_flag(fi, FI_INLINE_DENTRY);
1501 1502
	if (ri->i_inline & F2FS_DATA_EXIST)
		set_inode_flag(fi, FI_DATA_EXIST);
1503 1504
	if (ri->i_inline & F2FS_INLINE_DOTS)
		set_inode_flag(fi, FI_INLINE_DOTS);
J
Jaegeuk Kim 已提交
1505 1506 1507 1508 1509 1510 1511 1512 1513
}

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;
1514 1515
	if (is_inode_flag_set(fi, FI_INLINE_DATA))
		ri->i_inline |= F2FS_INLINE_DATA;
1516 1517
	if (is_inode_flag_set(fi, FI_INLINE_DENTRY))
		ri->i_inline |= F2FS_INLINE_DENTRY;
1518 1519
	if (is_inode_flag_set(fi, FI_DATA_EXIST))
		ri->i_inline |= F2FS_DATA_EXIST;
1520 1521
	if (is_inode_flag_set(fi, FI_INLINE_DOTS))
		ri->i_inline |= F2FS_INLINE_DOTS;
J
Jaegeuk Kim 已提交
1522 1523
}

1524 1525 1526 1527 1528
static inline int f2fs_has_inline_xattr(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
}

1529 1530
static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
{
1531
	if (f2fs_has_inline_xattr(&fi->vfs_inode))
1532 1533 1534 1535
		return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
	return DEF_ADDRS_PER_INODE;
}

J
Jaegeuk Kim 已提交
1536 1537
static inline void *inline_xattr_addr(struct page *page)
{
1538
	struct f2fs_inode *ri = F2FS_INODE(page);
J
Jaegeuk Kim 已提交
1539 1540 1541 1542 1543 1544
	return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
					F2FS_INLINE_XATTR_ADDRS]);
}

static inline int inline_xattr_size(struct inode *inode)
{
1545
	if (f2fs_has_inline_xattr(inode))
J
Jaegeuk Kim 已提交
1546 1547 1548 1549 1550
		return F2FS_INLINE_XATTR_ADDRS << 2;
	else
		return 0;
}

1551 1552 1553 1554 1555
static inline int f2fs_has_inline_data(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
}

1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566
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);
}

1567 1568 1569 1570 1571
static inline int f2fs_has_inline_dots(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DOTS);
}

J
Jaegeuk Kim 已提交
1572 1573 1574 1575 1576
static inline bool f2fs_is_atomic_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_ATOMIC_FILE);
}

1577 1578 1579 1580 1581
static inline bool f2fs_is_volatile_file(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_VOLATILE_FILE);
}

1582 1583 1584 1585 1586
static inline bool f2fs_is_first_block_written(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
}

1587 1588 1589 1590 1591
static inline bool f2fs_is_drop_cache(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_DROP_CACHE);
}

1592 1593
static inline void *inline_data_addr(struct page *page)
{
1594
	struct f2fs_inode *ri = F2FS_INODE(page);
1595 1596 1597
	return (void *)&(ri->i_addr[1]);
}

1598 1599 1600 1601 1602
static inline int f2fs_has_inline_dentry(struct inode *inode)
{
	return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DENTRY);
}

1603 1604 1605 1606 1607 1608
static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
{
	if (!f2fs_has_inline_dentry(dir))
		kunmap(page);
}

1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623
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 已提交
1624 1625 1626 1627 1628
static inline int f2fs_readonly(struct super_block *sb)
{
	return sb->s_flags & MS_RDONLY;
}

1629 1630 1631 1632 1633
static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
{
	return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
}

1634 1635 1636 1637 1638 1639
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;
}

1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650
static inline bool is_dot_dotdot(const struct qstr *str)
{
	if (str->len == 1 && str->name[0] == '.')
		return true;

	if (str->len == 2 && str->name[0] == '.' && str->name[1] == '.')
		return true;

	return false;
}

J
Jaegeuk Kim 已提交
1651 1652 1653 1654 1655 1656
static inline bool f2fs_may_extent_tree(struct inode *inode)
{
	if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
			is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT))
		return false;

A
Al Viro 已提交
1657
	return S_ISREG(inode->i_mode);
J
Jaegeuk Kim 已提交
1658 1659
}

1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679
static inline void *f2fs_kvmalloc(size_t size, gfp_t flags)
{
	void *ret;

	ret = kmalloc(size, flags | __GFP_NOWARN);
	if (!ret)
		ret = __vmalloc(size, flags, PAGE_KERNEL);
	return ret;
}

static inline void *f2fs_kvzalloc(size_t size, gfp_t flags)
{
	void *ret;

	ret = kzalloc(size, flags | __GFP_NOWARN);
	if (!ret)
		ret = __vmalloc(size, flags | __GFP_ZERO, PAGE_KERNEL);
	return ret;
}

1680 1681 1682 1683
#define get_inode_mode(i) \
	((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
	 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))

1684 1685 1686 1687 1688 1689
/* 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))

1690 1691 1692 1693 1694
/*
 * file.c
 */
int f2fs_sync_file(struct file *, loff_t, loff_t, int);
void truncate_data_blocks(struct dnode_of_data *);
1695
int truncate_blocks(struct inode *, u64, bool);
1696
int f2fs_truncate(struct inode *, bool);
1697
int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
1698 1699
int f2fs_setattr(struct dentry *, struct iattr *);
int truncate_hole(struct inode *, pgoff_t, pgoff_t);
1700
int truncate_data_blocks_range(struct dnode_of_data *, int);
1701
long f2fs_ioctl(struct file *, unsigned int, unsigned long);
1702
long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
1703 1704 1705 1706 1707 1708

/*
 * inode.c
 */
void f2fs_set_inode_flags(struct inode *);
struct inode *f2fs_iget(struct super_block *, unsigned long);
1709
int try_to_free_nats(struct f2fs_sb_info *, int);
1710 1711
int update_inode(struct inode *, struct page *);
int update_inode_page(struct inode *);
1712 1713
int f2fs_write_inode(struct inode *, struct writeback_control *);
void f2fs_evict_inode(struct inode *);
1714
void handle_failed_inode(struct inode *);
1715 1716 1717 1718 1719 1720 1721 1722 1723

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

/*
 * dir.c
 */
1724
extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
1725
void set_de_type(struct f2fs_dir_entry *, umode_t);
1726 1727 1728

struct f2fs_dir_entry *find_target_dentry(struct f2fs_filename *,
			f2fs_hash_t, int *, struct f2fs_dentry_ptr *);
1729
bool f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
1730
			unsigned int, struct f2fs_str *);
1731 1732
void do_make_empty_dir(struct inode *, struct inode *,
			struct f2fs_dentry_ptr *);
1733
struct page *init_inode_metadata(struct inode *, struct inode *,
1734
			const struct qstr *, struct page *);
1735
void update_parent_metadata(struct inode *, struct inode *, unsigned int);
1736
int room_for_filename(const void *, int, int);
1737
void f2fs_drop_nlink(struct inode *, struct inode *, struct page *);
1738 1739 1740 1741 1742 1743
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 *);
1744
int update_dent_inode(struct inode *, struct inode *, const struct qstr *);
1745
void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
1746
			const struct qstr *, f2fs_hash_t , unsigned int);
1747 1748
int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
			umode_t);
1749 1750
void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
							struct inode *);
1751
int f2fs_do_tmpfile(struct inode *, struct inode *);
1752 1753
bool f2fs_empty_dir(struct inode *);

1754 1755
static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
{
1756
	return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
1757
				inode, inode->i_ino, inode->i_mode);
1758 1759
}

1760 1761 1762
/*
 * super.c
 */
C
Chao Yu 已提交
1763
int f2fs_commit_super(struct f2fs_sb_info *, bool);
1764
int f2fs_sync_fs(struct super_block *, int);
1765 1766
extern __printf(3, 4)
void f2fs_msg(struct super_block *, const char *, const char *, ...);
1767 1768 1769 1770

/*
 * hash.c
 */
1771
f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
1772 1773 1774 1775 1776 1777 1778

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

1779
bool available_free_memory(struct f2fs_sb_info *, int);
J
Jaegeuk Kim 已提交
1780
int need_dentry_mark(struct f2fs_sb_info *, nid_t);
1781 1782
bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
1783 1784 1785
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);
1786
int truncate_xattr_node(struct inode *, struct page *);
1787
int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
C
Chao Yu 已提交
1788
int remove_inode_page(struct inode *);
1789
struct page *new_inode_page(struct inode *);
1790
struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
1791 1792 1793 1794 1795 1796 1797 1798
void ra_node_page(struct f2fs_sb_info *, nid_t);
struct page *get_node_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_node_page_ra(struct page *, int);
void sync_inode_page(struct dnode_of_data *);
int sync_node_pages(struct f2fs_sb_info *, nid_t, struct writeback_control *);
bool alloc_nid(struct f2fs_sb_info *, nid_t *);
void alloc_nid_done(struct f2fs_sb_info *, nid_t);
void alloc_nid_failed(struct f2fs_sb_info *, nid_t);
C
Chao Yu 已提交
1799
int try_to_free_nids(struct f2fs_sb_info *, int);
1800
void recover_inline_xattr(struct inode *, struct page *);
1801
void recover_xattr_data(struct inode *, struct page *, block_t);
1802 1803 1804 1805 1806 1807
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 *);
1808
int __init create_node_manager_caches(void);
1809 1810 1811 1812 1813
void destroy_node_manager_caches(void);

/*
 * segment.c
 */
J
Jaegeuk Kim 已提交
1814
void register_inmem_page(struct inode *, struct page *);
1815
int commit_inmem_pages(struct inode *, bool);
J
Jaegeuk Kim 已提交
1816
void f2fs_balance_fs(struct f2fs_sb_info *, bool);
1817
void f2fs_balance_fs_bg(struct f2fs_sb_info *);
1818
int f2fs_issue_flush(struct f2fs_sb_info *);
1819 1820
int create_flush_cmd_control(struct f2fs_sb_info *);
void destroy_flush_cmd_control(struct f2fs_sb_info *);
1821
void invalidate_blocks(struct f2fs_sb_info *, block_t);
1822
bool is_checkpointed_data(struct f2fs_sb_info *, block_t);
1823
void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
1824
void clear_prefree_segments(struct f2fs_sb_info *, struct cp_control *);
1825
void release_discard_addrs(struct f2fs_sb_info *);
C
Chao Yu 已提交
1826
bool discard_next_dnode(struct f2fs_sb_info *, block_t);
1827
int npages_for_summary_flush(struct f2fs_sb_info *, bool);
1828
void allocate_new_segments(struct f2fs_sb_info *);
1829
int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
1830
struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
C
Chao Yu 已提交
1831
void update_meta_page(struct f2fs_sb_info *, void *, block_t);
1832
void write_meta_page(struct f2fs_sb_info *, struct page *);
1833 1834 1835
void write_node_page(unsigned int, struct f2fs_io_info *);
void write_data_page(struct dnode_of_data *, struct f2fs_io_info *);
void rewrite_data_page(struct f2fs_io_info *);
1836 1837
void f2fs_replace_block(struct f2fs_sb_info *, struct dnode_of_data *,
				block_t, block_t, unsigned char, bool);
1838 1839
void allocate_data_block(struct f2fs_sb_info *, struct page *,
		block_t, block_t *, struct f2fs_summary *, int);
1840
void f2fs_wait_on_page_writeback(struct page *, enum page_type);
1841
void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *, block_t);
1842 1843 1844 1845
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);
1846
void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
1847 1848
int build_segment_manager(struct f2fs_sb_info *);
void destroy_segment_manager(struct f2fs_sb_info *);
1849 1850
int __init create_segment_manager_caches(void);
void destroy_segment_manager_caches(void);
1851 1852 1853 1854 1855 1856

/*
 * checkpoint.c
 */
struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
1857
struct page *get_tmp_page(struct f2fs_sb_info *, pgoff_t);
1858
bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
1859
int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int, bool);
1860
void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
1861
long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
1862 1863 1864
void add_ino_entry(struct f2fs_sb_info *, nid_t, int type);
void remove_ino_entry(struct f2fs_sb_info *, nid_t, int type);
void release_ino_entry(struct f2fs_sb_info *);
1865
bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
J
Jaegeuk Kim 已提交
1866 1867
int acquire_orphan_inode(struct f2fs_sb_info *);
void release_orphan_inode(struct f2fs_sb_info *);
1868 1869
void add_orphan_inode(struct f2fs_sb_info *, nid_t);
void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
1870
int recover_orphan_inodes(struct f2fs_sb_info *);
1871
int get_valid_checkpoint(struct f2fs_sb_info *);
1872
void update_dirty_page(struct inode *, struct page *);
1873
void add_dirty_dir_inode(struct inode *);
1874
void remove_dirty_inode(struct inode *);
C
Chao Yu 已提交
1875
int sync_dirty_inodes(struct f2fs_sb_info *, enum inode_type);
C
Chao Yu 已提交
1876
int write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
J
Jaegeuk Kim 已提交
1877
void init_ino_entry_info(struct f2fs_sb_info *);
1878
int __init create_checkpoint_caches(void);
1879 1880 1881 1882 1883
void destroy_checkpoint_caches(void);

/*
 * data.c
 */
C
Chao Yu 已提交
1884
bool is_merged_page(struct f2fs_sb_info *, struct page *, enum page_type);
J
Jaegeuk Kim 已提交
1885
void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
1886 1887
int f2fs_submit_page_bio(struct f2fs_io_info *);
void f2fs_submit_page_mbio(struct f2fs_io_info *);
1888
void set_data_blkaddr(struct dnode_of_data *);
1889
int reserve_new_block(struct dnode_of_data *);
1890
int f2fs_get_block(struct dnode_of_data *, pgoff_t);
1891
int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
1892
struct page *get_read_data_page(struct inode *, pgoff_t, int, bool);
1893
struct page *find_data_page(struct inode *, pgoff_t);
1894
struct page *get_lock_data_page(struct inode *, pgoff_t, bool);
1895
struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
1896
int do_write_data_page(struct f2fs_io_info *);
C
Chao Yu 已提交
1897
int f2fs_map_blocks(struct inode *, struct f2fs_map_blocks *, int, int);
J
Jaegeuk Kim 已提交
1898
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
1899 1900
void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
int f2fs_release_page(struct page *, gfp_t);
1901 1902 1903 1904 1905 1906

/*
 * gc.c
 */
int start_gc_thread(struct f2fs_sb_info *);
void stop_gc_thread(struct f2fs_sb_info *);
1907
block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
C
Chao Yu 已提交
1908
int f2fs_gc(struct f2fs_sb_info *, bool);
1909 1910 1911 1912 1913
void build_gc_manager(struct f2fs_sb_info *);

/*
 * recovery.c
 */
1914
int recover_fsync_data(struct f2fs_sb_info *);
1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925
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;
1926 1927
	unsigned long long hit_largest, hit_cached, hit_rbtree;
	unsigned long long hit_total, total_ext;
J
Jaegeuk Kim 已提交
1928
	int ext_tree, zombie_tree, ext_node;
C
Chao Yu 已提交
1929 1930
	int ndirty_node, ndirty_meta;
	int ndirty_dent, ndirty_dirs, ndirty_data, ndirty_files;
1931
	int nats, dirty_nats, sits, dirty_sits, fnids;
1932
	int total_count, utilization;
C
Chao Yu 已提交
1933 1934
	int bg_gc, inmem_pages, wb_pages;
	int inline_xattr, inline_inode, inline_dir;
1935 1936 1937 1938 1939
	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;
1940
	int prefree_count, call_count, cp_count, bg_cp_count;
1941
	int tot_segs, node_segs, data_segs, free_segs, free_secs;
1942
	int bg_node_segs, bg_data_segs;
1943
	int tot_blks, data_blks, node_blks;
1944
	int bg_data_blks, bg_node_blks;
1945 1946 1947 1948 1949 1950
	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];
1951
	unsigned int inplace_count;
C
Chao Yu 已提交
1952
	unsigned long long base_mem, cache_mem, page_mem;
1953 1954
};

1955 1956
static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
{
C
Chris Fries 已提交
1957
	return (struct f2fs_stat_info *)sbi->stat_info;
1958 1959
}

1960
#define stat_inc_cp_count(si)		((si)->cp_count++)
1961
#define stat_inc_bg_cp_count(si)	((si)->bg_cp_count++)
1962 1963
#define stat_inc_call_count(si)		((si)->call_count++)
#define stat_inc_bggc_count(sbi)	((sbi)->bg_gc++)
C
Chao Yu 已提交
1964 1965
#define stat_inc_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]++)
#define stat_dec_dirty_inode(sbi, type)	((sbi)->ndirty_inode[type]--)
1966 1967 1968 1969
#define stat_inc_total_hit(sbi)		(atomic64_inc(&(sbi)->total_hit_ext))
#define stat_inc_rbtree_node_hit(sbi)	(atomic64_inc(&(sbi)->read_hit_rbtree))
#define stat_inc_largest_node_hit(sbi)	(atomic64_inc(&(sbi)->read_hit_largest))
#define stat_inc_cached_node_hit(sbi)	(atomic64_inc(&(sbi)->read_hit_cached))
C
Chao Yu 已提交
1970 1971 1972 1973 1974 1975 1976 1977 1978 1979
#define stat_inc_inline_xattr(inode)					\
	do {								\
		if (f2fs_has_inline_xattr(inode))			\
			(atomic_inc(&F2FS_I_SB(inode)->inline_xattr));	\
	} while (0)
#define stat_dec_inline_xattr(inode)					\
	do {								\
		if (f2fs_has_inline_xattr(inode))			\
			(atomic_dec(&F2FS_I_SB(inode)->inline_xattr));	\
	} while (0)
1980 1981 1982
#define stat_inc_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1983
			(atomic_inc(&F2FS_I_SB(inode)->inline_inode));	\
1984 1985 1986 1987
	} while (0)
#define stat_dec_inline_inode(inode)					\
	do {								\
		if (f2fs_has_inline_data(inode))			\
1988
			(atomic_dec(&F2FS_I_SB(inode)->inline_inode));	\
1989
	} while (0)
1990 1991 1992
#define stat_inc_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1993
			(atomic_inc(&F2FS_I_SB(inode)->inline_dir));	\
1994 1995 1996 1997
	} while (0)
#define stat_dec_inline_dir(inode)					\
	do {								\
		if (f2fs_has_inline_dentry(inode))			\
1998
			(atomic_dec(&F2FS_I_SB(inode)->inline_dir));	\
1999
	} while (0)
2000 2001 2002 2003
#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]++)
2004 2005
#define stat_inc_inplace_blocks(sbi)					\
		(atomic_inc(&(sbi)->inplace_count))
2006
#define stat_inc_seg_count(sbi, type, gc_type)				\
2007
	do {								\
2008
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2009
		(si)->tot_segs++;					\
2010
		if (type == SUM_TYPE_DATA) {				\
2011
			si->data_segs++;				\
2012 2013
			si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0;	\
		} else {						\
2014
			si->node_segs++;				\
2015 2016
			si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0;	\
		}							\
2017 2018 2019 2020 2021
	} while (0)

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

2022
#define stat_inc_data_blk_count(sbi, blks, gc_type)			\
2023
	do {								\
2024
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2025 2026
		stat_inc_tot_blk_count(si, blks);			\
		si->data_blks += (blks);				\
2027
		si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2028 2029
	} while (0)

2030
#define stat_inc_node_blk_count(sbi, blks, gc_type)			\
2031
	do {								\
2032
		struct f2fs_stat_info *si = F2FS_STAT(sbi);		\
2033 2034
		stat_inc_tot_blk_count(si, blks);			\
		si->node_blks += (blks);				\
2035
		si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0;	\
2036 2037 2038 2039
	} while (0)

int f2fs_build_stats(struct f2fs_sb_info *);
void f2fs_destroy_stats(struct f2fs_sb_info *);
2040
int __init f2fs_create_root_stats(void);
2041
void f2fs_destroy_root_stats(void);
2042
#else
2043
#define stat_inc_cp_count(si)
2044
#define stat_inc_bg_cp_count(si)
2045
#define stat_inc_call_count(si)
2046
#define stat_inc_bggc_count(si)
C
Chao Yu 已提交
2047 2048
#define stat_inc_dirty_inode(sbi, type)
#define stat_dec_dirty_inode(sbi, type)
2049
#define stat_inc_total_hit(sb)
2050
#define stat_inc_rbtree_node_hit(sb)
2051 2052
#define stat_inc_largest_node_hit(sbi)
#define stat_inc_cached_node_hit(sbi)
C
Chao Yu 已提交
2053 2054
#define stat_inc_inline_xattr(inode)
#define stat_dec_inline_xattr(inode)
2055 2056
#define stat_inc_inline_inode(inode)
#define stat_dec_inline_inode(inode)
2057 2058
#define stat_inc_inline_dir(inode)
#define stat_dec_inline_dir(inode)
2059 2060
#define stat_inc_seg_type(sbi, curseg)
#define stat_inc_block_count(sbi, curseg)
2061
#define stat_inc_inplace_blocks(sbi)
2062
#define stat_inc_seg_count(sbi, type, gc_type)
2063
#define stat_inc_tot_blk_count(si, blks)
2064 2065
#define stat_inc_data_blk_count(sbi, blks, gc_type)
#define stat_inc_node_blk_count(sbi, blks, gc_type)
2066 2067 2068

static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
2069
static inline int __init f2fs_create_root_stats(void) { return 0; }
2070
static inline void f2fs_destroy_root_stats(void) { }
2071 2072 2073 2074 2075 2076 2077 2078 2079 2080
#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;
2081
extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
2082
extern const struct inode_operations f2fs_special_inode_operations;
J
Jaegeuk Kim 已提交
2083
extern struct kmem_cache *inode_entry_slab;
2084

2085 2086 2087
/*
 * inline.c
 */
2088 2089
bool f2fs_may_inline_data(struct inode *);
bool f2fs_may_inline_dentry(struct inode *);
2090
void read_inline_data(struct page *, struct page *);
2091
bool truncate_inline_inode(struct page *, u64);
2092
int f2fs_read_inline_data(struct inode *, struct page *);
2093 2094 2095
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 *);
2096
bool recover_inline_data(struct inode *, struct page *);
2097 2098
struct f2fs_dir_entry *find_in_inline_dir(struct inode *,
				struct f2fs_filename *, struct page **);
2099 2100
struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *, struct page **);
int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
2101 2102
int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *,
						nid_t, umode_t);
2103 2104 2105
void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
						struct inode *, struct inode *);
bool f2fs_empty_inline_dir(struct inode *);
2106 2107
int f2fs_read_inline_dir(struct file *, struct dir_context *,
						struct f2fs_str *);
J
Jaegeuk Kim 已提交
2108 2109
int f2fs_inline_data_fiemap(struct inode *,
		struct fiemap_extent_info *, __u64, __u64);
2110

2111 2112 2113 2114 2115 2116 2117 2118
/*
 * shrinker.c
 */
unsigned long f2fs_shrink_count(struct shrinker *, struct shrink_control *);
unsigned long f2fs_shrink_scan(struct shrinker *, struct shrink_control *);
void f2fs_join_shrinker(struct f2fs_sb_info *);
void f2fs_leave_shrinker(struct f2fs_sb_info *);

2119 2120 2121 2122
/*
 * extent_cache.c
 */
unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
2123
bool f2fs_init_extent_tree(struct inode *, struct f2fs_extent *);
2124 2125 2126 2127
unsigned int f2fs_destroy_extent_node(struct inode *);
void f2fs_destroy_extent_tree(struct inode *);
bool f2fs_lookup_extent_cache(struct inode *, pgoff_t, struct extent_info *);
void f2fs_update_extent_cache(struct dnode_of_data *);
C
Chao Yu 已提交
2128 2129
void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
						pgoff_t, block_t, unsigned int);
2130 2131 2132 2133
void init_extent_cache_info(struct f2fs_sb_info *);
int __init create_extent_cache(void);
void destroy_extent_cache(void);

2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169
/*
 * crypto support
 */
static inline int f2fs_encrypted_inode(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	return file_is_encrypt(inode);
#else
	return 0;
#endif
}

static inline void f2fs_set_encrypted_inode(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	file_set_encrypt(inode);
#endif
}

static inline bool f2fs_bio_encrypted(struct bio *bio)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
	return unlikely(bio->bi_private != NULL);
#else
	return false;
#endif
}

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

2171 2172 2173
static inline bool f2fs_may_encrypt(struct inode *inode)
{
#ifdef CONFIG_F2FS_FS_ENCRYPTION
A
Al Viro 已提交
2174
	umode_t mode = inode->i_mode;
2175 2176 2177 2178 2179 2180 2181

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

2182 2183 2184 2185 2186 2187
/* crypto_policy.c */
int f2fs_is_child_context_consistent_with_parent(struct inode *,
							struct inode *);
int f2fs_inherit_context(struct inode *, struct inode *, struct page *);
int f2fs_process_policy(const struct f2fs_encryption_policy *, struct inode *);
int f2fs_get_policy(struct inode *, struct f2fs_encryption_policy *);
2188 2189

/* crypt.c */
J
Jaegeuk Kim 已提交
2190
extern struct kmem_cache *f2fs_crypt_info_cachep;
2191 2192 2193 2194 2195 2196 2197 2198 2199
bool f2fs_valid_contents_enc_mode(uint32_t);
uint32_t f2fs_validate_encryption_key_size(uint32_t, uint32_t);
struct f2fs_crypto_ctx *f2fs_get_crypto_ctx(struct inode *);
void f2fs_release_crypto_ctx(struct f2fs_crypto_ctx *);
struct page *f2fs_encrypt(struct inode *, struct page *);
int f2fs_decrypt(struct f2fs_crypto_ctx *, struct page *);
int f2fs_decrypt_one(struct inode *, struct page *);
void f2fs_end_io_crypto_work(struct f2fs_crypto_ctx *, struct bio *);

2200
/* crypto_key.c */
2201
void f2fs_free_encryption_info(struct inode *, struct f2fs_crypt_info *);
2202 2203
int _f2fs_get_encryption_info(struct inode *inode);

2204 2205 2206 2207 2208 2209 2210 2211 2212
/* crypto_fname.c */
bool f2fs_valid_filenames_enc_mode(uint32_t);
u32 f2fs_fname_crypto_round_up(u32, u32);
int f2fs_fname_crypto_alloc_buffer(struct inode *, u32, struct f2fs_str *);
int f2fs_fname_disk_to_usr(struct inode *, f2fs_hash_t *,
			const struct f2fs_str *, struct f2fs_str *);
int f2fs_fname_usr_to_disk(struct inode *, const struct qstr *,
			struct f2fs_str *);

2213 2214 2215 2216
#ifdef CONFIG_F2FS_FS_ENCRYPTION
void f2fs_restore_and_release_control_page(struct page **);
void f2fs_restore_control_page(struct page *);

2217 2218
int __init f2fs_init_crypto(void);
int f2fs_crypto_initialize(void);
2219
void f2fs_exit_crypto(void);
2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234

int f2fs_has_encryption_key(struct inode *);

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

	if (!ci ||
		(ci->ci_keyring_key &&
		 (ci->ci_keyring_key->flags & ((1 << KEY_FLAG_INVALIDATED) |
					       (1 << KEY_FLAG_REVOKED) |
					       (1 << KEY_FLAG_DEAD)))))
		return _f2fs_get_encryption_info(inode);
	return 0;
}
2235 2236 2237 2238 2239

void f2fs_fname_crypto_free_buffer(struct f2fs_str *);
int f2fs_fname_setup_filename(struct inode *, const struct qstr *,
				int lookup, struct f2fs_filename *);
void f2fs_fname_free_filename(struct f2fs_filename *);
2240 2241 2242 2243
#else
static inline void f2fs_restore_and_release_control_page(struct page **p) { }
static inline void f2fs_restore_control_page(struct page *p) { }

2244
static inline int __init f2fs_init_crypto(void) { return 0; }
2245
static inline void f2fs_exit_crypto(void) { }
2246 2247 2248

static inline int f2fs_has_encryption_key(struct inode *i) { return 0; }
static inline int f2fs_get_encryption_info(struct inode *i) { return 0; }
2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262
static inline void f2fs_fname_crypto_free_buffer(struct f2fs_str *p) { }

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

static inline void f2fs_fname_free_filename(struct f2fs_filename *fname) { }
2263
#endif
2264
#endif