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