blob: 8d345c24bcf7e3a459bb5319f3e9e67bf4417b05 [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 */
Jaegeuk Kimf7ef9b82015-02-09 12:02:44 -080022#define F2FS_BLKSIZE_BITS 12 /* bits for F2FS_BLKSIZE */
Jaegeuk Kimdd318662012-11-02 17:06:26 +090023#define F2FS_MAX_EXTENSION 64 /* # of extension entries */
Changman Lee1dbe4152014-05-12 12:27:43 +090024#define F2FS_BLK_ALIGN(x) (((x) + F2FS_BLKSIZE - 1) / F2FS_BLKSIZE)
Jaegeuk Kimdd318662012-11-02 17:06:26 +090025
Jaegeuk Kima9841c42013-05-24 12:41:04 +090026#define NULL_ADDR ((block_t)0) /* used as block_t addresses */
27#define NEW_ADDR ((block_t)-1) /* used as block_t addresses */
Jaegeuk Kimdd318662012-11-02 17:06:26 +090028
Jaegeuk Kimf7ef9b82015-02-09 12:02:44 -080029#define F2FS_BYTES_TO_BLK(bytes) ((bytes) >> F2FS_BLKSIZE_BITS)
30#define F2FS_BLK_TO_BYTES(blk) ((blk) << F2FS_BLKSIZE_BITS)
31
Chao Yuc200b1a2014-08-20 18:36:46 +080032/* 0, 1(node nid), 2(meta nid) are reserved node id */
33#define F2FS_RESERVED_NODE_NUM 3
34
Jaegeuk Kimdd318662012-11-02 17:06:26 +090035#define F2FS_ROOT_INO(sbi) (sbi->root_ino_num)
36#define F2FS_NODE_INO(sbi) (sbi->node_ino_num)
37#define F2FS_META_INO(sbi) (sbi->meta_ino_num)
38
39/* This flag is used by node and meta inodes, and by recovery */
Jaegeuk Kima78186e2014-10-17 17:57:29 -070040#define GFP_F2FS_ZERO (GFP_NOFS | __GFP_ZERO)
41#define GFP_F2FS_HIGH_ZERO (GFP_NOFS | __GFP_ZERO | __GFP_HIGHMEM)
Jaegeuk Kimdd318662012-11-02 17:06:26 +090042
43/*
44 * For further optimization on multi-head logs, on-disk layout supports maximum
45 * 16 logs by default. The number, 16, is expected to cover all the cases
46 * enoughly. The implementaion currently uses no more than 6 logs.
47 * Half the logs are used for nodes, and the other half are used for data.
48 */
49#define MAX_ACTIVE_LOGS 16
50#define MAX_ACTIVE_NODE_LOGS 8
51#define MAX_ACTIVE_DATA_LOGS 8
52
Jaegeuk Kim0040b932015-04-20 11:52:23 -070053#define VERSION_LEN 256
54
Jaegeuk Kimdd318662012-11-02 17:06:26 +090055/*
56 * For superblock
57 */
58struct f2fs_super_block {
59 __le32 magic; /* Magic Number */
60 __le16 major_ver; /* Major Version */
61 __le16 minor_ver; /* Minor Version */
62 __le32 log_sectorsize; /* log2 sector size in bytes */
63 __le32 log_sectors_per_block; /* log2 # of sectors per block */
64 __le32 log_blocksize; /* log2 block size in bytes */
65 __le32 log_blocks_per_seg; /* log2 # of blocks per segment */
66 __le32 segs_per_sec; /* # of segments per section */
67 __le32 secs_per_zone; /* # of sections per zone */
68 __le32 checksum_offset; /* checksum offset inside super block */
69 __le64 block_count; /* total # of user blocks */
70 __le32 section_count; /* total # of sections */
71 __le32 segment_count; /* total # of segments */
72 __le32 segment_count_ckpt; /* # of segments for checkpoint */
73 __le32 segment_count_sit; /* # of segments for SIT */
74 __le32 segment_count_nat; /* # of segments for NAT */
75 __le32 segment_count_ssa; /* # of segments for SSA */
76 __le32 segment_count_main; /* # of segments for main area */
77 __le32 segment0_blkaddr; /* start block address of segment 0 */
78 __le32 cp_blkaddr; /* start block address of checkpoint */
79 __le32 sit_blkaddr; /* start block address of SIT */
80 __le32 nat_blkaddr; /* start block address of NAT */
81 __le32 ssa_blkaddr; /* start block address of SSA */
82 __le32 main_blkaddr; /* start block address of main area */
83 __le32 root_ino; /* root inode number */
84 __le32 node_ino; /* node inode number */
85 __le32 meta_ino; /* meta inode number */
86 __u8 uuid[16]; /* 128-bit uuid for volume */
87 __le16 volume_name[512]; /* volume name */
88 __le32 extension_count; /* # of extensions below */
89 __u8 extension_list[F2FS_MAX_EXTENSION][8]; /* extension array */
Changman Lee1dbe4152014-05-12 12:27:43 +090090 __le32 cp_payload;
Jaegeuk Kim0040b932015-04-20 11:52:23 -070091 __u8 version[VERSION_LEN]; /* the kernel version */
92 __u8 init_version[VERSION_LEN]; /* the initial kernel version */
93 __u8 reserved[892]; /* valid reserved region */
Jaegeuk Kimdd318662012-11-02 17:06:26 +090094} __packed;
95
96/*
97 * For checkpoint
98 */
Jaegeuk Kim119ee912015-01-29 11:45:33 -080099#define CP_FASTBOOT_FLAG 0x00000020
Jaegeuk Kim2ae4c672014-09-02 15:43:52 -0700100#define CP_FSCK_FLAG 0x00000010
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900101#define CP_ERROR_FLAG 0x00000008
102#define CP_COMPACT_SUM_FLAG 0x00000004
103#define CP_ORPHAN_PRESENT_FLAG 0x00000002
104#define CP_UMOUNT_FLAG 0x00000001
105
Chao Yub5b82202014-08-22 16:17:38 +0800106#define F2FS_CP_PACKS 2 /* # of checkpoint packs */
107
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900108struct f2fs_checkpoint {
109 __le64 checkpoint_ver; /* checkpoint block version number */
110 __le64 user_block_count; /* # of user blocks */
111 __le64 valid_block_count; /* # of valid blocks in main area */
112 __le32 rsvd_segment_count; /* # of reserved segments for gc */
113 __le32 overprov_segment_count; /* # of overprovision segments */
114 __le32 free_segment_count; /* # of free segments in main area */
115
116 /* information of current node segments */
117 __le32 cur_node_segno[MAX_ACTIVE_NODE_LOGS];
118 __le16 cur_node_blkoff[MAX_ACTIVE_NODE_LOGS];
119 /* information of current data segments */
120 __le32 cur_data_segno[MAX_ACTIVE_DATA_LOGS];
121 __le16 cur_data_blkoff[MAX_ACTIVE_DATA_LOGS];
122 __le32 ckpt_flags; /* Flags : umount and journal_present */
123 __le32 cp_pack_total_block_count; /* total # of one cp pack */
124 __le32 cp_pack_start_sum; /* start block number of data summary */
125 __le32 valid_node_count; /* Total number of valid nodes */
126 __le32 valid_inode_count; /* Total number of valid inodes */
127 __le32 next_free_nid; /* Next free node number */
128 __le32 sit_ver_bitmap_bytesize; /* Default value 64 */
129 __le32 nat_ver_bitmap_bytesize; /* Default value 256 */
130 __le32 checksum_offset; /* checksum offset inside cp block */
131 __le64 elapsed_time; /* mounted time */
132 /* allocation type of current segment */
133 unsigned char alloc_type[MAX_ACTIVE_LOGS];
134
135 /* SIT and NAT version bitmap */
136 unsigned char sit_nat_version_bitmap[1];
137} __packed;
138
139/*
140 * For orphan inode management
141 */
142#define F2FS_ORPHANS_PER_BLOCK 1020
143
Chao Yub5b82202014-08-22 16:17:38 +0800144#define GET_ORPHAN_BLOCKS(n) ((n + F2FS_ORPHANS_PER_BLOCK - 1) / \
145 F2FS_ORPHANS_PER_BLOCK)
146
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900147struct f2fs_orphan_block {
148 __le32 ino[F2FS_ORPHANS_PER_BLOCK]; /* inode numbers */
149 __le32 reserved; /* reserved */
150 __le16 blk_addr; /* block index in current CP */
151 __le16 blk_count; /* Number of orphan inode blocks in CP */
152 __le32 entry_count; /* Total number of orphan nodes in current CP */
153 __le32 check_sum; /* CRC32 for orphan inode block */
154} __packed;
155
156/*
157 * For NODE structure
158 */
159struct f2fs_extent {
160 __le32 fofs; /* start file offset of the extent */
Chao Yu4d0b0bd2015-02-05 17:47:25 +0800161 __le32 blk; /* start block address of the extent */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900162 __le32 len; /* lengh of the extent */
163} __packed;
164
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900165#define F2FS_NAME_LEN 255
Jaegeuk Kim65985d92013-08-14 21:57:27 +0900166#define F2FS_INLINE_XATTR_ADDRS 50 /* 200 bytes for inline xattrs */
Jaegeuk Kimde936532013-08-12 21:08:03 +0900167#define DEF_ADDRS_PER_INODE 923 /* Address Pointers in an Inode */
Chao Yub5b82202014-08-22 16:17:38 +0800168#define DEF_NIDS_PER_INODE 5 /* Node IDs in an Inode */
Jaegeuk Kimde936532013-08-12 21:08:03 +0900169#define ADDRS_PER_INODE(fi) addrs_per_inode(fi)
170#define ADDRS_PER_BLOCK 1018 /* Address Pointers in a Direct Block */
171#define NIDS_PER_BLOCK 1018 /* Node IDs in an Indirect Block */
172
Chao Yu6403eb12014-04-26 19:59:52 +0800173#define ADDRS_PER_PAGE(page, fi) \
174 (IS_INODE(page) ? ADDRS_PER_INODE(fi) : ADDRS_PER_BLOCK)
175
Jaegeuk Kimde936532013-08-12 21:08:03 +0900176#define NODE_DIR1_BLOCK (DEF_ADDRS_PER_INODE + 1)
177#define NODE_DIR2_BLOCK (DEF_ADDRS_PER_INODE + 2)
178#define NODE_IND1_BLOCK (DEF_ADDRS_PER_INODE + 3)
179#define NODE_IND2_BLOCK (DEF_ADDRS_PER_INODE + 4)
180#define NODE_DIND_BLOCK (DEF_ADDRS_PER_INODE + 5)
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900181
Jaegeuk Kim444c5802013-08-08 15:16:22 +0900182#define F2FS_INLINE_XATTR 0x01 /* file inline xattr flag */
Huajun Li1001b342013-11-10 23:13:16 +0800183#define F2FS_INLINE_DATA 0x02 /* file inline data flag */
Chao Yu34d67de2014-09-24 18:15:19 +0800184#define F2FS_INLINE_DENTRY 0x04 /* file inline dentry flag */
Jaegeuk Kimb3d208f2014-10-23 19:48:09 -0700185#define F2FS_DATA_EXIST 0x08 /* file inline data exist flag */
Jaegeuk Kim510022a2015-03-30 15:07:16 -0700186#define F2FS_INLINE_DOTS 0x10 /* file having implicit dot dentries */
Huajun Li1001b342013-11-10 23:13:16 +0800187
Huajun Li1001b342013-11-10 23:13:16 +0800188#define MAX_INLINE_DATA (sizeof(__le32) * (DEF_ADDRS_PER_INODE - \
189 F2FS_INLINE_XATTR_ADDRS - 1))
190
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900191struct f2fs_inode {
192 __le16 i_mode; /* file mode */
193 __u8 i_advise; /* file hints */
Jaegeuk Kim444c5802013-08-08 15:16:22 +0900194 __u8 i_inline; /* file inline flags */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900195 __le32 i_uid; /* user ID */
196 __le32 i_gid; /* group ID */
197 __le32 i_links; /* links count */
198 __le64 i_size; /* file size in bytes */
199 __le64 i_blocks; /* file size in blocks */
200 __le64 i_atime; /* access time */
201 __le64 i_ctime; /* change time */
202 __le64 i_mtime; /* modification time */
203 __le32 i_atime_nsec; /* access time in nano scale */
204 __le32 i_ctime_nsec; /* change time in nano scale */
205 __le32 i_mtime_nsec; /* modification time in nano scale */
206 __le32 i_generation; /* file version (for NFS) */
207 __le32 i_current_depth; /* only for directory depth */
208 __le32 i_xattr_nid; /* nid to save xattr */
209 __le32 i_flags; /* file attributes */
210 __le32 i_pino; /* parent inode number */
211 __le32 i_namelen; /* file name length */
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900212 __u8 i_name[F2FS_NAME_LEN]; /* file name for SPOR */
Jaegeuk Kim38431542014-02-27 18:20:00 +0900213 __u8 i_dir_level; /* dentry_level for large dir */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900214
215 struct f2fs_extent i_ext; /* caching a largest extent */
216
Jaegeuk Kimde936532013-08-12 21:08:03 +0900217 __le32 i_addr[DEF_ADDRS_PER_INODE]; /* Pointers to data blocks */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900218
Chao Yub5b82202014-08-22 16:17:38 +0800219 __le32 i_nid[DEF_NIDS_PER_INODE]; /* direct(2), indirect(2),
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900220 double_indirect(1) node id */
221} __packed;
222
223struct direct_node {
224 __le32 addr[ADDRS_PER_BLOCK]; /* array of data block address */
225} __packed;
226
227struct indirect_node {
228 __le32 nid[NIDS_PER_BLOCK]; /* array of data block address */
229} __packed;
230
231enum {
232 COLD_BIT_SHIFT = 0,
233 FSYNC_BIT_SHIFT,
234 DENT_BIT_SHIFT,
235 OFFSET_BIT_SHIFT
236};
237
Jaegeuk Kim09eb4832014-12-23 16:26:31 -0800238#define OFFSET_BIT_MASK (0x07) /* (0x01 << OFFSET_BIT_SHIFT) - 1 */
239
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900240struct node_footer {
241 __le32 nid; /* node id */
242 __le32 ino; /* inode nunmber */
243 __le32 flag; /* include cold/fsync/dentry marks and offset */
244 __le64 cp_ver; /* checkpoint version */
245 __le32 next_blkaddr; /* next node page block address */
246} __packed;
247
248struct f2fs_node {
249 /* can be one of three types: inode, direct, and indirect types */
250 union {
251 struct f2fs_inode i;
252 struct direct_node dn;
253 struct indirect_node in;
254 };
255 struct node_footer footer;
256} __packed;
257
258/*
259 * For NAT entries
260 */
261#define NAT_ENTRY_PER_BLOCK (PAGE_CACHE_SIZE / sizeof(struct f2fs_nat_entry))
262
263struct f2fs_nat_entry {
264 __u8 version; /* latest version of cached nat entry */
265 __le32 ino; /* inode number */
266 __le32 block_addr; /* block address */
267} __packed;
268
269struct f2fs_nat_block {
270 struct f2fs_nat_entry entries[NAT_ENTRY_PER_BLOCK];
271} __packed;
272
273/*
274 * For SIT entries
275 *
276 * Each segment is 2MB in size by default so that a bitmap for validity of
277 * there-in blocks should occupy 64 bytes, 512 bits.
278 * Not allow to change this.
279 */
280#define SIT_VBLOCK_MAP_SIZE 64
281#define SIT_ENTRY_PER_BLOCK (PAGE_CACHE_SIZE / sizeof(struct f2fs_sit_entry))
282
283/*
284 * Note that f2fs_sit_entry->vblocks has the following bit-field information.
285 * [15:10] : allocation type such as CURSEG_XXXX_TYPE
286 * [9:0] : valid block count
287 */
288#define SIT_VBLOCKS_SHIFT 10
289#define SIT_VBLOCKS_MASK ((1 << SIT_VBLOCKS_SHIFT) - 1)
290#define GET_SIT_VBLOCKS(raw_sit) \
291 (le16_to_cpu((raw_sit)->vblocks) & SIT_VBLOCKS_MASK)
292#define GET_SIT_TYPE(raw_sit) \
293 ((le16_to_cpu((raw_sit)->vblocks) & ~SIT_VBLOCKS_MASK) \
294 >> SIT_VBLOCKS_SHIFT)
295
296struct f2fs_sit_entry {
297 __le16 vblocks; /* reference above */
298 __u8 valid_map[SIT_VBLOCK_MAP_SIZE]; /* bitmap for valid blocks */
299 __le64 mtime; /* segment age for cleaning */
300} __packed;
301
302struct f2fs_sit_block {
303 struct f2fs_sit_entry entries[SIT_ENTRY_PER_BLOCK];
304} __packed;
305
306/*
307 * For segment summary
308 *
309 * One summary block contains exactly 512 summary entries, which represents
310 * exactly 2MB segment by default. Not allow to change the basic units.
311 *
312 * NOTE: For initializing fields, you must use set_summary
313 *
314 * - If data page, nid represents dnode's nid
315 * - If node page, nid represents the node page's nid.
316 *
317 * The ofs_in_node is used by only data page. It represents offset
318 * from node's page's beginning to get a data block address.
319 * ex) data_blkaddr = (block_t)(nodepage_start_address + ofs_in_node)
320 */
321#define ENTRIES_IN_SUM 512
Jaegeuk Kim25ca9232012-11-28 16:12:41 +0900322#define SUMMARY_SIZE (7) /* sizeof(struct summary) */
323#define SUM_FOOTER_SIZE (5) /* sizeof(struct summary_footer) */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900324#define SUM_ENTRY_SIZE (SUMMARY_SIZE * ENTRIES_IN_SUM)
325
326/* a summary entry for a 4KB-sized block in a segment */
327struct f2fs_summary {
328 __le32 nid; /* parent node id */
329 union {
330 __u8 reserved[3];
331 struct {
332 __u8 version; /* node version number */
333 __le16 ofs_in_node; /* block index in parent node */
334 } __packed;
335 };
336} __packed;
337
338/* summary block type, node or data, is stored to the summary_footer */
339#define SUM_TYPE_NODE (1)
340#define SUM_TYPE_DATA (0)
341
342struct summary_footer {
343 unsigned char entry_type; /* SUM_TYPE_XXX */
344 __u32 check_sum; /* summary checksum */
345} __packed;
346
Jaegeuk Kim25ca9232012-11-28 16:12:41 +0900347#define SUM_JOURNAL_SIZE (F2FS_BLKSIZE - SUM_FOOTER_SIZE -\
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900348 SUM_ENTRY_SIZE)
349#define NAT_JOURNAL_ENTRIES ((SUM_JOURNAL_SIZE - 2) /\
350 sizeof(struct nat_journal_entry))
351#define NAT_JOURNAL_RESERVED ((SUM_JOURNAL_SIZE - 2) %\
352 sizeof(struct nat_journal_entry))
353#define SIT_JOURNAL_ENTRIES ((SUM_JOURNAL_SIZE - 2) /\
354 sizeof(struct sit_journal_entry))
355#define SIT_JOURNAL_RESERVED ((SUM_JOURNAL_SIZE - 2) %\
356 sizeof(struct sit_journal_entry))
357/*
358 * frequently updated NAT/SIT entries can be stored in the spare area in
359 * summary blocks
360 */
361enum {
362 NAT_JOURNAL = 0,
363 SIT_JOURNAL
364};
365
366struct nat_journal_entry {
367 __le32 nid;
368 struct f2fs_nat_entry ne;
369} __packed;
370
371struct nat_journal {
372 struct nat_journal_entry entries[NAT_JOURNAL_ENTRIES];
373 __u8 reserved[NAT_JOURNAL_RESERVED];
374} __packed;
375
376struct sit_journal_entry {
377 __le32 segno;
378 struct f2fs_sit_entry se;
379} __packed;
380
381struct sit_journal {
382 struct sit_journal_entry entries[SIT_JOURNAL_ENTRIES];
383 __u8 reserved[SIT_JOURNAL_RESERVED];
384} __packed;
385
386/* 4KB-sized summary block structure */
387struct f2fs_summary_block {
388 struct f2fs_summary entries[ENTRIES_IN_SUM];
389 union {
390 __le16 n_nats;
391 __le16 n_sits;
392 };
393 /* spare area is used by NAT or SIT journals */
394 union {
395 struct nat_journal nat_j;
396 struct sit_journal sit_j;
397 };
398 struct summary_footer footer;
399} __packed;
400
401/*
402 * For directory operations
403 */
404#define F2FS_DOT_HASH 0
405#define F2FS_DDOT_HASH F2FS_DOT_HASH
406#define F2FS_MAX_HASH (~((0x3ULL) << 62))
407#define F2FS_HASH_COL_BIT ((0x1ULL) << 63)
408
409typedef __le32 f2fs_hash_t;
410
411/* One directory entry slot covers 8bytes-long file name */
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900412#define F2FS_SLOT_LEN 8
413#define F2FS_SLOT_LEN_BITS 3
Namjae Jeon457d08e2012-12-08 14:54:50 +0900414
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900415#define GET_DENTRY_SLOTS(x) ((x + F2FS_SLOT_LEN - 1) >> F2FS_SLOT_LEN_BITS)
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900416
417/* the number of dentry in a block */
418#define NR_DENTRY_IN_BLOCK 214
419
420/* MAX level for dir lookup */
421#define MAX_DIR_HASH_DEPTH 63
422
Chao Yubfec07d2014-05-28 08:56:09 +0800423/* MAX buckets in one level of dir */
424#define MAX_DIR_BUCKETS (1 << ((MAX_DIR_HASH_DEPTH / 2) - 1))
425
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900426#define SIZE_OF_DIR_ENTRY 11 /* by byte */
427#define SIZE_OF_DENTRY_BITMAP ((NR_DENTRY_IN_BLOCK + BITS_PER_BYTE - 1) / \
428 BITS_PER_BYTE)
429#define SIZE_OF_RESERVED (PAGE_SIZE - ((SIZE_OF_DIR_ENTRY + \
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900430 F2FS_SLOT_LEN) * \
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900431 NR_DENTRY_IN_BLOCK + SIZE_OF_DENTRY_BITMAP))
432
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900433/* One directory entry slot representing F2FS_SLOT_LEN-sized file name */
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900434struct f2fs_dir_entry {
435 __le32 hash_code; /* hash code of file name */
436 __le32 ino; /* inode number */
437 __le16 name_len; /* lengh of file name */
438 __u8 file_type; /* file type */
439} __packed;
440
441/* 4KB-sized directory entry block */
442struct f2fs_dentry_block {
443 /* validity bitmap for directory entries in each block */
444 __u8 dentry_bitmap[SIZE_OF_DENTRY_BITMAP];
445 __u8 reserved[SIZE_OF_RESERVED];
446 struct f2fs_dir_entry dentry[NR_DENTRY_IN_BLOCK];
Jaegeuk Kim5a20d332013-03-03 13:58:05 +0900447 __u8 filename[NR_DENTRY_IN_BLOCK][F2FS_SLOT_LEN];
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900448} __packed;
449
Chao Yu34d67de2014-09-24 18:15:19 +0800450/* for inline dir */
451#define NR_INLINE_DENTRY (MAX_INLINE_DATA * BITS_PER_BYTE / \
452 ((SIZE_OF_DIR_ENTRY + F2FS_SLOT_LEN) * \
453 BITS_PER_BYTE + 1))
454#define INLINE_DENTRY_BITMAP_SIZE ((NR_INLINE_DENTRY + \
455 BITS_PER_BYTE - 1) / BITS_PER_BYTE)
456#define INLINE_RESERVED_SIZE (MAX_INLINE_DATA - \
457 ((SIZE_OF_DIR_ENTRY + F2FS_SLOT_LEN) * \
458 NR_INLINE_DENTRY + INLINE_DENTRY_BITMAP_SIZE))
459
460/* inline directory entry structure */
461struct f2fs_inline_dentry {
462 __u8 dentry_bitmap[INLINE_DENTRY_BITMAP_SIZE];
463 __u8 reserved[INLINE_RESERVED_SIZE];
464 struct f2fs_dir_entry dentry[NR_INLINE_DENTRY];
465 __u8 filename[NR_INLINE_DENTRY][F2FS_SLOT_LEN];
466} __packed;
467
Jaegeuk Kimdd318662012-11-02 17:06:26 +0900468/* file types used in inode_info->flags */
469enum {
470 F2FS_FT_UNKNOWN,
471 F2FS_FT_REG_FILE,
472 F2FS_FT_DIR,
473 F2FS_FT_CHRDEV,
474 F2FS_FT_BLKDEV,
475 F2FS_FT_FIFO,
476 F2FS_FT_SOCK,
477 F2FS_FT_SYMLINK,
478 F2FS_FT_MAX
479};
480
481#endif /* _LINUX_F2FS_FS_H */