]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - fs/f2fs/f2fs.h
f2fs: avoid wrong f2fs_bug_on when truncating inline_data
[mirror_ubuntu-jammy-kernel.git] / fs / f2fs / f2fs.h
CommitLineData
0a8165d7 1/*
39a53e0c
JK
2 * fs/f2fs/f2fs.h
3 *
4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
10 */
11#ifndef _LINUX_F2FS_H
12#define _LINUX_F2FS_H
13
14#include <linux/types.h>
15#include <linux/page-flags.h>
16#include <linux/buffer_head.h>
39a53e0c
JK
17#include <linux/slab.h>
18#include <linux/crc32.h>
19#include <linux/magic.h>
c2d715d1 20#include <linux/kobject.h>
7bd59381 21#include <linux/sched.h>
39a53e0c 22
5d56b671 23#ifdef CONFIG_F2FS_CHECK_FS
9850cf4a 24#define f2fs_bug_on(sbi, condition) BUG_ON(condition)
0daaad97 25#define f2fs_down_write(x, y) down_write_nest_lock(x, y)
5d56b671 26#else
9850cf4a
JK
27#define f2fs_bug_on(sbi, condition) \
28 do { \
29 if (unlikely(condition)) { \
30 WARN_ON(1); \
caf0047e 31 set_sbi_flag(sbi, SBI_NEED_FSCK); \
9850cf4a
JK
32 } \
33 } while (0)
0daaad97 34#define f2fs_down_write(x, y) down_write(x)
5d56b671
JK
35#endif
36
39a53e0c
JK
37/*
38 * For mount options
39 */
40#define F2FS_MOUNT_BG_GC 0x00000001
41#define F2FS_MOUNT_DISABLE_ROLL_FORWARD 0x00000002
42#define F2FS_MOUNT_DISCARD 0x00000004
43#define F2FS_MOUNT_NOHEAP 0x00000008
44#define F2FS_MOUNT_XATTR_USER 0x00000010
45#define F2FS_MOUNT_POSIX_ACL 0x00000020
46#define F2FS_MOUNT_DISABLE_EXT_IDENTIFY 0x00000040
444c580f 47#define F2FS_MOUNT_INLINE_XATTR 0x00000080
1001b347 48#define F2FS_MOUNT_INLINE_DATA 0x00000100
34d67deb
CY
49#define F2FS_MOUNT_INLINE_DENTRY 0x00000200
50#define F2FS_MOUNT_FLUSH_MERGE 0x00000400
51#define F2FS_MOUNT_NOBARRIER 0x00000800
d5053a34 52#define F2FS_MOUNT_FASTBOOT 0x00001000
89672159 53#define F2FS_MOUNT_EXTENT_CACHE 0x00002000
39a53e0c
JK
54
55#define clear_opt(sbi, option) (sbi->mount_opt.opt &= ~F2FS_MOUNT_##option)
56#define set_opt(sbi, option) (sbi->mount_opt.opt |= F2FS_MOUNT_##option)
57#define test_opt(sbi, option) (sbi->mount_opt.opt & F2FS_MOUNT_##option)
58
59#define ver_after(a, b) (typecheck(unsigned long long, a) && \
60 typecheck(unsigned long long, b) && \
61 ((long long)((a) - (b)) > 0))
62
a9841c4d
JK
63typedef u32 block_t; /*
64 * should not change u32, since it is the on-disk block
65 * address format, __le32.
66 */
39a53e0c
JK
67typedef u32 nid_t;
68
69struct f2fs_mount_info {
70 unsigned int opt;
71};
72
7e586fa0
JK
73#define CRCPOLY_LE 0xedb88320
74
75static inline __u32 f2fs_crc32(void *buf, size_t len)
39a53e0c 76{
7e586fa0
JK
77 unsigned char *p = (unsigned char *)buf;
78 __u32 crc = F2FS_SUPER_MAGIC;
79 int i;
80
81 while (len--) {
82 crc ^= *p++;
83 for (i = 0; i < 8; i++)
84 crc = (crc >> 1) ^ ((crc & 1) ? CRCPOLY_LE : 0);
85 }
86 return crc;
39a53e0c
JK
87}
88
7e586fa0 89static inline bool f2fs_crc_valid(__u32 blk_crc, void *buf, size_t buf_size)
39a53e0c 90{
7e586fa0 91 return f2fs_crc32(buf, buf_size) == blk_crc;
39a53e0c
JK
92}
93
94/*
95 * For checkpoint manager
96 */
97enum {
98 NAT_BITMAP,
99 SIT_BITMAP
100};
101
75ab4cb8
JK
102enum {
103 CP_UMOUNT,
119ee914 104 CP_FASTBOOT,
75ab4cb8 105 CP_SYNC,
4b2fecc8 106 CP_DISCARD,
75ab4cb8
JK
107};
108
bba681cb
JK
109#define DEF_BATCHED_TRIM_SECTIONS 32
110#define BATCHED_TRIM_SEGMENTS(sbi) \
111 (SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
112
75ab4cb8
JK
113struct cp_control {
114 int reason;
4b2fecc8
JK
115 __u64 trim_start;
116 __u64 trim_end;
117 __u64 trim_minlen;
118 __u64 trimmed;
75ab4cb8
JK
119};
120
662befda 121/*
81c1a0f1 122 * For CP/NAT/SIT/SSA readahead
662befda
CY
123 */
124enum {
125 META_CP,
126 META_NAT,
81c1a0f1 127 META_SIT,
4c521f49
JK
128 META_SSA,
129 META_POR,
662befda
CY
130};
131
6451e041
JK
132/* for the list of ino */
133enum {
134 ORPHAN_INO, /* for orphan ino list */
fff04f90
JK
135 APPEND_INO, /* for append ino list */
136 UPDATE_INO, /* for update ino list */
6451e041
JK
137 MAX_INO_ENTRY, /* max. list */
138};
139
140struct ino_entry {
39a53e0c
JK
141 struct list_head list; /* list head */
142 nid_t ino; /* inode number */
143};
144
06292073
CY
145/*
146 * for the list of directory inodes or gc inodes.
147 * NOTE: there are two slab users for this structure, if we add/modify/delete
148 * fields in structure for one of slab users, it may affect fields or size of
149 * other one, in this condition, it's better to split both of slab and related
150 * data structure.
151 */
152struct inode_entry {
39a53e0c
JK
153 struct list_head list; /* list head */
154 struct inode *inode; /* vfs inode pointer */
155};
156
7fd9e544
JK
157/* for the list of blockaddresses to be discarded */
158struct discard_entry {
159 struct list_head list; /* list head */
160 block_t blkaddr; /* block address to be discarded */
161 int len; /* # of consecutive blocks of the discard */
162};
163
39a53e0c
JK
164/* for the list of fsync inodes, used only during recovery */
165struct fsync_inode_entry {
166 struct list_head list; /* list head */
167 struct inode *inode; /* vfs inode pointer */
c52e1b10
JK
168 block_t blkaddr; /* block address locating the last fsync */
169 block_t last_dentry; /* block address locating the last dentry */
170 block_t last_inode; /* block address locating the last inode */
39a53e0c
JK
171};
172
173#define nats_in_cursum(sum) (le16_to_cpu(sum->n_nats))
174#define sits_in_cursum(sum) (le16_to_cpu(sum->n_sits))
175
176#define nat_in_journal(sum, i) (sum->nat_j.entries[i].ne)
177#define nid_in_journal(sum, i) (sum->nat_j.entries[i].nid)
178#define sit_in_journal(sum, i) (sum->sit_j.entries[i].se)
179#define segno_in_journal(sum, i) (sum->sit_j.entries[i].segno)
180
309cc2b6
JK
181#define MAX_NAT_JENTRIES(sum) (NAT_JOURNAL_ENTRIES - nats_in_cursum(sum))
182#define MAX_SIT_JENTRIES(sum) (SIT_JOURNAL_ENTRIES - sits_in_cursum(sum))
183
39a53e0c
JK
184static inline int update_nats_in_cursum(struct f2fs_summary_block *rs, int i)
185{
186 int before = nats_in_cursum(rs);
187 rs->n_nats = cpu_to_le16(before + i);
188 return before;
189}
190
191static inline int update_sits_in_cursum(struct f2fs_summary_block *rs, int i)
192{
193 int before = sits_in_cursum(rs);
194 rs->n_sits = cpu_to_le16(before + i);
195 return before;
196}
197
184a5cd2
CY
198static inline bool __has_cursum_space(struct f2fs_summary_block *sum, int size,
199 int type)
200{
201 if (type == NAT_JOURNAL)
309cc2b6
JK
202 return size <= MAX_NAT_JENTRIES(sum);
203 return size <= MAX_SIT_JENTRIES(sum);
184a5cd2
CY
204}
205
e9750824
NJ
206/*
207 * ioctl commands
208 */
88b88a66
JK
209#define F2FS_IOC_GETFLAGS FS_IOC_GETFLAGS
210#define F2FS_IOC_SETFLAGS FS_IOC_SETFLAGS
d49f3e89 211#define F2FS_IOC_GETVERSION FS_IOC_GETVERSION
88b88a66
JK
212
213#define F2FS_IOCTL_MAGIC 0xf5
214#define F2FS_IOC_START_ATOMIC_WRITE _IO(F2FS_IOCTL_MAGIC, 1)
215#define F2FS_IOC_COMMIT_ATOMIC_WRITE _IO(F2FS_IOCTL_MAGIC, 2)
02a1335f 216#define F2FS_IOC_START_VOLATILE_WRITE _IO(F2FS_IOCTL_MAGIC, 3)
1e84371f
JK
217#define F2FS_IOC_RELEASE_VOLATILE_WRITE _IO(F2FS_IOCTL_MAGIC, 4)
218#define F2FS_IOC_ABORT_VOLATILE_WRITE _IO(F2FS_IOCTL_MAGIC, 5)
e9750824 219
1abff93d
JK
220/*
221 * should be same as XFS_IOC_GOINGDOWN.
222 * Flags for going down operation used by FS_IOC_GOINGDOWN
223 */
224#define F2FS_IOC_SHUTDOWN _IOR('X', 125, __u32) /* Shutdown */
225#define F2FS_GOING_DOWN_FULLSYNC 0x0 /* going down with full sync */
226#define F2FS_GOING_DOWN_METASYNC 0x1 /* going down with metadata */
227#define F2FS_GOING_DOWN_NOSYNC 0x2 /* going down */
228
e9750824
NJ
229#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
230/*
231 * ioctl commands in 32 bit emulation
232 */
233#define F2FS_IOC32_GETFLAGS FS_IOC32_GETFLAGS
234#define F2FS_IOC32_SETFLAGS FS_IOC32_SETFLAGS
235#endif
236
39a53e0c
JK
237/*
238 * For INODE and NODE manager
239 */
7b3cd7d6
JK
240/* for directory operations */
241struct f2fs_dentry_ptr {
242 const void *bitmap;
243 struct f2fs_dir_entry *dentry;
244 __u8 (*filename)[F2FS_SLOT_LEN];
245 int max;
246};
247
248static inline void make_dentry_ptr(struct f2fs_dentry_ptr *d,
249 void *src, int type)
250{
251 if (type == 1) {
252 struct f2fs_dentry_block *t = (struct f2fs_dentry_block *)src;
253 d->max = NR_DENTRY_IN_BLOCK;
254 d->bitmap = &t->dentry_bitmap;
255 d->dentry = t->dentry;
256 d->filename = t->filename;
257 } else {
258 struct f2fs_inline_dentry *t = (struct f2fs_inline_dentry *)src;
259 d->max = NR_INLINE_DENTRY;
260 d->bitmap = &t->dentry_bitmap;
261 d->dentry = t->dentry;
262 d->filename = t->filename;
263 }
264}
265
dbe6a5ff
JK
266/*
267 * XATTR_NODE_OFFSET stores xattrs to one node block per file keeping -1
268 * as its node offset to distinguish from index node blocks.
269 * But some bits are used to mark the node block.
270 */
271#define XATTR_NODE_OFFSET ((((unsigned int)-1) << OFFSET_BIT_SHIFT) \
272 >> OFFSET_BIT_SHIFT)
266e97a8
JK
273enum {
274 ALLOC_NODE, /* allocate a new node page if needed */
275 LOOKUP_NODE, /* look up a node without readahead */
276 LOOKUP_NODE_RA, /*
277 * look up a node with readahead called
4f4124d0 278 * by get_data_block.
39a53e0c 279 */
266e97a8
JK
280};
281
39a53e0c
JK
282#define F2FS_LINK_MAX 32000 /* maximum link count per file */
283
817202d9
CY
284#define MAX_DIR_RA_PAGES 4 /* maximum ra pages of dir */
285
13054c54
CY
286/* vector size for gang look-up from extent cache that consists of radix tree */
287#define EXT_TREE_VEC_SIZE 64
288
39a53e0c 289/* for in-memory extent cache entry */
13054c54
CY
290#define F2FS_MIN_EXTENT_LEN 64 /* minimum extent length */
291
292/* number of extent info in extent cache we try to shrink */
293#define EXTENT_CACHE_SHRINK_NUMBER 128
c11abd1a 294
39a53e0c 295struct extent_info {
13054c54
CY
296 unsigned int fofs; /* start offset in a file */
297 u32 blk; /* start block address of the extent */
298 unsigned int len; /* length of the extent */
299};
300
301struct extent_node {
302 struct rb_node rb_node; /* rb node located in rb-tree */
303 struct list_head list; /* node in global extent list of sbi */
304 struct extent_info ei; /* extent info */
305};
306
307struct extent_tree {
308 nid_t ino; /* inode number */
309 struct rb_root root; /* root of extent info rb-tree */
62c8af65 310 struct extent_node *cached_en; /* recently accessed extent node */
13054c54
CY
311 rwlock_t lock; /* protect extent info rb-tree */
312 atomic_t refcount; /* reference count of rb-tree */
313 unsigned int count; /* # of extent node in rb-tree*/
39a53e0c
JK
314};
315
316/*
317 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
318 */
319#define FADVISE_COLD_BIT 0x01
354a3399 320#define FADVISE_LOST_PINO_BIT 0x02
39a53e0c 321
ab9fa662
JK
322#define DEF_DIR_LEVEL 0
323
39a53e0c
JK
324struct f2fs_inode_info {
325 struct inode vfs_inode; /* serve a vfs inode */
326 unsigned long i_flags; /* keep an inode flags for ioctl */
327 unsigned char i_advise; /* use to give file attribute hints */
38431545 328 unsigned char i_dir_level; /* use for dentry level for large dir */
39a53e0c 329 unsigned int i_current_depth; /* use only in directory structure */
6666e6aa 330 unsigned int i_pino; /* parent inode number */
39a53e0c
JK
331 umode_t i_acl_mode; /* keep file acl mode temporarily */
332
333 /* Use below internally in f2fs*/
334 unsigned long flags; /* use to pass per-file flags */
d928bfbf 335 struct rw_semaphore i_sem; /* protect fi info */
a7ffdbe2 336 atomic_t dirty_pages; /* # of dirty pages */
39a53e0c
JK
337 f2fs_hash_t chash; /* hash value of given file name */
338 unsigned int clevel; /* maximum level of given file name */
339 nid_t i_xattr_nid; /* node id that contains xattrs */
e518ff81 340 unsigned long long xattr_ver; /* cp version of xattr modification */
39a53e0c 341 struct extent_info ext; /* in-memory extent cache entry */
0c872e2d 342 rwlock_t ext_lock; /* rwlock for single extent cache */
06292073 343 struct inode_entry *dirty_dir; /* the pointer of dirty dir */
88b88a66 344
34ba94ba 345 struct radix_tree_root inmem_root; /* radix tree for inmem pages */
88b88a66
JK
346 struct list_head inmem_pages; /* inmemory pages managed by f2fs */
347 struct mutex inmem_lock; /* lock for inmemory pages */
39a53e0c
JK
348};
349
350static inline void get_extent_info(struct extent_info *ext,
351 struct f2fs_extent i_ext)
352{
39a53e0c 353 ext->fofs = le32_to_cpu(i_ext.fofs);
4d0b0bd4 354 ext->blk = le32_to_cpu(i_ext.blk);
39a53e0c 355 ext->len = le32_to_cpu(i_ext.len);
39a53e0c
JK
356}
357
358static inline void set_raw_extent(struct extent_info *ext,
359 struct f2fs_extent *i_ext)
360{
39a53e0c 361 i_ext->fofs = cpu_to_le32(ext->fofs);
4d0b0bd4 362 i_ext->blk = cpu_to_le32(ext->blk);
39a53e0c 363 i_ext->len = cpu_to_le32(ext->len);
39a53e0c
JK
364}
365
429511cd
CY
366static inline void set_extent_info(struct extent_info *ei, unsigned int fofs,
367 u32 blk, unsigned int len)
368{
369 ei->fofs = fofs;
370 ei->blk = blk;
371 ei->len = len;
372}
373
374static inline bool __is_extent_mergeable(struct extent_info *back,
375 struct extent_info *front)
376{
377 return (back->fofs + back->len == front->fofs &&
378 back->blk + back->len == front->blk);
379}
380
381static inline bool __is_back_mergeable(struct extent_info *cur,
382 struct extent_info *back)
383{
384 return __is_extent_mergeable(back, cur);
385}
386
387static inline bool __is_front_mergeable(struct extent_info *cur,
388 struct extent_info *front)
389{
390 return __is_extent_mergeable(cur, front);
391}
392
39a53e0c
JK
393struct f2fs_nm_info {
394 block_t nat_blkaddr; /* base disk address of NAT */
395 nid_t max_nid; /* maximum possible node ids */
7ee0eeab 396 nid_t available_nids; /* maximum available node ids */
39a53e0c 397 nid_t next_scan_nid; /* the next nid to be scanned */
cdfc41c1 398 unsigned int ram_thresh; /* control the memory footprint */
39a53e0c
JK
399
400 /* NAT cache management */
401 struct radix_tree_root nat_root;/* root of the nat entry cache */
309cc2b6 402 struct radix_tree_root nat_set_root;/* root of the nat set cache */
8b26ef98 403 struct rw_semaphore nat_tree_lock; /* protect nat_tree_lock */
39a53e0c 404 struct list_head nat_entries; /* cached nat entry list (clean) */
309cc2b6 405 unsigned int nat_cnt; /* the # of cached nat entries */
aec71382 406 unsigned int dirty_nat_cnt; /* total num of nat entries in set */
39a53e0c
JK
407
408 /* free node ids management */
8a7ed66a 409 struct radix_tree_root free_nid_root;/* root of the free_nid cache */
39a53e0c
JK
410 struct list_head free_nid_list; /* a list for free nids */
411 spinlock_t free_nid_list_lock; /* protect free nid list */
412 unsigned int fcnt; /* the number of free node id */
413 struct mutex build_lock; /* lock for build free nids */
414
415 /* for checkpoint */
416 char *nat_bitmap; /* NAT bitmap pointer */
417 int bitmap_size; /* bitmap size */
418};
419
420/*
421 * this structure is used as one of function parameters.
422 * all the information are dedicated to a given direct node block determined
423 * by the data offset in a file.
424 */
425struct dnode_of_data {
426 struct inode *inode; /* vfs inode pointer */
427 struct page *inode_page; /* its inode page, NULL is possible */
428 struct page *node_page; /* cached direct node page */
429 nid_t nid; /* node id of the direct node block */
430 unsigned int ofs_in_node; /* data offset in the node page */
431 bool inode_page_locked; /* inode page is locked or not */
432 block_t data_blkaddr; /* block address of the node block */
433};
434
435static inline void set_new_dnode(struct dnode_of_data *dn, struct inode *inode,
436 struct page *ipage, struct page *npage, nid_t nid)
437{
d66d1f76 438 memset(dn, 0, sizeof(*dn));
39a53e0c
JK
439 dn->inode = inode;
440 dn->inode_page = ipage;
441 dn->node_page = npage;
442 dn->nid = nid;
39a53e0c
JK
443}
444
445/*
446 * For SIT manager
447 *
448 * By default, there are 6 active log areas across the whole main area.
449 * When considering hot and cold data separation to reduce cleaning overhead,
450 * we split 3 for data logs and 3 for node logs as hot, warm, and cold types,
451 * respectively.
452 * In the current design, you should not change the numbers intentionally.
453 * Instead, as a mount option such as active_logs=x, you can use 2, 4, and 6
454 * logs individually according to the underlying devices. (default: 6)
455 * Just in case, on-disk layout covers maximum 16 logs that consist of 8 for
456 * data and 8 for node logs.
457 */
458#define NR_CURSEG_DATA_TYPE (3)
459#define NR_CURSEG_NODE_TYPE (3)
460#define NR_CURSEG_TYPE (NR_CURSEG_DATA_TYPE + NR_CURSEG_NODE_TYPE)
461
462enum {
463 CURSEG_HOT_DATA = 0, /* directory entry blocks */
464 CURSEG_WARM_DATA, /* data blocks */
465 CURSEG_COLD_DATA, /* multimedia or GCed data blocks */
466 CURSEG_HOT_NODE, /* direct node blocks of directory files */
467 CURSEG_WARM_NODE, /* direct node blocks of normal files */
468 CURSEG_COLD_NODE, /* indirect node blocks */
38aa0889
JK
469 NO_CHECK_TYPE,
470 CURSEG_DIRECT_IO, /* to use for the direct IO path */
39a53e0c
JK
471};
472
6b4afdd7 473struct flush_cmd {
6b4afdd7 474 struct completion wait;
721bd4d5 475 struct llist_node llnode;
6b4afdd7
JK
476 int ret;
477};
478
a688b9d9
GZ
479struct flush_cmd_control {
480 struct task_struct *f2fs_issue_flush; /* flush thread */
481 wait_queue_head_t flush_wait_queue; /* waiting queue for wake-up */
721bd4d5
GZ
482 struct llist_head issue_list; /* list for command issue */
483 struct llist_node *dispatch_list; /* list for command dispatch */
a688b9d9
GZ
484};
485
39a53e0c
JK
486struct f2fs_sm_info {
487 struct sit_info *sit_info; /* whole segment information */
488 struct free_segmap_info *free_info; /* free segment information */
489 struct dirty_seglist_info *dirty_info; /* dirty segment information */
490 struct curseg_info *curseg_array; /* active segment information */
491
39a53e0c
JK
492 block_t seg0_blkaddr; /* block address of 0'th segment */
493 block_t main_blkaddr; /* start block address of main area */
494 block_t ssa_blkaddr; /* start block address of SSA area */
495
496 unsigned int segment_count; /* total # of segments */
497 unsigned int main_segments; /* # of segments in main area */
498 unsigned int reserved_segments; /* # of reserved segments */
499 unsigned int ovp_segments; /* # of overprovision segments */
81eb8d6e
JK
500
501 /* a threshold to reclaim prefree segments */
502 unsigned int rec_prefree_segments;
7fd9e544
JK
503
504 /* for small discard management */
505 struct list_head discard_list; /* 4KB discard list */
506 int nr_discards; /* # of discards in the list */
507 int max_discards; /* max. discards to be issued */
216fbd64 508
bba681cb
JK
509 /* for batched trimming */
510 unsigned int trim_sections; /* # of sections to trim */
511
184a5cd2
CY
512 struct list_head sit_entry_set; /* sit entry set list */
513
216fbd64
JK
514 unsigned int ipu_policy; /* in-place-update policy */
515 unsigned int min_ipu_util; /* in-place-update threshold */
c1ce1b02 516 unsigned int min_fsync_blocks; /* threshold for fsync */
6b4afdd7
JK
517
518 /* for flush command control */
a688b9d9
GZ
519 struct flush_cmd_control *cmd_control_info;
520
39a53e0c
JK
521};
522
39a53e0c
JK
523/*
524 * For superblock
525 */
526/*
527 * COUNT_TYPE for monitoring
528 *
529 * f2fs monitors the number of several block types such as on-writeback,
530 * dirty dentry blocks, dirty node blocks, and dirty meta blocks.
531 */
532enum count_type {
533 F2FS_WRITEBACK,
534 F2FS_DIRTY_DENTS,
535 F2FS_DIRTY_NODES,
536 F2FS_DIRTY_META,
8dcf2ff7 537 F2FS_INMEM_PAGES,
39a53e0c
JK
538 NR_COUNT_TYPE,
539};
540
39a53e0c 541/*
e1c42045 542 * The below are the page types of bios used in submit_bio().
39a53e0c
JK
543 * The available types are:
544 * DATA User data pages. It operates as async mode.
545 * NODE Node pages. It operates as async mode.
546 * META FS metadata pages such as SIT, NAT, CP.
547 * NR_PAGE_TYPE The number of page types.
548 * META_FLUSH Make sure the previous pages are written
549 * with waiting the bio's completion
550 * ... Only can be used with META.
551 */
7d5e5109 552#define PAGE_TYPE_OF_BIO(type) ((type) > META ? META : (type))
39a53e0c
JK
553enum page_type {
554 DATA,
555 NODE,
556 META,
557 NR_PAGE_TYPE,
558 META_FLUSH,
559};
560
458e6197 561struct f2fs_io_info {
7e8f2308
GZ
562 enum page_type type; /* contains DATA/NODE/META/META_FLUSH */
563 int rw; /* contains R/RS/W/WS with REQ_META/REQ_PRIO */
cf04e8eb 564 block_t blk_addr; /* block address to be written */
458e6197
JK
565};
566
93dfe2ac 567#define is_read_io(rw) (((rw) & 1) == READ)
1ff7bd3b 568struct f2fs_bio_info {
458e6197 569 struct f2fs_sb_info *sbi; /* f2fs superblock */
1ff7bd3b
JK
570 struct bio *bio; /* bios to merge */
571 sector_t last_block_in_bio; /* last block number */
458e6197 572 struct f2fs_io_info fio; /* store buffered io info. */
df0f8dc0 573 struct rw_semaphore io_rwsem; /* blocking op for bio */
1ff7bd3b
JK
574};
575
67298804
CY
576/* for inner inode cache management */
577struct inode_management {
578 struct radix_tree_root ino_root; /* ino entry array */
579 spinlock_t ino_lock; /* for ino entry lock */
580 struct list_head ino_list; /* inode list head */
581 unsigned long ino_num; /* number of entries */
582};
583
caf0047e
CY
584/* For s_flag in struct f2fs_sb_info */
585enum {
586 SBI_IS_DIRTY, /* dirty flag for checkpoint */
587 SBI_IS_CLOSE, /* specify unmounting */
588 SBI_NEED_FSCK, /* need fsck.f2fs to fix */
589 SBI_POR_DOING, /* recovery is doing or not */
590};
591
39a53e0c
JK
592struct f2fs_sb_info {
593 struct super_block *sb; /* pointer to VFS super block */
5e176d54 594 struct proc_dir_entry *s_proc; /* proc entry */
39a53e0c
JK
595 struct buffer_head *raw_super_buf; /* buffer head of raw sb */
596 struct f2fs_super_block *raw_super; /* raw super block pointer */
caf0047e 597 int s_flag; /* flags for sbi */
39a53e0c
JK
598
599 /* for node-related operations */
600 struct f2fs_nm_info *nm_info; /* node manager */
601 struct inode *node_inode; /* cache node blocks */
602
603 /* for segment-related operations */
604 struct f2fs_sm_info *sm_info; /* segment manager */
1ff7bd3b
JK
605
606 /* for bio operations */
924b720b 607 struct f2fs_bio_info read_io; /* for read bios */
1ff7bd3b 608 struct f2fs_bio_info write_io[NR_PAGE_TYPE]; /* for write bios */
39a53e0c
JK
609
610 /* for checkpoint */
611 struct f2fs_checkpoint *ckpt; /* raw checkpoint pointer */
612 struct inode *meta_inode; /* cache meta blocks */
39936837 613 struct mutex cp_mutex; /* checkpoint procedure lock */
e479556b 614 struct rw_semaphore cp_rwsem; /* blocking FS operations */
b3582c68 615 struct rw_semaphore node_write; /* locking node writes */
fb51b5ef 616 wait_queue_head_t cp_wait;
39a53e0c 617
67298804 618 struct inode_management im[MAX_INO_ENTRY]; /* manage inode cache */
6451e041
JK
619
620 /* for orphan inode, use 0'th array */
0d47c1ad 621 unsigned int max_orphans; /* max orphan inodes */
39a53e0c
JK
622
623 /* for directory inode management */
624 struct list_head dir_inode_list; /* dir inode list */
625 spinlock_t dir_inode_lock; /* for dir inode list lock */
39a53e0c 626
13054c54
CY
627 /* for extent tree cache */
628 struct radix_tree_root extent_tree_root;/* cache extent cache entries */
629 struct rw_semaphore extent_tree_lock; /* locking extent radix tree */
630 struct list_head extent_list; /* lru list for shrinker */
631 spinlock_t extent_lock; /* locking extent lru list */
632 int total_ext_tree; /* extent tree count */
633 atomic_t total_ext_node; /* extent info count */
634
e1c42045 635 /* basic filesystem units */
39a53e0c
JK
636 unsigned int log_sectors_per_block; /* log2 sectors per block */
637 unsigned int log_blocksize; /* log2 block size */
638 unsigned int blocksize; /* block size */
639 unsigned int root_ino_num; /* root inode number*/
640 unsigned int node_ino_num; /* node inode number*/
641 unsigned int meta_ino_num; /* meta inode number*/
642 unsigned int log_blocks_per_seg; /* log2 blocks per segment */
643 unsigned int blocks_per_seg; /* blocks per segment */
644 unsigned int segs_per_sec; /* segments per section */
645 unsigned int secs_per_zone; /* sections per zone */
646 unsigned int total_sections; /* total section count */
647 unsigned int total_node_count; /* total node block count */
648 unsigned int total_valid_node_count; /* valid node block count */
649 unsigned int total_valid_inode_count; /* valid inode count */
650 int active_logs; /* # of active logs */
ab9fa662 651 int dir_level; /* directory level */
39a53e0c
JK
652
653 block_t user_block_count; /* # of user blocks */
654 block_t total_valid_block_count; /* # of valid blocks */
655 block_t alloc_valid_block_count; /* # of allocated blocks */
656 block_t last_valid_block_count; /* for recovery */
657 u32 s_next_generation; /* for NFS support */
658 atomic_t nr_pages[NR_COUNT_TYPE]; /* # of pages, see count_type */
659
660 struct f2fs_mount_info mount_opt; /* mount options */
661
662 /* for cleaning operations */
663 struct mutex gc_mutex; /* mutex for GC */
664 struct f2fs_gc_kthread *gc_thread; /* GC thread */
5ec4e49f 665 unsigned int cur_victim_sec; /* current victim section num */
39a53e0c 666
b1c57c1c
JK
667 /* maximum # of trials to find a victim segment for SSR and GC */
668 unsigned int max_victim_search;
669
39a53e0c
JK
670 /*
671 * for stat information.
672 * one is for the LFS mode, and the other is for the SSR mode.
673 */
35b09d82 674#ifdef CONFIG_F2FS_STAT_FS
39a53e0c
JK
675 struct f2fs_stat_info *stat_info; /* FS status information */
676 unsigned int segment_count[2]; /* # of allocated segments */
677 unsigned int block_count[2]; /* # of allocated blocks */
b9a2c252 678 atomic_t inplace_count; /* # of inplace update */
39a53e0c 679 int total_hit_ext, read_hit_ext; /* extent cache hit ratio */
03e14d52
CY
680 atomic_t inline_inode; /* # of inline_data inodes */
681 atomic_t inline_dir; /* # of inline_dentry inodes */
39a53e0c 682 int bg_gc; /* background gc calls */
35b09d82
NJ
683 unsigned int n_dirty_dirs; /* # of dir inodes */
684#endif
685 unsigned int last_victim[2]; /* last victim segment # */
39a53e0c 686 spinlock_t stat_lock; /* lock for stat operations */
b59d0bae
NJ
687
688 /* For sysfs suppport */
689 struct kobject s_kobj;
690 struct completion s_kobj_unregister;
39a53e0c
JK
691};
692
693/*
694 * Inline functions
695 */
696static inline struct f2fs_inode_info *F2FS_I(struct inode *inode)
697{
698 return container_of(inode, struct f2fs_inode_info, vfs_inode);
699}
700
701static inline struct f2fs_sb_info *F2FS_SB(struct super_block *sb)
702{
703 return sb->s_fs_info;
704}
705
4081363f
JK
706static inline struct f2fs_sb_info *F2FS_I_SB(struct inode *inode)
707{
708 return F2FS_SB(inode->i_sb);
709}
710
711static inline struct f2fs_sb_info *F2FS_M_SB(struct address_space *mapping)
712{
713 return F2FS_I_SB(mapping->host);
714}
715
716static inline struct f2fs_sb_info *F2FS_P_SB(struct page *page)
717{
718 return F2FS_M_SB(page->mapping);
719}
720
39a53e0c
JK
721static inline struct f2fs_super_block *F2FS_RAW_SUPER(struct f2fs_sb_info *sbi)
722{
723 return (struct f2fs_super_block *)(sbi->raw_super);
724}
725
726static inline struct f2fs_checkpoint *F2FS_CKPT(struct f2fs_sb_info *sbi)
727{
728 return (struct f2fs_checkpoint *)(sbi->ckpt);
729}
730
45590710
GZ
731static inline struct f2fs_node *F2FS_NODE(struct page *page)
732{
733 return (struct f2fs_node *)page_address(page);
734}
735
58bfaf44
JK
736static inline struct f2fs_inode *F2FS_INODE(struct page *page)
737{
738 return &((struct f2fs_node *)page_address(page))->i;
739}
740
39a53e0c
JK
741static inline struct f2fs_nm_info *NM_I(struct f2fs_sb_info *sbi)
742{
743 return (struct f2fs_nm_info *)(sbi->nm_info);
744}
745
746static inline struct f2fs_sm_info *SM_I(struct f2fs_sb_info *sbi)
747{
748 return (struct f2fs_sm_info *)(sbi->sm_info);
749}
750
751static inline struct sit_info *SIT_I(struct f2fs_sb_info *sbi)
752{
753 return (struct sit_info *)(SM_I(sbi)->sit_info);
754}
755
756static inline struct free_segmap_info *FREE_I(struct f2fs_sb_info *sbi)
757{
758 return (struct free_segmap_info *)(SM_I(sbi)->free_info);
759}
760
761static inline struct dirty_seglist_info *DIRTY_I(struct f2fs_sb_info *sbi)
762{
763 return (struct dirty_seglist_info *)(SM_I(sbi)->dirty_info);
764}
765
9df27d98
GZ
766static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
767{
768 return sbi->meta_inode->i_mapping;
769}
770
4ef51a8f
JK
771static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
772{
773 return sbi->node_inode->i_mapping;
774}
775
caf0047e
CY
776static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
777{
778 return sbi->s_flag & (0x01 << type);
779}
780
781static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
39a53e0c 782{
caf0047e 783 sbi->s_flag |= (0x01 << type);
39a53e0c
JK
784}
785
caf0047e 786static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
39a53e0c 787{
caf0047e 788 sbi->s_flag &= ~(0x01 << type);
39a53e0c
JK
789}
790
d71b5564
JK
791static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
792{
793 return le64_to_cpu(cp->checkpoint_ver);
794}
795
25ca923b
JK
796static inline bool is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
797{
798 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
799 return ckpt_flags & f;
800}
801
802static inline void set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
803{
804 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
805 ckpt_flags |= f;
806 cp->ckpt_flags = cpu_to_le32(ckpt_flags);
807}
808
809static inline void clear_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
810{
811 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
812 ckpt_flags &= (~f);
813 cp->ckpt_flags = cpu_to_le32(ckpt_flags);
814}
815
e479556b 816static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
39936837 817{
e479556b 818 down_read(&sbi->cp_rwsem);
39936837
JK
819}
820
e479556b 821static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
39a53e0c 822{
e479556b 823 up_read(&sbi->cp_rwsem);
39a53e0c
JK
824}
825
e479556b 826static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
39a53e0c 827{
0daaad97 828 f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
39936837
JK
829}
830
e479556b 831static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
39936837 832{
e479556b 833 up_write(&sbi->cp_rwsem);
39a53e0c
JK
834}
835
119ee914
JK
836static inline int __get_cp_reason(struct f2fs_sb_info *sbi)
837{
838 int reason = CP_SYNC;
839
840 if (test_opt(sbi, FASTBOOT))
841 reason = CP_FASTBOOT;
842 if (is_sbi_flag_set(sbi, SBI_IS_CLOSE))
843 reason = CP_UMOUNT;
844 return reason;
845}
846
847static inline bool __remain_node_summaries(int reason)
848{
849 return (reason == CP_UMOUNT || reason == CP_FASTBOOT);
850}
851
852static inline bool __exist_node_summaries(struct f2fs_sb_info *sbi)
853{
854 return (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_UMOUNT_FLAG) ||
855 is_set_ckpt_flags(F2FS_CKPT(sbi), CP_FASTBOOT_FLAG));
856}
857
39a53e0c
JK
858/*
859 * Check whether the given nid is within node id range.
860 */
064e0823 861static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
39a53e0c 862{
d6b7d4b3
CY
863 if (unlikely(nid < F2FS_ROOT_INO(sbi)))
864 return -EINVAL;
cfb271d4 865 if (unlikely(nid >= NM_I(sbi)->max_nid))
064e0823
NJ
866 return -EINVAL;
867 return 0;
39a53e0c
JK
868}
869
870#define F2FS_DEFAULT_ALLOCATED_BLOCKS 1
871
872/*
873 * Check whether the inode has blocks or not
874 */
875static inline int F2FS_HAS_BLOCKS(struct inode *inode)
876{
877 if (F2FS_I(inode)->i_xattr_nid)
6c311ec6 878 return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
39a53e0c 879 else
6c311ec6 880 return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
39a53e0c
JK
881}
882
4bc8e9bc
CY
883static inline bool f2fs_has_xattr_block(unsigned int ofs)
884{
885 return ofs == XATTR_NODE_OFFSET;
886}
887
39a53e0c
JK
888static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
889 struct inode *inode, blkcnt_t count)
890{
891 block_t valid_block_count;
892
893 spin_lock(&sbi->stat_lock);
894 valid_block_count =
895 sbi->total_valid_block_count + (block_t)count;
cfb271d4 896 if (unlikely(valid_block_count > sbi->user_block_count)) {
39a53e0c
JK
897 spin_unlock(&sbi->stat_lock);
898 return false;
899 }
900 inode->i_blocks += count;
901 sbi->total_valid_block_count = valid_block_count;
902 sbi->alloc_valid_block_count += (block_t)count;
903 spin_unlock(&sbi->stat_lock);
904 return true;
905}
906
da19b0dc 907static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
39a53e0c
JK
908 struct inode *inode,
909 blkcnt_t count)
910{
911 spin_lock(&sbi->stat_lock);
9850cf4a
JK
912 f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
913 f2fs_bug_on(sbi, inode->i_blocks < count);
39a53e0c
JK
914 inode->i_blocks -= count;
915 sbi->total_valid_block_count -= (block_t)count;
916 spin_unlock(&sbi->stat_lock);
39a53e0c
JK
917}
918
919static inline void inc_page_count(struct f2fs_sb_info *sbi, int count_type)
920{
921 atomic_inc(&sbi->nr_pages[count_type]);
caf0047e 922 set_sbi_flag(sbi, SBI_IS_DIRTY);
39a53e0c
JK
923}
924
a7ffdbe2 925static inline void inode_inc_dirty_pages(struct inode *inode)
39a53e0c 926{
a7ffdbe2
JK
927 atomic_inc(&F2FS_I(inode)->dirty_pages);
928 if (S_ISDIR(inode->i_mode))
929 inc_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
39a53e0c
JK
930}
931
932static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
933{
934 atomic_dec(&sbi->nr_pages[count_type]);
935}
936
a7ffdbe2 937static inline void inode_dec_dirty_pages(struct inode *inode)
39a53e0c 938{
a7ffdbe2 939 if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode))
1fe54f9d
JK
940 return;
941
a7ffdbe2
JK
942 atomic_dec(&F2FS_I(inode)->dirty_pages);
943
944 if (S_ISDIR(inode->i_mode))
945 dec_page_count(F2FS_I_SB(inode), F2FS_DIRTY_DENTS);
39a53e0c
JK
946}
947
948static inline int get_pages(struct f2fs_sb_info *sbi, int count_type)
949{
950 return atomic_read(&sbi->nr_pages[count_type]);
951}
952
a7ffdbe2 953static inline int get_dirty_pages(struct inode *inode)
f8b2c1f9 954{
a7ffdbe2 955 return atomic_read(&F2FS_I(inode)->dirty_pages);
f8b2c1f9
JK
956}
957
5ac206cf
NJ
958static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
959{
960 unsigned int pages_per_sec = sbi->segs_per_sec *
961 (1 << sbi->log_blocks_per_seg);
962 return ((get_pages(sbi, block_type) + pages_per_sec - 1)
963 >> sbi->log_blocks_per_seg) / sbi->segs_per_sec;
964}
965
39a53e0c
JK
966static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
967{
8b8343fa 968 return sbi->total_valid_block_count;
39a53e0c
JK
969}
970
971static inline unsigned long __bitmap_size(struct f2fs_sb_info *sbi, int flag)
972{
973 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
974
975 /* return NAT or SIT bitmap */
976 if (flag == NAT_BITMAP)
977 return le32_to_cpu(ckpt->nat_ver_bitmap_bytesize);
978 else if (flag == SIT_BITMAP)
979 return le32_to_cpu(ckpt->sit_ver_bitmap_bytesize);
980
981 return 0;
982}
983
55141486
WL
984static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
985{
986 return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
987}
988
39a53e0c
JK
989static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
990{
991 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1dbe4152
CL
992 int offset;
993
55141486 994 if (__cp_payload(sbi) > 0) {
1dbe4152
CL
995 if (flag == NAT_BITMAP)
996 return &ckpt->sit_nat_version_bitmap;
997 else
65b85ccc 998 return (unsigned char *)ckpt + F2FS_BLKSIZE;
1dbe4152
CL
999 } else {
1000 offset = (flag == NAT_BITMAP) ?
25ca923b 1001 le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
1dbe4152
CL
1002 return &ckpt->sit_nat_version_bitmap + offset;
1003 }
39a53e0c
JK
1004}
1005
1006static inline block_t __start_cp_addr(struct f2fs_sb_info *sbi)
1007{
1008 block_t start_addr;
1009 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
d71b5564 1010 unsigned long long ckpt_version = cur_cp_version(ckpt);
39a53e0c 1011
25ca923b 1012 start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
39a53e0c
JK
1013
1014 /*
1015 * odd numbered checkpoint should at cp segment 0
e1c42045 1016 * and even segment must be at cp segment 1
39a53e0c
JK
1017 */
1018 if (!(ckpt_version & 1))
1019 start_addr += sbi->blocks_per_seg;
1020
1021 return start_addr;
1022}
1023
1024static inline block_t __start_sum_addr(struct f2fs_sb_info *sbi)
1025{
1026 return le32_to_cpu(F2FS_CKPT(sbi)->cp_pack_start_sum);
1027}
1028
1029static inline bool inc_valid_node_count(struct f2fs_sb_info *sbi,
ef86d709 1030 struct inode *inode)
39a53e0c
JK
1031{
1032 block_t valid_block_count;
1033 unsigned int valid_node_count;
1034
1035 spin_lock(&sbi->stat_lock);
1036
ef86d709 1037 valid_block_count = sbi->total_valid_block_count + 1;
cfb271d4 1038 if (unlikely(valid_block_count > sbi->user_block_count)) {
39a53e0c
JK
1039 spin_unlock(&sbi->stat_lock);
1040 return false;
1041 }
1042
ef86d709 1043 valid_node_count = sbi->total_valid_node_count + 1;
cfb271d4 1044 if (unlikely(valid_node_count > sbi->total_node_count)) {
39a53e0c
JK
1045 spin_unlock(&sbi->stat_lock);
1046 return false;
1047 }
1048
1049 if (inode)
ef86d709
GZ
1050 inode->i_blocks++;
1051
1052 sbi->alloc_valid_block_count++;
1053 sbi->total_valid_node_count++;
1054 sbi->total_valid_block_count++;
39a53e0c
JK
1055 spin_unlock(&sbi->stat_lock);
1056
1057 return true;
1058}
1059
1060static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
ef86d709 1061 struct inode *inode)
39a53e0c
JK
1062{
1063 spin_lock(&sbi->stat_lock);
1064
9850cf4a
JK
1065 f2fs_bug_on(sbi, !sbi->total_valid_block_count);
1066 f2fs_bug_on(sbi, !sbi->total_valid_node_count);
1067 f2fs_bug_on(sbi, !inode->i_blocks);
39a53e0c 1068
ef86d709
GZ
1069 inode->i_blocks--;
1070 sbi->total_valid_node_count--;
1071 sbi->total_valid_block_count--;
39a53e0c
JK
1072
1073 spin_unlock(&sbi->stat_lock);
1074}
1075
1076static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
1077{
8b8343fa 1078 return sbi->total_valid_node_count;
39a53e0c
JK
1079}
1080
1081static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
1082{
1083 spin_lock(&sbi->stat_lock);
9850cf4a 1084 f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
39a53e0c
JK
1085 sbi->total_valid_inode_count++;
1086 spin_unlock(&sbi->stat_lock);
1087}
1088
0e80220a 1089static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
39a53e0c
JK
1090{
1091 spin_lock(&sbi->stat_lock);
9850cf4a 1092 f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
39a53e0c
JK
1093 sbi->total_valid_inode_count--;
1094 spin_unlock(&sbi->stat_lock);
39a53e0c
JK
1095}
1096
1097static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
1098{
8b8343fa 1099 return sbi->total_valid_inode_count;
39a53e0c
JK
1100}
1101
1102static inline void f2fs_put_page(struct page *page, int unlock)
1103{
031fa8cc 1104 if (!page)
39a53e0c
JK
1105 return;
1106
1107 if (unlock) {
9850cf4a 1108 f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
39a53e0c
JK
1109 unlock_page(page);
1110 }
1111 page_cache_release(page);
1112}
1113
1114static inline void f2fs_put_dnode(struct dnode_of_data *dn)
1115{
1116 if (dn->node_page)
1117 f2fs_put_page(dn->node_page, 1);
1118 if (dn->inode_page && dn->node_page != dn->inode_page)
1119 f2fs_put_page(dn->inode_page, 0);
1120 dn->node_page = NULL;
1121 dn->inode_page = NULL;
1122}
1123
1124static inline struct kmem_cache *f2fs_kmem_cache_create(const char *name,
e8512d2e 1125 size_t size)
39a53e0c 1126{
e8512d2e 1127 return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
39a53e0c
JK
1128}
1129
7bd59381
GZ
1130static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
1131 gfp_t flags)
1132{
1133 void *entry;
1134retry:
1135 entry = kmem_cache_alloc(cachep, flags);
1136 if (!entry) {
1137 cond_resched();
1138 goto retry;
1139 }
1140
1141 return entry;
1142}
1143
9be32d72
JK
1144static inline void f2fs_radix_tree_insert(struct radix_tree_root *root,
1145 unsigned long index, void *item)
1146{
1147 while (radix_tree_insert(root, index, item))
1148 cond_resched();
1149}
1150
39a53e0c
JK
1151#define RAW_IS_INODE(p) ((p)->footer.nid == (p)->footer.ino)
1152
1153static inline bool IS_INODE(struct page *page)
1154{
45590710 1155 struct f2fs_node *p = F2FS_NODE(page);
39a53e0c
JK
1156 return RAW_IS_INODE(p);
1157}
1158
1159static inline __le32 *blkaddr_in_node(struct f2fs_node *node)
1160{
1161 return RAW_IS_INODE(node) ? node->i.i_addr : node->dn.addr;
1162}
1163
1164static inline block_t datablock_addr(struct page *node_page,
1165 unsigned int offset)
1166{
1167 struct f2fs_node *raw_node;
1168 __le32 *addr_array;
45590710 1169 raw_node = F2FS_NODE(node_page);
39a53e0c
JK
1170 addr_array = blkaddr_in_node(raw_node);
1171 return le32_to_cpu(addr_array[offset]);
1172}
1173
1174static inline int f2fs_test_bit(unsigned int nr, char *addr)
1175{
1176 int mask;
1177
1178 addr += (nr >> 3);
1179 mask = 1 << (7 - (nr & 0x07));
1180 return mask & *addr;
1181}
1182
52aca074 1183static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
39a53e0c
JK
1184{
1185 int mask;
1186 int ret;
1187
1188 addr += (nr >> 3);
1189 mask = 1 << (7 - (nr & 0x07));
1190 ret = mask & *addr;
1191 *addr |= mask;
1192 return ret;
1193}
1194
52aca074 1195static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
39a53e0c
JK
1196{
1197 int mask;
1198 int ret;
1199
1200 addr += (nr >> 3);
1201 mask = 1 << (7 - (nr & 0x07));
1202 ret = mask & *addr;
1203 *addr &= ~mask;
1204 return ret;
1205}
1206
c6ac4c0e
GZ
1207static inline void f2fs_change_bit(unsigned int nr, char *addr)
1208{
1209 int mask;
1210
1211 addr += (nr >> 3);
1212 mask = 1 << (7 - (nr & 0x07));
1213 *addr ^= mask;
1214}
1215
39a53e0c
JK
1216/* used for f2fs_inode_info->flags */
1217enum {
1218 FI_NEW_INODE, /* indicate newly allocated inode */
b3783873 1219 FI_DIRTY_INODE, /* indicate inode is dirty or not */
ed57c27f 1220 FI_DIRTY_DIR, /* indicate directory has dirty pages */
39a53e0c
JK
1221 FI_INC_LINK, /* need to increment i_nlink */
1222 FI_ACL_MODE, /* indicate acl mode */
1223 FI_NO_ALLOC, /* should not allocate any blocks */
699489bb 1224 FI_UPDATE_DIR, /* should update inode block for consistency */
74d0b917 1225 FI_DELAY_IPUT, /* used for the recovery */
c11abd1a 1226 FI_NO_EXTENT, /* not to use the extent cache */
444c580f 1227 FI_INLINE_XATTR, /* used for inline xattr */
1001b347 1228 FI_INLINE_DATA, /* used for inline data*/
34d67deb 1229 FI_INLINE_DENTRY, /* used for inline dentry */
fff04f90
JK
1230 FI_APPEND_WRITE, /* inode has appended data */
1231 FI_UPDATE_WRITE, /* inode has in-place-update data */
88b88a66
JK
1232 FI_NEED_IPU, /* used for ipu per file */
1233 FI_ATOMIC_FILE, /* indicate atomic file */
02a1335f 1234 FI_VOLATILE_FILE, /* indicate volatile file */
1e84371f 1235 FI_DROP_CACHE, /* drop dirty page cache */
b3d208f9 1236 FI_DATA_EXIST, /* indicate data exists */
39a53e0c
JK
1237};
1238
1239static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
1240{
61e0f2d0
JK
1241 if (!test_bit(flag, &fi->flags))
1242 set_bit(flag, &fi->flags);
39a53e0c
JK
1243}
1244
1245static inline int is_inode_flag_set(struct f2fs_inode_info *fi, int flag)
1246{
1247 return test_bit(flag, &fi->flags);
1248}
1249
1250static inline void clear_inode_flag(struct f2fs_inode_info *fi, int flag)
1251{
61e0f2d0
JK
1252 if (test_bit(flag, &fi->flags))
1253 clear_bit(flag, &fi->flags);
39a53e0c
JK
1254}
1255
1256static inline void set_acl_inode(struct f2fs_inode_info *fi, umode_t mode)
1257{
1258 fi->i_acl_mode = mode;
1259 set_inode_flag(fi, FI_ACL_MODE);
1260}
1261
444c580f
JK
1262static inline void get_inline_info(struct f2fs_inode_info *fi,
1263 struct f2fs_inode *ri)
1264{
1265 if (ri->i_inline & F2FS_INLINE_XATTR)
1266 set_inode_flag(fi, FI_INLINE_XATTR);
1001b347
HL
1267 if (ri->i_inline & F2FS_INLINE_DATA)
1268 set_inode_flag(fi, FI_INLINE_DATA);
34d67deb
CY
1269 if (ri->i_inline & F2FS_INLINE_DENTRY)
1270 set_inode_flag(fi, FI_INLINE_DENTRY);
b3d208f9
JK
1271 if (ri->i_inline & F2FS_DATA_EXIST)
1272 set_inode_flag(fi, FI_DATA_EXIST);
444c580f
JK
1273}
1274
1275static inline void set_raw_inline(struct f2fs_inode_info *fi,
1276 struct f2fs_inode *ri)
1277{
1278 ri->i_inline = 0;
1279
1280 if (is_inode_flag_set(fi, FI_INLINE_XATTR))
1281 ri->i_inline |= F2FS_INLINE_XATTR;
1001b347
HL
1282 if (is_inode_flag_set(fi, FI_INLINE_DATA))
1283 ri->i_inline |= F2FS_INLINE_DATA;
34d67deb
CY
1284 if (is_inode_flag_set(fi, FI_INLINE_DENTRY))
1285 ri->i_inline |= F2FS_INLINE_DENTRY;
b3d208f9
JK
1286 if (is_inode_flag_set(fi, FI_DATA_EXIST))
1287 ri->i_inline |= F2FS_DATA_EXIST;
444c580f
JK
1288}
1289
987c7c31
CY
1290static inline int f2fs_has_inline_xattr(struct inode *inode)
1291{
1292 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
1293}
1294
de93653f
JK
1295static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
1296{
987c7c31 1297 if (f2fs_has_inline_xattr(&fi->vfs_inode))
de93653f
JK
1298 return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
1299 return DEF_ADDRS_PER_INODE;
1300}
1301
65985d93
JK
1302static inline void *inline_xattr_addr(struct page *page)
1303{
695fd1ed 1304 struct f2fs_inode *ri = F2FS_INODE(page);
65985d93
JK
1305 return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
1306 F2FS_INLINE_XATTR_ADDRS]);
1307}
1308
1309static inline int inline_xattr_size(struct inode *inode)
1310{
987c7c31 1311 if (f2fs_has_inline_xattr(inode))
65985d93
JK
1312 return F2FS_INLINE_XATTR_ADDRS << 2;
1313 else
1314 return 0;
1315}
1316
0dbdc2ae
JK
1317static inline int f2fs_has_inline_data(struct inode *inode)
1318{
1319 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
1320}
1321
b3d208f9
JK
1322static inline void f2fs_clear_inline_inode(struct inode *inode)
1323{
1324 clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
1325 clear_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
1326}
1327
1328static inline int f2fs_exist_data(struct inode *inode)
1329{
1330 return is_inode_flag_set(F2FS_I(inode), FI_DATA_EXIST);
1331}
1332
88b88a66
JK
1333static inline bool f2fs_is_atomic_file(struct inode *inode)
1334{
1335 return is_inode_flag_set(F2FS_I(inode), FI_ATOMIC_FILE);
1336}
1337
02a1335f
JK
1338static inline bool f2fs_is_volatile_file(struct inode *inode)
1339{
1340 return is_inode_flag_set(F2FS_I(inode), FI_VOLATILE_FILE);
1341}
1342
1e84371f
JK
1343static inline bool f2fs_is_drop_cache(struct inode *inode)
1344{
1345 return is_inode_flag_set(F2FS_I(inode), FI_DROP_CACHE);
1346}
1347
1001b347
HL
1348static inline void *inline_data_addr(struct page *page)
1349{
695fd1ed 1350 struct f2fs_inode *ri = F2FS_INODE(page);
1001b347
HL
1351 return (void *)&(ri->i_addr[1]);
1352}
1353
34d67deb
CY
1354static inline int f2fs_has_inline_dentry(struct inode *inode)
1355{
1356 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DENTRY);
1357}
1358
9486ba44
JK
1359static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
1360{
1361 if (!f2fs_has_inline_dentry(dir))
1362 kunmap(page);
1363}
1364
77888c1e
JK
1365static inline int f2fs_readonly(struct super_block *sb)
1366{
1367 return sb->s_flags & MS_RDONLY;
1368}
1369
1e968fdf
JK
1370static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
1371{
1372 return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
1373}
1374
744602cf
JK
1375static inline void f2fs_stop_checkpoint(struct f2fs_sb_info *sbi)
1376{
1377 set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
1378 sbi->sb->s_flags |= MS_RDONLY;
1379}
1380
a6dda0e6
CH
1381#define get_inode_mode(i) \
1382 ((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
1383 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))
1384
267378d4
CY
1385/* get offset of first page in next direct node */
1386#define PGOFS_OF_NEXT_DNODE(pgofs, fi) \
1387 ((pgofs < ADDRS_PER_INODE(fi)) ? ADDRS_PER_INODE(fi) : \
1388 (pgofs - ADDRS_PER_INODE(fi) + ADDRS_PER_BLOCK) / \
1389 ADDRS_PER_BLOCK * ADDRS_PER_BLOCK + ADDRS_PER_INODE(fi))
1390
39a53e0c
JK
1391/*
1392 * file.c
1393 */
1394int f2fs_sync_file(struct file *, loff_t, loff_t, int);
1395void truncate_data_blocks(struct dnode_of_data *);
764aa3e9 1396int truncate_blocks(struct inode *, u64, bool);
39a53e0c 1397void f2fs_truncate(struct inode *);
2d4d9fb5 1398int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
39a53e0c
JK
1399int f2fs_setattr(struct dentry *, struct iattr *);
1400int truncate_hole(struct inode *, pgoff_t, pgoff_t);
b292dcab 1401int truncate_data_blocks_range(struct dnode_of_data *, int);
39a53e0c 1402long f2fs_ioctl(struct file *, unsigned int, unsigned long);
e9750824 1403long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
39a53e0c
JK
1404
1405/*
1406 * inode.c
1407 */
1408void f2fs_set_inode_flags(struct inode *);
39a53e0c 1409struct inode *f2fs_iget(struct super_block *, unsigned long);
4660f9c0 1410int try_to_free_nats(struct f2fs_sb_info *, int);
39a53e0c 1411void update_inode(struct inode *, struct page *);
744602cf 1412void update_inode_page(struct inode *);
39a53e0c
JK
1413int f2fs_write_inode(struct inode *, struct writeback_control *);
1414void f2fs_evict_inode(struct inode *);
44c16156 1415void handle_failed_inode(struct inode *);
39a53e0c
JK
1416
1417/*
1418 * namei.c
1419 */
1420struct dentry *f2fs_get_parent(struct dentry *child);
1421
1422/*
1423 * dir.c
1424 */
dbeacf02 1425extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
dbeacf02 1426void set_de_type(struct f2fs_dir_entry *, struct inode *);
7b3cd7d6
JK
1427struct f2fs_dir_entry *find_target_dentry(struct qstr *, int *,
1428 struct f2fs_dentry_ptr *);
1429bool f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
1430 unsigned int);
062a3e7b
JK
1431void do_make_empty_dir(struct inode *, struct inode *,
1432 struct f2fs_dentry_ptr *);
dbeacf02 1433struct page *init_inode_metadata(struct inode *, struct inode *,
bce8d112 1434 const struct qstr *, struct page *);
dbeacf02 1435void update_parent_metadata(struct inode *, struct inode *, unsigned int);
a82afa20 1436int room_for_filename(const void *, int, int);
dbeacf02 1437void f2fs_drop_nlink(struct inode *, struct inode *, struct page *);
39a53e0c
JK
1438struct f2fs_dir_entry *f2fs_find_entry(struct inode *, struct qstr *,
1439 struct page **);
1440struct f2fs_dir_entry *f2fs_parent_dir(struct inode *, struct page **);
1441ino_t f2fs_inode_by_name(struct inode *, struct qstr *);
1442void f2fs_set_link(struct inode *, struct f2fs_dir_entry *,
1443 struct page *, struct inode *);
1cd14caf 1444int update_dent_inode(struct inode *, const struct qstr *);
3b4d732a
CY
1445void f2fs_update_dentry(struct inode *, struct f2fs_dentry_ptr *,
1446 const struct qstr *, f2fs_hash_t , unsigned int);
b7f7a5e0 1447int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *);
dbeacf02
CY
1448void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
1449 struct inode *);
b97a9b5d 1450int f2fs_do_tmpfile(struct inode *, struct inode *);
39a53e0c
JK
1451int f2fs_make_empty(struct inode *, struct inode *);
1452bool f2fs_empty_dir(struct inode *);
1453
b7f7a5e0
AV
1454static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
1455{
1456 return __f2fs_add_link(dentry->d_parent->d_inode, &dentry->d_name,
1457 inode);
1458}
1459
39a53e0c
JK
1460/*
1461 * super.c
1462 */
1463int f2fs_sync_fs(struct super_block *, int);
a07ef784
NJ
1464extern __printf(3, 4)
1465void f2fs_msg(struct super_block *, const char *, const char *, ...);
39a53e0c
JK
1466
1467/*
1468 * hash.c
1469 */
eee6160f 1470f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
39a53e0c
JK
1471
1472/*
1473 * node.c
1474 */
1475struct dnode_of_data;
1476struct node_info;
1477
6fb03f3a 1478bool available_free_memory(struct f2fs_sb_info *, int);
88bd02c9
JK
1479bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
1480bool has_fsynced_inode(struct f2fs_sb_info *, nid_t);
1481bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
39a53e0c
JK
1482void get_node_info(struct f2fs_sb_info *, nid_t, struct node_info *);
1483int get_dnode_of_data(struct dnode_of_data *, pgoff_t, int);
1484int truncate_inode_blocks(struct inode *, pgoff_t);
4f16fb0f 1485int truncate_xattr_node(struct inode *, struct page *);
cfe58f9d 1486int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
58e674d6 1487void remove_inode_page(struct inode *);
a014e037 1488struct page *new_inode_page(struct inode *);
8ae8f162 1489struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
39a53e0c
JK
1490void ra_node_page(struct f2fs_sb_info *, nid_t);
1491struct page *get_node_page(struct f2fs_sb_info *, pgoff_t);
1492struct page *get_node_page_ra(struct page *, int);
1493void sync_inode_page(struct dnode_of_data *);
1494int sync_node_pages(struct f2fs_sb_info *, nid_t, struct writeback_control *);
1495bool alloc_nid(struct f2fs_sb_info *, nid_t *);
1496void alloc_nid_done(struct f2fs_sb_info *, nid_t);
1497void alloc_nid_failed(struct f2fs_sb_info *, nid_t);
70cfed88 1498void recover_inline_xattr(struct inode *, struct page *);
1c35a90e 1499void recover_xattr_data(struct inode *, struct page *, block_t);
39a53e0c
JK
1500int recover_inode_page(struct f2fs_sb_info *, struct page *);
1501int restore_node_summary(struct f2fs_sb_info *, unsigned int,
1502 struct f2fs_summary_block *);
1503void flush_nat_entries(struct f2fs_sb_info *);
1504int build_node_manager(struct f2fs_sb_info *);
1505void destroy_node_manager(struct f2fs_sb_info *);
6e6093a8 1506int __init create_node_manager_caches(void);
39a53e0c
JK
1507void destroy_node_manager_caches(void);
1508
1509/*
1510 * segment.c
1511 */
88b88a66
JK
1512void register_inmem_page(struct inode *, struct page *);
1513void commit_inmem_pages(struct inode *, bool);
39a53e0c 1514void f2fs_balance_fs(struct f2fs_sb_info *);
4660f9c0 1515void f2fs_balance_fs_bg(struct f2fs_sb_info *);
6b4afdd7 1516int f2fs_issue_flush(struct f2fs_sb_info *);
2163d198
GZ
1517int create_flush_cmd_control(struct f2fs_sb_info *);
1518void destroy_flush_cmd_control(struct f2fs_sb_info *);
39a53e0c 1519void invalidate_blocks(struct f2fs_sb_info *, block_t);
5e443818 1520void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
39a53e0c 1521void clear_prefree_segments(struct f2fs_sb_info *);
4b2fecc8 1522void release_discard_addrs(struct f2fs_sb_info *);
cf2271e7 1523void discard_next_dnode(struct f2fs_sb_info *, block_t);
3fa06d7b 1524int npages_for_summary_flush(struct f2fs_sb_info *, bool);
39a53e0c 1525void allocate_new_segments(struct f2fs_sb_info *);
4b2fecc8 1526int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
39a53e0c 1527struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
577e3495 1528void write_meta_page(struct f2fs_sb_info *, struct page *);
fb5566da 1529void write_node_page(struct f2fs_sb_info *, struct page *,
cf04e8eb
JK
1530 unsigned int, struct f2fs_io_info *);
1531void write_data_page(struct page *, struct dnode_of_data *,
1532 struct f2fs_io_info *);
1533void rewrite_data_page(struct page *, struct f2fs_io_info *);
39a53e0c
JK
1534void recover_data_page(struct f2fs_sb_info *, struct page *,
1535 struct f2fs_summary *, block_t, block_t);
bfad7c2d
JK
1536void allocate_data_block(struct f2fs_sb_info *, struct page *,
1537 block_t, block_t *, struct f2fs_summary *, int);
5514f0aa 1538void f2fs_wait_on_page_writeback(struct page *, enum page_type);
39a53e0c
JK
1539void write_data_summaries(struct f2fs_sb_info *, block_t);
1540void write_node_summaries(struct f2fs_sb_info *, block_t);
1541int lookup_journal_in_cursum(struct f2fs_summary_block *,
1542 int, unsigned int, int);
4b2fecc8 1543void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
39a53e0c 1544int build_segment_manager(struct f2fs_sb_info *);
39a53e0c 1545void destroy_segment_manager(struct f2fs_sb_info *);
7fd9e544
JK
1546int __init create_segment_manager_caches(void);
1547void destroy_segment_manager_caches(void);
39a53e0c
JK
1548
1549/*
1550 * checkpoint.c
1551 */
1552struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
1553struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
4c521f49 1554int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int);
635aee1f 1555void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
39a53e0c 1556long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
fff04f90
JK
1557void add_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
1558void remove_dirty_inode(struct f2fs_sb_info *, nid_t, int type);
6f12ac25 1559void release_dirty_inode(struct f2fs_sb_info *);
fff04f90 1560bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
cbd56e7d
JK
1561int acquire_orphan_inode(struct f2fs_sb_info *);
1562void release_orphan_inode(struct f2fs_sb_info *);
39a53e0c
JK
1563void add_orphan_inode(struct f2fs_sb_info *, nid_t);
1564void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
8f99a946 1565void recover_orphan_inodes(struct f2fs_sb_info *);
39a53e0c 1566int get_valid_checkpoint(struct f2fs_sb_info *);
a7ffdbe2 1567void update_dirty_page(struct inode *, struct page *);
5deb8267 1568void add_dirty_dir_inode(struct inode *);
39a53e0c
JK
1569void remove_dirty_dir_inode(struct inode *);
1570void sync_dirty_dir_inodes(struct f2fs_sb_info *);
75ab4cb8 1571void write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
6451e041 1572void init_ino_entry_info(struct f2fs_sb_info *);
6e6093a8 1573int __init create_checkpoint_caches(void);
39a53e0c
JK
1574void destroy_checkpoint_caches(void);
1575
1576/*
1577 * data.c
1578 */
458e6197 1579void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
cf04e8eb
JK
1580int f2fs_submit_page_bio(struct f2fs_sb_info *, struct page *,
1581 struct f2fs_io_info *);
1582void f2fs_submit_page_mbio(struct f2fs_sb_info *, struct page *,
458e6197 1583 struct f2fs_io_info *);
39a53e0c 1584int reserve_new_block(struct dnode_of_data *);
b600965c 1585int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
429511cd
CY
1586void f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
1587void f2fs_destroy_extent_tree(struct inode *);
7e4dde79 1588void f2fs_update_extent_cache(struct dnode_of_data *);
c718379b 1589struct page *find_data_page(struct inode *, pgoff_t, bool);
39a53e0c 1590struct page *get_lock_data_page(struct inode *, pgoff_t);
64aa7ed9 1591struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
458e6197 1592int do_write_data_page(struct page *, struct f2fs_io_info *);
9ab70134 1593int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
429511cd
CY
1594void init_extent_cache_info(struct f2fs_sb_info *);
1595int __init create_extent_cache(void);
1596void destroy_extent_cache(void);
487261f3
CY
1597void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
1598int f2fs_release_page(struct page *, gfp_t);
39a53e0c
JK
1599
1600/*
1601 * gc.c
1602 */
1603int start_gc_thread(struct f2fs_sb_info *);
1604void stop_gc_thread(struct f2fs_sb_info *);
de93653f 1605block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
408e9375 1606int f2fs_gc(struct f2fs_sb_info *);
39a53e0c 1607void build_gc_manager(struct f2fs_sb_info *);
39a53e0c
JK
1608
1609/*
1610 * recovery.c
1611 */
6ead1142 1612int recover_fsync_data(struct f2fs_sb_info *);
39a53e0c
JK
1613bool space_for_roll_forward(struct f2fs_sb_info *);
1614
1615/*
1616 * debug.c
1617 */
1618#ifdef CONFIG_F2FS_STAT_FS
1619struct f2fs_stat_info {
1620 struct list_head stat_list;
1621 struct f2fs_sb_info *sbi;
39a53e0c
JK
1622 int all_area_segs, sit_area_segs, nat_area_segs, ssa_area_segs;
1623 int main_area_segs, main_area_sections, main_area_zones;
4bf6fd9f 1624 int hit_ext, total_ext, ext_tree, ext_node;
39a53e0c 1625 int ndirty_node, ndirty_dent, ndirty_dirs, ndirty_meta;
dd4e4b59 1626 int nats, dirty_nats, sits, dirty_sits, fnids;
39a53e0c 1627 int total_count, utilization;
d24bdcbf 1628 int bg_gc, inline_inode, inline_dir, inmem_pages, wb_pages;
39a53e0c
JK
1629 unsigned int valid_count, valid_node_count, valid_inode_count;
1630 unsigned int bimodal, avg_vblocks;
1631 int util_free, util_valid, util_invalid;
1632 int rsvd_segs, overp_segs;
1633 int dirty_count, node_pages, meta_pages;
942e0be6 1634 int prefree_count, call_count, cp_count;
39a53e0c 1635 int tot_segs, node_segs, data_segs, free_segs, free_secs;
e1235983 1636 int bg_node_segs, bg_data_segs;
39a53e0c 1637 int tot_blks, data_blks, node_blks;
e1235983 1638 int bg_data_blks, bg_node_blks;
39a53e0c
JK
1639 int curseg[NR_CURSEG_TYPE];
1640 int cursec[NR_CURSEG_TYPE];
1641 int curzone[NR_CURSEG_TYPE];
1642
1643 unsigned int segment_count[2];
1644 unsigned int block_count[2];
b9a2c252 1645 unsigned int inplace_count;
6f0aacbc 1646 unsigned base_mem, cache_mem, page_mem;
39a53e0c
JK
1647};
1648
963d4f7d
GZ
1649static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
1650{
6c311ec6 1651 return (struct f2fs_stat_info *)sbi->stat_info;
963d4f7d
GZ
1652}
1653
942e0be6 1654#define stat_inc_cp_count(si) ((si)->cp_count++)
dcdfff65
JK
1655#define stat_inc_call_count(si) ((si)->call_count++)
1656#define stat_inc_bggc_count(sbi) ((sbi)->bg_gc++)
1657#define stat_inc_dirty_dir(sbi) ((sbi)->n_dirty_dirs++)
1658#define stat_dec_dirty_dir(sbi) ((sbi)->n_dirty_dirs--)
1659#define stat_inc_total_hit(sb) ((F2FS_SB(sb))->total_hit_ext++)
1660#define stat_inc_read_hit(sb) ((F2FS_SB(sb))->read_hit_ext++)
0dbdc2ae
JK
1661#define stat_inc_inline_inode(inode) \
1662 do { \
1663 if (f2fs_has_inline_data(inode)) \
03e14d52 1664 (atomic_inc(&F2FS_I_SB(inode)->inline_inode)); \
0dbdc2ae
JK
1665 } while (0)
1666#define stat_dec_inline_inode(inode) \
1667 do { \
1668 if (f2fs_has_inline_data(inode)) \
03e14d52 1669 (atomic_dec(&F2FS_I_SB(inode)->inline_inode)); \
0dbdc2ae 1670 } while (0)
3289c061
JK
1671#define stat_inc_inline_dir(inode) \
1672 do { \
1673 if (f2fs_has_inline_dentry(inode)) \
03e14d52 1674 (atomic_inc(&F2FS_I_SB(inode)->inline_dir)); \
3289c061
JK
1675 } while (0)
1676#define stat_dec_inline_dir(inode) \
1677 do { \
1678 if (f2fs_has_inline_dentry(inode)) \
03e14d52 1679 (atomic_dec(&F2FS_I_SB(inode)->inline_dir)); \
3289c061 1680 } while (0)
dcdfff65
JK
1681#define stat_inc_seg_type(sbi, curseg) \
1682 ((sbi)->segment_count[(curseg)->alloc_type]++)
1683#define stat_inc_block_count(sbi, curseg) \
1684 ((sbi)->block_count[(curseg)->alloc_type]++)
b9a2c252
CL
1685#define stat_inc_inplace_blocks(sbi) \
1686 (atomic_inc(&(sbi)->inplace_count))
e1235983 1687#define stat_inc_seg_count(sbi, type, gc_type) \
39a53e0c 1688 do { \
963d4f7d 1689 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c 1690 (si)->tot_segs++; \
e1235983 1691 if (type == SUM_TYPE_DATA) { \
39a53e0c 1692 si->data_segs++; \
e1235983
CL
1693 si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0; \
1694 } else { \
39a53e0c 1695 si->node_segs++; \
e1235983
CL
1696 si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0; \
1697 } \
39a53e0c
JK
1698 } while (0)
1699
1700#define stat_inc_tot_blk_count(si, blks) \
1701 (si->tot_blks += (blks))
1702
e1235983 1703#define stat_inc_data_blk_count(sbi, blks, gc_type) \
39a53e0c 1704 do { \
963d4f7d 1705 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c
JK
1706 stat_inc_tot_blk_count(si, blks); \
1707 si->data_blks += (blks); \
e1235983 1708 si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0; \
39a53e0c
JK
1709 } while (0)
1710
e1235983 1711#define stat_inc_node_blk_count(sbi, blks, gc_type) \
39a53e0c 1712 do { \
963d4f7d 1713 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c
JK
1714 stat_inc_tot_blk_count(si, blks); \
1715 si->node_blks += (blks); \
e1235983 1716 si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0; \
39a53e0c
JK
1717 } while (0)
1718
1719int f2fs_build_stats(struct f2fs_sb_info *);
1720void f2fs_destroy_stats(struct f2fs_sb_info *);
6e6093a8 1721void __init f2fs_create_root_stats(void);
4589d25d 1722void f2fs_destroy_root_stats(void);
39a53e0c 1723#else
942e0be6 1724#define stat_inc_cp_count(si)
39a53e0c 1725#define stat_inc_call_count(si)
dcdfff65
JK
1726#define stat_inc_bggc_count(si)
1727#define stat_inc_dirty_dir(sbi)
1728#define stat_dec_dirty_dir(sbi)
1729#define stat_inc_total_hit(sb)
1730#define stat_inc_read_hit(sb)
0dbdc2ae
JK
1731#define stat_inc_inline_inode(inode)
1732#define stat_dec_inline_inode(inode)
3289c061
JK
1733#define stat_inc_inline_dir(inode)
1734#define stat_dec_inline_dir(inode)
dcdfff65
JK
1735#define stat_inc_seg_type(sbi, curseg)
1736#define stat_inc_block_count(sbi, curseg)
b9a2c252 1737#define stat_inc_inplace_blocks(sbi)
e1235983 1738#define stat_inc_seg_count(sbi, type, gc_type)
39a53e0c 1739#define stat_inc_tot_blk_count(si, blks)
e1235983
CL
1740#define stat_inc_data_blk_count(sbi, blks, gc_type)
1741#define stat_inc_node_blk_count(sbi, blks, gc_type)
39a53e0c
JK
1742
1743static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
1744static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
6e6093a8 1745static inline void __init f2fs_create_root_stats(void) { }
4589d25d 1746static inline void f2fs_destroy_root_stats(void) { }
39a53e0c
JK
1747#endif
1748
1749extern const struct file_operations f2fs_dir_operations;
1750extern const struct file_operations f2fs_file_operations;
1751extern const struct inode_operations f2fs_file_inode_operations;
1752extern const struct address_space_operations f2fs_dblock_aops;
1753extern const struct address_space_operations f2fs_node_aops;
1754extern const struct address_space_operations f2fs_meta_aops;
1755extern const struct inode_operations f2fs_dir_inode_operations;
1756extern const struct inode_operations f2fs_symlink_inode_operations;
1757extern const struct inode_operations f2fs_special_inode_operations;
29e7043f 1758extern struct kmem_cache *inode_entry_slab;
1001b347 1759
e18c65b2
HL
1760/*
1761 * inline.c
1762 */
e18c65b2 1763bool f2fs_may_inline(struct inode *);
b3d208f9 1764void read_inline_data(struct page *, struct page *);
0bfcfcca 1765bool truncate_inline_inode(struct page *, u64);
e18c65b2 1766int f2fs_read_inline_data(struct inode *, struct page *);
b3d208f9
JK
1767int f2fs_convert_inline_page(struct dnode_of_data *, struct page *);
1768int f2fs_convert_inline_inode(struct inode *);
1769int f2fs_write_inline_data(struct inode *, struct page *);
0342fd30 1770bool recover_inline_data(struct inode *, struct page *);
201a05be
CY
1771struct f2fs_dir_entry *find_in_inline_dir(struct inode *, struct qstr *,
1772 struct page **);
1773struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *, struct page **);
1774int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
1775int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *);
1776void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
1777 struct inode *, struct inode *);
1778bool f2fs_empty_inline_dir(struct inode *);
1779int f2fs_read_inline_dir(struct file *, struct dir_context *);
39a53e0c 1780#endif