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.

2064 lines
79 KiB

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
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
8 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
9 years ago
9 years ago
8 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
9 years ago
9 years ago
9 years ago
6 years ago
6 years ago
9 years ago
9 years ago
9 years ago
9 years ago
9 years ago
8 years ago
9 years ago
8 years ago
8 years ago
9 years ago
9 years ago
9 years ago
  1. .\"t
  2. .\" Automatically generated by Pandoc 1.19.2.4
  3. .\"
  4. .TH "mergerfs" "1" "2019\-05\-22" "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[] 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[], \f[B]unionfs\f[], and \f[B]aufs\f[].
  18. .SH FEATURES
  19. .IP \[bu] 2
  20. Runs in userspace (FUSE)
  21. .IP \[bu] 2
  22. Configurable behaviors / file placement
  23. .IP \[bu] 2
  24. Support for extended attributes (xattrs)
  25. .IP \[bu] 2
  26. Support for file attributes (chattr)
  27. .IP \[bu] 2
  28. Runtime configurable (via xattrs)
  29. .IP \[bu] 2
  30. Safe to run as root
  31. .IP \[bu] 2
  32. Opportunistic credential caching
  33. .IP \[bu] 2
  34. Works with heterogeneous filesystem types
  35. .IP \[bu] 2
  36. Handling of writes to full drives (transparently move file to drive with
  37. capacity)
  38. .IP \[bu] 2
  39. Handles pool of read\-only and read/write drives
  40. .IP \[bu] 2
  41. Can turn read\-only files into symlinks to underlying file
  42. .IP \[bu] 2
  43. Hard link copy\-on\-write / CoW
  44. .IP \[bu] 2
  45. supports POSIX ACLs
  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[]
  75. .fi
  76. .PP
  77. mergerfs does \f[B]not\f[] support the copy\-on\-write (CoW) behavior
  78. found in \f[B]aufs\f[] and \f[B]overlayfs\f[].
  79. You can \f[B]not\f[] 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. .SH OPTIONS
  83. .SS mount options
  84. .IP \[bu] 2
  85. \f[B]allow_other\f[]: a libfuse option which allows users besides the
  86. one which ran mergerfs to see the filesystem.
  87. This is required for most use\-cases.
  88. .IP \[bu] 2
  89. \f[B]direct_io\f[]: causes FUSE to bypass caching which can increase
  90. write speeds at the detriment of reads.
  91. Note that not enabling \f[C]direct_io\f[] will cause double caching of
  92. files and therefore less memory for caching generally (enable
  93. \f[B]dropcacheonclose\f[] to help with this problem).
  94. However, \f[C]mmap\f[] does not work when \f[C]direct_io\f[] is enabled.
  95. .IP \[bu] 2
  96. \f[B]minfreespace=value\f[]: the minimum space value used for creation
  97. policies.
  98. Understands \[aq]K\[aq], \[aq]M\[aq], and \[aq]G\[aq] to represent
  99. kilobyte, megabyte, and gigabyte respectively.
  100. (default: 4G)
  101. .IP \[bu] 2
  102. \f[B]moveonenospc=true|false\f[]: when enabled (set to \f[B]true\f[]) if
  103. a \f[B]write\f[] fails with \f[B]ENOSPC\f[] or \f[B]EDQUOT\f[] a scan of
  104. all drives will be done looking for the drive with the most free space
  105. which is at least the size of the file plus the amount which failed to
  106. write.
  107. An attempt to move the file to that drive will occur (keeping all
  108. metadata possible) and if successful the original is unlinked and the
  109. write retried.
  110. (default: false)
  111. .IP \[bu] 2
  112. \f[B]use_ino\f[]: causes mergerfs to supply file/directory inodes rather
  113. than libfuse.
  114. While not a default it is recommended it be enabled so that linked files
  115. share the same inode value.
  116. .IP \[bu] 2
  117. \f[B]dropcacheonclose=true|false\f[]: when a file is requested to be
  118. closed call \f[C]posix_fadvise\f[] on it first to instruct the kernel
  119. that we no longer need the data and it can drop its cache.
  120. Recommended when \f[B]direct_io\f[] is not enabled to limit double
  121. caching.
  122. (default: false)
  123. .IP \[bu] 2
  124. \f[B]symlinkify=true|false\f[]: when enabled (set to \f[B]true\f[]) and
  125. a file is not writable and its mtime or ctime is older than
  126. \f[B]symlinkify_timeout\f[] files will be reported as symlinks to the
  127. original files.
  128. Please read more below before using.
  129. (default: false)
  130. .IP \[bu] 2
  131. \f[B]symlinkify_timeout=value\f[]: time to wait, in seconds, to activate
  132. the \f[B]symlinkify\f[] behavior.
  133. (default: 3600)
  134. .IP \[bu] 2
  135. \f[B]nullrw=true|false\f[]: turns reads and writes into no\-ops.
  136. The request will succeed but do nothing.
  137. Useful for benchmarking mergerfs.
  138. (default: false)
  139. .IP \[bu] 2
  140. \f[B]ignorepponrename=true|false\f[]: ignore path preserving on rename.
  141. Typically rename and link act differently depending on the policy of
  142. \f[C]create\f[] (read below).
  143. Enabling this will cause rename and link to always use the non\-path
  144. preserving behavior.
  145. This means files, when renamed or linked, will stay on the same drive.
  146. (default: false)
  147. .IP \[bu] 2
  148. \f[B]security_capability=true|false\f[]: If false return ENOATTR when
  149. xattr security.capability is queried.
  150. (default: true)
  151. .IP \[bu] 2
  152. \f[B]xattr=passthrough|noattr|nosys\f[]: Runtime control of xattrs.
  153. Default is to passthrough xattr requests.
  154. \[aq]noattr\[aq] will short circuit as if nothing exists.
  155. \[aq]nosys\[aq] will respond with ENOSYS as if xattrs are not supported
  156. or disabled.
  157. (default: passthrough)
  158. .IP \[bu] 2
  159. \f[B]link_cow=true|false\f[]: When enabled if a regular file is opened
  160. which has a link count > 1 it will copy the file to a temporary file and
  161. rename over the original.
  162. Breaking the link and providing a basic copy\-on\-write function similar
  163. to cow\-shell.
  164. (default: false)
  165. .IP \[bu] 2
  166. \f[B]statfs=base|full\f[]: Controls how statfs works.
  167. \[aq]base\[aq] means it will always use all branches in statfs
  168. calculations.
  169. \[aq]full\[aq] is in effect path preserving and only includes drives
  170. where the path exists.
  171. (default: base)
  172. .IP \[bu] 2
  173. \f[B]statfs_ignore=none|ro|nc\f[]: \[aq]ro\[aq] will cause statfs
  174. calculations to ignore available space for branches mounted or tagged as
  175. \[aq]read\-only\[aq] or \[aq]no create\[aq].
  176. \[aq]nc\[aq] will ignore available space for branches tagged as \[aq]no
  177. create\[aq].
  178. (default: none)
  179. .IP \[bu] 2
  180. \f[B]posix_acl=true|false:\f[] enable POSIX ACL support (if supported by
  181. kernel and underlying filesystem).
  182. (default: false)
  183. .IP \[bu] 2
  184. \f[B]threads=num\f[]: number of threads to use in multithreaded mode.
  185. When set to zero (the default) it will attempt to discover and use the
  186. number of logical cores.
  187. If the lookup fails it will fall back to using 4.
  188. If the thread count is set negative it will look up the number of cores
  189. then divide by the absolute value.
  190. ie.
  191. threads=\-2 on an 8 core machine will result in 8 / 2 = 4 threads.
  192. There will always be at least 1 thread.
  193. NOTE: higher number of threads increases parallelism but usually
  194. decreases throughput.
  195. (default: number of cores) \f[I]NOTE2:\f[] the option is unavailable
  196. when built with system libfuse.
  197. .IP \[bu] 2
  198. \f[B]fsname=name\f[]: sets the name of the filesystem as seen in
  199. \f[B]mount\f[], \f[B]df\f[], etc.
  200. Defaults to a list of the source paths concatenated together with the
  201. longest common prefix removed.
  202. .IP \[bu] 2
  203. \f[B]func.<func>=<policy>\f[]: sets the specific FUSE function\[aq]s
  204. policy.
  205. See below for the list of value types.
  206. Example: \f[B]func.getattr=newest\f[]
  207. .IP \[bu] 2
  208. \f[B]category.<category>=<policy>\f[]: Sets policy of all FUSE functions
  209. in the provided category.
  210. Example: \f[B]category.create=mfs\f[]
  211. .IP \[bu] 2
  212. \f[B]cache.open=<int>\f[]: \[aq]open\[aq] policy cache timeout in
  213. seconds.
  214. (default: 0)
  215. .IP \[bu] 2
  216. \f[B]cache.statfs=<int>\f[]: \[aq]statfs\[aq] cache timeout in seconds.
  217. (default: 0)
  218. .IP \[bu] 2
  219. \f[B]cache.attr=<int>\f[]: file attribute cache timeout in seconds.
  220. (default: 1)
  221. .IP \[bu] 2
  222. \f[B]cache.entry=<int>\f[]: file name lookup cache timeout in seconds.
  223. (default: 1)
  224. .IP \[bu] 2
  225. \f[B]cache.negative_entry=<int>\f[]: negative file name lookup cache
  226. timeout in seconds.
  227. (default: 0)
  228. .IP \[bu] 2
  229. \f[B]cache.symlinks=<bool>\f[]: cache symlinks (if supported by kernel)
  230. (default: false)
  231. .PP
  232. \f[B]NOTE:\f[] Options are evaluated in the order listed so if the
  233. options are \f[B]func.rmdir=rand,category.action=ff\f[] the
  234. \f[B]action\f[] category setting will override the \f[B]rmdir\f[]
  235. setting.
  236. .SS branches
  237. .PP
  238. The \[aq]branches\[aq] (formerly \[aq]srcmounts\[aq]) argument is a
  239. colon (\[aq]:\[aq]) delimited list of paths to be pooled together.
  240. It does not matter if the paths are on the same or different drives nor
  241. does it matter the filesystem.
  242. Used and available space will not be duplicated for paths on the same
  243. device and any features which aren\[aq]t supported by the underlying
  244. filesystem (such as file attributes or extended attributes) will return
  245. the appropriate errors.
  246. .PP
  247. To make it easier to include multiple branches mergerfs supports
  248. globbing (http://linux.die.net/man/7/glob).
  249. \f[B]The globbing tokens MUST be escaped when using via the shell else
  250. the shell itself will apply the glob itself.\f[]
  251. .PP
  252. Each branch can have a suffix of \f[C]=RW\f[] (read / write),
  253. \f[C]=RO\f[] (read\-only), or \f[C]=NC\f[] (no create).
  254. These suffixes work with globs as well and will apply to each path
  255. found.
  256. \f[C]RW\f[] is the default behavior and those paths will be eligible for
  257. all policy categories.
  258. \f[C]RO\f[] will exclude those paths from \f[C]create\f[] and
  259. \f[C]action\f[] policies (just as a filesystem being mounted \f[C]ro\f[]
  260. would).
  261. \f[C]NC\f[] will exclude those paths from \f[C]create\f[] policies (you
  262. can\[aq]t create but you can change / delete).
  263. .IP
  264. .nf
  265. \f[C]
  266. #\ mergerfs\ \-o\ allow_other,use_ino\ /mnt/disk\\*:/mnt/cdrom\ /media/drives
  267. \f[]
  268. .fi
  269. .PP
  270. The above line will use all mount points in /mnt prefixed with
  271. \f[B]disk\f[] and the \f[B]cdrom\f[].
  272. .PP
  273. To have the pool mounted at boot or otherwise accessable from related
  274. tools use \f[B]/etc/fstab\f[].
  275. .IP
  276. .nf
  277. \f[C]
  278. #\ <file\ system>\ \ \ \ \ \ \ \ <mount\ point>\ \ <type>\ \ \ \ \ \ \ \ \ <options>\ \ \ \ \ \ \ \ \ \ \ \ \ <dump>\ \ <pass>
  279. /mnt/disk*:/mnt/cdrom\ \ /media/drives\ \ fuse.mergerfs\ \ allow_other,use_ino\ \ \ 0\ \ \ \ \ \ \ 0
  280. \f[]
  281. .fi
  282. .PP
  283. \f[B]NOTE:\f[] the globbing is done at mount or xattr update time (see
  284. below).
  285. If a new directory is added matching the glob after the fact it will not
  286. be automatically included.
  287. .PP
  288. \f[B]NOTE:\f[] for mounting via \f[B]fstab\f[] to work you must have
  289. \f[B]mount.fuse\f[] installed.
  290. For Ubuntu/Debian it is included in the \f[B]fuse\f[] package.
  291. .SS symlinkify
  292. .PP
  293. Due to the levels of indirection introduced by mergerfs and the
  294. underlying technology FUSE there can be varying levels of performance
  295. degredation.
  296. This feature will turn non\-directories which are not writable into
  297. symlinks to the original file found by the \f[C]readlink\f[] policy
  298. after the mtime and ctime are older than the timeout.
  299. .PP
  300. \f[B]WARNING:\f[] The current implementation has a known issue in which
  301. if the file is open and being used when the file is converted to a
  302. symlink then the application which has that file open will receive an
  303. error when using it.
  304. This is unlikely to occur in practice but is something to keep in mind.
  305. .PP
  306. \f[B]WARNING:\f[] Some backup solutions, such as CrashPlan, do not
  307. backup the target of a symlink.
  308. If using this feature it will be necessary to point any backup software
  309. to the original drives or configure the software to follow symlinks if
  310. such an option is available.
  311. Alternatively create two mounts.
  312. One for backup and one for general consumption.
  313. .SS nullrw
  314. .PP
  315. Due to how FUSE works there is an overhead to all requests made to a
  316. FUSE filesystem.
  317. Meaning that even a simple passthrough will have some slowdown.
  318. However, generally the overhead is minimal in comparison to the cost of
  319. the underlying I/O.
  320. By disabling the underlying I/O we can test the theoretical performance
  321. boundries.
  322. .PP
  323. By enabling \f[C]nullrw\f[] mergerfs will work as it always does
  324. \f[B]except\f[] that all reads and writes will be no\-ops.
  325. A write will succeed (the size of the write will be returned as if it
  326. were successful) but mergerfs does nothing with the data it was given.
  327. Similarly a read will return the size requested but won\[aq]t touch the
  328. buffer.
  329. .PP
  330. Example:
  331. .IP
  332. .nf
  333. \f[C]
  334. $\ dd\ if=/dev/zero\ of=/path/to/mergerfs/mount/benchmark\ ibs=1M\ obs=512\ count=1024\ conv=fdatasync
  335. 1024+0\ records\ in
  336. 2097152+0\ records\ out
  337. 1073741824\ bytes\ (1.1\ GB,\ 1.0\ GiB)\ copied,\ 15.4067\ s,\ 69.7\ MB/s
  338. $\ dd\ if=/dev/zero\ of=/path/to/mergerfs/mount/benchmark\ ibs=1M\ obs=1M\ count=1024\ conv=fdatasync
  339. 1024+0\ records\ in
  340. 1024+0\ records\ out
  341. 1073741824\ bytes\ (1.1\ GB,\ 1.0\ GiB)\ copied,\ 0.219585\ s,\ 4.9\ GB/s
  342. $\ dd\ if=/path/to/mergerfs/mount/benchmark\ of=/dev/null\ bs=512\ count=102400\ conv=fdatasync
  343. 102400+0\ records\ in
  344. 102400+0\ records\ out
  345. 52428800\ bytes\ (52\ MB,\ 50\ MiB)\ copied,\ 0.757991\ s,\ 69.2\ MB/s
  346. $\ dd\ if=/path/to/mergerfs/mount/benchmark\ of=/dev/null\ bs=1M\ count=1024\ conv=fdatasync
  347. 1024+0\ records\ in
  348. 1024+0\ records\ out
  349. 1073741824\ bytes\ (1.1\ GB,\ 1.0\ GiB)\ copied,\ 0.18405\ s,\ 5.8\ GB/s
  350. \f[]
  351. .fi
  352. .PP
  353. It\[aq]s important to test with different \f[C]obs\f[] (output block
  354. size) values since the relative overhead is greater with smaller values.
  355. As you can see above the size of a read or write can massively impact
  356. theoretical performance.
  357. If an application performs much worse through mergerfs it could very
  358. well be that it doesn\[aq]t optimally size its read and write requests.
  359. In such cases contact the mergerfs author so it can be investigated.
  360. .SS xattr
  361. .PP
  362. Runtime extended attribute support can be managed via the \f[C]xattr\f[]
  363. option.
  364. By default it will passthrough any xattr calls.
  365. Given xattr support is rarely used and can have significant performance
  366. implications mergerfs allows it to be disabled at runtime.
  367. .PP
  368. \f[C]noattr\f[] will cause mergerfs to short circuit all xattr calls and
  369. return ENOATTR where appropriate.
  370. mergerfs still gets all the requests but they will not be forwarded on
  371. to the underlying filesystems.
  372. The runtime control will still function in this mode.
  373. .PP
  374. \f[C]nosys\f[] will cause mergerfs to return ENOSYS for any xattr call.
  375. The difference with \f[C]noattr\f[] is that the kernel will cache this
  376. fact and itself short circuit future calls.
  377. This will be more efficient than \f[C]noattr\f[] but will cause
  378. mergerfs\[aq] runtime control via the hidden file to stop working.
  379. .SH FUNCTIONS / POLICIES / CATEGORIES
  380. .PP
  381. The POSIX filesystem API is made up of a number of functions.
  382. \f[B]creat\f[], \f[B]stat\f[], \f[B]chown\f[], etc.
  383. In mergerfs most of the core functions are grouped into 3 categories:
  384. \f[B]action\f[], \f[B]create\f[], and \f[B]search\f[].
  385. These functions and categories can be assigned a policy which dictates
  386. what file or directory is chosen when performing that behavior.
  387. Any policy can be assigned to a function or category though some may not
  388. be very useful in practice.
  389. For instance: \f[B]rand\f[] (random) may be useful for file creation
  390. (create) but could lead to very odd behavior if used for \f[C]chmod\f[]
  391. if there were more than one copy of the file.
  392. .PP
  393. Some functions, listed in the category \f[C]N/A\f[] below, can not be
  394. assigned the normal policies.
  395. All functions which work on file handles use the handle which was
  396. acquired by \f[C]open\f[] or \f[C]create\f[].
  397. \f[C]readdir\f[] has no real need for a policy given the purpose is
  398. merely to return a list of entries in a directory.
  399. \f[C]statfs\f[]\[aq]s behavior can be modified via other options.
  400. That said many times the current FUSE kernel driver will not always
  401. provide the file handle when a client calls \f[C]fgetattr\f[],
  402. \f[C]fchown\f[], \f[C]fchmod\f[], \f[C]futimens\f[], \f[C]ftruncate\f[],
  403. etc.
  404. This means it will call the regular, path based, versions.
  405. .PP
  406. When using policies which are based on a branch\[aq]s available space
  407. the base path provided is used.
  408. Not the full path to the file in question.
  409. Meaning that sub mounts won\[aq]t be considered in the space
  410. calculations.
  411. The reason is that it doesn\[aq]t really work for non\-path preserving
  412. policies and can lead to non\-obvious behaviors.
  413. .SS Function / Category classifications
  414. .PP
  415. .TS
  416. tab(@);
  417. lw(7.9n) lw(62.1n).
  418. T{
  419. Category
  420. T}@T{
  421. FUSE Functions
  422. T}
  423. _
  424. T{
  425. action
  426. T}@T{
  427. chmod, chown, link, removexattr, rename, rmdir, setxattr, truncate,
  428. unlink, utimens
  429. T}
  430. T{
  431. create
  432. T}@T{
  433. create, mkdir, mknod, symlink
  434. T}
  435. T{
  436. search
  437. T}@T{
  438. access, getattr, getxattr, ioctl (directories), listxattr, open,
  439. readlink
  440. T}
  441. T{
  442. N/A
  443. T}@T{
  444. fchmod, fchown, futimens, ftruncate, fallocate, fgetattr, fsync, ioctl
  445. (files), read, readdir, release, statfs, write
  446. T}
  447. .TE
  448. .PP
  449. In cases where something may be searched (to confirm a directory exists
  450. across all source mounts) \f[B]getattr\f[] will be used.
  451. .SS Path Preservation
  452. .PP
  453. Policies, as described below, are of two basic types.
  454. \f[C]path\ preserving\f[] and \f[C]non\-path\ preserving\f[].
  455. .PP
  456. All policies which start with \f[C]ep\f[] (\f[B]epff\f[],
  457. \f[B]eplfs\f[], \f[B]eplus\f[], \f[B]epmfs\f[], \f[B]eprand\f[]) are
  458. \f[C]path\ preserving\f[].
  459. \f[C]ep\f[] stands for \f[C]existing\ path\f[].
  460. .PP
  461. A path preserving policy will only consider drives where the relative
  462. path being accessed already exists.
  463. .PP
  464. When using non\-path preserving policies paths will be cloned to target
  465. drives as necessary.
  466. .SS Filters
  467. .PP
  468. Policies basically search branches and create a list of files / paths
  469. for functions to work on.
  470. The policy is responsible for filtering and sorting.
  471. The policy type defines the sorting but filtering is mostly uniform as
  472. described below.
  473. .IP \[bu] 2
  474. No \f[B]search\f[] policies filter.
  475. .IP \[bu] 2
  476. All \f[B]action\f[] policies will filter out branches which are mounted
  477. \f[B]read\-only\f[] or tagged as \f[B]RO (read\-only)\f[].
  478. .IP \[bu] 2
  479. All \f[B]create\f[] policies will filter out branches which are mounted
  480. \f[B]read\-only\f[], tagged \f[B]RO (read\-only)\f[] or \f[B]NC (no
  481. create)\f[], or has available space less than \f[C]minfreespace\f[].
  482. .PP
  483. If all branches are filtered an error will be returned.
  484. Typically \f[B]EROFS\f[] or \f[B]ENOSPC\f[] depending on the reasons.
  485. .SS Policy descriptions
  486. .PP
  487. .TS
  488. tab(@);
  489. lw(16.6n) lw(53.4n).
  490. T{
  491. Policy
  492. T}@T{
  493. Description
  494. T}
  495. _
  496. T{
  497. all
  498. T}@T{
  499. Search category: same as \f[B]epall\f[].
  500. Action category: same as \f[B]epall\f[].
  501. Create category: for \f[B]mkdir\f[], \f[B]mknod\f[], and
  502. \f[B]symlink\f[] it will apply to all branches.
  503. \f[B]create\f[] works like \f[B]ff\f[].
  504. T}
  505. T{
  506. epall (existing path, all)
  507. T}@T{
  508. Search category: same as \f[B]epff\f[] (but more expensive because it
  509. doesn\[aq]t stop after finding a valid branch).
  510. Action category: apply to all found.
  511. Create category: for \f[B]mkdir\f[], \f[B]mknod\f[], and
  512. \f[B]symlink\f[] it will apply to all found.
  513. \f[B]create\f[] works like \f[B]epff\f[] (but more expensive because it
  514. doesn\[aq]t stop after finding a valid branch).
  515. T}
  516. T{
  517. epff (existing path, first found)
  518. T}@T{
  519. Given the order of the branches, as defined at mount time or configured
  520. at runtime, act on the first one found where the relative path exists.
  521. T}
  522. T{
  523. eplfs (existing path, least free space)
  524. T}@T{
  525. Of all the branches on which the relative path exists choose the drive
  526. with the least free space.
  527. T}
  528. T{
  529. eplus (existing path, least used space)
  530. T}@T{
  531. Of all the branches on which the relative path exists choose the drive
  532. with the least used space.
  533. T}
  534. T{
  535. epmfs (existing path, most free space)
  536. T}@T{
  537. Of all the branches on which the relative path exists choose the drive
  538. with the most free space.
  539. T}
  540. T{
  541. eprand (existing path, random)
  542. T}@T{
  543. Calls \f[B]epall\f[] and then randomizes.
  544. T}
  545. T{
  546. erofs
  547. T}@T{
  548. Exclusively return \f[B]\-1\f[] with \f[B]errno\f[] set to
  549. \f[B]EROFS\f[] (read\-only filesystem).
  550. T}
  551. T{
  552. ff (first found)
  553. T}@T{
  554. Search category: same as \f[B]epff\f[].
  555. Action category: same as \f[B]epff\f[].
  556. Create category: Given the order of the drives, as defined at mount time
  557. or configured at runtime, act on the first one found.
  558. T}
  559. T{
  560. lfs (least free space)
  561. T}@T{
  562. Search category: same as \f[B]eplfs\f[].
  563. Action category: same as \f[B]eplfs\f[].
  564. Create category: Pick the drive with the least available free space.
  565. T}
  566. T{
  567. lus (least used space)
  568. T}@T{
  569. Search category: same as \f[B]eplus\f[].
  570. Action category: same as \f[B]eplus\f[].
  571. Create category: Pick the drive with the least used space.
  572. T}
  573. T{
  574. mfs (most free space)
  575. T}@T{
  576. Search category: same as \f[B]epmfs\f[].
  577. Action category: same as \f[B]epmfs\f[].
  578. Create category: Pick the drive with the most available free space.
  579. T}
  580. T{
  581. newest
  582. T}@T{
  583. Pick the file / directory with the largest mtime.
  584. T}
  585. T{
  586. rand (random)
  587. T}@T{
  588. Calls \f[B]all\f[] and then randomizes.
  589. T}
  590. .TE
  591. .SS Defaults
  592. .PP
  593. .TS
  594. tab(@);
  595. l l.
  596. T{
  597. Category
  598. T}@T{
  599. Policy
  600. T}
  601. _
  602. T{
  603. action
  604. T}@T{
  605. epall
  606. T}
  607. T{
  608. create
  609. T}@T{
  610. epmfs
  611. T}
  612. T{
  613. search
  614. T}@T{
  615. ff
  616. T}
  617. .TE
  618. .SS ioctl
  619. .PP
  620. When \f[C]ioctl\f[] is used with an open file then it will use the file
  621. handle which was created at the original \f[C]open\f[] call.
  622. However, when using \f[C]ioctl\f[] with a directory mergerfs will use
  623. the \f[C]open\f[] policy to find the directory to act on.
  624. .SS unlink
  625. .PP
  626. In FUSE there is an opaque "file handle" which is created by
  627. \f[C]open\f[], \f[C]create\f[], or \f[C]opendir\f[], passed to the
  628. kernel, and then is passed back to the FUSE userland application by the
  629. kernel.
  630. Unfortunately, the FUSE kernel driver does not always send the file
  631. handle when it theoretically could/should.
  632. This complicates certain behaviors / workflows particularly in the high
  633. level API.
  634. As a result mergerfs is currently doing a few hacky things.
  635. .PP
  636. libfuse2 and libfuse3, when using the high level API, will rename names
  637. to \f[C]\&.fuse_hiddenXXXXXX\f[] if the file is open when unlinked or
  638. renamed over.
  639. It does this so the file is still available when a request referencing
  640. the now missing file is made.
  641. This file however keeps a \f[C]rmdir\f[] from succeeding and can be
  642. picked up by software reading directories.
  643. .PP
  644. The change mergerfs has done is that if a file is open when an unlink or
  645. rename happens it will open the file and keep it open till closed by all
  646. those who opened it prior.
  647. When a request comes in referencing that file and it doesn\[aq]t include
  648. a file handle it will instead use the file handle created at
  649. unlink/rename time.
  650. .PP
  651. This won\[aq]t result in technically proper behavior but close enough
  652. for many usecases.
  653. .PP
  654. The plan is to rewrite mergerfs to use the low level API so these
  655. invasive libfuse changes are no longer necessary.
  656. .SS rename & link
  657. .PP
  658. \f[B]NOTE:\f[] If you\[aq]re receiving errors from software when files
  659. are moved / renamed / linked then you should consider changing the
  660. create policy to one which is \f[B]not\f[] path preserving, enabling
  661. \f[C]ignorepponrename\f[], or contacting the author of the offending
  662. software and requesting that \f[C]EXDEV\f[] be properly handled.
  663. .PP
  664. \f[C]rename\f[] and \f[C]link\f[] are tricky functions in a union
  665. filesystem.
  666. \f[C]rename\f[] only works within a single filesystem or device.
  667. If a rename can\[aq]t be done atomically due to the source and
  668. destination paths existing on different mount points it will return
  669. \f[B]\-1\f[] with \f[B]errno = EXDEV\f[] (cross device).
  670. So if a \f[C]rename\f[]\[aq]s source and target are on different drives
  671. within the pool it creates an issue.
  672. .PP
  673. Originally mergerfs would return EXDEV whenever a rename was requested
  674. which was cross directory in any way.
  675. This made the code simple and was technically complient with POSIX
  676. requirements.
  677. However, many applications fail to handle EXDEV at all and treat it as a
  678. normal error or otherwise handle it poorly.
  679. Such apps include: gvfsd\-fuse v1.20.3 and prior, Finder / CIFS/SMB
  680. client in Apple OSX 10.9+, NZBGet, Samba\[aq]s recycling bin feature.
  681. .PP
  682. As a result a compromise was made in order to get most software to work
  683. while still obeying mergerfs\[aq] policies.
  684. Below is the basic logic.
  685. .IP \[bu] 2
  686. If using a \f[B]create\f[] policy which tries to preserve directory
  687. paths (epff,eplfs,eplus,epmfs)
  688. .IP \[bu] 2
  689. Using the \f[B]rename\f[] policy get the list of files to rename
  690. .IP \[bu] 2
  691. For each file attempt rename:
  692. .RS 2
  693. .IP \[bu] 2
  694. If failure with ENOENT run \f[B]create\f[] policy
  695. .IP \[bu] 2
  696. If create policy returns the same drive as currently evaluating then
  697. clone the path
  698. .IP \[bu] 2
  699. Re\-attempt rename
  700. .RE
  701. .IP \[bu] 2
  702. If \f[B]any\f[] of the renames succeed the higher level rename is
  703. considered a success
  704. .IP \[bu] 2
  705. If \f[B]no\f[] renames succeed the first error encountered will be
  706. returned
  707. .IP \[bu] 2
  708. On success:
  709. .RS 2
  710. .IP \[bu] 2
  711. Remove the target from all drives with no source file
  712. .IP \[bu] 2
  713. Remove the source from all drives which failed to rename
  714. .RE
  715. .IP \[bu] 2
  716. If using a \f[B]create\f[] policy which does \f[B]not\f[] try to
  717. preserve directory paths
  718. .IP \[bu] 2
  719. Using the \f[B]rename\f[] policy get the list of files to rename
  720. .IP \[bu] 2
  721. Using the \f[B]getattr\f[] policy get the target path
  722. .IP \[bu] 2
  723. For each file attempt rename:
  724. .RS 2
  725. .IP \[bu] 2
  726. If the source drive != target drive:
  727. .IP \[bu] 2
  728. Clone target path from target drive to source drive
  729. .IP \[bu] 2
  730. Rename
  731. .RE
  732. .IP \[bu] 2
  733. If \f[B]any\f[] of the renames succeed the higher level rename is
  734. considered a success
  735. .IP \[bu] 2
  736. If \f[B]no\f[] renames succeed the first error encountered will be
  737. returned
  738. .IP \[bu] 2
  739. On success:
  740. .RS 2
  741. .IP \[bu] 2
  742. Remove the target from all drives with no source file
  743. .IP \[bu] 2
  744. Remove the source from all drives which failed to rename
  745. .RE
  746. .PP
  747. The the removals are subject to normal entitlement checks.
  748. .PP
  749. The above behavior will help minimize the likelihood of EXDEV being
  750. returned but it will still be possible.
  751. .PP
  752. \f[B]link\f[] uses the same strategy but without the removals.
  753. .SS readdir
  754. .PP
  755. readdir (http://linux.die.net/man/3/readdir) is different from all other
  756. filesystem functions.
  757. While it could have it\[aq]s own set of policies to tweak its behavior
  758. at this time it provides a simple union of files and directories found.
  759. Remember that any action or information queried about these files and
  760. directories come from the respective function.
  761. For instance: an \f[B]ls\f[] is a \f[B]readdir\f[] and for each
  762. file/directory returned \f[B]getattr\f[] is called.
  763. Meaning the policy of \f[B]getattr\f[] is responsible for choosing the
  764. file/directory which is the source of the metadata you see in an
  765. \f[B]ls\f[].
  766. .SS statfs / statvfs
  767. .PP
  768. statvfs (http://linux.die.net/man/2/statvfs) normalizes the source
  769. drives based on the fragment size and sums the number of adjusted blocks
  770. and inodes.
  771. This means you will see the combined space of all sources.
  772. Total, used, and free.
  773. The sources however are dedupped based on the drive so multiple sources
  774. on the same drive will not result in double counting it\[aq]s space.
  775. Filesystems mounted further down the tree of the branch will not be
  776. included when checking the mount\[aq]s stats.
  777. .PP
  778. The options \f[C]statfs\f[] and \f[C]statfs_ignore\f[] can be used to
  779. modify \f[C]statfs\f[] behavior.
  780. .SH BUILDING
  781. .PP
  782. \f[B]NOTE:\f[] Prebuilt packages can be found at:
  783. https://github.com/trapexit/mergerfs/releases
  784. .PP
  785. First get the code from github (https://github.com/trapexit/mergerfs).
  786. .IP
  787. .nf
  788. \f[C]
  789. $\ git\ clone\ https://github.com/trapexit/mergerfs.git
  790. $\ #\ or
  791. $\ wget\ https://github.com/trapexit/mergerfs/releases/download/<ver>/mergerfs\-<ver>.tar.gz
  792. \f[]
  793. .fi
  794. .SS Debian / Ubuntu
  795. .IP
  796. .nf
  797. \f[C]
  798. $\ cd\ mergerfs
  799. $\ sudo\ tools/install\-build\-pkgs
  800. $\ make\ deb
  801. $\ sudo\ dpkg\ \-i\ ../mergerfs_version_arch.deb
  802. \f[]
  803. .fi
  804. .SS Fedora
  805. .IP
  806. .nf
  807. \f[C]
  808. $\ su\ \-
  809. #\ cd\ mergerfs
  810. #\ tools/install\-build\-pkgs
  811. #\ make\ rpm
  812. #\ rpm\ \-i\ rpmbuild/RPMS/<arch>/mergerfs\-<verion>.<arch>.rpm
  813. \f[]
  814. .fi
  815. .SS Generically
  816. .PP
  817. Have git, g++, make, python, automake, libtool installed.
  818. .IP
  819. .nf
  820. \f[C]
  821. $\ cd\ mergerfs
  822. $\ make
  823. $\ sudo\ make\ install
  824. \f[]
  825. .fi
  826. .SS Build options
  827. .IP
  828. .nf
  829. \f[C]
  830. $\ make\ help
  831. usage:\ make
  832. make\ USE_XATTR=0\ \ \ \ \ \ \-\ build\ program\ without\ xattrs\ functionality
  833. make\ STATIC=1\ \ \ \ \ \ \ \ \ \-\ build\ static\ binary
  834. make\ LTO=1\ \ \ \ \ \ \ \ \ \ \ \ \-\ build\ with\ link\ time\ optimization
  835. \f[]
  836. .fi
  837. .SH RUNTIME CONFIG
  838. .SS .mergerfs pseudo file
  839. .IP
  840. .nf
  841. \f[C]
  842. <mountpoint>/.mergerfs
  843. \f[]
  844. .fi
  845. .PP
  846. There is a pseudo file available at the mount point which allows for the
  847. runtime modification of certain \f[B]mergerfs\f[] options.
  848. The file will not show up in \f[B]readdir\f[] but can be
  849. \f[B]stat\f[]\[aq]ed and manipulated via
  850. {list,get,set}xattrs (http://linux.die.net/man/2/listxattr) calls.
  851. .PP
  852. Any changes made at runtime are \f[B]not\f[] persisted.
  853. If you wish for values to persist they must be included as options
  854. wherever you configure the mounting of mergerfs (/etc/fstab).
  855. .SS Keys
  856. .PP
  857. Use \f[C]xattr\ \-l\ /mountpoint/.mergerfs\f[] to see all supported
  858. keys.
  859. Some are informational and therefore read\-only.
  860. .SS user.mergerfs.branches
  861. .PP
  862. \f[B]NOTE:\f[] formerly \f[C]user.mergerfs.srcmounts\f[] but said key is
  863. still supported.
  864. .PP
  865. Used to query or modify the list of branches.
  866. When modifying there are several shortcuts to easy manipulation of the
  867. list.
  868. .PP
  869. .TS
  870. tab(@);
  871. l l.
  872. T{
  873. Value
  874. T}@T{
  875. Description
  876. T}
  877. _
  878. T{
  879. [list]
  880. T}@T{
  881. set
  882. T}
  883. T{
  884. +<[list]
  885. T}@T{
  886. prepend
  887. T}
  888. T{
  889. +>[list]
  890. T}@T{
  891. append
  892. T}
  893. T{
  894. \-[list]
  895. T}@T{
  896. remove all values provided
  897. T}
  898. T{
  899. \-<
  900. T}@T{
  901. remove first in list
  902. T}
  903. T{
  904. \->
  905. T}@T{
  906. remove last in list
  907. T}
  908. .TE
  909. .PP
  910. \f[C]xattr\ \-w\ user.mergerfs.branches\ +</mnt/drive3\ /mnt/pool/.mergerfs\f[]
  911. .PP
  912. The \f[C]=NC\f[], \f[C]=RO\f[], \f[C]=RW\f[] syntax works just as on the
  913. command line.
  914. .SS minfreespace
  915. .PP
  916. Input: interger with an optional multiplier suffix.
  917. \f[B]K\f[], \f[B]M\f[], or \f[B]G\f[].
  918. .PP
  919. Output: value in bytes
  920. .SS moveonenospc
  921. .PP
  922. Input: \f[B]true\f[] and \f[B]false\f[]
  923. .PP
  924. Ouput: \f[B]true\f[] or \f[B]false\f[]
  925. .SS categories / funcs
  926. .PP
  927. Input: short policy string as described elsewhere in this document
  928. .PP
  929. Output: the policy string except for categories where its funcs have
  930. multiple types.
  931. In that case it will be a comma separated list
  932. .SS Example
  933. .IP
  934. .nf
  935. \f[C]
  936. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-l\ .mergerfs
  937. user.mergerfs.branches:\ /mnt/a:/mnt/b
  938. user.mergerfs.minfreespace:\ 4294967295
  939. user.mergerfs.moveonenospc:\ false
  940. \&...
  941. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.category.search\ .mergerfs
  942. ff
  943. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-w\ user.mergerfs.category.search\ newest\ .mergerfs
  944. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.category.search\ .mergerfs
  945. newest
  946. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-w\ user.mergerfs.branches\ +/mnt/c\ .mergerfs
  947. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.branches\ .mergerfs
  948. /mnt/a:/mnt/b:/mnt/c
  949. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-w\ user.mergerfs.branches\ =/mnt/c\ .mergerfs
  950. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.branches\ .mergerfs
  951. /mnt/c
  952. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-w\ user.mergerfs.branches\ \[aq]+</mnt/a:/mnt/b\[aq]\ .mergerfs
  953. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.branches\ .mergerfs
  954. /mnt/a:/mnt/b:/mnt/c
  955. \f[]
  956. .fi
  957. .SS file / directory xattrs
  958. .PP
  959. While they won\[aq]t show up when using
  960. listxattr (http://linux.die.net/man/2/listxattr) \f[B]mergerfs\f[]
  961. offers a number of special xattrs to query information about the files
  962. served.
  963. To access the values you will need to issue a
  964. getxattr (http://linux.die.net/man/2/getxattr) for one of the following:
  965. .IP \[bu] 2
  966. \f[B]user.mergerfs.basepath:\f[] the base mount point for the file given
  967. the current getattr policy
  968. .IP \[bu] 2
  969. \f[B]user.mergerfs.relpath:\f[] the relative path of the file from the
  970. perspective of the mount point
  971. .IP \[bu] 2
  972. \f[B]user.mergerfs.fullpath:\f[] the full path of the original file
  973. given the getattr policy
  974. .IP \[bu] 2
  975. \f[B]user.mergerfs.allpaths:\f[] a NUL (\[aq]\[aq]) separated list of
  976. full paths to all files found
  977. .IP
  978. .nf
  979. \f[C]
  980. [trapexit:/mnt/mergerfs]\ $\ ls
  981. A\ B\ C
  982. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.fullpath\ A
  983. /mnt/a/full/path/to/A
  984. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.basepath\ A
  985. /mnt/a
  986. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.relpath\ A
  987. /full/path/to/A
  988. [trapexit:/mnt/mergerfs]\ $\ xattr\ \-p\ user.mergerfs.allpaths\ A\ |\ tr\ \[aq]\\0\[aq]\ \[aq]\\n\[aq]
  989. /mnt/a/full/path/to/A
  990. /mnt/b/full/path/to/A
  991. \f[]
  992. .fi
  993. .SH TOOLING
  994. .IP \[bu] 2
  995. https://github.com/trapexit/mergerfs\-tools
  996. .IP \[bu] 2
  997. mergerfs.ctl: A tool to make it easier to query and configure mergerfs
  998. at runtime
  999. .IP \[bu] 2
  1000. mergerfs.fsck: Provides permissions and ownership auditing and the
  1001. ability to fix them
  1002. .IP \[bu] 2
  1003. mergerfs.dedup: Will help identify and optionally remove duplicate files
  1004. .IP \[bu] 2
  1005. mergerfs.dup: Ensure there are at least N copies of a file across the
  1006. pool
  1007. .IP \[bu] 2
  1008. mergerfs.balance: Rebalance files across drives by moving them from the
  1009. most filled to the least filled
  1010. .IP \[bu] 2
  1011. mergerfs.mktrash: Creates FreeDesktop.org Trash specification compatible
  1012. directories on a mergerfs mount
  1013. .IP \[bu] 2
  1014. https://github.com/trapexit/scorch
  1015. .IP \[bu] 2
  1016. scorch: A tool to help discover silent corruption of files and keep
  1017. track of files
  1018. .IP \[bu] 2
  1019. https://github.com/trapexit/bbf
  1020. .IP \[bu] 2
  1021. bbf (bad block finder): a tool to scan for and \[aq]fix\[aq] hard drive
  1022. bad blocks and find the files using those blocks
  1023. .SH CACHING
  1024. .SS page caching
  1025. .PP
  1026. The kernel performs caching of data pages on all files not opened with
  1027. \f[C]O_DIRECT\f[].
  1028. Due to mergerfs using FUSE and therefore being a userland process the
  1029. kernel can double cache the content being read through mergerfs.
  1030. Once from the underlying filesystem and once for mergerfs.
  1031. Using \f[C]direct_io\f[] and/or \f[C]dropcacheonclose\f[] help minimize
  1032. the double caching.
  1033. \f[C]direct_io\f[] will instruct the kernel to bypass the page cache for
  1034. files opened through mergerfs.
  1035. \f[C]dropcacheonclose\f[] will cause mergerfs to instruct the kernel to
  1036. flush a file\[aq]s page cache for which it had opened when closed.
  1037. If most data is read once its probably best to enable both (read above
  1038. for details and limitations).
  1039. .PP
  1040. If a cache is desired for mergerfs do not enable \f[C]direct_io\f[] and
  1041. instead possibly use \f[C]auto_cache\f[] or \f[C]kernel_cache\f[].
  1042. By default FUSE will invalidate cached pages when a file is opened.
  1043. By using \f[C]auto_cache\f[] it will instead use \f[C]getattr\f[] to
  1044. check if a file has changed when the file is opened and if so will flush
  1045. the cache.
  1046. \f[C]ac_attr_timeout\f[] is the timeout for keeping said cache.
  1047. Alternatively \f[C]kernel_cache\f[] will keep the cache across opens
  1048. unless invalidated through other means.
  1049. You should only uses these if you do not plan to write/modify the same
  1050. files through mergerfs and the underlying filesystem at the same time.
  1051. It could lead to corruption.
  1052. Then again doing so without caching can also cause issues.
  1053. .PP
  1054. It\[aq]s a difficult balance between memory usage, cache bloat &
  1055. duplication, and performance.
  1056. Ideally mergerfs would be able to disable caching for the files it
  1057. reads/writes but allow page caching for itself.
  1058. That would limit the FUSE overhead.
  1059. However, there isn\[aq]t good way to achieve this.
  1060. .SS entry & attribute caching
  1061. .PP
  1062. Given the relatively high cost of FUSE due to the kernel <\-> userspace
  1063. round trips there are kernel side caches for file entries and
  1064. attributes.
  1065. The entry cache limits the \f[C]lookup\f[] calls to mergerfs which ask
  1066. if a file exists.
  1067. The attribute cache limits the need to make \f[C]getattr\f[] calls to
  1068. mergerfs which provide file attributes (mode, size, type, etc.).
  1069. As with the page cache these should not be used if the underlying
  1070. filesystems are being manipulated at the same time as it could lead to
  1071. odd behavior or data corruption.
  1072. The options for setting these are \f[C]cache.entry\f[] and
  1073. \f[C]cache.negative_entry\f[] for the entry cache and
  1074. \f[C]cache.attr\f[] for the attributes cache.
  1075. \f[C]cache.negative_entry\f[] refers to the timeout for negative
  1076. responses to lookups (non\-existant files).
  1077. .SS policy caching
  1078. .PP
  1079. Policies are run every time a function (with a policy as mentioned
  1080. above) is called.
  1081. These policies can be expensive depending on mergerfs\[aq] setup and
  1082. client usage patterns.
  1083. Generally we wouldn\[aq]t want to cache policy results because it may
  1084. result in stale responses if the underlying drives are used directly.
  1085. .PP
  1086. The \f[C]open\f[] policy cache will cache the result of an \f[C]open\f[]
  1087. policy for a particular input for \f[C]cache.open\f[] seconds or until
  1088. the file is unlinked.
  1089. Each file close (release) will randomly chose to clean up the cache of
  1090. expired entries.
  1091. .PP
  1092. This cache is really only useful in cases where you have a large number
  1093. of branches and \f[C]open\f[] is called on the same files repeatedly
  1094. (like \f[B]Transmission\f[] which opens and closes a file on every
  1095. read/write presumably to keep file handle usage low).
  1096. .SS statfs caching
  1097. .PP
  1098. Of the syscalls used by mergerfs in policies the \f[C]statfs\f[] /
  1099. \f[C]statvfs\f[] call is perhaps the most expensive.
  1100. It\[aq]s used to find out the available space of a drive and whether it
  1101. is mounted read\-only.
  1102. Depending on the setup and usage pattern these queries can be relatively
  1103. costly.
  1104. When \f[C]cache.statfs\f[] is enabled all calls to \f[C]statfs\f[] by a
  1105. policy will be cached for the number of seconds its set to.
  1106. .PP
  1107. Example: If the create policy is \f[C]mfs\f[] and the timeout is 60 then
  1108. for that 60 seconds the same drive will be returned as the target for
  1109. creates because the available space won\[aq]t be updated for that time.
  1110. .SS symlink caching
  1111. .PP
  1112. As of version 4.20 Linux supports symlink caching.
  1113. Significant performance increases can be had in workloads which use a
  1114. lot of symlinks.
  1115. Setting \f[C]cache.symlinks=true\f[] will result in requesting symlink
  1116. caching from the kernel only if supported.
  1117. As a result its safe to enable it on systems prior to 4.20.
  1118. That said it is disabled by default for now.
  1119. You can see if caching is enabled by querying the xattr
  1120. \f[C]user.mergerfs.cache.symlinks\f[].
  1121. .SS writeback caching
  1122. .PP
  1123. writeback caching is a technique for improving write speeds by batching
  1124. writes at a faster device and then bulk writing to the slower device.
  1125. With FUSE the kernel will wait for a number of writes to be made and
  1126. then send it to the filesystem as one request.
  1127. mergerfs currently uses a slightly modified and vendored libfuse 2.9.7
  1128. which does not support writeback caching.
  1129. However, a prototype port to libfuse 3.x has been made and the writeback
  1130. cache appears to work as expected (though performance improvements
  1131. greatly depend on the way the client app writes data).
  1132. Once the port is complete and thoroughly tested writeback caching will
  1133. be available.
  1134. .SS tiered caching
  1135. .PP
  1136. Some storage technologies support what some call "tiered" caching.
  1137. The placing of usually smaller, faster storage as a transparent cache to
  1138. larger, slower storage.
  1139. NVMe, SSD, Optane in front of traditional HDDs for instance.
  1140. .PP
  1141. MergerFS does not natively support any sort of tiered caching.
  1142. Most users have no use for such a feature and its inclusion would
  1143. complicate the code.
  1144. However, there are a few situations where a cache drive could help with
  1145. a typical mergerfs setup.
  1146. .IP "1." 3
  1147. Fast network, slow drives, many readers: You\[aq]ve a 10+Gbps network
  1148. with many readers and your regular drives can\[aq]t keep up.
  1149. .IP "2." 3
  1150. Fast network, slow drives, small\[aq]ish bursty writes: You have a
  1151. 10+Gbps network and wish to transfer amounts of data less than your
  1152. cache drive but wish to do so quickly.
  1153. .PP
  1154. With #1 its arguable if you should be using mergerfs at all.
  1155. RAID would probably be the better solution.
  1156. If you\[aq]re going to use mergerfs there are other tactics that may
  1157. help: spreading the data across drives (see the mergerfs.dup tool) and
  1158. setting \f[C]func.open=rand\f[], using \f[C]symlinkify\f[], or using
  1159. dm\-cache or a similar technology to add tiered cache to the underlying
  1160. device.
  1161. .PP
  1162. With #2 one could use dm\-cache as well but there is another solution
  1163. which requires only mergerfs and a cronjob.
  1164. .IP "1." 3
  1165. Create 2 mergerfs pools.
  1166. One which includes just the slow drives and one which has both the fast
  1167. drives (SSD,NVME,etc.) and slow drives.
  1168. .IP "2." 3
  1169. The \[aq]cache\[aq] pool should have the cache drives listed first.
  1170. .IP "3." 3
  1171. The best \f[C]create\f[] policies to use for the \[aq]cache\[aq] pool
  1172. would probably be \f[C]ff\f[], \f[C]epff\f[], \f[C]lfs\f[], or
  1173. \f[C]eplfs\f[].
  1174. The latter two under the assumption that the cache drive(s) are far
  1175. smaller than the backing drives.
  1176. If using path preserving policies remember that you\[aq]ll need to
  1177. manually create the core directories of those paths you wish to be
  1178. cached.
  1179. Be sure the permissions are in sync.
  1180. Use \f[C]mergerfs.fsck\f[] to check / correct them.
  1181. You could also tag the slow drives as \f[C]=NC\f[] though that\[aq]d
  1182. mean if the cache drives fill you\[aq]d get "out of space" errors.
  1183. .IP "4." 3
  1184. Enable \f[C]moveonenospc\f[] and set \f[C]minfreespace\f[]
  1185. appropriately.
  1186. Perhaps setting \f[C]minfreespace\f[] to the size of the largest cache
  1187. drive.
  1188. .IP "5." 3
  1189. Set your programs to use the cache pool.
  1190. .IP "6." 3
  1191. Save one of the below scripts or create you\[aq]re own.
  1192. .IP "7." 3
  1193. Use \f[C]cron\f[] (as root) to schedule the command at whatever
  1194. frequency is appropriate for your workflow.
  1195. .SS time based expiring
  1196. .PP
  1197. Move files from cache to backing pool based only on the last time the
  1198. file was accessed.
  1199. Replace \f[C]\-atime\f[] with \f[C]\-amin\f[] if you want minutes rather
  1200. than days.
  1201. May want to use the \f[C]fadvise\f[] / \f[C]\-\-drop\-cache\f[] version
  1202. of rsync or run rsync with the tool "nocache".
  1203. .IP
  1204. .nf
  1205. \f[C]
  1206. #!/bin/bash
  1207. if\ [\ $#\ !=\ 3\ ];\ then
  1208. \ \ echo\ "usage:\ $0\ <cache\-drive>\ <backing\-pool>\ <days\-old>"
  1209. \ \ exit\ 1
  1210. fi
  1211. CACHE="${1}"
  1212. BACKING="${2}"
  1213. N=${3}
  1214. find\ "${CACHE}"\ \-type\ f\ \-atime\ +${N}\ \-printf\ \[aq]%P\\n\[aq]\ |\ \\
  1215. \ \ rsync\ \-\-files\-from=\-\ \-axqHAXWES\ \-\-preallocate\ \-\-remove\-source\-files\ "${CACHE}/"\ "${BACKING}/"
  1216. \f[]
  1217. .fi
  1218. .SS percentage full expiring
  1219. .PP
  1220. Move the oldest file from the cache to the backing pool.
  1221. Continue till below percentage threshold.
  1222. .IP
  1223. .nf
  1224. \f[C]
  1225. #!/bin/bash
  1226. if\ [\ $#\ !=\ 3\ ];\ then
  1227. \ \ echo\ "usage:\ $0\ <cache\-drive>\ <backing\-pool>\ <percentage>"
  1228. \ \ exit\ 1
  1229. fi
  1230. CACHE="${1}"
  1231. BACKING="${2}"
  1232. PERCENTAGE=${3}
  1233. set\ \-o\ errexit
  1234. while\ [\ $(df\ \-\-output=pcent\ "${CACHE}"\ |\ grep\ \-v\ Use\ |\ cut\ \-d\[aq]%\[aq]\ \-f1)\ \-gt\ ${PERCENTAGE}\ ]
  1235. do
  1236. \ \ \ \ FILE=$(find\ "${CACHE}"\ \-type\ f\ \-printf\ \[aq]%A\@\ %P\\n\[aq]\ |\ \\
  1237. \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ sort\ |\ \\
  1238. \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ head\ \-n\ 1\ |\ \\
  1239. \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ cut\ \-d\[aq]\ \[aq]\ \-f2\-)
  1240. \ \ \ \ test\ \-n\ "${FILE}"
  1241. \ \ \ \ rsync\ \-axqHAXWES\ \-\-preallocate\ \-\-remove\-source\-files\ "${CACHE}/./${FILE}"\ "${BACKING}/"
  1242. done
  1243. \f[]
  1244. .fi
  1245. .SH TIPS / NOTES
  1246. .IP \[bu] 2
  1247. \f[B]use_ino\f[] will only work when used with mergerfs 2.18.0 and
  1248. above.
  1249. .IP \[bu] 2
  1250. Run mergerfs as \f[C]root\f[] (with \f[B]allow_other\f[]) unless
  1251. you\[aq]re merging paths which are owned by the same user otherwise
  1252. strange permission issues may arise.
  1253. .IP \[bu] 2
  1254. https://github.com/trapexit/backup\-and\-recovery\-howtos : A set of
  1255. guides / howtos on creating a data storage system, backing it up,
  1256. maintaining it, and recovering from failure.
  1257. .IP \[bu] 2
  1258. If you don\[aq]t see some directories and files you expect in a merged
  1259. point or policies seem to skip drives be sure the user has permission to
  1260. all the underlying directories.
  1261. Use \f[C]mergerfs.fsck\f[] to audit the drive for out of sync
  1262. permissions.
  1263. .IP \[bu] 2
  1264. Do \f[B]not\f[] use \f[C]direct_io\f[] if you expect applications (such
  1265. as rtorrent) to mmap (http://linux.die.net/man/2/mmap) files.
  1266. It is not currently supported in FUSE w/ \f[C]direct_io\f[] enabled.
  1267. Enabling \f[C]dropcacheonclose\f[] is recommended when
  1268. \f[C]direct_io\f[] is disabled.
  1269. .IP \[bu] 2
  1270. Since POSIX functions give only a singular error or success its
  1271. difficult to determine the proper behavior when applying the function to
  1272. multiple targets.
  1273. \f[B]mergerfs\f[] will return an error only if all attempts of an action
  1274. fail.
  1275. Any success will lead to a success returned.
  1276. This means however that some odd situations may arise.
  1277. .IP \[bu] 2
  1278. Kodi (http://kodi.tv), Plex (http://plex.tv),
  1279. Subsonic (http://subsonic.org), etc.
  1280. can use directory mtime (http://linux.die.net/man/2/stat) to more
  1281. efficiently determine whether to scan for new content rather than simply
  1282. performing a full scan.
  1283. If using the default \f[B]getattr\f[] policy of \f[B]ff\f[] its possible
  1284. those programs will miss an update on account of it returning the first
  1285. directory found\[aq]s \f[B]stat\f[] info and its a later directory on
  1286. another mount which had the \f[B]mtime\f[] recently updated.
  1287. To fix this you will want to set \f[B]func.getattr=newest\f[].
  1288. Remember though that this is just \f[B]stat\f[].
  1289. If the file is later \f[B]open\f[]\[aq]ed or \f[B]unlink\f[]\[aq]ed and
  1290. the policy is different for those then a completely different file or
  1291. directory could be acted on.
  1292. .IP \[bu] 2
  1293. Some policies mixed with some functions may result in strange behaviors.
  1294. Not that some of these behaviors and race conditions couldn\[aq]t happen
  1295. outside \f[B]mergerfs\f[] but that they are far more likely to occur on
  1296. account of the attempt to merge together multiple sources of data which
  1297. could be out of sync due to the different policies.
  1298. .IP \[bu] 2
  1299. For consistency its generally best to set \f[B]category\f[] wide
  1300. policies rather than individual \f[B]func\f[]\[aq]s.
  1301. This will help limit the confusion of tools such as
  1302. rsync (http://linux.die.net/man/1/rsync).
  1303. However, the flexibility is there if needed.
  1304. .SH KNOWN ISSUES / BUGS
  1305. .SS directory mtime is not being updated
  1306. .PP
  1307. Remember that the default policy for \f[C]getattr\f[] is \f[C]ff\f[].
  1308. The information for the first directory found will be returned.
  1309. If it wasn\[aq]t the directory which had been updated then it will
  1310. appear outdated.
  1311. .PP
  1312. The reason this is the default is because any other policy would be more
  1313. expensive and for many applications it is unnecessary.
  1314. To always return the directory with the most recent mtime or a faked
  1315. value based on all found would require a scan of all drives.
  1316. .PP
  1317. If you always want the directory information from the one with the most
  1318. recent mtime then use the \f[C]newest\f[] policy for \f[C]getattr\f[].
  1319. .SS \f[C]mv\ /mnt/pool/foo\ /mnt/disk1/foo\f[] removes \f[C]foo\f[]
  1320. .PP
  1321. This is not a bug.
  1322. .PP
  1323. Run in verbose mode to better undertand what\[aq]s happening:
  1324. .IP
  1325. .nf
  1326. \f[C]
  1327. $\ mv\ \-v\ /mnt/pool/foo\ /mnt/disk1/foo
  1328. copied\ \[aq]/mnt/pool/foo\[aq]\ \->\ \[aq]/mnt/disk1/foo\[aq]
  1329. removed\ \[aq]/mnt/pool/foo\[aq]
  1330. $\ ls\ /mnt/pool/foo
  1331. ls:\ cannot\ access\ \[aq]/mnt/pool/foo\[aq]:\ No\ such\ file\ or\ directory
  1332. \f[]
  1333. .fi
  1334. .PP
  1335. \f[C]mv\f[], when working across devices, is copying the source to
  1336. target and then removing the source.
  1337. Since the source \f[B]is\f[] the target in this case, depending on the
  1338. unlink policy, it will remove the just copied file and other files
  1339. across the branches.
  1340. .PP
  1341. If you want to move files to one drive just copy them there and use
  1342. mergerfs.dedup to clean up the old paths or manually remove them from
  1343. the branches directly.
  1344. .SS cached memory appears greater than it should be
  1345. .PP
  1346. Use the \f[C]direct_io\f[] option as described above.
  1347. Due to what mergerfs is doing there ends up being two caches of a file
  1348. under normal usage.
  1349. One from the underlying filesystem and one from mergerfs.
  1350. Enabling \f[C]direct_io\f[] removes the mergerfs cache.
  1351. This saves on memory but means the kernel needs to communicate with
  1352. mergerfs more often and can therefore result in slower speeds.
  1353. .PP
  1354. Since enabling \f[C]direct_io\f[] disables \f[C]mmap\f[] this is not an
  1355. ideal situation however write speeds should be increased.
  1356. .PP
  1357. If \f[C]direct_io\f[] is disabled it is probably a good idea to enable
  1358. \f[C]dropcacheonclose\f[] to minimize double caching.
  1359. .SS NFS clients returning ESTALE / Stale file handle
  1360. .PP
  1361. Be sure to use \f[C]noforget\f[] and \f[C]use_ino\f[] arguments.
  1362. .SS NFS clients don\[aq]t work
  1363. .PP
  1364. Some NFS clients appear to fail when a mergerfs mount is exported.
  1365. Kodi in particular seems to have issues.
  1366. .PP
  1367. Try enabling the \f[C]use_ino\f[] option.
  1368. Some have reported that it fixes the issue.
  1369. .SS rtorrent fails with ENODEV (No such device)
  1370. .PP
  1371. Be sure to turn off \f[C]direct_io\f[].
  1372. rtorrent and some other applications use
  1373. mmap (http://linux.die.net/man/2/mmap) to read and write to files and
  1374. offer no failback to traditional methods.
  1375. FUSE does not currently support mmap while using \f[C]direct_io\f[].
  1376. There may be a performance penalty on writes with \f[C]direct_io\f[] off
  1377. as well as the problem of double caching but it\[aq]s the only way to
  1378. get such applications to work.
  1379. If the performance loss is too high for other apps you can mount
  1380. mergerfs twice.
  1381. Once with \f[C]direct_io\f[] enabled and one without it.
  1382. Be sure to set \f[C]dropcacheonclose=true\f[] if not using
  1383. \f[C]direct_io\f[].
  1384. .SS rtorrent fails with files >= 4GiB
  1385. .PP
  1386. This is a kernel bug with mmap and FUSE on 32bit platforms.
  1387. A fix should become available for all LTS releases.
  1388. .PP
  1389. https://marc.info/?l=linux\-fsdevel&m=155550785230874&w=2
  1390. .SS Plex doesn\[aq]t work with mergerfs
  1391. .PP
  1392. It does.
  1393. If you\[aq]re trying to put Plex\[aq]s config / metadata on mergerfs you
  1394. have to leave \f[C]direct_io\f[] off because Plex is using sqlite which
  1395. apparently needs mmap.
  1396. mmap doesn\[aq]t work with \f[C]direct_io\f[].
  1397. To fix this place the data elsewhere or disable \f[C]direct_io\f[] (with
  1398. \f[C]dropcacheonclose=true\f[]).
  1399. .PP
  1400. If the issue is that scanning doesn\[aq]t seem to pick up media then be
  1401. sure to set \f[C]func.getattr=newest\f[] as mentioned above.
  1402. .SS mmap performance is really bad
  1403. .PP
  1404. There is a bug (https://lkml.org/lkml/2016/3/16/260) in caching which
  1405. affects overall performance of mmap through FUSE in Linux 4.x kernels.
  1406. It is fixed in 4.4.10 and 4.5.4 (https://lkml.org/lkml/2016/5/11/59).
  1407. .SS When a program tries to move or rename a file it fails
  1408. .PP
  1409. Please read the section above regarding rename & link (#rename--link).
  1410. .PP
  1411. The problem is that many applications do not properly handle
  1412. \f[C]EXDEV\f[] errors which \f[C]rename\f[] and \f[C]link\f[] may return
  1413. even though they are perfectly valid situations which do not indicate
  1414. actual drive or OS errors.
  1415. The error will only be returned by mergerfs if using a path preserving
  1416. policy as described in the policy section above.
  1417. If you do not care about path preservation simply change the mergerfs
  1418. policy to the non\-path preserving version.
  1419. For example: \f[C]\-o\ category.create=mfs\f[]
  1420. .PP
  1421. Ideally the offending software would be fixed and it is recommended that
  1422. if you run into this problem you contact the software\[aq]s author and
  1423. request proper handling of \f[C]EXDEV\f[] errors.
  1424. .SS Samba: Moving files / directories fails
  1425. .PP
  1426. Workaround: Copy the file/directory and then remove the original rather
  1427. than move.
  1428. .PP
  1429. This isn\[aq]t an issue with Samba but some SMB clients.
  1430. GVFS\-fuse v1.20.3 and prior (found in Ubuntu 14.04 among others) failed
  1431. to handle certain error codes correctly.
  1432. Particularly \f[B]STATUS_NOT_SAME_DEVICE\f[] which comes from the
  1433. \f[B]EXDEV\f[] which is returned by \f[B]rename\f[] when the call is
  1434. crossing mount points.
  1435. When a program gets an \f[B]EXDEV\f[] it needs to explicitly take an
  1436. alternate action to accomplish it\[aq]s goal.
  1437. In the case of \f[B]mv\f[] or similar it tries \f[B]rename\f[] and on
  1438. \f[B]EXDEV\f[] falls back to a manual copying of data between the two
  1439. locations and unlinking the source.
  1440. In these older versions of GVFS\-fuse if it received \f[B]EXDEV\f[] it
  1441. would translate that into \f[B]EIO\f[].
  1442. This would cause \f[B]mv\f[] or most any application attempting to move
  1443. files around on that SMB share to fail with a IO error.
  1444. .PP
  1445. GVFS\-fuse v1.22.0 (https://bugzilla.gnome.org/show_bug.cgi?id=734568)
  1446. and above fixed this issue but a large number of systems use the older
  1447. release.
  1448. On Ubuntu the version can be checked by issuing
  1449. \f[C]apt\-cache\ showpkg\ gvfs\-fuse\f[].
  1450. Most distros released in 2015 seem to have the updated release and will
  1451. work fine but older systems may not.
  1452. Upgrading gvfs\-fuse or the distro in general will address the problem.
  1453. .PP
  1454. In Apple\[aq]s MacOSX 10.9 they replaced Samba (client and server) with
  1455. their own product.
  1456. It appears their new client does not handle \f[B]EXDEV\f[] either and
  1457. responds similar to older release of gvfs on Linux.
  1458. .SS Trashing files occasionally fails
  1459. .PP
  1460. This is the same issue as with Samba.
  1461. \f[C]rename\f[] returns \f[C]EXDEV\f[] (in our case that will really
  1462. only happen with path preserving policies like \f[C]epmfs\f[]) and the
  1463. software doesn\[aq]t handle the situtation well.
  1464. This is unfortunately a common failure of software which moves files
  1465. around.
  1466. The standard indicates that an implementation \f[C]MAY\f[] choose to
  1467. support non\-user home directory trashing of files (which is a
  1468. \f[C]MUST\f[]).
  1469. The implementation \f[C]MAY\f[] also support "top directory trashes"
  1470. which many probably do.
  1471. .PP
  1472. To create a \f[C]$topdir/.Trash\f[] directory as defined in the standard
  1473. use the mergerfs\-tools (https://github.com/trapexit/mergerfs-tools)
  1474. tool \f[C]mergerfs.mktrash\f[].
  1475. .SS tar: Directory renamed before its status could be extracted
  1476. .PP
  1477. Make sure to use the \f[C]use_ino\f[] option.
  1478. .SS Supplemental user groups
  1479. .PP
  1480. Due to the overhead of
  1481. getgroups/setgroups (http://linux.die.net/man/2/setgroups) mergerfs
  1482. utilizes a cache.
  1483. This cache is opportunistic and per thread.
  1484. Each thread will query the supplemental groups for a user when that
  1485. particular thread needs to change credentials and will keep that data
  1486. for the lifetime of the thread.
  1487. This means that if a user is added to a group it may not be picked up
  1488. without the restart of mergerfs.
  1489. However, since the high level FUSE API\[aq]s (at least the standard
  1490. version) thread pool dynamically grows and shrinks it\[aq]s possible
  1491. that over time a thread will be killed and later a new thread with no
  1492. cache will start and query the new data.
  1493. .PP
  1494. The gid cache uses fixed storage to simplify the design and be
  1495. compatible with older systems which may not have C++11 compilers.
  1496. There is enough storage for 256 users\[aq] supplemental groups.
  1497. Each user is allowed upto 32 supplemental groups.
  1498. Linux >= 2.6.3 allows upto 65535 groups per user but most other *nixs
  1499. allow far less.
  1500. NFS allowing only 16.
  1501. The system does handle overflow gracefully.
  1502. If the user has more than 32 supplemental groups only the first 32 will
  1503. be used.
  1504. If more than 256 users are using the system when an uncached user is
  1505. found it will evict an existing user\[aq]s cache at random.
  1506. So long as there aren\[aq]t more than 256 active users this should be
  1507. fine.
  1508. If either value is too low for your needs you will have to modify
  1509. \f[C]gidcache.hpp\f[] to increase the values.
  1510. Note that doing so will increase the memory needed by each thread.
  1511. .SS mergerfs or libfuse crashing
  1512. .PP
  1513. \f[B]NOTE:\f[] as of mergerfs 2.22.0 it includes the most recent version
  1514. of libfuse (or requires libfuse\-2.9.7) so any crash should be reported.
  1515. For older releases continue reading...
  1516. .PP
  1517. If suddenly the mergerfs mount point disappears and
  1518. \f[C]Transport\ endpoint\ is\ not\ connected\f[] is returned when
  1519. attempting to perform actions within the mount directory \f[B]and\f[]
  1520. the version of libfuse (use \f[C]mergerfs\ \-v\f[] to find the version)
  1521. is older than \f[C]2.9.4\f[] its likely due to a bug in libfuse.
  1522. Affected versions of libfuse can be found in Debian Wheezy, Ubuntu
  1523. Precise and others.
  1524. .PP
  1525. In order to fix this please install newer versions of libfuse.
  1526. If using a Debian based distro (Debian,Ubuntu,Mint) you can likely just
  1527. install newer versions of
  1528. libfuse (https://packages.debian.org/unstable/libfuse2) and
  1529. fuse (https://packages.debian.org/unstable/fuse) from the repo of a
  1530. newer release.
  1531. .SS mergerfs appears to be crashing or exiting
  1532. .PP
  1533. There seems to be an issue with Linux version \f[C]4.9.0\f[] and above
  1534. in which an invalid message appears to be transmitted to libfuse (used
  1535. by mergerfs) causing it to exit.
  1536. No messages will be printed in any logs as its not a proper crash.
  1537. Debugging of the issue is still ongoing and can be followed via the
  1538. fuse\-devel
  1539. thread (https://sourceforge.net/p/fuse/mailman/message/35662577).
  1540. .SS mergerfs under heavy load and memory preasure leads to kernel panic
  1541. .PP
  1542. https://lkml.org/lkml/2016/9/14/527
  1543. .IP
  1544. .nf
  1545. \f[C]
  1546. [25192.515454]\ kernel\ BUG\ at\ /build/linux\-a2WvEb/linux\-4.4.0/mm/workingset.c:346!
  1547. [25192.517521]\ invalid\ opcode:\ 0000\ [#1]\ SMP
  1548. [25192.519602]\ Modules\ linked\ in:\ netconsole\ ip6t_REJECT\ nf_reject_ipv6\ ipt_REJECT\ nf_reject_ipv4\ configfs\ binfmt_misc\ veth\ bridge\ stp\ llc\ nf_conntrack_ipv6\ nf_defrag_ipv6\ xt_conntrack\ ip6table_filter\ ip6_tables\ xt_multiport\ iptable_filter\ ipt_MASQUERADE\ nf_nat_masquerade_ipv4\ xt_comment\ xt_nat\ iptable_nat\ nf_conntrack_ipv4\ nf_defrag_ipv4\ nf_nat_ipv4\ nf_nat\ nf_conntrack\ xt_CHECKSUM\ xt_tcpudp\ iptable_mangle\ ip_tables\ x_tables\ intel_rapl\ x86_pkg_temp_thermal\ intel_powerclamp\ eeepc_wmi\ asus_wmi\ coretemp\ sparse_keymap\ kvm_intel\ ppdev\ kvm\ irqbypass\ mei_me\ 8250_fintek\ input_leds\ serio_raw\ parport_pc\ tpm_infineon\ mei\ shpchp\ mac_hid\ parport\ lpc_ich\ autofs4\ drbg\ ansi_cprng\ dm_crypt\ algif_skcipher\ af_alg\ btrfs\ raid456\ async_raid6_recov\ async_memcpy\ async_pq\ async_xor\ async_tx\ xor\ raid6_pq\ libcrc32c\ raid0\ multipath\ linear\ raid10\ raid1\ i915\ crct10dif_pclmul\ crc32_pclmul\ aesni_intel\ i2c_algo_bit\ aes_x86_64\ drm_kms_helper\ lrw\ gf128mul\ glue_helper\ ablk_helper\ syscopyarea\ cryptd\ sysfillrect\ sysimgblt\ fb_sys_fops\ drm\ ahci\ r8169\ libahci\ mii\ wmi\ fjes\ video\ [last\ unloaded:\ netconsole]
  1549. [25192.540910]\ CPU:\ 2\ PID:\ 63\ Comm:\ kswapd0\ Not\ tainted\ 4.4.0\-36\-generic\ #55\-Ubuntu
  1550. [25192.543411]\ Hardware\ name:\ System\ manufacturer\ System\ Product\ Name/P8H67\-M\ PRO,\ BIOS\ 3904\ 04/27/2013
  1551. [25192.545840]\ task:\ ffff88040cae6040\ ti:\ ffff880407488000\ task.ti:\ ffff880407488000
  1552. [25192.548277]\ RIP:\ 0010:[<ffffffff811ba501>]\ \ [<ffffffff811ba501>]\ shadow_lru_isolate+0x181/0x190
  1553. [25192.550706]\ RSP:\ 0018:ffff88040748bbe0\ \ EFLAGS:\ 00010002
  1554. [25192.553127]\ RAX:\ 0000000000001c81\ RBX:\ ffff8802f91ee928\ RCX:\ ffff8802f91eeb38
  1555. [25192.555544]\ RDX:\ ffff8802f91ee938\ RSI:\ ffff8802f91ee928\ RDI:\ ffff8804099ba2c0
  1556. [25192.557914]\ RBP:\ ffff88040748bc08\ R08:\ 000000000001a7b6\ R09:\ 000000000000003f
  1557. [25192.560237]\ R10:\ 000000000001a750\ R11:\ 0000000000000000\ R12:\ ffff8804099ba2c0
  1558. [25192.562512]\ R13:\ ffff8803157e9680\ R14:\ ffff8803157e9668\ R15:\ ffff8804099ba2c8
  1559. [25192.564724]\ FS:\ \ 0000000000000000(0000)\ GS:ffff88041f280000(0000)\ knlGS:0000000000000000
  1560. [25192.566990]\ CS:\ \ 0010\ DS:\ 0000\ ES:\ 0000\ CR0:\ 0000000080050033
  1561. [25192.569201]\ CR2:\ 00007ffabb690000\ CR3:\ 0000000001e0a000\ CR4:\ 00000000000406e0
  1562. [25192.571419]\ Stack:
  1563. [25192.573550]\ \ ffff8804099ba2c0\ ffff88039e4f86f0\ ffff8802f91ee928\ ffff8804099ba2c8
  1564. [25192.575695]\ \ ffff88040748bd08\ ffff88040748bc58\ ffffffff811b99bf\ 0000000000000052
  1565. [25192.577814]\ \ 0000000000000000\ ffffffff811ba380\ 000000000000008a\ 0000000000000080
  1566. [25192.579947]\ Call\ Trace:
  1567. [25192.582022]\ \ [<ffffffff811b99bf>]\ __list_lru_walk_one.isra.3+0x8f/0x130
  1568. [25192.584137]\ \ [<ffffffff811ba380>]\ ?\ memcg_drain_all_list_lrus+0x190/0x190
  1569. [25192.586165]\ \ [<ffffffff811b9a83>]\ list_lru_walk_one+0x23/0x30
  1570. [25192.588145]\ \ [<ffffffff811ba544>]\ scan_shadow_nodes+0x34/0x50
  1571. [25192.590074]\ \ [<ffffffff811a0e9d>]\ shrink_slab.part.40+0x1ed/0x3d0
  1572. [25192.591985]\ \ [<ffffffff811a53da>]\ shrink_zone+0x2ca/0x2e0
  1573. [25192.593863]\ \ [<ffffffff811a64ce>]\ kswapd+0x51e/0x990
  1574. [25192.595737]\ \ [<ffffffff811a5fb0>]\ ?\ mem_cgroup_shrink_node_zone+0x1c0/0x1c0
  1575. [25192.597613]\ \ [<ffffffff810a0808>]\ kthread+0xd8/0xf0
  1576. [25192.599495]\ \ [<ffffffff810a0730>]\ ?\ kthread_create_on_node+0x1e0/0x1e0
  1577. [25192.601335]\ \ [<ffffffff8182e34f>]\ ret_from_fork+0x3f/0x70
  1578. [25192.603193]\ \ [<ffffffff810a0730>]\ ?\ kthread_create_on_node+0x1e0/0x1e0
  1579. \f[]
  1580. .fi
  1581. .PP
  1582. There is a bug in the kernel.
  1583. A work around appears to be turning off \f[C]splice\f[].
  1584. Don\[aq]t add the \f[C]splice_*\f[] arguments or add
  1585. \f[C]no_splice_write,no_splice_move,no_splice_read\f[].
  1586. This, however, is not guaranteed to work.
  1587. .SS rm: fts_read failed: No such file or directory
  1588. .PP
  1589. NOTE: This is only relevant to mergerfs versions at or below v2.25.x and
  1590. should not occur in more recent versions.
  1591. See the notes on \f[C]unlink\f[].
  1592. .PP
  1593. Not \f[I]really\f[] a bug.
  1594. The FUSE library will move files when asked to delete them as a way to
  1595. deal with certain edge cases and then later delete that file when its
  1596. clear the file is no longer needed.
  1597. This however can lead to two issues.
  1598. One is that these hidden files are noticed by \f[C]rm\ \-rf\f[] or
  1599. \f[C]find\f[] when scanning directories and they may try to remove them
  1600. and they might have disappeared already.
  1601. There is nothing \f[I]wrong\f[] about this happening but it can be
  1602. annoying.
  1603. The second issue is that a directory might not be able to removed on
  1604. account of the hidden file being still there.
  1605. .PP
  1606. Using the \f[B]hard_remove\f[] option will make it so these temporary
  1607. files are not used and files are deleted immedately.
  1608. That has a side effect however.
  1609. Files which are unlinked and then they are still used (in certain forms)
  1610. will result in an error (ENOENT).
  1611. .SH FAQ
  1612. .SS How well does mergerfs scale? Is it "production ready?"
  1613. .PP
  1614. Users have reported running mergerfs on everything from a Raspberry Pi
  1615. to dual socket Xeon systems with >20 cores.
  1616. I\[aq]m aware of at least a few companies which use mergerfs in
  1617. production.
  1618. Open Media Vault (https://www.openmediavault.org) includes mergerfs is
  1619. it\[aq]s sole solution for pooling drives.
  1620. .SS Can mergerfs be used with drives which already have data / are in
  1621. use?
  1622. .PP
  1623. Yes.
  1624. MergerFS is a proxy and does \f[B]NOT\f[] interfere with the normal form
  1625. or function of the drives / mounts / paths it manages.
  1626. .PP
  1627. MergerFS is \f[B]not\f[] a traditional filesystem.
  1628. MergerFS is \f[B]not\f[] RAID.
  1629. It does \f[B]not\f[] manipulate the data that passes through it.
  1630. It does \f[B]not\f[] shard data across drives.
  1631. It merely shards some \f[B]behavior\f[] and aggregates others.
  1632. .SS Can mergerfs be removed without affecting the data?
  1633. .PP
  1634. See the previous question\[aq]s answer.
  1635. .SS Do hard links work?
  1636. .PP
  1637. Yes.
  1638. You need to use \f[C]use_ino\f[] to support proper reporting of inodes.
  1639. .PP
  1640. What mergerfs does not do is fake hard links across branches.
  1641. Read the section "rename & link" for how it.
  1642. .SS Does mergerfs support CoW / copy\-on\-write?
  1643. .PP
  1644. Not in the sense of a filesystem like BTRFS or ZFS nor in the overlayfs
  1645. or aufs sense.
  1646. It does offer a
  1647. cow\-shell (http://manpages.ubuntu.com/manpages/bionic/man1/cow-shell.1.html)
  1648. like hard link breaking (copy to temp file then rename over original)
  1649. which can be useful when wanting to save space by hardlinking duplicate
  1650. files but wish to treat each name as if it were a unique and separate
  1651. file.
  1652. .SS Why can\[aq]t I see my files / directories?
  1653. .PP
  1654. It\[aq]s almost always a permissions issue.
  1655. Unlike mhddfs, which runs as root and attempts to access content as
  1656. such, mergerfs always changes it\[aq]s credentials to that of the
  1657. caller.
  1658. This means that if the user does not have access to a file or directory
  1659. than neither will mergerfs.
  1660. However, because mergerfs is creating a union of paths it may be able to
  1661. read some files and directories on one drive but not another resulting
  1662. in an incomplete set.
  1663. .PP
  1664. Whenever you run into a split permission issue (seeing some but not all
  1665. files) try using
  1666. mergerfs.fsck (https://github.com/trapexit/mergerfs-tools) tool to check
  1667. for and fix the mismatch.
  1668. If you aren\[aq]t seeing anything at all be sure that the basic
  1669. permissions are correct.
  1670. The user and group values are correct and that directories have their
  1671. executable bit set.
  1672. A common mistake by users new to Linux is to \f[C]chmod\ \-R\ 644\f[]
  1673. when they should have \f[C]chmod\ \-R\ u=rwX,go=rX\f[].
  1674. .PP
  1675. If using a network filesystem such as NFS, SMB, CIFS (Samba) be sure to
  1676. pay close attention to anything regarding permissioning and users.
  1677. Root squashing and user translation for instance has bitten a few
  1678. mergerfs users.
  1679. Some of these also affect the use of mergerfs from container platforms
  1680. such as Docker.
  1681. .SS Why is only one drive being used?
  1682. .PP
  1683. Are you using a path preserving policy?
  1684. The default policy for file creation is \f[C]epmfs\f[].
  1685. That means only the drives with the path preexisting will be considered
  1686. when creating a file.
  1687. If you don\[aq]t care about where files and directories are created you
  1688. likely shouldn\[aq]t be using a path preserving policy and instead
  1689. something like \f[C]mfs\f[].
  1690. .PP
  1691. This can be especially apparent when filling an empty pool from an
  1692. external source.
  1693. If you do want path preservation you\[aq]ll need to perform the manual
  1694. act of creating paths on the drives you want the data to land on before
  1695. transfering your data.
  1696. Setting \f[C]func.mkdir=epall\f[] can simplify managing path
  1697. perservation for \f[C]create\f[].
  1698. .SS Why was libfuse embedded into mergerfs?
  1699. .IP "1." 3
  1700. A significant number of users use mergerfs on distros with old versions
  1701. of libfuse which have serious bugs.
  1702. Requiring updated versions of libfuse on those distros isn\[aq]t
  1703. pratical (no package offered, user inexperience, etc.).
  1704. The only practical way to provide a stable runtime on those systems was
  1705. to "vendor" / embed the library into the project.
  1706. .IP "2." 3
  1707. mergerfs was written to use the high level API.
  1708. There are a number of limitations in the HLAPI that make certain
  1709. features difficult or impossible to implement.
  1710. While some of these features could be patched into newer versions of
  1711. libfuse without breaking the public API some of them would require hacky
  1712. code to provide backwards compatibility.
  1713. While it may still be worth working with upstream to address these
  1714. issues in future versions, since the library needs to be vendored for
  1715. stability and compatibility reasons it is preferable / easier to modify
  1716. the API.
  1717. Longer term the plan is to rewrite mergerfs to use the low level API.
  1718. .SS Why did support for system libfuse get removed?
  1719. .PP
  1720. See above first.
  1721. .PP
  1722. If/when mergerfs is rewritten to use the low\-level API then it\[aq]ll
  1723. be plausible to support system libfuse but till then its simply too much
  1724. work to manage the differences across the versions.
  1725. .SS Why use mergerfs over mhddfs?
  1726. .PP
  1727. mhddfs is no longer maintained and has some known stability and security
  1728. issues (see below).
  1729. MergerFS provides a superset of mhddfs\[aq] features and should offer
  1730. the same or maybe better performance.
  1731. .PP
  1732. Below is an example of mhddfs and mergerfs setup to work similarly.
  1733. .PP
  1734. \f[C]mhddfs\ \-o\ mlimit=4G,allow_other\ /mnt/drive1,/mnt/drive2\ /mnt/pool\f[]
  1735. .PP
  1736. \f[C]mergerfs\ \-o\ minfreespace=4G,allow_other,category.create=ff\ /mnt/drive1:/mnt/drive2\ /mnt/pool\f[]
  1737. .SS Why use mergerfs over aufs?
  1738. .PP
  1739. aufs is mostly abandoned and no longer available in many distros.
  1740. .PP
  1741. While aufs can offer better peak performance mergerfs provides more
  1742. configurability and is generally easier to use.
  1743. mergerfs however does not offer the overlay / copy\-on\-write (CoW)
  1744. features which aufs and overlayfs have.
  1745. .SS Why use mergerfs over unionfs?
  1746. .PP
  1747. UnionFS is more like aufs then mergerfs in that it offers overlay / CoW
  1748. features.
  1749. If you\[aq]re just looking to create a union of drives and want
  1750. flexibility in file/directory placement then mergerfs offers that
  1751. whereas unionfs is more for overlaying RW filesystems over RO ones.
  1752. .SS Why use mergerfs over LVM/ZFS/BTRFS/RAID0 drive concatenation /
  1753. striping?
  1754. .PP
  1755. With simple JBOD / drive concatenation / stripping / RAID0 a single
  1756. drive failure will result in full pool failure.
  1757. mergerfs performs a similar behavior without the possibility of
  1758. catastrophic failure and the difficulties in recovery.
  1759. Drives may fail however all other data will continue to be accessable.
  1760. .PP
  1761. When combined with something like SnapRaid (http://www.snapraid.it)
  1762. and/or an offsite backup solution you can have the flexibilty of JBOD
  1763. without the single point of failure.
  1764. .SS Why use mergerfs over ZFS?
  1765. .PP
  1766. MergerFS is not intended to be a replacement for ZFS.
  1767. MergerFS is intended to provide flexible pooling of arbitrary drives
  1768. (local or remote), of arbitrary sizes, and arbitrary filesystems.
  1769. For \f[C]write\ once,\ read\ many\f[] usecases such as bulk media
  1770. storage.
  1771. Where data integrity and backup is managed in other ways.
  1772. In that situation ZFS can introduce major maintance and cost burdens as
  1773. described
  1774. here (http://louwrentius.com/the-hidden-cost-of-using-zfs-for-your-home-nas.html).
  1775. .SS Can drives be written to directly? Outside of mergerfs while pooled?
  1776. .PP
  1777. Yes, however its not recommended to use the same file from within the
  1778. pool and from without at the same time.
  1779. Especially if using caching of any kind (cache.entry, cache.attr,
  1780. ac_attr_timeout, cache.negative_entry, cache.symlinks, auto_cache,
  1781. kernel_cache).
  1782. .SS Why do I get an "out of space" / "no space left on device" / ENOSPC
  1783. error even though there appears to be lots of space available?
  1784. .PP
  1785. First make sure you\[aq]ve read the sections above about policies, path
  1786. preservation, branch filtering, and the options \f[B]minfreespace\f[],
  1787. \f[B]moveonenospc\f[], \f[B]statfs\f[], and \f[B]statfs_ignore\f[].
  1788. .PP
  1789. mergerfs is simply presenting a union of the content within multiple
  1790. branches.
  1791. The reported free space is an aggregate of space available within the
  1792. pool (behavior modified by \f[B]statfs\f[] and \f[B]statfs_ignore\f[]).
  1793. It does not represent a contiguous space.
  1794. In the same way that read\-only filesystems, those with quotas, or
  1795. reserved space report the full theoretical space available.
  1796. .PP
  1797. Due to path preservation, branch tagging, read\-only status, and
  1798. \f[B]minfreespace\f[] settings it is perfectly valid that
  1799. \f[C]ENOSPC\f[] / "out of space" / "no space left on device" be
  1800. returned.
  1801. It is doing what was asked of it: filtering possible branches due to
  1802. those settings.
  1803. Only one error can be returned and if one of the reasons for filtering a
  1804. branch was \f[B]minfreespace\f[] then it will be returned as such.
  1805. \f[B]moveonenospc\f[] is only relevant to writing a file which is too
  1806. large for the drive its currently on.
  1807. .PP
  1808. It is also possible that the filesystem selected has run out of inodes.
  1809. Use \f[C]df\ \-i\f[] to list the total and available inodes per
  1810. filesystem.
  1811. .PP
  1812. If you don\[aq]t care about path preservation then simply change the
  1813. \f[C]create\f[] policy to one which isn\[aq]t.
  1814. \f[C]mfs\f[] is probably what most are looking for.
  1815. The reason its not default is because it was originally set to
  1816. \f[C]epmfs\f[] and changing it now would change people\[aq]s setup.
  1817. Such a setting change will likely occur in mergerfs 3.
  1818. .SS Can mergerfs mounts be exported over NFS?
  1819. .PP
  1820. Yes.
  1821. Due to current usage of libfuse by mergerfs and how NFS interacts with
  1822. it it is necessary to add \f[C]noforget\f[] to mergerfs options to keep
  1823. from getting "stale file handle" errors.
  1824. .PP
  1825. Some clients (Kodi) have issues in which the contents of the NFS mount
  1826. will not be presented but users have found that enabling the
  1827. \f[C]use_ino\f[] option often fixes that problem.
  1828. .SS Can mergerfs mounts be exported over Samba / SMB?
  1829. .PP
  1830. Yes.
  1831. While some users have reported problems it appears to always be related
  1832. to how Samba is setup in relation to permissions.
  1833. .SS How are inodes calculated?
  1834. .PP
  1835. mergerfs\-inode = (original\-inode | (device\-id << 32))
  1836. .PP
  1837. While \f[C]ino_t\f[] is 64 bits only a few filesystems use more than 32.
  1838. Similarly, while \f[C]dev_t\f[] is also 64 bits it was traditionally 16
  1839. bits.
  1840. Bitwise or\[aq]ing them together should work most of the time.
  1841. While totally unique inodes are preferred the overhead which would be
  1842. needed does not seem to outweighted by the benefits.
  1843. .PP
  1844. While atypical, yes, inodes can be reused and not refer to the same
  1845. file.
  1846. The internal id used to reference a file in FUSE is different from the
  1847. inode value presented.
  1848. The former is the \f[C]nodeid\f[] and is actually a tuple of
  1849. (nodeid,generation).
  1850. That tuple is not user facing.
  1851. The inode is merely metadata passed through the kernel and found using
  1852. the \f[C]stat\f[] family of calls or \f[C]readdir\f[].
  1853. .PP
  1854. From FUSE docs regarding \f[C]use_ino\f[]:
  1855. .IP
  1856. .nf
  1857. \f[C]
  1858. Honor\ the\ st_ino\ field\ in\ the\ functions\ getattr()\ and
  1859. fill_dir().\ This\ value\ is\ used\ to\ fill\ in\ the\ st_ino\ field
  1860. in\ the\ stat(2),\ lstat(2),\ fstat(2)\ functions\ and\ the\ d_ino
  1861. field\ in\ the\ readdir(2)\ function.\ The\ filesystem\ does\ not
  1862. have\ to\ guarantee\ uniqueness,\ however\ some\ applications
  1863. rely\ on\ this\ value\ being\ unique\ for\ the\ whole\ filesystem.
  1864. Note\ that\ this\ does\ *not*\ affect\ the\ inode\ that\ libfuse
  1865. and\ the\ kernel\ use\ internally\ (also\ called\ the\ "nodeid").
  1866. \f[]
  1867. .fi
  1868. .SS I notice massive slowdowns of writes over NFS
  1869. .PP
  1870. Due to how NFS works and interacts with FUSE when not using
  1871. \f[C]direct_io\f[] its possible that a getxattr for
  1872. \f[C]security.capability\f[] will be issued prior to any write.
  1873. This will usually result in a massive slowdown for writes.
  1874. Using \f[C]direct_io\f[] will keep this from happening (and generally
  1875. good to enable unless you need the features it disables) but the
  1876. \f[C]security_capability\f[] option can also help by short circuiting
  1877. the call and returning \f[C]ENOATTR\f[].
  1878. .PP
  1879. You could also set \f[C]xattr\f[] to \f[C]noattr\f[] or \f[C]nosys\f[]
  1880. to short circuit or stop all xattr requests.
  1881. .SS What are these .fuse_hidden files?
  1882. .PP
  1883. NOTE: mergerfs >= 2.26.0 will not have these temporary files.
  1884. See the notes on \f[C]unlink\f[].
  1885. .PP
  1886. When not using \f[B]hard_remove\f[] libfuse will create
  1887. \&.fuse_hiddenXXXXXXXX files when an opened file is unlinked.
  1888. This is to simplify "use after unlink" usecases.
  1889. There is a possibility these files end up being picked up by software
  1890. scanning directories and not ignoring hidden files.
  1891. This is rarely a problem but a solution is in the works.
  1892. .PP
  1893. The files are cleaned up once the file is finally closed.
  1894. Only if mergerfs crashes or is killed would they be left around.
  1895. They are safe to remove as they are already unlinked files.
  1896. .SS It\[aq]s mentioned that there are some security issues with mhddfs.
  1897. What are they? How does mergerfs address them?
  1898. .PP
  1899. mhddfs (https://github.com/trapexit/mhddfs) manages running as
  1900. \f[B]root\f[] by calling
  1901. getuid() (https://github.com/trapexit/mhddfs/blob/cae96e6251dd91e2bdc24800b4a18a74044f6672/src/main.c#L319)
  1902. and if it returns \f[B]0\f[] then it will
  1903. chown (http://linux.die.net/man/1/chown) the file.
  1904. Not only is that a race condition but it doesn\[aq]t handle other
  1905. situations.
  1906. Rather than attempting to simulate POSIX ACL behavior the proper way to
  1907. manage this is to use seteuid (http://linux.die.net/man/2/seteuid) and
  1908. setegid (http://linux.die.net/man/2/setegid), in effect becoming the
  1909. user making the original call, and perform the action as them.
  1910. This is what mergerfs does and why mergerfs should always run as root.
  1911. .PP
  1912. In Linux setreuid syscalls apply only to the thread.
  1913. GLIBC hides this away by using realtime signals to inform all threads to
  1914. change credentials.
  1915. Taking after \f[B]Samba\f[], mergerfs uses
  1916. \f[B]syscall(SYS_setreuid,...)\f[] to set the callers credentials for
  1917. that thread only.
  1918. Jumping back to \f[B]root\f[] as necessary should escalated privileges
  1919. be needed (for instance: to clone paths between drives).
  1920. .PP
  1921. For non\-Linux systems mergerfs uses a read\-write lock and changes
  1922. credentials only when necessary.
  1923. If multiple threads are to be user X then only the first one will need
  1924. to change the processes credentials.
  1925. So long as the other threads need to be user X they will take a readlock
  1926. allowing multiple threads to share the credentials.
  1927. Once a request comes in to run as user Y that thread will attempt a
  1928. write lock and change to Y\[aq]s credentials when it can.
  1929. If the ability to give writers priority is supported then that flag will
  1930. be used so threads trying to change credentials don\[aq]t starve.
  1931. This isn\[aq]t the best solution but should work reasonably well
  1932. assuming there are few users.
  1933. .SH PERFORMANCE TWEAKING
  1934. .PP
  1935. NOTE: be sure to read about these features before changing them
  1936. .IP \[bu] 2
  1937. add (or remove) \f[C]direct_io\f[]
  1938. .IP \[bu] 2
  1939. add (or remove) \f[C]auto_cache\f[]
  1940. .IP \[bu] 2
  1941. add (or remove) \f[C]kernel_cache\f[]
  1942. .IP \[bu] 2
  1943. add (or remove) \f[C]splice_move\f[], \f[C]splice_read\f[], and
  1944. \f[C]splice_write\f[]
  1945. .IP \[bu] 2
  1946. increase cache timeouts \f[C]cache.attr\f[], \f[C]cache.entry\f[],
  1947. \f[C]cache.negative_entry\f[]
  1948. .IP \[bu] 2
  1949. enable \f[C]cache.open\f[] and/or \f[C]cache.statfs\f[]
  1950. .IP \[bu] 2
  1951. enable \f[C]cache.symlinks\f[]
  1952. .IP \[bu] 2
  1953. change the number opf worker threads
  1954. .IP \[bu] 2
  1955. disable \f[C]security_capability\f[] and/or \f[C]xattr\f[]
  1956. .IP \[bu] 2
  1957. disable \f[C]posix_acl\f[]
  1958. .IP \[bu] 2
  1959. test theoretical performance using \f[C]nullrw\f[] or mounting a ram
  1960. disk
  1961. .IP \[bu] 2
  1962. use \f[C]symlinkify\f[] if your data is largely static
  1963. .IP \[bu] 2
  1964. use tiered cache drives
  1965. .IP \[bu] 2
  1966. use lvm and lvm cache to place a SSD in front of your HDDs (howto
  1967. coming)
  1968. .SH SUPPORT
  1969. .PP
  1970. Filesystems are very complex and difficult to debug.
  1971. mergerfs, while being just a proxy of sorts, is also very difficult to
  1972. debug given the large number of possible settings it can have itself and
  1973. the massive number of environments it can run in.
  1974. When reporting on a suspected issue \f[B]please, please\f[] include as
  1975. much of the below information as possible otherwise it will be difficult
  1976. or impossible to diagnose.
  1977. Also please make sure to read all of the above documentation as it
  1978. includes nearly every known system or user issue previously encountered.
  1979. .SS Information to include in bug reports
  1980. .IP \[bu] 2
  1981. Version of mergerfs: \f[C]mergerfs\ \-V\f[]
  1982. .IP \[bu] 2
  1983. mergerfs settings: from \f[C]/etc/fstab\f[] or command line execution
  1984. .IP \[bu] 2
  1985. Version of Linux: \f[C]uname\ \-a\f[]
  1986. .IP \[bu] 2
  1987. Versions of any additional software being used
  1988. .IP \[bu] 2
  1989. List of drives, their filesystems, and sizes (before and after issue):
  1990. \f[C]df\ \-h\f[]
  1991. .IP \[bu] 2
  1992. A \f[C]strace\f[] of the app having problems:
  1993. .IP \[bu] 2
  1994. \f[C]strace\ \-f\ \-o\ /tmp/app.strace.txt\ <cmd>\f[]
  1995. .IP \[bu] 2
  1996. A \f[C]strace\f[] of mergerfs while the program is trying to do whatever
  1997. it\[aq]s failing to do:
  1998. .IP \[bu] 2
  1999. \f[C]strace\ \-f\ \-p\ <mergerfsPID>\ \-o\ /tmp/mergerfs.strace.txt\f[]
  2000. .IP \[bu] 2
  2001. \f[B]Precise\f[] directions on replicating the issue.
  2002. Do not leave \f[B]anything\f[] out.
  2003. .IP \[bu] 2
  2004. Try to recreate the problem in the simplist way using standard programs.
  2005. .SS Contact / Issue submission
  2006. .IP \[bu] 2
  2007. github.com: https://github.com/trapexit/mergerfs/issues
  2008. .IP \[bu] 2
  2009. email: trapexit\@spawn.link
  2010. .IP \[bu] 2
  2011. twitter: https://twitter.com/_trapexit
  2012. .IP \[bu] 2
  2013. reddit: https://www.reddit.com/user/trapexit
  2014. .IP \[bu] 2
  2015. discord: https://discord.gg/MpAr69V
  2016. .SS Support development
  2017. .PP
  2018. This software is free to use and released under a very liberal license.
  2019. That said if you like this software and would like to support its
  2020. development donations are welcome.
  2021. .IP \[bu] 2
  2022. PayPal: https://paypal.me/trapexit
  2023. .IP \[bu] 2
  2024. Patreon: https://www.patreon.com/trapexit
  2025. .IP \[bu] 2
  2026. SubscribeStar: https://www.subscribestar.com/trapexit
  2027. .IP \[bu] 2
  2028. Bitcoin (BTC): 12CdMhEPQVmjz3SSynkAEuD5q9JmhTDCZA
  2029. .IP \[bu] 2
  2030. Bitcoin Cash (BCH): 1AjPqZZhu7GVEs6JFPjHmtsvmDL4euzMzp
  2031. .IP \[bu] 2
  2032. Ethereum (ETH): 0x09A166B11fCC127324C7fc5f1B572255b3046E94
  2033. .IP \[bu] 2
  2034. Litecoin (LTC): LXAsq6yc6zYU3EbcqyWtHBrH1Ypx4GjUjm
  2035. .SH LINKS
  2036. .IP \[bu] 2
  2037. https://spawn.link
  2038. .IP \[bu] 2
  2039. https://github.com/trapexit/mergerfs
  2040. .IP \[bu] 2
  2041. https://github.com/trapexit/mergerfs\-tools
  2042. .IP \[bu] 2
  2043. https://github.com/trapexit/scorch
  2044. .IP \[bu] 2
  2045. https://github.com/trapexit/bbf
  2046. .IP \[bu] 2
  2047. https://github.com/trapexit/backup\-and\-recovery\-howtos
  2048. .SH AUTHORS
  2049. Antonio SJ Musumeci <trapexit@spawn.link>.