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.

1959 lines
74 KiB

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