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