Courses/Computer Science/CPSC 457.F2013/Lecture Notes/VFS

From wiki.ucalgary.ca
Jump to: navigation, search

An Overview of The Linux VFS Layer

The virtual file system interface sits right below Linux's implementation of the file I/O API defined by the file-related system calls. In this session, we will consider how the VFS abstracts out and supplies common operations.

Key Idea: This API simultaneously supports the conventional semantics and syntax of the Unix file--related system calls and provides a place for the kernel to delegate to the specific file system responsible for managing the file handle referenced by the syscall API. Hence, you have two APIs sitting one on top of the other (syscall-->VFS), enabling both (1) stability of user-level programs, (2) stability of the syscall definitions and core functionality and (3) specialization for specific data and file system types.

  • major data structures
  • support for delegating operations to specific file system implementations
  • support for canonicalization and path lookup

Major Kernel Data Structures Supporting File Systems

struct super_block

struct file_operations

struct inode_operations

struct super_operations

struct inode

Major Kernel Data Structures Supporting Files

struct inode (The generic in-memory inode data structure helps unify specific file systems with particular files, hence I list it under both categories)

struct file

struct path

struct dentry

Major Functions of the VFS

...

Example: The Ext4 inode

ext4 inode (observe how this represents the "on disk" inode). Observe the indexing block array

A Journey From Open to Read to Close

Observe how it creates a file descriptor (a small integer) based on the file name / path and then associates that with a "struct file" kernel data structure, so that the task_struct's "files" member has an idea of what files the process currently has open. 

[locasto@csl ~]$ ulimit -a
core file size          (blocks, -c) 0
data seg size           (kbytes, -d) unlimited
scheduling priority             (-e) 0
file size               (blocks, -f) unlimited
pending signals                 (-i) 127443
max locked memory       (kbytes, -l) 64
max memory size         (kbytes, -m) unlimited
open files                      (-n) 1024
pipe size            (512 bytes, -p) 8
POSIX message queues     (bytes, -q) 819200
real-time priority              (-r) 0
stack size              (kbytes, -s) 10240
cpu time               (seconds, -t) unlimited
max user processes              (-u) 1024
virtual memory          (kbytes, -v) unlimited
file locks                      (-x) unlimited
[locasto@csl ~]$


The "fd_install" function associates the new "struct file" with the list of open files in task_struct's "files" list. 

291               if (file->f_op->read)
292                        ret = file->f_op->read(file, buf, count, pos);
293                else
294                        ret = do_sync_read(file, buf, count, pos);

Look at how this code uses the file descriptor's f_op's function pointer table's "read" member.

Observe how this code uses the aio_read() file operation function.

To tie this all together, what if the "file->f_op->read" member is not NULL? In this case, the VFS delegates to the file system's specific read routine. In the case of ext2, where/how is this function pointer assigned?

We see that "read" is pointed to the kernel's "do_sync_read" routine, which we've seen above. And it's aio_read function points to:

which handles asynchronous I/O and delegates to the block layer and its built-in caching (i.e., keeping "disk" data in memory so access if fast).

This can call:

Scribe Notes

Reading

LKD, Chapter 13

Retrieved from "http://wiki.ucalgary.ca/index.php?title=Courses/Computer_Science/CPSC_457.F2013/Lecture_Notes/VFS&oldid=67730"