1 .. SPDX-License-Identifier: GPL-2.0
3 ===================================
4 File management in the Linux kernel
5 ===================================
7 This document describes how locking for files (struct file)
8 and file descriptor table (struct files) works.
10 Up until 2.6.12, the file descriptor table has been protected
11 with a lock (files->file_lock) and reference count (files->count).
12 ->file_lock protected accesses to all the file related fields
13 of the table. ->count was used for sharing the file descriptor
14 table between tasks cloned with CLONE_FILES flag. Typically
15 this would be the case for posix threads. As with the common
16 refcounting model in the kernel, the last task doing
17 a put_files_struct() frees the file descriptor (fd) table.
18 The files (struct file) themselves are protected using
19 reference count (->f_count).
21 In the new lock-free model of file descriptor management,
22 the reference counting is similar, but the locking is
23 based on RCU. The file descriptor table contains multiple
24 elements - the fd sets (open_fds and close_on_exec, the
25 array of file pointers, the sizes of the sets and the array
26 etc.). In order for the updates to appear atomic to
27 a lock-free reader, all the elements of the file descriptor
28 table are in a separate structure - struct fdtable.
29 files_struct contains a pointer to struct fdtable through
30 which the actual fd table is accessed. Initially the
31 fdtable is embedded in files_struct itself. On a subsequent
32 expansion of fdtable, a new fdtable structure is allocated
33 and files->fdtab points to the new structure. The fdtable
34 structure is freed with RCU and lock-free readers either
35 see the old fdtable or the new fdtable making the update
36 appear atomic. Here are the locking rules for
37 the fdtable structure -
39 1. All references to the fdtable must be done through
40 the files_fdtable() macro::
46 fdt = files_fdtable(files);
48 if (n <= fdt->max_fds)
53 files_fdtable() uses rcu_dereference() macro which takes care of
54 the memory barrier requirements for lock-free dereference.
55 The fdtable pointer must be read within the read-side
58 2. Reading of the fdtable as described above must be protected
59 by rcu_read_lock()/rcu_read_unlock().
61 3. For any update to the fd table, files->file_lock must
64 4. To look up the file structure given an fd, a reader
65 must use either lookup_fd_rcu() or files_lookup_fd_rcu() APIs. These
66 take care of barrier requirements due to lock-free lookup.
73 file = lookup_fd_rcu(fd);
80 5. Handling of the file structures is special. Since the look-up
81 of the fd (fget()/fget_light()) are lock-free, it is possible
82 that look-up may race with the last put() operation on the
83 file structure. This is avoided using atomic_long_inc_not_zero()
87 file = files_lookup_fd_rcu(files, fd);
89 if (atomic_long_inc_not_zero(&file->f_count))
92 /* Didn't get the reference, someone's freed */
99 atomic_long_inc_not_zero() detects if refcounts is already zero or
100 goes to zero during increment. If it does, we fail
103 6. Since both fdtable and file structures can be looked up
104 lock-free, they must be installed using rcu_assign_pointer()
105 API. If they are looked up lock-free, rcu_dereference()
106 must be used. However it is advisable to use files_fdtable()
107 and lookup_fd_rcu()/files_lookup_fd_rcu() which take care of these issues.
109 7. While updating, the fdtable pointer must be looked up while
110 holding files->file_lock. If ->file_lock is dropped, then
111 another thread expand the files thereby creating a new
112 fdtable and making the earlier fdtable pointer stale.
116 spin_lock(&files->file_lock);
117 fd = locate_fd(files, file, start);
119 /* locate_fd() may have expanded fdtable, load the ptr */
120 fdt = files_fdtable(files);
121 __set_open_fd(fd, fdt);
122 __clear_close_on_exec(fd, fdt);
123 spin_unlock(&files->file_lock);
126 Since locate_fd() can drop ->file_lock (and reacquire ->file_lock),
127 the fdtable pointer (fdt) must be loaded after locate_fd().