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.

1980 lines
75 KiB

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