vfs.txt 41.2 KB
Newer Older
L
Linus Torvalds 已提交
1

2
	      Overview of the Linux Virtual File System
L
Linus Torvalds 已提交
3

4
	Original author: Richard Gooch <rgooch@atnf.csiro.au>
L
Linus Torvalds 已提交
5

6
		  Last updated on June 24, 2007.
L
Linus Torvalds 已提交
7

8 9
  Copyright (C) 1999 Richard Gooch
  Copyright (C) 2005 Pekka Enberg
L
Linus Torvalds 已提交
10

11
  This file is released under the GPLv2.
L
Linus Torvalds 已提交
12 13


14 15
Introduction
============
L
Linus Torvalds 已提交
16

17 18 19 20 21
The Virtual File System (also known as the Virtual Filesystem Switch)
is the software layer in the kernel that provides the filesystem
interface to userspace programs. It also provides an abstraction
within the kernel which allows different filesystem implementations to
coexist.
L
Linus Torvalds 已提交
22

23 24 25
VFS system calls open(2), stat(2), read(2), write(2), chmod(2) and so
on are called from a process context. Filesystem locking is described
in the document Documentation/filesystems/Locking.
L
Linus Torvalds 已提交
26 27


28 29
Directory Entry Cache (dcache)
------------------------------
L
Linus Torvalds 已提交
30

31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68
The VFS implements the open(2), stat(2), chmod(2), and similar system
calls. The pathname argument that is passed to them is used by the VFS
to search through the directory entry cache (also known as the dentry
cache or dcache). This provides a very fast look-up mechanism to
translate a pathname (filename) into a specific dentry. Dentries live
in RAM and are never saved to disc: they exist only for performance.

The dentry cache is meant to be a view into your entire filespace. As
most computers cannot fit all dentries in the RAM at the same time,
some bits of the cache are missing. In order to resolve your pathname
into a dentry, the VFS may have to resort to creating dentries along
the way, and then loading the inode. This is done by looking up the
inode.


The Inode Object
----------------

An individual dentry usually has a pointer to an inode. Inodes are
filesystem objects such as regular files, directories, FIFOs and other
beasts.  They live either on the disc (for block device filesystems)
or in the memory (for pseudo filesystems). Inodes that live on the
disc are copied into the memory when required and changes to the inode
are written back to disc. A single inode can be pointed to by multiple
dentries (hard links, for example, do this).

To look up an inode requires that the VFS calls the lookup() method of
the parent directory inode. This method is installed by the specific
filesystem implementation that the inode lives in. Once the VFS has
the required dentry (and hence the inode), we can do all those boring
things like open(2) the file, or stat(2) it to peek at the inode
data. The stat(2) operation is fairly simple: once the VFS has the
dentry, it peeks at the inode data and passes some of it back to
userspace.


The File Object
---------------
L
Linus Torvalds 已提交
69 70 71

Opening a file requires another operation: allocation of a file
structure (this is the kernel-side implementation of file
72
descriptors). The freshly allocated file structure is initialized with
L
Linus Torvalds 已提交
73 74 75
a pointer to the dentry and a set of file operation member functions.
These are taken from the inode data. The open() file method is then
called so the specific filesystem implementation can do it's work. You
76 77
can see that this is another switch performed by the VFS. The file
structure is placed into the file descriptor table for the process.
L
Linus Torvalds 已提交
78 79 80

Reading, writing and closing files (and other assorted VFS operations)
is done by using the userspace file descriptor to grab the appropriate
81 82 83
file structure, and then calling the required file structure method to
do whatever is required. For as long as the file is open, it keeps the
dentry in use, which in turn means that the VFS inode is still in use.
L
Linus Torvalds 已提交
84

85 86

Registering and Mounting a Filesystem
87
=====================================
L
Linus Torvalds 已提交
88

89 90
To register and unregister a filesystem, use the following API
functions:
L
Linus Torvalds 已提交
91

92
   #include <linux/fs.h>
L
Linus Torvalds 已提交
93

94 95
   extern int register_filesystem(struct file_system_type *);
   extern int unregister_filesystem(struct file_system_type *);
L
Linus Torvalds 已提交
96

97 98 99 100 101
The passed struct file_system_type describes your filesystem. When a
request is made to mount a device onto a directory in your filespace,
the VFS will call the appropriate get_sb() method for the specific
filesystem. The dentry for the mount point will then be updated to
point to the root inode for the new filesystem.
L
Linus Torvalds 已提交
102

103 104
You can see all filesystems that are registered to the kernel in the
file /proc/filesystems.
L
Linus Torvalds 已提交
105 106


107
struct file_system_type
108
-----------------------
L
Linus Torvalds 已提交
109

110
This describes the filesystem. As of kernel 2.6.22, the following
L
Linus Torvalds 已提交
111 112 113 114 115
members are defined:

struct file_system_type {
	const char *name;
	int fs_flags;
116 117
        int (*get_sb) (struct file_system_type *, int,
                       const char *, void *, struct vfsmount *);
118 119 120 121
        void (*kill_sb) (struct super_block *);
        struct module *owner;
        struct file_system_type * next;
        struct list_head fs_supers;
122 123
	struct lock_class_key s_lock_key;
	struct lock_class_key s_umount_key;
L
Linus Torvalds 已提交
124 125 126 127 128 129 130
};

  name: the name of the filesystem type, such as "ext2", "iso9660",
	"msdos" and so on

  fs_flags: various flags (i.e. FS_REQUIRES_DEV, FS_NO_DCACHE, etc.)

131
  get_sb: the method to call when a new instance of this
L
Linus Torvalds 已提交
132 133
	filesystem should be mounted

134 135 136 137 138
  kill_sb: the method to call when an instance of this filesystem
	should be unmounted

  owner: for internal VFS use: you should initialize this to THIS_MODULE in
  	most cases.
L
Linus Torvalds 已提交
139

140 141
  next: for internal VFS use: you should initialize this to NULL

142 143
  s_lock_key, s_umount_key: lockdep-specific

144
The get_sb() method has the following arguments:
L
Linus Torvalds 已提交
145

146
  struct file_system_type *fs_type: describes the filesystem, partly initialized
147
  	by the specific filesystem code
148 149 150 151

  int flags: mount flags

  const char *dev_name: the device name we are mounting.
L
Linus Torvalds 已提交
152 153

  void *data: arbitrary mount options, usually comes as an ASCII
154
	string (see "Mount Options" section)
L
Linus Torvalds 已提交
155

156
  struct vfsmount *mnt: a vfs-internal representation of a mount point
L
Linus Torvalds 已提交
157

158
The get_sb() method must determine if the block device specified
159 160 161 162
in the dev_name and fs_type contains a filesystem of the type the method
supports. If it succeeds in opening the named block device, it initializes a
struct super_block descriptor for the filesystem contained by the block device.
On failure it returns an error.
L
Linus Torvalds 已提交
163 164

The most interesting member of the superblock structure that the
165
get_sb() method fills in is the "s_op" field. This is a pointer to
L
Linus Torvalds 已提交
166 167 168
a "struct super_operations" which describes the next level of the
filesystem implementation.

169 170
Usually, a filesystem uses one of the generic get_sb() implementations
and provides a fill_super() method instead. The generic methods are:
171 172

  get_sb_bdev: mount a filesystem residing on a block device
L
Linus Torvalds 已提交
173

174 175 176 177 178 179 180 181 182 183 184
  get_sb_nodev: mount a filesystem that is not backed by a device

  get_sb_single: mount a filesystem which shares the instance between
  	all mounts

A fill_super() method implementation has the following arguments:

  struct super_block *sb: the superblock structure. The method fill_super()
  	must initialize this properly.

  void *data: arbitrary mount options, usually comes as an ASCII
185
	string (see "Mount Options" section)
186 187 188 189

  int silent: whether or not to be silent on error


190 191 192 193 194 195
The Superblock Object
=====================

A superblock object represents a mounted filesystem.


196
struct super_operations
197
-----------------------
L
Linus Torvalds 已提交
198 199

This describes how the VFS can manipulate the superblock of your
200
filesystem. As of kernel 2.6.22, the following members are defined:
L
Linus Torvalds 已提交
201 202

struct super_operations {
203 204 205 206 207 208 209 210 211 212
        struct inode *(*alloc_inode)(struct super_block *sb);
        void (*destroy_inode)(struct inode *);

        void (*dirty_inode) (struct inode *);
        int (*write_inode) (struct inode *, int);
        void (*drop_inode) (struct inode *);
        void (*delete_inode) (struct inode *);
        void (*put_super) (struct super_block *);
        void (*write_super) (struct super_block *);
        int (*sync_fs)(struct super_block *sb, int wait);
213 214
        int (*freeze_fs) (struct super_block *);
        int (*unfreeze_fs) (struct super_block *);
215
        int (*statfs) (struct dentry *, struct kstatfs *);
216 217 218 219 220 221 222 223
        int (*remount_fs) (struct super_block *, int *, char *);
        void (*clear_inode) (struct inode *);
        void (*umount_begin) (struct super_block *);

        int (*show_options)(struct seq_file *, struct vfsmount *);

        ssize_t (*quota_read)(struct super_block *, int, char *, size_t, loff_t);
        ssize_t (*quota_write)(struct super_block *, int, const char *, size_t, loff_t);
L
Linus Torvalds 已提交
224 225 226 227 228 229 230
};

All methods are called without any locks being held, unless otherwise
noted. This means that most methods can block safely. All methods are
only called from a process context (i.e. not from an interrupt handler
or bottom half).

231
  alloc_inode: this method is called by inode_alloc() to allocate memory
232 233 234 235
 	for struct inode and initialize it.  If this function is not
 	defined, a simple 'struct inode' is allocated.  Normally
 	alloc_inode will be used to allocate a larger structure which
 	contains a 'struct inode' embedded within it.
236 237

  destroy_inode: this method is called by destroy_inode() to release
238 239 240
  	resources allocated for struct inode.  It is only required if
  	->alloc_inode was defined and simply undoes anything done by
	->alloc_inode.
241 242

  dirty_inode: this method is called by the VFS to mark an inode dirty.
L
Linus Torvalds 已提交
243 244 245 246 247 248 249 250

  write_inode: this method is called when the VFS needs to write an
	inode to disc.  The second parameter indicates whether the write
	should be synchronous or not, not all filesystems check this flag.

  drop_inode: called when the last access to the inode is dropped,
	with the inode_lock spinlock held.

251
	This method should be either NULL (normal UNIX filesystem
L
Linus Torvalds 已提交
252 253 254 255
	semantics) or "generic_delete_inode" (for filesystems that do not
	want to cache inodes - causing "delete_inode" to always be
	called regardless of the value of i_nlink)

256
	The "generic_delete_inode()" behavior is equivalent to the
L
Linus Torvalds 已提交
257 258 259 260 261 262 263 264 265 266 267 268
	old practice of using "force_delete" in the put_inode() case,
	but does not have the races that the "force_delete()" approach
	had. 

  delete_inode: called when the VFS wants to delete an inode

  put_super: called when the VFS wishes to free the superblock
	(i.e. unmount). This is called with the superblock lock held

  write_super: called when the VFS superblock needs to be written to
	disc. This method is optional

269 270 271 272
  sync_fs: called when VFS is writing out all dirty data associated with
  	a superblock. The second parameter indicates whether the method
	should wait until the write out has been completed. Optional.

273
  freeze_fs: called when VFS is locking a filesystem and
274 275
  	forcing it into a consistent state.  This method is currently
  	used by the Logical Volume Manager (LVM).
276

277
  unfreeze_fs: called when VFS is unlocking a filesystem and making it writable
278 279
  	again.

280
  statfs: called when the VFS needs to get filesystem statistics.
L
Linus Torvalds 已提交
281 282 283 284 285 286

  remount_fs: called when the filesystem is remounted. This is called
	with the kernel lock held

  clear_inode: called then the VFS clears the inode. Optional

287 288
  umount_begin: called when the VFS is unmounting a filesystem.

289 290
  show_options: called by the VFS to show mount options for
	/proc/<pid>/mounts.  (see "Mount Options" section)
291 292 293 294 295

  quota_read: called by the VFS to read from filesystem quota file.

  quota_write: called by the VFS to write to filesystem quota file.

296 297 298
Whoever sets up the inode is responsible for filling in the "i_op" field. This
is a pointer to a "struct inode_operations" which describes the methods that
can be performed on individual inodes.
L
Linus Torvalds 已提交
299 300


301 302 303 304 305 306
The Inode Object
================

An inode object represents an object within the filesystem.


307
struct inode_operations
308
-----------------------
L
Linus Torvalds 已提交
309 310

This describes how the VFS can manipulate an inode in your
311
filesystem. As of kernel 2.6.22, the following members are defined:
L
Linus Torvalds 已提交
312 313

struct inode_operations {
314 315
	int (*create) (struct inode *,struct dentry *,int, struct nameidata *);
	struct dentry * (*lookup) (struct inode *,struct dentry *, struct nameidata *);
L
Linus Torvalds 已提交
316 317 318 319 320 321 322 323
	int (*link) (struct dentry *,struct inode *,struct dentry *);
	int (*unlink) (struct inode *,struct dentry *);
	int (*symlink) (struct inode *,struct dentry *,const char *);
	int (*mkdir) (struct inode *,struct dentry *,int);
	int (*rmdir) (struct inode *,struct dentry *);
	int (*mknod) (struct inode *,struct dentry *,int,dev_t);
	int (*rename) (struct inode *, struct dentry *,
			struct inode *, struct dentry *);
324 325 326
	int (*readlink) (struct dentry *, char __user *,int);
        void * (*follow_link) (struct dentry *, struct nameidata *);
        void (*put_link) (struct dentry *, struct nameidata *, void *);
L
Linus Torvalds 已提交
327
	void (*truncate) (struct inode *);
328 329 330 331 332 333 334
	int (*permission) (struct inode *, int, struct nameidata *);
	int (*setattr) (struct dentry *, struct iattr *);
	int (*getattr) (struct vfsmount *mnt, struct dentry *, struct kstat *);
	int (*setxattr) (struct dentry *, const char *,const void *,size_t,int);
	ssize_t (*getxattr) (struct dentry *, const char *, void *, size_t);
	ssize_t (*listxattr) (struct dentry *, char *, size_t);
	int (*removexattr) (struct dentry *, const char *);
335
	void (*truncate_range)(struct inode *, loff_t, loff_t);
L
Linus Torvalds 已提交
336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384
};

Again, all methods are called without any locks being held, unless
otherwise noted.

  create: called by the open(2) and creat(2) system calls. Only
	required if you want to support regular files. The dentry you
	get should not have an inode (i.e. it should be a negative
	dentry). Here you will probably call d_instantiate() with the
	dentry and the newly created inode

  lookup: called when the VFS needs to look up an inode in a parent
	directory. The name to look for is found in the dentry. This
	method must call d_add() to insert the found inode into the
	dentry. The "i_count" field in the inode structure should be
	incremented. If the named inode does not exist a NULL inode
	should be inserted into the dentry (this is called a negative
	dentry). Returning an error code from this routine must only
	be done on a real error, otherwise creating inodes with system
	calls like create(2), mknod(2), mkdir(2) and so on will fail.
	If you wish to overload the dentry methods then you should
	initialise the "d_dop" field in the dentry; this is a pointer
	to a struct "dentry_operations".
	This method is called with the directory inode semaphore held

  link: called by the link(2) system call. Only required if you want
	to support hard links. You will probably need to call
	d_instantiate() just as you would in the create() method

  unlink: called by the unlink(2) system call. Only required if you
	want to support deleting inodes

  symlink: called by the symlink(2) system call. Only required if you
	want to support symlinks. You will probably need to call
	d_instantiate() just as you would in the create() method

  mkdir: called by the mkdir(2) system call. Only required if you want
	to support creating subdirectories. You will probably need to
	call d_instantiate() just as you would in the create() method

  rmdir: called by the rmdir(2) system call. Only required if you want
	to support deleting subdirectories

  mknod: called by the mknod(2) system call to create a device (char,
	block) inode or a named pipe (FIFO) or socket. Only required
	if you want to support creating these types of inodes. You
	will probably need to call d_instantiate() just as you would
	in the create() method

385 386 387
  rename: called by the rename(2) system call to rename the object to
	have the parent and name given by the second inode and dentry.

L
Linus Torvalds 已提交
388 389 390 391
  readlink: called by the readlink(2) system call. Only required if
	you want to support reading symbolic links

  follow_link: called by the VFS to follow a symbolic link to the
392
	inode it points to.  Only required if you want to support
393
	symbolic links.  This method returns a void pointer cookie
394 395 396
	that is passed to put_link().

  put_link: called by the VFS to release resources allocated by
397
  	follow_link().  The cookie returned by follow_link() is passed
398
  	to this method as the last parameter.  It is used by
399 400 401 402 403 404 405 406 407
  	filesystems such as NFS where page cache is not stable
  	(i.e. page that was installed when the symbolic link walk
  	started might not be in the page cache at the end of the
  	walk).

  truncate: called by the VFS to change the size of a file.  The
 	i_size field of the inode is set to the desired size by the
 	VFS before this method is called.  This method is called by
 	the truncate(2) system call and related functionality.
408 409 410 411

  permission: called by the VFS to check for access rights on a POSIX-like
  	filesystem.

412 413
  setattr: called by the VFS to set attributes for a file. This method
  	is called by chmod(2) and related system calls.
414

415 416
  getattr: called by the VFS to get attributes of a file. This method
  	is called by stat(2) and related system calls.
417 418

  setxattr: called by the VFS to set an extended attribute for a file.
419 420 421 422 423 424 425 426 427
  	Extended attribute is a name:value pair associated with an
  	inode. This method is called by setxattr(2) system call.

  getxattr: called by the VFS to retrieve the value of an extended
  	attribute name. This method is called by getxattr(2) function
  	call.

  listxattr: called by the VFS to list all extended attributes for a
  	given file. This method is called by listxattr(2) system call.
428

429 430
  removexattr: called by the VFS to remove an extended attribute from
  	a file. This method is called by removexattr(2) system call.
431

432 433 434
  truncate_range: a method provided by the underlying filesystem to truncate a
  	range of blocks , i.e. punch a hole somewhere in a file.

435

436 437 438
The Address Space Object
========================

439 440 441 442 443 444 445 446 447 448
The address space object is used to group and manage pages in the page
cache.  It can be used to keep track of the pages in a file (or
anything else) and also track the mapping of sections of the file into
process address spaces.

There are a number of distinct yet related services that an
address-space can provide.  These include communicating memory
pressure, page lookup by address, and keeping track of pages tagged as
Dirty or Writeback.

449
The first can be used independently to the others.  The VM can try to
450 451 452 453 454 455 456
either write dirty pages in order to clean them, or release clean
pages in order to reuse them.  To do this it can call the ->writepage
method on dirty pages, and ->releasepage on clean pages with
PagePrivate set. Clean pages without PagePrivate and with no external
references will be released without notice being given to the
address_space.

457
To achieve this functionality, pages need to be placed on an LRU with
458 459 460 461 462 463 464 465 466 467 468
lru_cache_add and mark_page_active needs to be called whenever the
page is used.

Pages are normally kept in a radix tree index by ->index. This tree
maintains information about the PG_Dirty and PG_Writeback status of
each page, so that pages with either of these flags can be found
quickly.

The Dirty tag is primarily used by mpage_writepages - the default
->writepages method.  It uses the tag to find dirty pages to call
->writepage on.  If mpage_writepages is not used (i.e. the address
469
provides its own ->writepages) , the PAGECACHE_TAG_DIRTY tag is
470 471 472 473 474
almost unused.  write_inode_now and sync_inode do use it (through
__sync_single_inode) to check if ->writepages has been successful in
writing out the whole address_space.

The Writeback tag is used by filemap*wait* and sync_page* functions,
475
via wait_on_page_writeback_range, to wait for all writeback to
476
complete.  While waiting ->sync_page (if defined) will be called on
477
each page that is found to require writeback.
478 479 480 481

An address_space handler may attach extra information to a page,
typically using the 'private' field in the 'struct page'.  If such
information is attached, the PG_Private flag should be set.  This will
482
cause various VM routines to make extra calls into the address_space
483 484 485 486 487 488 489 490
handler to deal with that data.

An address space acts as an intermediate between storage and
application.  Data is read into the address space a whole page at a
time, and provided to the application either by copying of the page,
or by memory-mapping the page.
Data is written into the address space by the application, and then
written-back to storage typically in whole pages, however the
491
address_space has finer control of write sizes.
492 493

The read process essentially only requires 'readpage'.  The write
494
process is more complicated and uses write_begin/write_end or
495 496 497 498 499 500 501 502 503 504 505 506 507
set_page_dirty to write data into the address_space, and writepage,
sync_page, and writepages to writeback data to storage.

Adding and removing pages to/from an address_space is protected by the
inode's i_mutex.

When data is written to a page, the PG_Dirty flag should be set.  It
typically remains set until writepage asks for it to be written.  This
should clear PG_Dirty and set PG_Writeback.  It can be actually
written at any point after PG_Dirty is clear.  Once it is known to be
safe, PG_Writeback is cleared.

Writeback makes use of a writeback_control structure...
508 509

struct address_space_operations
510
-------------------------------
511 512

This describes how the VFS can manipulate mapping of a file to page cache in
513
your filesystem. As of kernel 2.6.22, the following members are defined:
514 515 516 517 518 519 520 521 522

struct address_space_operations {
	int (*writepage)(struct page *page, struct writeback_control *wbc);
	int (*readpage)(struct file *, struct page *);
	int (*sync_page)(struct page *);
	int (*writepages)(struct address_space *, struct writeback_control *);
	int (*set_page_dirty)(struct page *page);
	int (*readpages)(struct file *filp, struct address_space *mapping,
			struct list_head *pages, unsigned nr_pages);
523 524 525 526 527 528
	int (*write_begin)(struct file *, struct address_space *mapping,
				loff_t pos, unsigned len, unsigned flags,
				struct page **pagep, void **fsdata);
	int (*write_end)(struct file *, struct address_space *mapping,
				loff_t pos, unsigned len, unsigned copied,
				struct page *page, void *fsdata);
529 530 531 532 533 534 535
	sector_t (*bmap)(struct address_space *, sector_t);
	int (*invalidatepage) (struct page *, unsigned long);
	int (*releasepage) (struct page *, int);
	ssize_t (*direct_IO)(int, struct kiocb *, const struct iovec *iov,
			loff_t offset, unsigned long nr_segs);
	struct page* (*get_xip_page)(struct address_space *, sector_t,
			int);
536 537
	/* migrate the contents of a page to the specified target */
	int (*migratepage) (struct page *, struct page *);
538
	int (*launder_page) (struct page *);
539
	int (*error_remove_page) (struct mapping *mapping, struct page *page);
540 541
};

542
  writepage: called by the VM to write a dirty page to backing store.
543
      This may happen for data integrity reasons (i.e. 'sync'), or
544 545 546 547 548 549 550 551
      to free up memory (flush).  The difference can be seen in
      wbc->sync_mode.
      The PG_Dirty flag has been cleared and PageLocked is true.
      writepage should start writeout, should set PG_Writeback,
      and should make sure the page is unlocked, either synchronously
      or asynchronously when the write operation completes.

      If wbc->sync_mode is WB_SYNC_NONE, ->writepage doesn't have to
552 553 554 555
      try too hard if there are problems, and may choose to write out
      other pages from the mapping if that is easier (e.g. due to
      internal dependencies).  If it chooses not to start writeout, it
      should return AOP_WRITEPAGE_ACTIVATE so that the VM will not keep
556 557 558
      calling ->writepage on that page.

      See the file "Locking" for more details.
559 560

  readpage: called by the VM to read a page from backing store.
561 562 563 564
       The page will be Locked when readpage is called, and should be
       unlocked and marked uptodate once the read completes.
       If ->readpage discovers that it needs to unlock the page for
       some reason, it can do so, and then return AOP_TRUNCATED_PAGE.
565
       In this case, the page will be relocated, relocked and if
566
       that all succeeds, ->readpage will be called again.
567 568 569 570 571

  sync_page: called by the VM to notify the backing store to perform all
  	queued I/O operations for a page. I/O operations for other pages
	associated with this address_space object may also be performed.

572 573 574
	This function is optional and is called only for pages with
  	PG_Writeback set while waiting for the writeback to complete.

575
  writepages: called by the VM to write out pages associated with the
576 577 578
  	address_space object.  If wbc->sync_mode is WBC_SYNC_ALL, then
  	the writeback_control will specify a range of pages that must be
  	written out.  If it is WBC_SYNC_NONE, then a nr_to_write is given
579 580
	and that many pages should be written if possible.
	If no ->writepages is given, then mpage_writepages is used
581
  	instead.  This will choose pages from the address space that are
582
  	tagged as DIRTY and will pass them to ->writepage.
583 584

  set_page_dirty: called by the VM to set a page dirty.
585 586 587 588 589 590
        This is particularly needed if an address space attaches
        private data to a page, and that data needs to be updated when
        a page is dirtied.  This is called, for example, when a memory
	mapped page gets modified.
	If defined, it should set the PageDirty flag, and the
        PAGECACHE_TAG_DIRTY tag in the radix tree.
591 592

  readpages: called by the VM to read pages associated with the address_space
593 594 595
  	object. This is essentially just a vector version of
  	readpage.  Instead of just one page, several pages are
  	requested.
596
	readpages is only used for read-ahead, so read errors are
597
  	ignored.  If anything goes wrong, feel free to give up.
L
Linus Torvalds 已提交
598

599
  write_begin:
600 601 602 603 604 605 606 607 608 609 610
	Called by the generic buffered write code to ask the filesystem to
	prepare to write len bytes at the given offset in the file. The
	address_space should check that the write will be able to complete,
	by allocating space if necessary and doing any other internal
	housekeeping.  If the write will update parts of any basic-blocks on
	storage, then those blocks should be pre-read (if they haven't been
	read already) so that the updated blocks can be written out properly.

        The filesystem must return the locked pagecache page for the specified
	offset, in *pagep, for the caller to write into.

611 612 613
	It must be able to cope with short writes (where the length passed to
	write_begin is greater than the number of bytes copied into the page).

614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633
	flags is a field for AOP_FLAG_xxx flags, described in
	include/linux/fs.h.

        A void * may be returned in fsdata, which then gets passed into
        write_end.

        Returns 0 on success; < 0 on failure (which is the error code), in
	which case write_end is not called.

  write_end: After a successful write_begin, and data copy, write_end must
        be called. len is the original len passed to write_begin, and copied
        is the amount that was able to be copied (copied == len is always true
	if write_begin was called with the AOP_FLAG_UNINTERRUPTIBLE flag).

        The filesystem must take care of unlocking the page and releasing it
        refcount, and updating i_size.

        Returns < 0 on failure, otherwise the number of bytes (<= 'copied')
        that were able to be copied into pagecache.

634
  bmap: called by the VFS to map a logical block offset within object to
635
  	physical block number. This method is used by the FIBMAP
636
  	ioctl and for working with swap-files.  To be able to swap to
637
  	a file, the file must have a stable mapping to a block
638 639 640 641 642 643 644
  	device.  The swap system does not go through the filesystem
  	but instead uses bmap to find out where the blocks in the file
  	are and uses those addresses directly.


  invalidatepage: If a page has PagePrivate set, then invalidatepage
        will be called when part or all of the page is to be removed
645
	from the address space.  This generally corresponds to either a
646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665
	truncation or a complete invalidation of the address space
	(in the latter case 'offset' will always be 0).
	Any private data associated with the page should be updated
	to reflect this truncation.  If offset is 0, then
	the private data should be released, because the page
	must be able to be completely discarded.  This may be done by
        calling the ->releasepage function, but in this case the
        release MUST succeed.

  releasepage: releasepage is called on PagePrivate pages to indicate
        that the page should be freed if possible.  ->releasepage
        should remove any private data from the page and clear the
        PagePrivate flag.  It may also remove the page from the
        address_space.  If this fails for some reason, it may indicate
        failure with a 0 return value.
	This is used in two distinct though related cases.  The first
        is when the VM finds a clean page with no active users and
        wants to make it a free page.  If ->releasepage succeeds, the
        page will be removed from the address_space and become free.

666
	The second case is when a request has been made to invalidate
667 668 669 670 671 672
        some or all pages in an address_space.  This can happen
        through the fadvice(POSIX_FADV_DONTNEED) system call or by the
        filesystem explicitly requesting it as nfs and 9fs do (when
        they believe the cache may be out of date with storage) by
        calling invalidate_inode_pages2().
	If the filesystem makes such a call, and needs to be certain
673
        that all pages are invalidated, then its releasepage will
674 675 676 677 678
        need to ensure this.  Possibly it can clear the PageUptodate
        bit if it cannot free private data yet.

  direct_IO: called by the generic read/write routines to perform
        direct_IO - that is IO requests which bypass the page cache
679
        and transfer data directly between the storage and the
680
        application's address space.
681 682 683 684 685 686

  get_xip_page: called by the VM to translate a block number to a page.
	The page is valid until the corresponding filesystem is unmounted.
	Filesystems that want to use execute-in-place (XIP) need to implement
	it.  An example implementation can be found in fs/ext2/xip.c.

687 688 689 690 691 692
  migrate_page:  This is used to compact the physical memory usage.
        If the VM wants to relocate a page (maybe off a memory card
        that is signalling imminent failure) it will pass a new page
	and an old page to this function.  migrate_page should
	transfer any private data across and update any references
        that it has to the page.
693

694 695 696 697
  launder_page: Called before freeing a page - it writes back the dirty page. To
  	prevent redirtying the page, it is kept locked during the whole
	operation.

698 699 700 701 702 703
  error_remove_page: normally set to generic_error_remove_page if truncation
	is ok for this address space. Used for memory failure handling.
	Setting this implies you deal with pages going away under you,
	unless you have them locked or reference counts increased.


704 705 706 707 708 709
The File Object
===============

A file object represents a file opened by a process.


710
struct file_operations
711
----------------------
L
Linus Torvalds 已提交
712 713

This describes how the VFS can manipulate an open file. As of kernel
714
2.6.22, the following members are defined:
L
Linus Torvalds 已提交
715 716

struct file_operations {
717
	struct module *owner;
L
Linus Torvalds 已提交
718
	loff_t (*llseek) (struct file *, loff_t, int);
719 720
	ssize_t (*read) (struct file *, char __user *, size_t, loff_t *);
	ssize_t (*write) (struct file *, const char __user *, size_t, loff_t *);
721 722
	ssize_t (*aio_read) (struct kiocb *, const struct iovec *, unsigned long, loff_t);
	ssize_t (*aio_write) (struct kiocb *, const struct iovec *, unsigned long, loff_t);
L
Linus Torvalds 已提交
723 724 725
	int (*readdir) (struct file *, void *, filldir_t);
	unsigned int (*poll) (struct file *, struct poll_table_struct *);
	int (*ioctl) (struct inode *, struct file *, unsigned int, unsigned long);
726 727
	long (*unlocked_ioctl) (struct file *, unsigned int, unsigned long);
	long (*compat_ioctl) (struct file *, unsigned int, unsigned long);
L
Linus Torvalds 已提交
728 729
	int (*mmap) (struct file *, struct vm_area_struct *);
	int (*open) (struct inode *, struct file *);
730
	int (*flush) (struct file *);
L
Linus Torvalds 已提交
731
	int (*release) (struct inode *, struct file *);
732 733 734
	int (*fsync) (struct file *, struct dentry *, int datasync);
	int (*aio_fsync) (struct kiocb *, int datasync);
	int (*fasync) (int, struct file *, int);
L
Linus Torvalds 已提交
735
	int (*lock) (struct file *, int, struct file_lock *);
736 737 738 739 740 741 742
	ssize_t (*readv) (struct file *, const struct iovec *, unsigned long, loff_t *);
	ssize_t (*writev) (struct file *, const struct iovec *, unsigned long, loff_t *);
	ssize_t (*sendfile) (struct file *, loff_t *, size_t, read_actor_t, void *);
	ssize_t (*sendpage) (struct file *, struct page *, int, size_t, loff_t *, int);
	unsigned long (*get_unmapped_area)(struct file *, unsigned long, unsigned long, unsigned long, unsigned long);
	int (*check_flags)(int);
	int (*flock) (struct file *, int, struct file_lock *);
743 744
	ssize_t (*splice_write)(struct pipe_inode_info *, struct file *, size_t, unsigned int);
	ssize_t (*splice_read)(struct file *, struct pipe_inode_info *, size_t, unsigned int);
L
Linus Torvalds 已提交
745 746 747 748 749 750 751 752 753
};

Again, all methods are called without any locks being held, unless
otherwise noted.

  llseek: called when the VFS needs to move the file position index

  read: called by read(2) and related system calls

754 755
  aio_read: called by io_submit(2) and other asynchronous I/O operations

L
Linus Torvalds 已提交
756 757
  write: called by write(2) and related system calls

758 759
  aio_write: called by io_submit(2) and other asynchronous I/O operations

L
Linus Torvalds 已提交
760 761 762 763 764 765 766 767
  readdir: called when the VFS needs to read the directory contents

  poll: called by the VFS when a process wants to check if there is
	activity on this file and (optionally) go to sleep until there
	is activity. Called by the select(2) and poll(2) system calls

  ioctl: called by the ioctl(2) system call

768 769 770 771 772 773
  unlocked_ioctl: called by the ioctl(2) system call. Filesystems that do not
  	require the BKL should use this method instead of the ioctl() above.

  compat_ioctl: called by the ioctl(2) system call when 32 bit system calls
 	 are used on 64 bit kernels.

L
Linus Torvalds 已提交
774 775 776
  mmap: called by the mmap(2) system call

  open: called by the VFS when an inode should be opened. When the VFS
777 778 779 780 781 782 783 784 785 786
	opens a file, it creates a new "struct file". It then calls the
	open method for the newly allocated file structure. You might
	think that the open method really belongs in
	"struct inode_operations", and you may be right. I think it's
	done the way it is because it makes filesystems simpler to
	implement. The open() method is a good place to initialize the
	"private_data" member in the file structure if you want to point
	to a device structure

  flush: called by the close(2) system call to flush a file
L
Linus Torvalds 已提交
787 788 789 790 791 792 793 794

  release: called when the last reference to an open file is closed

  fsync: called by the fsync(2) system call

  fasync: called by the fcntl(2) system call when asynchronous
	(non-blocking) mode is enabled for a file

795 796 797 798 799 800 801 802 803 804 805 806 807 808 809
  lock: called by the fcntl(2) system call for F_GETLK, F_SETLK, and F_SETLKW
  	commands

  readv: called by the readv(2) system call

  writev: called by the writev(2) system call

  sendfile: called by the sendfile(2) system call

  get_unmapped_area: called by the mmap(2) system call

  check_flags: called by the fcntl(2) system call for F_SETFL command

  flock: called by the flock(2) system call

810 811 812 813 814 815
  splice_write: called by the VFS to splice data from a pipe to a file. This
		method is used by the splice(2) system call

  splice_read: called by the VFS to splice data from file to a pipe. This
	       method is used by the splice(2) system call

L
Linus Torvalds 已提交
816 817 818 819 820 821 822 823
Note that the file operations are implemented by the specific
filesystem in which the inode resides. When opening a device node
(character or block special) most filesystems will call special
support routines in the VFS which will locate the required device
driver information. These support routines replace the filesystem file
operations with those for the device driver, and then proceed to call
the new open() method for the file. This is how opening a device file
in the filesystem eventually ends up calling the device driver open()
824
method.
L
Linus Torvalds 已提交
825 826


827 828 829
Directory Entry Cache (dcache)
==============================

L
Linus Torvalds 已提交
830 831

struct dentry_operations
832
------------------------
L
Linus Torvalds 已提交
833 834 835 836 837

This describes how a filesystem can overload the standard dentry
operations. Dentries and the dcache are the domain of the VFS and the
individual filesystem implementations. Device drivers have no business
here. These methods may be set to NULL, as they are either optional or
838
the VFS uses a default. As of kernel 2.6.22, the following members are
L
Linus Torvalds 已提交
839 840 841
defined:

struct dentry_operations {
842
	int (*d_revalidate)(struct dentry *, struct nameidata *);
L
Linus Torvalds 已提交
843 844
	int (*d_hash) (struct dentry *, struct qstr *);
	int (*d_compare) (struct dentry *, struct qstr *, struct qstr *);
845
	int (*d_delete)(struct dentry *);
L
Linus Torvalds 已提交
846 847
	void (*d_release)(struct dentry *);
	void (*d_iput)(struct dentry *, struct inode *);
848
	char *(*d_dname)(struct dentry *, char *, int);
L
Linus Torvalds 已提交
849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870
};

  d_revalidate: called when the VFS needs to revalidate a dentry. This
	is called whenever a name look-up finds a dentry in the
	dcache. Most filesystems leave this as NULL, because all their
	dentries in the dcache are valid

  d_hash: called when the VFS adds a dentry to the hash table

  d_compare: called when a dentry should be compared with another

  d_delete: called when the last reference to a dentry is
	deleted. This means no-one is using the dentry, however it is
	still valid and in the dcache

  d_release: called when a dentry is really deallocated

  d_iput: called when a dentry loses its inode (just prior to its
	being deallocated). The default when this is NULL is that the
	VFS calls iput(). If you define this method, you must call
	iput() yourself

871
  d_dname: called when the pathname of a dentry should be generated.
872
	Useful for some pseudo filesystems (sockfs, pipefs, ...) to delay
873
	pathname generation. (Instead of doing it when dentry is created,
874
	it's done only when the path is needed.). Real filesystems probably
875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890
	dont want to use it, because their dentries are present in global
	dcache hash, so their hash should be an invariant. As no lock is
	held, d_dname() should not try to modify the dentry itself, unless
	appropriate SMP safety is used. CAUTION : d_path() logic is quite
	tricky. The correct way to return for example "Hello" is to put it
	at the end of the buffer, and returns a pointer to the first char.
	dynamic_dname() helper function is provided to take care of this.

Example :

static char *pipefs_dname(struct dentry *dent, char *buffer, int buflen)
{
	return dynamic_dname(dentry, buffer, buflen, "pipe:[%lu]",
				dentry->d_inode->i_ino);
}

L
Linus Torvalds 已提交
891 892 893 894
Each dentry has a pointer to its parent dentry, as well as a hash list
of child dentries. Child dentries are basically like files in a
directory.

895

896
Directory Entry Cache API
L
Linus Torvalds 已提交
897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915
--------------------------

There are a number of functions defined which permit a filesystem to
manipulate dentries:

  dget: open a new handle for an existing dentry (this just increments
	the usage count)

  dput: close a handle for a dentry (decrements the usage count). If
	the usage count drops to 0, the "d_delete" method is called
	and the dentry is placed on the unused list if the dentry is
	still in its parents hash list. Putting the dentry on the
	unused list just means that if the system needs some RAM, it
	goes through the unused list of dentries and deallocates them.
	If the dentry has already been unhashed and the usage count
	drops to 0, in this case the dentry is deallocated after the
	"d_delete" method is called

  d_drop: this unhashes a dentry from its parents hash list. A
916
	subsequent call to dput() will deallocate the dentry if its
L
Linus Torvalds 已提交
917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936
	usage count drops to 0

  d_delete: delete a dentry. If there are no other open references to
	the dentry then the dentry is turned into a negative dentry
	(the d_iput() method is called). If there are other
	references, then d_drop() is called instead

  d_add: add a dentry to its parents hash list and then calls
	d_instantiate()

  d_instantiate: add a dentry to the alias hash list for the inode and
	updates the "d_inode" member. The "i_count" member in the
	inode structure should be set/incremented. If the inode
	pointer is NULL, the dentry is called a "negative
	dentry". This function is commonly called when an inode is
	created for an existing negative dentry

  d_lookup: look up a dentry given its parent and path name component
	It looks up the child of that given name from the dcache
	hash table. If it is found, the reference count is incremented
937
	and the dentry is returned. The caller must use dput()
L
Linus Torvalds 已提交
938 939
	to free the dentry when it finishes using it.

940 941
For further information on dentry locking, please refer to the document
Documentation/filesystems/dentry-locking.txt.
942

943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985
Mount Options
=============

Parsing options
---------------

On mount and remount the filesystem is passed a string containing a
comma separated list of mount options.  The options can have either of
these forms:

  option
  option=value

The <linux/parser.h> header defines an API that helps parse these
options.  There are plenty of examples on how to use it in existing
filesystems.

Showing options
---------------

If a filesystem accepts mount options, it must define show_options()
to show all the currently active options.  The rules are:

  - options MUST be shown which are not default or their values differ
    from the default

  - options MAY be shown which are enabled by default or have their
    default value

Options used only internally between a mount helper and the kernel
(such as file descriptors), or which only have an effect during the
mounting (such as ones controlling the creation of a journal) are exempt
from the above rules.

The underlying reason for the above rules is to make sure, that a
mount can be accurately replicated (e.g. umounting and mounting again)
based on the information found in /proc/mounts.

A simple method of saving options at mount/remount time and showing
them is provided with the save_mount_options() and
generic_show_options() helper functions.  Please note, that using
these may have drawbacks.  For more info see header comments for these
functions in fs/namespace.c.
986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003

Resources
=========

(Note some of these resources are not up-to-date with the latest kernel
 version.)

Creating Linux virtual filesystems. 2002
    <http://lwn.net/Articles/13325/>

The Linux Virtual File-system Layer by Neil Brown. 1999
    <http://www.cse.unsw.edu.au/~neilb/oss/linux-commentary/vfs.html>

A tour of the Linux VFS by Michael K. Johnson. 1996
    <http://www.tldp.org/LDP/khg/HyperNews/get/fs/vfstour.html>

A small trail through the Linux kernel by Andries Brouwer. 2001
    <http://www.win.tue.nl/~aeb/linux/vfs/trail.html>