Exercises


1:

Under what circumstances would you use the inode i_hash field as opposed to the i_list field? Why have both a hash list and a linear list for the same structures?

2:

Of all the file structures we've seen, name the ones that have corresponding data structures in the hard disk.

3:

For what types of operations are dentry objects used? Why not just use inodes?

4:

What is the association between a file descriptor and a file structure? Is it one-to-one? Many-to-one? One-to-many?

5:

What is the use of the fd_set structure?

6:

What type of data structure ensures that the page cache operates at maximum speed?

7:

Suppose that you are writing a new filesystem driver. You're replacing the ext2 filesystem driver with a new driver (media_fs) that optimizes file I/O for multimedia. Where would you make changes to the Linux kernel to ensure that your new driver is used instead of the ext2 driver?

8:

How does a page get dirty? How does a dirty page get written to disk?




The Linux Kernel Primer. A Top-Down Approach for x86 and PowerPC Architectures
The Linux Kernel Primer. A Top-Down Approach for x86 and PowerPC Architectures
ISBN: 131181637
EAN: N/A
Year: 2005
Pages: 134

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net