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.

2688 lines
100 KiB

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