f2fs.rst 42 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945
  1. .. SPDX-License-Identifier: GPL-2.0
  2. ==========================================
  3. WHAT IS Flash-Friendly File System (F2FS)?
  4. ==========================================
  5. NAND flash memory-based storage devices, such as SSD, eMMC, and SD cards, have
  6. been equipped on a variety systems ranging from mobile to server systems. Since
  7. they are known to have different characteristics from the conventional rotating
  8. disks, a file system, an upper layer to the storage device, should adapt to the
  9. changes from the sketch in the design level.
  10. F2FS is a file system exploiting NAND flash memory-based storage devices, which
  11. is based on Log-structured File System (LFS). The design has been focused on
  12. addressing the fundamental issues in LFS, which are snowball effect of wandering
  13. tree and high cleaning overhead.
  14. Since a NAND flash memory-based storage device shows different characteristic
  15. according to its internal geometry or flash memory management scheme, namely FTL,
  16. F2FS and its tools support various parameters not only for configuring on-disk
  17. layout, but also for selecting allocation and cleaning algorithms.
  18. The following git tree provides the file system formatting tool (mkfs.f2fs),
  19. a consistency checking tool (fsck.f2fs), and a debugging tool (dump.f2fs).
  20. - git://git.kernel.org/pub/scm/linux/kernel/git/jaegeuk/f2fs-tools.git
  21. For sending patches, please use the following mailing list:
  22. - linux-f2fs-devel@lists.sourceforge.net
  23. For reporting bugs, please use the following f2fs bug tracker link:
  24. - https://bugzilla.kernel.org/enter_bug.cgi?product=File%20System&component=f2fs
  25. Background and Design issues
  26. ============================
  27. Log-structured File System (LFS)
  28. --------------------------------
  29. "A log-structured file system writes all modifications to disk sequentially in
  30. a log-like structure, thereby speeding up both file writing and crash recovery.
  31. The log is the only structure on disk; it contains indexing information so that
  32. files can be read back from the log efficiently. In order to maintain large free
  33. areas on disk for fast writing, we divide the log into segments and use a
  34. segment cleaner to compress the live information from heavily fragmented
  35. segments." from Rosenblum, M. and Ousterhout, J. K., 1992, "The design and
  36. implementation of a log-structured file system", ACM Trans. Computer Systems
  37. 10, 1, 26–52.
  38. Wandering Tree Problem
  39. ----------------------
  40. In LFS, when a file data is updated and written to the end of log, its direct
  41. pointer block is updated due to the changed location. Then the indirect pointer
  42. block is also updated due to the direct pointer block update. In this manner,
  43. the upper index structures such as inode, inode map, and checkpoint block are
  44. also updated recursively. This problem is called as wandering tree problem [1],
  45. and in order to enhance the performance, it should eliminate or relax the update
  46. propagation as much as possible.
  47. [1] Bityutskiy, A. 2005. JFFS3 design issues. http://www.linux-mtd.infradead.org/
  48. Cleaning Overhead
  49. -----------------
  50. Since LFS is based on out-of-place writes, it produces so many obsolete blocks
  51. scattered across the whole storage. In order to serve new empty log space, it
  52. needs to reclaim these obsolete blocks seamlessly to users. This job is called
  53. as a cleaning process.
  54. The process consists of three operations as follows.
  55. 1. A victim segment is selected through referencing segment usage table.
  56. 2. It loads parent index structures of all the data in the victim identified by
  57. segment summary blocks.
  58. 3. It checks the cross-reference between the data and its parent index structure.
  59. 4. It moves valid data selectively.
  60. This cleaning job may cause unexpected long delays, so the most important goal
  61. is to hide the latencies to users. And also definitely, it should reduce the
  62. amount of valid data to be moved, and move them quickly as well.
  63. Key Features
  64. ============
  65. Flash Awareness
  66. ---------------
  67. - Enlarge the random write area for better performance, but provide the high
  68. spatial locality
  69. - Align FS data structures to the operational units in FTL as best efforts
  70. Wandering Tree Problem
  71. ----------------------
  72. - Use a term, “node”, that represents inodes as well as various pointer blocks
  73. - Introduce Node Address Table (NAT) containing the locations of all the “node”
  74. blocks; this will cut off the update propagation.
  75. Cleaning Overhead
  76. -----------------
  77. - Support a background cleaning process
  78. - Support greedy and cost-benefit algorithms for victim selection policies
  79. - Support multi-head logs for static/dynamic hot and cold data separation
  80. - Introduce adaptive logging for efficient block allocation
  81. Mount Options
  82. =============
  83. ======================== ============================================================
  84. background_gc=%s Turn on/off cleaning operations, namely garbage
  85. collection, triggered in background when I/O subsystem is
  86. idle. If background_gc=on, it will turn on the garbage
  87. collection and if background_gc=off, garbage collection
  88. will be turned off. If background_gc=sync, it will turn
  89. on synchronous garbage collection running in background.
  90. Default value for this option is on. So garbage
  91. collection is on by default.
  92. gc_merge When background_gc is on, this option can be enabled to
  93. let background GC thread to handle foreground GC requests,
  94. it can eliminate the sluggish issue caused by slow foreground
  95. GC operation when GC is triggered from a process with limited
  96. I/O and CPU resources.
  97. nogc_merge Disable GC merge feature.
  98. disable_roll_forward Disable the roll-forward recovery routine
  99. norecovery Disable the roll-forward recovery routine, mounted read-
  100. only (i.e., -o ro,disable_roll_forward)
  101. discard/nodiscard Enable/disable real-time discard in f2fs, if discard is
  102. enabled, f2fs will issue discard/TRIM commands when a
  103. segment is cleaned.
  104. heap/no_heap Deprecated.
  105. nouser_xattr Disable Extended User Attributes. Note: xattr is enabled
  106. by default if CONFIG_F2FS_FS_XATTR is selected.
  107. noacl Disable POSIX Access Control List. Note: acl is enabled
  108. by default if CONFIG_F2FS_FS_POSIX_ACL is selected.
  109. active_logs=%u Support configuring the number of active logs. In the
  110. current design, f2fs supports only 2, 4, and 6 logs.
  111. Default number is 6.
  112. disable_ext_identify Disable the extension list configured by mkfs, so f2fs
  113. is not aware of cold files such as media files.
  114. inline_xattr Enable the inline xattrs feature.
  115. noinline_xattr Disable the inline xattrs feature.
  116. inline_xattr_size=%u Support configuring inline xattr size, it depends on
  117. flexible inline xattr feature.
  118. inline_data Enable the inline data feature: Newly created small (<~3.4k)
  119. files can be written into inode block.
  120. inline_dentry Enable the inline dir feature: data in newly created
  121. directory entries can be written into inode block. The
  122. space of inode block which is used to store inline
  123. dentries is limited to ~3.4k.
  124. noinline_dentry Disable the inline dentry feature.
  125. flush_merge Merge concurrent cache_flush commands as much as possible
  126. to eliminate redundant command issues. If the underlying
  127. device handles the cache_flush command relatively slowly,
  128. recommend to enable this option.
  129. nobarrier This option can be used if underlying storage guarantees
  130. its cached data should be written to the novolatile area.
  131. If this option is set, no cache_flush commands are issued
  132. but f2fs still guarantees the write ordering of all the
  133. data writes.
  134. barrier If this option is set, cache_flush commands are allowed to be
  135. issued.
  136. fastboot This option is used when a system wants to reduce mount
  137. time as much as possible, even though normal performance
  138. can be sacrificed.
  139. extent_cache Enable an extent cache based on rb-tree, it can cache
  140. as many as extent which map between contiguous logical
  141. address and physical address per inode, resulting in
  142. increasing the cache hit ratio. Set by default.
  143. noextent_cache Disable an extent cache based on rb-tree explicitly, see
  144. the above extent_cache mount option.
  145. noinline_data Disable the inline data feature, inline data feature is
  146. enabled by default.
  147. data_flush Enable data flushing before checkpoint in order to
  148. persist data of regular and symlink.
  149. reserve_root=%d Support configuring reserved space which is used for
  150. allocation from a privileged user with specified uid or
  151. gid, unit: 4KB, the default limit is 0.2% of user blocks.
  152. resuid=%d The user ID which may use the reserved blocks.
  153. resgid=%d The group ID which may use the reserved blocks.
  154. fault_injection=%d Enable fault injection in all supported types with
  155. specified injection rate.
  156. fault_type=%d Support configuring fault injection type, should be
  157. enabled with fault_injection option, fault type value
  158. is shown below, it supports single or combined type.
  159. =========================== ===========
  160. Type_Name Type_Value
  161. =========================== ===========
  162. FAULT_KMALLOC 0x000000001
  163. FAULT_KVMALLOC 0x000000002
  164. FAULT_PAGE_ALLOC 0x000000004
  165. FAULT_PAGE_GET 0x000000008
  166. FAULT_ALLOC_BIO 0x000000010 (obsolete)
  167. FAULT_ALLOC_NID 0x000000020
  168. FAULT_ORPHAN 0x000000040
  169. FAULT_BLOCK 0x000000080
  170. FAULT_DIR_DEPTH 0x000000100
  171. FAULT_EVICT_INODE 0x000000200
  172. FAULT_TRUNCATE 0x000000400
  173. FAULT_READ_IO 0x000000800
  174. FAULT_CHECKPOINT 0x000001000
  175. FAULT_DISCARD 0x000002000
  176. FAULT_WRITE_IO 0x000004000
  177. FAULT_SLAB_ALLOC 0x000008000
  178. FAULT_DQUOT_INIT 0x000010000
  179. FAULT_LOCK_OP 0x000020000
  180. FAULT_BLKADDR_VALIDITY 0x000040000
  181. FAULT_BLKADDR_CONSISTENCE 0x000080000
  182. FAULT_NO_SEGMENT 0x000100000
  183. =========================== ===========
  184. mode=%s Control block allocation mode which supports "adaptive"
  185. and "lfs". In "lfs" mode, there should be no random
  186. writes towards main area.
  187. "fragment:segment" and "fragment:block" are newly added here.
  188. These are developer options for experiments to simulate filesystem
  189. fragmentation/after-GC situation itself. The developers use these
  190. modes to understand filesystem fragmentation/after-GC condition well,
  191. and eventually get some insights to handle them better.
  192. In "fragment:segment", f2fs allocates a new segment in ramdom
  193. position. With this, we can simulate the after-GC condition.
  194. In "fragment:block", we can scatter block allocation with
  195. "max_fragment_chunk" and "max_fragment_hole" sysfs nodes.
  196. We added some randomness to both chunk and hole size to make
  197. it close to realistic IO pattern. So, in this mode, f2fs will allocate
  198. 1..<max_fragment_chunk> blocks in a chunk and make a hole in the
  199. length of 1..<max_fragment_hole> by turns. With this, the newly
  200. allocated blocks will be scattered throughout the whole partition.
  201. Note that "fragment:block" implicitly enables "fragment:segment"
  202. option for more randomness.
  203. Please, use these options for your experiments and we strongly
  204. recommend to re-format the filesystem after using these options.
  205. usrquota Enable plain user disk quota accounting.
  206. grpquota Enable plain group disk quota accounting.
  207. prjquota Enable plain project quota accounting.
  208. usrjquota=<file> Appoint specified file and type during mount, so that quota
  209. grpjquota=<file> information can be properly updated during recovery flow,
  210. prjjquota=<file> <quota file>: must be in root directory;
  211. jqfmt=<quota type> <quota type>: [vfsold,vfsv0,vfsv1].
  212. usrjquota= Turn off user journalled quota.
  213. grpjquota= Turn off group journalled quota.
  214. prjjquota= Turn off project journalled quota.
  215. quota Enable plain user disk quota accounting.
  216. noquota Disable all plain disk quota option.
  217. alloc_mode=%s Adjust block allocation policy, which supports "reuse"
  218. and "default".
  219. fsync_mode=%s Control the policy of fsync. Currently supports "posix",
  220. "strict", and "nobarrier". In "posix" mode, which is
  221. default, fsync will follow POSIX semantics and does a
  222. light operation to improve the filesystem performance.
  223. In "strict" mode, fsync will be heavy and behaves in line
  224. with xfs, ext4 and btrfs, where xfstest generic/342 will
  225. pass, but the performance will regress. "nobarrier" is
  226. based on "posix", but doesn't issue flush command for
  227. non-atomic files likewise "nobarrier" mount option.
  228. test_dummy_encryption
  229. test_dummy_encryption=%s
  230. Enable dummy encryption, which provides a fake fscrypt
  231. context. The fake fscrypt context is used by xfstests.
  232. The argument may be either "v1" or "v2", in order to
  233. select the corresponding fscrypt policy version.
  234. checkpoint=%s[:%u[%]] Set to "disable" to turn off checkpointing. Set to "enable"
  235. to reenable checkpointing. Is enabled by default. While
  236. disabled, any unmounting or unexpected shutdowns will cause
  237. the filesystem contents to appear as they did when the
  238. filesystem was mounted with that option.
  239. While mounting with checkpoint=disable, the filesystem must
  240. run garbage collection to ensure that all available space can
  241. be used. If this takes too much time, the mount may return
  242. EAGAIN. You may optionally add a value to indicate how much
  243. of the disk you would be willing to temporarily give up to
  244. avoid additional garbage collection. This can be given as a
  245. number of blocks, or as a percent. For instance, mounting
  246. with checkpoint=disable:100% would always succeed, but it may
  247. hide up to all remaining free space. The actual space that
  248. would be unusable can be viewed at /sys/fs/f2fs/<disk>/unusable
  249. This space is reclaimed once checkpoint=enable.
  250. checkpoint_merge When checkpoint is enabled, this can be used to create a kernel
  251. daemon and make it to merge concurrent checkpoint requests as
  252. much as possible to eliminate redundant checkpoint issues. Plus,
  253. we can eliminate the sluggish issue caused by slow checkpoint
  254. operation when the checkpoint is done in a process context in
  255. a cgroup having low i/o budget and cpu shares. To make this
  256. do better, we set the default i/o priority of the kernel daemon
  257. to "3", to give one higher priority than other kernel threads.
  258. This is the same way to give a I/O priority to the jbd2
  259. journaling thread of ext4 filesystem.
  260. nocheckpoint_merge Disable checkpoint merge feature.
  261. compress_algorithm=%s Control compress algorithm, currently f2fs supports "lzo",
  262. "lz4", "zstd" and "lzo-rle" algorithm.
  263. compress_algorithm=%s:%d Control compress algorithm and its compress level, now, only
  264. "lz4" and "zstd" support compress level config.
  265. algorithm level range
  266. lz4 3 - 16
  267. zstd 1 - 22
  268. compress_log_size=%u Support configuring compress cluster size. The size will
  269. be 4KB * (1 << %u). The default and minimum sizes are 16KB.
  270. compress_extension=%s Support adding specified extension, so that f2fs can enable
  271. compression on those corresponding files, e.g. if all files
  272. with '.ext' has high compression rate, we can set the '.ext'
  273. on compression extension list and enable compression on
  274. these file by default rather than to enable it via ioctl.
  275. For other files, we can still enable compression via ioctl.
  276. Note that, there is one reserved special extension '*', it
  277. can be set to enable compression for all files.
  278. nocompress_extension=%s Support adding specified extension, so that f2fs can disable
  279. compression on those corresponding files, just contrary to compression extension.
  280. If you know exactly which files cannot be compressed, you can use this.
  281. The same extension name can't appear in both compress and nocompress
  282. extension at the same time.
  283. If the compress extension specifies all files, the types specified by the
  284. nocompress extension will be treated as special cases and will not be compressed.
  285. Don't allow use '*' to specifie all file in nocompress extension.
  286. After add nocompress_extension, the priority should be:
  287. dir_flag < comp_extention,nocompress_extension < comp_file_flag,no_comp_file_flag.
  288. See more in compression sections.
  289. compress_chksum Support verifying chksum of raw data in compressed cluster.
  290. compress_mode=%s Control file compression mode. This supports "fs" and "user"
  291. modes. In "fs" mode (default), f2fs does automatic compression
  292. on the compression enabled files. In "user" mode, f2fs disables
  293. the automaic compression and gives the user discretion of
  294. choosing the target file and the timing. The user can do manual
  295. compression/decompression on the compression enabled files using
  296. ioctls.
  297. compress_cache Support to use address space of a filesystem managed inode to
  298. cache compressed block, in order to improve cache hit ratio of
  299. random read.
  300. inlinecrypt When possible, encrypt/decrypt the contents of encrypted
  301. files using the blk-crypto framework rather than
  302. filesystem-layer encryption. This allows the use of
  303. inline encryption hardware. The on-disk format is
  304. unaffected. For more details, see
  305. Documentation/block/inline-encryption.rst.
  306. atgc Enable age-threshold garbage collection, it provides high
  307. effectiveness and efficiency on background GC.
  308. discard_unit=%s Control discard unit, the argument can be "block", "segment"
  309. and "section", issued discard command's offset/size will be
  310. aligned to the unit, by default, "discard_unit=block" is set,
  311. so that small discard functionality is enabled.
  312. For blkzoned device, "discard_unit=section" will be set by
  313. default, it is helpful for large sized SMR or ZNS devices to
  314. reduce memory cost by getting rid of fs metadata supports small
  315. discard.
  316. memory=%s Control memory mode. This supports "normal" and "low" modes.
  317. "low" mode is introduced to support low memory devices.
  318. Because of the nature of low memory devices, in this mode, f2fs
  319. will try to save memory sometimes by sacrificing performance.
  320. "normal" mode is the default mode and same as before.
  321. age_extent_cache Enable an age extent cache based on rb-tree. It records
  322. data block update frequency of the extent per inode, in
  323. order to provide better temperature hints for data block
  324. allocation.
  325. errors=%s Specify f2fs behavior on critical errors. This supports modes:
  326. "panic", "continue" and "remount-ro", respectively, trigger
  327. panic immediately, continue without doing anything, and remount
  328. the partition in read-only mode. By default it uses "continue"
  329. mode.
  330. ====================== =============== =============== ========
  331. mode continue remount-ro panic
  332. ====================== =============== =============== ========
  333. access ops normal normal N/A
  334. syscall errors -EIO -EROFS N/A
  335. mount option rw ro N/A
  336. pending dir write keep keep N/A
  337. pending non-dir write drop keep N/A
  338. pending node write drop keep N/A
  339. pending meta write keep keep N/A
  340. ====================== =============== =============== ========
  341. ======================== ============================================================
  342. Debugfs Entries
  343. ===============
  344. /sys/kernel/debug/f2fs/ contains information about all the partitions mounted as
  345. f2fs. Each file shows the whole f2fs information.
  346. /sys/kernel/debug/f2fs/status includes:
  347. - major file system information managed by f2fs currently
  348. - average SIT information about whole segments
  349. - current memory footprint consumed by f2fs.
  350. Sysfs Entries
  351. =============
  352. Information about mounted f2fs file systems can be found in
  353. /sys/fs/f2fs. Each mounted filesystem will have a directory in
  354. /sys/fs/f2fs based on its device name (i.e., /sys/fs/f2fs/sda).
  355. The files in each per-device directory are shown in table below.
  356. Files in /sys/fs/f2fs/<devname>
  357. (see also Documentation/ABI/testing/sysfs-fs-f2fs)
  358. Usage
  359. =====
  360. 1. Download userland tools and compile them.
  361. 2. Skip, if f2fs was compiled statically inside kernel.
  362. Otherwise, insert the f2fs.ko module::
  363. # insmod f2fs.ko
  364. 3. Create a directory to use when mounting::
  365. # mkdir /mnt/f2fs
  366. 4. Format the block device, and then mount as f2fs::
  367. # mkfs.f2fs -l label /dev/block_device
  368. # mount -t f2fs /dev/block_device /mnt/f2fs
  369. mkfs.f2fs
  370. ---------
  371. The mkfs.f2fs is for the use of formatting a partition as the f2fs filesystem,
  372. which builds a basic on-disk layout.
  373. The quick options consist of:
  374. =============== ===========================================================
  375. ``-l [label]`` Give a volume label, up to 512 unicode name.
  376. ``-a [0 or 1]`` Split start location of each area for heap-based allocation.
  377. 1 is set by default, which performs this.
  378. ``-o [int]`` Set overprovision ratio in percent over volume size.
  379. 5 is set by default.
  380. ``-s [int]`` Set the number of segments per section.
  381. 1 is set by default.
  382. ``-z [int]`` Set the number of sections per zone.
  383. 1 is set by default.
  384. ``-e [str]`` Set basic extension list. e.g. "mp3,gif,mov"
  385. ``-t [0 or 1]`` Disable discard command or not.
  386. 1 is set by default, which conducts discard.
  387. =============== ===========================================================
  388. Note: please refer to the manpage of mkfs.f2fs(8) to get full option list.
  389. fsck.f2fs
  390. ---------
  391. The fsck.f2fs is a tool to check the consistency of an f2fs-formatted
  392. partition, which examines whether the filesystem metadata and user-made data
  393. are cross-referenced correctly or not.
  394. Note that, initial version of the tool does not fix any inconsistency.
  395. The quick options consist of::
  396. -d debug level [default:0]
  397. Note: please refer to the manpage of fsck.f2fs(8) to get full option list.
  398. dump.f2fs
  399. ---------
  400. The dump.f2fs shows the information of specific inode and dumps SSA and SIT to
  401. file. Each file is dump_ssa and dump_sit.
  402. The dump.f2fs is used to debug on-disk data structures of the f2fs filesystem.
  403. It shows on-disk inode information recognized by a given inode number, and is
  404. able to dump all the SSA and SIT entries into predefined files, ./dump_ssa and
  405. ./dump_sit respectively.
  406. The options consist of::
  407. -d debug level [default:0]
  408. -i inode no (hex)
  409. -s [SIT dump segno from #1~#2 (decimal), for all 0~-1]
  410. -a [SSA dump segno from #1~#2 (decimal), for all 0~-1]
  411. Examples::
  412. # dump.f2fs -i [ino] /dev/sdx
  413. # dump.f2fs -s 0~-1 /dev/sdx (SIT dump)
  414. # dump.f2fs -a 0~-1 /dev/sdx (SSA dump)
  415. Note: please refer to the manpage of dump.f2fs(8) to get full option list.
  416. sload.f2fs
  417. ----------
  418. The sload.f2fs gives a way to insert files and directories in the existing disk
  419. image. This tool is useful when building f2fs images given compiled files.
  420. Note: please refer to the manpage of sload.f2fs(8) to get full option list.
  421. resize.f2fs
  422. -----------
  423. The resize.f2fs lets a user resize the f2fs-formatted disk image, while preserving
  424. all the files and directories stored in the image.
  425. Note: please refer to the manpage of resize.f2fs(8) to get full option list.
  426. defrag.f2fs
  427. -----------
  428. The defrag.f2fs can be used to defragment scattered written data as well as
  429. filesystem metadata across the disk. This can improve the write speed by giving
  430. more free consecutive space.
  431. Note: please refer to the manpage of defrag.f2fs(8) to get full option list.
  432. f2fs_io
  433. -------
  434. The f2fs_io is a simple tool to issue various filesystem APIs as well as
  435. f2fs-specific ones, which is very useful for QA tests.
  436. Note: please refer to the manpage of f2fs_io(8) to get full option list.
  437. Design
  438. ======
  439. On-disk Layout
  440. --------------
  441. F2FS divides the whole volume into a number of segments, each of which is fixed
  442. to 2MB in size. A section is composed of consecutive segments, and a zone
  443. consists of a set of sections. By default, section and zone sizes are set to one
  444. segment size identically, but users can easily modify the sizes by mkfs.
  445. F2FS splits the entire volume into six areas, and all the areas except superblock
  446. consist of multiple segments as described below::
  447. align with the zone size <-|
  448. |-> align with the segment size
  449. _________________________________________________________________________
  450. | | | Segment | Node | Segment | |
  451. | Superblock | Checkpoint | Info. | Address | Summary | Main |
  452. | (SB) | (CP) | Table (SIT) | Table (NAT) | Area (SSA) | |
  453. |____________|_____2______|______N______|______N______|______N_____|__N___|
  454. . .
  455. . .
  456. . .
  457. ._________________________________________.
  458. |_Segment_|_..._|_Segment_|_..._|_Segment_|
  459. . .
  460. ._________._________
  461. |_section_|__...__|_
  462. . .
  463. .________.
  464. |__zone__|
  465. - Superblock (SB)
  466. It is located at the beginning of the partition, and there exist two copies
  467. to avoid file system crash. It contains basic partition information and some
  468. default parameters of f2fs.
  469. - Checkpoint (CP)
  470. It contains file system information, bitmaps for valid NAT/SIT sets, orphan
  471. inode lists, and summary entries of current active segments.
  472. - Segment Information Table (SIT)
  473. It contains segment information such as valid block count and bitmap for the
  474. validity of all the blocks.
  475. - Node Address Table (NAT)
  476. It is composed of a block address table for all the node blocks stored in
  477. Main area.
  478. - Segment Summary Area (SSA)
  479. It contains summary entries which contains the owner information of all the
  480. data and node blocks stored in Main area.
  481. - Main Area
  482. It contains file and directory data including their indices.
  483. In order to avoid misalignment between file system and flash-based storage, F2FS
  484. aligns the start block address of CP with the segment size. Also, it aligns the
  485. start block address of Main area with the zone size by reserving some segments
  486. in SSA area.
  487. Reference the following survey for additional technical details.
  488. https://wiki.linaro.org/WorkingGroups/Kernel/Projects/FlashCardSurvey
  489. File System Metadata Structure
  490. ------------------------------
  491. F2FS adopts the checkpointing scheme to maintain file system consistency. At
  492. mount time, F2FS first tries to find the last valid checkpoint data by scanning
  493. CP area. In order to reduce the scanning time, F2FS uses only two copies of CP.
  494. One of them always indicates the last valid data, which is called as shadow copy
  495. mechanism. In addition to CP, NAT and SIT also adopt the shadow copy mechanism.
  496. For file system consistency, each CP points to which NAT and SIT copies are
  497. valid, as shown as below::
  498. +--------+----------+---------+
  499. | CP | SIT | NAT |
  500. +--------+----------+---------+
  501. . . . .
  502. . . . .
  503. . . . .
  504. +-------+-------+--------+--------+--------+--------+
  505. | CP #0 | CP #1 | SIT #0 | SIT #1 | NAT #0 | NAT #1 |
  506. +-------+-------+--------+--------+--------+--------+
  507. | ^ ^
  508. | | |
  509. `----------------------------------------'
  510. Index Structure
  511. ---------------
  512. The key data structure to manage the data locations is a "node". Similar to
  513. traditional file structures, F2FS has three types of node: inode, direct node,
  514. indirect node. F2FS assigns 4KB to an inode block which contains 923 data block
  515. indices, two direct node pointers, two indirect node pointers, and one double
  516. indirect node pointer as described below. One direct node block contains 1018
  517. data blocks, and one indirect node block contains also 1018 node blocks. Thus,
  518. one inode block (i.e., a file) covers::
  519. 4KB * (923 + 2 * 1018 + 2 * 1018 * 1018 + 1018 * 1018 * 1018) := 3.94TB.
  520. Inode block (4KB)
  521. |- data (923)
  522. |- direct node (2)
  523. | `- data (1018)
  524. |- indirect node (2)
  525. | `- direct node (1018)
  526. | `- data (1018)
  527. `- double indirect node (1)
  528. `- indirect node (1018)
  529. `- direct node (1018)
  530. `- data (1018)
  531. Note that all the node blocks are mapped by NAT which means the location of
  532. each node is translated by the NAT table. In the consideration of the wandering
  533. tree problem, F2FS is able to cut off the propagation of node updates caused by
  534. leaf data writes.
  535. Directory Structure
  536. -------------------
  537. A directory entry occupies 11 bytes, which consists of the following attributes.
  538. - hash hash value of the file name
  539. - ino inode number
  540. - len the length of file name
  541. - type file type such as directory, symlink, etc
  542. A dentry block consists of 214 dentry slots and file names. Therein a bitmap is
  543. used to represent whether each dentry is valid or not. A dentry block occupies
  544. 4KB with the following composition.
  545. ::
  546. Dentry Block(4 K) = bitmap (27 bytes) + reserved (3 bytes) +
  547. dentries(11 * 214 bytes) + file name (8 * 214 bytes)
  548. [Bucket]
  549. +--------------------------------+
  550. |dentry block 1 | dentry block 2 |
  551. +--------------------------------+
  552. . .
  553. . .
  554. . [Dentry Block Structure: 4KB] .
  555. +--------+----------+----------+------------+
  556. | bitmap | reserved | dentries | file names |
  557. +--------+----------+----------+------------+
  558. [Dentry Block: 4KB] . .
  559. . .
  560. . .
  561. +------+------+-----+------+
  562. | hash | ino | len | type |
  563. +------+------+-----+------+
  564. [Dentry Structure: 11 bytes]
  565. F2FS implements multi-level hash tables for directory structure. Each level has
  566. a hash table with dedicated number of hash buckets as shown below. Note that
  567. "A(2B)" means a bucket includes 2 data blocks.
  568. ::
  569. ----------------------
  570. A : bucket
  571. B : block
  572. N : MAX_DIR_HASH_DEPTH
  573. ----------------------
  574. level #0 | A(2B)
  575. |
  576. level #1 | A(2B) - A(2B)
  577. |
  578. level #2 | A(2B) - A(2B) - A(2B) - A(2B)
  579. . | . . . .
  580. level #N/2 | A(2B) - A(2B) - A(2B) - A(2B) - A(2B) - ... - A(2B)
  581. . | . . . .
  582. level #N | A(4B) - A(4B) - A(4B) - A(4B) - A(4B) - ... - A(4B)
  583. The number of blocks and buckets are determined by::
  584. ,- 2, if n < MAX_DIR_HASH_DEPTH / 2,
  585. # of blocks in level #n = |
  586. `- 4, Otherwise
  587. ,- 2^(n + dir_level),
  588. | if n + dir_level < MAX_DIR_HASH_DEPTH / 2,
  589. # of buckets in level #n = |
  590. `- 2^((MAX_DIR_HASH_DEPTH / 2) - 1),
  591. Otherwise
  592. When F2FS finds a file name in a directory, at first a hash value of the file
  593. name is calculated. Then, F2FS scans the hash table in level #0 to find the
  594. dentry consisting of the file name and its inode number. If not found, F2FS
  595. scans the next hash table in level #1. In this way, F2FS scans hash tables in
  596. each levels incrementally from 1 to N. In each level F2FS needs to scan only
  597. one bucket determined by the following equation, which shows O(log(# of files))
  598. complexity::
  599. bucket number to scan in level #n = (hash value) % (# of buckets in level #n)
  600. In the case of file creation, F2FS finds empty consecutive slots that cover the
  601. file name. F2FS searches the empty slots in the hash tables of whole levels from
  602. 1 to N in the same way as the lookup operation.
  603. The following figure shows an example of two cases holding children::
  604. --------------> Dir <--------------
  605. | |
  606. child child
  607. child - child [hole] - child
  608. child - child - child [hole] - [hole] - child
  609. Case 1: Case 2:
  610. Number of children = 6, Number of children = 3,
  611. File size = 7 File size = 7
  612. Default Block Allocation
  613. ------------------------
  614. At runtime, F2FS manages six active logs inside "Main" area: Hot/Warm/Cold node
  615. and Hot/Warm/Cold data.
  616. - Hot node contains direct node blocks of directories.
  617. - Warm node contains direct node blocks except hot node blocks.
  618. - Cold node contains indirect node blocks
  619. - Hot data contains dentry blocks
  620. - Warm data contains data blocks except hot and cold data blocks
  621. - Cold data contains multimedia data or migrated data blocks
  622. LFS has two schemes for free space management: threaded log and copy-and-compac-
  623. tion. The copy-and-compaction scheme which is known as cleaning, is well-suited
  624. for devices showing very good sequential write performance, since free segments
  625. are served all the time for writing new data. However, it suffers from cleaning
  626. overhead under high utilization. Contrarily, the threaded log scheme suffers
  627. from random writes, but no cleaning process is needed. F2FS adopts a hybrid
  628. scheme where the copy-and-compaction scheme is adopted by default, but the
  629. policy is dynamically changed to the threaded log scheme according to the file
  630. system status.
  631. In order to align F2FS with underlying flash-based storage, F2FS allocates a
  632. segment in a unit of section. F2FS expects that the section size would be the
  633. same as the unit size of garbage collection in FTL. Furthermore, with respect
  634. to the mapping granularity in FTL, F2FS allocates each section of the active
  635. logs from different zones as much as possible, since FTL can write the data in
  636. the active logs into one allocation unit according to its mapping granularity.
  637. Cleaning process
  638. ----------------
  639. F2FS does cleaning both on demand and in the background. On-demand cleaning is
  640. triggered when there are not enough free segments to serve VFS calls. Background
  641. cleaner is operated by a kernel thread, and triggers the cleaning job when the
  642. system is idle.
  643. F2FS supports two victim selection policies: greedy and cost-benefit algorithms.
  644. In the greedy algorithm, F2FS selects a victim segment having the smallest number
  645. of valid blocks. In the cost-benefit algorithm, F2FS selects a victim segment
  646. according to the segment age and the number of valid blocks in order to address
  647. log block thrashing problem in the greedy algorithm. F2FS adopts the greedy
  648. algorithm for on-demand cleaner, while background cleaner adopts cost-benefit
  649. algorithm.
  650. In order to identify whether the data in the victim segment are valid or not,
  651. F2FS manages a bitmap. Each bit represents the validity of a block, and the
  652. bitmap is composed of a bit stream covering whole blocks in main area.
  653. Write-hint Policy
  654. -----------------
  655. F2FS sets the whint all the time with the below policy.
  656. ===================== ======================== ===================
  657. User F2FS Block
  658. ===================== ======================== ===================
  659. N/A META WRITE_LIFE_NONE|REQ_META
  660. N/A HOT_NODE WRITE_LIFE_NONE
  661. N/A WARM_NODE WRITE_LIFE_MEDIUM
  662. N/A COLD_NODE WRITE_LIFE_LONG
  663. ioctl(COLD) COLD_DATA WRITE_LIFE_EXTREME
  664. extension list " "
  665. -- buffered io
  666. N/A COLD_DATA WRITE_LIFE_EXTREME
  667. N/A HOT_DATA WRITE_LIFE_SHORT
  668. N/A WARM_DATA WRITE_LIFE_NOT_SET
  669. -- direct io
  670. WRITE_LIFE_EXTREME COLD_DATA WRITE_LIFE_EXTREME
  671. WRITE_LIFE_SHORT HOT_DATA WRITE_LIFE_SHORT
  672. WRITE_LIFE_NOT_SET WARM_DATA WRITE_LIFE_NOT_SET
  673. WRITE_LIFE_NONE " WRITE_LIFE_NONE
  674. WRITE_LIFE_MEDIUM " WRITE_LIFE_MEDIUM
  675. WRITE_LIFE_LONG " WRITE_LIFE_LONG
  676. ===================== ======================== ===================
  677. Fallocate(2) Policy
  678. -------------------
  679. The default policy follows the below POSIX rule.
  680. Allocating disk space
  681. The default operation (i.e., mode is zero) of fallocate() allocates
  682. the disk space within the range specified by offset and len. The
  683. file size (as reported by stat(2)) will be changed if offset+len is
  684. greater than the file size. Any subregion within the range specified
  685. by offset and len that did not contain data before the call will be
  686. initialized to zero. This default behavior closely resembles the
  687. behavior of the posix_fallocate(3) library function, and is intended
  688. as a method of optimally implementing that function.
  689. However, once F2FS receives ioctl(fd, F2FS_IOC_SET_PIN_FILE) in prior to
  690. fallocate(fd, DEFAULT_MODE), it allocates on-disk block addresses having
  691. zero or random data, which is useful to the below scenario where:
  692. 1. create(fd)
  693. 2. ioctl(fd, F2FS_IOC_SET_PIN_FILE)
  694. 3. fallocate(fd, 0, 0, size)
  695. 4. address = fibmap(fd, offset)
  696. 5. open(blkdev)
  697. 6. write(blkdev, address)
  698. Compression implementation
  699. --------------------------
  700. - New term named cluster is defined as basic unit of compression, file can
  701. be divided into multiple clusters logically. One cluster includes 4 << n
  702. (n >= 0) logical pages, compression size is also cluster size, each of
  703. cluster can be compressed or not.
  704. - In cluster metadata layout, one special block address is used to indicate
  705. a cluster is a compressed one or normal one; for compressed cluster, following
  706. metadata maps cluster to [1, 4 << n - 1] physical blocks, in where f2fs
  707. stores data including compress header and compressed data.
  708. - In order to eliminate write amplification during overwrite, F2FS only
  709. support compression on write-once file, data can be compressed only when
  710. all logical blocks in cluster contain valid data and compress ratio of
  711. cluster data is lower than specified threshold.
  712. - To enable compression on regular inode, there are four ways:
  713. * chattr +c file
  714. * chattr +c dir; touch dir/file
  715. * mount w/ -o compress_extension=ext; touch file.ext
  716. * mount w/ -o compress_extension=*; touch any_file
  717. - To disable compression on regular inode, there are two ways:
  718. * chattr -c file
  719. * mount w/ -o nocompress_extension=ext; touch file.ext
  720. - Priority in between FS_COMPR_FL, FS_NOCOMP_FS, extensions:
  721. * compress_extension=so; nocompress_extension=zip; chattr +c dir; touch
  722. dir/foo.so; touch dir/bar.zip; touch dir/baz.txt; then foo.so and baz.txt
  723. should be compresse, bar.zip should be non-compressed. chattr +c dir/bar.zip
  724. can enable compress on bar.zip.
  725. * compress_extension=so; nocompress_extension=zip; chattr -c dir; touch
  726. dir/foo.so; touch dir/bar.zip; touch dir/baz.txt; then foo.so should be
  727. compresse, bar.zip and baz.txt should be non-compressed.
  728. chattr+c dir/bar.zip; chattr+c dir/baz.txt; can enable compress on bar.zip
  729. and baz.txt.
  730. - At this point, compression feature doesn't expose compressed space to user
  731. directly in order to guarantee potential data updates later to the space.
  732. Instead, the main goal is to reduce data writes to flash disk as much as
  733. possible, resulting in extending disk life time as well as relaxing IO
  734. congestion. Alternatively, we've added ioctl(F2FS_IOC_RELEASE_COMPRESS_BLOCKS)
  735. interface to reclaim compressed space and show it to user after setting a
  736. special flag to the inode. Once the compressed space is released, the flag
  737. will block writing data to the file until either the compressed space is
  738. reserved via ioctl(F2FS_IOC_RESERVE_COMPRESS_BLOCKS) or the file size is
  739. truncated to zero.
  740. Compress metadata layout::
  741. [Dnode Structure]
  742. +-----------------------------------------------+
  743. | cluster 1 | cluster 2 | ......... | cluster N |
  744. +-----------------------------------------------+
  745. . . . .
  746. . . . .
  747. . Compressed Cluster . . Normal Cluster .
  748. +----------+---------+---------+---------+ +---------+---------+---------+---------+
  749. |compr flag| block 1 | block 2 | block 3 | | block 1 | block 2 | block 3 | block 4 |
  750. +----------+---------+---------+---------+ +---------+---------+---------+---------+
  751. . .
  752. . .
  753. . .
  754. +-------------+-------------+----------+----------------------------+
  755. | data length | data chksum | reserved | compressed data |
  756. +-------------+-------------+----------+----------------------------+
  757. Compression mode
  758. --------------------------
  759. f2fs supports "fs" and "user" compression modes with "compression_mode" mount option.
  760. With this option, f2fs provides a choice to select the way how to compress the
  761. compression enabled files (refer to "Compression implementation" section for how to
  762. enable compression on a regular inode).
  763. 1) compress_mode=fs
  764. This is the default option. f2fs does automatic compression in the writeback of the
  765. compression enabled files.
  766. 2) compress_mode=user
  767. This disables the automatic compression and gives the user discretion of choosing the
  768. target file and the timing. The user can do manual compression/decompression on the
  769. compression enabled files using F2FS_IOC_DECOMPRESS_FILE and F2FS_IOC_COMPRESS_FILE
  770. ioctls like the below.
  771. To decompress a file,
  772. fd = open(filename, O_WRONLY, 0);
  773. ret = ioctl(fd, F2FS_IOC_DECOMPRESS_FILE);
  774. To compress a file,
  775. fd = open(filename, O_WRONLY, 0);
  776. ret = ioctl(fd, F2FS_IOC_COMPRESS_FILE);
  777. NVMe Zoned Namespace devices
  778. ----------------------------
  779. - ZNS defines a per-zone capacity which can be equal or less than the
  780. zone-size. Zone-capacity is the number of usable blocks in the zone.
  781. F2FS checks if zone-capacity is less than zone-size, if it is, then any
  782. segment which starts after the zone-capacity is marked as not-free in
  783. the free segment bitmap at initial mount time. These segments are marked
  784. as permanently used so they are not allocated for writes and
  785. consequently are not needed to be garbage collected. In case the
  786. zone-capacity is not aligned to default segment size(2MB), then a segment
  787. can start before the zone-capacity and span across zone-capacity boundary.
  788. Such spanning segments are also considered as usable segments. All blocks
  789. past the zone-capacity are considered unusable in these segments.