You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

2867 lines
106 KiB

8 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
3 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
5 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
8 years ago
6 years ago
6 years ago
6 years ago
6 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
8 years ago
9 years ago
6 years ago
9 years ago
9 years ago
9 years ago
9 years ago
5 years ago
5 years ago
5 years ago
3 years ago
5 years ago
3 years ago
5 years ago
5 years ago
9 years ago
5 years ago
8 years ago
8 years ago
9 years ago
9 years ago
9 years ago
  1. .\"t
  2. .\" Automatically generated by Pandoc 2.9.2.1
  3. .\"
  4. .TH "mergerfs" "1" "2023-02-19" "mergerfs user manual" ""
  5. .hy
  6. .SH NAME
  7. .PP
  8. mergerfs - a featureful union filesystem
  9. .SH SYNOPSIS
  10. .PP
  11. mergerfs -o<options> <branches> <mountpoint>
  12. .SH DESCRIPTION
  13. .PP
  14. \f[B]mergerfs\f[R] is a union filesystem geared towards simplifying
  15. storage and management of files across numerous commodity storage
  16. devices.
  17. It is similar to \f[B]mhddfs\f[R], \f[B]unionfs\f[R], and
  18. \f[B]aufs\f[R].
  19. .SH FEATURES
  20. .IP \[bu] 2
  21. Configurable behaviors / file placement
  22. .IP \[bu] 2
  23. Ability to add or remove filesystems at will
  24. .IP \[bu] 2
  25. Resistance to individual filesystem failure
  26. .IP \[bu] 2
  27. Support for extended attributes (xattrs)
  28. .IP \[bu] 2
  29. Support for file attributes (chattr)
  30. .IP \[bu] 2
  31. Runtime configurable (via xattrs)
  32. .IP \[bu] 2
  33. Works with heterogeneous filesystem types
  34. .IP \[bu] 2
  35. Moving of file when filesystem runs out of space while writing
  36. .IP \[bu] 2
  37. Ignore read-only filesystems when creating files
  38. .IP \[bu] 2
  39. Turn read-only files into symlinks to underlying file
  40. .IP \[bu] 2
  41. Hard link copy-on-write / CoW
  42. .IP \[bu] 2
  43. Support for POSIX ACLs
  44. .IP \[bu] 2
  45. Misc other things
  46. .SH HOW IT WORKS
  47. .PP
  48. mergerfs logically merges multiple paths together.
  49. Think a union of sets.
  50. The file/s or directory/s acted on or presented through mergerfs are
  51. based on the policy chosen for that particular action.
  52. Read more about policies below.
  53. .IP
  54. .nf
  55. \f[C]
  56. A + B = C
  57. /disk1 /disk2 /merged
  58. | | |
  59. +-- /dir1 +-- /dir1 +-- /dir1
  60. | | | | | |
  61. | +-- file1 | +-- file2 | +-- file1
  62. | | +-- file3 | +-- file2
  63. +-- /dir2 | | +-- file3
  64. | | +-- /dir3 |
  65. | +-- file4 | +-- /dir2
  66. | +-- file5 | |
  67. +-- file6 | +-- file4
  68. |
  69. +-- /dir3
  70. | |
  71. | +-- file5
  72. |
  73. +-- file6
  74. \f[R]
  75. .fi
  76. .PP
  77. mergerfs does \f[B]NOT\f[R] support the copy-on-write (CoW) or whiteout
  78. behaviors found in \f[B]aufs\f[R] and \f[B]overlayfs\f[R].
  79. You can \f[B]not\f[R] mount a read-only filesystem and write to it.
  80. However, mergerfs will ignore read-only drives when creating new files
  81. so you can mix read-write and read-only drives.
  82. It also does \f[B]NOT\f[R] split data across drives.
  83. It is not RAID0 / striping.
  84. It is simply a union of other filesystems.
  85. .SH TERMINOLOGY
  86. .IP \[bu] 2
  87. branch: A base path used in the pool.
  88. .IP \[bu] 2
  89. pool: The mergerfs mount.
  90. The union of the branches.
  91. .IP \[bu] 2
  92. relative path: The path in the pool relative to the branch and mount.
  93. .IP \[bu] 2
  94. function: A filesystem call (open, unlink, create, getattr, rmdir, etc.)
  95. .IP \[bu] 2
  96. category: A collection of functions based on basic behavior (action,
  97. create, search).
  98. .IP \[bu] 2
  99. policy: The algorithm used to select a file when performing a function.
  100. .IP \[bu] 2
  101. path preservation: Aspect of some policies which includes checking the
  102. path for which a file would be created.
  103. .SH BASIC SETUP
  104. .PP
  105. If you don\[cq]t already know that you have a special use case then just
  106. start with one of the following option sets.
  107. .SS You need \f[C]mmap\f[R] (used by rtorrent and many sqlite3 base software)
  108. .PP
  109. \f[C]cache.files=partial,dropcacheonclose=true,category.create=mfs\f[R]
  110. .SS You don\[cq]t need \f[C]mmap\f[R]
  111. .PP
  112. \f[C]cache.files=off,dropcacheonclose=true,category.create=mfs\f[R]
  113. .PP
  114. See the mergerfs wiki for real world
  115. deployments (https://github.com/trapexit/mergerfs/wiki/Real-World-Deployments)
  116. for comparisons / ideas.
  117. .SH OPTIONS
  118. .PP
  119. These options are the same regardless of whether you use them with the
  120. \f[C]mergerfs\f[R] commandline program, in fstab, or in a config file.
  121. .SS mount options
  122. .IP \[bu] 2
  123. \f[B]config\f[R]: Path to a config file.
  124. Same arguments as below in key=val / ini style format.
  125. .IP \[bu] 2
  126. \f[B]branches\f[R]: Colon delimited list of branches.
  127. .IP \[bu] 2
  128. \f[B]minfreespace=SIZE\f[R]: The minimum space value used for creation
  129. policies.
  130. Can be overridden by branch specific option.
  131. Understands `K', `M', and `G' to represent kilobyte, megabyte, and
  132. gigabyte respectively.
  133. (default: 4G)
  134. .IP \[bu] 2
  135. \f[B]moveonenospc=BOOL|POLICY\f[R]: When enabled if a \f[B]write\f[R]
  136. fails with \f[B]ENOSPC\f[R] (no space left on device) or
  137. \f[B]EDQUOT\f[R] (disk quota exceeded) the policy selected will run to
  138. find a new location for the file.
  139. An attempt to move the file to that branch will occur (keeping all
  140. metadata possible) and if successful the original is unlinked and the
  141. write retried.
  142. (default: false, true = mfs)
  143. .IP \[bu] 2
  144. \f[B]inodecalc=passthrough|path-hash|devino-hash|hybrid-hash\f[R]:
  145. Selects the inode calculation algorithm.
  146. (default: hybrid-hash)
  147. .IP \[bu] 2
  148. \f[B]dropcacheonclose=BOOL\f[R]: When a file is requested to be closed
  149. call \f[C]posix_fadvise\f[R] on it first to instruct the kernel that we
  150. no longer need the data and it can drop its cache.
  151. Recommended when
  152. \f[B]cache.files=partial|full|auto-full|per-process\f[R] to limit double
  153. caching.
  154. (default: false)
  155. .IP \[bu] 2
  156. \f[B]symlinkify=BOOL\f[R]: When enabled and a file is not writable and
  157. its mtime or ctime is older than \f[B]symlinkify_timeout\f[R] files will
  158. be reported as symlinks to the original files.
  159. Please read more below before using.
  160. (default: false)
  161. .IP \[bu] 2
  162. \f[B]symlinkify_timeout=UINT\f[R]: Time to wait, in seconds, to activate
  163. the \f[B]symlinkify\f[R] behavior.
  164. (default: 3600)
  165. .IP \[bu] 2
  166. \f[B]nullrw=BOOL\f[R]: Turns reads and writes into no-ops.
  167. The request will succeed but do nothing.
  168. Useful for benchmarking mergerfs.
  169. (default: false)
  170. .IP \[bu] 2
  171. \f[B]ignorepponrename=BOOL\f[R]: Ignore path preserving on rename.
  172. Typically rename and link act differently depending on the policy of
  173. \f[C]create\f[R] (read below).
  174. Enabling this will cause rename and link to always use the non-path
  175. preserving behavior.
  176. This means files, when renamed or linked, will stay on the same drive.
  177. (default: false)
  178. .IP \[bu] 2
  179. \f[B]security_capability=BOOL\f[R]: If false return ENOATTR when xattr
  180. security.capability is queried.
  181. (default: true)
  182. .IP \[bu] 2
  183. \f[B]xattr=passthrough|noattr|nosys\f[R]: Runtime control of xattrs.
  184. Default is to passthrough xattr requests.
  185. `noattr' will short circuit as if nothing exists.
  186. `nosys' will respond with ENOSYS as if xattrs are not supported or
  187. disabled.
  188. (default: passthrough)
  189. .IP \[bu] 2
  190. \f[B]link_cow=BOOL\f[R]: When enabled if a regular file is opened which
  191. has a link count > 1 it will copy the file to a temporary file and
  192. rename over the original.
  193. Breaking the link and providing a basic copy-on-write function similar
  194. to cow-shell.
  195. (default: false)
  196. .IP \[bu] 2
  197. \f[B]statfs=base|full\f[R]: Controls how statfs works.
  198. `base' means it will always use all branches in statfs calculations.
  199. `full' is in effect path preserving and only includes drives where the
  200. path exists.
  201. (default: base)
  202. .IP \[bu] 2
  203. \f[B]statfs_ignore=none|ro|nc\f[R]: `ro' will cause statfs calculations
  204. to ignore available space for branches mounted or tagged as `read-only'
  205. or `no create'.
  206. `nc' will ignore available space for branches tagged as `no create'.
  207. (default: none)
  208. .IP \[bu] 2
  209. \f[B]nfsopenhack=off|git|all\f[R]: A workaround for exporting mergerfs
  210. over NFS where there are issues with creating files for write while
  211. setting the mode to read-only.
  212. (default: off)
  213. .IP \[bu] 2
  214. \f[B]branches-mount-timeout=UINT\f[R]: Number of seconds to wait at
  215. startup for branches to be a mount other than the mountpoint\[cq]s
  216. filesystem.
  217. (default: 0)
  218. .IP \[bu] 2
  219. \f[B]follow-symlinks=never|directory|regular|all\f[R]: Turns symlinks
  220. into what they point to.
  221. (default: never)
  222. .IP \[bu] 2
  223. \f[B]link-exdev=passthrough|rel-symlink|abs-base-symlink|abs-pool-symlink\f[R]:
  224. When a link fails with EXDEV optionally create a symlink to the file
  225. instead.
  226. .IP \[bu] 2
  227. \f[B]rename-exdev=passthrough|rel-symlink|abs-symlink\f[R]: When a
  228. rename fails with EXDEV optionally move the file to a special directory
  229. and symlink to it.
  230. .IP \[bu] 2
  231. \f[B]posix_acl=BOOL\f[R]: Enable POSIX ACL support (if supported by
  232. kernel and underlying filesystem).
  233. (default: false)
  234. .IP \[bu] 2
  235. \f[B]async_read=BOOL\f[R]: Perform reads asynchronously.
  236. If disabled or unavailable the kernel will ensure there is at most one
  237. pending read request per file handle and will attempt to order requests
  238. by offset.
  239. (default: true)
  240. .IP \[bu] 2
  241. \f[B]fuse_msg_size=UINT\f[R]: Set the max number of pages per FUSE
  242. message.
  243. Only available on Linux >= 4.20 and ignored otherwise.
  244. (min: 1; max: 256; default: 256)
  245. .IP \[bu] 2
  246. \f[B]threads=INT\f[R]: Number of threads to use.
  247. When used alone (\f[C]process-thread-count=-1\f[R]) it sets the number
  248. of threads reading and processing FUSE messages.
  249. When used together it sets the number of threads reading from FUSE.
  250. When set to zero it will attempt to discover and use the number of
  251. logical cores.
  252. If the thread count is set negative it will look up the number of cores
  253. then divide by the absolute value.
  254. ie.
  255. threads=-2 on an 8 core machine will result in 8 / 2 = 4 threads.
  256. There will always be at least 1 thread.
  257. If set to -1 in combination with \f[C]process-thread-count\f[R] then it
  258. will try to pick reasonable values based on CPU thread count.
  259. NOTE: higher number of threads increases parallelism but usually
  260. decreases throughput.
  261. (default: 0)
  262. .IP \[bu] 2
  263. \f[B]read-thread-count=INT\f[R]: Alias for \f[C]threads\f[R].
  264. .IP \[bu] 2
  265. \f[B]process-thread-count=INT\f[R]: Enables separate thread pool to
  266. asynchronously process FUSE requests.
  267. In this mode \f[C]read-thread-count\f[R] refers to the number of threads
  268. reading FUSE messages which are dispatched to process threads.
  269. -1 means disabled otherwise acts like \f[C]read-thread-count\f[R].
  270. (default: -1)
  271. .IP \[bu] 2
  272. \f[B]pin-threads=STR\f[R]: Selects a strategy to pin threads to CPUs
  273. (default: unset)
  274. .IP \[bu] 2
  275. \f[B]scheduling-priority=INT\f[R]: Set mergerfs\[cq] scheduling
  276. priority.
  277. Valid values range from -20 to 19.
  278. See \f[C]setpriority\f[R] man page for more details.
  279. (default: -10)
  280. .IP \[bu] 2
  281. \f[B]fsname=STR\f[R]: Sets the name of the filesystem as seen in
  282. \f[B]mount\f[R], \f[B]df\f[R], etc.
  283. Defaults to a list of the source paths concatenated together with the
  284. longest common prefix removed.
  285. .IP \[bu] 2
  286. \f[B]func.FUNC=POLICY\f[R]: Sets the specific FUSE function\[cq]s
  287. policy.
  288. See below for the list of value types.
  289. Example: \f[B]func.getattr=newest\f[R]
  290. .IP \[bu] 2
  291. \f[B]category.action=POLICY\f[R]: Sets policy of all FUSE functions in
  292. the action category.
  293. (default: epall)
  294. .IP \[bu] 2
  295. \f[B]category.create=POLICY\f[R]: Sets policy of all FUSE functions in
  296. the create category.
  297. (default: epmfs)
  298. .IP \[bu] 2
  299. \f[B]category.search=POLICY\f[R]: Sets policy of all FUSE functions in
  300. the search category.
  301. (default: ff)
  302. .IP \[bu] 2
  303. \f[B]cache.open=UINT\f[R]: `open' policy cache timeout in seconds.
  304. (default: 0)
  305. .IP \[bu] 2
  306. \f[B]cache.statfs=UINT\f[R]: `statfs' cache timeout in seconds.
  307. (default:
  308. .RS 2
  309. .RE
  310. .IP \[bu] 2
  311. \f[B]cache.attr=UINT\f[R]: File attribute cache timeout in seconds.
  312. (default: 1)
  313. .IP \[bu] 2
  314. \f[B]cache.entry=UINT\f[R]: File name lookup cache timeout in seconds.
  315. (default: 1)
  316. .IP \[bu] 2
  317. \f[B]cache.negative_entry=UINT\f[R]: Negative file name lookup cache
  318. timeout in seconds.
  319. (default: 0)
  320. .IP \[bu] 2
  321. \f[B]cache.files=libfuse|off|partial|full|auto-full|per-process\f[R]:
  322. File page caching mode (default: libfuse)
  323. .IP \[bu] 2
  324. \f[B]cache.files.process-names=LIST\f[R]: A pipe | delimited list of
  325. process comm (https://man7.org/linux/man-pages/man5/proc.5.html) names
  326. to enable page caching for when \f[C]cache.files=per-process\f[R].
  327. (default: \[lq]rtorrent|qbittorrent-nox\[rq])
  328. .IP \[bu] 2
  329. \f[B]cache.writeback=BOOL\f[R]: Enable kernel writeback caching
  330. (default: false)
  331. .IP \[bu] 2
  332. \f[B]cache.symlinks=BOOL\f[R]: Cache symlinks (if supported by kernel)
  333. (default: false)
  334. .IP \[bu] 2
  335. \f[B]cache.readdir=BOOL\f[R]: Cache readdir (if supported by kernel)
  336. (default: false)
  337. .IP \[bu] 2
  338. \f[B]direct_io\f[R]: deprecated - Bypass page cache.
  339. Use \f[C]cache.files=off\f[R] instead.
  340. (default: false)
  341. .IP \[bu] 2
  342. \f[B]kernel_cache\f[R]: deprecated - Do not invalidate data cache on
  343. file open.
  344. Use \f[C]cache.files=full\f[R] instead.
  345. (default: false)
  346. .IP \[bu] 2
  347. \f[B]auto_cache\f[R]: deprecated - Invalidate data cache if file mtime
  348. or size change.
  349. Use \f[C]cache.files=auto-full\f[R] instead.
  350. (default: false)
  351. .IP \[bu] 2
  352. \f[B]async_read\f[R]: deprecated - Perform reads asynchronously.
  353. Use \f[C]async_read=true\f[R] instead.
  354. .IP \[bu] 2
  355. \f[B]sync_read\f[R]: deprecated - Perform reads synchronously.
  356. Use \f[C]async_read=false\f[R] instead.
  357. .PP
  358. \f[B]NOTE:\f[R] Options are evaluated in the order listed so if the
  359. options are \f[B]func.rmdir=rand,category.action=ff\f[R] the
  360. \f[B]action\f[R] category setting will override the \f[B]rmdir\f[R]
  361. setting.
  362. .SS Value Types
  363. .IP \[bu] 2
  364. BOOL = `true' | `false'
  365. .IP \[bu] 2
  366. INT = [MIN_INT,MAX_INT]
  367. .IP \[bu] 2
  368. UINT = [0,MAX_INT]
  369. .IP \[bu] 2
  370. SIZE = `NNM'; NN = INT, M = `K' | `M' | `G' | `T'
  371. .IP \[bu] 2
  372. STR = string (may refer to an enumerated value, see details of argument)
  373. .IP \[bu] 2
  374. FUNC = filesystem function
  375. .IP \[bu] 2
  376. CATEGORY = function category
  377. .IP \[bu] 2
  378. POLICY = mergerfs function policy
  379. .SS branches
  380. .PP
  381. The `branches' argument is a colon (`:') delimited list of paths to be
  382. pooled together.
  383. It does not matter if the paths are on the same or different drives nor
  384. does it matter the filesystem (within reason).
  385. Used and available space will not be duplicated for paths on the same
  386. device and any features which aren\[cq]t supported by the underlying
  387. filesystem (such as file attributes or extended attributes) will return
  388. the appropriate errors.
  389. .PP
  390. Branches currently have two options which can be set.
  391. A type which impacts whether or not the branch is included in a policy
  392. calculation and a individual minfreespace value.
  393. The values are set by prepending an \f[C]=\f[R] at the end of a branch
  394. designation and using commas as delimiters.
  395. Example: /mnt/drive=RW,1234
  396. .SS branch type
  397. .IP \[bu] 2
  398. RW: (read/write) - Default behavior.
  399. Will be eligible in all policy categories.
  400. .IP \[bu] 2
  401. RO: (read-only) - Will be excluded from \f[C]create\f[R] and
  402. \f[C]action\f[R] policies.
  403. Same as a read-only mounted filesystem would be (though faster to
  404. process).
  405. .IP \[bu] 2
  406. NC: (no-create) - Will be excluded from \f[C]create\f[R] policies.
  407. You can\[cq]t create on that branch but you can change or delete.
  408. .SS minfreespace
  409. .PP
  410. Same purpose as the global option but specific to the branch.
  411. If not set the global value is used.
  412. .SS globbing
  413. .PP
  414. To make it easier to include multiple branches mergerfs supports
  415. globbing (http://linux.die.net/man/7/glob).
  416. \f[B]The globbing tokens MUST be escaped when using via the shell else
  417. the shell itself will apply the glob itself.\f[R]
  418. .IP
  419. .nf
  420. \f[C]
  421. # mergerfs /mnt/disk\[rs]*:/mnt/cdrom /media/drives
  422. \f[R]
  423. .fi
  424. .PP
  425. The above line will use all mount points in /mnt prefixed with
  426. \f[B]disk\f[R] and the \f[B]cdrom\f[R].
  427. .PP
  428. To have the pool mounted at boot or otherwise accessible from related
  429. tools use \f[B]/etc/fstab\f[R].
  430. .IP
  431. .nf
  432. \f[C]
  433. # <file system> <mount point> <type> <options> <dump> <pass>
  434. /mnt/disk*:/mnt/cdrom /mnt/pool fuse.mergerfs minfreespace=16G 0 0
  435. \f[R]
  436. .fi
  437. .PP
  438. \f[B]NOTE:\f[R] the globbing is done at mount or when updated using the
  439. runtime API.
  440. If a new directory is added matching the glob after the fact it will not
  441. be automatically included.
  442. .PP
  443. \f[B]NOTE:\f[R] for mounting via \f[B]fstab\f[R] to work you must have
  444. \f[B]mount.fuse\f[R] installed.
  445. For Ubuntu/Debian it is included in the \f[B]fuse\f[R] package.
  446. .SS inodecalc
  447. .PP
  448. Inodes (st_ino) are unique identifiers within a filesystem.
  449. Each mounted filesystem has device ID (st_dev) as well and together they
  450. can uniquely identify a file on the whole of the system.
  451. Entries on the same device with the same inode are in fact references to
  452. the same underlying file.
  453. It is a many to one relationship between names and an inode.
  454. Directories, however, do not have multiple links on most systems due to
  455. the complexity they add.
  456. .PP
  457. FUSE allows the server (mergerfs) to set inode values but not device
  458. IDs.
  459. Creating an inode value is somewhat complex in mergerfs\[cq] case as
  460. files aren\[cq]t really in its control.
  461. If a policy changes what directory or file is to be selected or
  462. something changes out of band it becomes unclear what value should be
  463. used.
  464. Most software does not to care what the values are but those that do
  465. often break if a value changes unexpectedly.
  466. The tool \f[C]find\f[R] will abort a directory walk if it sees a
  467. directory inode change.
  468. NFS will return stale handle errors if the inode changes out of band.
  469. File dedup tools will usually leverage device ids and inodes as a
  470. shortcut in searching for duplicate files and would resort to full file
  471. comparisons should it find different inode values.
  472. .PP
  473. mergerfs offers multiple ways to calculate the inode in hopes of
  474. covering different usecases.
  475. .IP \[bu] 2
  476. passthrough: Passes through the underlying inode value.
  477. Mostly intended for testing as using this does not address any of the
  478. problems mentioned above and could confuse file deduplication software
  479. as inodes from different filesystems can be the same.
  480. .IP \[bu] 2
  481. path-hash: Hashes the relative path of the entry in question.
  482. The underlying file\[cq]s values are completely ignored.
  483. This means the inode value will always be the same for that file path.
  484. This is useful when using NFS and you make changes out of band such as
  485. copy data between branches.
  486. This also means that entries that do point to the same file will not be
  487. recognizable via inodes.
  488. That \f[B]does not\f[R] mean hard links don\[cq]t work.
  489. They will.
  490. .IP \[bu] 2
  491. path-hash32: 32bit version of path-hash.
  492. .IP \[bu] 2
  493. devino-hash: Hashes the device id and inode of the underlying entry.
  494. This won\[cq]t prevent issues with NFS should the policy pick a
  495. different file or files move out of band but will present the same inode
  496. for underlying files that do too.
  497. .IP \[bu] 2
  498. devino-hash32: 32bit version of devino-hash.
  499. .IP \[bu] 2
  500. hybrid-hash: Performs \f[C]path-hash\f[R] on directories and
  501. \f[C]devino-hash\f[R] on other file types.
  502. Since directories can\[cq]t have hard links the static value won\[cq]t
  503. make a difference and the files will get values useful for finding
  504. duplicates.
  505. Probably the best to use if not using NFS.
  506. As such it is the default.
  507. .IP \[bu] 2
  508. hybrid-hash32: 32bit version of hybrid-hash.
  509. .PP
  510. 32bit versions are provided as there is some software which does not
  511. handle 64bit inodes well.
  512. .PP
  513. While there is a risk of hash collision in tests of a couple million
  514. entries there were zero collisions.
  515. Unlike a typical filesystem FUSE filesystems can reuse inodes and not
  516. refer to the same entry.
  517. The internal identifier used to reference a file in FUSE is different
  518. from the inode value presented.
  519. The former is the \f[C]nodeid\f[R] and is actually a tuple of 2 64bit
  520. values: \f[C]nodeid\f[R] and \f[C]generation\f[R].
  521. This tuple is not client facing.
  522. The inode that is presented to the client is passed through the kernel
  523. uninterpreted.
  524. .PP
  525. From FUSE docs regarding \f[C]use_ino\f[R]:
  526. .IP
  527. .nf
  528. \f[C]
  529. Honor the st_ino field in the functions getattr() and
  530. fill_dir(). This value is used to fill in the st_ino field
  531. in the stat(2), lstat(2), fstat(2) functions and the d_ino
  532. field in the readdir(2) function. The filesystem does not
  533. have to guarantee uniqueness, however some applications
  534. rely on this value being unique for the whole filesystem.
  535. Note that this does *not* affect the inode that libfuse
  536. and the kernel use internally (also called the \[dq]nodeid\[dq]).
  537. \f[R]
  538. .fi
  539. .PP
  540. As of version 2.35.0 the \f[C]use_ino\f[R] option has been removed.
  541. mergerfs should always be managing inode values.
  542. .SS pin-threads
  543. .PP
  544. Simple strategies for pinning read and/or process threads.
  545. If process threads are not enabled than the strategy simply works on the
  546. read threads.
  547. Invalid values are ignored.
  548. .IP \[bu] 2
  549. R1L: All read threads pinned to a single logical CPU.
  550. .IP \[bu] 2
  551. R1P: All read threads pinned to a single physical CPU.
  552. .IP \[bu] 2
  553. RP1L: All read and process threads pinned to a single logical CPU.
  554. .IP \[bu] 2
  555. RP1P: All read and process threads pinned to a single physical CPU.
  556. .IP \[bu] 2
  557. R1LP1L: All read threads pinned to a single logical CPU, all process
  558. threads pinned to a (if possible) different logical CPU.
  559. .IP \[bu] 2
  560. R1PP1P: All read threads pinned to a single physical CPU, all process
  561. threads pinned to a (if possible) different logical CPU.
  562. .IP \[bu] 2
  563. RPSL: All read and process threads are spread across all logical CPUs.
  564. .IP \[bu] 2
  565. RPSP: All read and process threads are spread across all physical CPUs.
  566. .IP \[bu] 2
  567. R1PPSP: All read threads are pinned to a single physical CPU while
  568. process threads are spread across all other phsycial CPUs.
  569. .SS fuse_msg_size
  570. .PP
  571. FUSE applications communicate with the kernel over a special character
  572. device: \f[C]/dev/fuse\f[R].
  573. A large portion of the overhead associated with FUSE is the cost of
  574. going back and forth from user space and kernel space over that device.
  575. Generally speaking the fewer trips needed the better the performance
  576. will be.
  577. Reducing the number of trips can be done a number of ways.
  578. Kernel level caching and increasing message sizes being two significant
  579. ones.
  580. When it comes to reads and writes if the message size is doubled the
  581. number of trips are approximately halved.
  582. .PP
  583. In Linux 4.20 a new feature was added allowing the negotiation of the
  584. max message size.
  585. Since the size is in multiples of
  586. pages (https://en.wikipedia.org/wiki/Page_(computer_memory)) the feature
  587. is called \f[C]max_pages\f[R].
  588. There is a maximum \f[C]max_pages\f[R] value of 256 (1MiB) and minimum
  589. of 1 (4KiB).
  590. The default used by Linux >=4.20, and hardcoded value used before 4.20,
  591. is 32 (128KiB).
  592. In mergerfs its referred to as \f[C]fuse_msg_size\f[R] to make it clear
  593. what it impacts and provide some abstraction.
  594. .PP
  595. Since there should be no downsides to increasing \f[C]fuse_msg_size\f[R]
  596. / \f[C]max_pages\f[R], outside a minor bump in RAM usage due to larger
  597. message buffers, mergerfs defaults the value to 256.
  598. On kernels before 4.20 the value has no effect.
  599. The reason the value is configurable is to enable experimentation and
  600. benchmarking.
  601. See the BENCHMARKING section for examples.
  602. .SS follow-symlinks
  603. .PP
  604. This feature, when enabled, will cause symlinks to be interpreted by
  605. mergerfs as their target (depending on the mode).
  606. .PP
  607. When there is a getattr/stat request for a file mergerfs will check if
  608. the file is a symlink and depending on the \f[C]follow-symlinks\f[R]
  609. setting will replace the information about the symlink with that of that
  610. which it points to.
  611. .PP
  612. When unlink\[cq]ing or rmdir\[cq]ing the followed symlink it will remove
  613. the symlink itself and not that which it points to.
  614. .IP \[bu] 2
  615. never: Behave as normal.
  616. Symlinks are treated as such.
  617. .IP \[bu] 2
  618. directory: Resolve symlinks only which point to directories.
  619. .IP \[bu] 2
  620. regular: Resolve symlinks only which point to regular files.
  621. .IP \[bu] 2
  622. all: Resolve all symlinks to that which they point to.
  623. .PP
  624. Symlinks which do not point to anything are left as is.
  625. .PP
  626. WARNING: This feature works but there might be edge cases yet found.
  627. If you find any odd behaviors please file a ticket on
  628. github (https://github.com/trapexit/mergerfs/issues).
  629. .SS link-exdev
  630. .PP
  631. If using path preservation and a \f[C]link\f[R] fails with EXDEV make a
  632. call to \f[C]symlink\f[R] where the \f[C]target\f[R] is the
  633. \f[C]oldlink\f[R] and the \f[C]linkpath\f[R] is the \f[C]newpath\f[R].
  634. The \f[C]target\f[R] value is determined by the value of
  635. \f[C]link-exdev\f[R].
  636. .IP \[bu] 2
  637. passthrough: Return EXDEV as normal.
  638. .IP \[bu] 2
  639. rel-symlink: A relative path from the \f[C]newpath\f[R].
  640. .IP \[bu] 2
  641. abs-base-symlink: A absolute value using the underlying branch.
  642. .IP \[bu] 2
  643. abs-pool-symlink: A absolute value using the mergerfs mount point.
  644. .PP
  645. NOTE: It is possible that some applications check the file they link.
  646. In those cases it is possible it will error or complain.
  647. .SS rename-exdev
  648. .PP
  649. If using path preservation and a \f[C]rename\f[R] fails with EXDEV:
  650. .IP "1." 3
  651. Move file from \f[B]/branch/a/b/c\f[R] to
  652. \f[B]/branch/.mergerfs_rename_exdev/a/b/c\f[R].
  653. .IP "2." 3
  654. symlink the rename\[cq]s \f[C]newpath\f[R] to the moved file.
  655. .PP
  656. The \f[C]target\f[R] value is determined by the value of
  657. \f[C]rename-exdev\f[R].
  658. .IP \[bu] 2
  659. passthrough: Return EXDEV as normal.
  660. .IP \[bu] 2
  661. rel-symlink: A relative path from the \f[C]newpath\f[R].
  662. .IP \[bu] 2
  663. abs-symlink: A absolute value using the mergerfs mount point.
  664. .PP
  665. NOTE: It is possible that some applications check the file they rename.
  666. In those cases it is possible it will error or complain.
  667. .PP
  668. NOTE: The reason \f[C]abs-symlink\f[R] is not split into two like
  669. \f[C]link-exdev\f[R] is due to the complexities in managing absolute
  670. base symlinks when multiple \f[C]oldpaths\f[R] exist.
  671. .SS symlinkify
  672. .PP
  673. Due to the levels of indirection introduced by mergerfs and the
  674. underlying technology FUSE there can be varying levels of performance
  675. degradation.
  676. This feature will turn non-directories which are not writable into
  677. symlinks to the original file found by the \f[C]readlink\f[R] policy
  678. after the mtime and ctime are older than the timeout.
  679. .PP
  680. \f[B]WARNING:\f[R] The current implementation has a known issue in which
  681. if the file is open and being used when the file is converted to a
  682. symlink then the application which has that file open will receive an
  683. error when using it.
  684. This is unlikely to occur in practice but is something to keep in mind.
  685. .PP
  686. \f[B]WARNING:\f[R] Some backup solutions, such as CrashPlan, do not
  687. backup the target of a symlink.
  688. If using this feature it will be necessary to point any backup software
  689. to the original drives or configure the software to follow symlinks if
  690. such an option is available.
  691. Alternatively create two mounts.
  692. One for backup and one for general consumption.
  693. .SS nullrw
  694. .PP
  695. Due to how FUSE works there is an overhead to all requests made to a
  696. FUSE filesystem that wouldn\[cq]t exist for an in kernel one.
  697. Meaning that even a simple passthrough will have some slowdown.
  698. However, generally the overhead is minimal in comparison to the cost of
  699. the underlying I/O.
  700. By disabling the underlying I/O we can test the theoretical performance
  701. boundaries.
  702. .PP
  703. By enabling \f[C]nullrw\f[R] mergerfs will work as it always does
  704. \f[B]except\f[R] that all reads and writes will be no-ops.
  705. A write will succeed (the size of the write will be returned as if it
  706. were successful) but mergerfs does nothing with the data it was given.
  707. Similarly a read will return the size requested but won\[cq]t touch the
  708. buffer.
  709. .PP
  710. See the BENCHMARKING section for suggestions on how to test.
  711. .SS xattr
  712. .PP
  713. Runtime extended attribute support can be managed via the
  714. \f[C]xattr\f[R] option.
  715. By default it will passthrough any xattr calls.
  716. Given xattr support is rarely used and can have significant performance
  717. implications mergerfs allows it to be disabled at runtime.
  718. The performance problems mostly comes when file caching is enabled.
  719. The kernel will send a \f[C]getxattr\f[R] for
  720. \f[C]security.capability\f[R] \f[I]before every single write\f[R].
  721. It doesn\[cq]t cache the responses to any \f[C]getxattr\f[R].
  722. This might be addressed in the future but for now mergerfs can really
  723. only offer the following workarounds.
  724. .PP
  725. \f[C]noattr\f[R] will cause mergerfs to short circuit all xattr calls
  726. and return ENOATTR where appropriate.
  727. mergerfs still gets all the requests but they will not be forwarded on
  728. to the underlying filesystems.
  729. The runtime control will still function in this mode.
  730. .PP
  731. \f[C]nosys\f[R] will cause mergerfs to return ENOSYS for any xattr call.
  732. The difference with \f[C]noattr\f[R] is that the kernel will cache this
  733. fact and itself short circuit future calls.
  734. This is more efficient than \f[C]noattr\f[R] but will cause
  735. mergerfs\[cq] runtime control via the hidden file to stop working.
  736. .SS nfsopenhack
  737. .PP
  738. NFS is not fully POSIX compliant and historically certain behaviors,
  739. such as opening files with O_EXCL, are not or not well supported.
  740. When mergerfs (or any FUSE filesystem) is exported over NFS some of
  741. these issues come up due to how NFS and FUSE interact.
  742. .PP
  743. This hack addresses the issue where the creation of a file with a
  744. read-only mode but with a read/write or write only flag.
  745. Normally this is perfectly valid but NFS chops the one open call into
  746. multiple calls.
  747. Exactly how it is translated depends on the configuration and versions
  748. of the NFS server and clients but it results in a permission error
  749. because a normal user is not allowed to open a read-only file as
  750. writable.
  751. .PP
  752. Even though it\[cq]s a more niche situation this hack breaks normal
  753. security and behavior and as such is \f[C]off\f[R] by default.
  754. If set to \f[C]git\f[R] it will only perform the hack when the path in
  755. question includes \f[C]/.git/\f[R].
  756. \f[C]all\f[R] will result it applying anytime a readonly file which is
  757. empty is opened for writing.
  758. .SH FUNCTIONS, CATEGORIES and POLICIES
  759. .PP
  760. The POSIX filesystem API is made up of a number of functions.
  761. \f[B]creat\f[R], \f[B]stat\f[R], \f[B]chown\f[R], etc.
  762. For ease of configuration in mergerfs most of the core functions are
  763. grouped into 3 categories: \f[B]action\f[R], \f[B]create\f[R], and
  764. \f[B]search\f[R].
  765. These functions and categories can be assigned a policy which dictates
  766. which branch is chosen when performing that function.
  767. .PP
  768. Some functions, listed in the category \f[C]N/A\f[R] below, can not be
  769. assigned the normal policies.
  770. These functions work with file handles, rather than file paths, which
  771. were created by \f[C]open\f[R] or \f[C]create\f[R].
  772. That said many times the current FUSE kernel driver will not always
  773. provide the file handle when a client calls \f[C]fgetattr\f[R],
  774. \f[C]fchown\f[R], \f[C]fchmod\f[R], \f[C]futimens\f[R],
  775. \f[C]ftruncate\f[R], etc.
  776. This means it will call the regular, path based, versions.
  777. \f[C]readdir\f[R] has no real need for a policy given the purpose is
  778. merely to return a list of entries in a directory.
  779. \f[C]statfs\f[R]\[cq]s behavior can be modified via other options.
  780. .PP
  781. When using policies which are based on a branch\[cq]s available space
  782. the base path provided is used.
  783. Not the full path to the file in question.
  784. Meaning that mounts in the branch won\[cq]t be considered in the space
  785. calculations.
  786. The reason is that it doesn\[cq]t really work for non-path preserving
  787. policies and can lead to non-obvious behaviors.
  788. .PP
  789. NOTE: While any policy can be assigned to a function or category though
  790. some may not be very useful in practice.
  791. For instance: \f[B]rand\f[R] (random) may be useful for file creation
  792. (create) but could lead to very odd behavior if used for \f[C]chmod\f[R]
  793. if there were more than one copy of the file.
  794. .SS Functions and their Category classifications
  795. .PP
  796. .TS
  797. tab(@);
  798. lw(7.4n) lw(62.6n).
  799. T{
  800. Category
  801. T}@T{
  802. FUSE Functions
  803. T}
  804. _
  805. T{
  806. action
  807. T}@T{
  808. chmod, chown, link, removexattr, rename, rmdir, setxattr, truncate,
  809. unlink, utimens
  810. T}
  811. T{
  812. create
  813. T}@T{
  814. create, mkdir, mknod, symlink
  815. T}
  816. T{
  817. search
  818. T}@T{
  819. access, getattr, getxattr, ioctl (directories), listxattr, open,
  820. readlink
  821. T}
  822. T{
  823. N/A
  824. T}@T{
  825. fchmod, fchown, futimens, ftruncate, fallocate, fgetattr, fsync, ioctl
  826. (files), read, readdir, release, statfs, write, copy_file_range
  827. T}
  828. .TE
  829. .PP
  830. In cases where something may be searched for (such as a path to clone)
  831. \f[B]getattr\f[R] will usually be used.
  832. .SS Policies
  833. .PP
  834. A policy is the algorithm used to choose a branch or branches for a
  835. function to work on.
  836. Think of them as ways to filter and sort branches.
  837. .PP
  838. Any function in the \f[C]create\f[R] category will clone the relative
  839. path if needed.
  840. Some other functions (\f[C]rename\f[R],\f[C]link\f[R],\f[C]ioctl\f[R])
  841. have special requirements or behaviors which you can read more about
  842. below.
  843. .SS Filtering
  844. .PP
  845. Policies basically search branches and create a list of files / paths
  846. for functions to work on.
  847. The policy is responsible for filtering and sorting the branches.
  848. Filters include \f[B]minfreespace\f[R], whether or not a branch is
  849. mounted read-only, and the branch tagging (RO,NC,RW).
  850. These filters are applied across all policies unless otherwise noted.
  851. .IP \[bu] 2
  852. No \f[B]search\f[R] function policies filter.
  853. .IP \[bu] 2
  854. All \f[B]action\f[R] function policies filter out branches which are
  855. mounted \f[B]read-only\f[R] or tagged as \f[B]RO (read-only)\f[R].
  856. .IP \[bu] 2
  857. All \f[B]create\f[R] function policies filter out branches which are
  858. mounted \f[B]read-only\f[R], tagged \f[B]RO (read-only)\f[R] or \f[B]NC
  859. (no create)\f[R], or has available space less than
  860. \f[C]minfreespace\f[R].
  861. .PP
  862. Policies may have their own additional filtering such as those that
  863. require existing paths to be present.
  864. .PP
  865. If all branches are filtered an error will be returned.
  866. Typically \f[B]EROFS\f[R] (read-only filesystem) or \f[B]ENOSPC\f[R] (no
  867. space left on device) depending on the most recent reason for filtering
  868. a branch.
  869. \f[B]ENOENT\f[R] will be returned if no eligible branch is found.
  870. .SS Path Preservation
  871. .PP
  872. Policies, as described below, are of two basic types.
  873. \f[C]path preserving\f[R] and \f[C]non-path preserving\f[R].
  874. .PP
  875. All policies which start with \f[C]ep\f[R] (\f[B]epff\f[R],
  876. \f[B]eplfs\f[R], \f[B]eplus\f[R], \f[B]epmfs\f[R], \f[B]eprand\f[R]) are
  877. \f[C]path preserving\f[R].
  878. \f[C]ep\f[R] stands for \f[C]existing path\f[R].
  879. .PP
  880. A path preserving policy will only consider drives where the relative
  881. path being accessed already exists.
  882. .PP
  883. When using non-path preserving policies paths will be cloned to target
  884. drives as necessary.
  885. .PP
  886. With the \f[C]msp\f[R] or \f[C]most shared path\f[R] policies they are
  887. defined as \f[C]path preserving\f[R] for the purpose of controlling
  888. \f[C]link\f[R] and \f[C]rename\f[R]\[cq]s behaviors since
  889. \f[C]ignorepponrename\f[R] is available to disable that behavior.
  890. In mergerfs v3.0 the path preserving behavior of rename and link will
  891. likely be separated from the policy all together.
  892. .SS Policy descriptions
  893. .PP
  894. A policy\[cq]s behavior differs, as mentioned above, based on the
  895. function it is used with.
  896. Sometimes it really might not make sense to even offer certain policies
  897. because they are literally the same as others but it makes things a bit
  898. more uniform.
  899. In mergerfs 3.0 this might change.
  900. .PP
  901. .TS
  902. tab(@);
  903. lw(16.2n) lw(53.8n).
  904. T{
  905. Policy
  906. T}@T{
  907. Description
  908. T}
  909. _
  910. T{
  911. all
  912. T}@T{
  913. Search: For \f[B]mkdir\f[R], \f[B]mknod\f[R], and \f[B]symlink\f[R] it
  914. will apply to all branches.
  915. \f[B]create\f[R] works like \f[B]ff\f[R].
  916. T}
  917. T{
  918. epall (existing path, all)
  919. T}@T{
  920. For \f[B]mkdir\f[R], \f[B]mknod\f[R], and \f[B]symlink\f[R] it will
  921. apply to all found.
  922. \f[B]create\f[R] works like \f[B]epff\f[R] (but more expensive because
  923. it doesn\[cq]t stop after finding a valid branch).
  924. T}
  925. T{
  926. epff (existing path, first found)
  927. T}@T{
  928. Given the order of the branches, as defined at mount time or configured
  929. at runtime, act on the first one found where the relative path exists.
  930. T}
  931. T{
  932. eplfs (existing path, least free space)
  933. T}@T{
  934. Of all the branches on which the relative path exists choose the drive
  935. with the least free space.
  936. T}
  937. T{
  938. eplus (existing path, least used space)
  939. T}@T{
  940. Of all the branches on which the relative path exists choose the drive
  941. with the least used space.
  942. T}
  943. T{
  944. epmfs (existing path, most free space)
  945. T}@T{
  946. Of all the branches on which the relative path exists choose the drive
  947. with the most free space.
  948. T}
  949. T{
  950. eppfrd (existing path, percentage free random distribution)
  951. T}@T{
  952. Like \f[B]pfrd\f[R] but limited to existing paths.
  953. T}
  954. T{
  955. eprand (existing path, random)
  956. T}@T{
  957. Calls \f[B]epall\f[R] and then randomizes.
  958. Returns 1.
  959. T}
  960. T{
  961. ff (first found)
  962. T}@T{
  963. Given the order of the drives, as defined at mount time or configured at
  964. runtime, act on the first one found.
  965. T}
  966. T{
  967. lfs (least free space)
  968. T}@T{
  969. Pick the drive with the least available free space.
  970. T}
  971. T{
  972. lus (least used space)
  973. T}@T{
  974. Pick the drive with the least used space.
  975. T}
  976. T{
  977. mfs (most free space)
  978. T}@T{
  979. Pick the drive with the most available free space.
  980. T}
  981. T{
  982. msplfs (most shared path, least free space)
  983. T}@T{
  984. Like \f[B]eplfs\f[R] but if it fails to find a branch it will try again
  985. with the parent directory.
  986. Continues this pattern till finding one.
  987. T}
  988. T{
  989. msplus (most shared path, least used space)
  990. T}@T{
  991. Like \f[B]eplus\f[R] but if it fails to find a branch it will try again
  992. with the parent directory.
  993. Continues this pattern till finding one.
  994. T}
  995. T{
  996. mspmfs (most shared path, most free space)
  997. T}@T{
  998. Like \f[B]epmfs\f[R] but if it fails to find a branch it will try again
  999. with the parent directory.
  1000. Continues this pattern till finding one.
  1001. T}
  1002. T{
  1003. msppfrd (most shared path, percentage free random distribution)
  1004. T}@T{
  1005. Like \f[B]eppfrd\f[R] but if it fails to find a branch it will try again
  1006. with the parent directory.
  1007. Continues this pattern till finding one.
  1008. T}
  1009. T{
  1010. newest
  1011. T}@T{
  1012. Pick the file / directory with the largest mtime.
  1013. T}
  1014. T{
  1015. pfrd (percentage free random distribution)
  1016. T}@T{
  1017. Chooses a branch at random with the likelihood of selection based on a
  1018. branch\[cq]s available space relative to the total.
  1019. T}
  1020. T{
  1021. rand (random)
  1022. T}@T{
  1023. Calls \f[B]all\f[R] and then randomizes.
  1024. Returns 1 branch.
  1025. T}
  1026. .TE
  1027. .PP
  1028. \f[B]NOTE:\f[R] If you are using an underlying filesystem that reserves
  1029. blocks such as ext2, ext3, or ext4 be aware that mergerfs respects the
  1030. reservation by using \f[C]f_bavail\f[R] (number of free blocks for
  1031. unprivileged users) rather than \f[C]f_bfree\f[R] (number of free
  1032. blocks) in policy calculations.
  1033. \f[B]df\f[R] does NOT use \f[C]f_bavail\f[R], it uses \f[C]f_bfree\f[R],
  1034. so direct comparisons between \f[B]df\f[R] output and mergerfs\[cq]
  1035. policies is not appropriate.
  1036. .SS Defaults
  1037. .PP
  1038. .TS
  1039. tab(@);
  1040. l l.
  1041. T{
  1042. Category
  1043. T}@T{
  1044. Policy
  1045. T}
  1046. _
  1047. T{
  1048. action
  1049. T}@T{
  1050. epall
  1051. T}
  1052. T{
  1053. create
  1054. T}@T{
  1055. epmfs
  1056. T}
  1057. T{
  1058. search
  1059. T}@T{
  1060. ff
  1061. T}
  1062. .TE
  1063. .SS ioctl
  1064. .PP
  1065. When \f[C]ioctl\f[R] is used with an open file then it will use the file
  1066. handle which was created at the original \f[C]open\f[R] call.
  1067. However, when using \f[C]ioctl\f[R] with a directory mergerfs will use
  1068. the \f[C]open\f[R] policy to find the directory to act on.
  1069. .SS rename & link
  1070. .PP
  1071. \f[B]NOTE:\f[R] If you\[cq]re receiving errors from software when files
  1072. are moved / renamed / linked then you should consider changing the
  1073. create policy to one which is \f[B]not\f[R] path preserving, enabling
  1074. \f[C]ignorepponrename\f[R], or contacting the author of the offending
  1075. software and requesting that \f[C]EXDEV\f[R] (cross device / improper
  1076. link) be properly handled.
  1077. .PP
  1078. \f[C]rename\f[R] and \f[C]link\f[R] are tricky functions in a union
  1079. filesystem.
  1080. \f[C]rename\f[R] only works within a single filesystem or device.
  1081. If a rename can\[cq]t be done atomically due to the source and
  1082. destination paths existing on different mount points it will return
  1083. \f[B]-1\f[R] with \f[B]errno = EXDEV\f[R] (cross device / improper
  1084. link).
  1085. So if a \f[C]rename\f[R]\[cq]s source and target are on different drives
  1086. within the pool it creates an issue.
  1087. .PP
  1088. Originally mergerfs would return EXDEV whenever a rename was requested
  1089. which was cross directory in any way.
  1090. This made the code simple and was technically compliant with POSIX
  1091. requirements.
  1092. However, many applications fail to handle EXDEV at all and treat it as a
  1093. normal error or otherwise handle it poorly.
  1094. Such apps include: gvfsd-fuse v1.20.3 and prior, Finder / CIFS/SMB
  1095. client in Apple OSX 10.9+, NZBGet, Samba\[cq]s recycling bin feature.
  1096. .PP
  1097. As a result a compromise was made in order to get most software to work
  1098. while still obeying mergerfs\[cq] policies.
  1099. Below is the basic logic.
  1100. .IP \[bu] 2
  1101. If using a \f[B]create\f[R] policy which tries to preserve directory
  1102. paths (epff,eplfs,eplus,epmfs)
  1103. .RS 2
  1104. .IP \[bu] 2
  1105. Using the \f[B]rename\f[R] policy get the list of files to rename
  1106. .IP \[bu] 2
  1107. For each file attempt rename:
  1108. .RS 2
  1109. .IP \[bu] 2
  1110. If failure with ENOENT (no such file or directory) run \f[B]create\f[R]
  1111. policy
  1112. .IP \[bu] 2
  1113. If create policy returns the same drive as currently evaluating then
  1114. clone the path
  1115. .IP \[bu] 2
  1116. Re-attempt rename
  1117. .RE
  1118. .IP \[bu] 2
  1119. If \f[B]any\f[R] of the renames succeed the higher level rename is
  1120. considered a success
  1121. .IP \[bu] 2
  1122. If \f[B]no\f[R] renames succeed the first error encountered will be
  1123. returned
  1124. .IP \[bu] 2
  1125. On success:
  1126. .RS 2
  1127. .IP \[bu] 2
  1128. Remove the target from all drives with no source file
  1129. .IP \[bu] 2
  1130. Remove the source from all drives which failed to rename
  1131. .RE
  1132. .RE
  1133. .IP \[bu] 2
  1134. If using a \f[B]create\f[R] policy which does \f[B]not\f[R] try to
  1135. preserve directory paths
  1136. .RS 2
  1137. .IP \[bu] 2
  1138. Using the \f[B]rename\f[R] policy get the list of files to rename
  1139. .IP \[bu] 2
  1140. Using the \f[B]getattr\f[R] policy get the target path
  1141. .IP \[bu] 2
  1142. For each file attempt rename:
  1143. .RS 2
  1144. .IP \[bu] 2
  1145. If the source drive != target drive:
  1146. .RS 2
  1147. .IP \[bu] 2
  1148. Clone target path from target drive to source drive
  1149. .RE
  1150. .IP \[bu] 2
  1151. Rename
  1152. .RE
  1153. .IP \[bu] 2
  1154. If \f[B]any\f[R] of the renames succeed the higher level rename is
  1155. considered a success
  1156. .IP \[bu] 2
  1157. If \f[B]no\f[R] renames succeed the first error encountered will be
  1158. returned
  1159. .IP \[bu] 2
  1160. On success:
  1161. .RS 2
  1162. .IP \[bu] 2
  1163. Remove the target from all drives with no source file
  1164. .IP \[bu] 2
  1165. Remove the source from all drives which failed to rename
  1166. .RE
  1167. .RE
  1168. .PP
  1169. The the removals are subject to normal entitlement checks.
  1170. .PP
  1171. The above behavior will help minimize the likelihood of EXDEV being
  1172. returned but it will still be possible.
  1173. .PP
  1174. \f[B]link\f[R] uses the same strategy but without the removals.
  1175. .SS readdir
  1176. .PP
  1177. readdir (http://linux.die.net/man/3/readdir) is different from all other
  1178. filesystem functions.
  1179. While it could have its own set of policies to tweak its behavior at
  1180. this time it provides a simple union of files and directories found.
  1181. Remember that any action or information queried about these files and
  1182. directories come from the respective function.
  1183. For instance: an \f[B]ls\f[R] is a \f[B]readdir\f[R] and for each
  1184. file/directory returned \f[B]getattr\f[R] is called.
  1185. Meaning the policy of \f[B]getattr\f[R] is responsible for choosing the
  1186. file/directory which is the source of the metadata you see in an
  1187. \f[B]ls\f[R].
  1188. .SS statfs / statvfs
  1189. .PP
  1190. statvfs (http://linux.die.net/man/2/statvfs) normalizes the source
  1191. drives based on the fragment size and sums the number of adjusted blocks
  1192. and inodes.
  1193. This means you will see the combined space of all sources.
  1194. Total, used, and free.
  1195. The sources however are dedupped based on the drive so multiple sources
  1196. on the same drive will not result in double counting its space.
  1197. Filesystems mounted further down the tree of the branch will not be
  1198. included when checking the mount\[cq]s stats.
  1199. .PP
  1200. The options \f[C]statfs\f[R] and \f[C]statfs_ignore\f[R] can be used to
  1201. modify \f[C]statfs\f[R] behavior.
  1202. .SH ERROR HANDLING
  1203. .PP
  1204. POSIX filesystem functions offer a single return code meaning that there
  1205. is some complication regarding the handling of multiple branches as
  1206. mergerfs does.
  1207. It tries to handle errors in a way that would generally return
  1208. meaningful values for that particular function.
  1209. .SS chmod, chown, removexattr, setxattr, truncate, utimens
  1210. .IP "1)" 3
  1211. if no error: return 0 (success)
  1212. .IP "2)" 3
  1213. if no successes: return first error
  1214. .IP "3)" 3
  1215. if one of the files acted on was the same as the related search
  1216. function: return its value
  1217. .IP "4)" 3
  1218. return 0 (success)
  1219. .PP
  1220. While doing this increases the complexity and cost of error handling,
  1221. particularly step 3, this provides probably the most reasonable return
  1222. value.
  1223. .SS unlink, rmdir
  1224. .IP "1)" 3
  1225. if no errors: return 0 (success)
  1226. .IP "2)" 3
  1227. return first error
  1228. .PP
  1229. Older version of mergerfs would return success if any success occurred
  1230. but for unlink and rmdir there are downstream assumptions that, while
  1231. not impossible to occur, can confuse some software.
  1232. .SS others
  1233. .PP
  1234. For search functions there is always a single thing acted on and as such
  1235. whatever return value that comes from the single function call is
  1236. returned.
  1237. .PP
  1238. For create functions \f[C]mkdir\f[R], \f[C]mknod\f[R], and
  1239. \f[C]symlink\f[R] which don\[cq]t return a file descriptor and therefore
  1240. can have \f[C]all\f[R] or \f[C]epall\f[R] policies it will return
  1241. success if any of the calls succeed and an error otherwise.
  1242. .SH BUILD / UPDATE
  1243. .PP
  1244. \f[B]NOTE:\f[R] Prebuilt packages can be found at and recommended for
  1245. most users: https://github.com/trapexit/mergerfs/releases
  1246. \f[B]NOTE:\f[R] Only tagged releases are supported.
  1247. \f[C]master\f[R] and other branches should be considered works in
  1248. progress.
  1249. .PP
  1250. First get the code from github (https://github.com/trapexit/mergerfs).
  1251. .IP
  1252. .nf
  1253. \f[C]
  1254. $ git clone https://github.com/trapexit/mergerfs.git
  1255. $ # or
  1256. $ wget https://github.com/trapexit/mergerfs/releases/download/<ver>/mergerfs-<ver>.tar.gz
  1257. \f[R]
  1258. .fi
  1259. .SS Debian / Ubuntu
  1260. .IP
  1261. .nf
  1262. \f[C]
  1263. $ cd mergerfs
  1264. $ sudo tools/install-build-pkgs
  1265. $ make deb
  1266. $ sudo dpkg -i ../mergerfs_<version>_<arch>.deb
  1267. \f[R]
  1268. .fi
  1269. .SS RHEL / CentOS /Fedora
  1270. .IP
  1271. .nf
  1272. \f[C]
  1273. $ su -
  1274. # cd mergerfs
  1275. # tools/install-build-pkgs
  1276. # make rpm
  1277. # rpm -i rpmbuild/RPMS/<arch>/mergerfs-<version>.<arch>.rpm
  1278. \f[R]
  1279. .fi
  1280. .SS Generically
  1281. .PP
  1282. Have git, g++, make, python installed.
  1283. .IP
  1284. .nf
  1285. \f[C]
  1286. $ cd mergerfs
  1287. $ make
  1288. $ sudo make install
  1289. \f[R]
  1290. .fi
  1291. .SS Build options
  1292. .IP
  1293. .nf
  1294. \f[C]
  1295. $ make help
  1296. usage: make
  1297. make USE_XATTR=0 - build program without xattrs functionality
  1298. make STATIC=1 - build static binary
  1299. make LTO=1 - build with link time optimization
  1300. \f[R]
  1301. .fi
  1302. .SH UPGRADE
  1303. .PP
  1304. mergerfs can be upgraded live by mounting on top of the previous
  1305. instance.
  1306. Simply install the new version of mergerfs and follow the instructions
  1307. below.
  1308. .PP
  1309. Run mergerfs again or if using \f[C]/etc/fstab\f[R] call for it to mount
  1310. again.
  1311. Existing open files and such will continue to work fine though they
  1312. won\[cq]t see runtime changes since any such change would be the new
  1313. mount.
  1314. If you plan on changing settings with the new mount you should / could
  1315. apply those before mounting the new version.
  1316. .IP
  1317. .nf
  1318. \f[C]
  1319. $ sudo mount /mnt/mergerfs
  1320. $ mount | grep mergerfs
  1321. media on /mnt/mergerfs type fuse.mergerfs (rw,relatime,user_id=0,group_id=0,default_permissions,allow_other)
  1322. media on /mnt/mergerfs type fuse.mergerfs (rw,relatime,user_id=0,group_id=0,default_permissions,allow_other)
  1323. \f[R]
  1324. .fi
  1325. .PP
  1326. A problem with this approach is that the underlying instance will
  1327. continue to run even if the software using it stop or are restarted.
  1328. To work around this you can use a \[lq]lazy umount\[rq].
  1329. Before mounting over top the mount point with the new instance of
  1330. mergerfs issue: \f[C]umount -l <mergerfs_mountpoint>\f[R].
  1331. .SH RUNTIME CONFIG
  1332. .SS .mergerfs pseudo file
  1333. .IP
  1334. .nf
  1335. \f[C]
  1336. <mountpoint>/.mergerfs
  1337. \f[R]
  1338. .fi
  1339. .PP
  1340. There is a pseudo file available at the mount point which allows for the
  1341. runtime modification of certain \f[B]mergerfs\f[R] options.
  1342. The file will not show up in \f[B]readdir\f[R] but can be
  1343. \f[B]stat\f[R]\[cq]ed and manipulated via
  1344. {list,get,set}xattrs (http://linux.die.net/man/2/listxattr) calls.
  1345. .PP
  1346. Any changes made at runtime are \f[B]not\f[R] persisted.
  1347. If you wish for values to persist they must be included as options
  1348. wherever you configure the mounting of mergerfs (/etc/fstab).
  1349. .SS Keys
  1350. .PP
  1351. Use \f[C]getfattr -d /mountpoint/.mergerfs\f[R] or
  1352. \f[C]xattr -l /mountpoint/.mergerfs\f[R] to see all supported keys.
  1353. Some are informational and therefore read-only.
  1354. \f[C]setxattr\f[R] will return EINVAL (invalid argument) on read-only
  1355. keys.
  1356. .SS Values
  1357. .PP
  1358. Same as the command line.
  1359. .SS user.mergerfs.branches
  1360. .PP
  1361. Used to query or modify the list of branches.
  1362. When modifying there are several shortcuts to easy manipulation of the
  1363. list.
  1364. .PP
  1365. .TS
  1366. tab(@);
  1367. l l.
  1368. T{
  1369. Value
  1370. T}@T{
  1371. Description
  1372. T}
  1373. _
  1374. T{
  1375. [list]
  1376. T}@T{
  1377. set
  1378. T}
  1379. T{
  1380. +<[list]
  1381. T}@T{
  1382. prepend
  1383. T}
  1384. T{
  1385. +>[list]
  1386. T}@T{
  1387. append
  1388. T}
  1389. T{
  1390. -[list]
  1391. T}@T{
  1392. remove all values provided
  1393. T}
  1394. T{
  1395. -<
  1396. T}@T{
  1397. remove first in list
  1398. T}
  1399. T{
  1400. ->
  1401. T}@T{
  1402. remove last in list
  1403. T}
  1404. .TE
  1405. .PP
  1406. \f[C]xattr -w user.mergerfs.branches +</mnt/drive3 /mnt/pool/.mergerfs\f[R]
  1407. .PP
  1408. The \f[C]=NC\f[R], \f[C]=RO\f[R], \f[C]=RW\f[R] syntax works just as on
  1409. the command line.
  1410. .SS Example
  1411. .IP
  1412. .nf
  1413. \f[C]
  1414. [trapexit:/mnt/mergerfs] $ getfattr -d .mergerfs
  1415. user.mergerfs.branches=\[dq]/mnt/a=RW:/mnt/b=RW\[dq]
  1416. user.mergerfs.minfreespace=\[dq]4294967295\[dq]
  1417. user.mergerfs.moveonenospc=\[dq]false\[dq]
  1418. \&...
  1419. [trapexit:/mnt/mergerfs] $ getfattr -n user.mergerfs.category.search .mergerfs
  1420. user.mergerfs.category.search=\[dq]ff\[dq]
  1421. [trapexit:/mnt/mergerfs] $ setfattr -n user.mergerfs.category.search -v newest .mergerfs
  1422. [trapexit:/mnt/mergerfs] $ getfattr -n user.mergerfs.category.search .mergerfs
  1423. user.mergerfs.category.search=\[dq]newest\[dq]
  1424. \f[R]
  1425. .fi
  1426. .SS file / directory xattrs
  1427. .PP
  1428. While they won\[cq]t show up when using \f[C]getfattr\f[R]
  1429. \f[B]mergerfs\f[R] offers a number of special xattrs to query
  1430. information about the files served.
  1431. To access the values you will need to issue a
  1432. getxattr (http://linux.die.net/man/2/getxattr) for one of the following:
  1433. .IP \[bu] 2
  1434. \f[B]user.mergerfs.basepath\f[R]: the base mount point for the file
  1435. given the current getattr policy
  1436. .IP \[bu] 2
  1437. \f[B]user.mergerfs.relpath\f[R]: the relative path of the file from the
  1438. perspective of the mount point
  1439. .IP \[bu] 2
  1440. \f[B]user.mergerfs.fullpath\f[R]: the full path of the original file
  1441. given the getattr policy
  1442. .IP \[bu] 2
  1443. \f[B]user.mergerfs.allpaths\f[R]: a NUL (`\[rs]0') separated list of
  1444. full paths to all files found
  1445. .SH TOOLING
  1446. .IP \[bu] 2
  1447. https://github.com/trapexit/mergerfs-tools
  1448. .RS 2
  1449. .IP \[bu] 2
  1450. mergerfs.ctl: A tool to make it easier to query and configure mergerfs
  1451. at runtime
  1452. .IP \[bu] 2
  1453. mergerfs.fsck: Provides permissions and ownership auditing and the
  1454. ability to fix them
  1455. .IP \[bu] 2
  1456. mergerfs.dedup: Will help identify and optionally remove duplicate files
  1457. .IP \[bu] 2
  1458. mergerfs.dup: Ensure there are at least N copies of a file across the
  1459. pool
  1460. .IP \[bu] 2
  1461. mergerfs.balance: Rebalance files across drives by moving them from the
  1462. most filled to the least filled
  1463. .IP \[bu] 2
  1464. mergerfs.consolidate: move files within a single mergerfs directory to
  1465. the drive with most free space
  1466. .RE
  1467. .IP \[bu] 2
  1468. https://github.com/trapexit/scorch
  1469. .RS 2
  1470. .IP \[bu] 2
  1471. scorch: A tool to help discover silent corruption of files and keep
  1472. track of files
  1473. .RE
  1474. .IP \[bu] 2
  1475. https://github.com/trapexit/bbf
  1476. .RS 2
  1477. .IP \[bu] 2
  1478. bbf (bad block finder): a tool to scan for and `fix' hard drive bad
  1479. blocks and find the files using those blocks
  1480. .RE
  1481. .SH CACHING
  1482. .SS page caching
  1483. .PP
  1484. https://en.wikipedia.org/wiki/Page_cache
  1485. .IP \[bu] 2
  1486. cache.files=off: Disables page caching.
  1487. Underlying files cached, mergerfs files are not.
  1488. .IP \[bu] 2
  1489. cache.files=partial: Enables page caching.
  1490. Underlying files cached, mergerfs files cached while open.
  1491. .IP \[bu] 2
  1492. cache.files=full: Enables page caching.
  1493. Underlying files cached, mergerfs files cached across opens.
  1494. .IP \[bu] 2
  1495. cache.files=auto-full: Enables page caching.
  1496. Underlying files cached, mergerfs files cached across opens if mtime and
  1497. size are unchanged since previous open.
  1498. .IP \[bu] 2
  1499. cache.files=libfuse: follow traditional libfuse \f[C]direct_io\f[R],
  1500. \f[C]kernel_cache\f[R], and \f[C]auto_cache\f[R] arguments.
  1501. .IP \[bu] 2
  1502. cache.files=per-process: Enable page caching only for processes which
  1503. `comm' name matches one of the values defined in
  1504. \f[C]cache.files.process-names\f[R].
  1505. .PP
  1506. FUSE, which mergerfs uses, offers a number of page caching modes.
  1507. mergerfs tries to simplify their use via the \f[C]cache.files\f[R]
  1508. option.
  1509. It can and should replace usage of \f[C]direct_io\f[R],
  1510. \f[C]kernel_cache\f[R], and \f[C]auto_cache\f[R].
  1511. .PP
  1512. Due to mergerfs using FUSE and therefore being a userland process
  1513. proxying existing filesystems the kernel will double cache the content
  1514. being read and written through mergerfs.
  1515. Once from the underlying filesystem and once from mergerfs (it sees them
  1516. as two separate entities).
  1517. Using \f[C]cache.files=off\f[R] will keep the double caching from
  1518. happening by disabling caching of mergerfs but this has the side effect
  1519. that \f[I]all\f[R] read and write calls will be passed to mergerfs which
  1520. may be slower than enabling caching, you lose shared \f[C]mmap\f[R]
  1521. support which can affect apps such as rtorrent, and no read-ahead will
  1522. take place.
  1523. The kernel will still cache the underlying filesystem data but that only
  1524. helps so much given mergerfs will still process all requests.
  1525. .PP
  1526. If you do enable file page caching,
  1527. \f[C]cache.files=partial|full|auto-full\f[R], you should also enable
  1528. \f[C]dropcacheonclose\f[R] which will cause mergerfs to instruct the
  1529. kernel to flush the underlying file\[cq]s page cache when the file is
  1530. closed.
  1531. This behavior is the same as the rsync fadvise / drop cache patch and
  1532. Feh\[cq]s nocache project.
  1533. .PP
  1534. If most files are read once through and closed (like media) it is best
  1535. to enable \f[C]dropcacheonclose\f[R] regardless of caching mode in order
  1536. to minimize buffer bloat.
  1537. .PP
  1538. It is difficult to balance memory usage, cache bloat & duplication, and
  1539. performance.
  1540. Ideally mergerfs would be able to disable caching for the files it
  1541. reads/writes but allow page caching for itself.
  1542. That would limit the FUSE overhead.
  1543. However, there isn\[cq]t a good way to achieve this.
  1544. It would need to open all files with O_DIRECT which places limitations
  1545. on the what underlying filesystems would be supported and complicates
  1546. the code.
  1547. .PP
  1548. kernel documentation:
  1549. https://www.kernel.org/doc/Documentation/filesystems/fuse-io.txt
  1550. .SS entry & attribute caching
  1551. .PP
  1552. Given the relatively high cost of FUSE due to the kernel <-> userspace
  1553. round trips there are kernel side caches for file entries and
  1554. attributes.
  1555. The entry cache limits the \f[C]lookup\f[R] calls to mergerfs which ask
  1556. if a file exists.
  1557. The attribute cache limits the need to make \f[C]getattr\f[R] calls to
  1558. mergerfs which provide file attributes (mode, size, type, etc.).
  1559. As with the page cache these should not be used if the underlying
  1560. filesystems are being manipulated at the same time as it could lead to
  1561. odd behavior or data corruption.
  1562. The options for setting these are \f[C]cache.entry\f[R] and
  1563. \f[C]cache.negative_entry\f[R] for the entry cache and
  1564. \f[C]cache.attr\f[R] for the attributes cache.
  1565. \f[C]cache.negative_entry\f[R] refers to the timeout for negative
  1566. responses to lookups (non-existent files).
  1567. .SS writeback caching
  1568. .PP
  1569. When \f[C]cache.files\f[R] is enabled the default is for it to perform
  1570. writethrough caching.
  1571. This behavior won\[cq]t help improve performance as each write still
  1572. goes one for one through the filesystem.
  1573. By enabling the FUSE writeback cache small writes may be aggregated by
  1574. the kernel and then sent to mergerfs as one larger request.
  1575. This can greatly improve the throughput for apps which write to files
  1576. inefficiently.
  1577. The amount the kernel can aggregate is limited by the size of a FUSE
  1578. message.
  1579. Read the \f[C]fuse_msg_size\f[R] section for more details.
  1580. .PP
  1581. There is a small side effect as a result of enabling writeback caching.
  1582. Underlying files won\[cq]t ever be opened with O_APPEND or O_WRONLY.
  1583. The former because the kernel then manages append mode and the latter
  1584. because the kernel may request file data from mergerfs to populate the
  1585. write cache.
  1586. The O_APPEND change means that if a file is changed outside of mergerfs
  1587. it could lead to corruption as the kernel won\[cq]t know the end of the
  1588. file has changed.
  1589. That said any time you use caching you should keep from using the same
  1590. file outside of mergerfs at the same time.
  1591. .PP
  1592. Note that if an application is properly sizing writes then writeback
  1593. caching will have little or no effect.
  1594. It will only help with writes of sizes below the FUSE message size (128K
  1595. on older kernels, 1M on newer).
  1596. .SS policy caching
  1597. .PP
  1598. Policies are run every time a function (with a policy as mentioned
  1599. above) is called.
  1600. These policies can be expensive depending on mergerfs\[cq] setup and
  1601. client usage patterns.
  1602. Generally we wouldn\[cq]t want to cache policy results because it may
  1603. result in stale responses if the underlying drives are used directly.
  1604. .PP
  1605. The \f[C]open\f[R] policy cache will cache the result of an
  1606. \f[C]open\f[R] policy for a particular input for \f[C]cache.open\f[R]
  1607. seconds or until the file is unlinked.
  1608. Each file close (release) will randomly chose to clean up the cache of
  1609. expired entries.
  1610. .PP
  1611. This cache is really only useful in cases where you have a large number
  1612. of branches and \f[C]open\f[R] is called on the same files repeatedly
  1613. (like \f[B]Transmission\f[R] which opens and closes a file on every
  1614. read/write presumably to keep file handle usage low).
  1615. .SS statfs caching
  1616. .PP
  1617. Of the syscalls used by mergerfs in policies the \f[C]statfs\f[R] /
  1618. \f[C]statvfs\f[R] call is perhaps the most expensive.
  1619. It\[cq]s used to find out the available space of a drive and whether it
  1620. is mounted read-only.
  1621. Depending on the setup and usage pattern these queries can be relatively
  1622. costly.
  1623. When \f[C]cache.statfs\f[R] is enabled all calls to \f[C]statfs\f[R] by
  1624. a policy will be cached for the number of seconds its set to.
  1625. .PP
  1626. Example: If the create policy is \f[C]mfs\f[R] and the timeout is 60
  1627. then for that 60 seconds the same drive will be returned as the target
  1628. for creates because the available space won\[cq]t be updated for that
  1629. time.
  1630. .SS symlink caching
  1631. .PP
  1632. As of version 4.20 Linux supports symlink caching.
  1633. Significant performance increases can be had in workloads which use a
  1634. lot of symlinks.
  1635. Setting \f[C]cache.symlinks=true\f[R] will result in requesting symlink
  1636. caching from the kernel only if supported.
  1637. As a result its safe to enable it on systems prior to 4.20.
  1638. That said it is disabled by default for now.
  1639. You can see if caching is enabled by querying the xattr
  1640. \f[C]user.mergerfs.cache.symlinks\f[R] but given it must be requested at
  1641. startup you can not change it at runtime.
  1642. .SS readdir caching
  1643. .PP
  1644. As of version 4.20 Linux supports readdir caching.
  1645. This can have a significant impact on directory traversal.
  1646. Especially when combined with entry (\f[C]cache.entry\f[R]) and
  1647. attribute (\f[C]cache.attr\f[R]) caching.
  1648. Setting \f[C]cache.readdir=true\f[R] will result in requesting readdir
  1649. caching from the kernel on each \f[C]opendir\f[R].
  1650. If the kernel doesn\[cq]t support readdir caching setting the option to
  1651. \f[C]true\f[R] has no effect.
  1652. This option is configurable at runtime via xattr
  1653. \f[C]user.mergerfs.cache.readdir\f[R].
  1654. .SS tiered caching
  1655. .PP
  1656. Some storage technologies support what some call \[lq]tiered\[rq]
  1657. caching.
  1658. The placing of usually smaller, faster storage as a transparent cache to
  1659. larger, slower storage.
  1660. NVMe, SSD, Optane in front of traditional HDDs for instance.
  1661. .PP
  1662. MergerFS does not natively support any sort of tiered caching.
  1663. Most users have no use for such a feature and its inclusion would
  1664. complicate the code.
  1665. However, there are a few situations where a cache drive could help with
  1666. a typical mergerfs setup.
  1667. .IP "1." 3
  1668. Fast network, slow drives, many readers: You\[cq]ve a 10+Gbps network
  1669. with many readers and your regular drives can\[cq]t keep up.
  1670. .IP "2." 3
  1671. Fast network, slow drives, small\[cq]ish bursty writes: You have a
  1672. 10+Gbps network and wish to transfer amounts of data less than your
  1673. cache drive but wish to do so quickly.
  1674. .PP
  1675. With #1 it\[cq]s arguable if you should be using mergerfs at all.
  1676. RAID would probably be the better solution.
  1677. If you\[cq]re going to use mergerfs there are other tactics that may
  1678. help: spreading the data across drives (see the mergerfs.dup tool) and
  1679. setting \f[C]func.open=rand\f[R], using \f[C]symlinkify\f[R], or using
  1680. dm-cache or a similar technology to add tiered cache to the underlying
  1681. device.
  1682. .PP
  1683. With #2 one could use dm-cache as well but there is another solution
  1684. which requires only mergerfs and a cronjob.
  1685. .IP "1." 3
  1686. Create 2 mergerfs pools.
  1687. One which includes just the slow drives and one which has both the fast
  1688. drives (SSD,NVME,etc.) and slow drives.
  1689. .IP "2." 3
  1690. The `cache' pool should have the cache drives listed first.
  1691. .IP "3." 3
  1692. The best \f[C]create\f[R] policies to use for the `cache' pool would
  1693. probably be \f[C]ff\f[R], \f[C]epff\f[R], \f[C]lfs\f[R], or
  1694. \f[C]eplfs\f[R].
  1695. The latter two under the assumption that the cache drive(s) are far
  1696. smaller than the backing drives.
  1697. If using path preserving policies remember that you\[cq]ll need to
  1698. manually create the core directories of those paths you wish to be
  1699. cached.
  1700. Be sure the permissions are in sync.
  1701. Use \f[C]mergerfs.fsck\f[R] to check / correct them.
  1702. You could also tag the slow drives as \f[C]=NC\f[R] though that\[cq]d
  1703. mean if the cache drives fill you\[cq]d get \[lq]out of space\[rq]
  1704. errors.
  1705. .IP "4." 3
  1706. Enable \f[C]moveonenospc\f[R] and set \f[C]minfreespace\f[R]
  1707. appropriately.
  1708. To make sure there is enough room on the \[lq]slow\[rq] pool you might
  1709. want to set \f[C]minfreespace\f[R] to at least as large as the size of
  1710. the largest cache drive if not larger.
  1711. This way in the worst case the whole of the cache drive(s) can be moved
  1712. to the other drives.
  1713. .IP "5." 3
  1714. Set your programs to use the cache pool.
  1715. .IP "6." 3
  1716. Save one of the below scripts or create you\[cq]re own.
  1717. .IP "7." 3
  1718. Use \f[C]cron\f[R] (as root) to schedule the command at whatever
  1719. frequency is appropriate for your workflow.
  1720. .SS time based expiring
  1721. .PP
  1722. Move files from cache to backing pool based only on the last time the
  1723. file was accessed.
  1724. Replace \f[C]-atime\f[R] with \f[C]-amin\f[R] if you want minutes rather
  1725. than days.
  1726. May want to use the \f[C]fadvise\f[R] / \f[C]--drop-cache\f[R] version
  1727. of rsync or run rsync with the tool \[lq]nocache\[rq].
  1728. .PP
  1729. \f[I]NOTE:\f[R] The arguments to these scripts include the cache
  1730. \f[B]drive\f[R].
  1731. Not the pool with the cache drive.
  1732. You could have data loss if the source is the cache pool.
  1733. .IP
  1734. .nf
  1735. \f[C]
  1736. #!/bin/bash
  1737. if [ $# != 3 ]; then
  1738. echo \[dq]usage: $0 <cache-drive> <backing-pool> <days-old>\[dq]
  1739. exit 1
  1740. fi
  1741. CACHE=\[dq]${1}\[dq]
  1742. BACKING=\[dq]${2}\[dq]
  1743. N=${3}
  1744. find \[dq]${CACHE}\[dq] -type f -atime +${N} -printf \[aq]%P\[rs]n\[aq] | \[rs]
  1745. rsync --files-from=- -axqHAXWES --preallocate --remove-source-files \[dq]${CACHE}/\[dq] \[dq]${BACKING}/\[dq]
  1746. \f[R]
  1747. .fi
  1748. .SS percentage full expiring
  1749. .PP
  1750. Move the oldest file from the cache to the backing pool.
  1751. Continue till below percentage threshold.
  1752. .PP
  1753. \f[I]NOTE:\f[R] The arguments to these scripts include the cache
  1754. \f[B]drive\f[R].
  1755. Not the pool with the cache drive.
  1756. You could have data loss if the source is the cache pool.
  1757. .IP
  1758. .nf
  1759. \f[C]
  1760. #!/bin/bash
  1761. if [ $# != 3 ]; then
  1762. echo \[dq]usage: $0 <cache-drive> <backing-pool> <percentage>\[dq]
  1763. exit 1
  1764. fi
  1765. CACHE=\[dq]${1}\[dq]
  1766. BACKING=\[dq]${2}\[dq]
  1767. PERCENTAGE=${3}
  1768. set -o errexit
  1769. while [ $(df --output=pcent \[dq]${CACHE}\[dq] | grep -v Use | cut -d\[aq]%\[aq] -f1) -gt ${PERCENTAGE} ]
  1770. do
  1771. FILE=$(find \[dq]${CACHE}\[dq] -type f -printf \[aq]%A\[at] %P\[rs]n\[aq] | \[rs]
  1772. sort | \[rs]
  1773. head -n 1 | \[rs]
  1774. cut -d\[aq] \[aq] -f2-)
  1775. test -n \[dq]${FILE}\[dq]
  1776. rsync -axqHAXWESR --preallocate --remove-source-files \[dq]${CACHE}/./${FILE}\[dq] \[dq]${BACKING}/\[dq]
  1777. done
  1778. \f[R]
  1779. .fi
  1780. .SH PERFORMANCE
  1781. .PP
  1782. mergerfs is at its core just a proxy and therefore its theoretical max
  1783. performance is that of the underlying devices.
  1784. However, given it is a FUSE filesystem working from userspace there is
  1785. an increase in overhead relative to kernel based solutions.
  1786. That said the performance can match the theoretical max but it depends
  1787. greatly on the system\[cq]s configuration.
  1788. Especially when adding network filesystems into the mix there are many
  1789. variables which can impact performance.
  1790. Drive speeds and latency, network speeds and latency, general
  1791. concurrency, read/write sizes, etc.
  1792. Unfortunately, given the number of variables it has been difficult to
  1793. find a single set of settings which provide optimal performance.
  1794. If you\[cq]re having performance issues please look over the suggestions
  1795. below (including the benchmarking section.)
  1796. .PP
  1797. NOTE: be sure to read about these features before changing them to
  1798. understand what behaviors it may impact
  1799. .IP \[bu] 2
  1800. enable (or disable) \f[C]splice_move\f[R], \f[C]splice_read\f[R], and
  1801. \f[C]splice_write\f[R]
  1802. .IP \[bu] 2
  1803. disable \f[C]security_capability\f[R] and/or \f[C]xattr\f[R]
  1804. .IP \[bu] 2
  1805. increase cache timeouts \f[C]cache.attr\f[R], \f[C]cache.entry\f[R],
  1806. \f[C]cache.negative_entry\f[R]
  1807. .IP \[bu] 2
  1808. enable (or disable) page caching (\f[C]cache.files\f[R])
  1809. .IP \[bu] 2
  1810. enable \f[C]cache.writeback\f[R]
  1811. .IP \[bu] 2
  1812. enable \f[C]cache.open\f[R]
  1813. .IP \[bu] 2
  1814. enable \f[C]cache.statfs\f[R]
  1815. .IP \[bu] 2
  1816. enable \f[C]cache.symlinks\f[R]
  1817. .IP \[bu] 2
  1818. enable \f[C]cache.readdir\f[R]
  1819. .IP \[bu] 2
  1820. change the number of worker threads
  1821. .IP \[bu] 2
  1822. disable \f[C]posix_acl\f[R]
  1823. .IP \[bu] 2
  1824. disable \f[C]async_read\f[R]
  1825. .IP \[bu] 2
  1826. test theoretical performance using \f[C]nullrw\f[R] or mounting a ram
  1827. disk
  1828. .IP \[bu] 2
  1829. use \f[C]symlinkify\f[R] if your data is largely static and read-only
  1830. .IP \[bu] 2
  1831. use tiered cache drives
  1832. .IP \[bu] 2
  1833. use LVM and LVM cache to place a SSD in front of your HDDs
  1834. .IP \[bu] 2
  1835. if \f[C]cache.files\f[R] is enabled increase readahead:
  1836. \f[C]echo \[dq]1024\[dq] > /sys/class/bdi/0:$(stat -c%d /MOUNT)/read_ahead_kb\f[R]
  1837. .IP \[bu] 2
  1838. increase readahead on all devices:
  1839. \f[C]ls -1 /sys/class/bdi/*/read_ahead_kb | xargs -n1 -I{} sh -c \[dq]echo 1024 > {}\[dq]\f[R]
  1840. .PP
  1841. If you come across a setting that significantly impacts performance
  1842. please contact trapexit so he may investigate further.
  1843. .SH BENCHMARKING
  1844. .PP
  1845. Filesystems are complicated.
  1846. They do many things and many of those are interconnected.
  1847. Additionally, the OS, drivers, hardware, etc.
  1848. all can impact performance.
  1849. Therefore, when benchmarking, it is \f[B]necessary\f[R] that the test
  1850. focus as narrowly as possible.
  1851. .PP
  1852. For most throughput is the key benchmark.
  1853. To test throughput \f[C]dd\f[R] is useful but \f[B]must\f[R] be used
  1854. with the correct settings in order to ensure the filesystem or device is
  1855. actually being tested.
  1856. The OS can and will cache data.
  1857. Without forcing synchronous reads and writes and/or disabling caching
  1858. the values returned will not be representative of the device\[cq]s true
  1859. performance.
  1860. .PP
  1861. When benchmarking through mergerfs ensure you only use 1 branch to
  1862. remove any possibility of the policies complicating the situation.
  1863. Benchmark the underlying filesystem first and then mount mergerfs over
  1864. it and test again.
  1865. If you\[cq]re experience speeds below your expectation you will need to
  1866. narrow down precisely which component is leading to the slowdown.
  1867. Preferably test the following in the order listed (but not combined).
  1868. .IP "1." 3
  1869. Enable \f[C]nullrw\f[R] mode with \f[C]nullrw=true\f[R].
  1870. This will effectively make reads and writes no-ops.
  1871. Removing the underlying device / filesystem from the equation.
  1872. This will give us the top theoretical speeds.
  1873. .IP "2." 3
  1874. Mount mergerfs over \f[C]tmpfs\f[R].
  1875. \f[C]tmpfs\f[R] is a RAM disk.
  1876. Extremely high speed and very low latency.
  1877. This is a more realistic best case scenario.
  1878. Example: \f[C]mount -t tmpfs -o size=2G tmpfs /tmp/tmpfs\f[R]
  1879. .IP "3." 3
  1880. Mount mergerfs over a local drive.
  1881. NVMe, SSD, HDD, etc.
  1882. If you have more than one I\[cq]d suggest testing each of them as drives
  1883. and/or controllers (their drivers) could impact performance.
  1884. .IP "4." 3
  1885. Finally, if you intend to use mergerfs with a network filesystem, either
  1886. as the source of data or to combine with another through mergerfs, test
  1887. each of those alone as above.
  1888. .PP
  1889. Once you find the component which has the performance issue you can do
  1890. further testing with different options to see if they impact
  1891. performance.
  1892. For reads and writes the most relevant would be: \f[C]cache.files\f[R],
  1893. \f[C]async_read\f[R], \f[C]splice_move\f[R], \f[C]splice_read\f[R],
  1894. \f[C]splice_write\f[R].
  1895. Less likely but relevant when using NFS or with certain filesystems
  1896. would be \f[C]security_capability\f[R], \f[C]xattr\f[R], and
  1897. \f[C]posix_acl\f[R].
  1898. If you find a specific system, drive, filesystem, controller, etc.
  1899. that performs poorly contact trapexit so he may investigate further.
  1900. .PP
  1901. Sometimes the problem is really the application accessing or writing
  1902. data through mergerfs.
  1903. Some software use small buffer sizes which can lead to more requests and
  1904. therefore greater overhead.
  1905. You can test this out yourself by replace \f[C]bs=1M\f[R] in the
  1906. examples below with \f[C]ibs\f[R] or \f[C]obs\f[R] and using a size of
  1907. \f[C]512\f[R] instead of \f[C]1M\f[R].
  1908. In one example test using \f[C]nullrw\f[R] the write speed dropped from
  1909. 4.9GB/s to 69.7MB/s when moving from \f[C]1M\f[R] to \f[C]512\f[R].
  1910. Similar results were had when testing reads.
  1911. Small writes overhead may be improved by leveraging a write cache but in
  1912. casual tests little gain was found.
  1913. More tests will need to be done before this feature would become
  1914. available.
  1915. If you have an app that appears slow with mergerfs it could be due to
  1916. this.
  1917. Contact trapexit so he may investigate further.
  1918. .SS write benchmark
  1919. .IP
  1920. .nf
  1921. \f[C]
  1922. $ dd if=/dev/zero of=/mnt/mergerfs/1GB.file bs=1M count=1024 oflag=nocache conv=fdatasync status=progress
  1923. \f[R]
  1924. .fi
  1925. .SS read benchmark
  1926. .IP
  1927. .nf
  1928. \f[C]
  1929. $ dd if=/mnt/mergerfs/1GB.file of=/dev/null bs=1M count=1024 iflag=nocache conv=fdatasync status=progress
  1930. \f[R]
  1931. .fi
  1932. .SS other benchmarks
  1933. .PP
  1934. If you are attempting to benchmark other behaviors you must ensure you
  1935. clear kernel caches before runs.
  1936. In fact it would be a good deal to run before the read and write
  1937. benchmarks as well just in case.
  1938. .IP
  1939. .nf
  1940. \f[C]
  1941. sync
  1942. echo 3 | sudo tee /proc/sys/vm/drop_caches
  1943. \f[R]
  1944. .fi
  1945. .SH TIPS / NOTES
  1946. .IP \[bu] 2
  1947. This document is very literal and thorough.
  1948. Unless there is a bug things work as described.
  1949. If a suspected feature isn\[cq]t mentioned it doesn\[cq]t exist.
  1950. If certain libfuse arguments aren\[cq]t listed they probably
  1951. shouldn\[cq]t be used.
  1952. .IP \[bu] 2
  1953. Ensure you\[cq]re using the latest version.
  1954. Few distros have the latest version.
  1955. .IP \[bu] 2
  1956. Run mergerfs as \f[C]root\f[R] unless you\[cq]re merging paths which are
  1957. owned exclusively and fully by the same user otherwise strange
  1958. permission issues may arise.
  1959. mergerfs is designed and intended to be run as \f[C]root\f[R].
  1960. .IP \[bu] 2
  1961. If you don\[cq]t see some directories and files you expect, policies
  1962. seem to skip branches, you get strange permission errors, etc.
  1963. be sure the underlying filesystems\[cq] permissions are all the same.
  1964. Use \f[C]mergerfs.fsck\f[R] to audit the drive for out of sync
  1965. permissions.
  1966. .IP \[bu] 2
  1967. If you still have permission issues be sure you are using POSIX ACL
  1968. compliant filesystems.
  1969. mergerfs doesn\[cq]t generally make exceptions for FAT, NTFS, or other
  1970. non-POSIX filesystem.
  1971. .IP \[bu] 2
  1972. Do \f[B]not\f[R] use \f[C]cache.files=off\f[R] if you expect
  1973. applications (such as rtorrent) to use
  1974. mmap (http://linux.die.net/man/2/mmap) files.
  1975. Shared mmap is not currently supported in FUSE w/ page caching disabled.
  1976. Enabling \f[C]dropcacheonclose\f[R] is recommended when
  1977. \f[C]cache.files=partial|full|auto-full\f[R].
  1978. .IP \[bu] 2
  1979. Kodi (http://kodi.tv), Plex (http://plex.tv),
  1980. Subsonic (http://subsonic.org), etc.
  1981. can use directory mtime (http://linux.die.net/man/2/stat) to more
  1982. efficiently determine whether to scan for new content rather than simply
  1983. performing a full scan.
  1984. If using the default \f[B]getattr\f[R] policy of \f[B]ff\f[R] it\[cq]s
  1985. possible those programs will miss an update on account of it returning
  1986. the first directory found\[cq]s \f[B]stat\f[R] info and it\[cq]s a later
  1987. directory on another mount which had the \f[B]mtime\f[R] recently
  1988. updated.
  1989. To fix this you will want to set \f[B]func.getattr=newest\f[R].
  1990. Remember though that this is just \f[B]stat\f[R].
  1991. If the file is later \f[B]open\f[R]\[cq]ed or \f[B]unlink\f[R]\[cq]ed
  1992. and the policy is different for those then a completely different file
  1993. or directory could be acted on.
  1994. .IP \[bu] 2
  1995. Some policies mixed with some functions may result in strange behaviors.
  1996. Not that some of these behaviors and race conditions couldn\[cq]t happen
  1997. outside \f[B]mergerfs\f[R] but that they are far more likely to occur on
  1998. account of the attempt to merge together multiple sources of data which
  1999. could be out of sync due to the different policies.
  2000. .IP \[bu] 2
  2001. For consistency its generally best to set \f[B]category\f[R] wide
  2002. policies rather than individual \f[B]func\f[R]\[cq]s.
  2003. This will help limit the confusion of tools such as
  2004. rsync (http://linux.die.net/man/1/rsync).
  2005. However, the flexibility is there if needed.
  2006. .SH KNOWN ISSUES / BUGS
  2007. .SS kernel issues & bugs
  2008. .PP
  2009. <https://github.com/trapexit/mergerfs/wiki/Kernel-Issues-&-Bugs>
  2010. .SS directory mtime is not being updated
  2011. .PP
  2012. Remember that the default policy for \f[C]getattr\f[R] is \f[C]ff\f[R].
  2013. The information for the first directory found will be returned.
  2014. If it wasn\[cq]t the directory which had been updated then it will
  2015. appear outdated.
  2016. .PP
  2017. The reason this is the default is because any other policy would be more
  2018. expensive and for many applications it is unnecessary.
  2019. To always return the directory with the most recent mtime or a faked
  2020. value based on all found would require a scan of all drives.
  2021. .PP
  2022. If you always want the directory information from the one with the most
  2023. recent mtime then use the \f[C]newest\f[R] policy for \f[C]getattr\f[R].
  2024. .SS `mv /mnt/pool/foo /mnt/disk1/foo' removes `foo'
  2025. .PP
  2026. This is not a bug.
  2027. .PP
  2028. Run in verbose mode to better understand what\[cq]s happening:
  2029. .IP
  2030. .nf
  2031. \f[C]
  2032. $ mv -v /mnt/pool/foo /mnt/disk1/foo
  2033. copied \[aq]/mnt/pool/foo\[aq] -> \[aq]/mnt/disk1/foo\[aq]
  2034. removed \[aq]/mnt/pool/foo\[aq]
  2035. $ ls /mnt/pool/foo
  2036. ls: cannot access \[aq]/mnt/pool/foo\[aq]: No such file or directory
  2037. \f[R]
  2038. .fi
  2039. .PP
  2040. \f[C]mv\f[R], when working across devices, is copying the source to
  2041. target and then removing the source.
  2042. Since the source \f[B]is\f[R] the target in this case, depending on the
  2043. unlink policy, it will remove the just copied file and other files
  2044. across the branches.
  2045. .PP
  2046. If you want to move files to one drive just copy them there and use
  2047. mergerfs.dedup to clean up the old paths or manually remove them from
  2048. the branches directly.
  2049. .SS cached memory appears greater than it should be
  2050. .PP
  2051. Use \f[C]cache.files=off\f[R] and/or \f[C]dropcacheonclose=true\f[R].
  2052. See the section on page caching.
  2053. .SS NFS clients returning ESTALE / Stale file handle
  2054. .PP
  2055. NFS does not like out of band changes.
  2056. That is especially true of inode values.
  2057. .PP
  2058. Be sure to use the following options:
  2059. .IP \[bu] 2
  2060. noforget
  2061. .IP \[bu] 2
  2062. inodecalc=path-hash
  2063. .SS rtorrent fails with ENODEV (No such device)
  2064. .PP
  2065. Be sure to set \f[C]cache.files=partial|full|auto-full\f[R] or turn off
  2066. \f[C]direct_io\f[R].
  2067. rtorrent and some other applications use
  2068. mmap (http://linux.die.net/man/2/mmap) to read and write to files and
  2069. offer no fallback to traditional methods.
  2070. FUSE does not currently support mmap while using \f[C]direct_io\f[R].
  2071. There may be a performance penalty on writes with \f[C]direct_io\f[R]
  2072. off as well as the problem of double caching but it\[cq]s the only way
  2073. to get such applications to work.
  2074. If the performance loss is too high for other apps you can mount
  2075. mergerfs twice.
  2076. Once with \f[C]direct_io\f[R] enabled and one without it.
  2077. Be sure to set \f[C]dropcacheonclose=true\f[R] if not using
  2078. \f[C]direct_io\f[R].
  2079. .SS Plex doesn\[cq]t work with mergerfs
  2080. .PP
  2081. It does.
  2082. If you\[cq]re trying to put Plex\[cq]s config / metadata / database on
  2083. mergerfs you can\[cq]t set \f[C]cache.files=off\f[R] because Plex is
  2084. using sqlite3 with mmap enabled.
  2085. Shared mmap is not supported by Linux\[cq]s FUSE implementation when
  2086. page caching is disabled.
  2087. To fix this place the data elsewhere (preferable) or enable
  2088. \f[C]cache.files\f[R] (with \f[C]dropcacheonclose=true\f[R]).
  2089. Sqlite3 does not need mmap but the developer needs to fall back to
  2090. standard IO if mmap fails.
  2091. .PP
  2092. This applies to other software: Radarr, Sonarr, Lidarr, Jellyfin, etc.
  2093. .PP
  2094. I would recommend reaching out to the developers of the software
  2095. you\[cq]re having troubles with and asking them to add a fallback to
  2096. regular file IO when mmap is unavailable.
  2097. .PP
  2098. If the issue is that scanning doesn\[cq]t seem to pick up media then be
  2099. sure to set \f[C]func.getattr=newest\f[R] though generally a full scan
  2100. will pick up all media anyway.
  2101. .SS When a program tries to move or rename a file it fails
  2102. .PP
  2103. Please read the section above regarding rename & link.
  2104. .PP
  2105. The problem is that many applications do not properly handle
  2106. \f[C]EXDEV\f[R] errors which \f[C]rename\f[R] and \f[C]link\f[R] may
  2107. return even though they are perfectly valid situations which do not
  2108. indicate actual drive or OS errors.
  2109. The error will only be returned by mergerfs if using a path preserving
  2110. policy as described in the policy section above.
  2111. If you do not care about path preservation simply change the mergerfs
  2112. policy to the non-path preserving version.
  2113. For example: \f[C]-o category.create=mfs\f[R]
  2114. .PP
  2115. Ideally the offending software would be fixed and it is recommended that
  2116. if you run into this problem you contact the software\[cq]s author and
  2117. request proper handling of \f[C]EXDEV\f[R] errors.
  2118. .SS my 32bit software has problems
  2119. .PP
  2120. Some software have problems with 64bit inode values.
  2121. The symptoms can include EOVERFLOW errors when trying to list files.
  2122. You can address this by setting \f[C]inodecalc\f[R] to one of the 32bit
  2123. based algos as described in the relevant section.
  2124. .SS Samba: Moving files / directories fails
  2125. .PP
  2126. Workaround: Copy the file/directory and then remove the original rather
  2127. than move.
  2128. .PP
  2129. This isn\[cq]t an issue with Samba but some SMB clients.
  2130. GVFS-fuse v1.20.3 and prior (found in Ubuntu 14.04 among others) failed
  2131. to handle certain error codes correctly.
  2132. Particularly \f[B]STATUS_NOT_SAME_DEVICE\f[R] which comes from the
  2133. \f[B]EXDEV\f[R] which is returned by \f[B]rename\f[R] when the call is
  2134. crossing mount points.
  2135. When a program gets an \f[B]EXDEV\f[R] it needs to explicitly take an
  2136. alternate action to accomplish its goal.
  2137. In the case of \f[B]mv\f[R] or similar it tries \f[B]rename\f[R] and on
  2138. \f[B]EXDEV\f[R] falls back to a manual copying of data between the two
  2139. locations and unlinking the source.
  2140. In these older versions of GVFS-fuse if it received \f[B]EXDEV\f[R] it
  2141. would translate that into \f[B]EIO\f[R].
  2142. This would cause \f[B]mv\f[R] or most any application attempting to move
  2143. files around on that SMB share to fail with a IO error.
  2144. .PP
  2145. GVFS-fuse v1.22.0 (https://bugzilla.gnome.org/show_bug.cgi?id=734568)
  2146. and above fixed this issue but a large number of systems use the older
  2147. release.
  2148. On Ubuntu the version can be checked by issuing
  2149. \f[C]apt-cache showpkg gvfs-fuse\f[R].
  2150. Most distros released in 2015 seem to have the updated release and will
  2151. work fine but older systems may not.
  2152. Upgrading gvfs-fuse or the distro in general will address the problem.
  2153. .PP
  2154. In Apple\[cq]s MacOSX 10.9 they replaced Samba (client and server) with
  2155. their own product.
  2156. It appears their new client does not handle \f[B]EXDEV\f[R] either and
  2157. responds similar to older release of gvfs on Linux.
  2158. .SS Trashing files occasionally fails
  2159. .PP
  2160. This is the same issue as with Samba.
  2161. \f[C]rename\f[R] returns \f[C]EXDEV\f[R] (in our case that will really
  2162. only happen with path preserving policies like \f[C]epmfs\f[R]) and the
  2163. software doesn\[cq]t handle the situation well.
  2164. This is unfortunately a common failure of software which moves files
  2165. around.
  2166. The standard indicates that an implementation \f[C]MAY\f[R] choose to
  2167. support non-user home directory trashing of files (which is a
  2168. \f[C]MUST\f[R]).
  2169. The implementation \f[C]MAY\f[R] also support \[lq]top directory
  2170. trashes\[rq] which many probably do.
  2171. .PP
  2172. To create a \f[C]$topdir/.Trash\f[R] directory as defined in the
  2173. standard use the
  2174. mergerfs-tools (https://github.com/trapexit/mergerfs-tools) tool
  2175. \f[C]mergerfs.mktrash\f[R].
  2176. .SS Supplemental user groups
  2177. .PP
  2178. Due to the overhead of
  2179. getgroups/setgroups (http://linux.die.net/man/2/setgroups) mergerfs
  2180. utilizes a cache.
  2181. This cache is opportunistic and per thread.
  2182. Each thread will query the supplemental groups for a user when that
  2183. particular thread needs to change credentials and will keep that data
  2184. for the lifetime of the thread.
  2185. This means that if a user is added to a group it may not be picked up
  2186. without the restart of mergerfs.
  2187. However, since the high level FUSE API\[cq]s (at least the standard
  2188. version) thread pool dynamically grows and shrinks it\[cq]s possible
  2189. that over time a thread will be killed and later a new thread with no
  2190. cache will start and query the new data.
  2191. .PP
  2192. The gid cache uses fixed storage to simplify the design and be
  2193. compatible with older systems which may not have C++11 compilers.
  2194. There is enough storage for 256 users\[cq] supplemental groups.
  2195. Each user is allowed up to 32 supplemental groups.
  2196. Linux >= 2.6.3 allows up to 65535 groups per user but most other *nixs
  2197. allow far less.
  2198. NFS allowing only 16.
  2199. The system does handle overflow gracefully.
  2200. If the user has more than 32 supplemental groups only the first 32 will
  2201. be used.
  2202. If more than 256 users are using the system when an uncached user is
  2203. found it will evict an existing user\[cq]s cache at random.
  2204. So long as there aren\[cq]t more than 256 active users this should be
  2205. fine.
  2206. If either value is too low for your needs you will have to modify
  2207. \f[C]gidcache.hpp\f[R] to increase the values.
  2208. Note that doing so will increase the memory needed by each thread.
  2209. .PP
  2210. While not a bug some users have found when using containers that
  2211. supplemental groups defined inside the container don\[cq]t work properly
  2212. with regard to permissions.
  2213. This is expected as mergerfs lives outside the container and therefore
  2214. is querying the host\[cq]s group database.
  2215. There might be a hack to work around this (make mergerfs read the
  2216. /etc/group file in the container) but it is not yet implemented and
  2217. would be limited to Linux and the /etc/group DB.
  2218. Preferably users would mount in the host group file into the containers
  2219. or use a standard shared user & groups technology like NIS or LDAP.
  2220. .SS mergerfs or libfuse crashing
  2221. .PP
  2222. First\&... always upgrade to the latest version unless told otherwise.
  2223. .PP
  2224. If using mergerfs below 2.22.0:
  2225. .PP
  2226. If suddenly the mergerfs mount point disappears and
  2227. \f[C]Transport endpoint is not connected\f[R] is returned when
  2228. attempting to perform actions within the mount directory \f[B]and\f[R]
  2229. the version of libfuse (use \f[C]mergerfs -v\f[R] to find the version)
  2230. is older than \f[C]2.9.4\f[R] its likely due to a bug in libfuse.
  2231. Affected versions of libfuse can be found in Debian Wheezy, Ubuntu
  2232. Precise and others.
  2233. .PP
  2234. In order to fix this please install newer versions of libfuse.
  2235. If using a Debian based distro (Debian,Ubuntu,Mint) you can likely just
  2236. install newer versions of
  2237. libfuse (https://packages.debian.org/unstable/libfuse2) and
  2238. fuse (https://packages.debian.org/unstable/fuse) from the repo of a
  2239. newer release.
  2240. .PP
  2241. If using mergerfs at or above 2.22.0:
  2242. .PP
  2243. First upgrade if possible, check the known bugs section, and contact
  2244. trapexit.
  2245. .SS mergerfs appears to be crashing or exiting
  2246. .PP
  2247. There seems to be an issue with Linux version \f[C]4.9.0\f[R] and above
  2248. in which an invalid message appears to be transmitted to libfuse (used
  2249. by mergerfs) causing it to exit.
  2250. No messages will be printed in any logs as it\[cq]s not a proper crash.
  2251. Debugging of the issue is still ongoing and can be followed via the
  2252. fuse-devel
  2253. thread (https://sourceforge.net/p/fuse/mailman/message/35662577).
  2254. .SS rm: fts_read failed: No such file or directory
  2255. .PP
  2256. Please update.
  2257. This is only happened to mergerfs versions at or below v2.25.x and will
  2258. not occur in more recent versions.
  2259. .SH FAQ
  2260. .SS How well does mergerfs scale? Is it \[lq]production ready?\[rq]
  2261. .PP
  2262. Users have reported running mergerfs on everything from a Raspberry Pi
  2263. to dual socket Xeon systems with >20 cores.
  2264. I\[cq]m aware of at least a few companies which use mergerfs in
  2265. production.
  2266. Open Media Vault (https://www.openmediavault.org) includes mergerfs as
  2267. its sole solution for pooling drives.
  2268. The author of mergerfs had it running for over 300 days managing 16+
  2269. drives with reasonably heavy 24/7 read and write usage.
  2270. Stopping only after the machine\[cq]s power supply died.
  2271. .PP
  2272. Most serious issues (crashes or data corruption) have been due to kernel
  2273. bugs (https://github.com/trapexit/mergerfs/wiki/Kernel-Issues-&-Bugs).
  2274. All of which are fixed in stable releases.
  2275. .SS Can mergerfs be used with drives which already have data / are in use?
  2276. .PP
  2277. Yes.
  2278. MergerFS is a proxy and does \f[B]NOT\f[R] interfere with the normal
  2279. form or function of the drives / mounts / paths it manages.
  2280. .PP
  2281. MergerFS is \f[B]not\f[R] a traditional filesystem.
  2282. MergerFS is \f[B]not\f[R] RAID.
  2283. It does \f[B]not\f[R] manipulate the data that passes through it.
  2284. It does \f[B]not\f[R] shard data across drives.
  2285. It merely shards some \f[B]behavior\f[R] and aggregates others.
  2286. .SS Can mergerfs be removed without affecting the data?
  2287. .PP
  2288. See the previous question\[cq]s answer.
  2289. .SS What policies should I use?
  2290. .PP
  2291. Unless you\[cq]re doing something more niche the average user is
  2292. probably best off using \f[C]mfs\f[R] for \f[C]category.create\f[R].
  2293. It will spread files out across your branches based on available space.
  2294. Use \f[C]mspmfs\f[R] if you want to try to colocate the data a bit more.
  2295. You may want to use \f[C]lus\f[R] if you prefer a slightly different
  2296. distribution of data if you have a mix of smaller and larger drives.
  2297. Generally though \f[C]mfs\f[R], \f[C]lus\f[R], or even \f[C]rand\f[R]
  2298. are good for the general use case.
  2299. If you are starting with an imbalanced pool you can use the tool
  2300. \f[B]mergerfs.balance\f[R] to redistribute files across the pool.
  2301. .PP
  2302. If you really wish to try to colocate files based on directory you can
  2303. set \f[C]func.create\f[R] to \f[C]epmfs\f[R] or similar and
  2304. \f[C]func.mkdir\f[R] to \f[C]rand\f[R] or \f[C]eprand\f[R] depending on
  2305. if you just want to colocate generally or on specific branches.
  2306. Either way the \f[I]need\f[R] to colocate is rare.
  2307. For instance: if you wish to remove the drive regularly and want the
  2308. data to predictably be on that drive or if you don\[cq]t use backup at
  2309. all and don\[cq]t wish to replace that data piecemeal.
  2310. In which case using path preservation can help but will require some
  2311. manual attention.
  2312. Colocating after the fact can be accomplished using the
  2313. \f[B]mergerfs.consolidate\f[R] tool.
  2314. If you don\[cq]t need strict colocation which the \f[C]ep\f[R] policies
  2315. provide then you can use the \f[C]msp\f[R] based policies which will
  2316. walk back the path till finding a branch that works.
  2317. .PP
  2318. Ultimately there is no correct answer.
  2319. It is a preference or based on some particular need.
  2320. mergerfs is very easy to test and experiment with.
  2321. I suggest creating a test setup and experimenting to get a sense of what
  2322. you want.
  2323. .PP
  2324. The reason \f[C]mfs\f[R] is not the default \f[C]category.create\f[R]
  2325. policy is historical.
  2326. When/if a 3.X gets released it will be changed to minimize confusion
  2327. people often have with path preserving policies.
  2328. .SS What settings should I use?
  2329. .PP
  2330. Depends on what features you want.
  2331. Generally speaking there are no \[lq]wrong\[rq] settings.
  2332. All settings are performance or feature related.
  2333. The best bet is to read over the available options and choose what fits
  2334. your situation.
  2335. If something isn\[cq]t clear from the documentation please reach out and
  2336. the documentation will be improved.
  2337. .PP
  2338. That said, for the average person, the following should be fine:
  2339. .PP
  2340. \f[C]-o cache.files=off,dropcacheonclose=true,category.create=mfs\f[R]
  2341. .SS Why are all my files ending up on 1 drive?!
  2342. .PP
  2343. Did you start with empty drives?
  2344. Did you explicitly configure a \f[C]category.create\f[R] policy?
  2345. Are you using an \f[C]existing path\f[R] / \f[C]path preserving\f[R]
  2346. policy?
  2347. .PP
  2348. The default create policy is \f[C]epmfs\f[R].
  2349. That is a path preserving algorithm.
  2350. With such a policy for \f[C]mkdir\f[R] and \f[C]create\f[R] with a set
  2351. of empty drives it will select only 1 drive when the first directory is
  2352. created.
  2353. Anything, files or directories, created in that first directory will be
  2354. placed on the same branch because it is preserving paths.
  2355. .PP
  2356. This catches a lot of new users off guard but changing the default would
  2357. break the setup for many existing users.
  2358. If you do not care about path preservation and wish your files to be
  2359. spread across all your drives change to \f[C]mfs\f[R] or similar policy
  2360. as described above.
  2361. If you do want path preservation you\[cq]ll need to perform the manual
  2362. act of creating paths on the drives you want the data to land on before
  2363. transferring your data.
  2364. Setting \f[C]func.mkdir=epall\f[R] can simplify managing path
  2365. preservation for \f[C]create\f[R].
  2366. Or use \f[C]func.mkdir=rand\f[R] if you\[cq]re interested in just
  2367. grouping together directory content by drive.
  2368. .SS Do hardlinks work?
  2369. .PP
  2370. Yes.
  2371. See also the option \f[C]inodecalc\f[R] for how inode values are
  2372. calculated.
  2373. .PP
  2374. What mergerfs does not do is fake hard links across branches.
  2375. Read the section \[lq]rename & link\[rq] for how it works.
  2376. .PP
  2377. Remember that hardlinks will NOT work across devices.
  2378. That includes between the original filesystem and a mergerfs pool,
  2379. between two separate pools of the same underlying filesystems, or bind
  2380. mounts of paths within the mergerfs pool.
  2381. The latter is common when using Docker or Podman.
  2382. Multiple volumes (bind mounts) to the same underlying filesystem are
  2383. considered different devices.
  2384. There is no way to link between them.
  2385. You should mount in the highest directory in the mergerfs pool that
  2386. includes all the paths you need if you want links to work.
  2387. .SS Can I use mergerfs without SnapRAID? SnapRAID without mergerfs?
  2388. .PP
  2389. Yes.
  2390. They are completely unrelated pieces of software.
  2391. .SS Can mergerfs run via Docker, Podman, Kubernetes, etc.
  2392. .PP
  2393. Yes.
  2394. With Docker you\[cq]ll need to include
  2395. \f[C]--cap-add=SYS_ADMIN --device=/dev/fuse --security-opt=apparmor:unconfined\f[R]
  2396. or similar with other container runtimes.
  2397. You should also be running it as root or given sufficient caps to change
  2398. user and group identity as well as have root like filesystem
  2399. permissions.
  2400. .PP
  2401. Keep in mind that you \f[B]MUST\f[R] consider identity when using
  2402. containers.
  2403. For example: supplemental groups will be picked up from the container
  2404. unless you properly manage users and groups by sharing relevant /etc
  2405. files or by using some other means to share identity across containers.
  2406. Similarly if you use \[lq]rootless\[rq] containers and user namespaces
  2407. to do uid/gid translations you \f[B]MUST\f[R] consider that while
  2408. managing shared files.
  2409. .PP
  2410. Also, as mentioned by hotio (https://hotio.dev/containers/mergerfs),
  2411. with Docker you should probably be mounting with
  2412. \f[C]bind-propagation\f[R] set to \f[C]slave\f[R].
  2413. .SS Does mergerfs support CoW / copy-on-write / writes to read-only filesystems?
  2414. .PP
  2415. Not in the sense of a filesystem like BTRFS or ZFS nor in the overlayfs
  2416. or aufs sense.
  2417. It does offer a
  2418. cow-shell (http://manpages.ubuntu.com/manpages/bionic/man1/cow-shell.1.html)
  2419. like hard link breaking (copy to temp file then rename over original)
  2420. which can be useful when wanting to save space by hardlinking duplicate
  2421. files but wish to treat each name as if it were a unique and separate
  2422. file.
  2423. .PP
  2424. If you want to write to a read-only filesystem you should look at
  2425. overlayfs.
  2426. You can always include the overlayfs mount into a mergerfs pool.
  2427. .SS Why can\[cq]t I see my files / directories?
  2428. .PP
  2429. It\[cq]s almost always a permissions issue.
  2430. Unlike mhddfs and unionfs-fuse, which runs as root and attempts to
  2431. access content as such, mergerfs always changes its credentials to that
  2432. of the caller.
  2433. This means that if the user does not have access to a file or directory
  2434. than neither will mergerfs.
  2435. However, because mergerfs is creating a union of paths it may be able to
  2436. read some files and directories on one drive but not another resulting
  2437. in an incomplete set.
  2438. .PP
  2439. Whenever you run into a split permission issue (seeing some but not all
  2440. files) try using
  2441. mergerfs.fsck (https://github.com/trapexit/mergerfs-tools) tool to check
  2442. for and fix the mismatch.
  2443. If you aren\[cq]t seeing anything at all be sure that the basic
  2444. permissions are correct.
  2445. The user and group values are correct and that directories have their
  2446. executable bit set.
  2447. A common mistake by users new to Linux is to \f[C]chmod -R 644\f[R] when
  2448. they should have \f[C]chmod -R u=rwX,go=rX\f[R].
  2449. .PP
  2450. If using a network filesystem such as NFS, SMB, CIFS (Samba) be sure to
  2451. pay close attention to anything regarding permissioning and users.
  2452. Root squashing and user translation for instance has bitten a few
  2453. mergerfs users.
  2454. Some of these also affect the use of mergerfs from container platforms
  2455. such as Docker.
  2456. .SS Why use FUSE? Why not a kernel based solution?
  2457. .PP
  2458. As with any two solutions to a problem there are advantages and
  2459. disadvantages to each one.
  2460. .PP
  2461. A FUSE based solution has all the downsides of FUSE:
  2462. .IP \[bu] 2
  2463. Higher IO latency due to the trips in and out of kernel space
  2464. .IP \[bu] 2
  2465. Higher general overhead due to trips in and out of kernel space
  2466. .IP \[bu] 2
  2467. Double caching when using page caching
  2468. .IP \[bu] 2
  2469. Misc limitations due to FUSE\[cq]s design
  2470. .PP
  2471. But FUSE also has a lot of upsides:
  2472. .IP \[bu] 2
  2473. Easier to offer a cross platform solution
  2474. .IP \[bu] 2
  2475. Easier forward and backward compatibility
  2476. .IP \[bu] 2
  2477. Easier updates for users
  2478. .IP \[bu] 2
  2479. Easier and faster release cadence
  2480. .IP \[bu] 2
  2481. Allows more flexibility in design and features
  2482. .IP \[bu] 2
  2483. Overall easier to write, secure, and maintain
  2484. .IP \[bu] 2
  2485. Ability to run without root access or need to change the kernel
  2486. .IP \[bu] 2
  2487. Much lower barrier to entry (getting code into the kernel takes a lot of
  2488. time and effort initially)
  2489. .PP
  2490. FUSE was chosen because of all the advantages listed above.
  2491. The negatives of FUSE do not outweigh the positives.
  2492. .SS Is my OS\[cq]s libfuse needed for mergerfs to work?
  2493. .PP
  2494. No.\ Normally \f[C]mount.fuse\f[R] is needed to get mergerfs (or any
  2495. FUSE filesystem to mount using the \f[C]mount\f[R] command but in
  2496. vendoring the libfuse library the \f[C]mount.fuse\f[R] app has been
  2497. renamed to \f[C]mount.mergerfs\f[R] meaning the filesystem type in
  2498. \f[C]fstab\f[R] can simply be \f[C]mergerfs\f[R].
  2499. That said there should be no harm in having it installed and continuing
  2500. to using \f[C]fuse.mergerfs\f[R] as the type in \f[C]/etc/fstab\f[R].
  2501. .PP
  2502. If \f[C]mergerfs\f[R] doesn\[cq]t work as a type it could be due to how
  2503. the \f[C]mount.mergerfs\f[R] tool was installed.
  2504. Must be in \f[C]/sbin/\f[R] with proper permissions.
  2505. .SS Why was libfuse embedded into mergerfs?
  2506. .IP "1." 3
  2507. A significant number of users use mergerfs on distros with old versions
  2508. of libfuse which have serious bugs.
  2509. Requiring updated versions of libfuse on those distros isn\[cq]t
  2510. practical (no package offered, user inexperience, etc.).
  2511. The only practical way to provide a stable runtime on those systems was
  2512. to \[lq]vendor\[rq] / embed the library into the project.
  2513. .IP "2." 3
  2514. mergerfs was written to use the high level API.
  2515. There are a number of limitations in the HLAPI that make certain
  2516. features difficult or impossible to implement.
  2517. While some of these features could be patched into newer versions of
  2518. libfuse without breaking the public API some of them would require hacky
  2519. code to provide backwards compatibility.
  2520. While it may still be worth working with upstream to address these
  2521. issues in future versions, since the library needs to be vendored for
  2522. stability and compatibility reasons it is preferable / easier to modify
  2523. the API.
  2524. Longer term the plan is to rewrite mergerfs to use the low level API.
  2525. .SS Why did support for system libfuse get removed?
  2526. .PP
  2527. See above first.
  2528. .PP
  2529. If/when mergerfs is rewritten to use the low-level API then it\[cq]ll be
  2530. plausible to support system libfuse but till then it\[cq]s simply too
  2531. much work to manage the differences across the versions.
  2532. .SS Why use mergerfs over mhddfs?
  2533. .PP
  2534. mhddfs is no longer maintained and has some known stability and security
  2535. issues (see below).
  2536. MergerFS provides a superset of mhddfs\[cq] features and should offer
  2537. the same or maybe better performance.
  2538. .PP
  2539. Below is an example of mhddfs and mergerfs setup to work similarly.
  2540. .PP
  2541. \f[C]mhddfs -o mlimit=4G,allow_other /mnt/drive1,/mnt/drive2 /mnt/pool\f[R]
  2542. .PP
  2543. \f[C]mergerfs -o minfreespace=4G,category.create=ff /mnt/drive1:/mnt/drive2 /mnt/pool\f[R]
  2544. .SS Why use mergerfs over aufs?
  2545. .PP
  2546. aufs is mostly abandoned and no longer available in many distros.
  2547. .PP
  2548. While aufs can offer better peak performance mergerfs provides more
  2549. configurability and is generally easier to use.
  2550. mergerfs however does not offer the overlay / copy-on-write (CoW)
  2551. features which aufs and overlayfs have.
  2552. .SS Why use mergerfs over unionfs?
  2553. .PP
  2554. UnionFS is more like aufs than mergerfs in that it offers overlay / CoW
  2555. features.
  2556. If you\[cq]re just looking to create a union of drives and want
  2557. flexibility in file/directory placement then mergerfs offers that
  2558. whereas unionfs is more for overlaying RW filesystems over RO ones.
  2559. .SS Why use mergerfs over overlayfs?
  2560. .PP
  2561. Same reasons as with unionfs.
  2562. .SS Why use mergerfs over LVM/ZFS/BTRFS/RAID0 drive concatenation / striping?
  2563. .PP
  2564. With simple JBOD / drive concatenation / stripping / RAID0 a single
  2565. drive failure will result in full pool failure.
  2566. mergerfs performs a similar function without the possibility of
  2567. catastrophic failure and the difficulties in recovery.
  2568. Drives may fail, however, all other data will continue to be accessible.
  2569. .PP
  2570. When combined with something like SnapRaid (http://www.snapraid.it)
  2571. and/or an offsite backup solution you can have the flexibility of JBOD
  2572. without the single point of failure.
  2573. .SS Why use mergerfs over ZFS?
  2574. .PP
  2575. MergerFS is not intended to be a replacement for ZFS.
  2576. MergerFS is intended to provide flexible pooling of arbitrary drives
  2577. (local or remote), of arbitrary sizes, and arbitrary filesystems.
  2578. For \f[C]write once, read many\f[R] usecases such as bulk media storage.
  2579. Where data integrity and backup is managed in other ways.
  2580. In that situation ZFS can introduce a number of costs and limitations as
  2581. described
  2582. here (http://louwrentius.com/the-hidden-cost-of-using-zfs-for-your-home-nas.html),
  2583. here (https://markmcb.com/2020/01/07/five-years-of-btrfs/), and
  2584. here (https://utcc.utoronto.ca/~cks/space/blog/solaris/ZFSWhyNoRealReshaping).
  2585. .SS Why use mergerfs over UnRAID?
  2586. .PP
  2587. UnRAID is a full OS and its storage layer, as I understand, is
  2588. proprietary and closed source.
  2589. Users who have experience with both have said they prefer the
  2590. flexibility offered by mergerfs and for some the fact it is free and
  2591. open source is important.
  2592. .PP
  2593. There are a number of UnRAID users who use mergerfs as well though
  2594. I\[cq]m not entirely familiar with the use case.
  2595. .SS What should mergerfs NOT be used for?
  2596. .IP \[bu] 2
  2597. databases: Even if the database stored data in separate files (mergerfs
  2598. wouldn\[cq]t offer much otherwise) the higher latency of the indirection
  2599. will kill performance.
  2600. If it is a lightly used SQLITE database then it may be fine but
  2601. you\[cq]ll need to test.
  2602. .IP \[bu] 2
  2603. VM images: For the same reasons as databases.
  2604. VM images are accessed very aggressively and mergerfs will introduce too
  2605. much latency (if it works at all).
  2606. .IP \[bu] 2
  2607. As replacement for RAID: mergerfs is just for pooling branches.
  2608. If you need that kind of device performance aggregation or high
  2609. availability you should stick with RAID.
  2610. .SS Can drives be written to directly? Outside of mergerfs while pooled?
  2611. .PP
  2612. Yes, however it\[cq]s not recommended to use the same file from within
  2613. the pool and from without at the same time (particularly writing).
  2614. Especially if using caching of any kind (cache.files, cache.entry,
  2615. cache.attr, cache.negative_entry, cache.symlinks, cache.readdir, etc.)
  2616. as there could be a conflict between cached data and not.
  2617. .SS Why do I get an \[lq]out of space\[rq] / \[lq]no space left on device\[rq] / ENOSPC error even though there appears to be lots of space available?
  2618. .PP
  2619. First make sure you\[cq]ve read the sections above about policies, path
  2620. preservation, branch filtering, and the options \f[B]minfreespace\f[R],
  2621. \f[B]moveonenospc\f[R], \f[B]statfs\f[R], and \f[B]statfs_ignore\f[R].
  2622. .PP
  2623. mergerfs is simply presenting a union of the content within multiple
  2624. branches.
  2625. The reported free space is an aggregate of space available within the
  2626. pool (behavior modified by \f[B]statfs\f[R] and
  2627. \f[B]statfs_ignore\f[R]).
  2628. It does not represent a contiguous space.
  2629. In the same way that read-only filesystems, those with quotas, or
  2630. reserved space report the full theoretical space available.
  2631. .PP
  2632. Due to path preservation, branch tagging, read-only status, and
  2633. \f[B]minfreespace\f[R] settings it is perfectly valid that
  2634. \f[C]ENOSPC\f[R] / \[lq]out of space\[rq] / \[lq]no space left on
  2635. device\[rq] be returned.
  2636. It is doing what was asked of it: filtering possible branches due to
  2637. those settings.
  2638. Only one error can be returned and if one of the reasons for filtering a
  2639. branch was \f[B]minfreespace\f[R] then it will be returned as such.
  2640. \f[B]moveonenospc\f[R] is only relevant to writing a file which is too
  2641. large for the drive its currently on.
  2642. .PP
  2643. It is also possible that the filesystem selected has run out of inodes.
  2644. Use \f[C]df -i\f[R] to list the total and available inodes per
  2645. filesystem.
  2646. .PP
  2647. If you don\[cq]t care about path preservation then simply change the
  2648. \f[C]create\f[R] policy to one which isn\[cq]t.
  2649. \f[C]mfs\f[R] is probably what most are looking for.
  2650. The reason it\[cq]s not default is because it was originally set to
  2651. \f[C]epmfs\f[R] and changing it now would change people\[cq]s setup.
  2652. Such a setting change will likely occur in mergerfs 3.
  2653. .SS Why does the total available space in mergerfs not equal outside?
  2654. .PP
  2655. Are you using ext2/3/4?
  2656. With reserve for root?
  2657. mergerfs uses available space for statfs calculations.
  2658. If you\[cq]ve reserved space for root then it won\[cq]t show up.
  2659. .PP
  2660. You can remove the reserve by running: \f[C]tune2fs -m 0 <device>\f[R]
  2661. .SS Can mergerfs mounts be exported over NFS?
  2662. .PP
  2663. Yes, however if you do anything which may changes files out of band
  2664. (including for example using the \f[C]newest\f[R] policy) it will result
  2665. in \[lq]stale file handle\[rq] errors unless properly setup.
  2666. .PP
  2667. Be sure to use the following options:
  2668. .IP \[bu] 2
  2669. noforget
  2670. .IP \[bu] 2
  2671. inodecalc=path-hash
  2672. .SS Can mergerfs mounts be exported over Samba / SMB?
  2673. .PP
  2674. Yes.
  2675. While some users have reported problems it appears to always be related
  2676. to how Samba is setup in relation to permissions.
  2677. .SS Can mergerfs mounts be used over SSHFS?
  2678. .PP
  2679. Yes.
  2680. .SS I notice massive slowdowns of writes when enabling cache.files.
  2681. .PP
  2682. When file caching is enabled in any form (\f[C]cache.files!=off\f[R] or
  2683. \f[C]direct_io=false\f[R]) it will issue \f[C]getxattr\f[R] requests for
  2684. \f[C]security.capability\f[R] prior to \f[I]every single write\f[R].
  2685. This will usually result in a performance degradation, especially when
  2686. using a network filesystem (such as NFS or CIFS/SMB/Samba.)
  2687. Unfortunately at this moment the kernel is not caching the response.
  2688. .PP
  2689. To work around this situation mergerfs offers a few solutions.
  2690. .IP "1." 3
  2691. Set \f[C]security_capability=false\f[R].
  2692. It will short circuit any call and return \f[C]ENOATTR\f[R].
  2693. This still means though that mergerfs will receive the request before
  2694. every write but at least it doesn\[cq]t get passed through to the
  2695. underlying filesystem.
  2696. .IP "2." 3
  2697. Set \f[C]xattr=noattr\f[R].
  2698. Same as above but applies to \f[I]all\f[R] calls to getxattr.
  2699. Not just \f[C]security.capability\f[R].
  2700. This will not be cached by the kernel either but mergerfs\[cq] runtime
  2701. config system will still function.
  2702. .IP "3." 3
  2703. Set \f[C]xattr=nosys\f[R].
  2704. Results in mergerfs returning \f[C]ENOSYS\f[R] which \f[I]will\f[R] be
  2705. cached by the kernel.
  2706. No future xattr calls will be forwarded to mergerfs.
  2707. The downside is that also means the xattr based config and query
  2708. functionality won\[cq]t work either.
  2709. .IP "4." 3
  2710. Disable file caching.
  2711. If you aren\[cq]t using applications which use \f[C]mmap\f[R] it\[cq]s
  2712. probably simpler to just disable it all together.
  2713. The kernel won\[cq]t send the requests when caching is disabled.
  2714. .SS What are these .fuse_hidden files?
  2715. .PP
  2716. Please upgrade.
  2717. mergerfs >= 2.26.0 will not have these temporary files.
  2718. See the notes on \f[C]unlink\f[R].
  2719. .SS It\[cq]s mentioned that there are some security issues with mhddfs. What are they? How does mergerfs address them?
  2720. .PP
  2721. mhddfs (https://github.com/trapexit/mhddfs) manages running as
  2722. \f[B]root\f[R] by calling
  2723. getuid() (https://github.com/trapexit/mhddfs/blob/cae96e6251dd91e2bdc24800b4a18a74044f6672/src/main.c#L319)
  2724. and if it returns \f[B]0\f[R] then it will
  2725. chown (http://linux.die.net/man/1/chown) the file.
  2726. Not only is that a race condition but it doesn\[cq]t handle other
  2727. situations.
  2728. Rather than attempting to simulate POSIX ACL behavior the proper way to
  2729. manage this is to use seteuid (http://linux.die.net/man/2/seteuid) and
  2730. setegid (http://linux.die.net/man/2/setegid), in effect becoming the
  2731. user making the original call, and perform the action as them.
  2732. This is what mergerfs does and why mergerfs should always run as root.
  2733. .PP
  2734. In Linux setreuid syscalls apply only to the thread.
  2735. GLIBC hides this away by using realtime signals to inform all threads to
  2736. change credentials.
  2737. Taking after \f[B]Samba\f[R], mergerfs uses
  2738. \f[B]syscall(SYS_setreuid,\&...)\f[R] to set the callers credentials for
  2739. that thread only.
  2740. Jumping back to \f[B]root\f[R] as necessary should escalated privileges
  2741. be needed (for instance: to clone paths between drives).
  2742. .PP
  2743. For non-Linux systems mergerfs uses a read-write lock and changes
  2744. credentials only when necessary.
  2745. If multiple threads are to be user X then only the first one will need
  2746. to change the processes credentials.
  2747. So long as the other threads need to be user X they will take a readlock
  2748. allowing multiple threads to share the credentials.
  2749. Once a request comes in to run as user Y that thread will attempt a
  2750. write lock and change to Y\[cq]s credentials when it can.
  2751. If the ability to give writers priority is supported then that flag will
  2752. be used so threads trying to change credentials don\[cq]t starve.
  2753. This isn\[cq]t the best solution but should work reasonably well
  2754. assuming there are few users.
  2755. .SH SUPPORT
  2756. .PP
  2757. Filesystems are complex and difficult to debug.
  2758. mergerfs, while being just a proxy of sorts, can be difficult to debug
  2759. given the large number of possible settings it can have itself and the
  2760. number of environments it can run in.
  2761. When reporting on a suspected issue \f[B]please\f[R] include as much of
  2762. the below information as possible otherwise it will be difficult or
  2763. impossible to diagnose.
  2764. Also please read the above documentation as it provides details on many
  2765. previously encountered questions/issues.
  2766. .PP
  2767. \f[B]Please make sure you are using the latest
  2768. release (https://github.com/trapexit/mergerfs/releases) or have tried it
  2769. in comparison. Old versions, which are often included in distros like
  2770. Debian and Ubuntu, are not ever going to be updated and your bug may
  2771. have been addressed already.\f[R]
  2772. .PP
  2773. \f[B]For commercial support or feature requests please contact me
  2774. directly.\f[R]
  2775. .SS Information to include in bug reports
  2776. .IP \[bu] 2
  2777. Information about the broader problem along with any attempted
  2778. solutions. (https://xyproblem.info)
  2779. .IP \[bu] 2
  2780. Solution already ruled out and why.
  2781. .IP \[bu] 2
  2782. Version of mergerfs: \f[C]mergerfs -V\f[R]
  2783. .IP \[bu] 2
  2784. mergerfs settings / arguments: from fstab, systemd unit, command line,
  2785. OMV plugin, etc.
  2786. .IP \[bu] 2
  2787. Version of the OS: \f[C]uname -a\f[R] and \f[C]lsb_release -a\f[R]
  2788. .IP \[bu] 2
  2789. List of branches, their filesystem types, sizes (before and after
  2790. issue): \f[C]df -h\f[R]
  2791. .IP \[bu] 2
  2792. \f[B]All\f[R] information about the relevant paths and files:
  2793. permissions, ownership, etc.
  2794. .IP \[bu] 2
  2795. \f[B]All\f[R] information about the client app making the requests:
  2796. version, uid/gid
  2797. .IP \[bu] 2
  2798. Runtime environment:
  2799. .RS 2
  2800. .IP \[bu] 2
  2801. Is mergerfs running within a container?
  2802. .IP \[bu] 2
  2803. Are the client apps using mergerfs running in a container?
  2804. .RE
  2805. .IP \[bu] 2
  2806. A \f[C]strace\f[R] of the app having problems:
  2807. .RS 2
  2808. .IP \[bu] 2
  2809. \f[C]strace -fvTtt -s 256 -o /tmp/app.strace.txt <cmd>\f[R]
  2810. .RE
  2811. .IP \[bu] 2
  2812. A \f[C]strace\f[R] of mergerfs while the program is trying to do
  2813. whatever it is failing to do:
  2814. .RS 2
  2815. .IP \[bu] 2
  2816. \f[C]strace -fvTtt -s 256 -p <mergerfsPID> -o /tmp/mergerfs.strace.txt\f[R]
  2817. .RE
  2818. .IP \[bu] 2
  2819. \f[B]Precise\f[R] directions on replicating the issue.
  2820. Do not leave \f[B]anything\f[R] out.
  2821. .IP \[bu] 2
  2822. Try to recreate the problem in the simplest way using standard programs:
  2823. \f[C]ln\f[R], \f[C]mv\f[R], \f[C]cp\f[R], \f[C]ls\f[R], \f[C]dd\f[R],
  2824. etc.
  2825. .SS Contact / Issue submission
  2826. .IP \[bu] 2
  2827. github.com: https://github.com/trapexit/mergerfs/issues
  2828. .IP \[bu] 2
  2829. email: trapexit\[at]spawn.link
  2830. .IP \[bu] 2
  2831. discord: https://discord.gg/MpAr69V
  2832. .IP \[bu] 2
  2833. twitter: https://twitter.com/_trapexit
  2834. .IP \[bu] 2
  2835. reddit: https://www.reddit.com/user/trapexit
  2836. .SS Support development
  2837. .PP
  2838. This software is released under the very liberal ISC license and is
  2839. therefore free to use for personal or commercial uses.
  2840. That said if you like this software and have the means please consider
  2841. supporting its development.
  2842. .PP
  2843. https://github.com/trapexit/support
  2844. .SH LINKS
  2845. .IP \[bu] 2
  2846. https://spawn.link
  2847. .IP \[bu] 2
  2848. https://github.com/trapexit/mergerfs
  2849. .IP \[bu] 2
  2850. https://github.com/trapexit/mergerfs/wiki
  2851. .IP \[bu] 2
  2852. https://github.com/trapexit/mergerfs-tools
  2853. .IP \[bu] 2
  2854. https://github.com/trapexit/scorch
  2855. .IP \[bu] 2
  2856. https://github.com/trapexit/bbf
  2857. .SH AUTHORS
  2858. Antonio SJ Musumeci <trapexit@spawn.link>.