Exporting 7.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160
  1. Making Filesystems Exportable
  2. =============================
  3. Overview
  4. --------
  5. All filesystem operations require a dentry (or two) as a starting
  6. point. Local applications have a reference-counted hold on suitable
  7. dentries via open file descriptors or cwd/root. However remote
  8. applications that access a filesystem via a remote filesystem protocol
  9. such as NFS may not be able to hold such a reference, and so need a
  10. different way to refer to a particular dentry. As the alternative
  11. form of reference needs to be stable across renames, truncates, and
  12. server-reboot (among other things, though these tend to be the most
  13. problematic), there is no simple answer like 'filename'.
  14. The mechanism discussed here allows each filesystem implementation to
  15. specify how to generate an opaque (outside of the filesystem) byte
  16. string for any dentry, and how to find an appropriate dentry for any
  17. given opaque byte string.
  18. This byte string will be called a "filehandle fragment" as it
  19. corresponds to part of an NFS filehandle.
  20. A filesystem which supports the mapping between filehandle fragments
  21. and dentries will be termed "exportable".
  22. Dcache Issues
  23. -------------
  24. The dcache normally contains a proper prefix of any given filesystem
  25. tree. This means that if any filesystem object is in the dcache, then
  26. all of the ancestors of that filesystem object are also in the dcache.
  27. As normal access is by filename this prefix is created naturally and
  28. maintained easily (by each object maintaining a reference count on
  29. its parent).
  30. However when objects are included into the dcache by interpreting a
  31. filehandle fragment, there is no automatic creation of a path prefix
  32. for the object. This leads to two related but distinct features of
  33. the dcache that are not needed for normal filesystem access.
  34. 1/ The dcache must sometimes contain objects that are not part of the
  35. proper prefix. i.e that are not connected to the root.
  36. 2/ The dcache must be prepared for a newly found (via ->lookup) directory
  37. to already have a (non-connected) dentry, and must be able to move
  38. that dentry into place (based on the parent and name in the
  39. ->lookup). This is particularly needed for directories as
  40. it is a dcache invariant that directories only have one dentry.
  41. To implement these features, the dcache has:
  42. a/ A dentry flag DCACHE_DISCONNECTED which is set on
  43. any dentry that might not be part of the proper prefix.
  44. This is set when anonymous dentries are created, and cleared when a
  45. dentry is noticed to be a child of a dentry which is in the proper
  46. prefix. If the refcount on a dentry with this flag set
  47. becomes zero, the dentry is immediately discarded, rather than being
  48. kept in the dcache. If a dentry that is not already in the dcache
  49. is repeatedly accessed by filehandle (as NFSD might do), an new dentry
  50. will be a allocated for each access, and discarded at the end of
  51. the access.
  52. Note that such a dentry can acquire children, name, ancestors, etc.
  53. without losing DCACHE_DISCONNECTED - that flag is only cleared when
  54. subtree is successfully reconnected to root. Until then dentries
  55. in such subtree are retained only as long as there are references;
  56. refcount reaching zero means immediate eviction, same as for unhashed
  57. dentries. That guarantees that we won't need to hunt them down upon
  58. umount.
  59. b/ A primitive for creation of secondary roots - d_obtain_root(inode).
  60. Those do _not_ bear DCACHE_DISCONNECTED. They are placed on the
  61. per-superblock list (->s_roots), so they can be located at umount
  62. time for eviction purposes.
  63. c/ Helper routines to allocate anonymous dentries, and to help attach
  64. loose directory dentries at lookup time. They are:
  65. d_obtain_alias(inode) will return a dentry for the given inode.
  66. If the inode already has a dentry, one of those is returned.
  67. If it doesn't, a new anonymous (IS_ROOT and
  68. DCACHE_DISCONNECTED) dentry is allocated and attached.
  69. In the case of a directory, care is taken that only one dentry
  70. can ever be attached.
  71. d_splice_alias(inode, dentry) will introduce a new dentry into the tree;
  72. either the passed-in dentry or a preexisting alias for the given inode
  73. (such as an anonymous one created by d_obtain_alias), if appropriate.
  74. It returns NULL when the passed-in dentry is used, following the calling
  75. convention of ->lookup.
  76. Filesystem Issues
  77. -----------------
  78. For a filesystem to be exportable it must:
  79. 1/ provide the filehandle fragment routines described below.
  80. 2/ make sure that d_splice_alias is used rather than d_add
  81. when ->lookup finds an inode for a given parent and name.
  82. If inode is NULL, d_splice_alias(inode, dentry) is equivalent to
  83. d_add(dentry, inode), NULL
  84. Similarly, d_splice_alias(ERR_PTR(err), dentry) = ERR_PTR(err)
  85. Typically the ->lookup routine will simply end with a:
  86. return d_splice_alias(inode, dentry);
  87. }
  88. A file system implementation declares that instances of the filesystem
  89. are exportable by setting the s_export_op field in the struct
  90. super_block. This field must point to a "struct export_operations"
  91. struct which has the following members:
  92. encode_fh (optional)
  93. Takes a dentry and creates a filehandle fragment which can later be used
  94. to find or create a dentry for the same object. The default
  95. implementation creates a filehandle fragment that encodes a 32bit inode
  96. and generation number for the inode encoded, and if necessary the
  97. same information for the parent.
  98. fh_to_dentry (mandatory)
  99. Given a filehandle fragment, this should find the implied object and
  100. create a dentry for it (possibly with d_obtain_alias).
  101. fh_to_parent (optional but strongly recommended)
  102. Given a filehandle fragment, this should find the parent of the
  103. implied object and create a dentry for it (possibly with
  104. d_obtain_alias). May fail if the filehandle fragment is too small.
  105. get_parent (optional but strongly recommended)
  106. When given a dentry for a directory, this should return a dentry for
  107. the parent. Quite possibly the parent dentry will have been allocated
  108. by d_alloc_anon. The default get_parent function just returns an error
  109. so any filehandle lookup that requires finding a parent will fail.
  110. ->lookup("..") is *not* used as a default as it can leave ".." entries
  111. in the dcache which are too messy to work with.
  112. get_name (optional)
  113. When given a parent dentry and a child dentry, this should find a name
  114. in the directory identified by the parent dentry, which leads to the
  115. object identified by the child dentry. If no get_name function is
  116. supplied, a default implementation is provided which uses vfs_readdir
  117. to find potential names, and matches inode numbers to find the correct
  118. match.
  119. A filehandle fragment consists of an array of 1 or more 4byte words,
  120. together with a one byte "type".
  121. The decode_fh routine should not depend on the stated size that is
  122. passed to it. This size may be larger than the original filehandle
  123. generated by encode_fh, in which case it will have been padded with
  124. nuls. Rather, the encode_fh routine should choose a "type" which
  125. indicates the decode_fh how much of the filehandle is valid, and how
  126. it should be interpreted.