vfs.txt 47 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121
  1. Overview of the Linux Virtual File System
  2. Original author: Richard Gooch <rgooch@atnf.csiro.au>
  3. Last updated on June 24, 2007.
  4. Copyright (C) 1999 Richard Gooch
  5. Copyright (C) 2005 Pekka Enberg
  6. This file is released under the GPLv2.
  7. Introduction
  8. ============
  9. The Virtual File System (also known as the Virtual Filesystem Switch)
  10. is the software layer in the kernel that provides the filesystem
  11. interface to userspace programs. It also provides an abstraction
  12. within the kernel which allows different filesystem implementations to
  13. coexist.
  14. VFS system calls open(2), stat(2), read(2), write(2), chmod(2) and so
  15. on are called from a process context. Filesystem locking is described
  16. in the document Documentation/filesystems/Locking.
  17. Directory Entry Cache (dcache)
  18. ------------------------------
  19. The VFS implements the open(2), stat(2), chmod(2), and similar system
  20. calls. The pathname argument that is passed to them is used by the VFS
  21. to search through the directory entry cache (also known as the dentry
  22. cache or dcache). This provides a very fast look-up mechanism to
  23. translate a pathname (filename) into a specific dentry. Dentries live
  24. in RAM and are never saved to disc: they exist only for performance.
  25. The dentry cache is meant to be a view into your entire filespace. As
  26. most computers cannot fit all dentries in the RAM at the same time,
  27. some bits of the cache are missing. In order to resolve your pathname
  28. into a dentry, the VFS may have to resort to creating dentries along
  29. the way, and then loading the inode. This is done by looking up the
  30. inode.
  31. The Inode Object
  32. ----------------
  33. An individual dentry usually has a pointer to an inode. Inodes are
  34. filesystem objects such as regular files, directories, FIFOs and other
  35. beasts. They live either on the disc (for block device filesystems)
  36. or in the memory (for pseudo filesystems). Inodes that live on the
  37. disc are copied into the memory when required and changes to the inode
  38. are written back to disc. A single inode can be pointed to by multiple
  39. dentries (hard links, for example, do this).
  40. To look up an inode requires that the VFS calls the lookup() method of
  41. the parent directory inode. This method is installed by the specific
  42. filesystem implementation that the inode lives in. Once the VFS has
  43. the required dentry (and hence the inode), we can do all those boring
  44. things like open(2) the file, or stat(2) it to peek at the inode
  45. data. The stat(2) operation is fairly simple: once the VFS has the
  46. dentry, it peeks at the inode data and passes some of it back to
  47. userspace.
  48. The File Object
  49. ---------------
  50. Opening a file requires another operation: allocation of a file
  51. structure (this is the kernel-side implementation of file
  52. descriptors). The freshly allocated file structure is initialized with
  53. a pointer to the dentry and a set of file operation member functions.
  54. These are taken from the inode data. The open() file method is then
  55. called so the specific filesystem implementation can do its work. You
  56. can see that this is another switch performed by the VFS. The file
  57. structure is placed into the file descriptor table for the process.
  58. Reading, writing and closing files (and other assorted VFS operations)
  59. is done by using the userspace file descriptor to grab the appropriate
  60. file structure, and then calling the required file structure method to
  61. do whatever is required. For as long as the file is open, it keeps the
  62. dentry in use, which in turn means that the VFS inode is still in use.
  63. Registering and Mounting a Filesystem
  64. =====================================
  65. To register and unregister a filesystem, use the following API
  66. functions:
  67. #include <linux/fs.h>
  68. extern int register_filesystem(struct file_system_type *);
  69. extern int unregister_filesystem(struct file_system_type *);
  70. The passed struct file_system_type describes your filesystem. When a
  71. request is made to mount a filesystem onto a directory in your namespace,
  72. the VFS will call the appropriate mount() method for the specific
  73. filesystem. New vfsmount referring to the tree returned by ->mount()
  74. will be attached to the mountpoint, so that when pathname resolution
  75. reaches the mountpoint it will jump into the root of that vfsmount.
  76. You can see all filesystems that are registered to the kernel in the
  77. file /proc/filesystems.
  78. struct file_system_type
  79. -----------------------
  80. This describes the filesystem. As of kernel 2.6.39, the following
  81. members are defined:
  82. struct file_system_type {
  83. const char *name;
  84. int fs_flags;
  85. struct dentry *(*mount) (struct file_system_type *, int,
  86. const char *, void *);
  87. void (*kill_sb) (struct super_block *);
  88. struct module *owner;
  89. struct file_system_type * next;
  90. struct list_head fs_supers;
  91. struct lock_class_key s_lock_key;
  92. struct lock_class_key s_umount_key;
  93. };
  94. name: the name of the filesystem type, such as "ext2", "iso9660",
  95. "msdos" and so on
  96. fs_flags: various flags (i.e. FS_REQUIRES_DEV, FS_NO_DCACHE, etc.)
  97. mount: the method to call when a new instance of this
  98. filesystem should be mounted
  99. kill_sb: the method to call when an instance of this filesystem
  100. should be shut down
  101. owner: for internal VFS use: you should initialize this to THIS_MODULE in
  102. most cases.
  103. next: for internal VFS use: you should initialize this to NULL
  104. s_lock_key, s_umount_key: lockdep-specific
  105. The mount() method has the following arguments:
  106. struct file_system_type *fs_type: describes the filesystem, partly initialized
  107. by the specific filesystem code
  108. int flags: mount flags
  109. const char *dev_name: the device name we are mounting.
  110. void *data: arbitrary mount options, usually comes as an ASCII
  111. string (see "Mount Options" section)
  112. The mount() method must return the root dentry of the tree requested by
  113. caller. An active reference to its superblock must be grabbed and the
  114. superblock must be locked. On failure it should return ERR_PTR(error).
  115. The arguments match those of mount(2) and their interpretation
  116. depends on filesystem type. E.g. for block filesystems, dev_name is
  117. interpreted as block device name, that device is opened and if it
  118. contains a suitable filesystem image the method creates and initializes
  119. struct super_block accordingly, returning its root dentry to caller.
  120. ->mount() may choose to return a subtree of existing filesystem - it
  121. doesn't have to create a new one. The main result from the caller's
  122. point of view is a reference to dentry at the root of (sub)tree to
  123. be attached; creation of new superblock is a common side effect.
  124. The most interesting member of the superblock structure that the
  125. mount() method fills in is the "s_op" field. This is a pointer to
  126. a "struct super_operations" which describes the next level of the
  127. filesystem implementation.
  128. Usually, a filesystem uses one of the generic mount() implementations
  129. and provides a fill_super() callback instead. The generic variants are:
  130. mount_bdev: mount a filesystem residing on a block device
  131. mount_nodev: mount a filesystem that is not backed by a device
  132. mount_single: mount a filesystem which shares the instance between
  133. all mounts
  134. A fill_super() callback implementation has the following arguments:
  135. struct super_block *sb: the superblock structure. The callback
  136. must initialize this properly.
  137. void *data: arbitrary mount options, usually comes as an ASCII
  138. string (see "Mount Options" section)
  139. int silent: whether or not to be silent on error
  140. The Superblock Object
  141. =====================
  142. A superblock object represents a mounted filesystem.
  143. struct super_operations
  144. -----------------------
  145. This describes how the VFS can manipulate the superblock of your
  146. filesystem. As of kernel 2.6.22, the following members are defined:
  147. struct super_operations {
  148. struct inode *(*alloc_inode)(struct super_block *sb);
  149. void (*destroy_inode)(struct inode *);
  150. void (*dirty_inode) (struct inode *, int flags);
  151. int (*write_inode) (struct inode *, int);
  152. void (*drop_inode) (struct inode *);
  153. void (*delete_inode) (struct inode *);
  154. void (*put_super) (struct super_block *);
  155. void (*write_super) (struct super_block *);
  156. int (*sync_fs)(struct super_block *sb, int wait);
  157. int (*freeze_fs) (struct super_block *);
  158. int (*unfreeze_fs) (struct super_block *);
  159. int (*statfs) (struct dentry *, struct kstatfs *);
  160. int (*remount_fs) (struct super_block *, int *, char *);
  161. void (*clear_inode) (struct inode *);
  162. void (*umount_begin) (struct super_block *);
  163. int (*show_options)(struct seq_file *, struct dentry *);
  164. ssize_t (*quota_read)(struct super_block *, int, char *, size_t, loff_t);
  165. ssize_t (*quota_write)(struct super_block *, int, const char *, size_t, loff_t);
  166. int (*nr_cached_objects)(struct super_block *);
  167. void (*free_cached_objects)(struct super_block *, int);
  168. };
  169. All methods are called without any locks being held, unless otherwise
  170. noted. This means that most methods can block safely. All methods are
  171. only called from a process context (i.e. not from an interrupt handler
  172. or bottom half).
  173. alloc_inode: this method is called by inode_alloc() to allocate memory
  174. for struct inode and initialize it. If this function is not
  175. defined, a simple 'struct inode' is allocated. Normally
  176. alloc_inode will be used to allocate a larger structure which
  177. contains a 'struct inode' embedded within it.
  178. destroy_inode: this method is called by destroy_inode() to release
  179. resources allocated for struct inode. It is only required if
  180. ->alloc_inode was defined and simply undoes anything done by
  181. ->alloc_inode.
  182. dirty_inode: this method is called by the VFS to mark an inode dirty.
  183. write_inode: this method is called when the VFS needs to write an
  184. inode to disc. The second parameter indicates whether the write
  185. should be synchronous or not, not all filesystems check this flag.
  186. drop_inode: called when the last access to the inode is dropped,
  187. with the inode->i_lock spinlock held.
  188. This method should be either NULL (normal UNIX filesystem
  189. semantics) or "generic_delete_inode" (for filesystems that do not
  190. want to cache inodes - causing "delete_inode" to always be
  191. called regardless of the value of i_nlink)
  192. The "generic_delete_inode()" behavior is equivalent to the
  193. old practice of using "force_delete" in the put_inode() case,
  194. but does not have the races that the "force_delete()" approach
  195. had.
  196. delete_inode: called when the VFS wants to delete an inode
  197. put_super: called when the VFS wishes to free the superblock
  198. (i.e. unmount). This is called with the superblock lock held
  199. write_super: called when the VFS superblock needs to be written to
  200. disc. This method is optional
  201. sync_fs: called when VFS is writing out all dirty data associated with
  202. a superblock. The second parameter indicates whether the method
  203. should wait until the write out has been completed. Optional.
  204. freeze_fs: called when VFS is locking a filesystem and
  205. forcing it into a consistent state. This method is currently
  206. used by the Logical Volume Manager (LVM).
  207. unfreeze_fs: called when VFS is unlocking a filesystem and making it writable
  208. again.
  209. statfs: called when the VFS needs to get filesystem statistics.
  210. remount_fs: called when the filesystem is remounted. This is called
  211. with the kernel lock held
  212. clear_inode: called then the VFS clears the inode. Optional
  213. umount_begin: called when the VFS is unmounting a filesystem.
  214. show_options: called by the VFS to show mount options for
  215. /proc/<pid>/mounts. (see "Mount Options" section)
  216. quota_read: called by the VFS to read from filesystem quota file.
  217. quota_write: called by the VFS to write to filesystem quota file.
  218. nr_cached_objects: called by the sb cache shrinking function for the
  219. filesystem to return the number of freeable cached objects it contains.
  220. Optional.
  221. free_cache_objects: called by the sb cache shrinking function for the
  222. filesystem to scan the number of objects indicated to try to free them.
  223. Optional, but any filesystem implementing this method needs to also
  224. implement ->nr_cached_objects for it to be called correctly.
  225. We can't do anything with any errors that the filesystem might
  226. encountered, hence the void return type. This will never be called if
  227. the VM is trying to reclaim under GFP_NOFS conditions, hence this
  228. method does not need to handle that situation itself.
  229. Implementations must include conditional reschedule calls inside any
  230. scanning loop that is done. This allows the VFS to determine
  231. appropriate scan batch sizes without having to worry about whether
  232. implementations will cause holdoff problems due to large scan batch
  233. sizes.
  234. Whoever sets up the inode is responsible for filling in the "i_op" field. This
  235. is a pointer to a "struct inode_operations" which describes the methods that
  236. can be performed on individual inodes.
  237. The Inode Object
  238. ================
  239. An inode object represents an object within the filesystem.
  240. struct inode_operations
  241. -----------------------
  242. This describes how the VFS can manipulate an inode in your
  243. filesystem. As of kernel 2.6.22, the following members are defined:
  244. struct inode_operations {
  245. int (*create) (struct inode *,struct dentry *, umode_t, struct nameidata *);
  246. struct dentry * (*lookup) (struct inode *,struct dentry *, struct nameidata *);
  247. int (*link) (struct dentry *,struct inode *,struct dentry *);
  248. int (*unlink) (struct inode *,struct dentry *);
  249. int (*symlink) (struct inode *,struct dentry *,const char *);
  250. int (*mkdir) (struct inode *,struct dentry *,umode_t);
  251. int (*rmdir) (struct inode *,struct dentry *);
  252. int (*mknod) (struct inode *,struct dentry *,umode_t,dev_t);
  253. int (*rename) (struct inode *, struct dentry *,
  254. struct inode *, struct dentry *);
  255. int (*readlink) (struct dentry *, char __user *,int);
  256. void * (*follow_link) (struct dentry *, struct nameidata *);
  257. void (*put_link) (struct dentry *, struct nameidata *, void *);
  258. void (*truncate) (struct inode *);
  259. int (*permission) (struct inode *, int);
  260. int (*get_acl)(struct inode *, int);
  261. int (*setattr) (struct dentry *, struct iattr *);
  262. int (*getattr) (struct vfsmount *mnt, struct dentry *, struct kstat *);
  263. int (*setxattr) (struct dentry *, const char *,const void *,size_t,int);
  264. ssize_t (*getxattr) (struct dentry *, const char *, void *, size_t);
  265. ssize_t (*listxattr) (struct dentry *, char *, size_t);
  266. int (*removexattr) (struct dentry *, const char *);
  267. void (*truncate_range)(struct inode *, loff_t, loff_t);
  268. void (*update_time)(struct inode *, struct timespec *, int);
  269. };
  270. Again, all methods are called without any locks being held, unless
  271. otherwise noted.
  272. create: called by the open(2) and creat(2) system calls. Only
  273. required if you want to support regular files. The dentry you
  274. get should not have an inode (i.e. it should be a negative
  275. dentry). Here you will probably call d_instantiate() with the
  276. dentry and the newly created inode
  277. lookup: called when the VFS needs to look up an inode in a parent
  278. directory. The name to look for is found in the dentry. This
  279. method must call d_add() to insert the found inode into the
  280. dentry. The "i_count" field in the inode structure should be
  281. incremented. If the named inode does not exist a NULL inode
  282. should be inserted into the dentry (this is called a negative
  283. dentry). Returning an error code from this routine must only
  284. be done on a real error, otherwise creating inodes with system
  285. calls like create(2), mknod(2), mkdir(2) and so on will fail.
  286. If you wish to overload the dentry methods then you should
  287. initialise the "d_dop" field in the dentry; this is a pointer
  288. to a struct "dentry_operations".
  289. This method is called with the directory inode semaphore held
  290. link: called by the link(2) system call. Only required if you want
  291. to support hard links. You will probably need to call
  292. d_instantiate() just as you would in the create() method
  293. unlink: called by the unlink(2) system call. Only required if you
  294. want to support deleting inodes
  295. symlink: called by the symlink(2) system call. Only required if you
  296. want to support symlinks. You will probably need to call
  297. d_instantiate() just as you would in the create() method
  298. mkdir: called by the mkdir(2) system call. Only required if you want
  299. to support creating subdirectories. You will probably need to
  300. call d_instantiate() just as you would in the create() method
  301. rmdir: called by the rmdir(2) system call. Only required if you want
  302. to support deleting subdirectories
  303. mknod: called by the mknod(2) system call to create a device (char,
  304. block) inode or a named pipe (FIFO) or socket. Only required
  305. if you want to support creating these types of inodes. You
  306. will probably need to call d_instantiate() just as you would
  307. in the create() method
  308. rename: called by the rename(2) system call to rename the object to
  309. have the parent and name given by the second inode and dentry.
  310. readlink: called by the readlink(2) system call. Only required if
  311. you want to support reading symbolic links
  312. follow_link: called by the VFS to follow a symbolic link to the
  313. inode it points to. Only required if you want to support
  314. symbolic links. This method returns a void pointer cookie
  315. that is passed to put_link().
  316. put_link: called by the VFS to release resources allocated by
  317. follow_link(). The cookie returned by follow_link() is passed
  318. to this method as the last parameter. It is used by
  319. filesystems such as NFS where page cache is not stable
  320. (i.e. page that was installed when the symbolic link walk
  321. started might not be in the page cache at the end of the
  322. walk).
  323. truncate: Deprecated. This will not be called if ->setsize is defined.
  324. Called by the VFS to change the size of a file. The
  325. i_size field of the inode is set to the desired size by the
  326. VFS before this method is called. This method is called by
  327. the truncate(2) system call and related functionality.
  328. Note: ->truncate and vmtruncate are deprecated. Do not add new
  329. instances/calls of these. Filesystems should be converted to do their
  330. truncate sequence via ->setattr().
  331. permission: called by the VFS to check for access rights on a POSIX-like
  332. filesystem.
  333. May be called in rcu-walk mode (mask & MAY_NOT_BLOCK). If in rcu-walk
  334. mode, the filesystem must check the permission without blocking or
  335. storing to the inode.
  336. If a situation is encountered that rcu-walk cannot handle, return
  337. -ECHILD and it will be called again in ref-walk mode.
  338. setattr: called by the VFS to set attributes for a file. This method
  339. is called by chmod(2) and related system calls.
  340. getattr: called by the VFS to get attributes of a file. This method
  341. is called by stat(2) and related system calls.
  342. setxattr: called by the VFS to set an extended attribute for a file.
  343. Extended attribute is a name:value pair associated with an
  344. inode. This method is called by setxattr(2) system call.
  345. getxattr: called by the VFS to retrieve the value of an extended
  346. attribute name. This method is called by getxattr(2) function
  347. call.
  348. listxattr: called by the VFS to list all extended attributes for a
  349. given file. This method is called by listxattr(2) system call.
  350. removexattr: called by the VFS to remove an extended attribute from
  351. a file. This method is called by removexattr(2) system call.
  352. truncate_range: a method provided by the underlying filesystem to truncate a
  353. range of blocks , i.e. punch a hole somewhere in a file.
  354. update_time: called by the VFS to update a specific time or the i_version of
  355. an inode. If this is not defined the VFS will update the inode itself
  356. and call mark_inode_dirty_sync.
  357. The Address Space Object
  358. ========================
  359. The address space object is used to group and manage pages in the page
  360. cache. It can be used to keep track of the pages in a file (or
  361. anything else) and also track the mapping of sections of the file into
  362. process address spaces.
  363. There are a number of distinct yet related services that an
  364. address-space can provide. These include communicating memory
  365. pressure, page lookup by address, and keeping track of pages tagged as
  366. Dirty or Writeback.
  367. The first can be used independently to the others. The VM can try to
  368. either write dirty pages in order to clean them, or release clean
  369. pages in order to reuse them. To do this it can call the ->writepage
  370. method on dirty pages, and ->releasepage on clean pages with
  371. PagePrivate set. Clean pages without PagePrivate and with no external
  372. references will be released without notice being given to the
  373. address_space.
  374. To achieve this functionality, pages need to be placed on an LRU with
  375. lru_cache_add and mark_page_active needs to be called whenever the
  376. page is used.
  377. Pages are normally kept in a radix tree index by ->index. This tree
  378. maintains information about the PG_Dirty and PG_Writeback status of
  379. each page, so that pages with either of these flags can be found
  380. quickly.
  381. The Dirty tag is primarily used by mpage_writepages - the default
  382. ->writepages method. It uses the tag to find dirty pages to call
  383. ->writepage on. If mpage_writepages is not used (i.e. the address
  384. provides its own ->writepages) , the PAGECACHE_TAG_DIRTY tag is
  385. almost unused. write_inode_now and sync_inode do use it (through
  386. __sync_single_inode) to check if ->writepages has been successful in
  387. writing out the whole address_space.
  388. The Writeback tag is used by filemap*wait* and sync_page* functions,
  389. via filemap_fdatawait_range, to wait for all writeback to
  390. complete. While waiting ->sync_page (if defined) will be called on
  391. each page that is found to require writeback.
  392. An address_space handler may attach extra information to a page,
  393. typically using the 'private' field in the 'struct page'. If such
  394. information is attached, the PG_Private flag should be set. This will
  395. cause various VM routines to make extra calls into the address_space
  396. handler to deal with that data.
  397. An address space acts as an intermediate between storage and
  398. application. Data is read into the address space a whole page at a
  399. time, and provided to the application either by copying of the page,
  400. or by memory-mapping the page.
  401. Data is written into the address space by the application, and then
  402. written-back to storage typically in whole pages, however the
  403. address_space has finer control of write sizes.
  404. The read process essentially only requires 'readpage'. The write
  405. process is more complicated and uses write_begin/write_end or
  406. set_page_dirty to write data into the address_space, and writepage,
  407. sync_page, and writepages to writeback data to storage.
  408. Adding and removing pages to/from an address_space is protected by the
  409. inode's i_mutex.
  410. When data is written to a page, the PG_Dirty flag should be set. It
  411. typically remains set until writepage asks for it to be written. This
  412. should clear PG_Dirty and set PG_Writeback. It can be actually
  413. written at any point after PG_Dirty is clear. Once it is known to be
  414. safe, PG_Writeback is cleared.
  415. Writeback makes use of a writeback_control structure...
  416. struct address_space_operations
  417. -------------------------------
  418. This describes how the VFS can manipulate mapping of a file to page cache in
  419. your filesystem. As of kernel 2.6.22, the following members are defined:
  420. struct address_space_operations {
  421. int (*writepage)(struct page *page, struct writeback_control *wbc);
  422. int (*readpage)(struct file *, struct page *);
  423. int (*sync_page)(struct page *);
  424. int (*writepages)(struct address_space *, struct writeback_control *);
  425. int (*set_page_dirty)(struct page *page);
  426. int (*readpages)(struct file *filp, struct address_space *mapping,
  427. struct list_head *pages, unsigned nr_pages);
  428. int (*write_begin)(struct file *, struct address_space *mapping,
  429. loff_t pos, unsigned len, unsigned flags,
  430. struct page **pagep, void **fsdata);
  431. int (*write_end)(struct file *, struct address_space *mapping,
  432. loff_t pos, unsigned len, unsigned copied,
  433. struct page *page, void *fsdata);
  434. sector_t (*bmap)(struct address_space *, sector_t);
  435. int (*invalidatepage) (struct page *, unsigned long);
  436. int (*releasepage) (struct page *, int);
  437. void (*freepage)(struct page *);
  438. ssize_t (*direct_IO)(int, struct kiocb *, const struct iovec *iov,
  439. loff_t offset, unsigned long nr_segs);
  440. struct page* (*get_xip_page)(struct address_space *, sector_t,
  441. int);
  442. /* migrate the contents of a page to the specified target */
  443. int (*migratepage) (struct page *, struct page *);
  444. int (*launder_page) (struct page *);
  445. int (*error_remove_page) (struct mapping *mapping, struct page *page);
  446. };
  447. writepage: called by the VM to write a dirty page to backing store.
  448. This may happen for data integrity reasons (i.e. 'sync'), or
  449. to free up memory (flush). The difference can be seen in
  450. wbc->sync_mode.
  451. The PG_Dirty flag has been cleared and PageLocked is true.
  452. writepage should start writeout, should set PG_Writeback,
  453. and should make sure the page is unlocked, either synchronously
  454. or asynchronously when the write operation completes.
  455. If wbc->sync_mode is WB_SYNC_NONE, ->writepage doesn't have to
  456. try too hard if there are problems, and may choose to write out
  457. other pages from the mapping if that is easier (e.g. due to
  458. internal dependencies). If it chooses not to start writeout, it
  459. should return AOP_WRITEPAGE_ACTIVATE so that the VM will not keep
  460. calling ->writepage on that page.
  461. See the file "Locking" for more details.
  462. readpage: called by the VM to read a page from backing store.
  463. The page will be Locked when readpage is called, and should be
  464. unlocked and marked uptodate once the read completes.
  465. If ->readpage discovers that it needs to unlock the page for
  466. some reason, it can do so, and then return AOP_TRUNCATED_PAGE.
  467. In this case, the page will be relocated, relocked and if
  468. that all succeeds, ->readpage will be called again.
  469. sync_page: called by the VM to notify the backing store to perform all
  470. queued I/O operations for a page. I/O operations for other pages
  471. associated with this address_space object may also be performed.
  472. This function is optional and is called only for pages with
  473. PG_Writeback set while waiting for the writeback to complete.
  474. writepages: called by the VM to write out pages associated with the
  475. address_space object. If wbc->sync_mode is WBC_SYNC_ALL, then
  476. the writeback_control will specify a range of pages that must be
  477. written out. If it is WBC_SYNC_NONE, then a nr_to_write is given
  478. and that many pages should be written if possible.
  479. If no ->writepages is given, then mpage_writepages is used
  480. instead. This will choose pages from the address space that are
  481. tagged as DIRTY and will pass them to ->writepage.
  482. set_page_dirty: called by the VM to set a page dirty.
  483. This is particularly needed if an address space attaches
  484. private data to a page, and that data needs to be updated when
  485. a page is dirtied. This is called, for example, when a memory
  486. mapped page gets modified.
  487. If defined, it should set the PageDirty flag, and the
  488. PAGECACHE_TAG_DIRTY tag in the radix tree.
  489. readpages: called by the VM to read pages associated with the address_space
  490. object. This is essentially just a vector version of
  491. readpage. Instead of just one page, several pages are
  492. requested.
  493. readpages is only used for read-ahead, so read errors are
  494. ignored. If anything goes wrong, feel free to give up.
  495. write_begin:
  496. Called by the generic buffered write code to ask the filesystem to
  497. prepare to write len bytes at the given offset in the file. The
  498. address_space should check that the write will be able to complete,
  499. by allocating space if necessary and doing any other internal
  500. housekeeping. If the write will update parts of any basic-blocks on
  501. storage, then those blocks should be pre-read (if they haven't been
  502. read already) so that the updated blocks can be written out properly.
  503. The filesystem must return the locked pagecache page for the specified
  504. offset, in *pagep, for the caller to write into.
  505. It must be able to cope with short writes (where the length passed to
  506. write_begin is greater than the number of bytes copied into the page).
  507. flags is a field for AOP_FLAG_xxx flags, described in
  508. include/linux/fs.h.
  509. A void * may be returned in fsdata, which then gets passed into
  510. write_end.
  511. Returns 0 on success; < 0 on failure (which is the error code), in
  512. which case write_end is not called.
  513. write_end: After a successful write_begin, and data copy, write_end must
  514. be called. len is the original len passed to write_begin, and copied
  515. is the amount that was able to be copied (copied == len is always true
  516. if write_begin was called with the AOP_FLAG_UNINTERRUPTIBLE flag).
  517. The filesystem must take care of unlocking the page and releasing it
  518. refcount, and updating i_size.
  519. Returns < 0 on failure, otherwise the number of bytes (<= 'copied')
  520. that were able to be copied into pagecache.
  521. bmap: called by the VFS to map a logical block offset within object to
  522. physical block number. This method is used by the FIBMAP
  523. ioctl and for working with swap-files. To be able to swap to
  524. a file, the file must have a stable mapping to a block
  525. device. The swap system does not go through the filesystem
  526. but instead uses bmap to find out where the blocks in the file
  527. are and uses those addresses directly.
  528. invalidatepage: If a page has PagePrivate set, then invalidatepage
  529. will be called when part or all of the page is to be removed
  530. from the address space. This generally corresponds to either a
  531. truncation or a complete invalidation of the address space
  532. (in the latter case 'offset' will always be 0).
  533. Any private data associated with the page should be updated
  534. to reflect this truncation. If offset is 0, then
  535. the private data should be released, because the page
  536. must be able to be completely discarded. This may be done by
  537. calling the ->releasepage function, but in this case the
  538. release MUST succeed.
  539. releasepage: releasepage is called on PagePrivate pages to indicate
  540. that the page should be freed if possible. ->releasepage
  541. should remove any private data from the page and clear the
  542. PagePrivate flag. If releasepage() fails for some reason, it must
  543. indicate failure with a 0 return value.
  544. releasepage() is used in two distinct though related cases. The
  545. first is when the VM finds a clean page with no active users and
  546. wants to make it a free page. If ->releasepage succeeds, the
  547. page will be removed from the address_space and become free.
  548. The second case is when a request has been made to invalidate
  549. some or all pages in an address_space. This can happen
  550. through the fadvice(POSIX_FADV_DONTNEED) system call or by the
  551. filesystem explicitly requesting it as nfs and 9fs do (when
  552. they believe the cache may be out of date with storage) by
  553. calling invalidate_inode_pages2().
  554. If the filesystem makes such a call, and needs to be certain
  555. that all pages are invalidated, then its releasepage will
  556. need to ensure this. Possibly it can clear the PageUptodate
  557. bit if it cannot free private data yet.
  558. freepage: freepage is called once the page is no longer visible in
  559. the page cache in order to allow the cleanup of any private
  560. data. Since it may be called by the memory reclaimer, it
  561. should not assume that the original address_space mapping still
  562. exists, and it should not block.
  563. direct_IO: called by the generic read/write routines to perform
  564. direct_IO - that is IO requests which bypass the page cache
  565. and transfer data directly between the storage and the
  566. application's address space.
  567. get_xip_page: called by the VM to translate a block number to a page.
  568. The page is valid until the corresponding filesystem is unmounted.
  569. Filesystems that want to use execute-in-place (XIP) need to implement
  570. it. An example implementation can be found in fs/ext2/xip.c.
  571. migrate_page: This is used to compact the physical memory usage.
  572. If the VM wants to relocate a page (maybe off a memory card
  573. that is signalling imminent failure) it will pass a new page
  574. and an old page to this function. migrate_page should
  575. transfer any private data across and update any references
  576. that it has to the page.
  577. launder_page: Called before freeing a page - it writes back the dirty page. To
  578. prevent redirtying the page, it is kept locked during the whole
  579. operation.
  580. error_remove_page: normally set to generic_error_remove_page if truncation
  581. is ok for this address space. Used for memory failure handling.
  582. Setting this implies you deal with pages going away under you,
  583. unless you have them locked or reference counts increased.
  584. The File Object
  585. ===============
  586. A file object represents a file opened by a process.
  587. struct file_operations
  588. ----------------------
  589. This describes how the VFS can manipulate an open file. As of kernel
  590. 2.6.22, the following members are defined:
  591. struct file_operations {
  592. struct module *owner;
  593. loff_t (*llseek) (struct file *, loff_t, int);
  594. ssize_t (*read) (struct file *, char __user *, size_t, loff_t *);
  595. ssize_t (*write) (struct file *, const char __user *, size_t, loff_t *);
  596. ssize_t (*aio_read) (struct kiocb *, const struct iovec *, unsigned long, loff_t);
  597. ssize_t (*aio_write) (struct kiocb *, const struct iovec *, unsigned long, loff_t);
  598. int (*readdir) (struct file *, void *, filldir_t);
  599. unsigned int (*poll) (struct file *, struct poll_table_struct *);
  600. long (*unlocked_ioctl) (struct file *, unsigned int, unsigned long);
  601. long (*compat_ioctl) (struct file *, unsigned int, unsigned long);
  602. int (*mmap) (struct file *, struct vm_area_struct *);
  603. int (*open) (struct inode *, struct file *);
  604. int (*flush) (struct file *);
  605. int (*release) (struct inode *, struct file *);
  606. int (*fsync) (struct file *, loff_t, loff_t, int datasync);
  607. int (*aio_fsync) (struct kiocb *, int datasync);
  608. int (*fasync) (int, struct file *, int);
  609. int (*lock) (struct file *, int, struct file_lock *);
  610. ssize_t (*readv) (struct file *, const struct iovec *, unsigned long, loff_t *);
  611. ssize_t (*writev) (struct file *, const struct iovec *, unsigned long, loff_t *);
  612. ssize_t (*sendfile) (struct file *, loff_t *, size_t, read_actor_t, void *);
  613. ssize_t (*sendpage) (struct file *, struct page *, int, size_t, loff_t *, int);
  614. unsigned long (*get_unmapped_area)(struct file *, unsigned long, unsigned long, unsigned long, unsigned long);
  615. int (*check_flags)(int);
  616. int (*flock) (struct file *, int, struct file_lock *);
  617. ssize_t (*splice_write)(struct pipe_inode_info *, struct file *, size_t, unsigned int);
  618. ssize_t (*splice_read)(struct file *, struct pipe_inode_info *, size_t, unsigned int);
  619. };
  620. Again, all methods are called without any locks being held, unless
  621. otherwise noted.
  622. llseek: called when the VFS needs to move the file position index
  623. read: called by read(2) and related system calls
  624. aio_read: called by io_submit(2) and other asynchronous I/O operations
  625. write: called by write(2) and related system calls
  626. aio_write: called by io_submit(2) and other asynchronous I/O operations
  627. readdir: called when the VFS needs to read the directory contents
  628. poll: called by the VFS when a process wants to check if there is
  629. activity on this file and (optionally) go to sleep until there
  630. is activity. Called by the select(2) and poll(2) system calls
  631. unlocked_ioctl: called by the ioctl(2) system call.
  632. compat_ioctl: called by the ioctl(2) system call when 32 bit system calls
  633. are used on 64 bit kernels.
  634. mmap: called by the mmap(2) system call
  635. open: called by the VFS when an inode should be opened. When the VFS
  636. opens a file, it creates a new "struct file". It then calls the
  637. open method for the newly allocated file structure. You might
  638. think that the open method really belongs in
  639. "struct inode_operations", and you may be right. I think it's
  640. done the way it is because it makes filesystems simpler to
  641. implement. The open() method is a good place to initialize the
  642. "private_data" member in the file structure if you want to point
  643. to a device structure
  644. flush: called by the close(2) system call to flush a file
  645. release: called when the last reference to an open file is closed
  646. fsync: called by the fsync(2) system call
  647. fasync: called by the fcntl(2) system call when asynchronous
  648. (non-blocking) mode is enabled for a file
  649. lock: called by the fcntl(2) system call for F_GETLK, F_SETLK, and F_SETLKW
  650. commands
  651. readv: called by the readv(2) system call
  652. writev: called by the writev(2) system call
  653. sendfile: called by the sendfile(2) system call
  654. get_unmapped_area: called by the mmap(2) system call
  655. check_flags: called by the fcntl(2) system call for F_SETFL command
  656. flock: called by the flock(2) system call
  657. splice_write: called by the VFS to splice data from a pipe to a file. This
  658. method is used by the splice(2) system call
  659. splice_read: called by the VFS to splice data from file to a pipe. This
  660. method is used by the splice(2) system call
  661. Note that the file operations are implemented by the specific
  662. filesystem in which the inode resides. When opening a device node
  663. (character or block special) most filesystems will call special
  664. support routines in the VFS which will locate the required device
  665. driver information. These support routines replace the filesystem file
  666. operations with those for the device driver, and then proceed to call
  667. the new open() method for the file. This is how opening a device file
  668. in the filesystem eventually ends up calling the device driver open()
  669. method.
  670. Directory Entry Cache (dcache)
  671. ==============================
  672. struct dentry_operations
  673. ------------------------
  674. This describes how a filesystem can overload the standard dentry
  675. operations. Dentries and the dcache are the domain of the VFS and the
  676. individual filesystem implementations. Device drivers have no business
  677. here. These methods may be set to NULL, as they are either optional or
  678. the VFS uses a default. As of kernel 2.6.22, the following members are
  679. defined:
  680. struct dentry_operations {
  681. int (*d_revalidate)(struct dentry *, struct nameidata *);
  682. int (*d_hash)(const struct dentry *, const struct inode *,
  683. struct qstr *);
  684. int (*d_compare)(const struct dentry *, const struct inode *,
  685. const struct dentry *, const struct inode *,
  686. unsigned int, const char *, const struct qstr *);
  687. int (*d_delete)(const struct dentry *);
  688. void (*d_release)(struct dentry *);
  689. void (*d_iput)(struct dentry *, struct inode *);
  690. char *(*d_dname)(struct dentry *, char *, int);
  691. struct vfsmount *(*d_automount)(struct path *);
  692. int (*d_manage)(struct dentry *, bool);
  693. };
  694. d_revalidate: called when the VFS needs to revalidate a dentry. This
  695. is called whenever a name look-up finds a dentry in the
  696. dcache. Most filesystems leave this as NULL, because all their
  697. dentries in the dcache are valid
  698. d_revalidate may be called in rcu-walk mode (nd->flags & LOOKUP_RCU).
  699. If in rcu-walk mode, the filesystem must revalidate the dentry without
  700. blocking or storing to the dentry, d_parent and d_inode should not be
  701. used without care (because they can go NULL), instead nd->inode should
  702. be used.
  703. If a situation is encountered that rcu-walk cannot handle, return
  704. -ECHILD and it will be called again in ref-walk mode.
  705. d_hash: called when the VFS adds a dentry to the hash table. The first
  706. dentry passed to d_hash is the parent directory that the name is
  707. to be hashed into. The inode is the dentry's inode.
  708. Same locking and synchronisation rules as d_compare regarding
  709. what is safe to dereference etc.
  710. d_compare: called to compare a dentry name with a given name. The first
  711. dentry is the parent of the dentry to be compared, the second is
  712. the parent's inode, then the dentry and inode (may be NULL) of the
  713. child dentry. len and name string are properties of the dentry to be
  714. compared. qstr is the name to compare it with.
  715. Must be constant and idempotent, and should not take locks if
  716. possible, and should not or store into the dentry or inodes.
  717. Should not dereference pointers outside the dentry or inodes without
  718. lots of care (eg. d_parent, d_inode, d_name should not be used).
  719. However, our vfsmount is pinned, and RCU held, so the dentries and
  720. inodes won't disappear, neither will our sb or filesystem module.
  721. ->i_sb and ->d_sb may be used.
  722. It is a tricky calling convention because it needs to be called under
  723. "rcu-walk", ie. without any locks or references on things.
  724. d_delete: called when the last reference to a dentry is dropped and the
  725. dcache is deciding whether or not to cache it. Return 1 to delete
  726. immediately, or 0 to cache the dentry. Default is NULL which means to
  727. always cache a reachable dentry. d_delete must be constant and
  728. idempotent.
  729. d_release: called when a dentry is really deallocated
  730. d_iput: called when a dentry loses its inode (just prior to its
  731. being deallocated). The default when this is NULL is that the
  732. VFS calls iput(). If you define this method, you must call
  733. iput() yourself
  734. d_dname: called when the pathname of a dentry should be generated.
  735. Useful for some pseudo filesystems (sockfs, pipefs, ...) to delay
  736. pathname generation. (Instead of doing it when dentry is created,
  737. it's done only when the path is needed.). Real filesystems probably
  738. dont want to use it, because their dentries are present in global
  739. dcache hash, so their hash should be an invariant. As no lock is
  740. held, d_dname() should not try to modify the dentry itself, unless
  741. appropriate SMP safety is used. CAUTION : d_path() logic is quite
  742. tricky. The correct way to return for example "Hello" is to put it
  743. at the end of the buffer, and returns a pointer to the first char.
  744. dynamic_dname() helper function is provided to take care of this.
  745. d_automount: called when an automount dentry is to be traversed (optional).
  746. This should create a new VFS mount record and return the record to the
  747. caller. The caller is supplied with a path parameter giving the
  748. automount directory to describe the automount target and the parent
  749. VFS mount record to provide inheritable mount parameters. NULL should
  750. be returned if someone else managed to make the automount first. If
  751. the vfsmount creation failed, then an error code should be returned.
  752. If -EISDIR is returned, then the directory will be treated as an
  753. ordinary directory and returned to pathwalk to continue walking.
  754. If a vfsmount is returned, the caller will attempt to mount it on the
  755. mountpoint and will remove the vfsmount from its expiration list in
  756. the case of failure. The vfsmount should be returned with 2 refs on
  757. it to prevent automatic expiration - the caller will clean up the
  758. additional ref.
  759. This function is only used if DCACHE_NEED_AUTOMOUNT is set on the
  760. dentry. This is set by __d_instantiate() if S_AUTOMOUNT is set on the
  761. inode being added.
  762. d_manage: called to allow the filesystem to manage the transition from a
  763. dentry (optional). This allows autofs, for example, to hold up clients
  764. waiting to explore behind a 'mountpoint' whilst letting the daemon go
  765. past and construct the subtree there. 0 should be returned to let the
  766. calling process continue. -EISDIR can be returned to tell pathwalk to
  767. use this directory as an ordinary directory and to ignore anything
  768. mounted on it and not to check the automount flag. Any other error
  769. code will abort pathwalk completely.
  770. If the 'rcu_walk' parameter is true, then the caller is doing a
  771. pathwalk in RCU-walk mode. Sleeping is not permitted in this mode,
  772. and the caller can be asked to leave it and call again by returning
  773. -ECHILD.
  774. This function is only used if DCACHE_MANAGE_TRANSIT is set on the
  775. dentry being transited from.
  776. Example :
  777. static char *pipefs_dname(struct dentry *dent, char *buffer, int buflen)
  778. {
  779. return dynamic_dname(dentry, buffer, buflen, "pipe:[%lu]",
  780. dentry->d_inode->i_ino);
  781. }
  782. Each dentry has a pointer to its parent dentry, as well as a hash list
  783. of child dentries. Child dentries are basically like files in a
  784. directory.
  785. Directory Entry Cache API
  786. --------------------------
  787. There are a number of functions defined which permit a filesystem to
  788. manipulate dentries:
  789. dget: open a new handle for an existing dentry (this just increments
  790. the usage count)
  791. dput: close a handle for a dentry (decrements the usage count). If
  792. the usage count drops to 0, and the dentry is still in its
  793. parent's hash, the "d_delete" method is called to check whether
  794. it should be cached. If it should not be cached, or if the dentry
  795. is not hashed, it is deleted. Otherwise cached dentries are put
  796. into an LRU list to be reclaimed on memory shortage.
  797. d_drop: this unhashes a dentry from its parents hash list. A
  798. subsequent call to dput() will deallocate the dentry if its
  799. usage count drops to 0
  800. d_delete: delete a dentry. If there are no other open references to
  801. the dentry then the dentry is turned into a negative dentry
  802. (the d_iput() method is called). If there are other
  803. references, then d_drop() is called instead
  804. d_add: add a dentry to its parents hash list and then calls
  805. d_instantiate()
  806. d_instantiate: add a dentry to the alias hash list for the inode and
  807. updates the "d_inode" member. The "i_count" member in the
  808. inode structure should be set/incremented. If the inode
  809. pointer is NULL, the dentry is called a "negative
  810. dentry". This function is commonly called when an inode is
  811. created for an existing negative dentry
  812. d_lookup: look up a dentry given its parent and path name component
  813. It looks up the child of that given name from the dcache
  814. hash table. If it is found, the reference count is incremented
  815. and the dentry is returned. The caller must use dput()
  816. to free the dentry when it finishes using it.
  817. Mount Options
  818. =============
  819. Parsing options
  820. ---------------
  821. On mount and remount the filesystem is passed a string containing a
  822. comma separated list of mount options. The options can have either of
  823. these forms:
  824. option
  825. option=value
  826. The <linux/parser.h> header defines an API that helps parse these
  827. options. There are plenty of examples on how to use it in existing
  828. filesystems.
  829. Showing options
  830. ---------------
  831. If a filesystem accepts mount options, it must define show_options()
  832. to show all the currently active options. The rules are:
  833. - options MUST be shown which are not default or their values differ
  834. from the default
  835. - options MAY be shown which are enabled by default or have their
  836. default value
  837. Options used only internally between a mount helper and the kernel
  838. (such as file descriptors), or which only have an effect during the
  839. mounting (such as ones controlling the creation of a journal) are exempt
  840. from the above rules.
  841. The underlying reason for the above rules is to make sure, that a
  842. mount can be accurately replicated (e.g. umounting and mounting again)
  843. based on the information found in /proc/mounts.
  844. A simple method of saving options at mount/remount time and showing
  845. them is provided with the save_mount_options() and
  846. generic_show_options() helper functions. Please note, that using
  847. these may have drawbacks. For more info see header comments for these
  848. functions in fs/namespace.c.
  849. Resources
  850. =========
  851. (Note some of these resources are not up-to-date with the latest kernel
  852. version.)
  853. Creating Linux virtual filesystems. 2002
  854. <http://lwn.net/Articles/13325/>
  855. The Linux Virtual File-system Layer by Neil Brown. 1999
  856. <http://www.cse.unsw.edu.au/~neilb/oss/linux-commentary/vfs.html>
  857. A tour of the Linux VFS by Michael K. Johnson. 1996
  858. <http://www.tldp.org/LDP/khg/HyperNews/get/fs/vfstour.html>
  859. A small trail through the Linux kernel by Andries Brouwer. 2001
  860. <http://www.win.tue.nl/~aeb/linux/vfs/trail.html>