blob: 63f8303b79bade6021171bdc058fa618acd7609f [file] [log] [blame]
Jaegeuk Kimdd318662012-11-02 17:06:26 +09001/**
2 * include/linux/f2fs_fs.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_FS_H
12#define _LINUX_F2FS_FS_H
13
14#include <linux/pagemap.h>
15#include <linux/types.h>
16
17#define F2FS_SUPER_OFFSET 1024 /* byte-size offset */
Chao Yu55cf9cb2014-09-15 18:01:10 +080018#define F2FS_MIN_LOG_SECTOR_SIZE 9 /* 9 bits for 512 bytes */
19#define F2FS_MAX_LOG_SECTOR_SIZE 12 /* 12 bits for 4096 bytes */
20#define F2FS_LOG_SECTORS_PER_BLOCK 3 /* log number for sector/blk */
Jaegeuk Kimdd318662012-11-02 17:06:26 +090021#define F2FS_BLKSIZE 4096 /* support only 4KB block */
22#define F2FS_MAX_EXTENSION 64 /* # of extension entries */
Changman Lee1dbe4152014-05-12 12:27:43 +090023#define F2FS_BLK_ALIGN(x) (((x) + F2FS_BLKSIZE - 1) / F2FS_BLKSIZE)
Jaegeuk Kimdd318662012-11-02 17:06:26 +090024
Jaegeuk Kima9841c42013-05-24 12:41:04 +090025#define NULL_ADDR ((block_t)0) /* used as block_t addresses */
26#define NEW_ADDR ((block_t)-1) /* used as block_t addresses */
Jaegeuk Kimdd318662012-11-02 17:06:26 +090027
Chao Yuc200b1a2014-08-20 18:36:46 +080028/* 0, 1(node nid), 2(meta nid) are reserved node id */
29#define F2FS_RESERVED_NODE_NUM 3
30
Jaegeuk Kimdd318662012-11-02 17:06:26 +090031#define F2FS_ROOT_INO(sbi) (sbi->root_ino_num)
32#define F2FS_NODE_INO(sbi) (sbi->node_ino_num)
33#define F2FS_META_INO(sbi) (sbi->meta_ino_num)
34
35/* This flag is used by node and meta inodes, and by recovery */
Jaegeuk Kima78186e2014-10-17 17:57:29 -070036#define GFP_F2FS_ZERO (GFP_NOFS | __GFP_ZERO)
37#define GFP_F2FS_HIGH_ZERO (GFP_NOFS | __GFP_ZERO | __GFP_HIGHMEM)
Jaegeuk Kimdd318662012-11-02 17:06:26 +090038
39/*
40 * For further optimization on multi-head logs, on-disk layout supports maximum
41 * 16 logs by default. The number, 16, is expected to cover all the cases
42 * enoughly. The implementaion currently uses no more than 6 logs.
43 * Half the logs are used for nodes, and the other half are used for data.
44 */
45#define MAX_ACTIVE_LOGS 16
46#define MAX_ACTIVE_NODE_LOGS 8
47#define MAX_ACTIVE_DATA_LOGS 8
48
49/*
50 * For superblock
51 */
52struct f2fs_super_block {
53 __le32 magic; /* Magic Number */
54 __le16 major_ver; /* Major Version */
55 __le16 minor_ver; /* Minor Version */
56 __le32 log_sectorsize; /* log2 sector size in bytes */
57 __le32 log_sectors_per_block; /* log2 # of sectors per block */
58 __le32 log_blocksize; /* log2 block size in bytes */
59 __le32 log_blocks_per_seg; /* log2 # of blocks per segment */
60 __le32 segs_per_sec; /* # of segments per section */
61 __le32 secs_per_zone; /* # of sections per zone */
62 __le32 checksum_offset; /* checksum offset inside super block */
63 __le64 block_count; /* total # of user blocks */
64 __le32 section_count; /* total # of sections */
65 __le32 segment_count; /* total # of segments */
66 __le32 segment_count_ckpt; /* # of segments for checkpoint */
67 __le32 segment_count_sit; /* # of segments for SIT */
68 __le32 segment_count_nat; /* # of segments for NAT */
69 __le32 segment_count_ssa; /* # of segments for SSA */
70 __le32 segment_count_main; /* # of segments for main area */
71 __le32 segment0_blkaddr; /* start block address of segment 0 */
72 __le32 cp_blkaddr; /* start block address of checkpoint */
73 __le32 sit_blkaddr; /* start block address of SIT */
74 __le32 nat_blkaddr; /* start block address of NAT */
75 __le32 ssa_blkaddr; /* start block address of SSA */
76 __le32 main_blkaddr; /* start block address of main area */
77 __le32 root_ino; /* root inode number */
78 __le32 node_ino; /* node inode number */
79 __le32 meta_ino; /* meta inode number */
80 __u8 uuid[16]; /* 128-bit uuid for volume */
81 __le16 volume_name[512]; /* volume name */
82 __le32 extension_count; /* # of extensions below */
83 __u8 extension_list[F2FS_MAX_EXTENSION][8]; /* extension array */
Changman Lee1dbe4152014-05-12 12:27:43 +090084 __le32 cp_payload;
Jaegeuk Kimdd318662012-11-02 17:06:26 +090085} __packed;
86
87/*
88 * For checkpoint
89 */
Jaegeuk Kim2ae4c672014-09-02 15:43:52 -070090#define CP_FSCK_FLAG 0x00000010
Jaegeuk Kimdd318662012-11-02 17:06:26 +090091#define CP_ERROR_FLAG 0x00000008
92#define CP_COMPACT_SUM_FLAG 0x00000004
93#define CP_ORPHAN_PRESENT_FLAG 0x00000002
94#define CP_UMOUNT_FLAG 0x00000001
95
Chao Yub5b82202014-08-22 16:17:38 +080096#define F2FS_CP_PACKS 2 /* # of checkpoint packs */
97
Jaegeuk Kimdd318662012-11-02 17:06:26 +090098struct f2fs_checkpoint {
99 __le64 checkpoint_ver; /* checkpoint block version number */
100 __le64 user_block_count; /* # of user blocks */
101 __le64 valid_block_count; /* # of valid blocks in main area */
102 __le32 rsvd_segment_count; /* # of reserved segments for gc */
103 __le32 overprov_segment_count; /* # of overprovision segments */
104 __le32 free_segment_count; /* # of free segments in main area */
105
106 /* information of current node segments */
107 __le32 cur_node_segno[MAX_ACTIVE_NODE_LOGS];
108 __le16 cur_node_blkoff[MAX_ACTIVE_NODE_LOGS];
109 /* information of current data segments */
110 __le32 cur_data_segno[MAX_ACTIVE_DATA_LOGS];
111 __le16 cur_data_blkoff[MAX_ACTIVE_DATA_LOGS];
112 __le32 ckpt_flags; /* Flags : umount and journal_present */
113 __le32 cp_pack_total_block_count; /* total # of one cp pack */
114 __le32 cp_pack_start_sum; /* start block number of data summary */
115 __le32 valid_node_count; /* Total number of valid nodes */
116 __le32 valid_inode_count; /* Total number of valid inodes */
117 __le32 next_free_nid; /* Next free node number */
118 __le32 sit_ver_bitmap_bytesize; /* Default value 64 */
119 __le32 nat_ver_bitmap_bytesize; /* Default value 256 */
120 __le32 checksum_offset; /* checksum offset inside cp block */
121 __le64 elapsed_time; /* mounted time */
122 /* allocation type of current segment */
123 unsigned char alloc_type[MAX_ACTIVE_LOGS];
124
125 /* SIT and NAT version bitmap */
126 unsigned char sit_nat_version_bitmap[1];
127} __packed;
128
129/*
130 * For orphan inode management
131 */
132#define F2FS_ORPHANS_PER_BLOCK 1020
133
Chao Yub5b82202014-08-22 16:17:38 +0800134#define GET_ORPHAN_BLOCKS(n) ((n + F2FS_ORPHANS_PER_BLOCK - 1) / \
135 F2FS_ORPHANS_PER_BLOCK)
136
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900137struct f2fs_orphan_block {
138 __le32 ino[F2FS_ORPHANS_PER_BLOCK]; /* inode numbers */
139 __le32 reserved; /* reserved */
140 __le16 blk_addr; /* block index in current CP */
141 __le16 blk_count; /* Number of orphan inode blocks in CP */
142 __le32 entry_count; /* Total number of orphan nodes in current CP */
143 __le32 check_sum; /* CRC32 for orphan inode block */
144} __packed;
145
146/*
147 * For NODE structure
148 */
149struct f2fs_extent {
150 __le32 fofs; /* start file offset of the extent */
151 __le32 blk_addr; /* start block address of the extent */
152 __le32 len; /* lengh of the extent */
153} __packed;
154
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900155#define F2FS_NAME_LEN 255
Jaegeuk Kim65985d92013-08-14 21:57:27 +0900156#define F2FS_INLINE_XATTR_ADDRS 50 /* 200 bytes for inline xattrs */
Jaegeuk Kimde936532013-08-12 21:08:03 +0900157#define DEF_ADDRS_PER_INODE 923 /* Address Pointers in an Inode */
Chao Yub5b82202014-08-22 16:17:38 +0800158#define DEF_NIDS_PER_INODE 5 /* Node IDs in an Inode */
Jaegeuk Kimde936532013-08-12 21:08:03 +0900159#define ADDRS_PER_INODE(fi) addrs_per_inode(fi)
160#define ADDRS_PER_BLOCK 1018 /* Address Pointers in a Direct Block */
161#define NIDS_PER_BLOCK 1018 /* Node IDs in an Indirect Block */
162
Chao Yu6403eb12014-04-26 19:59:52 +0800163#define ADDRS_PER_PAGE(page, fi) \
164 (IS_INODE(page) ? ADDRS_PER_INODE(fi) : ADDRS_PER_BLOCK)
165
Jaegeuk Kimde936532013-08-12 21:08:03 +0900166#define NODE_DIR1_BLOCK (DEF_ADDRS_PER_INODE + 1)
167#define NODE_DIR2_BLOCK (DEF_ADDRS_PER_INODE + 2)
168#define NODE_IND1_BLOCK (DEF_ADDRS_PER_INODE + 3)
169#define NODE_IND2_BLOCK (DEF_ADDRS_PER_INODE + 4)
170#define NODE_DIND_BLOCK (DEF_ADDRS_PER_INODE + 5)
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900171
Jaegeuk Kim444c5802013-08-08 15:16:22 +0900172#define F2FS_INLINE_XATTR 0x01 /* file inline xattr flag */
Huajun Li1001b342013-11-10 23:13:16 +0800173#define F2FS_INLINE_DATA 0x02 /* file inline data flag */
Chao Yu34d67de2014-09-24 18:15:19 +0800174#define F2FS_INLINE_DENTRY 0x04 /* file inline dentry flag */
Huajun Li1001b342013-11-10 23:13:16 +0800175
Huajun Li1001b342013-11-10 23:13:16 +0800176#define MAX_INLINE_DATA (sizeof(__le32) * (DEF_ADDRS_PER_INODE - \
177 F2FS_INLINE_XATTR_ADDRS - 1))
178
Chao Yub5b82202014-08-22 16:17:38 +0800179#define INLINE_DATA_OFFSET (PAGE_CACHE_SIZE - sizeof(struct node_footer) -\
180 sizeof(__le32) * (DEF_ADDRS_PER_INODE + \
181 DEF_NIDS_PER_INODE - 1))
Jaegeuk Kim444c5802013-08-08 15:16:22 +0900182
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900183struct f2fs_inode {
184 __le16 i_mode; /* file mode */
185 __u8 i_advise; /* file hints */
Jaegeuk Kim444c5802013-08-08 15:16:22 +0900186 __u8 i_inline; /* file inline flags */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900187 __le32 i_uid; /* user ID */
188 __le32 i_gid; /* group ID */
189 __le32 i_links; /* links count */
190 __le64 i_size; /* file size in bytes */
191 __le64 i_blocks; /* file size in blocks */
192 __le64 i_atime; /* access time */
193 __le64 i_ctime; /* change time */
194 __le64 i_mtime; /* modification time */
195 __le32 i_atime_nsec; /* access time in nano scale */
196 __le32 i_ctime_nsec; /* change time in nano scale */
197 __le32 i_mtime_nsec; /* modification time in nano scale */
198 __le32 i_generation; /* file version (for NFS) */
199 __le32 i_current_depth; /* only for directory depth */
200 __le32 i_xattr_nid; /* nid to save xattr */
201 __le32 i_flags; /* file attributes */
202 __le32 i_pino; /* parent inode number */
203 __le32 i_namelen; /* file name length */
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900204 __u8 i_name[F2FS_NAME_LEN]; /* file name for SPOR */
Jaegeuk Kim38431542014-02-27 18:20:00 +0900205 __u8 i_dir_level; /* dentry_level for large dir */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900206
207 struct f2fs_extent i_ext; /* caching a largest extent */
208
Jaegeuk Kimde936532013-08-12 21:08:03 +0900209 __le32 i_addr[DEF_ADDRS_PER_INODE]; /* Pointers to data blocks */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900210
Chao Yub5b82202014-08-22 16:17:38 +0800211 __le32 i_nid[DEF_NIDS_PER_INODE]; /* direct(2), indirect(2),
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900212 double_indirect(1) node id */
213} __packed;
214
215struct direct_node {
216 __le32 addr[ADDRS_PER_BLOCK]; /* array of data block address */
217} __packed;
218
219struct indirect_node {
220 __le32 nid[NIDS_PER_BLOCK]; /* array of data block address */
221} __packed;
222
223enum {
224 COLD_BIT_SHIFT = 0,
225 FSYNC_BIT_SHIFT,
226 DENT_BIT_SHIFT,
227 OFFSET_BIT_SHIFT
228};
229
230struct node_footer {
231 __le32 nid; /* node id */
232 __le32 ino; /* inode nunmber */
233 __le32 flag; /* include cold/fsync/dentry marks and offset */
234 __le64 cp_ver; /* checkpoint version */
235 __le32 next_blkaddr; /* next node page block address */
236} __packed;
237
238struct f2fs_node {
239 /* can be one of three types: inode, direct, and indirect types */
240 union {
241 struct f2fs_inode i;
242 struct direct_node dn;
243 struct indirect_node in;
244 };
245 struct node_footer footer;
246} __packed;
247
248/*
249 * For NAT entries
250 */
251#define NAT_ENTRY_PER_BLOCK (PAGE_CACHE_SIZE / sizeof(struct f2fs_nat_entry))
252
253struct f2fs_nat_entry {
254 __u8 version; /* latest version of cached nat entry */
255 __le32 ino; /* inode number */
256 __le32 block_addr; /* block address */
257} __packed;
258
259struct f2fs_nat_block {
260 struct f2fs_nat_entry entries[NAT_ENTRY_PER_BLOCK];
261} __packed;
262
263/*
264 * For SIT entries
265 *
266 * Each segment is 2MB in size by default so that a bitmap for validity of
267 * there-in blocks should occupy 64 bytes, 512 bits.
268 * Not allow to change this.
269 */
270#define SIT_VBLOCK_MAP_SIZE 64
271#define SIT_ENTRY_PER_BLOCK (PAGE_CACHE_SIZE / sizeof(struct f2fs_sit_entry))
272
273/*
274 * Note that f2fs_sit_entry->vblocks has the following bit-field information.
275 * [15:10] : allocation type such as CURSEG_XXXX_TYPE
276 * [9:0] : valid block count
277 */
278#define SIT_VBLOCKS_SHIFT 10
279#define SIT_VBLOCKS_MASK ((1 << SIT_VBLOCKS_SHIFT) - 1)
280#define GET_SIT_VBLOCKS(raw_sit) \
281 (le16_to_cpu((raw_sit)->vblocks) & SIT_VBLOCKS_MASK)
282#define GET_SIT_TYPE(raw_sit) \
283 ((le16_to_cpu((raw_sit)->vblocks) & ~SIT_VBLOCKS_MASK) \
284 >> SIT_VBLOCKS_SHIFT)
285
286struct f2fs_sit_entry {
287 __le16 vblocks; /* reference above */
288 __u8 valid_map[SIT_VBLOCK_MAP_SIZE]; /* bitmap for valid blocks */
289 __le64 mtime; /* segment age for cleaning */
290} __packed;
291
292struct f2fs_sit_block {
293 struct f2fs_sit_entry entries[SIT_ENTRY_PER_BLOCK];
294} __packed;
295
296/*
297 * For segment summary
298 *
299 * One summary block contains exactly 512 summary entries, which represents
300 * exactly 2MB segment by default. Not allow to change the basic units.
301 *
302 * NOTE: For initializing fields, you must use set_summary
303 *
304 * - If data page, nid represents dnode's nid
305 * - If node page, nid represents the node page's nid.
306 *
307 * The ofs_in_node is used by only data page. It represents offset
308 * from node's page's beginning to get a data block address.
309 * ex) data_blkaddr = (block_t)(nodepage_start_address + ofs_in_node)
310 */
311#define ENTRIES_IN_SUM 512
Jaegeuk Kim25ca9232012-11-28 16:12:41 +0900312#define SUMMARY_SIZE (7) /* sizeof(struct summary) */
313#define SUM_FOOTER_SIZE (5) /* sizeof(struct summary_footer) */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900314#define SUM_ENTRY_SIZE (SUMMARY_SIZE * ENTRIES_IN_SUM)
315
316/* a summary entry for a 4KB-sized block in a segment */
317struct f2fs_summary {
318 __le32 nid; /* parent node id */
319 union {
320 __u8 reserved[3];
321 struct {
322 __u8 version; /* node version number */
323 __le16 ofs_in_node; /* block index in parent node */
324 } __packed;
325 };
326} __packed;
327
328/* summary block type, node or data, is stored to the summary_footer */
329#define SUM_TYPE_NODE (1)
330#define SUM_TYPE_DATA (0)
331
332struct summary_footer {
333 unsigned char entry_type; /* SUM_TYPE_XXX */
334 __u32 check_sum; /* summary checksum */
335} __packed;
336
Jaegeuk Kim25ca9232012-11-28 16:12:41 +0900337#define SUM_JOURNAL_SIZE (F2FS_BLKSIZE - SUM_FOOTER_SIZE -\
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900338 SUM_ENTRY_SIZE)
339#define NAT_JOURNAL_ENTRIES ((SUM_JOURNAL_SIZE - 2) /\
340 sizeof(struct nat_journal_entry))
341#define NAT_JOURNAL_RESERVED ((SUM_JOURNAL_SIZE - 2) %\
342 sizeof(struct nat_journal_entry))
343#define SIT_JOURNAL_ENTRIES ((SUM_JOURNAL_SIZE - 2) /\
344 sizeof(struct sit_journal_entry))
345#define SIT_JOURNAL_RESERVED ((SUM_JOURNAL_SIZE - 2) %\
346 sizeof(struct sit_journal_entry))
347/*
348 * frequently updated NAT/SIT entries can be stored in the spare area in
349 * summary blocks
350 */
351enum {
352 NAT_JOURNAL = 0,
353 SIT_JOURNAL
354};
355
356struct nat_journal_entry {
357 __le32 nid;
358 struct f2fs_nat_entry ne;
359} __packed;
360
361struct nat_journal {
362 struct nat_journal_entry entries[NAT_JOURNAL_ENTRIES];
363 __u8 reserved[NAT_JOURNAL_RESERVED];
364} __packed;
365
366struct sit_journal_entry {
367 __le32 segno;
368 struct f2fs_sit_entry se;
369} __packed;
370
371struct sit_journal {
372 struct sit_journal_entry entries[SIT_JOURNAL_ENTRIES];
373 __u8 reserved[SIT_JOURNAL_RESERVED];
374} __packed;
375
376/* 4KB-sized summary block structure */
377struct f2fs_summary_block {
378 struct f2fs_summary entries[ENTRIES_IN_SUM];
379 union {
380 __le16 n_nats;
381 __le16 n_sits;
382 };
383 /* spare area is used by NAT or SIT journals */
384 union {
385 struct nat_journal nat_j;
386 struct sit_journal sit_j;
387 };
388 struct summary_footer footer;
389} __packed;
390
391/*
392 * For directory operations
393 */
394#define F2FS_DOT_HASH 0
395#define F2FS_DDOT_HASH F2FS_DOT_HASH
396#define F2FS_MAX_HASH (~((0x3ULL) << 62))
397#define F2FS_HASH_COL_BIT ((0x1ULL) << 63)
398
399typedef __le32 f2fs_hash_t;
400
401/* One directory entry slot covers 8bytes-long file name */
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900402#define F2FS_SLOT_LEN 8
403#define F2FS_SLOT_LEN_BITS 3
Namjae Jeon457d08e2012-12-08 14:54:50 +0900404
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900405#define GET_DENTRY_SLOTS(x) ((x + F2FS_SLOT_LEN - 1) >> F2FS_SLOT_LEN_BITS)
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900406
407/* the number of dentry in a block */
408#define NR_DENTRY_IN_BLOCK 214
409
410/* MAX level for dir lookup */
411#define MAX_DIR_HASH_DEPTH 63
412
Chao Yubfec07d2014-05-28 08:56:09 +0800413/* MAX buckets in one level of dir */
414#define MAX_DIR_BUCKETS (1 << ((MAX_DIR_HASH_DEPTH / 2) - 1))
415
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900416#define SIZE_OF_DIR_ENTRY 11 /* by byte */
417#define SIZE_OF_DENTRY_BITMAP ((NR_DENTRY_IN_BLOCK + BITS_PER_BYTE - 1) / \
418 BITS_PER_BYTE)
419#define SIZE_OF_RESERVED (PAGE_SIZE - ((SIZE_OF_DIR_ENTRY + \
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900420 F2FS_SLOT_LEN) * \
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900421 NR_DENTRY_IN_BLOCK + SIZE_OF_DENTRY_BITMAP))
422
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900423/* One directory entry slot representing F2FS_SLOT_LEN-sized file name */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900424struct f2fs_dir_entry {
425 __le32 hash_code; /* hash code of file name */
426 __le32 ino; /* inode number */
427 __le16 name_len; /* lengh of file name */
428 __u8 file_type; /* file type */
429} __packed;
430
431/* 4KB-sized directory entry block */
432struct f2fs_dentry_block {
433 /* validity bitmap for directory entries in each block */
434 __u8 dentry_bitmap[SIZE_OF_DENTRY_BITMAP];
435 __u8 reserved[SIZE_OF_RESERVED];
436 struct f2fs_dir_entry dentry[NR_DENTRY_IN_BLOCK];
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900437 __u8 filename[NR_DENTRY_IN_BLOCK][F2FS_SLOT_LEN];
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900438} __packed;
439
Chao Yu34d67de2014-09-24 18:15:19 +0800440/* for inline dir */
441#define NR_INLINE_DENTRY (MAX_INLINE_DATA * BITS_PER_BYTE / \
442 ((SIZE_OF_DIR_ENTRY + F2FS_SLOT_LEN) * \
443 BITS_PER_BYTE + 1))
444#define INLINE_DENTRY_BITMAP_SIZE ((NR_INLINE_DENTRY + \
445 BITS_PER_BYTE - 1) / BITS_PER_BYTE)
446#define INLINE_RESERVED_SIZE (MAX_INLINE_DATA - \
447 ((SIZE_OF_DIR_ENTRY + F2FS_SLOT_LEN) * \
448 NR_INLINE_DENTRY + INLINE_DENTRY_BITMAP_SIZE))
449
450/* inline directory entry structure */
451struct f2fs_inline_dentry {
452 __u8 dentry_bitmap[INLINE_DENTRY_BITMAP_SIZE];
453 __u8 reserved[INLINE_RESERVED_SIZE];
454 struct f2fs_dir_entry dentry[NR_INLINE_DENTRY];
455 __u8 filename[NR_INLINE_DENTRY][F2FS_SLOT_LEN];
456} __packed;
457
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900458/* file types used in inode_info->flags */
459enum {
460 F2FS_FT_UNKNOWN,
461 F2FS_FT_REG_FILE,
462 F2FS_FT_DIR,
463 F2FS_FT_CHRDEV,
464 F2FS_FT_BLKDEV,
465 F2FS_FT_FIFO,
466 F2FS_FT_SOCK,
467 F2FS_FT_SYMLINK,
468 F2FS_FT_MAX
469};
470
471#endif /* _LINUX_F2FS_FS_H */