f2fs: recover inline xattr data in roll-forward process
[GitHub/LineageOS/android_kernel_motorola_exynos9610.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
JK
23#ifdef CONFIG_F2FS_CHECK_FS
24#define f2fs_bug_on(condition) BUG_ON(condition)
0daaad97 25#define f2fs_down_write(x, y) down_write_nest_lock(x, y)
5d56b671
JK
26#else
27#define f2fs_bug_on(condition)
0daaad97 28#define f2fs_down_write(x, y) down_write(x)
5d56b671
JK
29#endif
30
39a53e0c
JK
31/*
32 * For mount options
33 */
34#define F2FS_MOUNT_BG_GC 0x00000001
35#define F2FS_MOUNT_DISABLE_ROLL_FORWARD 0x00000002
36#define F2FS_MOUNT_DISCARD 0x00000004
37#define F2FS_MOUNT_NOHEAP 0x00000008
38#define F2FS_MOUNT_XATTR_USER 0x00000010
39#define F2FS_MOUNT_POSIX_ACL 0x00000020
40#define F2FS_MOUNT_DISABLE_EXT_IDENTIFY 0x00000040
444c580f 41#define F2FS_MOUNT_INLINE_XATTR 0x00000080
1001b347 42#define F2FS_MOUNT_INLINE_DATA 0x00000100
39a53e0c
JK
43
44#define clear_opt(sbi, option) (sbi->mount_opt.opt &= ~F2FS_MOUNT_##option)
45#define set_opt(sbi, option) (sbi->mount_opt.opt |= F2FS_MOUNT_##option)
46#define test_opt(sbi, option) (sbi->mount_opt.opt & F2FS_MOUNT_##option)
47
48#define ver_after(a, b) (typecheck(unsigned long long, a) && \
49 typecheck(unsigned long long, b) && \
50 ((long long)((a) - (b)) > 0))
51
a9841c4d
JK
52typedef u32 block_t; /*
53 * should not change u32, since it is the on-disk block
54 * address format, __le32.
55 */
39a53e0c
JK
56typedef u32 nid_t;
57
58struct f2fs_mount_info {
59 unsigned int opt;
60};
61
7e586fa0
JK
62#define CRCPOLY_LE 0xedb88320
63
64static inline __u32 f2fs_crc32(void *buf, size_t len)
39a53e0c 65{
7e586fa0
JK
66 unsigned char *p = (unsigned char *)buf;
67 __u32 crc = F2FS_SUPER_MAGIC;
68 int i;
69
70 while (len--) {
71 crc ^= *p++;
72 for (i = 0; i < 8; i++)
73 crc = (crc >> 1) ^ ((crc & 1) ? CRCPOLY_LE : 0);
74 }
75 return crc;
39a53e0c
JK
76}
77
7e586fa0 78static inline bool f2fs_crc_valid(__u32 blk_crc, void *buf, size_t buf_size)
39a53e0c 79{
7e586fa0 80 return f2fs_crc32(buf, buf_size) == blk_crc;
39a53e0c
JK
81}
82
83/*
84 * For checkpoint manager
85 */
86enum {
87 NAT_BITMAP,
88 SIT_BITMAP
89};
90
662befda 91/*
81c1a0f1 92 * For CP/NAT/SIT/SSA readahead
662befda
CY
93 */
94enum {
95 META_CP,
96 META_NAT,
81c1a0f1
CY
97 META_SIT,
98 META_SSA
662befda
CY
99};
100
39a53e0c
JK
101/* for the list of orphan inodes */
102struct orphan_inode_entry {
103 struct list_head list; /* list head */
104 nid_t ino; /* inode number */
105};
106
107/* for the list of directory inodes */
108struct dir_inode_entry {
109 struct list_head list; /* list head */
110 struct inode *inode; /* vfs inode pointer */
111};
112
7fd9e544
JK
113/* for the list of blockaddresses to be discarded */
114struct discard_entry {
115 struct list_head list; /* list head */
116 block_t blkaddr; /* block address to be discarded */
117 int len; /* # of consecutive blocks of the discard */
118};
119
39a53e0c
JK
120/* for the list of fsync inodes, used only during recovery */
121struct fsync_inode_entry {
122 struct list_head list; /* list head */
123 struct inode *inode; /* vfs inode pointer */
124 block_t blkaddr; /* block address locating the last inode */
125};
126
127#define nats_in_cursum(sum) (le16_to_cpu(sum->n_nats))
128#define sits_in_cursum(sum) (le16_to_cpu(sum->n_sits))
129
130#define nat_in_journal(sum, i) (sum->nat_j.entries[i].ne)
131#define nid_in_journal(sum, i) (sum->nat_j.entries[i].nid)
132#define sit_in_journal(sum, i) (sum->sit_j.entries[i].se)
133#define segno_in_journal(sum, i) (sum->sit_j.entries[i].segno)
134
135static inline int update_nats_in_cursum(struct f2fs_summary_block *rs, int i)
136{
137 int before = nats_in_cursum(rs);
138 rs->n_nats = cpu_to_le16(before + i);
139 return before;
140}
141
142static inline int update_sits_in_cursum(struct f2fs_summary_block *rs, int i)
143{
144 int before = sits_in_cursum(rs);
145 rs->n_sits = cpu_to_le16(before + i);
146 return before;
147}
148
e9750824
NJ
149/*
150 * ioctl commands
151 */
152#define F2FS_IOC_GETFLAGS FS_IOC_GETFLAGS
153#define F2FS_IOC_SETFLAGS FS_IOC_SETFLAGS
154
155#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
156/*
157 * ioctl commands in 32 bit emulation
158 */
159#define F2FS_IOC32_GETFLAGS FS_IOC32_GETFLAGS
160#define F2FS_IOC32_SETFLAGS FS_IOC32_SETFLAGS
161#endif
162
39a53e0c
JK
163/*
164 * For INODE and NODE manager
165 */
dbe6a5ff
JK
166/*
167 * XATTR_NODE_OFFSET stores xattrs to one node block per file keeping -1
168 * as its node offset to distinguish from index node blocks.
169 * But some bits are used to mark the node block.
170 */
171#define XATTR_NODE_OFFSET ((((unsigned int)-1) << OFFSET_BIT_SHIFT) \
172 >> OFFSET_BIT_SHIFT)
266e97a8
JK
173enum {
174 ALLOC_NODE, /* allocate a new node page if needed */
175 LOOKUP_NODE, /* look up a node without readahead */
176 LOOKUP_NODE_RA, /*
177 * look up a node with readahead called
4f4124d0 178 * by get_data_block.
39a53e0c 179 */
266e97a8
JK
180};
181
39a53e0c
JK
182#define F2FS_LINK_MAX 32000 /* maximum link count per file */
183
184/* for in-memory extent cache entry */
c11abd1a
JK
185#define F2FS_MIN_EXTENT_LEN 16 /* minimum extent length */
186
39a53e0c
JK
187struct extent_info {
188 rwlock_t ext_lock; /* rwlock for consistency */
189 unsigned int fofs; /* start offset in a file */
190 u32 blk_addr; /* start block address of the extent */
111d2495 191 unsigned int len; /* length of the extent */
39a53e0c
JK
192};
193
194/*
195 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
196 */
197#define FADVISE_COLD_BIT 0x01
354a3399 198#define FADVISE_LOST_PINO_BIT 0x02
39a53e0c 199
ab9fa662
JK
200#define DEF_DIR_LEVEL 0
201
39a53e0c
JK
202struct f2fs_inode_info {
203 struct inode vfs_inode; /* serve a vfs inode */
204 unsigned long i_flags; /* keep an inode flags for ioctl */
205 unsigned char i_advise; /* use to give file attribute hints */
38431545 206 unsigned char i_dir_level; /* use for dentry level for large dir */
39a53e0c 207 unsigned int i_current_depth; /* use only in directory structure */
6666e6aa 208 unsigned int i_pino; /* parent inode number */
39a53e0c
JK
209 umode_t i_acl_mode; /* keep file acl mode temporarily */
210
211 /* Use below internally in f2fs*/
212 unsigned long flags; /* use to pass per-file flags */
39a53e0c
JK
213 atomic_t dirty_dents; /* # of dirty dentry pages */
214 f2fs_hash_t chash; /* hash value of given file name */
215 unsigned int clevel; /* maximum level of given file name */
216 nid_t i_xattr_nid; /* node id that contains xattrs */
e518ff81 217 unsigned long long xattr_ver; /* cp version of xattr modification */
39a53e0c
JK
218 struct extent_info ext; /* in-memory extent cache entry */
219};
220
221static inline void get_extent_info(struct extent_info *ext,
222 struct f2fs_extent i_ext)
223{
224 write_lock(&ext->ext_lock);
225 ext->fofs = le32_to_cpu(i_ext.fofs);
226 ext->blk_addr = le32_to_cpu(i_ext.blk_addr);
227 ext->len = le32_to_cpu(i_ext.len);
228 write_unlock(&ext->ext_lock);
229}
230
231static inline void set_raw_extent(struct extent_info *ext,
232 struct f2fs_extent *i_ext)
233{
234 read_lock(&ext->ext_lock);
235 i_ext->fofs = cpu_to_le32(ext->fofs);
236 i_ext->blk_addr = cpu_to_le32(ext->blk_addr);
237 i_ext->len = cpu_to_le32(ext->len);
238 read_unlock(&ext->ext_lock);
239}
240
241struct f2fs_nm_info {
242 block_t nat_blkaddr; /* base disk address of NAT */
243 nid_t max_nid; /* maximum possible node ids */
39a53e0c
JK
244 nid_t next_scan_nid; /* the next nid to be scanned */
245
246 /* NAT cache management */
247 struct radix_tree_root nat_root;/* root of the nat entry cache */
248 rwlock_t nat_tree_lock; /* protect nat_tree_lock */
249 unsigned int nat_cnt; /* the # of cached nat entries */
250 struct list_head nat_entries; /* cached nat entry list (clean) */
251 struct list_head dirty_nat_entries; /* cached nat entry list (dirty) */
252
253 /* free node ids management */
8a7ed66a 254 struct radix_tree_root free_nid_root;/* root of the free_nid cache */
39a53e0c
JK
255 struct list_head free_nid_list; /* a list for free nids */
256 spinlock_t free_nid_list_lock; /* protect free nid list */
257 unsigned int fcnt; /* the number of free node id */
258 struct mutex build_lock; /* lock for build free nids */
259
260 /* for checkpoint */
261 char *nat_bitmap; /* NAT bitmap pointer */
262 int bitmap_size; /* bitmap size */
263};
264
265/*
266 * this structure is used as one of function parameters.
267 * all the information are dedicated to a given direct node block determined
268 * by the data offset in a file.
269 */
270struct dnode_of_data {
271 struct inode *inode; /* vfs inode pointer */
272 struct page *inode_page; /* its inode page, NULL is possible */
273 struct page *node_page; /* cached direct node page */
274 nid_t nid; /* node id of the direct node block */
275 unsigned int ofs_in_node; /* data offset in the node page */
276 bool inode_page_locked; /* inode page is locked or not */
277 block_t data_blkaddr; /* block address of the node block */
278};
279
280static inline void set_new_dnode(struct dnode_of_data *dn, struct inode *inode,
281 struct page *ipage, struct page *npage, nid_t nid)
282{
d66d1f76 283 memset(dn, 0, sizeof(*dn));
39a53e0c
JK
284 dn->inode = inode;
285 dn->inode_page = ipage;
286 dn->node_page = npage;
287 dn->nid = nid;
39a53e0c
JK
288}
289
290/*
291 * For SIT manager
292 *
293 * By default, there are 6 active log areas across the whole main area.
294 * When considering hot and cold data separation to reduce cleaning overhead,
295 * we split 3 for data logs and 3 for node logs as hot, warm, and cold types,
296 * respectively.
297 * In the current design, you should not change the numbers intentionally.
298 * Instead, as a mount option such as active_logs=x, you can use 2, 4, and 6
299 * logs individually according to the underlying devices. (default: 6)
300 * Just in case, on-disk layout covers maximum 16 logs that consist of 8 for
301 * data and 8 for node logs.
302 */
303#define NR_CURSEG_DATA_TYPE (3)
304#define NR_CURSEG_NODE_TYPE (3)
305#define NR_CURSEG_TYPE (NR_CURSEG_DATA_TYPE + NR_CURSEG_NODE_TYPE)
306
307enum {
308 CURSEG_HOT_DATA = 0, /* directory entry blocks */
309 CURSEG_WARM_DATA, /* data blocks */
310 CURSEG_COLD_DATA, /* multimedia or GCed data blocks */
311 CURSEG_HOT_NODE, /* direct node blocks of directory files */
312 CURSEG_WARM_NODE, /* direct node blocks of normal files */
313 CURSEG_COLD_NODE, /* indirect node blocks */
314 NO_CHECK_TYPE
315};
316
317struct f2fs_sm_info {
318 struct sit_info *sit_info; /* whole segment information */
319 struct free_segmap_info *free_info; /* free segment information */
320 struct dirty_seglist_info *dirty_info; /* dirty segment information */
321 struct curseg_info *curseg_array; /* active segment information */
322
323 struct list_head wblist_head; /* list of under-writeback pages */
324 spinlock_t wblist_lock; /* lock for checkpoint */
325
326 block_t seg0_blkaddr; /* block address of 0'th segment */
327 block_t main_blkaddr; /* start block address of main area */
328 block_t ssa_blkaddr; /* start block address of SSA area */
329
330 unsigned int segment_count; /* total # of segments */
331 unsigned int main_segments; /* # of segments in main area */
332 unsigned int reserved_segments; /* # of reserved segments */
333 unsigned int ovp_segments; /* # of overprovision segments */
81eb8d6e
JK
334
335 /* a threshold to reclaim prefree segments */
336 unsigned int rec_prefree_segments;
7fd9e544
JK
337
338 /* for small discard management */
339 struct list_head discard_list; /* 4KB discard list */
340 int nr_discards; /* # of discards in the list */
341 int max_discards; /* max. discards to be issued */
216fbd64
JK
342
343 unsigned int ipu_policy; /* in-place-update policy */
344 unsigned int min_ipu_util; /* in-place-update threshold */
39a53e0c
JK
345};
346
39a53e0c
JK
347/*
348 * For superblock
349 */
350/*
351 * COUNT_TYPE for monitoring
352 *
353 * f2fs monitors the number of several block types such as on-writeback,
354 * dirty dentry blocks, dirty node blocks, and dirty meta blocks.
355 */
356enum count_type {
357 F2FS_WRITEBACK,
358 F2FS_DIRTY_DENTS,
359 F2FS_DIRTY_NODES,
360 F2FS_DIRTY_META,
361 NR_COUNT_TYPE,
362};
363
39a53e0c
JK
364/*
365 * The below are the page types of bios used in submti_bio().
366 * The available types are:
367 * DATA User data pages. It operates as async mode.
368 * NODE Node pages. It operates as async mode.
369 * META FS metadata pages such as SIT, NAT, CP.
370 * NR_PAGE_TYPE The number of page types.
371 * META_FLUSH Make sure the previous pages are written
372 * with waiting the bio's completion
373 * ... Only can be used with META.
374 */
7d5e5109 375#define PAGE_TYPE_OF_BIO(type) ((type) > META ? META : (type))
39a53e0c
JK
376enum page_type {
377 DATA,
378 NODE,
379 META,
380 NR_PAGE_TYPE,
381 META_FLUSH,
382};
383
458e6197 384struct f2fs_io_info {
7e8f2308
GZ
385 enum page_type type; /* contains DATA/NODE/META/META_FLUSH */
386 int rw; /* contains R/RS/W/WS with REQ_META/REQ_PRIO */
458e6197
JK
387};
388
93dfe2ac 389#define is_read_io(rw) (((rw) & 1) == READ)
1ff7bd3b 390struct f2fs_bio_info {
458e6197 391 struct f2fs_sb_info *sbi; /* f2fs superblock */
1ff7bd3b
JK
392 struct bio *bio; /* bios to merge */
393 sector_t last_block_in_bio; /* last block number */
458e6197 394 struct f2fs_io_info fio; /* store buffered io info. */
1ff7bd3b
JK
395 struct mutex io_mutex; /* mutex for bio */
396};
397
39a53e0c
JK
398struct f2fs_sb_info {
399 struct super_block *sb; /* pointer to VFS super block */
5e176d54 400 struct proc_dir_entry *s_proc; /* proc entry */
39a53e0c
JK
401 struct buffer_head *raw_super_buf; /* buffer head of raw sb */
402 struct f2fs_super_block *raw_super; /* raw super block pointer */
403 int s_dirty; /* dirty flag for checkpoint */
404
405 /* for node-related operations */
406 struct f2fs_nm_info *nm_info; /* node manager */
407 struct inode *node_inode; /* cache node blocks */
408
409 /* for segment-related operations */
410 struct f2fs_sm_info *sm_info; /* segment manager */
1ff7bd3b
JK
411
412 /* for bio operations */
924b720b 413 struct f2fs_bio_info read_io; /* for read bios */
1ff7bd3b 414 struct f2fs_bio_info write_io[NR_PAGE_TYPE]; /* for write bios */
1b1f559f 415 struct completion *wait_io; /* for completion bios */
39a53e0c
JK
416
417 /* for checkpoint */
418 struct f2fs_checkpoint *ckpt; /* raw checkpoint pointer */
419 struct inode *meta_inode; /* cache meta blocks */
39936837 420 struct mutex cp_mutex; /* checkpoint procedure lock */
e479556b 421 struct rw_semaphore cp_rwsem; /* blocking FS operations */
39936837 422 struct mutex node_write; /* locking node writes */
39a53e0c 423 struct mutex writepages; /* mutex for writepages() */
aabe5136 424 bool por_doing; /* recovery is doing or not */
fb51b5ef 425 wait_queue_head_t cp_wait;
39a53e0c
JK
426
427 /* for orphan inode management */
428 struct list_head orphan_inode_list; /* orphan inode list */
17b692f6 429 spinlock_t orphan_inode_lock; /* for orphan inode list */
39a53e0c 430 unsigned int n_orphans; /* # of orphan inodes */
0d47c1ad 431 unsigned int max_orphans; /* max orphan inodes */
39a53e0c
JK
432
433 /* for directory inode management */
434 struct list_head dir_inode_list; /* dir inode list */
435 spinlock_t dir_inode_lock; /* for dir inode list lock */
39a53e0c
JK
436
437 /* basic file system units */
438 unsigned int log_sectors_per_block; /* log2 sectors per block */
439 unsigned int log_blocksize; /* log2 block size */
440 unsigned int blocksize; /* block size */
441 unsigned int root_ino_num; /* root inode number*/
442 unsigned int node_ino_num; /* node inode number*/
443 unsigned int meta_ino_num; /* meta inode number*/
444 unsigned int log_blocks_per_seg; /* log2 blocks per segment */
445 unsigned int blocks_per_seg; /* blocks per segment */
446 unsigned int segs_per_sec; /* segments per section */
447 unsigned int secs_per_zone; /* sections per zone */
448 unsigned int total_sections; /* total section count */
449 unsigned int total_node_count; /* total node block count */
450 unsigned int total_valid_node_count; /* valid node block count */
451 unsigned int total_valid_inode_count; /* valid inode count */
452 int active_logs; /* # of active logs */
ab9fa662 453 int dir_level; /* directory level */
39a53e0c
JK
454
455 block_t user_block_count; /* # of user blocks */
456 block_t total_valid_block_count; /* # of valid blocks */
457 block_t alloc_valid_block_count; /* # of allocated blocks */
458 block_t last_valid_block_count; /* for recovery */
459 u32 s_next_generation; /* for NFS support */
460 atomic_t nr_pages[NR_COUNT_TYPE]; /* # of pages, see count_type */
461
462 struct f2fs_mount_info mount_opt; /* mount options */
463
464 /* for cleaning operations */
465 struct mutex gc_mutex; /* mutex for GC */
466 struct f2fs_gc_kthread *gc_thread; /* GC thread */
5ec4e49f 467 unsigned int cur_victim_sec; /* current victim section num */
39a53e0c 468
b1c57c1c
JK
469 /* maximum # of trials to find a victim segment for SSR and GC */
470 unsigned int max_victim_search;
471
39a53e0c
JK
472 /*
473 * for stat information.
474 * one is for the LFS mode, and the other is for the SSR mode.
475 */
35b09d82 476#ifdef CONFIG_F2FS_STAT_FS
39a53e0c
JK
477 struct f2fs_stat_info *stat_info; /* FS status information */
478 unsigned int segment_count[2]; /* # of allocated segments */
479 unsigned int block_count[2]; /* # of allocated blocks */
39a53e0c 480 int total_hit_ext, read_hit_ext; /* extent cache hit ratio */
0dbdc2ae 481 int inline_inode; /* # of inline_data inodes */
39a53e0c 482 int bg_gc; /* background gc calls */
35b09d82
NJ
483 unsigned int n_dirty_dirs; /* # of dir inodes */
484#endif
485 unsigned int last_victim[2]; /* last victim segment # */
39a53e0c 486 spinlock_t stat_lock; /* lock for stat operations */
b59d0bae
NJ
487
488 /* For sysfs suppport */
489 struct kobject s_kobj;
490 struct completion s_kobj_unregister;
39a53e0c
JK
491};
492
493/*
494 * Inline functions
495 */
496static inline struct f2fs_inode_info *F2FS_I(struct inode *inode)
497{
498 return container_of(inode, struct f2fs_inode_info, vfs_inode);
499}
500
501static inline struct f2fs_sb_info *F2FS_SB(struct super_block *sb)
502{
503 return sb->s_fs_info;
504}
505
506static inline struct f2fs_super_block *F2FS_RAW_SUPER(struct f2fs_sb_info *sbi)
507{
508 return (struct f2fs_super_block *)(sbi->raw_super);
509}
510
511static inline struct f2fs_checkpoint *F2FS_CKPT(struct f2fs_sb_info *sbi)
512{
513 return (struct f2fs_checkpoint *)(sbi->ckpt);
514}
515
45590710
GZ
516static inline struct f2fs_node *F2FS_NODE(struct page *page)
517{
518 return (struct f2fs_node *)page_address(page);
519}
520
58bfaf44
JK
521static inline struct f2fs_inode *F2FS_INODE(struct page *page)
522{
523 return &((struct f2fs_node *)page_address(page))->i;
524}
525
39a53e0c
JK
526static inline struct f2fs_nm_info *NM_I(struct f2fs_sb_info *sbi)
527{
528 return (struct f2fs_nm_info *)(sbi->nm_info);
529}
530
531static inline struct f2fs_sm_info *SM_I(struct f2fs_sb_info *sbi)
532{
533 return (struct f2fs_sm_info *)(sbi->sm_info);
534}
535
536static inline struct sit_info *SIT_I(struct f2fs_sb_info *sbi)
537{
538 return (struct sit_info *)(SM_I(sbi)->sit_info);
539}
540
541static inline struct free_segmap_info *FREE_I(struct f2fs_sb_info *sbi)
542{
543 return (struct free_segmap_info *)(SM_I(sbi)->free_info);
544}
545
546static inline struct dirty_seglist_info *DIRTY_I(struct f2fs_sb_info *sbi)
547{
548 return (struct dirty_seglist_info *)(SM_I(sbi)->dirty_info);
549}
550
9df27d98
GZ
551static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
552{
553 return sbi->meta_inode->i_mapping;
554}
555
4ef51a8f
JK
556static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
557{
558 return sbi->node_inode->i_mapping;
559}
560
39a53e0c
JK
561static inline void F2FS_SET_SB_DIRT(struct f2fs_sb_info *sbi)
562{
563 sbi->s_dirty = 1;
564}
565
566static inline void F2FS_RESET_SB_DIRT(struct f2fs_sb_info *sbi)
567{
568 sbi->s_dirty = 0;
569}
570
d71b5564
JK
571static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
572{
573 return le64_to_cpu(cp->checkpoint_ver);
574}
575
25ca923b
JK
576static inline bool is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
577{
578 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
579 return ckpt_flags & f;
580}
581
582static inline void set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
583{
584 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
585 ckpt_flags |= f;
586 cp->ckpt_flags = cpu_to_le32(ckpt_flags);
587}
588
589static inline void clear_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
590{
591 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
592 ckpt_flags &= (~f);
593 cp->ckpt_flags = cpu_to_le32(ckpt_flags);
594}
595
e479556b 596static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
39936837 597{
e479556b 598 down_read(&sbi->cp_rwsem);
39936837
JK
599}
600
e479556b 601static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
39a53e0c 602{
e479556b 603 up_read(&sbi->cp_rwsem);
39a53e0c
JK
604}
605
e479556b 606static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
39a53e0c 607{
0daaad97 608 f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
39936837
JK
609}
610
e479556b 611static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
39936837 612{
e479556b 613 up_write(&sbi->cp_rwsem);
39a53e0c
JK
614}
615
616/*
617 * Check whether the given nid is within node id range.
618 */
064e0823 619static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
39a53e0c 620{
064e0823 621 WARN_ON((nid >= NM_I(sbi)->max_nid));
cfb271d4 622 if (unlikely(nid >= NM_I(sbi)->max_nid))
064e0823
NJ
623 return -EINVAL;
624 return 0;
39a53e0c
JK
625}
626
627#define F2FS_DEFAULT_ALLOCATED_BLOCKS 1
628
629/*
630 * Check whether the inode has blocks or not
631 */
632static inline int F2FS_HAS_BLOCKS(struct inode *inode)
633{
634 if (F2FS_I(inode)->i_xattr_nid)
6c311ec6 635 return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
39a53e0c 636 else
6c311ec6 637 return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
39a53e0c
JK
638}
639
640static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
641 struct inode *inode, blkcnt_t count)
642{
643 block_t valid_block_count;
644
645 spin_lock(&sbi->stat_lock);
646 valid_block_count =
647 sbi->total_valid_block_count + (block_t)count;
cfb271d4 648 if (unlikely(valid_block_count > sbi->user_block_count)) {
39a53e0c
JK
649 spin_unlock(&sbi->stat_lock);
650 return false;
651 }
652 inode->i_blocks += count;
653 sbi->total_valid_block_count = valid_block_count;
654 sbi->alloc_valid_block_count += (block_t)count;
655 spin_unlock(&sbi->stat_lock);
656 return true;
657}
658
da19b0dc 659static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
39a53e0c
JK
660 struct inode *inode,
661 blkcnt_t count)
662{
663 spin_lock(&sbi->stat_lock);
5d56b671
JK
664 f2fs_bug_on(sbi->total_valid_block_count < (block_t) count);
665 f2fs_bug_on(inode->i_blocks < count);
39a53e0c
JK
666 inode->i_blocks -= count;
667 sbi->total_valid_block_count -= (block_t)count;
668 spin_unlock(&sbi->stat_lock);
39a53e0c
JK
669}
670
671static inline void inc_page_count(struct f2fs_sb_info *sbi, int count_type)
672{
673 atomic_inc(&sbi->nr_pages[count_type]);
674 F2FS_SET_SB_DIRT(sbi);
675}
676
677static inline void inode_inc_dirty_dents(struct inode *inode)
678{
1fe54f9d 679 inc_page_count(F2FS_SB(inode->i_sb), F2FS_DIRTY_DENTS);
39a53e0c
JK
680 atomic_inc(&F2FS_I(inode)->dirty_dents);
681}
682
683static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
684{
685 atomic_dec(&sbi->nr_pages[count_type]);
686}
687
688static inline void inode_dec_dirty_dents(struct inode *inode)
689{
1fe54f9d
JK
690 if (!S_ISDIR(inode->i_mode))
691 return;
692
693 dec_page_count(F2FS_SB(inode->i_sb), F2FS_DIRTY_DENTS);
39a53e0c
JK
694 atomic_dec(&F2FS_I(inode)->dirty_dents);
695}
696
697static inline int get_pages(struct f2fs_sb_info *sbi, int count_type)
698{
699 return atomic_read(&sbi->nr_pages[count_type]);
700}
701
5ac206cf
NJ
702static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
703{
704 unsigned int pages_per_sec = sbi->segs_per_sec *
705 (1 << sbi->log_blocks_per_seg);
706 return ((get_pages(sbi, block_type) + pages_per_sec - 1)
707 >> sbi->log_blocks_per_seg) / sbi->segs_per_sec;
708}
709
39a53e0c
JK
710static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
711{
8b8343fa 712 return sbi->total_valid_block_count;
39a53e0c
JK
713}
714
715static inline unsigned long __bitmap_size(struct f2fs_sb_info *sbi, int flag)
716{
717 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
718
719 /* return NAT or SIT bitmap */
720 if (flag == NAT_BITMAP)
721 return le32_to_cpu(ckpt->nat_ver_bitmap_bytesize);
722 else if (flag == SIT_BITMAP)
723 return le32_to_cpu(ckpt->sit_ver_bitmap_bytesize);
724
725 return 0;
726}
727
728static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
729{
730 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
25ca923b
JK
731 int offset = (flag == NAT_BITMAP) ?
732 le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
39a53e0c
JK
733 return &ckpt->sit_nat_version_bitmap + offset;
734}
735
736static inline block_t __start_cp_addr(struct f2fs_sb_info *sbi)
737{
738 block_t start_addr;
739 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
d71b5564 740 unsigned long long ckpt_version = cur_cp_version(ckpt);
39a53e0c 741
25ca923b 742 start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
39a53e0c
JK
743
744 /*
745 * odd numbered checkpoint should at cp segment 0
746 * and even segent must be at cp segment 1
747 */
748 if (!(ckpt_version & 1))
749 start_addr += sbi->blocks_per_seg;
750
751 return start_addr;
752}
753
754static inline block_t __start_sum_addr(struct f2fs_sb_info *sbi)
755{
756 return le32_to_cpu(F2FS_CKPT(sbi)->cp_pack_start_sum);
757}
758
759static inline bool inc_valid_node_count(struct f2fs_sb_info *sbi,
ef86d709 760 struct inode *inode)
39a53e0c
JK
761{
762 block_t valid_block_count;
763 unsigned int valid_node_count;
764
765 spin_lock(&sbi->stat_lock);
766
ef86d709 767 valid_block_count = sbi->total_valid_block_count + 1;
cfb271d4 768 if (unlikely(valid_block_count > sbi->user_block_count)) {
39a53e0c
JK
769 spin_unlock(&sbi->stat_lock);
770 return false;
771 }
772
ef86d709 773 valid_node_count = sbi->total_valid_node_count + 1;
cfb271d4 774 if (unlikely(valid_node_count > sbi->total_node_count)) {
39a53e0c
JK
775 spin_unlock(&sbi->stat_lock);
776 return false;
777 }
778
779 if (inode)
ef86d709
GZ
780 inode->i_blocks++;
781
782 sbi->alloc_valid_block_count++;
783 sbi->total_valid_node_count++;
784 sbi->total_valid_block_count++;
39a53e0c
JK
785 spin_unlock(&sbi->stat_lock);
786
787 return true;
788}
789
790static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
ef86d709 791 struct inode *inode)
39a53e0c
JK
792{
793 spin_lock(&sbi->stat_lock);
794
ef86d709
GZ
795 f2fs_bug_on(!sbi->total_valid_block_count);
796 f2fs_bug_on(!sbi->total_valid_node_count);
797 f2fs_bug_on(!inode->i_blocks);
39a53e0c 798
ef86d709
GZ
799 inode->i_blocks--;
800 sbi->total_valid_node_count--;
801 sbi->total_valid_block_count--;
39a53e0c
JK
802
803 spin_unlock(&sbi->stat_lock);
804}
805
806static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
807{
8b8343fa 808 return sbi->total_valid_node_count;
39a53e0c
JK
809}
810
811static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
812{
813 spin_lock(&sbi->stat_lock);
5d56b671 814 f2fs_bug_on(sbi->total_valid_inode_count == sbi->total_node_count);
39a53e0c
JK
815 sbi->total_valid_inode_count++;
816 spin_unlock(&sbi->stat_lock);
817}
818
0e80220a 819static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
39a53e0c
JK
820{
821 spin_lock(&sbi->stat_lock);
5d56b671 822 f2fs_bug_on(!sbi->total_valid_inode_count);
39a53e0c
JK
823 sbi->total_valid_inode_count--;
824 spin_unlock(&sbi->stat_lock);
39a53e0c
JK
825}
826
827static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
828{
8b8343fa 829 return sbi->total_valid_inode_count;
39a53e0c
JK
830}
831
832static inline void f2fs_put_page(struct page *page, int unlock)
833{
031fa8cc 834 if (!page)
39a53e0c
JK
835 return;
836
837 if (unlock) {
5d56b671 838 f2fs_bug_on(!PageLocked(page));
39a53e0c
JK
839 unlock_page(page);
840 }
841 page_cache_release(page);
842}
843
844static inline void f2fs_put_dnode(struct dnode_of_data *dn)
845{
846 if (dn->node_page)
847 f2fs_put_page(dn->node_page, 1);
848 if (dn->inode_page && dn->node_page != dn->inode_page)
849 f2fs_put_page(dn->inode_page, 0);
850 dn->node_page = NULL;
851 dn->inode_page = NULL;
852}
853
854static inline struct kmem_cache *f2fs_kmem_cache_create(const char *name,
e8512d2e 855 size_t size)
39a53e0c 856{
e8512d2e 857 return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
39a53e0c
JK
858}
859
7bd59381
GZ
860static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
861 gfp_t flags)
862{
863 void *entry;
864retry:
865 entry = kmem_cache_alloc(cachep, flags);
866 if (!entry) {
867 cond_resched();
868 goto retry;
869 }
870
871 return entry;
872}
873
39a53e0c
JK
874#define RAW_IS_INODE(p) ((p)->footer.nid == (p)->footer.ino)
875
876static inline bool IS_INODE(struct page *page)
877{
45590710 878 struct f2fs_node *p = F2FS_NODE(page);
39a53e0c
JK
879 return RAW_IS_INODE(p);
880}
881
882static inline __le32 *blkaddr_in_node(struct f2fs_node *node)
883{
884 return RAW_IS_INODE(node) ? node->i.i_addr : node->dn.addr;
885}
886
887static inline block_t datablock_addr(struct page *node_page,
888 unsigned int offset)
889{
890 struct f2fs_node *raw_node;
891 __le32 *addr_array;
45590710 892 raw_node = F2FS_NODE(node_page);
39a53e0c
JK
893 addr_array = blkaddr_in_node(raw_node);
894 return le32_to_cpu(addr_array[offset]);
895}
896
897static inline int f2fs_test_bit(unsigned int nr, char *addr)
898{
899 int mask;
900
901 addr += (nr >> 3);
902 mask = 1 << (7 - (nr & 0x07));
903 return mask & *addr;
904}
905
906static inline int f2fs_set_bit(unsigned int nr, char *addr)
907{
908 int mask;
909 int ret;
910
911 addr += (nr >> 3);
912 mask = 1 << (7 - (nr & 0x07));
913 ret = mask & *addr;
914 *addr |= mask;
915 return ret;
916}
917
918static inline int f2fs_clear_bit(unsigned int nr, char *addr)
919{
920 int mask;
921 int ret;
922
923 addr += (nr >> 3);
924 mask = 1 << (7 - (nr & 0x07));
925 ret = mask & *addr;
926 *addr &= ~mask;
927 return ret;
928}
929
930/* used for f2fs_inode_info->flags */
931enum {
932 FI_NEW_INODE, /* indicate newly allocated inode */
b3783873 933 FI_DIRTY_INODE, /* indicate inode is dirty or not */
39a53e0c
JK
934 FI_INC_LINK, /* need to increment i_nlink */
935 FI_ACL_MODE, /* indicate acl mode */
936 FI_NO_ALLOC, /* should not allocate any blocks */
699489bb 937 FI_UPDATE_DIR, /* should update inode block for consistency */
74d0b917 938 FI_DELAY_IPUT, /* used for the recovery */
c11abd1a 939 FI_NO_EXTENT, /* not to use the extent cache */
444c580f 940 FI_INLINE_XATTR, /* used for inline xattr */
1001b347 941 FI_INLINE_DATA, /* used for inline data*/
39a53e0c
JK
942};
943
944static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
945{
946 set_bit(flag, &fi->flags);
947}
948
949static inline int is_inode_flag_set(struct f2fs_inode_info *fi, int flag)
950{
951 return test_bit(flag, &fi->flags);
952}
953
954static inline void clear_inode_flag(struct f2fs_inode_info *fi, int flag)
955{
956 clear_bit(flag, &fi->flags);
957}
958
959static inline void set_acl_inode(struct f2fs_inode_info *fi, umode_t mode)
960{
961 fi->i_acl_mode = mode;
962 set_inode_flag(fi, FI_ACL_MODE);
963}
964
965static inline int cond_clear_inode_flag(struct f2fs_inode_info *fi, int flag)
966{
967 if (is_inode_flag_set(fi, FI_ACL_MODE)) {
968 clear_inode_flag(fi, FI_ACL_MODE);
969 return 1;
970 }
971 return 0;
972}
973
444c580f
JK
974static inline void get_inline_info(struct f2fs_inode_info *fi,
975 struct f2fs_inode *ri)
976{
977 if (ri->i_inline & F2FS_INLINE_XATTR)
978 set_inode_flag(fi, FI_INLINE_XATTR);
1001b347
HL
979 if (ri->i_inline & F2FS_INLINE_DATA)
980 set_inode_flag(fi, FI_INLINE_DATA);
444c580f
JK
981}
982
983static inline void set_raw_inline(struct f2fs_inode_info *fi,
984 struct f2fs_inode *ri)
985{
986 ri->i_inline = 0;
987
988 if (is_inode_flag_set(fi, FI_INLINE_XATTR))
989 ri->i_inline |= F2FS_INLINE_XATTR;
1001b347
HL
990 if (is_inode_flag_set(fi, FI_INLINE_DATA))
991 ri->i_inline |= F2FS_INLINE_DATA;
444c580f
JK
992}
993
de93653f
JK
994static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
995{
996 if (is_inode_flag_set(fi, FI_INLINE_XATTR))
997 return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
998 return DEF_ADDRS_PER_INODE;
999}
1000
65985d93
JK
1001static inline void *inline_xattr_addr(struct page *page)
1002{
695fd1ed 1003 struct f2fs_inode *ri = F2FS_INODE(page);
65985d93
JK
1004 return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
1005 F2FS_INLINE_XATTR_ADDRS]);
1006}
1007
1008static inline int inline_xattr_size(struct inode *inode)
1009{
1010 if (is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR))
1011 return F2FS_INLINE_XATTR_ADDRS << 2;
1012 else
1013 return 0;
1014}
1015
0dbdc2ae
JK
1016static inline int f2fs_has_inline_data(struct inode *inode)
1017{
1018 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
1019}
1020
1001b347
HL
1021static inline void *inline_data_addr(struct page *page)
1022{
695fd1ed 1023 struct f2fs_inode *ri = F2FS_INODE(page);
1001b347
HL
1024 return (void *)&(ri->i_addr[1]);
1025}
1026
77888c1e
JK
1027static inline int f2fs_readonly(struct super_block *sb)
1028{
1029 return sb->s_flags & MS_RDONLY;
1030}
1031
744602cf
JK
1032static inline void f2fs_stop_checkpoint(struct f2fs_sb_info *sbi)
1033{
1034 set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
1035 sbi->sb->s_flags |= MS_RDONLY;
1036}
1037
a6dda0e6
CH
1038#define get_inode_mode(i) \
1039 ((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
1040 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))
1041
39a53e0c
JK
1042/*
1043 * file.c
1044 */
1045int f2fs_sync_file(struct file *, loff_t, loff_t, int);
1046void truncate_data_blocks(struct dnode_of_data *);
1e1bb4ba 1047int truncate_blocks(struct inode *, u64);
39a53e0c 1048void f2fs_truncate(struct inode *);
2d4d9fb5 1049int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
39a53e0c
JK
1050int f2fs_setattr(struct dentry *, struct iattr *);
1051int truncate_hole(struct inode *, pgoff_t, pgoff_t);
b292dcab 1052int truncate_data_blocks_range(struct dnode_of_data *, int);
39a53e0c 1053long f2fs_ioctl(struct file *, unsigned int, unsigned long);
e9750824 1054long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
39a53e0c
JK
1055
1056/*
1057 * inode.c
1058 */
1059void f2fs_set_inode_flags(struct inode *);
39a53e0c 1060struct inode *f2fs_iget(struct super_block *, unsigned long);
4660f9c0 1061int try_to_free_nats(struct f2fs_sb_info *, int);
39a53e0c 1062void update_inode(struct inode *, struct page *);
744602cf 1063void update_inode_page(struct inode *);
39a53e0c
JK
1064int f2fs_write_inode(struct inode *, struct writeback_control *);
1065void f2fs_evict_inode(struct inode *);
1066
1067/*
1068 * namei.c
1069 */
1070struct dentry *f2fs_get_parent(struct dentry *child);
1071
1072/*
1073 * dir.c
1074 */
1075struct f2fs_dir_entry *f2fs_find_entry(struct inode *, struct qstr *,
1076 struct page **);
1077struct f2fs_dir_entry *f2fs_parent_dir(struct inode *, struct page **);
1078ino_t f2fs_inode_by_name(struct inode *, struct qstr *);
1079void f2fs_set_link(struct inode *, struct f2fs_dir_entry *,
1080 struct page *, struct inode *);
1cd14caf 1081int update_dent_inode(struct inode *, const struct qstr *);
b7f7a5e0 1082int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *);
39a53e0c
JK
1083void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *);
1084int f2fs_make_empty(struct inode *, struct inode *);
1085bool f2fs_empty_dir(struct inode *);
1086
b7f7a5e0
AV
1087static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
1088{
1089 return __f2fs_add_link(dentry->d_parent->d_inode, &dentry->d_name,
1090 inode);
1091}
1092
39a53e0c
JK
1093/*
1094 * super.c
1095 */
1096int f2fs_sync_fs(struct super_block *, int);
a07ef784
NJ
1097extern __printf(3, 4)
1098void f2fs_msg(struct super_block *, const char *, const char *, ...);
39a53e0c
JK
1099
1100/*
1101 * hash.c
1102 */
9836b8b9 1103f2fs_hash_t f2fs_dentry_hash(const char *, size_t);
39a53e0c
JK
1104
1105/*
1106 * node.c
1107 */
1108struct dnode_of_data;
1109struct node_info;
1110
1111int is_checkpointed_node(struct f2fs_sb_info *, nid_t);
1112void get_node_info(struct f2fs_sb_info *, nid_t, struct node_info *);
1113int get_dnode_of_data(struct dnode_of_data *, pgoff_t, int);
1114int truncate_inode_blocks(struct inode *, pgoff_t);
4f16fb0f 1115int truncate_xattr_node(struct inode *, struct page *);
cfe58f9d 1116int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
58e674d6 1117void remove_inode_page(struct inode *);
44a83ff6 1118struct page *new_inode_page(struct inode *, const struct qstr *);
8ae8f162 1119struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
39a53e0c
JK
1120void ra_node_page(struct f2fs_sb_info *, nid_t);
1121struct page *get_node_page(struct f2fs_sb_info *, pgoff_t);
1122struct page *get_node_page_ra(struct page *, int);
1123void sync_inode_page(struct dnode_of_data *);
1124int sync_node_pages(struct f2fs_sb_info *, nid_t, struct writeback_control *);
1125bool alloc_nid(struct f2fs_sb_info *, nid_t *);
1126void alloc_nid_done(struct f2fs_sb_info *, nid_t);
1127void alloc_nid_failed(struct f2fs_sb_info *, nid_t);
1128void recover_node_page(struct f2fs_sb_info *, struct page *,
1129 struct f2fs_summary *, struct node_info *, block_t);
abb2366c 1130bool recover_xattr_data(struct inode *, struct page *, block_t);
39a53e0c
JK
1131int recover_inode_page(struct f2fs_sb_info *, struct page *);
1132int restore_node_summary(struct f2fs_sb_info *, unsigned int,
1133 struct f2fs_summary_block *);
1134void flush_nat_entries(struct f2fs_sb_info *);
1135int build_node_manager(struct f2fs_sb_info *);
1136void destroy_node_manager(struct f2fs_sb_info *);
6e6093a8 1137int __init create_node_manager_caches(void);
39a53e0c
JK
1138void destroy_node_manager_caches(void);
1139
1140/*
1141 * segment.c
1142 */
1143void f2fs_balance_fs(struct f2fs_sb_info *);
4660f9c0 1144void f2fs_balance_fs_bg(struct f2fs_sb_info *);
39a53e0c 1145void invalidate_blocks(struct f2fs_sb_info *, block_t);
5e443818 1146void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
39a53e0c
JK
1147void clear_prefree_segments(struct f2fs_sb_info *);
1148int npages_for_summary_flush(struct f2fs_sb_info *);
1149void allocate_new_segments(struct f2fs_sb_info *);
1150struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
577e3495 1151void write_meta_page(struct f2fs_sb_info *, struct page *);
fb5566da
JK
1152void write_node_page(struct f2fs_sb_info *, struct page *,
1153 struct f2fs_io_info *, unsigned int, block_t, block_t *);
458e6197
JK
1154void write_data_page(struct page *, struct dnode_of_data *, block_t *,
1155 struct f2fs_io_info *);
1156void rewrite_data_page(struct page *, block_t, struct f2fs_io_info *);
39a53e0c
JK
1157void recover_data_page(struct f2fs_sb_info *, struct page *,
1158 struct f2fs_summary *, block_t, block_t);
1159void rewrite_node_page(struct f2fs_sb_info *, struct page *,
1160 struct f2fs_summary *, block_t, block_t);
bfad7c2d
JK
1161void allocate_data_block(struct f2fs_sb_info *, struct page *,
1162 block_t, block_t *, struct f2fs_summary *, int);
5514f0aa 1163void f2fs_wait_on_page_writeback(struct page *, enum page_type);
39a53e0c
JK
1164void write_data_summaries(struct f2fs_sb_info *, block_t);
1165void write_node_summaries(struct f2fs_sb_info *, block_t);
1166int lookup_journal_in_cursum(struct f2fs_summary_block *,
1167 int, unsigned int, int);
1168void flush_sit_entries(struct f2fs_sb_info *);
1169int build_segment_manager(struct f2fs_sb_info *);
39a53e0c 1170void destroy_segment_manager(struct f2fs_sb_info *);
7fd9e544
JK
1171int __init create_segment_manager_caches(void);
1172void destroy_segment_manager_caches(void);
39a53e0c
JK
1173
1174/*
1175 * checkpoint.c
1176 */
1177struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
1178struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
662befda 1179int ra_meta_pages(struct f2fs_sb_info *, int, int, int);
39a53e0c 1180long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
cbd56e7d
JK
1181int acquire_orphan_inode(struct f2fs_sb_info *);
1182void release_orphan_inode(struct f2fs_sb_info *);
39a53e0c
JK
1183void add_orphan_inode(struct f2fs_sb_info *, nid_t);
1184void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
8f99a946 1185void recover_orphan_inodes(struct f2fs_sb_info *);
39a53e0c
JK
1186int get_valid_checkpoint(struct f2fs_sb_info *);
1187void set_dirty_dir_page(struct inode *, struct page *);
5deb8267 1188void add_dirty_dir_inode(struct inode *);
39a53e0c 1189void remove_dirty_dir_inode(struct inode *);
74d0b917 1190struct inode *check_dirty_dir_inode(struct f2fs_sb_info *, nid_t);
39a53e0c 1191void sync_dirty_dir_inodes(struct f2fs_sb_info *);
43727527 1192void write_checkpoint(struct f2fs_sb_info *, bool);
39a53e0c 1193void init_orphan_info(struct f2fs_sb_info *);
6e6093a8 1194int __init create_checkpoint_caches(void);
39a53e0c
JK
1195void destroy_checkpoint_caches(void);
1196
1197/*
1198 * data.c
1199 */
458e6197 1200void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
93dfe2ac
JK
1201int f2fs_submit_page_bio(struct f2fs_sb_info *, struct page *, block_t, int);
1202void f2fs_submit_page_mbio(struct f2fs_sb_info *, struct page *, block_t,
458e6197 1203 struct f2fs_io_info *);
39a53e0c 1204int reserve_new_block(struct dnode_of_data *);
b600965c 1205int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
39a53e0c 1206void update_extent_cache(block_t, struct dnode_of_data *);
c718379b 1207struct page *find_data_page(struct inode *, pgoff_t, bool);
39a53e0c 1208struct page *get_lock_data_page(struct inode *, pgoff_t);
64aa7ed9 1209struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
458e6197 1210int do_write_data_page(struct page *, struct f2fs_io_info *);
39a53e0c
JK
1211
1212/*
1213 * gc.c
1214 */
1215int start_gc_thread(struct f2fs_sb_info *);
1216void stop_gc_thread(struct f2fs_sb_info *);
de93653f 1217block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
408e9375 1218int f2fs_gc(struct f2fs_sb_info *);
39a53e0c 1219void build_gc_manager(struct f2fs_sb_info *);
6e6093a8 1220int __init create_gc_caches(void);
39a53e0c
JK
1221void destroy_gc_caches(void);
1222
1223/*
1224 * recovery.c
1225 */
6ead1142 1226int recover_fsync_data(struct f2fs_sb_info *);
39a53e0c
JK
1227bool space_for_roll_forward(struct f2fs_sb_info *);
1228
1229/*
1230 * debug.c
1231 */
1232#ifdef CONFIG_F2FS_STAT_FS
1233struct f2fs_stat_info {
1234 struct list_head stat_list;
1235 struct f2fs_sb_info *sbi;
1236 struct mutex stat_lock;
1237 int all_area_segs, sit_area_segs, nat_area_segs, ssa_area_segs;
1238 int main_area_segs, main_area_sections, main_area_zones;
1239 int hit_ext, total_ext;
1240 int ndirty_node, ndirty_dent, ndirty_dirs, ndirty_meta;
1241 int nats, sits, fnids;
1242 int total_count, utilization;
0dbdc2ae 1243 int bg_gc, inline_inode;
39a53e0c
JK
1244 unsigned int valid_count, valid_node_count, valid_inode_count;
1245 unsigned int bimodal, avg_vblocks;
1246 int util_free, util_valid, util_invalid;
1247 int rsvd_segs, overp_segs;
1248 int dirty_count, node_pages, meta_pages;
942e0be6 1249 int prefree_count, call_count, cp_count;
39a53e0c
JK
1250 int tot_segs, node_segs, data_segs, free_segs, free_secs;
1251 int tot_blks, data_blks, node_blks;
1252 int curseg[NR_CURSEG_TYPE];
1253 int cursec[NR_CURSEG_TYPE];
1254 int curzone[NR_CURSEG_TYPE];
1255
1256 unsigned int segment_count[2];
1257 unsigned int block_count[2];
1258 unsigned base_mem, cache_mem;
1259};
1260
963d4f7d
GZ
1261static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
1262{
6c311ec6 1263 return (struct f2fs_stat_info *)sbi->stat_info;
963d4f7d
GZ
1264}
1265
942e0be6 1266#define stat_inc_cp_count(si) ((si)->cp_count++)
dcdfff65
JK
1267#define stat_inc_call_count(si) ((si)->call_count++)
1268#define stat_inc_bggc_count(sbi) ((sbi)->bg_gc++)
1269#define stat_inc_dirty_dir(sbi) ((sbi)->n_dirty_dirs++)
1270#define stat_dec_dirty_dir(sbi) ((sbi)->n_dirty_dirs--)
1271#define stat_inc_total_hit(sb) ((F2FS_SB(sb))->total_hit_ext++)
1272#define stat_inc_read_hit(sb) ((F2FS_SB(sb))->read_hit_ext++)
0dbdc2ae
JK
1273#define stat_inc_inline_inode(inode) \
1274 do { \
1275 if (f2fs_has_inline_data(inode)) \
1276 ((F2FS_SB(inode->i_sb))->inline_inode++); \
1277 } while (0)
1278#define stat_dec_inline_inode(inode) \
1279 do { \
1280 if (f2fs_has_inline_data(inode)) \
1281 ((F2FS_SB(inode->i_sb))->inline_inode--); \
1282 } while (0)
1283
dcdfff65
JK
1284#define stat_inc_seg_type(sbi, curseg) \
1285 ((sbi)->segment_count[(curseg)->alloc_type]++)
1286#define stat_inc_block_count(sbi, curseg) \
1287 ((sbi)->block_count[(curseg)->alloc_type]++)
39a53e0c
JK
1288
1289#define stat_inc_seg_count(sbi, type) \
1290 do { \
963d4f7d 1291 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c
JK
1292 (si)->tot_segs++; \
1293 if (type == SUM_TYPE_DATA) \
1294 si->data_segs++; \
1295 else \
1296 si->node_segs++; \
1297 } while (0)
1298
1299#define stat_inc_tot_blk_count(si, blks) \
1300 (si->tot_blks += (blks))
1301
1302#define stat_inc_data_blk_count(sbi, blks) \
1303 do { \
963d4f7d 1304 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c
JK
1305 stat_inc_tot_blk_count(si, blks); \
1306 si->data_blks += (blks); \
1307 } while (0)
1308
1309#define stat_inc_node_blk_count(sbi, blks) \
1310 do { \
963d4f7d 1311 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c
JK
1312 stat_inc_tot_blk_count(si, blks); \
1313 si->node_blks += (blks); \
1314 } while (0)
1315
1316int f2fs_build_stats(struct f2fs_sb_info *);
1317void f2fs_destroy_stats(struct f2fs_sb_info *);
6e6093a8 1318void __init f2fs_create_root_stats(void);
4589d25d 1319void f2fs_destroy_root_stats(void);
39a53e0c 1320#else
942e0be6 1321#define stat_inc_cp_count(si)
39a53e0c 1322#define stat_inc_call_count(si)
dcdfff65
JK
1323#define stat_inc_bggc_count(si)
1324#define stat_inc_dirty_dir(sbi)
1325#define stat_dec_dirty_dir(sbi)
1326#define stat_inc_total_hit(sb)
1327#define stat_inc_read_hit(sb)
0dbdc2ae
JK
1328#define stat_inc_inline_inode(inode)
1329#define stat_dec_inline_inode(inode)
dcdfff65
JK
1330#define stat_inc_seg_type(sbi, curseg)
1331#define stat_inc_block_count(sbi, curseg)
39a53e0c
JK
1332#define stat_inc_seg_count(si, type)
1333#define stat_inc_tot_blk_count(si, blks)
1334#define stat_inc_data_blk_count(si, blks)
1335#define stat_inc_node_blk_count(sbi, blks)
1336
1337static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
1338static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
6e6093a8 1339static inline void __init f2fs_create_root_stats(void) { }
4589d25d 1340static inline void f2fs_destroy_root_stats(void) { }
39a53e0c
JK
1341#endif
1342
1343extern const struct file_operations f2fs_dir_operations;
1344extern const struct file_operations f2fs_file_operations;
1345extern const struct inode_operations f2fs_file_inode_operations;
1346extern const struct address_space_operations f2fs_dblock_aops;
1347extern const struct address_space_operations f2fs_node_aops;
1348extern const struct address_space_operations f2fs_meta_aops;
1349extern const struct inode_operations f2fs_dir_inode_operations;
1350extern const struct inode_operations f2fs_symlink_inode_operations;
1351extern const struct inode_operations f2fs_special_inode_operations;
1001b347 1352
e18c65b2
HL
1353/*
1354 * inline.c
1355 */
e18c65b2
HL
1356bool f2fs_may_inline(struct inode *);
1357int f2fs_read_inline_data(struct inode *, struct page *);
9e09fc85 1358int f2fs_convert_inline_data(struct inode *, pgoff_t);
e18c65b2 1359int f2fs_write_inline_data(struct inode *, struct page *, unsigned int);
1e1bb4ba 1360int recover_inline_data(struct inode *, struct page *);
39a53e0c 1361#endif