]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - fs/f2fs/f2fs.h
f2fs: record dirty status of regular/symlink inode
[mirror_ubuntu-bionic-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>
39307a8e 22#include <linux/vmalloc.h>
740432f8 23#include <linux/bio.h>
39a53e0c 24
5d56b671 25#ifdef CONFIG_F2FS_CHECK_FS
9850cf4a 26#define f2fs_bug_on(sbi, condition) BUG_ON(condition)
0daaad97 27#define f2fs_down_write(x, y) down_write_nest_lock(x, y)
5d56b671 28#else
9850cf4a
JK
29#define f2fs_bug_on(sbi, condition) \
30 do { \
31 if (unlikely(condition)) { \
32 WARN_ON(1); \
caf0047e 33 set_sbi_flag(sbi, SBI_NEED_FSCK); \
9850cf4a
JK
34 } \
35 } while (0)
0daaad97 36#define f2fs_down_write(x, y) down_write(x)
5d56b671
JK
37#endif
38
39a53e0c
JK
39/*
40 * For mount options
41 */
42#define F2FS_MOUNT_BG_GC 0x00000001
43#define F2FS_MOUNT_DISABLE_ROLL_FORWARD 0x00000002
44#define F2FS_MOUNT_DISCARD 0x00000004
45#define F2FS_MOUNT_NOHEAP 0x00000008
46#define F2FS_MOUNT_XATTR_USER 0x00000010
47#define F2FS_MOUNT_POSIX_ACL 0x00000020
48#define F2FS_MOUNT_DISABLE_EXT_IDENTIFY 0x00000040
444c580f 49#define F2FS_MOUNT_INLINE_XATTR 0x00000080
1001b347 50#define F2FS_MOUNT_INLINE_DATA 0x00000100
34d67deb
CY
51#define F2FS_MOUNT_INLINE_DENTRY 0x00000200
52#define F2FS_MOUNT_FLUSH_MERGE 0x00000400
53#define F2FS_MOUNT_NOBARRIER 0x00000800
d5053a34 54#define F2FS_MOUNT_FASTBOOT 0x00001000
89672159 55#define F2FS_MOUNT_EXTENT_CACHE 0x00002000
6aefd93b 56#define F2FS_MOUNT_FORCE_FG_GC 0x00004000
39a53e0c
JK
57
58#define clear_opt(sbi, option) (sbi->mount_opt.opt &= ~F2FS_MOUNT_##option)
59#define set_opt(sbi, option) (sbi->mount_opt.opt |= F2FS_MOUNT_##option)
60#define test_opt(sbi, option) (sbi->mount_opt.opt & F2FS_MOUNT_##option)
61
62#define ver_after(a, b) (typecheck(unsigned long long, a) && \
63 typecheck(unsigned long long, b) && \
64 ((long long)((a) - (b)) > 0))
65
a9841c4d
JK
66typedef u32 block_t; /*
67 * should not change u32, since it is the on-disk block
68 * address format, __le32.
69 */
39a53e0c
JK
70typedef u32 nid_t;
71
72struct f2fs_mount_info {
73 unsigned int opt;
74};
75
cde4de12
JK
76#define F2FS_FEATURE_ENCRYPT 0x0001
77
76f105a2
JK
78#define F2FS_HAS_FEATURE(sb, mask) \
79 ((F2FS_SB(sb)->raw_super->feature & cpu_to_le32(mask)) != 0)
80#define F2FS_SET_FEATURE(sb, mask) \
81 F2FS_SB(sb)->raw_super->feature |= cpu_to_le32(mask)
82#define F2FS_CLEAR_FEATURE(sb, mask) \
83 F2FS_SB(sb)->raw_super->feature &= ~cpu_to_le32(mask)
84
7e586fa0
JK
85#define CRCPOLY_LE 0xedb88320
86
87static inline __u32 f2fs_crc32(void *buf, size_t len)
39a53e0c 88{
7e586fa0
JK
89 unsigned char *p = (unsigned char *)buf;
90 __u32 crc = F2FS_SUPER_MAGIC;
91 int i;
92
93 while (len--) {
94 crc ^= *p++;
95 for (i = 0; i < 8; i++)
96 crc = (crc >> 1) ^ ((crc & 1) ? CRCPOLY_LE : 0);
97 }
98 return crc;
39a53e0c
JK
99}
100
7e586fa0 101static inline bool f2fs_crc_valid(__u32 blk_crc, void *buf, size_t buf_size)
39a53e0c 102{
7e586fa0 103 return f2fs_crc32(buf, buf_size) == blk_crc;
39a53e0c
JK
104}
105
106/*
107 * For checkpoint manager
108 */
109enum {
110 NAT_BITMAP,
111 SIT_BITMAP
112};
113
75ab4cb8
JK
114enum {
115 CP_UMOUNT,
119ee914 116 CP_FASTBOOT,
75ab4cb8 117 CP_SYNC,
10027551 118 CP_RECOVERY,
4b2fecc8 119 CP_DISCARD,
75ab4cb8
JK
120};
121
bba681cb
JK
122#define DEF_BATCHED_TRIM_SECTIONS 32
123#define BATCHED_TRIM_SEGMENTS(sbi) \
124 (SM_I(sbi)->trim_sections * (sbi)->segs_per_sec)
a66cdd98
JK
125#define BATCHED_TRIM_BLOCKS(sbi) \
126 (BATCHED_TRIM_SEGMENTS(sbi) << (sbi)->log_blocks_per_seg)
60b99b48 127#define DEF_CP_INTERVAL 60 /* 60 secs */
bba681cb 128
75ab4cb8
JK
129struct cp_control {
130 int reason;
4b2fecc8
JK
131 __u64 trim_start;
132 __u64 trim_end;
133 __u64 trim_minlen;
134 __u64 trimmed;
75ab4cb8
JK
135};
136
662befda 137/*
81c1a0f1 138 * For CP/NAT/SIT/SSA readahead
662befda
CY
139 */
140enum {
141 META_CP,
142 META_NAT,
81c1a0f1 143 META_SIT,
4c521f49
JK
144 META_SSA,
145 META_POR,
662befda
CY
146};
147
6451e041
JK
148/* for the list of ino */
149enum {
150 ORPHAN_INO, /* for orphan ino list */
fff04f90
JK
151 APPEND_INO, /* for append ino list */
152 UPDATE_INO, /* for update ino list */
6451e041
JK
153 MAX_INO_ENTRY, /* max. list */
154};
155
156struct ino_entry {
39a53e0c
JK
157 struct list_head list; /* list head */
158 nid_t ino; /* inode number */
159};
160
2710fd7e 161/* for the list of inodes to be GCed */
06292073 162struct inode_entry {
39a53e0c
JK
163 struct list_head list; /* list head */
164 struct inode *inode; /* vfs inode pointer */
165};
166
7fd9e544
JK
167/* for the list of blockaddresses to be discarded */
168struct discard_entry {
169 struct list_head list; /* list head */
170 block_t blkaddr; /* block address to be discarded */
171 int len; /* # of consecutive blocks of the discard */
172};
173
39a53e0c
JK
174/* for the list of fsync inodes, used only during recovery */
175struct fsync_inode_entry {
176 struct list_head list; /* list head */
177 struct inode *inode; /* vfs inode pointer */
c52e1b10
JK
178 block_t blkaddr; /* block address locating the last fsync */
179 block_t last_dentry; /* block address locating the last dentry */
180 block_t last_inode; /* block address locating the last inode */
39a53e0c
JK
181};
182
183#define nats_in_cursum(sum) (le16_to_cpu(sum->n_nats))
184#define sits_in_cursum(sum) (le16_to_cpu(sum->n_sits))
185
186#define nat_in_journal(sum, i) (sum->nat_j.entries[i].ne)
187#define nid_in_journal(sum, i) (sum->nat_j.entries[i].nid)
188#define sit_in_journal(sum, i) (sum->sit_j.entries[i].se)
189#define segno_in_journal(sum, i) (sum->sit_j.entries[i].segno)
190
309cc2b6
JK
191#define MAX_NAT_JENTRIES(sum) (NAT_JOURNAL_ENTRIES - nats_in_cursum(sum))
192#define MAX_SIT_JENTRIES(sum) (SIT_JOURNAL_ENTRIES - sits_in_cursum(sum))
193
39a53e0c
JK
194static inline int update_nats_in_cursum(struct f2fs_summary_block *rs, int i)
195{
196 int before = nats_in_cursum(rs);
197 rs->n_nats = cpu_to_le16(before + i);
198 return before;
199}
200
201static inline int update_sits_in_cursum(struct f2fs_summary_block *rs, int i)
202{
203 int before = sits_in_cursum(rs);
204 rs->n_sits = cpu_to_le16(before + i);
205 return before;
206}
207
184a5cd2
CY
208static inline bool __has_cursum_space(struct f2fs_summary_block *sum, int size,
209 int type)
210{
211 if (type == NAT_JOURNAL)
309cc2b6
JK
212 return size <= MAX_NAT_JENTRIES(sum);
213 return size <= MAX_SIT_JENTRIES(sum);
184a5cd2
CY
214}
215
e9750824
NJ
216/*
217 * ioctl commands
218 */
88b88a66
JK
219#define F2FS_IOC_GETFLAGS FS_IOC_GETFLAGS
220#define F2FS_IOC_SETFLAGS FS_IOC_SETFLAGS
d49f3e89 221#define F2FS_IOC_GETVERSION FS_IOC_GETVERSION
88b88a66
JK
222
223#define F2FS_IOCTL_MAGIC 0xf5
224#define F2FS_IOC_START_ATOMIC_WRITE _IO(F2FS_IOCTL_MAGIC, 1)
225#define F2FS_IOC_COMMIT_ATOMIC_WRITE _IO(F2FS_IOCTL_MAGIC, 2)
02a1335f 226#define F2FS_IOC_START_VOLATILE_WRITE _IO(F2FS_IOCTL_MAGIC, 3)
1e84371f
JK
227#define F2FS_IOC_RELEASE_VOLATILE_WRITE _IO(F2FS_IOCTL_MAGIC, 4)
228#define F2FS_IOC_ABORT_VOLATILE_WRITE _IO(F2FS_IOCTL_MAGIC, 5)
c1c1b583 229#define F2FS_IOC_GARBAGE_COLLECT _IO(F2FS_IOCTL_MAGIC, 6)
456b88e4 230#define F2FS_IOC_WRITE_CHECKPOINT _IO(F2FS_IOCTL_MAGIC, 7)
d323d005 231#define F2FS_IOC_DEFRAGMENT _IO(F2FS_IOCTL_MAGIC, 8)
e9750824 232
f424f664
JK
233#define F2FS_IOC_SET_ENCRYPTION_POLICY \
234 _IOR('f', 19, struct f2fs_encryption_policy)
235#define F2FS_IOC_GET_ENCRYPTION_PWSALT \
236 _IOW('f', 20, __u8[16])
237#define F2FS_IOC_GET_ENCRYPTION_POLICY \
238 _IOW('f', 21, struct f2fs_encryption_policy)
239
1abff93d
JK
240/*
241 * should be same as XFS_IOC_GOINGDOWN.
242 * Flags for going down operation used by FS_IOC_GOINGDOWN
243 */
244#define F2FS_IOC_SHUTDOWN _IOR('X', 125, __u32) /* Shutdown */
245#define F2FS_GOING_DOWN_FULLSYNC 0x0 /* going down with full sync */
246#define F2FS_GOING_DOWN_METASYNC 0x1 /* going down with metadata */
247#define F2FS_GOING_DOWN_NOSYNC 0x2 /* going down */
c912a829 248#define F2FS_GOING_DOWN_METAFLUSH 0x3 /* going down with meta flush */
1abff93d 249
e9750824
NJ
250#if defined(__KERNEL__) && defined(CONFIG_COMPAT)
251/*
252 * ioctl commands in 32 bit emulation
253 */
04ef4b62
CY
254#define F2FS_IOC32_GETFLAGS FS_IOC32_GETFLAGS
255#define F2FS_IOC32_SETFLAGS FS_IOC32_SETFLAGS
256#define F2FS_IOC32_GETVERSION FS_IOC32_GETVERSION
e9750824
NJ
257#endif
258
d323d005
CY
259struct f2fs_defragment {
260 u64 start;
261 u64 len;
262};
263
39a53e0c
JK
264/*
265 * For INODE and NODE manager
266 */
7b3cd7d6 267/* for directory operations */
6b3bd08f
JK
268struct f2fs_str {
269 unsigned char *name;
270 u32 len;
271};
272
273struct f2fs_filename {
274 const struct qstr *usr_fname;
275 struct f2fs_str disk_name;
276 f2fs_hash_t hash;
277#ifdef CONFIG_F2FS_FS_ENCRYPTION
278 struct f2fs_str crypto_buf;
279#endif
280};
281
282#define FSTR_INIT(n, l) { .name = n, .len = l }
283#define FSTR_TO_QSTR(f) QSTR_INIT((f)->name, (f)->len)
284#define fname_name(p) ((p)->disk_name.name)
285#define fname_len(p) ((p)->disk_name.len)
286
7b3cd7d6 287struct f2fs_dentry_ptr {
d8c6822a 288 struct inode *inode;
7b3cd7d6
JK
289 const void *bitmap;
290 struct f2fs_dir_entry *dentry;
291 __u8 (*filename)[F2FS_SLOT_LEN];
292 int max;
293};
294
d8c6822a
JK
295static inline void make_dentry_ptr(struct inode *inode,
296 struct f2fs_dentry_ptr *d, void *src, int type)
7b3cd7d6 297{
d8c6822a
JK
298 d->inode = inode;
299
7b3cd7d6
JK
300 if (type == 1) {
301 struct f2fs_dentry_block *t = (struct f2fs_dentry_block *)src;
302 d->max = NR_DENTRY_IN_BLOCK;
303 d->bitmap = &t->dentry_bitmap;
304 d->dentry = t->dentry;
305 d->filename = t->filename;
306 } else {
307 struct f2fs_inline_dentry *t = (struct f2fs_inline_dentry *)src;
308 d->max = NR_INLINE_DENTRY;
309 d->bitmap = &t->dentry_bitmap;
310 d->dentry = t->dentry;
311 d->filename = t->filename;
312 }
313}
314
dbe6a5ff
JK
315/*
316 * XATTR_NODE_OFFSET stores xattrs to one node block per file keeping -1
317 * as its node offset to distinguish from index node blocks.
318 * But some bits are used to mark the node block.
319 */
320#define XATTR_NODE_OFFSET ((((unsigned int)-1) << OFFSET_BIT_SHIFT) \
321 >> OFFSET_BIT_SHIFT)
266e97a8
JK
322enum {
323 ALLOC_NODE, /* allocate a new node page if needed */
324 LOOKUP_NODE, /* look up a node without readahead */
325 LOOKUP_NODE_RA, /*
326 * look up a node with readahead called
4f4124d0 327 * by get_data_block.
39a53e0c 328 */
266e97a8
JK
329};
330
a6db67f0 331#define F2FS_LINK_MAX 0xffffffff /* maximum link count per file */
39a53e0c 332
817202d9
CY
333#define MAX_DIR_RA_PAGES 4 /* maximum ra pages of dir */
334
13054c54
CY
335/* vector size for gang look-up from extent cache that consists of radix tree */
336#define EXT_TREE_VEC_SIZE 64
337
39a53e0c 338/* for in-memory extent cache entry */
13054c54
CY
339#define F2FS_MIN_EXTENT_LEN 64 /* minimum extent length */
340
341/* number of extent info in extent cache we try to shrink */
342#define EXTENT_CACHE_SHRINK_NUMBER 128
c11abd1a 343
39a53e0c 344struct extent_info {
13054c54
CY
345 unsigned int fofs; /* start offset in a file */
346 u32 blk; /* start block address of the extent */
347 unsigned int len; /* length of the extent */
348};
349
350struct extent_node {
351 struct rb_node rb_node; /* rb node located in rb-tree */
352 struct list_head list; /* node in global extent list of sbi */
353 struct extent_info ei; /* extent info */
354};
355
356struct extent_tree {
357 nid_t ino; /* inode number */
358 struct rb_root root; /* root of extent info rb-tree */
62c8af65 359 struct extent_node *cached_en; /* recently accessed extent node */
3e72f721 360 struct extent_info largest; /* largested extent info */
13054c54
CY
361 rwlock_t lock; /* protect extent info rb-tree */
362 atomic_t refcount; /* reference count of rb-tree */
363 unsigned int count; /* # of extent node in rb-tree*/
39a53e0c
JK
364};
365
003a3e1d
JK
366/*
367 * This structure is taken from ext4_map_blocks.
368 *
369 * Note that, however, f2fs uses NEW and MAPPED flags for f2fs_map_blocks().
370 */
371#define F2FS_MAP_NEW (1 << BH_New)
372#define F2FS_MAP_MAPPED (1 << BH_Mapped)
7f63eb77
JK
373#define F2FS_MAP_UNWRITTEN (1 << BH_Unwritten)
374#define F2FS_MAP_FLAGS (F2FS_MAP_NEW | F2FS_MAP_MAPPED |\
375 F2FS_MAP_UNWRITTEN)
003a3e1d
JK
376
377struct f2fs_map_blocks {
378 block_t m_pblk;
379 block_t m_lblk;
380 unsigned int m_len;
381 unsigned int m_flags;
382};
383
e2b4e2bc
CY
384/* for flag in get_data_block */
385#define F2FS_GET_BLOCK_READ 0
386#define F2FS_GET_BLOCK_DIO 1
387#define F2FS_GET_BLOCK_FIEMAP 2
388#define F2FS_GET_BLOCK_BMAP 3
389
39a53e0c
JK
390/*
391 * i_advise uses FADVISE_XXX_BIT. We can add additional hints later.
392 */
393#define FADVISE_COLD_BIT 0x01
354a3399 394#define FADVISE_LOST_PINO_BIT 0x02
cde4de12 395#define FADVISE_ENCRYPT_BIT 0x04
e7d55452 396#define FADVISE_ENC_NAME_BIT 0x08
39a53e0c 397
b5492af7
JK
398#define file_is_cold(inode) is_file(inode, FADVISE_COLD_BIT)
399#define file_wrong_pino(inode) is_file(inode, FADVISE_LOST_PINO_BIT)
400#define file_set_cold(inode) set_file(inode, FADVISE_COLD_BIT)
401#define file_lost_pino(inode) set_file(inode, FADVISE_LOST_PINO_BIT)
402#define file_clear_cold(inode) clear_file(inode, FADVISE_COLD_BIT)
403#define file_got_pino(inode) clear_file(inode, FADVISE_LOST_PINO_BIT)
cde4de12
JK
404#define file_is_encrypt(inode) is_file(inode, FADVISE_ENCRYPT_BIT)
405#define file_set_encrypt(inode) set_file(inode, FADVISE_ENCRYPT_BIT)
406#define file_clear_encrypt(inode) clear_file(inode, FADVISE_ENCRYPT_BIT)
e7d55452
JK
407#define file_enc_name(inode) is_file(inode, FADVISE_ENC_NAME_BIT)
408#define file_set_enc_name(inode) set_file(inode, FADVISE_ENC_NAME_BIT)
cde4de12
JK
409
410/* Encryption algorithms */
411#define F2FS_ENCRYPTION_MODE_INVALID 0
412#define F2FS_ENCRYPTION_MODE_AES_256_XTS 1
413#define F2FS_ENCRYPTION_MODE_AES_256_GCM 2
414#define F2FS_ENCRYPTION_MODE_AES_256_CBC 3
415#define F2FS_ENCRYPTION_MODE_AES_256_CTS 4
b5492af7 416
f424f664
JK
417#include "f2fs_crypto.h"
418
ab9fa662
JK
419#define DEF_DIR_LEVEL 0
420
39a53e0c
JK
421struct f2fs_inode_info {
422 struct inode vfs_inode; /* serve a vfs inode */
423 unsigned long i_flags; /* keep an inode flags for ioctl */
424 unsigned char i_advise; /* use to give file attribute hints */
38431545 425 unsigned char i_dir_level; /* use for dentry level for large dir */
39a53e0c 426 unsigned int i_current_depth; /* use only in directory structure */
6666e6aa 427 unsigned int i_pino; /* parent inode number */
39a53e0c
JK
428 umode_t i_acl_mode; /* keep file acl mode temporarily */
429
430 /* Use below internally in f2fs*/
431 unsigned long flags; /* use to pass per-file flags */
d928bfbf 432 struct rw_semaphore i_sem; /* protect fi info */
a7ffdbe2 433 atomic_t dirty_pages; /* # of dirty pages */
39a53e0c
JK
434 f2fs_hash_t chash; /* hash value of given file name */
435 unsigned int clevel; /* maximum level of given file name */
436 nid_t i_xattr_nid; /* node id that contains xattrs */
e518ff81 437 unsigned long long xattr_ver; /* cp version of xattr modification */
88b88a66 438
2710fd7e 439 struct list_head dirty_list; /* linked in global dirty list */
88b88a66
JK
440 struct list_head inmem_pages; /* inmemory pages managed by f2fs */
441 struct mutex inmem_lock; /* lock for inmemory pages */
cde4de12 442
3e72f721
JK
443 struct extent_tree *extent_tree; /* cached extent_tree entry */
444
cde4de12
JK
445#ifdef CONFIG_F2FS_FS_ENCRYPTION
446 /* Encryption params */
447 struct f2fs_crypt_info *i_crypt_info;
448#endif
39a53e0c
JK
449};
450
451static inline void get_extent_info(struct extent_info *ext,
452 struct f2fs_extent i_ext)
453{
39a53e0c 454 ext->fofs = le32_to_cpu(i_ext.fofs);
4d0b0bd4 455 ext->blk = le32_to_cpu(i_ext.blk);
39a53e0c 456 ext->len = le32_to_cpu(i_ext.len);
39a53e0c
JK
457}
458
459static inline void set_raw_extent(struct extent_info *ext,
460 struct f2fs_extent *i_ext)
461{
39a53e0c 462 i_ext->fofs = cpu_to_le32(ext->fofs);
4d0b0bd4 463 i_ext->blk = cpu_to_le32(ext->blk);
39a53e0c 464 i_ext->len = cpu_to_le32(ext->len);
39a53e0c
JK
465}
466
429511cd
CY
467static inline void set_extent_info(struct extent_info *ei, unsigned int fofs,
468 u32 blk, unsigned int len)
469{
470 ei->fofs = fofs;
471 ei->blk = blk;
472 ei->len = len;
473}
474
0bdee482
CY
475static inline bool __is_extent_same(struct extent_info *ei1,
476 struct extent_info *ei2)
477{
478 return (ei1->fofs == ei2->fofs && ei1->blk == ei2->blk &&
479 ei1->len == ei2->len);
480}
481
429511cd
CY
482static inline bool __is_extent_mergeable(struct extent_info *back,
483 struct extent_info *front)
484{
485 return (back->fofs + back->len == front->fofs &&
486 back->blk + back->len == front->blk);
487}
488
489static inline bool __is_back_mergeable(struct extent_info *cur,
490 struct extent_info *back)
491{
492 return __is_extent_mergeable(back, cur);
493}
494
495static inline bool __is_front_mergeable(struct extent_info *cur,
496 struct extent_info *front)
497{
498 return __is_extent_mergeable(cur, front);
499}
500
4abd3f5a
CY
501static inline void __try_update_largest_extent(struct extent_tree *et,
502 struct extent_node *en)
503{
504 if (en->ei.len > et->largest.len)
505 et->largest = en->ei;
506}
507
39a53e0c
JK
508struct f2fs_nm_info {
509 block_t nat_blkaddr; /* base disk address of NAT */
510 nid_t max_nid; /* maximum possible node ids */
7ee0eeab 511 nid_t available_nids; /* maximum available node ids */
39a53e0c 512 nid_t next_scan_nid; /* the next nid to be scanned */
cdfc41c1 513 unsigned int ram_thresh; /* control the memory footprint */
ea1a29a0 514 unsigned int ra_nid_pages; /* # of nid pages to be readaheaded */
39a53e0c
JK
515
516 /* NAT cache management */
517 struct radix_tree_root nat_root;/* root of the nat entry cache */
309cc2b6 518 struct radix_tree_root nat_set_root;/* root of the nat set cache */
8b26ef98 519 struct rw_semaphore nat_tree_lock; /* protect nat_tree_lock */
39a53e0c 520 struct list_head nat_entries; /* cached nat entry list (clean) */
309cc2b6 521 unsigned int nat_cnt; /* the # of cached nat entries */
aec71382 522 unsigned int dirty_nat_cnt; /* total num of nat entries in set */
39a53e0c
JK
523
524 /* free node ids management */
8a7ed66a 525 struct radix_tree_root free_nid_root;/* root of the free_nid cache */
39a53e0c
JK
526 struct list_head free_nid_list; /* a list for free nids */
527 spinlock_t free_nid_list_lock; /* protect free nid list */
528 unsigned int fcnt; /* the number of free node id */
529 struct mutex build_lock; /* lock for build free nids */
530
531 /* for checkpoint */
532 char *nat_bitmap; /* NAT bitmap pointer */
533 int bitmap_size; /* bitmap size */
534};
535
536/*
537 * this structure is used as one of function parameters.
538 * all the information are dedicated to a given direct node block determined
539 * by the data offset in a file.
540 */
541struct dnode_of_data {
542 struct inode *inode; /* vfs inode pointer */
543 struct page *inode_page; /* its inode page, NULL is possible */
544 struct page *node_page; /* cached direct node page */
545 nid_t nid; /* node id of the direct node block */
546 unsigned int ofs_in_node; /* data offset in the node page */
547 bool inode_page_locked; /* inode page is locked or not */
548 block_t data_blkaddr; /* block address of the node block */
549};
550
551static inline void set_new_dnode(struct dnode_of_data *dn, struct inode *inode,
552 struct page *ipage, struct page *npage, nid_t nid)
553{
d66d1f76 554 memset(dn, 0, sizeof(*dn));
39a53e0c
JK
555 dn->inode = inode;
556 dn->inode_page = ipage;
557 dn->node_page = npage;
558 dn->nid = nid;
39a53e0c
JK
559}
560
561/*
562 * For SIT manager
563 *
564 * By default, there are 6 active log areas across the whole main area.
565 * When considering hot and cold data separation to reduce cleaning overhead,
566 * we split 3 for data logs and 3 for node logs as hot, warm, and cold types,
567 * respectively.
568 * In the current design, you should not change the numbers intentionally.
569 * Instead, as a mount option such as active_logs=x, you can use 2, 4, and 6
570 * logs individually according to the underlying devices. (default: 6)
571 * Just in case, on-disk layout covers maximum 16 logs that consist of 8 for
572 * data and 8 for node logs.
573 */
574#define NR_CURSEG_DATA_TYPE (3)
575#define NR_CURSEG_NODE_TYPE (3)
576#define NR_CURSEG_TYPE (NR_CURSEG_DATA_TYPE + NR_CURSEG_NODE_TYPE)
577
578enum {
579 CURSEG_HOT_DATA = 0, /* directory entry blocks */
580 CURSEG_WARM_DATA, /* data blocks */
581 CURSEG_COLD_DATA, /* multimedia or GCed data blocks */
582 CURSEG_HOT_NODE, /* direct node blocks of directory files */
583 CURSEG_WARM_NODE, /* direct node blocks of normal files */
584 CURSEG_COLD_NODE, /* indirect node blocks */
38aa0889
JK
585 NO_CHECK_TYPE,
586 CURSEG_DIRECT_IO, /* to use for the direct IO path */
39a53e0c
JK
587};
588
6b4afdd7 589struct flush_cmd {
6b4afdd7 590 struct completion wait;
721bd4d5 591 struct llist_node llnode;
6b4afdd7
JK
592 int ret;
593};
594
a688b9d9
GZ
595struct flush_cmd_control {
596 struct task_struct *f2fs_issue_flush; /* flush thread */
597 wait_queue_head_t flush_wait_queue; /* waiting queue for wake-up */
721bd4d5
GZ
598 struct llist_head issue_list; /* list for command issue */
599 struct llist_node *dispatch_list; /* list for command dispatch */
a688b9d9
GZ
600};
601
39a53e0c
JK
602struct f2fs_sm_info {
603 struct sit_info *sit_info; /* whole segment information */
604 struct free_segmap_info *free_info; /* free segment information */
605 struct dirty_seglist_info *dirty_info; /* dirty segment information */
606 struct curseg_info *curseg_array; /* active segment information */
607
39a53e0c
JK
608 block_t seg0_blkaddr; /* block address of 0'th segment */
609 block_t main_blkaddr; /* start block address of main area */
610 block_t ssa_blkaddr; /* start block address of SSA area */
611
612 unsigned int segment_count; /* total # of segments */
613 unsigned int main_segments; /* # of segments in main area */
614 unsigned int reserved_segments; /* # of reserved segments */
615 unsigned int ovp_segments; /* # of overprovision segments */
81eb8d6e
JK
616
617 /* a threshold to reclaim prefree segments */
618 unsigned int rec_prefree_segments;
7fd9e544
JK
619
620 /* for small discard management */
621 struct list_head discard_list; /* 4KB discard list */
622 int nr_discards; /* # of discards in the list */
623 int max_discards; /* max. discards to be issued */
216fbd64 624
bba681cb
JK
625 /* for batched trimming */
626 unsigned int trim_sections; /* # of sections to trim */
627
184a5cd2
CY
628 struct list_head sit_entry_set; /* sit entry set list */
629
216fbd64
JK
630 unsigned int ipu_policy; /* in-place-update policy */
631 unsigned int min_ipu_util; /* in-place-update threshold */
c1ce1b02 632 unsigned int min_fsync_blocks; /* threshold for fsync */
6b4afdd7
JK
633
634 /* for flush command control */
a688b9d9
GZ
635 struct flush_cmd_control *cmd_control_info;
636
39a53e0c
JK
637};
638
39a53e0c
JK
639/*
640 * For superblock
641 */
642/*
643 * COUNT_TYPE for monitoring
644 *
645 * f2fs monitors the number of several block types such as on-writeback,
646 * dirty dentry blocks, dirty node blocks, and dirty meta blocks.
647 */
648enum count_type {
649 F2FS_WRITEBACK,
650 F2FS_DIRTY_DENTS,
c227f912 651 F2FS_DIRTY_DATA,
39a53e0c
JK
652 F2FS_DIRTY_NODES,
653 F2FS_DIRTY_META,
8dcf2ff7 654 F2FS_INMEM_PAGES,
39a53e0c
JK
655 NR_COUNT_TYPE,
656};
657
39a53e0c 658/*
e1c42045 659 * The below are the page types of bios used in submit_bio().
39a53e0c
JK
660 * The available types are:
661 * DATA User data pages. It operates as async mode.
662 * NODE Node pages. It operates as async mode.
663 * META FS metadata pages such as SIT, NAT, CP.
664 * NR_PAGE_TYPE The number of page types.
665 * META_FLUSH Make sure the previous pages are written
666 * with waiting the bio's completion
667 * ... Only can be used with META.
668 */
7d5e5109 669#define PAGE_TYPE_OF_BIO(type) ((type) > META ? META : (type))
39a53e0c
JK
670enum page_type {
671 DATA,
672 NODE,
673 META,
674 NR_PAGE_TYPE,
675 META_FLUSH,
8ce67cb0
JK
676 INMEM, /* the below types are used by tracepoints only. */
677 INMEM_DROP,
678 IPU,
679 OPU,
39a53e0c
JK
680};
681
458e6197 682struct f2fs_io_info {
05ca3632 683 struct f2fs_sb_info *sbi; /* f2fs_sb_info pointer */
7e8f2308
GZ
684 enum page_type type; /* contains DATA/NODE/META/META_FLUSH */
685 int rw; /* contains R/RS/W/WS with REQ_META/REQ_PRIO */
cf04e8eb 686 block_t blk_addr; /* block address to be written */
05ca3632 687 struct page *page; /* page to be written */
4375a336 688 struct page *encrypted_page; /* encrypted page */
458e6197
JK
689};
690
93dfe2ac 691#define is_read_io(rw) (((rw) & 1) == READ)
1ff7bd3b 692struct f2fs_bio_info {
458e6197 693 struct f2fs_sb_info *sbi; /* f2fs superblock */
1ff7bd3b
JK
694 struct bio *bio; /* bios to merge */
695 sector_t last_block_in_bio; /* last block number */
458e6197 696 struct f2fs_io_info fio; /* store buffered io info. */
df0f8dc0 697 struct rw_semaphore io_rwsem; /* blocking op for bio */
1ff7bd3b
JK
698};
699
c227f912
CY
700enum inode_type {
701 DIR_INODE, /* for dirty dir inode */
702 FILE_INODE, /* for dirty regular/symlink inode */
703 NR_INODE_TYPE,
704};
705
67298804
CY
706/* for inner inode cache management */
707struct inode_management {
708 struct radix_tree_root ino_root; /* ino entry array */
709 spinlock_t ino_lock; /* for ino entry lock */
710 struct list_head ino_list; /* inode list head */
711 unsigned long ino_num; /* number of entries */
712};
713
caf0047e
CY
714/* For s_flag in struct f2fs_sb_info */
715enum {
716 SBI_IS_DIRTY, /* dirty flag for checkpoint */
717 SBI_IS_CLOSE, /* specify unmounting */
718 SBI_NEED_FSCK, /* need fsck.f2fs to fix */
719 SBI_POR_DOING, /* recovery is doing or not */
720};
721
39a53e0c
JK
722struct f2fs_sb_info {
723 struct super_block *sb; /* pointer to VFS super block */
5e176d54 724 struct proc_dir_entry *s_proc; /* proc entry */
39a53e0c 725 struct f2fs_super_block *raw_super; /* raw super block pointer */
e8240f65 726 int valid_super_block; /* valid super block no */
caf0047e 727 int s_flag; /* flags for sbi */
39a53e0c
JK
728
729 /* for node-related operations */
730 struct f2fs_nm_info *nm_info; /* node manager */
731 struct inode *node_inode; /* cache node blocks */
732
733 /* for segment-related operations */
734 struct f2fs_sm_info *sm_info; /* segment manager */
1ff7bd3b
JK
735
736 /* for bio operations */
924b720b 737 struct f2fs_bio_info read_io; /* for read bios */
1ff7bd3b 738 struct f2fs_bio_info write_io[NR_PAGE_TYPE]; /* for write bios */
39a53e0c
JK
739
740 /* for checkpoint */
741 struct f2fs_checkpoint *ckpt; /* raw checkpoint pointer */
742 struct inode *meta_inode; /* cache meta blocks */
39936837 743 struct mutex cp_mutex; /* checkpoint procedure lock */
e479556b 744 struct rw_semaphore cp_rwsem; /* blocking FS operations */
b3582c68 745 struct rw_semaphore node_write; /* locking node writes */
5463e7c1 746 struct mutex writepages; /* mutex for writepages() */
fb51b5ef 747 wait_queue_head_t cp_wait;
60b99b48 748 long cp_expires, cp_interval; /* next expected periodic cp */
39a53e0c 749
67298804 750 struct inode_management im[MAX_INO_ENTRY]; /* manage inode cache */
6451e041
JK
751
752 /* for orphan inode, use 0'th array */
0d47c1ad 753 unsigned int max_orphans; /* max orphan inodes */
39a53e0c 754
c227f912
CY
755 /* for inode management */
756 struct list_head inode_list[NR_INODE_TYPE]; /* dirty inode list */
757 spinlock_t inode_lock[NR_INODE_TYPE]; /* for dirty inode list lock */
39a53e0c 758
13054c54
CY
759 /* for extent tree cache */
760 struct radix_tree_root extent_tree_root;/* cache extent cache entries */
761 struct rw_semaphore extent_tree_lock; /* locking extent radix tree */
762 struct list_head extent_list; /* lru list for shrinker */
763 spinlock_t extent_lock; /* locking extent lru list */
764 int total_ext_tree; /* extent tree count */
765 atomic_t total_ext_node; /* extent info count */
766
e1c42045 767 /* basic filesystem units */
39a53e0c
JK
768 unsigned int log_sectors_per_block; /* log2 sectors per block */
769 unsigned int log_blocksize; /* log2 block size */
770 unsigned int blocksize; /* block size */
771 unsigned int root_ino_num; /* root inode number*/
772 unsigned int node_ino_num; /* node inode number*/
773 unsigned int meta_ino_num; /* meta inode number*/
774 unsigned int log_blocks_per_seg; /* log2 blocks per segment */
775 unsigned int blocks_per_seg; /* blocks per segment */
776 unsigned int segs_per_sec; /* segments per section */
777 unsigned int secs_per_zone; /* sections per zone */
778 unsigned int total_sections; /* total section count */
779 unsigned int total_node_count; /* total node block count */
780 unsigned int total_valid_node_count; /* valid node block count */
781 unsigned int total_valid_inode_count; /* valid inode count */
782 int active_logs; /* # of active logs */
ab9fa662 783 int dir_level; /* directory level */
39a53e0c
JK
784
785 block_t user_block_count; /* # of user blocks */
786 block_t total_valid_block_count; /* # of valid blocks */
787 block_t alloc_valid_block_count; /* # of allocated blocks */
a66cdd98 788 block_t discard_blks; /* discard command candidats */
39a53e0c
JK
789 block_t last_valid_block_count; /* for recovery */
790 u32 s_next_generation; /* for NFS support */
791 atomic_t nr_pages[NR_COUNT_TYPE]; /* # of pages, see count_type */
792
793 struct f2fs_mount_info mount_opt; /* mount options */
794
795 /* for cleaning operations */
796 struct mutex gc_mutex; /* mutex for GC */
797 struct f2fs_gc_kthread *gc_thread; /* GC thread */
5ec4e49f 798 unsigned int cur_victim_sec; /* current victim section num */
39a53e0c 799
b1c57c1c
JK
800 /* maximum # of trials to find a victim segment for SSR and GC */
801 unsigned int max_victim_search;
802
39a53e0c
JK
803 /*
804 * for stat information.
805 * one is for the LFS mode, and the other is for the SSR mode.
806 */
35b09d82 807#ifdef CONFIG_F2FS_STAT_FS
39a53e0c
JK
808 struct f2fs_stat_info *stat_info; /* FS status information */
809 unsigned int segment_count[2]; /* # of allocated segments */
810 unsigned int block_count[2]; /* # of allocated blocks */
b9a2c252 811 atomic_t inplace_count; /* # of inplace update */
5b7ee374
CY
812 atomic64_t total_hit_ext; /* # of lookup extent cache */
813 atomic64_t read_hit_rbtree; /* # of hit rbtree extent node */
814 atomic64_t read_hit_largest; /* # of hit largest extent node */
815 atomic64_t read_hit_cached; /* # of hit cached extent node */
d5e8f6c9 816 atomic_t inline_xattr; /* # of inline_xattr inodes */
03e14d52
CY
817 atomic_t inline_inode; /* # of inline_data inodes */
818 atomic_t inline_dir; /* # of inline_dentry inodes */
39a53e0c 819 int bg_gc; /* background gc calls */
35b09d82
NJ
820 unsigned int n_dirty_dirs; /* # of dir inodes */
821#endif
822 unsigned int last_victim[2]; /* last victim segment # */
39a53e0c 823 spinlock_t stat_lock; /* lock for stat operations */
b59d0bae
NJ
824
825 /* For sysfs suppport */
826 struct kobject s_kobj;
827 struct completion s_kobj_unregister;
2658e50d
JK
828
829 /* For shrinker support */
830 struct list_head s_list;
831 struct mutex umount_mutex;
832 unsigned int shrinker_run_no;
39a53e0c
JK
833};
834
835/*
836 * Inline functions
837 */
838static inline struct f2fs_inode_info *F2FS_I(struct inode *inode)
839{
840 return container_of(inode, struct f2fs_inode_info, vfs_inode);
841}
842
843static inline struct f2fs_sb_info *F2FS_SB(struct super_block *sb)
844{
845 return sb->s_fs_info;
846}
847
4081363f
JK
848static inline struct f2fs_sb_info *F2FS_I_SB(struct inode *inode)
849{
850 return F2FS_SB(inode->i_sb);
851}
852
853static inline struct f2fs_sb_info *F2FS_M_SB(struct address_space *mapping)
854{
855 return F2FS_I_SB(mapping->host);
856}
857
858static inline struct f2fs_sb_info *F2FS_P_SB(struct page *page)
859{
860 return F2FS_M_SB(page->mapping);
861}
862
39a53e0c
JK
863static inline struct f2fs_super_block *F2FS_RAW_SUPER(struct f2fs_sb_info *sbi)
864{
865 return (struct f2fs_super_block *)(sbi->raw_super);
866}
867
868static inline struct f2fs_checkpoint *F2FS_CKPT(struct f2fs_sb_info *sbi)
869{
870 return (struct f2fs_checkpoint *)(sbi->ckpt);
871}
872
45590710
GZ
873static inline struct f2fs_node *F2FS_NODE(struct page *page)
874{
875 return (struct f2fs_node *)page_address(page);
876}
877
58bfaf44
JK
878static inline struct f2fs_inode *F2FS_INODE(struct page *page)
879{
880 return &((struct f2fs_node *)page_address(page))->i;
881}
882
39a53e0c
JK
883static inline struct f2fs_nm_info *NM_I(struct f2fs_sb_info *sbi)
884{
885 return (struct f2fs_nm_info *)(sbi->nm_info);
886}
887
888static inline struct f2fs_sm_info *SM_I(struct f2fs_sb_info *sbi)
889{
890 return (struct f2fs_sm_info *)(sbi->sm_info);
891}
892
893static inline struct sit_info *SIT_I(struct f2fs_sb_info *sbi)
894{
895 return (struct sit_info *)(SM_I(sbi)->sit_info);
896}
897
898static inline struct free_segmap_info *FREE_I(struct f2fs_sb_info *sbi)
899{
900 return (struct free_segmap_info *)(SM_I(sbi)->free_info);
901}
902
903static inline struct dirty_seglist_info *DIRTY_I(struct f2fs_sb_info *sbi)
904{
905 return (struct dirty_seglist_info *)(SM_I(sbi)->dirty_info);
906}
907
9df27d98
GZ
908static inline struct address_space *META_MAPPING(struct f2fs_sb_info *sbi)
909{
910 return sbi->meta_inode->i_mapping;
911}
912
4ef51a8f
JK
913static inline struct address_space *NODE_MAPPING(struct f2fs_sb_info *sbi)
914{
915 return sbi->node_inode->i_mapping;
916}
917
caf0047e
CY
918static inline bool is_sbi_flag_set(struct f2fs_sb_info *sbi, unsigned int type)
919{
920 return sbi->s_flag & (0x01 << type);
921}
922
923static inline void set_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
39a53e0c 924{
caf0047e 925 sbi->s_flag |= (0x01 << type);
39a53e0c
JK
926}
927
caf0047e 928static inline void clear_sbi_flag(struct f2fs_sb_info *sbi, unsigned int type)
39a53e0c 929{
caf0047e 930 sbi->s_flag &= ~(0x01 << type);
39a53e0c
JK
931}
932
d71b5564
JK
933static inline unsigned long long cur_cp_version(struct f2fs_checkpoint *cp)
934{
935 return le64_to_cpu(cp->checkpoint_ver);
936}
937
25ca923b
JK
938static inline bool is_set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
939{
940 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
941 return ckpt_flags & f;
942}
943
944static inline void set_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
945{
946 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
947 ckpt_flags |= f;
948 cp->ckpt_flags = cpu_to_le32(ckpt_flags);
949}
950
951static inline void clear_ckpt_flags(struct f2fs_checkpoint *cp, unsigned int f)
952{
953 unsigned int ckpt_flags = le32_to_cpu(cp->ckpt_flags);
954 ckpt_flags &= (~f);
955 cp->ckpt_flags = cpu_to_le32(ckpt_flags);
956}
957
e479556b 958static inline void f2fs_lock_op(struct f2fs_sb_info *sbi)
39936837 959{
e479556b 960 down_read(&sbi->cp_rwsem);
39936837
JK
961}
962
e479556b 963static inline void f2fs_unlock_op(struct f2fs_sb_info *sbi)
39a53e0c 964{
e479556b 965 up_read(&sbi->cp_rwsem);
39a53e0c
JK
966}
967
e479556b 968static inline void f2fs_lock_all(struct f2fs_sb_info *sbi)
39a53e0c 969{
0daaad97 970 f2fs_down_write(&sbi->cp_rwsem, &sbi->cp_mutex);
39936837
JK
971}
972
e479556b 973static inline void f2fs_unlock_all(struct f2fs_sb_info *sbi)
39936837 974{
e479556b 975 up_write(&sbi->cp_rwsem);
39a53e0c
JK
976}
977
119ee914
JK
978static inline int __get_cp_reason(struct f2fs_sb_info *sbi)
979{
980 int reason = CP_SYNC;
981
982 if (test_opt(sbi, FASTBOOT))
983 reason = CP_FASTBOOT;
984 if (is_sbi_flag_set(sbi, SBI_IS_CLOSE))
985 reason = CP_UMOUNT;
986 return reason;
987}
988
989static inline bool __remain_node_summaries(int reason)
990{
991 return (reason == CP_UMOUNT || reason == CP_FASTBOOT);
992}
993
994static inline bool __exist_node_summaries(struct f2fs_sb_info *sbi)
995{
996 return (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_UMOUNT_FLAG) ||
997 is_set_ckpt_flags(F2FS_CKPT(sbi), CP_FASTBOOT_FLAG));
998}
999
39a53e0c
JK
1000/*
1001 * Check whether the given nid is within node id range.
1002 */
064e0823 1003static inline int check_nid_range(struct f2fs_sb_info *sbi, nid_t nid)
39a53e0c 1004{
d6b7d4b3
CY
1005 if (unlikely(nid < F2FS_ROOT_INO(sbi)))
1006 return -EINVAL;
cfb271d4 1007 if (unlikely(nid >= NM_I(sbi)->max_nid))
064e0823
NJ
1008 return -EINVAL;
1009 return 0;
39a53e0c
JK
1010}
1011
1012#define F2FS_DEFAULT_ALLOCATED_BLOCKS 1
1013
1014/*
1015 * Check whether the inode has blocks or not
1016 */
1017static inline int F2FS_HAS_BLOCKS(struct inode *inode)
1018{
1019 if (F2FS_I(inode)->i_xattr_nid)
6c311ec6 1020 return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS + 1;
39a53e0c 1021 else
6c311ec6 1022 return inode->i_blocks > F2FS_DEFAULT_ALLOCATED_BLOCKS;
39a53e0c
JK
1023}
1024
4bc8e9bc
CY
1025static inline bool f2fs_has_xattr_block(unsigned int ofs)
1026{
1027 return ofs == XATTR_NODE_OFFSET;
1028}
1029
39a53e0c
JK
1030static inline bool inc_valid_block_count(struct f2fs_sb_info *sbi,
1031 struct inode *inode, blkcnt_t count)
1032{
1033 block_t valid_block_count;
1034
1035 spin_lock(&sbi->stat_lock);
1036 valid_block_count =
1037 sbi->total_valid_block_count + (block_t)count;
cfb271d4 1038 if (unlikely(valid_block_count > sbi->user_block_count)) {
39a53e0c
JK
1039 spin_unlock(&sbi->stat_lock);
1040 return false;
1041 }
1042 inode->i_blocks += count;
1043 sbi->total_valid_block_count = valid_block_count;
1044 sbi->alloc_valid_block_count += (block_t)count;
1045 spin_unlock(&sbi->stat_lock);
1046 return true;
1047}
1048
da19b0dc 1049static inline void dec_valid_block_count(struct f2fs_sb_info *sbi,
39a53e0c
JK
1050 struct inode *inode,
1051 blkcnt_t count)
1052{
1053 spin_lock(&sbi->stat_lock);
9850cf4a
JK
1054 f2fs_bug_on(sbi, sbi->total_valid_block_count < (block_t) count);
1055 f2fs_bug_on(sbi, inode->i_blocks < count);
39a53e0c
JK
1056 inode->i_blocks -= count;
1057 sbi->total_valid_block_count -= (block_t)count;
1058 spin_unlock(&sbi->stat_lock);
39a53e0c
JK
1059}
1060
1061static inline void inc_page_count(struct f2fs_sb_info *sbi, int count_type)
1062{
1063 atomic_inc(&sbi->nr_pages[count_type]);
caf0047e 1064 set_sbi_flag(sbi, SBI_IS_DIRTY);
39a53e0c
JK
1065}
1066
a7ffdbe2 1067static inline void inode_inc_dirty_pages(struct inode *inode)
39a53e0c 1068{
a7ffdbe2 1069 atomic_inc(&F2FS_I(inode)->dirty_pages);
c227f912
CY
1070 inc_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
1071 F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
39a53e0c
JK
1072}
1073
1074static inline void dec_page_count(struct f2fs_sb_info *sbi, int count_type)
1075{
1076 atomic_dec(&sbi->nr_pages[count_type]);
1077}
1078
a7ffdbe2 1079static inline void inode_dec_dirty_pages(struct inode *inode)
39a53e0c 1080{
5ac9f36f
CY
1081 if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
1082 !S_ISLNK(inode->i_mode))
1fe54f9d
JK
1083 return;
1084
a7ffdbe2 1085 atomic_dec(&F2FS_I(inode)->dirty_pages);
c227f912
CY
1086 dec_page_count(F2FS_I_SB(inode), S_ISDIR(inode->i_mode) ?
1087 F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA);
39a53e0c
JK
1088}
1089
1090static inline int get_pages(struct f2fs_sb_info *sbi, int count_type)
1091{
1092 return atomic_read(&sbi->nr_pages[count_type]);
1093}
1094
a7ffdbe2 1095static inline int get_dirty_pages(struct inode *inode)
f8b2c1f9 1096{
a7ffdbe2 1097 return atomic_read(&F2FS_I(inode)->dirty_pages);
f8b2c1f9
JK
1098}
1099
5ac206cf
NJ
1100static inline int get_blocktype_secs(struct f2fs_sb_info *sbi, int block_type)
1101{
3519e3f9 1102 unsigned int pages_per_sec = sbi->segs_per_sec * sbi->blocks_per_seg;
5ac206cf
NJ
1103 return ((get_pages(sbi, block_type) + pages_per_sec - 1)
1104 >> sbi->log_blocks_per_seg) / sbi->segs_per_sec;
1105}
1106
39a53e0c
JK
1107static inline block_t valid_user_blocks(struct f2fs_sb_info *sbi)
1108{
8b8343fa 1109 return sbi->total_valid_block_count;
39a53e0c
JK
1110}
1111
1112static inline unsigned long __bitmap_size(struct f2fs_sb_info *sbi, int flag)
1113{
1114 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1115
1116 /* return NAT or SIT bitmap */
1117 if (flag == NAT_BITMAP)
1118 return le32_to_cpu(ckpt->nat_ver_bitmap_bytesize);
1119 else if (flag == SIT_BITMAP)
1120 return le32_to_cpu(ckpt->sit_ver_bitmap_bytesize);
1121
1122 return 0;
1123}
1124
55141486
WL
1125static inline block_t __cp_payload(struct f2fs_sb_info *sbi)
1126{
1127 return le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload);
1128}
1129
39a53e0c
JK
1130static inline void *__bitmap_ptr(struct f2fs_sb_info *sbi, int flag)
1131{
1132 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1dbe4152
CL
1133 int offset;
1134
55141486 1135 if (__cp_payload(sbi) > 0) {
1dbe4152
CL
1136 if (flag == NAT_BITMAP)
1137 return &ckpt->sit_nat_version_bitmap;
1138 else
65b85ccc 1139 return (unsigned char *)ckpt + F2FS_BLKSIZE;
1dbe4152
CL
1140 } else {
1141 offset = (flag == NAT_BITMAP) ?
25ca923b 1142 le32_to_cpu(ckpt->sit_ver_bitmap_bytesize) : 0;
1dbe4152
CL
1143 return &ckpt->sit_nat_version_bitmap + offset;
1144 }
39a53e0c
JK
1145}
1146
1147static inline block_t __start_cp_addr(struct f2fs_sb_info *sbi)
1148{
1149 block_t start_addr;
1150 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
d71b5564 1151 unsigned long long ckpt_version = cur_cp_version(ckpt);
39a53e0c 1152
25ca923b 1153 start_addr = le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_blkaddr);
39a53e0c
JK
1154
1155 /*
1156 * odd numbered checkpoint should at cp segment 0
e1c42045 1157 * and even segment must be at cp segment 1
39a53e0c
JK
1158 */
1159 if (!(ckpt_version & 1))
1160 start_addr += sbi->blocks_per_seg;
1161
1162 return start_addr;
1163}
1164
1165static inline block_t __start_sum_addr(struct f2fs_sb_info *sbi)
1166{
1167 return le32_to_cpu(F2FS_CKPT(sbi)->cp_pack_start_sum);
1168}
1169
1170static inline bool inc_valid_node_count(struct f2fs_sb_info *sbi,
ef86d709 1171 struct inode *inode)
39a53e0c
JK
1172{
1173 block_t valid_block_count;
1174 unsigned int valid_node_count;
1175
1176 spin_lock(&sbi->stat_lock);
1177
ef86d709 1178 valid_block_count = sbi->total_valid_block_count + 1;
cfb271d4 1179 if (unlikely(valid_block_count > sbi->user_block_count)) {
39a53e0c
JK
1180 spin_unlock(&sbi->stat_lock);
1181 return false;
1182 }
1183
ef86d709 1184 valid_node_count = sbi->total_valid_node_count + 1;
cfb271d4 1185 if (unlikely(valid_node_count > sbi->total_node_count)) {
39a53e0c
JK
1186 spin_unlock(&sbi->stat_lock);
1187 return false;
1188 }
1189
1190 if (inode)
ef86d709
GZ
1191 inode->i_blocks++;
1192
1193 sbi->alloc_valid_block_count++;
1194 sbi->total_valid_node_count++;
1195 sbi->total_valid_block_count++;
39a53e0c
JK
1196 spin_unlock(&sbi->stat_lock);
1197
1198 return true;
1199}
1200
1201static inline void dec_valid_node_count(struct f2fs_sb_info *sbi,
ef86d709 1202 struct inode *inode)
39a53e0c
JK
1203{
1204 spin_lock(&sbi->stat_lock);
1205
9850cf4a
JK
1206 f2fs_bug_on(sbi, !sbi->total_valid_block_count);
1207 f2fs_bug_on(sbi, !sbi->total_valid_node_count);
1208 f2fs_bug_on(sbi, !inode->i_blocks);
39a53e0c 1209
ef86d709
GZ
1210 inode->i_blocks--;
1211 sbi->total_valid_node_count--;
1212 sbi->total_valid_block_count--;
39a53e0c
JK
1213
1214 spin_unlock(&sbi->stat_lock);
1215}
1216
1217static inline unsigned int valid_node_count(struct f2fs_sb_info *sbi)
1218{
8b8343fa 1219 return sbi->total_valid_node_count;
39a53e0c
JK
1220}
1221
1222static inline void inc_valid_inode_count(struct f2fs_sb_info *sbi)
1223{
1224 spin_lock(&sbi->stat_lock);
9850cf4a 1225 f2fs_bug_on(sbi, sbi->total_valid_inode_count == sbi->total_node_count);
39a53e0c
JK
1226 sbi->total_valid_inode_count++;
1227 spin_unlock(&sbi->stat_lock);
1228}
1229
0e80220a 1230static inline void dec_valid_inode_count(struct f2fs_sb_info *sbi)
39a53e0c
JK
1231{
1232 spin_lock(&sbi->stat_lock);
9850cf4a 1233 f2fs_bug_on(sbi, !sbi->total_valid_inode_count);
39a53e0c
JK
1234 sbi->total_valid_inode_count--;
1235 spin_unlock(&sbi->stat_lock);
39a53e0c
JK
1236}
1237
1238static inline unsigned int valid_inode_count(struct f2fs_sb_info *sbi)
1239{
8b8343fa 1240 return sbi->total_valid_inode_count;
39a53e0c
JK
1241}
1242
a56c7c6f
JK
1243static inline struct page *f2fs_grab_cache_page(struct address_space *mapping,
1244 pgoff_t index, bool for_write)
1245{
1246 if (!for_write)
1247 return grab_cache_page(mapping, index);
1248 return grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
1249}
1250
6e2c64ad
JK
1251static inline void f2fs_copy_page(struct page *src, struct page *dst)
1252{
1253 char *src_kaddr = kmap(src);
1254 char *dst_kaddr = kmap(dst);
1255
1256 memcpy(dst_kaddr, src_kaddr, PAGE_SIZE);
1257 kunmap(dst);
1258 kunmap(src);
1259}
1260
39a53e0c
JK
1261static inline void f2fs_put_page(struct page *page, int unlock)
1262{
031fa8cc 1263 if (!page)
39a53e0c
JK
1264 return;
1265
1266 if (unlock) {
9850cf4a 1267 f2fs_bug_on(F2FS_P_SB(page), !PageLocked(page));
39a53e0c
JK
1268 unlock_page(page);
1269 }
1270 page_cache_release(page);
1271}
1272
1273static inline void f2fs_put_dnode(struct dnode_of_data *dn)
1274{
1275 if (dn->node_page)
1276 f2fs_put_page(dn->node_page, 1);
1277 if (dn->inode_page && dn->node_page != dn->inode_page)
1278 f2fs_put_page(dn->inode_page, 0);
1279 dn->node_page = NULL;
1280 dn->inode_page = NULL;
1281}
1282
1283static inline struct kmem_cache *f2fs_kmem_cache_create(const char *name,
e8512d2e 1284 size_t size)
39a53e0c 1285{
e8512d2e 1286 return kmem_cache_create(name, size, 0, SLAB_RECLAIM_ACCOUNT, NULL);
39a53e0c
JK
1287}
1288
7bd59381
GZ
1289static inline void *f2fs_kmem_cache_alloc(struct kmem_cache *cachep,
1290 gfp_t flags)
1291{
1292 void *entry;
7bd59381 1293
80c54505
JK
1294 entry = kmem_cache_alloc(cachep, flags);
1295 if (!entry)
1296 entry = kmem_cache_alloc(cachep, flags | __GFP_NOFAIL);
7bd59381
GZ
1297 return entry;
1298}
1299
740432f8
JK
1300static inline struct bio *f2fs_bio_alloc(int npages)
1301{
1302 struct bio *bio;
1303
1304 /* No failure on bio allocation */
740432f8 1305 bio = bio_alloc(GFP_NOIO, npages);
80c54505
JK
1306 if (!bio)
1307 bio = bio_alloc(GFP_NOIO | __GFP_NOFAIL, npages);
740432f8
JK
1308 return bio;
1309}
1310
9be32d72
JK
1311static inline void f2fs_radix_tree_insert(struct radix_tree_root *root,
1312 unsigned long index, void *item)
1313{
1314 while (radix_tree_insert(root, index, item))
1315 cond_resched();
1316}
1317
39a53e0c
JK
1318#define RAW_IS_INODE(p) ((p)->footer.nid == (p)->footer.ino)
1319
1320static inline bool IS_INODE(struct page *page)
1321{
45590710 1322 struct f2fs_node *p = F2FS_NODE(page);
39a53e0c
JK
1323 return RAW_IS_INODE(p);
1324}
1325
1326static inline __le32 *blkaddr_in_node(struct f2fs_node *node)
1327{
1328 return RAW_IS_INODE(node) ? node->i.i_addr : node->dn.addr;
1329}
1330
1331static inline block_t datablock_addr(struct page *node_page,
1332 unsigned int offset)
1333{
1334 struct f2fs_node *raw_node;
1335 __le32 *addr_array;
45590710 1336 raw_node = F2FS_NODE(node_page);
39a53e0c
JK
1337 addr_array = blkaddr_in_node(raw_node);
1338 return le32_to_cpu(addr_array[offset]);
1339}
1340
1341static inline int f2fs_test_bit(unsigned int nr, char *addr)
1342{
1343 int mask;
1344
1345 addr += (nr >> 3);
1346 mask = 1 << (7 - (nr & 0x07));
1347 return mask & *addr;
1348}
1349
a66cdd98
JK
1350static inline void f2fs_set_bit(unsigned int nr, char *addr)
1351{
1352 int mask;
1353
1354 addr += (nr >> 3);
1355 mask = 1 << (7 - (nr & 0x07));
1356 *addr |= mask;
1357}
1358
1359static inline void f2fs_clear_bit(unsigned int nr, char *addr)
1360{
1361 int mask;
1362
1363 addr += (nr >> 3);
1364 mask = 1 << (7 - (nr & 0x07));
1365 *addr &= ~mask;
1366}
1367
52aca074 1368static inline int f2fs_test_and_set_bit(unsigned int nr, char *addr)
39a53e0c
JK
1369{
1370 int mask;
1371 int ret;
1372
1373 addr += (nr >> 3);
1374 mask = 1 << (7 - (nr & 0x07));
1375 ret = mask & *addr;
1376 *addr |= mask;
1377 return ret;
1378}
1379
52aca074 1380static inline int f2fs_test_and_clear_bit(unsigned int nr, char *addr)
39a53e0c
JK
1381{
1382 int mask;
1383 int ret;
1384
1385 addr += (nr >> 3);
1386 mask = 1 << (7 - (nr & 0x07));
1387 ret = mask & *addr;
1388 *addr &= ~mask;
1389 return ret;
1390}
1391
c6ac4c0e
GZ
1392static inline void f2fs_change_bit(unsigned int nr, char *addr)
1393{
1394 int mask;
1395
1396 addr += (nr >> 3);
1397 mask = 1 << (7 - (nr & 0x07));
1398 *addr ^= mask;
1399}
1400
39a53e0c
JK
1401/* used for f2fs_inode_info->flags */
1402enum {
1403 FI_NEW_INODE, /* indicate newly allocated inode */
b3783873 1404 FI_DIRTY_INODE, /* indicate inode is dirty or not */
ed57c27f 1405 FI_DIRTY_DIR, /* indicate directory has dirty pages */
39a53e0c
JK
1406 FI_INC_LINK, /* need to increment i_nlink */
1407 FI_ACL_MODE, /* indicate acl mode */
1408 FI_NO_ALLOC, /* should not allocate any blocks */
c9b63bd0 1409 FI_FREE_NID, /* free allocated nide */
699489bb 1410 FI_UPDATE_DIR, /* should update inode block for consistency */
74d0b917 1411 FI_DELAY_IPUT, /* used for the recovery */
c11abd1a 1412 FI_NO_EXTENT, /* not to use the extent cache */
444c580f 1413 FI_INLINE_XATTR, /* used for inline xattr */
1001b347 1414 FI_INLINE_DATA, /* used for inline data*/
34d67deb 1415 FI_INLINE_DENTRY, /* used for inline dentry */
fff04f90
JK
1416 FI_APPEND_WRITE, /* inode has appended data */
1417 FI_UPDATE_WRITE, /* inode has in-place-update data */
88b88a66
JK
1418 FI_NEED_IPU, /* used for ipu per file */
1419 FI_ATOMIC_FILE, /* indicate atomic file */
02a1335f 1420 FI_VOLATILE_FILE, /* indicate volatile file */
3c6c2beb 1421 FI_FIRST_BLOCK_WRITTEN, /* indicate #0 data block was written */
1e84371f 1422 FI_DROP_CACHE, /* drop dirty page cache */
b3d208f9 1423 FI_DATA_EXIST, /* indicate data exists */
510022a8 1424 FI_INLINE_DOTS, /* indicate inline dot dentries */
d323d005 1425 FI_DO_DEFRAG, /* indicate defragment is running */
c227f912 1426 FI_DIRTY_FILE, /* indicate regular/symlink has dirty pages */
39a53e0c
JK
1427};
1428
1429static inline void set_inode_flag(struct f2fs_inode_info *fi, int flag)
1430{
61e0f2d0
JK
1431 if (!test_bit(flag, &fi->flags))
1432 set_bit(flag, &fi->flags);
39a53e0c
JK
1433}
1434
1435static inline int is_inode_flag_set(struct f2fs_inode_info *fi, int flag)
1436{
1437 return test_bit(flag, &fi->flags);
1438}
1439
1440static inline void clear_inode_flag(struct f2fs_inode_info *fi, int flag)
1441{
61e0f2d0
JK
1442 if (test_bit(flag, &fi->flags))
1443 clear_bit(flag, &fi->flags);
39a53e0c
JK
1444}
1445
1446static inline void set_acl_inode(struct f2fs_inode_info *fi, umode_t mode)
1447{
1448 fi->i_acl_mode = mode;
1449 set_inode_flag(fi, FI_ACL_MODE);
1450}
1451
444c580f
JK
1452static inline void get_inline_info(struct f2fs_inode_info *fi,
1453 struct f2fs_inode *ri)
1454{
1455 if (ri->i_inline & F2FS_INLINE_XATTR)
1456 set_inode_flag(fi, FI_INLINE_XATTR);
1001b347
HL
1457 if (ri->i_inline & F2FS_INLINE_DATA)
1458 set_inode_flag(fi, FI_INLINE_DATA);
34d67deb
CY
1459 if (ri->i_inline & F2FS_INLINE_DENTRY)
1460 set_inode_flag(fi, FI_INLINE_DENTRY);
b3d208f9
JK
1461 if (ri->i_inline & F2FS_DATA_EXIST)
1462 set_inode_flag(fi, FI_DATA_EXIST);
510022a8
JK
1463 if (ri->i_inline & F2FS_INLINE_DOTS)
1464 set_inode_flag(fi, FI_INLINE_DOTS);
444c580f
JK
1465}
1466
1467static inline void set_raw_inline(struct f2fs_inode_info *fi,
1468 struct f2fs_inode *ri)
1469{
1470 ri->i_inline = 0;
1471
1472 if (is_inode_flag_set(fi, FI_INLINE_XATTR))
1473 ri->i_inline |= F2FS_INLINE_XATTR;
1001b347
HL
1474 if (is_inode_flag_set(fi, FI_INLINE_DATA))
1475 ri->i_inline |= F2FS_INLINE_DATA;
34d67deb
CY
1476 if (is_inode_flag_set(fi, FI_INLINE_DENTRY))
1477 ri->i_inline |= F2FS_INLINE_DENTRY;
b3d208f9
JK
1478 if (is_inode_flag_set(fi, FI_DATA_EXIST))
1479 ri->i_inline |= F2FS_DATA_EXIST;
510022a8
JK
1480 if (is_inode_flag_set(fi, FI_INLINE_DOTS))
1481 ri->i_inline |= F2FS_INLINE_DOTS;
444c580f
JK
1482}
1483
987c7c31
CY
1484static inline int f2fs_has_inline_xattr(struct inode *inode)
1485{
1486 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_XATTR);
1487}
1488
de93653f
JK
1489static inline unsigned int addrs_per_inode(struct f2fs_inode_info *fi)
1490{
987c7c31 1491 if (f2fs_has_inline_xattr(&fi->vfs_inode))
de93653f
JK
1492 return DEF_ADDRS_PER_INODE - F2FS_INLINE_XATTR_ADDRS;
1493 return DEF_ADDRS_PER_INODE;
1494}
1495
65985d93
JK
1496static inline void *inline_xattr_addr(struct page *page)
1497{
695fd1ed 1498 struct f2fs_inode *ri = F2FS_INODE(page);
65985d93
JK
1499 return (void *)&(ri->i_addr[DEF_ADDRS_PER_INODE -
1500 F2FS_INLINE_XATTR_ADDRS]);
1501}
1502
1503static inline int inline_xattr_size(struct inode *inode)
1504{
987c7c31 1505 if (f2fs_has_inline_xattr(inode))
65985d93
JK
1506 return F2FS_INLINE_XATTR_ADDRS << 2;
1507 else
1508 return 0;
1509}
1510
0dbdc2ae
JK
1511static inline int f2fs_has_inline_data(struct inode *inode)
1512{
1513 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DATA);
1514}
1515
b3d208f9
JK
1516static inline void f2fs_clear_inline_inode(struct inode *inode)
1517{
1518 clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
1519 clear_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
1520}
1521
1522static inline int f2fs_exist_data(struct inode *inode)
1523{
1524 return is_inode_flag_set(F2FS_I(inode), FI_DATA_EXIST);
1525}
1526
510022a8
JK
1527static inline int f2fs_has_inline_dots(struct inode *inode)
1528{
1529 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DOTS);
1530}
1531
88b88a66
JK
1532static inline bool f2fs_is_atomic_file(struct inode *inode)
1533{
1534 return is_inode_flag_set(F2FS_I(inode), FI_ATOMIC_FILE);
1535}
1536
02a1335f
JK
1537static inline bool f2fs_is_volatile_file(struct inode *inode)
1538{
1539 return is_inode_flag_set(F2FS_I(inode), FI_VOLATILE_FILE);
1540}
1541
3c6c2beb
JK
1542static inline bool f2fs_is_first_block_written(struct inode *inode)
1543{
1544 return is_inode_flag_set(F2FS_I(inode), FI_FIRST_BLOCK_WRITTEN);
1545}
1546
1e84371f
JK
1547static inline bool f2fs_is_drop_cache(struct inode *inode)
1548{
1549 return is_inode_flag_set(F2FS_I(inode), FI_DROP_CACHE);
1550}
1551
1001b347
HL
1552static inline void *inline_data_addr(struct page *page)
1553{
695fd1ed 1554 struct f2fs_inode *ri = F2FS_INODE(page);
1001b347
HL
1555 return (void *)&(ri->i_addr[1]);
1556}
1557
34d67deb
CY
1558static inline int f2fs_has_inline_dentry(struct inode *inode)
1559{
1560 return is_inode_flag_set(F2FS_I(inode), FI_INLINE_DENTRY);
1561}
1562
9486ba44
JK
1563static inline void f2fs_dentry_kunmap(struct inode *dir, struct page *page)
1564{
1565 if (!f2fs_has_inline_dentry(dir))
1566 kunmap(page);
1567}
1568
b5492af7
JK
1569static inline int is_file(struct inode *inode, int type)
1570{
1571 return F2FS_I(inode)->i_advise & type;
1572}
1573
1574static inline void set_file(struct inode *inode, int type)
1575{
1576 F2FS_I(inode)->i_advise |= type;
1577}
1578
1579static inline void clear_file(struct inode *inode, int type)
1580{
1581 F2FS_I(inode)->i_advise &= ~type;
1582}
1583
77888c1e
JK
1584static inline int f2fs_readonly(struct super_block *sb)
1585{
1586 return sb->s_flags & MS_RDONLY;
1587}
1588
1e968fdf
JK
1589static inline bool f2fs_cp_error(struct f2fs_sb_info *sbi)
1590{
1591 return is_set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
1592}
1593
744602cf
JK
1594static inline void f2fs_stop_checkpoint(struct f2fs_sb_info *sbi)
1595{
1596 set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
1597 sbi->sb->s_flags |= MS_RDONLY;
1598}
1599
eaa693f4
JK
1600static inline bool is_dot_dotdot(const struct qstr *str)
1601{
1602 if (str->len == 1 && str->name[0] == '.')
1603 return true;
1604
1605 if (str->len == 2 && str->name[0] == '.' && str->name[1] == '.')
1606 return true;
1607
1608 return false;
1609}
1610
3e72f721
JK
1611static inline bool f2fs_may_extent_tree(struct inode *inode)
1612{
1613 mode_t mode = inode->i_mode;
1614
1615 if (!test_opt(F2FS_I_SB(inode), EXTENT_CACHE) ||
1616 is_inode_flag_set(F2FS_I(inode), FI_NO_EXTENT))
1617 return false;
1618
1619 return S_ISREG(mode);
1620}
1621
39307a8e
JK
1622static inline void *f2fs_kvmalloc(size_t size, gfp_t flags)
1623{
1624 void *ret;
1625
1626 ret = kmalloc(size, flags | __GFP_NOWARN);
1627 if (!ret)
1628 ret = __vmalloc(size, flags, PAGE_KERNEL);
1629 return ret;
1630}
1631
1632static inline void *f2fs_kvzalloc(size_t size, gfp_t flags)
1633{
1634 void *ret;
1635
1636 ret = kzalloc(size, flags | __GFP_NOWARN);
1637 if (!ret)
1638 ret = __vmalloc(size, flags | __GFP_ZERO, PAGE_KERNEL);
1639 return ret;
1640}
1641
a6dda0e6
CH
1642#define get_inode_mode(i) \
1643 ((is_inode_flag_set(F2FS_I(i), FI_ACL_MODE)) ? \
1644 (F2FS_I(i)->i_acl_mode) : ((i)->i_mode))
1645
267378d4
CY
1646/* get offset of first page in next direct node */
1647#define PGOFS_OF_NEXT_DNODE(pgofs, fi) \
1648 ((pgofs < ADDRS_PER_INODE(fi)) ? ADDRS_PER_INODE(fi) : \
1649 (pgofs - ADDRS_PER_INODE(fi) + ADDRS_PER_BLOCK) / \
1650 ADDRS_PER_BLOCK * ADDRS_PER_BLOCK + ADDRS_PER_INODE(fi))
1651
39a53e0c
JK
1652/*
1653 * file.c
1654 */
1655int f2fs_sync_file(struct file *, loff_t, loff_t, int);
1656void truncate_data_blocks(struct dnode_of_data *);
764aa3e9 1657int truncate_blocks(struct inode *, u64, bool);
b0154891 1658int f2fs_truncate(struct inode *, bool);
2d4d9fb5 1659int f2fs_getattr(struct vfsmount *, struct dentry *, struct kstat *);
39a53e0c
JK
1660int f2fs_setattr(struct dentry *, struct iattr *);
1661int truncate_hole(struct inode *, pgoff_t, pgoff_t);
b292dcab 1662int truncate_data_blocks_range(struct dnode_of_data *, int);
39a53e0c 1663long f2fs_ioctl(struct file *, unsigned int, unsigned long);
e9750824 1664long f2fs_compat_ioctl(struct file *, unsigned int, unsigned long);
39a53e0c
JK
1665
1666/*
1667 * inode.c
1668 */
1669void f2fs_set_inode_flags(struct inode *);
39a53e0c 1670struct inode *f2fs_iget(struct super_block *, unsigned long);
4660f9c0 1671int try_to_free_nats(struct f2fs_sb_info *, int);
39a53e0c 1672void update_inode(struct inode *, struct page *);
744602cf 1673void update_inode_page(struct inode *);
39a53e0c
JK
1674int f2fs_write_inode(struct inode *, struct writeback_control *);
1675void f2fs_evict_inode(struct inode *);
44c16156 1676void handle_failed_inode(struct inode *);
39a53e0c
JK
1677
1678/*
1679 * namei.c
1680 */
1681struct dentry *f2fs_get_parent(struct dentry *child);
1682
1683/*
1684 * dir.c
1685 */
dbeacf02 1686extern unsigned char f2fs_filetype_table[F2FS_FT_MAX];
510022a8 1687void set_de_type(struct f2fs_dir_entry *, umode_t);
6e22c691
JK
1688
1689struct f2fs_dir_entry *find_target_dentry(struct f2fs_filename *,
1690 f2fs_hash_t, int *, struct f2fs_dentry_ptr *);
7b3cd7d6 1691bool f2fs_fill_dentries(struct dir_context *, struct f2fs_dentry_ptr *,
d8c6822a 1692 unsigned int, struct f2fs_str *);
062a3e7b
JK
1693void do_make_empty_dir(struct inode *, struct inode *,
1694 struct f2fs_dentry_ptr *);
dbeacf02 1695struct page *init_inode_metadata(struct inode *, struct inode *,
bce8d112 1696 const struct qstr *, struct page *);
dbeacf02 1697void update_parent_metadata(struct inode *, struct inode *, unsigned int);
a82afa20 1698int room_for_filename(const void *, int, int);
dbeacf02 1699void f2fs_drop_nlink(struct inode *, struct inode *, struct page *);
39a53e0c
JK
1700struct f2fs_dir_entry *f2fs_find_entry(struct inode *, struct qstr *,
1701 struct page **);
1702struct f2fs_dir_entry *f2fs_parent_dir(struct inode *, struct page **);
1703ino_t f2fs_inode_by_name(struct inode *, struct qstr *);
1704void f2fs_set_link(struct inode *, struct f2fs_dir_entry *,
1705 struct page *, struct inode *);
e7d55452 1706int update_dent_inode(struct inode *, struct inode *, const struct qstr *);
510022a8 1707void f2fs_update_dentry(nid_t ino, umode_t mode, struct f2fs_dentry_ptr *,
3b4d732a 1708 const struct qstr *, f2fs_hash_t , unsigned int);
510022a8
JK
1709int __f2fs_add_link(struct inode *, const struct qstr *, struct inode *, nid_t,
1710 umode_t);
dbeacf02
CY
1711void f2fs_delete_entry(struct f2fs_dir_entry *, struct page *, struct inode *,
1712 struct inode *);
b97a9b5d 1713int f2fs_do_tmpfile(struct inode *, struct inode *);
39a53e0c
JK
1714bool f2fs_empty_dir(struct inode *);
1715
b7f7a5e0
AV
1716static inline int f2fs_add_link(struct dentry *dentry, struct inode *inode)
1717{
2b0143b5 1718 return __f2fs_add_link(d_inode(dentry->d_parent), &dentry->d_name,
510022a8 1719 inode, inode->i_ino, inode->i_mode);
b7f7a5e0
AV
1720}
1721
39a53e0c
JK
1722/*
1723 * super.c
1724 */
c5bda1c8 1725int f2fs_commit_super(struct f2fs_sb_info *, bool);
39a53e0c 1726int f2fs_sync_fs(struct super_block *, int);
a07ef784
NJ
1727extern __printf(3, 4)
1728void f2fs_msg(struct super_block *, const char *, const char *, ...);
39a53e0c
JK
1729
1730/*
1731 * hash.c
1732 */
eee6160f 1733f2fs_hash_t f2fs_dentry_hash(const struct qstr *);
39a53e0c
JK
1734
1735/*
1736 * node.c
1737 */
1738struct dnode_of_data;
1739struct node_info;
1740
6fb03f3a 1741bool available_free_memory(struct f2fs_sb_info *, int);
2dcf51ab 1742int need_dentry_mark(struct f2fs_sb_info *, nid_t);
88bd02c9 1743bool is_checkpointed_node(struct f2fs_sb_info *, nid_t);
88bd02c9 1744bool need_inode_block_update(struct f2fs_sb_info *, nid_t);
39a53e0c
JK
1745void get_node_info(struct f2fs_sb_info *, nid_t, struct node_info *);
1746int get_dnode_of_data(struct dnode_of_data *, pgoff_t, int);
1747int truncate_inode_blocks(struct inode *, pgoff_t);
4f16fb0f 1748int truncate_xattr_node(struct inode *, struct page *);
cfe58f9d 1749int wait_on_node_pages_writeback(struct f2fs_sb_info *, nid_t);
13ec7297 1750int remove_inode_page(struct inode *);
a014e037 1751struct page *new_inode_page(struct inode *);
8ae8f162 1752struct page *new_node_page(struct dnode_of_data *, unsigned int, struct page *);
39a53e0c
JK
1753void ra_node_page(struct f2fs_sb_info *, nid_t);
1754struct page *get_node_page(struct f2fs_sb_info *, pgoff_t);
1755struct page *get_node_page_ra(struct page *, int);
1756void sync_inode_page(struct dnode_of_data *);
1757int sync_node_pages(struct f2fs_sb_info *, nid_t, struct writeback_control *);
1758bool alloc_nid(struct f2fs_sb_info *, nid_t *);
1759void alloc_nid_done(struct f2fs_sb_info *, nid_t);
1760void alloc_nid_failed(struct f2fs_sb_info *, nid_t);
31696580 1761int try_to_free_nids(struct f2fs_sb_info *, int);
70cfed88 1762void recover_inline_xattr(struct inode *, struct page *);
1c35a90e 1763void recover_xattr_data(struct inode *, struct page *, block_t);
39a53e0c
JK
1764int recover_inode_page(struct f2fs_sb_info *, struct page *);
1765int restore_node_summary(struct f2fs_sb_info *, unsigned int,
1766 struct f2fs_summary_block *);
1767void flush_nat_entries(struct f2fs_sb_info *);
1768int build_node_manager(struct f2fs_sb_info *);
1769void destroy_node_manager(struct f2fs_sb_info *);
6e6093a8 1770int __init create_node_manager_caches(void);
39a53e0c
JK
1771void destroy_node_manager_caches(void);
1772
1773/*
1774 * segment.c
1775 */
88b88a66 1776void register_inmem_page(struct inode *, struct page *);
edb27dee 1777int commit_inmem_pages(struct inode *, bool);
39a53e0c 1778void f2fs_balance_fs(struct f2fs_sb_info *);
4660f9c0 1779void f2fs_balance_fs_bg(struct f2fs_sb_info *);
6b4afdd7 1780int f2fs_issue_flush(struct f2fs_sb_info *);
2163d198
GZ
1781int create_flush_cmd_control(struct f2fs_sb_info *);
1782void destroy_flush_cmd_control(struct f2fs_sb_info *);
39a53e0c 1783void invalidate_blocks(struct f2fs_sb_info *, block_t);
6e2c64ad 1784bool is_checkpointed_data(struct f2fs_sb_info *, block_t);
5e443818 1785void refresh_sit_entry(struct f2fs_sb_info *, block_t, block_t);
836b5a63 1786void clear_prefree_segments(struct f2fs_sb_info *, struct cp_control *);
4b2fecc8 1787void release_discard_addrs(struct f2fs_sb_info *);
e90c2d28 1788bool discard_next_dnode(struct f2fs_sb_info *, block_t);
3fa06d7b 1789int npages_for_summary_flush(struct f2fs_sb_info *, bool);
39a53e0c 1790void allocate_new_segments(struct f2fs_sb_info *);
4b2fecc8 1791int f2fs_trim_fs(struct f2fs_sb_info *, struct fstrim_range *);
39a53e0c 1792struct page *get_sum_page(struct f2fs_sb_info *, unsigned int);
381722d2 1793void update_meta_page(struct f2fs_sb_info *, void *, block_t);
577e3495 1794void write_meta_page(struct f2fs_sb_info *, struct page *);
05ca3632
JK
1795void write_node_page(unsigned int, struct f2fs_io_info *);
1796void write_data_page(struct dnode_of_data *, struct f2fs_io_info *);
1797void rewrite_data_page(struct f2fs_io_info *);
528e3459
CY
1798void f2fs_replace_block(struct f2fs_sb_info *, struct dnode_of_data *,
1799 block_t, block_t, unsigned char, bool);
bfad7c2d
JK
1800void allocate_data_block(struct f2fs_sb_info *, struct page *,
1801 block_t, block_t *, struct f2fs_summary *, int);
5514f0aa 1802void f2fs_wait_on_page_writeback(struct page *, enum page_type);
08b39fbd 1803void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *, block_t);
39a53e0c
JK
1804void write_data_summaries(struct f2fs_sb_info *, block_t);
1805void write_node_summaries(struct f2fs_sb_info *, block_t);
1806int lookup_journal_in_cursum(struct f2fs_summary_block *,
1807 int, unsigned int, int);
4b2fecc8 1808void flush_sit_entries(struct f2fs_sb_info *, struct cp_control *);
39a53e0c 1809int build_segment_manager(struct f2fs_sb_info *);
39a53e0c 1810void destroy_segment_manager(struct f2fs_sb_info *);
7fd9e544
JK
1811int __init create_segment_manager_caches(void);
1812void destroy_segment_manager_caches(void);
39a53e0c
JK
1813
1814/*
1815 * checkpoint.c
1816 */
1817struct page *grab_meta_page(struct f2fs_sb_info *, pgoff_t);
1818struct page *get_meta_page(struct f2fs_sb_info *, pgoff_t);
2b947003 1819struct page *get_tmp_page(struct f2fs_sb_info *, pgoff_t);
f0c9cada 1820bool is_valid_blkaddr(struct f2fs_sb_info *, block_t, int);
26879fb1 1821int ra_meta_pages(struct f2fs_sb_info *, block_t, int, int, bool);
635aee1f 1822void ra_meta_pages_cond(struct f2fs_sb_info *, pgoff_t);
39a53e0c 1823long sync_meta_pages(struct f2fs_sb_info *, enum page_type, long);
a49324f1
CY
1824void add_ino_entry(struct f2fs_sb_info *, nid_t, int type);
1825void remove_ino_entry(struct f2fs_sb_info *, nid_t, int type);
1826void release_ino_entry(struct f2fs_sb_info *);
fff04f90 1827bool exist_written_data(struct f2fs_sb_info *, nid_t, int);
cbd56e7d
JK
1828int acquire_orphan_inode(struct f2fs_sb_info *);
1829void release_orphan_inode(struct f2fs_sb_info *);
39a53e0c
JK
1830void add_orphan_inode(struct f2fs_sb_info *, nid_t);
1831void remove_orphan_inode(struct f2fs_sb_info *, nid_t);
8c14bfad 1832int recover_orphan_inodes(struct f2fs_sb_info *);
39a53e0c 1833int get_valid_checkpoint(struct f2fs_sb_info *);
a7ffdbe2 1834void update_dirty_page(struct inode *, struct page *);
5deb8267 1835void add_dirty_dir_inode(struct inode *);
c227f912
CY
1836void remove_dirty_inode(struct inode *);
1837void sync_dirty_inodes(struct f2fs_sb_info *, enum inode_type);
75ab4cb8 1838void write_checkpoint(struct f2fs_sb_info *, struct cp_control *);
6451e041 1839void init_ino_entry_info(struct f2fs_sb_info *);
6e6093a8 1840int __init create_checkpoint_caches(void);
39a53e0c
JK
1841void destroy_checkpoint_caches(void);
1842
1843/*
1844 * data.c
1845 */
458e6197 1846void f2fs_submit_merged_bio(struct f2fs_sb_info *, enum page_type, int);
05ca3632
JK
1847int f2fs_submit_page_bio(struct f2fs_io_info *);
1848void f2fs_submit_page_mbio(struct f2fs_io_info *);
216a620a 1849void set_data_blkaddr(struct dnode_of_data *);
39a53e0c 1850int reserve_new_block(struct dnode_of_data *);
759af1c9 1851int f2fs_get_block(struct dnode_of_data *, pgoff_t);
b600965c 1852int f2fs_reserve_block(struct dnode_of_data *, pgoff_t);
a56c7c6f 1853struct page *get_read_data_page(struct inode *, pgoff_t, int, bool);
43f3eae1 1854struct page *find_data_page(struct inode *, pgoff_t);
a56c7c6f 1855struct page *get_lock_data_page(struct inode *, pgoff_t, bool);
64aa7ed9 1856struct page *get_new_data_page(struct inode *, struct page *, pgoff_t, bool);
05ca3632 1857int do_write_data_page(struct f2fs_io_info *);
d323d005 1858int f2fs_map_blocks(struct inode *, struct f2fs_map_blocks *, int, int);
9ab70134 1859int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *, u64, u64);
487261f3
CY
1860void f2fs_invalidate_page(struct page *, unsigned int, unsigned int);
1861int f2fs_release_page(struct page *, gfp_t);
39a53e0c
JK
1862
1863/*
1864 * gc.c
1865 */
1866int start_gc_thread(struct f2fs_sb_info *);
1867void stop_gc_thread(struct f2fs_sb_info *);
de93653f 1868block_t start_bidx_of_node(unsigned int, struct f2fs_inode_info *);
d530d4d8 1869int f2fs_gc(struct f2fs_sb_info *, bool);
39a53e0c 1870void build_gc_manager(struct f2fs_sb_info *);
39a53e0c
JK
1871
1872/*
1873 * recovery.c
1874 */
6ead1142 1875int recover_fsync_data(struct f2fs_sb_info *);
39a53e0c
JK
1876bool space_for_roll_forward(struct f2fs_sb_info *);
1877
1878/*
1879 * debug.c
1880 */
1881#ifdef CONFIG_F2FS_STAT_FS
1882struct f2fs_stat_info {
1883 struct list_head stat_list;
1884 struct f2fs_sb_info *sbi;
39a53e0c
JK
1885 int all_area_segs, sit_area_segs, nat_area_segs, ssa_area_segs;
1886 int main_area_segs, main_area_sections, main_area_zones;
5b7ee374
CY
1887 unsigned long long hit_largest, hit_cached, hit_rbtree;
1888 unsigned long long hit_total, total_ext;
029e13cc 1889 int ext_tree, ext_node;
39a53e0c 1890 int ndirty_node, ndirty_dent, ndirty_dirs, ndirty_meta;
dd4e4b59 1891 int nats, dirty_nats, sits, dirty_sits, fnids;
39a53e0c 1892 int total_count, utilization;
d5e8f6c9
CY
1893 int bg_gc, inmem_pages, wb_pages;
1894 int inline_xattr, inline_inode, inline_dir;
39a53e0c
JK
1895 unsigned int valid_count, valid_node_count, valid_inode_count;
1896 unsigned int bimodal, avg_vblocks;
1897 int util_free, util_valid, util_invalid;
1898 int rsvd_segs, overp_segs;
1899 int dirty_count, node_pages, meta_pages;
942e0be6 1900 int prefree_count, call_count, cp_count;
39a53e0c 1901 int tot_segs, node_segs, data_segs, free_segs, free_secs;
e1235983 1902 int bg_node_segs, bg_data_segs;
39a53e0c 1903 int tot_blks, data_blks, node_blks;
e1235983 1904 int bg_data_blks, bg_node_blks;
39a53e0c
JK
1905 int curseg[NR_CURSEG_TYPE];
1906 int cursec[NR_CURSEG_TYPE];
1907 int curzone[NR_CURSEG_TYPE];
1908
1909 unsigned int segment_count[2];
1910 unsigned int block_count[2];
b9a2c252 1911 unsigned int inplace_count;
9edcdabf 1912 unsigned long long base_mem, cache_mem, page_mem;
39a53e0c
JK
1913};
1914
963d4f7d
GZ
1915static inline struct f2fs_stat_info *F2FS_STAT(struct f2fs_sb_info *sbi)
1916{
6c311ec6 1917 return (struct f2fs_stat_info *)sbi->stat_info;
963d4f7d
GZ
1918}
1919
942e0be6 1920#define stat_inc_cp_count(si) ((si)->cp_count++)
dcdfff65
JK
1921#define stat_inc_call_count(si) ((si)->call_count++)
1922#define stat_inc_bggc_count(sbi) ((sbi)->bg_gc++)
1923#define stat_inc_dirty_dir(sbi) ((sbi)->n_dirty_dirs++)
1924#define stat_dec_dirty_dir(sbi) ((sbi)->n_dirty_dirs--)
5b7ee374
CY
1925#define stat_inc_total_hit(sbi) (atomic64_inc(&(sbi)->total_hit_ext))
1926#define stat_inc_rbtree_node_hit(sbi) (atomic64_inc(&(sbi)->read_hit_rbtree))
1927#define stat_inc_largest_node_hit(sbi) (atomic64_inc(&(sbi)->read_hit_largest))
1928#define stat_inc_cached_node_hit(sbi) (atomic64_inc(&(sbi)->read_hit_cached))
d5e8f6c9
CY
1929#define stat_inc_inline_xattr(inode) \
1930 do { \
1931 if (f2fs_has_inline_xattr(inode)) \
1932 (atomic_inc(&F2FS_I_SB(inode)->inline_xattr)); \
1933 } while (0)
1934#define stat_dec_inline_xattr(inode) \
1935 do { \
1936 if (f2fs_has_inline_xattr(inode)) \
1937 (atomic_dec(&F2FS_I_SB(inode)->inline_xattr)); \
1938 } while (0)
0dbdc2ae
JK
1939#define stat_inc_inline_inode(inode) \
1940 do { \
1941 if (f2fs_has_inline_data(inode)) \
03e14d52 1942 (atomic_inc(&F2FS_I_SB(inode)->inline_inode)); \
0dbdc2ae
JK
1943 } while (0)
1944#define stat_dec_inline_inode(inode) \
1945 do { \
1946 if (f2fs_has_inline_data(inode)) \
03e14d52 1947 (atomic_dec(&F2FS_I_SB(inode)->inline_inode)); \
0dbdc2ae 1948 } while (0)
3289c061
JK
1949#define stat_inc_inline_dir(inode) \
1950 do { \
1951 if (f2fs_has_inline_dentry(inode)) \
03e14d52 1952 (atomic_inc(&F2FS_I_SB(inode)->inline_dir)); \
3289c061
JK
1953 } while (0)
1954#define stat_dec_inline_dir(inode) \
1955 do { \
1956 if (f2fs_has_inline_dentry(inode)) \
03e14d52 1957 (atomic_dec(&F2FS_I_SB(inode)->inline_dir)); \
3289c061 1958 } while (0)
dcdfff65
JK
1959#define stat_inc_seg_type(sbi, curseg) \
1960 ((sbi)->segment_count[(curseg)->alloc_type]++)
1961#define stat_inc_block_count(sbi, curseg) \
1962 ((sbi)->block_count[(curseg)->alloc_type]++)
b9a2c252
CL
1963#define stat_inc_inplace_blocks(sbi) \
1964 (atomic_inc(&(sbi)->inplace_count))
e1235983 1965#define stat_inc_seg_count(sbi, type, gc_type) \
39a53e0c 1966 do { \
963d4f7d 1967 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c 1968 (si)->tot_segs++; \
e1235983 1969 if (type == SUM_TYPE_DATA) { \
39a53e0c 1970 si->data_segs++; \
e1235983
CL
1971 si->bg_data_segs += (gc_type == BG_GC) ? 1 : 0; \
1972 } else { \
39a53e0c 1973 si->node_segs++; \
e1235983
CL
1974 si->bg_node_segs += (gc_type == BG_GC) ? 1 : 0; \
1975 } \
39a53e0c
JK
1976 } while (0)
1977
1978#define stat_inc_tot_blk_count(si, blks) \
1979 (si->tot_blks += (blks))
1980
e1235983 1981#define stat_inc_data_blk_count(sbi, blks, gc_type) \
39a53e0c 1982 do { \
963d4f7d 1983 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c
JK
1984 stat_inc_tot_blk_count(si, blks); \
1985 si->data_blks += (blks); \
e1235983 1986 si->bg_data_blks += (gc_type == BG_GC) ? (blks) : 0; \
39a53e0c
JK
1987 } while (0)
1988
e1235983 1989#define stat_inc_node_blk_count(sbi, blks, gc_type) \
39a53e0c 1990 do { \
963d4f7d 1991 struct f2fs_stat_info *si = F2FS_STAT(sbi); \
39a53e0c
JK
1992 stat_inc_tot_blk_count(si, blks); \
1993 si->node_blks += (blks); \
e1235983 1994 si->bg_node_blks += (gc_type == BG_GC) ? (blks) : 0; \
39a53e0c
JK
1995 } while (0)
1996
1997int f2fs_build_stats(struct f2fs_sb_info *);
1998void f2fs_destroy_stats(struct f2fs_sb_info *);
787c7b8c 1999int __init f2fs_create_root_stats(void);
4589d25d 2000void f2fs_destroy_root_stats(void);
39a53e0c 2001#else
942e0be6 2002#define stat_inc_cp_count(si)
39a53e0c 2003#define stat_inc_call_count(si)
dcdfff65
JK
2004#define stat_inc_bggc_count(si)
2005#define stat_inc_dirty_dir(sbi)
2006#define stat_dec_dirty_dir(sbi)
2007#define stat_inc_total_hit(sb)
029e13cc 2008#define stat_inc_rbtree_node_hit(sb)
91c481ff
CY
2009#define stat_inc_largest_node_hit(sbi)
2010#define stat_inc_cached_node_hit(sbi)
d5e8f6c9
CY
2011#define stat_inc_inline_xattr(inode)
2012#define stat_dec_inline_xattr(inode)
0dbdc2ae
JK
2013#define stat_inc_inline_inode(inode)
2014#define stat_dec_inline_inode(inode)
3289c061
JK
2015#define stat_inc_inline_dir(inode)
2016#define stat_dec_inline_dir(inode)
dcdfff65
JK
2017#define stat_inc_seg_type(sbi, curseg)
2018#define stat_inc_block_count(sbi, curseg)
b9a2c252 2019#define stat_inc_inplace_blocks(sbi)
e1235983 2020#define stat_inc_seg_count(sbi, type, gc_type)
39a53e0c 2021#define stat_inc_tot_blk_count(si, blks)
e1235983
CL
2022#define stat_inc_data_blk_count(sbi, blks, gc_type)
2023#define stat_inc_node_blk_count(sbi, blks, gc_type)
39a53e0c
JK
2024
2025static inline int f2fs_build_stats(struct f2fs_sb_info *sbi) { return 0; }
2026static inline void f2fs_destroy_stats(struct f2fs_sb_info *sbi) { }
787c7b8c 2027static inline int __init f2fs_create_root_stats(void) { return 0; }
4589d25d 2028static inline void f2fs_destroy_root_stats(void) { }
39a53e0c
JK
2029#endif
2030
2031extern const struct file_operations f2fs_dir_operations;
2032extern const struct file_operations f2fs_file_operations;
2033extern const struct inode_operations f2fs_file_inode_operations;
2034extern const struct address_space_operations f2fs_dblock_aops;
2035extern const struct address_space_operations f2fs_node_aops;
2036extern const struct address_space_operations f2fs_meta_aops;
2037extern const struct inode_operations f2fs_dir_inode_operations;
2038extern const struct inode_operations f2fs_symlink_inode_operations;
cbaf042a 2039extern const struct inode_operations f2fs_encrypted_symlink_inode_operations;
39a53e0c 2040extern const struct inode_operations f2fs_special_inode_operations;
29e7043f 2041extern struct kmem_cache *inode_entry_slab;
1001b347 2042
e18c65b2
HL
2043/*
2044 * inline.c
2045 */
01b960e9
JK
2046bool f2fs_may_inline_data(struct inode *);
2047bool f2fs_may_inline_dentry(struct inode *);
b3d208f9 2048void read_inline_data(struct page *, struct page *);
0bfcfcca 2049bool truncate_inline_inode(struct page *, u64);
e18c65b2 2050int f2fs_read_inline_data(struct inode *, struct page *);
b3d208f9
JK
2051int f2fs_convert_inline_page(struct dnode_of_data *, struct page *);
2052int f2fs_convert_inline_inode(struct inode *);
2053int f2fs_write_inline_data(struct inode *, struct page *);
0342fd30 2054bool recover_inline_data(struct inode *, struct page *);
6e22c691
JK
2055struct f2fs_dir_entry *find_in_inline_dir(struct inode *,
2056 struct f2fs_filename *, struct page **);
201a05be
CY
2057struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *, struct page **);
2058int make_empty_inline_dir(struct inode *inode, struct inode *, struct page *);
510022a8
JK
2059int f2fs_add_inline_entry(struct inode *, const struct qstr *, struct inode *,
2060 nid_t, umode_t);
201a05be
CY
2061void f2fs_delete_inline_entry(struct f2fs_dir_entry *, struct page *,
2062 struct inode *, struct inode *);
2063bool f2fs_empty_inline_dir(struct inode *);
d8c6822a
JK
2064int f2fs_read_inline_dir(struct file *, struct dir_context *,
2065 struct f2fs_str *);
67f8cf3c
JK
2066int f2fs_inline_data_fiemap(struct inode *,
2067 struct fiemap_extent_info *, __u64, __u64);
cde4de12 2068
2658e50d
JK
2069/*
2070 * shrinker.c
2071 */
2072unsigned long f2fs_shrink_count(struct shrinker *, struct shrink_control *);
2073unsigned long f2fs_shrink_scan(struct shrinker *, struct shrink_control *);
2074void f2fs_join_shrinker(struct f2fs_sb_info *);
2075void f2fs_leave_shrinker(struct f2fs_sb_info *);
2076
a28ef1f5
CY
2077/*
2078 * extent_cache.c
2079 */
2080unsigned int f2fs_shrink_extent_tree(struct f2fs_sb_info *, int);
a28ef1f5
CY
2081void f2fs_init_extent_tree(struct inode *, struct f2fs_extent *);
2082unsigned int f2fs_destroy_extent_node(struct inode *);
2083void f2fs_destroy_extent_tree(struct inode *);
2084bool f2fs_lookup_extent_cache(struct inode *, pgoff_t, struct extent_info *);
2085void f2fs_update_extent_cache(struct dnode_of_data *);
19b2c30d
CY
2086void f2fs_update_extent_cache_range(struct dnode_of_data *dn,
2087 pgoff_t, block_t, unsigned int);
a28ef1f5
CY
2088void init_extent_cache_info(struct f2fs_sb_info *);
2089int __init create_extent_cache(void);
2090void destroy_extent_cache(void);
2091
cde4de12
JK
2092/*
2093 * crypto support
2094 */
2095static inline int f2fs_encrypted_inode(struct inode *inode)
2096{
2097#ifdef CONFIG_F2FS_FS_ENCRYPTION
2098 return file_is_encrypt(inode);
2099#else
2100 return 0;
2101#endif
2102}
2103
2104static inline void f2fs_set_encrypted_inode(struct inode *inode)
2105{
2106#ifdef CONFIG_F2FS_FS_ENCRYPTION
2107 file_set_encrypt(inode);
2108#endif
2109}
2110
2111static inline bool f2fs_bio_encrypted(struct bio *bio)
2112{
2113#ifdef CONFIG_F2FS_FS_ENCRYPTION
2114 return unlikely(bio->bi_private != NULL);
2115#else
2116 return false;
2117#endif
2118}
2119
2120static inline int f2fs_sb_has_crypto(struct super_block *sb)
2121{
2122#ifdef CONFIG_F2FS_FS_ENCRYPTION
2123 return F2FS_HAS_FEATURE(sb, F2FS_FEATURE_ENCRYPT);
2124#else
2125 return 0;
2126#endif
2127}
f424f664 2128
fcc85a4d
JK
2129static inline bool f2fs_may_encrypt(struct inode *inode)
2130{
2131#ifdef CONFIG_F2FS_FS_ENCRYPTION
2132 mode_t mode = inode->i_mode;
2133
2134 return (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode));
2135#else
2136 return 0;
2137#endif
2138}
2139
f424f664
JK
2140/* crypto_policy.c */
2141int f2fs_is_child_context_consistent_with_parent(struct inode *,
2142 struct inode *);
2143int f2fs_inherit_context(struct inode *, struct inode *, struct page *);
2144int f2fs_process_policy(const struct f2fs_encryption_policy *, struct inode *);
2145int f2fs_get_policy(struct inode *, struct f2fs_encryption_policy *);
57e5055b
JK
2146
2147/* crypt.c */
8bacf6de 2148extern struct kmem_cache *f2fs_crypt_info_cachep;
57e5055b
JK
2149bool f2fs_valid_contents_enc_mode(uint32_t);
2150uint32_t f2fs_validate_encryption_key_size(uint32_t, uint32_t);
2151struct f2fs_crypto_ctx *f2fs_get_crypto_ctx(struct inode *);
2152void f2fs_release_crypto_ctx(struct f2fs_crypto_ctx *);
2153struct page *f2fs_encrypt(struct inode *, struct page *);
2154int f2fs_decrypt(struct f2fs_crypto_ctx *, struct page *);
2155int f2fs_decrypt_one(struct inode *, struct page *);
2156void f2fs_end_io_crypto_work(struct f2fs_crypto_ctx *, struct bio *);
2157
0adda907 2158/* crypto_key.c */
26bf3dc7 2159void f2fs_free_encryption_info(struct inode *, struct f2fs_crypt_info *);
0adda907
JK
2160int _f2fs_get_encryption_info(struct inode *inode);
2161
6b3bd08f
JK
2162/* crypto_fname.c */
2163bool f2fs_valid_filenames_enc_mode(uint32_t);
2164u32 f2fs_fname_crypto_round_up(u32, u32);
2165int f2fs_fname_crypto_alloc_buffer(struct inode *, u32, struct f2fs_str *);
2166int f2fs_fname_disk_to_usr(struct inode *, f2fs_hash_t *,
2167 const struct f2fs_str *, struct f2fs_str *);
2168int f2fs_fname_usr_to_disk(struct inode *, const struct qstr *,
2169 struct f2fs_str *);
2170
57e5055b
JK
2171#ifdef CONFIG_F2FS_FS_ENCRYPTION
2172void f2fs_restore_and_release_control_page(struct page **);
2173void f2fs_restore_control_page(struct page *);
2174
cfc4d971
JK
2175int __init f2fs_init_crypto(void);
2176int f2fs_crypto_initialize(void);
57e5055b 2177void f2fs_exit_crypto(void);
0adda907
JK
2178
2179int f2fs_has_encryption_key(struct inode *);
2180
2181static inline int f2fs_get_encryption_info(struct inode *inode)
2182{
2183 struct f2fs_crypt_info *ci = F2FS_I(inode)->i_crypt_info;
2184
2185 if (!ci ||
2186 (ci->ci_keyring_key &&
2187 (ci->ci_keyring_key->flags & ((1 << KEY_FLAG_INVALIDATED) |
2188 (1 << KEY_FLAG_REVOKED) |
2189 (1 << KEY_FLAG_DEAD)))))
2190 return _f2fs_get_encryption_info(inode);
2191 return 0;
2192}
6b3bd08f 2193
6b3bd08f
JK
2194void f2fs_fname_crypto_free_buffer(struct f2fs_str *);
2195int f2fs_fname_setup_filename(struct inode *, const struct qstr *,
2196 int lookup, struct f2fs_filename *);
2197void f2fs_fname_free_filename(struct f2fs_filename *);
57e5055b
JK
2198#else
2199static inline void f2fs_restore_and_release_control_page(struct page **p) { }
2200static inline void f2fs_restore_control_page(struct page *p) { }
2201
cfc4d971 2202static inline int __init f2fs_init_crypto(void) { return 0; }
57e5055b 2203static inline void f2fs_exit_crypto(void) { }
0adda907
JK
2204
2205static inline int f2fs_has_encryption_key(struct inode *i) { return 0; }
2206static inline int f2fs_get_encryption_info(struct inode *i) { return 0; }
6b3bd08f
JK
2207static inline void f2fs_fname_crypto_free_buffer(struct f2fs_str *p) { }
2208
2209static inline int f2fs_fname_setup_filename(struct inode *dir,
2210 const struct qstr *iname,
2211 int lookup, struct f2fs_filename *fname)
2212{
2213 memset(fname, 0, sizeof(struct f2fs_filename));
2214 fname->usr_fname = iname;
2215 fname->disk_name.name = (unsigned char *)iname->name;
2216 fname->disk_name.len = iname->len;
2217 return 0;
2218}
2219
2220static inline void f2fs_fname_free_filename(struct f2fs_filename *fname) { }
57e5055b 2221#endif
39a53e0c 2222#endif