Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * linux/fs/locks.c | |
4 | * | |
e9728cc7 BF |
5 | * We implement four types of file locks: BSD locks, posix locks, open |
6 | * file description locks, and leases. For details about BSD locks, | |
7 | * see the flock(2) man page; for details about the other three, see | |
8 | * fcntl(2). | |
1da177e4 | 9 | * |
fd7732e0 N |
10 | * |
11 | * Locking conflicts and dependencies: | |
12 | * If multiple threads attempt to lock the same byte (or flock the same file) | |
13 | * only one can be granted the lock, and other must wait their turn. | |
14 | * The first lock has been "applied" or "granted", the others are "waiting" | |
15 | * and are "blocked" by the "applied" lock.. | |
16 | * | |
17 | * Waiting and applied locks are all kept in trees whose properties are: | |
18 | * | |
19 | * - the root of a tree may be an applied or waiting lock. | |
20 | * - every other node in the tree is a waiting lock that | |
21 | * conflicts with every ancestor of that node. | |
22 | * | |
23 | * Every such tree begins life as a waiting singleton which obviously | |
24 | * satisfies the above properties. | |
25 | * | |
26 | * The only ways we modify trees preserve these properties: | |
27 | * | |
28 | * 1. We may add a new leaf node, but only after first verifying that it | |
29 | * conflicts with all of its ancestors. | |
30 | * 2. We may remove the root of a tree, creating a new singleton | |
31 | * tree from the root and N new trees rooted in the immediate | |
32 | * children. | |
33 | * 3. If the root of a tree is not currently an applied lock, we may | |
34 | * apply it (if possible). | |
35 | * 4. We may upgrade the root of the tree (either extend its range, | |
36 | * or upgrade its entire range from read to write). | |
37 | * | |
38 | * When an applied lock is modified in a way that reduces or downgrades any | |
39 | * part of its range, we remove all its children (2 above). This particularly | |
40 | * happens when a lock is unlocked. | |
41 | * | |
42 | * For each of those child trees we "wake up" the thread which is | |
43 | * waiting for the lock so it can continue handling as follows: if the | |
44 | * root of the tree applies, we do so (3). If it doesn't, it must | |
45 | * conflict with some applied lock. We remove (wake up) all of its children | |
46 | * (2), and add it is a new leaf to the tree rooted in the applied | |
47 | * lock (1). We then repeat the process recursively with those | |
48 | * children. | |
49 | * | |
1da177e4 LT |
50 | */ |
51 | ||
52 | #include <linux/capability.h> | |
53 | #include <linux/file.h> | |
9f3acc31 | 54 | #include <linux/fdtable.h> |
1da177e4 LT |
55 | #include <linux/fs.h> |
56 | #include <linux/init.h> | |
1da177e4 LT |
57 | #include <linux/security.h> |
58 | #include <linux/slab.h> | |
1da177e4 LT |
59 | #include <linux/syscalls.h> |
60 | #include <linux/time.h> | |
4fb3a538 | 61 | #include <linux/rcupdate.h> |
ab1f1611 | 62 | #include <linux/pid_namespace.h> |
48f74186 | 63 | #include <linux/hashtable.h> |
7012b02a | 64 | #include <linux/percpu.h> |
dd81faa8 | 65 | #include <linux/sysctl.h> |
1da177e4 | 66 | |
62af4f1f JL |
67 | #define CREATE_TRACE_POINTS |
68 | #include <trace/events/filelock.h> | |
69 | ||
7c0f6ba6 | 70 | #include <linux/uaccess.h> |
1da177e4 LT |
71 | |
72 | #define IS_POSIX(fl) (fl->fl_flags & FL_POSIX) | |
73 | #define IS_FLOCK(fl) (fl->fl_flags & FL_FLOCK) | |
11afe9f7 | 74 | #define IS_LEASE(fl) (fl->fl_flags & (FL_LEASE|FL_DELEG|FL_LAYOUT)) |
cff2fce5 | 75 | #define IS_OFDLCK(fl) (fl->fl_flags & FL_OFDLCK) |
9d5b86ac | 76 | #define IS_REMOTELCK(fl) (fl->fl_pid <= 0) |
1da177e4 | 77 | |
ab83fa4b BF |
78 | static bool lease_breaking(struct file_lock *fl) |
79 | { | |
778fc546 BF |
80 | return fl->fl_flags & (FL_UNLOCK_PENDING | FL_DOWNGRADE_PENDING); |
81 | } | |
82 | ||
83 | static int target_leasetype(struct file_lock *fl) | |
84 | { | |
85 | if (fl->fl_flags & FL_UNLOCK_PENDING) | |
86 | return F_UNLCK; | |
87 | if (fl->fl_flags & FL_DOWNGRADE_PENDING) | |
88 | return F_RDLCK; | |
89 | return fl->fl_type; | |
ab83fa4b BF |
90 | } |
91 | ||
dd81faa8 LC |
92 | static int leases_enable = 1; |
93 | static int lease_break_time = 45; | |
94 | ||
95 | #ifdef CONFIG_SYSCTL | |
96 | static struct ctl_table locks_sysctls[] = { | |
97 | { | |
98 | .procname = "leases-enable", | |
99 | .data = &leases_enable, | |
100 | .maxlen = sizeof(int), | |
101 | .mode = 0644, | |
102 | .proc_handler = proc_dointvec, | |
103 | }, | |
104 | #ifdef CONFIG_MMU | |
105 | { | |
106 | .procname = "lease-break-time", | |
107 | .data = &lease_break_time, | |
108 | .maxlen = sizeof(int), | |
109 | .mode = 0644, | |
110 | .proc_handler = proc_dointvec, | |
111 | }, | |
112 | #endif /* CONFIG_MMU */ | |
113 | {} | |
114 | }; | |
115 | ||
116 | static int __init init_fs_locks_sysctls(void) | |
117 | { | |
118 | register_sysctl_init("fs", locks_sysctls); | |
119 | return 0; | |
120 | } | |
121 | early_initcall(init_fs_locks_sysctls); | |
122 | #endif /* CONFIG_SYSCTL */ | |
1da177e4 | 123 | |
1c8c601a | 124 | /* |
7012b02a | 125 | * The global file_lock_list is only used for displaying /proc/locks, so we |
7c3f654d PZ |
126 | * keep a list on each CPU, with each list protected by its own spinlock. |
127 | * Global serialization is done using file_rwsem. | |
128 | * | |
129 | * Note that alterations to the list also require that the relevant flc_lock is | |
130 | * held. | |
1c8c601a | 131 | */ |
7c3f654d PZ |
132 | struct file_lock_list_struct { |
133 | spinlock_t lock; | |
134 | struct hlist_head hlist; | |
135 | }; | |
136 | static DEFINE_PER_CPU(struct file_lock_list_struct, file_lock_list); | |
aba37660 | 137 | DEFINE_STATIC_PERCPU_RWSEM(file_rwsem); |
88974691 | 138 | |
eb82dd39 | 139 | |
1c8c601a | 140 | /* |
48f74186 | 141 | * The blocked_hash is used to find POSIX lock loops for deadlock detection. |
7b2296af | 142 | * It is protected by blocked_lock_lock. |
48f74186 JL |
143 | * |
144 | * We hash locks by lockowner in order to optimize searching for the lock a | |
145 | * particular lockowner is waiting on. | |
146 | * | |
147 | * FIXME: make this value scale via some heuristic? We generally will want more | |
148 | * buckets when we have more lockowners holding locks, but that's a little | |
149 | * difficult to determine without knowing what the workload will look like. | |
1c8c601a | 150 | */ |
48f74186 JL |
151 | #define BLOCKED_HASH_BITS 7 |
152 | static DEFINE_HASHTABLE(blocked_hash, BLOCKED_HASH_BITS); | |
88974691 | 153 | |
1c8c601a | 154 | /* |
7b2296af JL |
155 | * This lock protects the blocked_hash. Generally, if you're accessing it, you |
156 | * want to be holding this lock. | |
1c8c601a | 157 | * |
ada5c1da N |
158 | * In addition, it also protects the fl->fl_blocked_requests list, and the |
159 | * fl->fl_blocker pointer for file_lock structures that are acting as lock | |
160 | * requests (in contrast to those that are acting as records of acquired locks). | |
1c8c601a JL |
161 | * |
162 | * Note that when we acquire this lock in order to change the above fields, | |
6109c850 | 163 | * we often hold the flc_lock as well. In certain cases, when reading the fields |
1c8c601a | 164 | * protected by this lock, we can skip acquiring it iff we already hold the |
6109c850 | 165 | * flc_lock. |
1c8c601a | 166 | */ |
7b2296af | 167 | static DEFINE_SPINLOCK(blocked_lock_lock); |
1da177e4 | 168 | |
4a075e39 | 169 | static struct kmem_cache *flctx_cache __read_mostly; |
e18b890b | 170 | static struct kmem_cache *filelock_cache __read_mostly; |
1da177e4 | 171 | |
4a075e39 | 172 | static struct file_lock_context * |
5c1c669a | 173 | locks_get_lock_context(struct inode *inode, int type) |
4a075e39 | 174 | { |
128a3785 | 175 | struct file_lock_context *ctx; |
4a075e39 | 176 | |
128a3785 DV |
177 | /* paired with cmpxchg() below */ |
178 | ctx = smp_load_acquire(&inode->i_flctx); | |
179 | if (likely(ctx) || type == F_UNLCK) | |
4a075e39 JL |
180 | goto out; |
181 | ||
128a3785 DV |
182 | ctx = kmem_cache_alloc(flctx_cache, GFP_KERNEL); |
183 | if (!ctx) | |
4a075e39 JL |
184 | goto out; |
185 | ||
128a3785 DV |
186 | spin_lock_init(&ctx->flc_lock); |
187 | INIT_LIST_HEAD(&ctx->flc_flock); | |
188 | INIT_LIST_HEAD(&ctx->flc_posix); | |
189 | INIT_LIST_HEAD(&ctx->flc_lease); | |
4a075e39 JL |
190 | |
191 | /* | |
192 | * Assign the pointer if it's not already assigned. If it is, then | |
193 | * free the context we just allocated. | |
194 | */ | |
128a3785 DV |
195 | if (cmpxchg(&inode->i_flctx, NULL, ctx)) { |
196 | kmem_cache_free(flctx_cache, ctx); | |
197 | ctx = smp_load_acquire(&inode->i_flctx); | |
198 | } | |
4a075e39 | 199 | out: |
1890910f | 200 | trace_locks_get_lock_context(inode, type, ctx); |
128a3785 | 201 | return ctx; |
4a075e39 JL |
202 | } |
203 | ||
e24dadab JL |
204 | static void |
205 | locks_dump_ctx_list(struct list_head *list, char *list_type) | |
206 | { | |
207 | struct file_lock *fl; | |
208 | ||
209 | list_for_each_entry(fl, list, fl_list) { | |
210 | pr_warn("%s: fl_owner=%p fl_flags=0x%x fl_type=0x%x fl_pid=%u\n", list_type, fl->fl_owner, fl->fl_flags, fl->fl_type, fl->fl_pid); | |
211 | } | |
212 | } | |
213 | ||
214 | static void | |
215 | locks_check_ctx_lists(struct inode *inode) | |
216 | { | |
217 | struct file_lock_context *ctx = inode->i_flctx; | |
218 | ||
219 | if (unlikely(!list_empty(&ctx->flc_flock) || | |
220 | !list_empty(&ctx->flc_posix) || | |
221 | !list_empty(&ctx->flc_lease))) { | |
222 | pr_warn("Leaked locks on dev=0x%x:0x%x ino=0x%lx:\n", | |
223 | MAJOR(inode->i_sb->s_dev), MINOR(inode->i_sb->s_dev), | |
224 | inode->i_ino); | |
225 | locks_dump_ctx_list(&ctx->flc_flock, "FLOCK"); | |
226 | locks_dump_ctx_list(&ctx->flc_posix, "POSIX"); | |
227 | locks_dump_ctx_list(&ctx->flc_lease, "LEASE"); | |
228 | } | |
229 | } | |
230 | ||
3953704f BC |
231 | static void |
232 | locks_check_ctx_file_list(struct file *filp, struct list_head *list, | |
233 | char *list_type) | |
234 | { | |
235 | struct file_lock *fl; | |
236 | struct inode *inode = locks_inode(filp); | |
237 | ||
238 | list_for_each_entry(fl, list, fl_list) | |
239 | if (fl->fl_file == filp) | |
240 | pr_warn("Leaked %s lock on dev=0x%x:0x%x ino=0x%lx " | |
241 | " fl_owner=%p fl_flags=0x%x fl_type=0x%x fl_pid=%u\n", | |
242 | list_type, MAJOR(inode->i_sb->s_dev), | |
243 | MINOR(inode->i_sb->s_dev), inode->i_ino, | |
244 | fl->fl_owner, fl->fl_flags, fl->fl_type, fl->fl_pid); | |
245 | } | |
246 | ||
4a075e39 | 247 | void |
f27a0fe0 | 248 | locks_free_lock_context(struct inode *inode) |
4a075e39 | 249 | { |
f27a0fe0 JL |
250 | struct file_lock_context *ctx = inode->i_flctx; |
251 | ||
e24dadab JL |
252 | if (unlikely(ctx)) { |
253 | locks_check_ctx_lists(inode); | |
4a075e39 JL |
254 | kmem_cache_free(flctx_cache, ctx); |
255 | } | |
256 | } | |
257 | ||
ee19cc40 | 258 | static void locks_init_lock_heads(struct file_lock *fl) |
a51cb91d | 259 | { |
139ca04e | 260 | INIT_HLIST_NODE(&fl->fl_link); |
6dee60f6 | 261 | INIT_LIST_HEAD(&fl->fl_list); |
ada5c1da N |
262 | INIT_LIST_HEAD(&fl->fl_blocked_requests); |
263 | INIT_LIST_HEAD(&fl->fl_blocked_member); | |
ee19cc40 | 264 | init_waitqueue_head(&fl->fl_wait); |
a51cb91d MS |
265 | } |
266 | ||
1da177e4 | 267 | /* Allocate an empty lock structure. */ |
c5b1f0d9 | 268 | struct file_lock *locks_alloc_lock(void) |
1da177e4 | 269 | { |
ee19cc40 | 270 | struct file_lock *fl = kmem_cache_zalloc(filelock_cache, GFP_KERNEL); |
a51cb91d MS |
271 | |
272 | if (fl) | |
ee19cc40 | 273 | locks_init_lock_heads(fl); |
a51cb91d MS |
274 | |
275 | return fl; | |
1da177e4 | 276 | } |
c5b1f0d9 | 277 | EXPORT_SYMBOL_GPL(locks_alloc_lock); |
1da177e4 | 278 | |
a9e61e25 | 279 | void locks_release_private(struct file_lock *fl) |
47831f35 | 280 | { |
5926459e N |
281 | BUG_ON(waitqueue_active(&fl->fl_wait)); |
282 | BUG_ON(!list_empty(&fl->fl_list)); | |
283 | BUG_ON(!list_empty(&fl->fl_blocked_requests)); | |
284 | BUG_ON(!list_empty(&fl->fl_blocked_member)); | |
285 | BUG_ON(!hlist_unhashed(&fl->fl_link)); | |
286 | ||
47831f35 TM |
287 | if (fl->fl_ops) { |
288 | if (fl->fl_ops->fl_release_private) | |
289 | fl->fl_ops->fl_release_private(fl); | |
290 | fl->fl_ops = NULL; | |
291 | } | |
47831f35 | 292 | |
5c97d7b1 | 293 | if (fl->fl_lmops) { |
cae80b30 JL |
294 | if (fl->fl_lmops->lm_put_owner) { |
295 | fl->fl_lmops->lm_put_owner(fl->fl_owner); | |
296 | fl->fl_owner = NULL; | |
297 | } | |
5c97d7b1 KM |
298 | fl->fl_lmops = NULL; |
299 | } | |
47831f35 | 300 | } |
a9e61e25 | 301 | EXPORT_SYMBOL_GPL(locks_release_private); |
47831f35 | 302 | |
1da177e4 | 303 | /* Free a lock which is not in use. */ |
05fa3135 | 304 | void locks_free_lock(struct file_lock *fl) |
1da177e4 | 305 | { |
47831f35 | 306 | locks_release_private(fl); |
1da177e4 LT |
307 | kmem_cache_free(filelock_cache, fl); |
308 | } | |
05fa3135 | 309 | EXPORT_SYMBOL(locks_free_lock); |
1da177e4 | 310 | |
ed9814d8 JL |
311 | static void |
312 | locks_dispose_list(struct list_head *dispose) | |
313 | { | |
314 | struct file_lock *fl; | |
315 | ||
316 | while (!list_empty(dispose)) { | |
6dee60f6 JL |
317 | fl = list_first_entry(dispose, struct file_lock, fl_list); |
318 | list_del_init(&fl->fl_list); | |
ed9814d8 JL |
319 | locks_free_lock(fl); |
320 | } | |
321 | } | |
322 | ||
1da177e4 LT |
323 | void locks_init_lock(struct file_lock *fl) |
324 | { | |
ee19cc40 MS |
325 | memset(fl, 0, sizeof(struct file_lock)); |
326 | locks_init_lock_heads(fl); | |
1da177e4 | 327 | } |
1da177e4 LT |
328 | EXPORT_SYMBOL(locks_init_lock); |
329 | ||
1da177e4 LT |
330 | /* |
331 | * Initialize a new lock from an existing file_lock structure. | |
332 | */ | |
3fe0fff1 | 333 | void locks_copy_conflock(struct file_lock *new, struct file_lock *fl) |
1da177e4 LT |
334 | { |
335 | new->fl_owner = fl->fl_owner; | |
336 | new->fl_pid = fl->fl_pid; | |
0996905f | 337 | new->fl_file = NULL; |
1da177e4 LT |
338 | new->fl_flags = fl->fl_flags; |
339 | new->fl_type = fl->fl_type; | |
340 | new->fl_start = fl->fl_start; | |
341 | new->fl_end = fl->fl_end; | |
f328296e | 342 | new->fl_lmops = fl->fl_lmops; |
0996905f | 343 | new->fl_ops = NULL; |
f328296e KM |
344 | |
345 | if (fl->fl_lmops) { | |
346 | if (fl->fl_lmops->lm_get_owner) | |
cae80b30 | 347 | fl->fl_lmops->lm_get_owner(fl->fl_owner); |
f328296e | 348 | } |
0996905f | 349 | } |
3fe0fff1 | 350 | EXPORT_SYMBOL(locks_copy_conflock); |
0996905f TM |
351 | |
352 | void locks_copy_lock(struct file_lock *new, struct file_lock *fl) | |
353 | { | |
566709bd JL |
354 | /* "new" must be a freshly-initialized lock */ |
355 | WARN_ON_ONCE(new->fl_ops); | |
0996905f | 356 | |
3fe0fff1 | 357 | locks_copy_conflock(new, fl); |
f328296e | 358 | |
0996905f | 359 | new->fl_file = fl->fl_file; |
1da177e4 | 360 | new->fl_ops = fl->fl_ops; |
47831f35 | 361 | |
f328296e KM |
362 | if (fl->fl_ops) { |
363 | if (fl->fl_ops->fl_copy_lock) | |
364 | fl->fl_ops->fl_copy_lock(new, fl); | |
365 | } | |
1da177e4 | 366 | } |
1da177e4 LT |
367 | EXPORT_SYMBOL(locks_copy_lock); |
368 | ||
5946c431 N |
369 | static void locks_move_blocks(struct file_lock *new, struct file_lock *fl) |
370 | { | |
371 | struct file_lock *f; | |
372 | ||
373 | /* | |
374 | * As ctx->flc_lock is held, new requests cannot be added to | |
375 | * ->fl_blocked_requests, so we don't need a lock to check if it | |
376 | * is empty. | |
377 | */ | |
378 | if (list_empty(&fl->fl_blocked_requests)) | |
379 | return; | |
380 | spin_lock(&blocked_lock_lock); | |
381 | list_splice_init(&fl->fl_blocked_requests, &new->fl_blocked_requests); | |
bf77ae4c | 382 | list_for_each_entry(f, &new->fl_blocked_requests, fl_blocked_member) |
5946c431 N |
383 | f->fl_blocker = new; |
384 | spin_unlock(&blocked_lock_lock); | |
385 | } | |
386 | ||
1da177e4 | 387 | static inline int flock_translate_cmd(int cmd) { |
1da177e4 LT |
388 | switch (cmd) { |
389 | case LOCK_SH: | |
390 | return F_RDLCK; | |
391 | case LOCK_EX: | |
392 | return F_WRLCK; | |
393 | case LOCK_UN: | |
394 | return F_UNLCK; | |
395 | } | |
396 | return -EINVAL; | |
397 | } | |
398 | ||
399 | /* Fill in a file_lock structure with an appropriate FLOCK lock. */ | |
6e129d00 | 400 | static struct file_lock * |
d6367d62 | 401 | flock_make_lock(struct file *filp, unsigned int cmd, struct file_lock *fl) |
1da177e4 | 402 | { |
1da177e4 | 403 | int type = flock_translate_cmd(cmd); |
6e129d00 | 404 | |
1da177e4 | 405 | if (type < 0) |
6e129d00 | 406 | return ERR_PTR(type); |
7bbd1fc0 | 407 | |
d6367d62 N |
408 | if (fl == NULL) { |
409 | fl = locks_alloc_lock(); | |
410 | if (fl == NULL) | |
411 | return ERR_PTR(-ENOMEM); | |
412 | } else { | |
413 | locks_init_lock(fl); | |
414 | } | |
1da177e4 LT |
415 | |
416 | fl->fl_file = filp; | |
73a8f5f7 | 417 | fl->fl_owner = filp; |
1da177e4 LT |
418 | fl->fl_pid = current->tgid; |
419 | fl->fl_flags = FL_FLOCK; | |
420 | fl->fl_type = type; | |
421 | fl->fl_end = OFFSET_MAX; | |
7bbd1fc0 | 422 | |
6e129d00 | 423 | return fl; |
1da177e4 LT |
424 | } |
425 | ||
0ec4f431 | 426 | static int assign_type(struct file_lock *fl, long type) |
1da177e4 LT |
427 | { |
428 | switch (type) { | |
429 | case F_RDLCK: | |
430 | case F_WRLCK: | |
431 | case F_UNLCK: | |
432 | fl->fl_type = type; | |
433 | break; | |
434 | default: | |
435 | return -EINVAL; | |
436 | } | |
437 | return 0; | |
438 | } | |
439 | ||
ef12e72a BF |
440 | static int flock64_to_posix_lock(struct file *filp, struct file_lock *fl, |
441 | struct flock64 *l) | |
1da177e4 | 442 | { |
1da177e4 | 443 | switch (l->l_whence) { |
f5579f8c | 444 | case SEEK_SET: |
ef12e72a | 445 | fl->fl_start = 0; |
1da177e4 | 446 | break; |
f5579f8c | 447 | case SEEK_CUR: |
ef12e72a | 448 | fl->fl_start = filp->f_pos; |
1da177e4 | 449 | break; |
f5579f8c | 450 | case SEEK_END: |
ef12e72a | 451 | fl->fl_start = i_size_read(file_inode(filp)); |
1da177e4 LT |
452 | break; |
453 | default: | |
454 | return -EINVAL; | |
455 | } | |
ef12e72a BF |
456 | if (l->l_start > OFFSET_MAX - fl->fl_start) |
457 | return -EOVERFLOW; | |
458 | fl->fl_start += l->l_start; | |
459 | if (fl->fl_start < 0) | |
460 | return -EINVAL; | |
1da177e4 LT |
461 | |
462 | /* POSIX-1996 leaves the case l->l_len < 0 undefined; | |
463 | POSIX-2001 defines it. */ | |
4c780a46 | 464 | if (l->l_len > 0) { |
ef12e72a BF |
465 | if (l->l_len - 1 > OFFSET_MAX - fl->fl_start) |
466 | return -EOVERFLOW; | |
16238415 | 467 | fl->fl_end = fl->fl_start + (l->l_len - 1); |
ef12e72a | 468 | |
4c780a46 | 469 | } else if (l->l_len < 0) { |
ef12e72a | 470 | if (fl->fl_start + l->l_len < 0) |
4c780a46 | 471 | return -EINVAL; |
ef12e72a BF |
472 | fl->fl_end = fl->fl_start - 1; |
473 | fl->fl_start += l->l_len; | |
474 | } else | |
475 | fl->fl_end = OFFSET_MAX; | |
476 | ||
1da177e4 LT |
477 | fl->fl_owner = current->files; |
478 | fl->fl_pid = current->tgid; | |
479 | fl->fl_file = filp; | |
480 | fl->fl_flags = FL_POSIX; | |
481 | fl->fl_ops = NULL; | |
482 | fl->fl_lmops = NULL; | |
483 | ||
484 | return assign_type(fl, l->l_type); | |
485 | } | |
486 | ||
ef12e72a BF |
487 | /* Verify a "struct flock" and copy it to a "struct file_lock" as a POSIX |
488 | * style lock. | |
489 | */ | |
490 | static int flock_to_posix_lock(struct file *filp, struct file_lock *fl, | |
491 | struct flock *l) | |
1da177e4 | 492 | { |
ef12e72a BF |
493 | struct flock64 ll = { |
494 | .l_type = l->l_type, | |
495 | .l_whence = l->l_whence, | |
496 | .l_start = l->l_start, | |
497 | .l_len = l->l_len, | |
498 | }; | |
499 | ||
500 | return flock64_to_posix_lock(filp, fl, &ll); | |
1da177e4 | 501 | } |
1da177e4 LT |
502 | |
503 | /* default lease lock manager operations */ | |
4d01b7f5 JL |
504 | static bool |
505 | lease_break_callback(struct file_lock *fl) | |
1da177e4 LT |
506 | { |
507 | kill_fasync(&fl->fl_fasync, SIGIO, POLL_MSG); | |
4d01b7f5 | 508 | return false; |
1da177e4 LT |
509 | } |
510 | ||
1c7dd2ff JL |
511 | static void |
512 | lease_setup(struct file_lock *fl, void **priv) | |
513 | { | |
514 | struct file *filp = fl->fl_file; | |
515 | struct fasync_struct *fa = *priv; | |
516 | ||
517 | /* | |
518 | * fasync_insert_entry() returns the old entry if any. If there was no | |
519 | * old entry, then it used "priv" and inserted it into the fasync list. | |
520 | * Clear the pointer to indicate that it shouldn't be freed. | |
521 | */ | |
522 | if (!fasync_insert_entry(fa->fa_fd, filp, &fl->fl_fasync, fa)) | |
523 | *priv = NULL; | |
524 | ||
01919134 | 525 | __f_setown(filp, task_pid(current), PIDTYPE_TGID, 0); |
1c7dd2ff JL |
526 | } |
527 | ||
7b021967 | 528 | static const struct lock_manager_operations lease_manager_ops = { |
8fb47a4f | 529 | .lm_break = lease_break_callback, |
8fb47a4f | 530 | .lm_change = lease_modify, |
1c7dd2ff | 531 | .lm_setup = lease_setup, |
1da177e4 LT |
532 | }; |
533 | ||
534 | /* | |
535 | * Initialize a lease, use the default lock manager operations | |
536 | */ | |
0ec4f431 | 537 | static int lease_init(struct file *filp, long type, struct file_lock *fl) |
447a5647 | 538 | { |
75dff55a TM |
539 | if (assign_type(fl, type) != 0) |
540 | return -EINVAL; | |
541 | ||
7ca76311 | 542 | fl->fl_owner = filp; |
1da177e4 LT |
543 | fl->fl_pid = current->tgid; |
544 | ||
545 | fl->fl_file = filp; | |
546 | fl->fl_flags = FL_LEASE; | |
1da177e4 LT |
547 | fl->fl_start = 0; |
548 | fl->fl_end = OFFSET_MAX; | |
549 | fl->fl_ops = NULL; | |
550 | fl->fl_lmops = &lease_manager_ops; | |
551 | return 0; | |
552 | } | |
553 | ||
554 | /* Allocate a file_lock initialised to this type of lease */ | |
0ec4f431 | 555 | static struct file_lock *lease_alloc(struct file *filp, long type) |
1da177e4 LT |
556 | { |
557 | struct file_lock *fl = locks_alloc_lock(); | |
75dff55a | 558 | int error = -ENOMEM; |
1da177e4 LT |
559 | |
560 | if (fl == NULL) | |
e32b8ee2 | 561 | return ERR_PTR(error); |
1da177e4 LT |
562 | |
563 | error = lease_init(filp, type, fl); | |
75dff55a TM |
564 | if (error) { |
565 | locks_free_lock(fl); | |
e32b8ee2 | 566 | return ERR_PTR(error); |
75dff55a | 567 | } |
e32b8ee2 | 568 | return fl; |
1da177e4 LT |
569 | } |
570 | ||
571 | /* Check if two locks overlap each other. | |
572 | */ | |
573 | static inline int locks_overlap(struct file_lock *fl1, struct file_lock *fl2) | |
574 | { | |
575 | return ((fl1->fl_end >= fl2->fl_start) && | |
576 | (fl2->fl_end >= fl1->fl_start)); | |
577 | } | |
578 | ||
579 | /* | |
580 | * Check whether two locks have the same owner. | |
581 | */ | |
33443c42 | 582 | static int posix_same_owner(struct file_lock *fl1, struct file_lock *fl2) |
1da177e4 | 583 | { |
1da177e4 LT |
584 | return fl1->fl_owner == fl2->fl_owner; |
585 | } | |
586 | ||
6109c850 | 587 | /* Must be called with the flc_lock held! */ |
6ca10ed8 | 588 | static void locks_insert_global_locks(struct file_lock *fl) |
88974691 | 589 | { |
7c3f654d PZ |
590 | struct file_lock_list_struct *fll = this_cpu_ptr(&file_lock_list); |
591 | ||
aba37660 PZ |
592 | percpu_rwsem_assert_held(&file_rwsem); |
593 | ||
7c3f654d | 594 | spin_lock(&fll->lock); |
7012b02a | 595 | fl->fl_link_cpu = smp_processor_id(); |
7c3f654d PZ |
596 | hlist_add_head(&fl->fl_link, &fll->hlist); |
597 | spin_unlock(&fll->lock); | |
88974691 JL |
598 | } |
599 | ||
6109c850 | 600 | /* Must be called with the flc_lock held! */ |
6ca10ed8 | 601 | static void locks_delete_global_locks(struct file_lock *fl) |
88974691 | 602 | { |
7c3f654d PZ |
603 | struct file_lock_list_struct *fll; |
604 | ||
aba37660 PZ |
605 | percpu_rwsem_assert_held(&file_rwsem); |
606 | ||
7012b02a JL |
607 | /* |
608 | * Avoid taking lock if already unhashed. This is safe since this check | |
6109c850 | 609 | * is done while holding the flc_lock, and new insertions into the list |
7012b02a JL |
610 | * also require that it be held. |
611 | */ | |
612 | if (hlist_unhashed(&fl->fl_link)) | |
613 | return; | |
7c3f654d PZ |
614 | |
615 | fll = per_cpu_ptr(&file_lock_list, fl->fl_link_cpu); | |
616 | spin_lock(&fll->lock); | |
139ca04e | 617 | hlist_del_init(&fl->fl_link); |
7c3f654d | 618 | spin_unlock(&fll->lock); |
88974691 JL |
619 | } |
620 | ||
3999e493 JL |
621 | static unsigned long |
622 | posix_owner_key(struct file_lock *fl) | |
623 | { | |
3999e493 JL |
624 | return (unsigned long)fl->fl_owner; |
625 | } | |
626 | ||
6ca10ed8 | 627 | static void locks_insert_global_blocked(struct file_lock *waiter) |
88974691 | 628 | { |
663d5af7 DW |
629 | lockdep_assert_held(&blocked_lock_lock); |
630 | ||
3999e493 | 631 | hash_add(blocked_hash, &waiter->fl_link, posix_owner_key(waiter)); |
88974691 JL |
632 | } |
633 | ||
6ca10ed8 | 634 | static void locks_delete_global_blocked(struct file_lock *waiter) |
88974691 | 635 | { |
663d5af7 DW |
636 | lockdep_assert_held(&blocked_lock_lock); |
637 | ||
48f74186 | 638 | hash_del(&waiter->fl_link); |
88974691 JL |
639 | } |
640 | ||
1da177e4 LT |
641 | /* Remove waiter from blocker's block list. |
642 | * When blocker ends up pointing to itself then the list is empty. | |
1c8c601a | 643 | * |
7b2296af | 644 | * Must be called with blocked_lock_lock held. |
1da177e4 | 645 | */ |
33443c42 | 646 | static void __locks_delete_block(struct file_lock *waiter) |
1da177e4 | 647 | { |
88974691 | 648 | locks_delete_global_blocked(waiter); |
ada5c1da | 649 | list_del_init(&waiter->fl_blocked_member); |
1da177e4 LT |
650 | } |
651 | ||
ad6bbd8b N |
652 | static void __locks_wake_up_blocks(struct file_lock *blocker) |
653 | { | |
654 | while (!list_empty(&blocker->fl_blocked_requests)) { | |
655 | struct file_lock *waiter; | |
656 | ||
657 | waiter = list_first_entry(&blocker->fl_blocked_requests, | |
658 | struct file_lock, fl_blocked_member); | |
659 | __locks_delete_block(waiter); | |
660 | if (waiter->fl_lmops && waiter->fl_lmops->lm_notify) | |
661 | waiter->fl_lmops->lm_notify(waiter); | |
662 | else | |
663 | wake_up(&waiter->fl_wait); | |
dcf23ac3 LT |
664 | |
665 | /* | |
666 | * The setting of fl_blocker to NULL marks the "done" | |
667 | * point in deleting a block. Paired with acquire at the top | |
668 | * of locks_delete_block(). | |
669 | */ | |
670 | smp_store_release(&waiter->fl_blocker, NULL); | |
ad6bbd8b N |
671 | } |
672 | } | |
673 | ||
cb03f94f | 674 | /** |
529adfe8 | 675 | * locks_delete_block - stop waiting for a file lock |
cb03f94f N |
676 | * @waiter: the lock which was waiting |
677 | * | |
678 | * lockd/nfsd need to disconnect the lock while working on it. | |
679 | */ | |
680 | int locks_delete_block(struct file_lock *waiter) | |
1da177e4 | 681 | { |
cb03f94f N |
682 | int status = -ENOENT; |
683 | ||
dcf23ac3 LT |
684 | /* |
685 | * If fl_blocker is NULL, it won't be set again as this thread "owns" | |
686 | * the lock and is the only one that might try to claim the lock. | |
687 | * | |
688 | * We use acquire/release to manage fl_blocker so that we can | |
689 | * optimize away taking the blocked_lock_lock in many cases. | |
690 | * | |
691 | * The smp_load_acquire guarantees two things: | |
692 | * | |
693 | * 1/ that fl_blocked_requests can be tested locklessly. If something | |
694 | * was recently added to that list it must have been in a locked region | |
695 | * *before* the locked region when fl_blocker was set to NULL. | |
696 | * | |
697 | * 2/ that no other thread is accessing 'waiter', so it is safe to free | |
698 | * it. __locks_wake_up_blocks is careful not to touch waiter after | |
699 | * fl_blocker is released. | |
700 | * | |
701 | * If a lockless check of fl_blocker shows it to be NULL, we know that | |
702 | * no new locks can be inserted into its fl_blocked_requests list, and | |
703 | * can avoid doing anything further if the list is empty. | |
704 | */ | |
705 | if (!smp_load_acquire(&waiter->fl_blocker) && | |
706 | list_empty(&waiter->fl_blocked_requests)) | |
707 | return status; | |
708 | ||
7b2296af | 709 | spin_lock(&blocked_lock_lock); |
cb03f94f N |
710 | if (waiter->fl_blocker) |
711 | status = 0; | |
5946c431 | 712 | __locks_wake_up_blocks(waiter); |
1da177e4 | 713 | __locks_delete_block(waiter); |
dcf23ac3 LT |
714 | |
715 | /* | |
716 | * The setting of fl_blocker to NULL marks the "done" point in deleting | |
717 | * a block. Paired with acquire at the top of this function. | |
718 | */ | |
719 | smp_store_release(&waiter->fl_blocker, NULL); | |
7b2296af | 720 | spin_unlock(&blocked_lock_lock); |
cb03f94f | 721 | return status; |
1da177e4 | 722 | } |
cb03f94f | 723 | EXPORT_SYMBOL(locks_delete_block); |
1da177e4 LT |
724 | |
725 | /* Insert waiter into blocker's block list. | |
726 | * We use a circular list so that processes can be easily woken up in | |
727 | * the order they blocked. The documentation doesn't require this but | |
728 | * it seems like the reasonable thing to do. | |
1c8c601a | 729 | * |
6109c850 | 730 | * Must be called with both the flc_lock and blocked_lock_lock held. The |
ada5c1da N |
731 | * fl_blocked_requests list itself is protected by the blocked_lock_lock, |
732 | * but by ensuring that the flc_lock is also held on insertions we can avoid | |
733 | * taking the blocked_lock_lock in some cases when we see that the | |
734 | * fl_blocked_requests list is empty. | |
fd7732e0 N |
735 | * |
736 | * Rather than just adding to the list, we check for conflicts with any existing | |
737 | * waiters, and add beneath any waiter that blocks the new waiter. | |
738 | * Thus wakeups don't happen until needed. | |
1da177e4 | 739 | */ |
1c8c601a | 740 | static void __locks_insert_block(struct file_lock *blocker, |
fd7732e0 N |
741 | struct file_lock *waiter, |
742 | bool conflict(struct file_lock *, | |
743 | struct file_lock *)) | |
1da177e4 | 744 | { |
fd7732e0 | 745 | struct file_lock *fl; |
ada5c1da | 746 | BUG_ON(!list_empty(&waiter->fl_blocked_member)); |
fd7732e0 N |
747 | |
748 | new_blocker: | |
749 | list_for_each_entry(fl, &blocker->fl_blocked_requests, fl_blocked_member) | |
750 | if (conflict(fl, waiter)) { | |
751 | blocker = fl; | |
752 | goto new_blocker; | |
753 | } | |
ada5c1da N |
754 | waiter->fl_blocker = blocker; |
755 | list_add_tail(&waiter->fl_blocked_member, &blocker->fl_blocked_requests); | |
cff2fce5 | 756 | if (IS_POSIX(blocker) && !IS_OFDLCK(blocker)) |
1c8c601a | 757 | locks_insert_global_blocked(waiter); |
5946c431 N |
758 | |
759 | /* The requests in waiter->fl_blocked are known to conflict with | |
760 | * waiter, but might not conflict with blocker, or the requests | |
761 | * and lock which block it. So they all need to be woken. | |
762 | */ | |
763 | __locks_wake_up_blocks(waiter); | |
1c8c601a JL |
764 | } |
765 | ||
6109c850 | 766 | /* Must be called with flc_lock held. */ |
1c8c601a | 767 | static void locks_insert_block(struct file_lock *blocker, |
fd7732e0 N |
768 | struct file_lock *waiter, |
769 | bool conflict(struct file_lock *, | |
770 | struct file_lock *)) | |
1c8c601a | 771 | { |
7b2296af | 772 | spin_lock(&blocked_lock_lock); |
fd7732e0 | 773 | __locks_insert_block(blocker, waiter, conflict); |
7b2296af | 774 | spin_unlock(&blocked_lock_lock); |
1da177e4 LT |
775 | } |
776 | ||
1cb36012 JL |
777 | /* |
778 | * Wake up processes blocked waiting for blocker. | |
779 | * | |
6109c850 | 780 | * Must be called with the inode->flc_lock held! |
1da177e4 LT |
781 | */ |
782 | static void locks_wake_up_blocks(struct file_lock *blocker) | |
783 | { | |
4e8c765d JL |
784 | /* |
785 | * Avoid taking global lock if list is empty. This is safe since new | |
6109c850 | 786 | * blocked requests are only added to the list under the flc_lock, and |
ada5c1da N |
787 | * the flc_lock is always held here. Note that removal from the |
788 | * fl_blocked_requests list does not require the flc_lock, so we must | |
789 | * recheck list_empty() after acquiring the blocked_lock_lock. | |
4e8c765d | 790 | */ |
ada5c1da | 791 | if (list_empty(&blocker->fl_blocked_requests)) |
4e8c765d JL |
792 | return; |
793 | ||
7b2296af | 794 | spin_lock(&blocked_lock_lock); |
ad6bbd8b | 795 | __locks_wake_up_blocks(blocker); |
7b2296af | 796 | spin_unlock(&blocked_lock_lock); |
1da177e4 LT |
797 | } |
798 | ||
5263e31e | 799 | static void |
e084c1bd | 800 | locks_insert_lock_ctx(struct file_lock *fl, struct list_head *before) |
5263e31e | 801 | { |
5263e31e JL |
802 | list_add_tail(&fl->fl_list, before); |
803 | locks_insert_global_locks(fl); | |
804 | } | |
805 | ||
8634b51f | 806 | static void |
e084c1bd | 807 | locks_unlink_lock_ctx(struct file_lock *fl) |
1da177e4 | 808 | { |
88974691 | 809 | locks_delete_global_locks(fl); |
8634b51f | 810 | list_del_init(&fl->fl_list); |
1da177e4 | 811 | locks_wake_up_blocks(fl); |
24cbe784 JL |
812 | } |
813 | ||
8634b51f | 814 | static void |
e084c1bd | 815 | locks_delete_lock_ctx(struct file_lock *fl, struct list_head *dispose) |
24cbe784 | 816 | { |
e084c1bd | 817 | locks_unlink_lock_ctx(fl); |
ed9814d8 | 818 | if (dispose) |
6dee60f6 | 819 | list_add(&fl->fl_list, dispose); |
ed9814d8 JL |
820 | else |
821 | locks_free_lock(fl); | |
1da177e4 LT |
822 | } |
823 | ||
824 | /* Determine if lock sys_fl blocks lock caller_fl. Common functionality | |
825 | * checks for shared/exclusive status of overlapping locks. | |
826 | */ | |
c0e15908 N |
827 | static bool locks_conflict(struct file_lock *caller_fl, |
828 | struct file_lock *sys_fl) | |
1da177e4 LT |
829 | { |
830 | if (sys_fl->fl_type == F_WRLCK) | |
c0e15908 | 831 | return true; |
1da177e4 | 832 | if (caller_fl->fl_type == F_WRLCK) |
c0e15908 N |
833 | return true; |
834 | return false; | |
1da177e4 LT |
835 | } |
836 | ||
837 | /* Determine if lock sys_fl blocks lock caller_fl. POSIX specific | |
838 | * checking before calling the locks_conflict(). | |
839 | */ | |
c0e15908 N |
840 | static bool posix_locks_conflict(struct file_lock *caller_fl, |
841 | struct file_lock *sys_fl) | |
1da177e4 LT |
842 | { |
843 | /* POSIX locks owned by the same process do not conflict with | |
844 | * each other. | |
845 | */ | |
9b8c8695 | 846 | if (posix_same_owner(caller_fl, sys_fl)) |
c0e15908 | 847 | return false; |
1da177e4 LT |
848 | |
849 | /* Check whether they overlap */ | |
850 | if (!locks_overlap(caller_fl, sys_fl)) | |
c0e15908 | 851 | return false; |
1da177e4 | 852 | |
c0e15908 | 853 | return locks_conflict(caller_fl, sys_fl); |
1da177e4 LT |
854 | } |
855 | ||
856 | /* Determine if lock sys_fl blocks lock caller_fl. FLOCK specific | |
857 | * checking before calling the locks_conflict(). | |
858 | */ | |
c0e15908 N |
859 | static bool flock_locks_conflict(struct file_lock *caller_fl, |
860 | struct file_lock *sys_fl) | |
1da177e4 LT |
861 | { |
862 | /* FLOCK locks referring to the same filp do not conflict with | |
863 | * each other. | |
864 | */ | |
9b8c8695 | 865 | if (caller_fl->fl_file == sys_fl->fl_file) |
c0e15908 | 866 | return false; |
1da177e4 | 867 | |
c0e15908 | 868 | return locks_conflict(caller_fl, sys_fl); |
1da177e4 LT |
869 | } |
870 | ||
6d34ac19 | 871 | void |
9d6a8c5c | 872 | posix_test_lock(struct file *filp, struct file_lock *fl) |
1da177e4 LT |
873 | { |
874 | struct file_lock *cfl; | |
bd61e0a9 | 875 | struct file_lock_context *ctx; |
c568d683 | 876 | struct inode *inode = locks_inode(filp); |
1da177e4 | 877 | |
128a3785 | 878 | ctx = smp_load_acquire(&inode->i_flctx); |
bd61e0a9 JL |
879 | if (!ctx || list_empty_careful(&ctx->flc_posix)) { |
880 | fl->fl_type = F_UNLCK; | |
881 | return; | |
882 | } | |
883 | ||
6109c850 | 884 | spin_lock(&ctx->flc_lock); |
bd61e0a9 JL |
885 | list_for_each_entry(cfl, &ctx->flc_posix, fl_list) { |
886 | if (posix_locks_conflict(fl, cfl)) { | |
887 | locks_copy_conflock(fl, cfl); | |
bd61e0a9 JL |
888 | goto out; |
889 | } | |
1da177e4 | 890 | } |
bd61e0a9 JL |
891 | fl->fl_type = F_UNLCK; |
892 | out: | |
6109c850 | 893 | spin_unlock(&ctx->flc_lock); |
6d34ac19 | 894 | return; |
1da177e4 | 895 | } |
1da177e4 LT |
896 | EXPORT_SYMBOL(posix_test_lock); |
897 | ||
b533184f BF |
898 | /* |
899 | * Deadlock detection: | |
900 | * | |
901 | * We attempt to detect deadlocks that are due purely to posix file | |
902 | * locks. | |
1da177e4 | 903 | * |
b533184f BF |
904 | * We assume that a task can be waiting for at most one lock at a time. |
905 | * So for any acquired lock, the process holding that lock may be | |
906 | * waiting on at most one other lock. That lock in turns may be held by | |
907 | * someone waiting for at most one other lock. Given a requested lock | |
908 | * caller_fl which is about to wait for a conflicting lock block_fl, we | |
909 | * follow this chain of waiters to ensure we are not about to create a | |
910 | * cycle. | |
1da177e4 | 911 | * |
b533184f BF |
912 | * Since we do this before we ever put a process to sleep on a lock, we |
913 | * are ensured that there is never a cycle; that is what guarantees that | |
914 | * the while() loop in posix_locks_deadlock() eventually completes. | |
97855b49 | 915 | * |
b533184f BF |
916 | * Note: the above assumption may not be true when handling lock |
917 | * requests from a broken NFS client. It may also fail in the presence | |
918 | * of tasks (such as posix threads) sharing the same open file table. | |
b533184f | 919 | * To handle those cases, we just bail out after a few iterations. |
57b65325 | 920 | * |
cff2fce5 | 921 | * For FL_OFDLCK locks, the owner is the filp, not the files_struct. |
57b65325 JL |
922 | * Because the owner is not even nominally tied to a thread of |
923 | * execution, the deadlock detection below can't reasonably work well. Just | |
924 | * skip it for those. | |
925 | * | |
cff2fce5 | 926 | * In principle, we could do a more limited deadlock detection on FL_OFDLCK |
57b65325 JL |
927 | * locks that just checks for the case where two tasks are attempting to |
928 | * upgrade from read to write locks on the same inode. | |
1da177e4 | 929 | */ |
97855b49 BF |
930 | |
931 | #define MAX_DEADLK_ITERATIONS 10 | |
932 | ||
b533184f BF |
933 | /* Find a lock that the owner of the given block_fl is blocking on. */ |
934 | static struct file_lock *what_owner_is_waiting_for(struct file_lock *block_fl) | |
935 | { | |
936 | struct file_lock *fl; | |
937 | ||
3999e493 | 938 | hash_for_each_possible(blocked_hash, fl, fl_link, posix_owner_key(block_fl)) { |
5946c431 N |
939 | if (posix_same_owner(fl, block_fl)) { |
940 | while (fl->fl_blocker) | |
941 | fl = fl->fl_blocker; | |
942 | return fl; | |
943 | } | |
b533184f BF |
944 | } |
945 | return NULL; | |
946 | } | |
947 | ||
7b2296af | 948 | /* Must be called with the blocked_lock_lock held! */ |
b0904e14 | 949 | static int posix_locks_deadlock(struct file_lock *caller_fl, |
1da177e4 LT |
950 | struct file_lock *block_fl) |
951 | { | |
97855b49 | 952 | int i = 0; |
1da177e4 | 953 | |
663d5af7 DW |
954 | lockdep_assert_held(&blocked_lock_lock); |
955 | ||
57b65325 JL |
956 | /* |
957 | * This deadlock detector can't reasonably detect deadlocks with | |
cff2fce5 | 958 | * FL_OFDLCK locks, since they aren't owned by a process, per-se. |
57b65325 | 959 | */ |
cff2fce5 | 960 | if (IS_OFDLCK(caller_fl)) |
57b65325 JL |
961 | return 0; |
962 | ||
b533184f BF |
963 | while ((block_fl = what_owner_is_waiting_for(block_fl))) { |
964 | if (i++ > MAX_DEADLK_ITERATIONS) | |
965 | return 0; | |
966 | if (posix_same_owner(caller_fl, block_fl)) | |
967 | return 1; | |
1da177e4 LT |
968 | } |
969 | return 0; | |
970 | } | |
971 | ||
1da177e4 | 972 | /* Try to create a FLOCK lock on filp. We always insert new FLOCK locks |
02888f41 | 973 | * after any leases, but before any posix locks. |
f475ae95 TM |
974 | * |
975 | * Note that if called with an FL_EXISTS argument, the caller may determine | |
976 | * whether or not a lock was successfully freed by testing the return | |
977 | * value for -ENOENT. | |
1da177e4 | 978 | */ |
bcd7f78d | 979 | static int flock_lock_inode(struct inode *inode, struct file_lock *request) |
1da177e4 | 980 | { |
993dfa87 | 981 | struct file_lock *new_fl = NULL; |
5263e31e JL |
982 | struct file_lock *fl; |
983 | struct file_lock_context *ctx; | |
1da177e4 | 984 | int error = 0; |
5263e31e | 985 | bool found = false; |
ed9814d8 | 986 | LIST_HEAD(dispose); |
1da177e4 | 987 | |
5c1c669a JL |
988 | ctx = locks_get_lock_context(inode, request->fl_type); |
989 | if (!ctx) { | |
990 | if (request->fl_type != F_UNLCK) | |
991 | return -ENOMEM; | |
992 | return (request->fl_flags & FL_EXISTS) ? -ENOENT : 0; | |
993 | } | |
5263e31e | 994 | |
b89f4321 | 995 | if (!(request->fl_flags & FL_ACCESS) && (request->fl_type != F_UNLCK)) { |
84d535ad | 996 | new_fl = locks_alloc_lock(); |
b89f4321 AB |
997 | if (!new_fl) |
998 | return -ENOMEM; | |
84d535ad PE |
999 | } |
1000 | ||
02e525b2 | 1001 | percpu_down_read(&file_rwsem); |
6109c850 | 1002 | spin_lock(&ctx->flc_lock); |
b89f4321 AB |
1003 | if (request->fl_flags & FL_ACCESS) |
1004 | goto find_conflict; | |
1005 | ||
5263e31e | 1006 | list_for_each_entry(fl, &ctx->flc_flock, fl_list) { |
bcd7f78d | 1007 | if (request->fl_file != fl->fl_file) |
1da177e4 | 1008 | continue; |
993dfa87 | 1009 | if (request->fl_type == fl->fl_type) |
1da177e4 | 1010 | goto out; |
5263e31e | 1011 | found = true; |
e084c1bd | 1012 | locks_delete_lock_ctx(fl, &dispose); |
1da177e4 LT |
1013 | break; |
1014 | } | |
1da177e4 | 1015 | |
f475ae95 TM |
1016 | if (request->fl_type == F_UNLCK) { |
1017 | if ((request->fl_flags & FL_EXISTS) && !found) | |
1018 | error = -ENOENT; | |
993dfa87 | 1019 | goto out; |
f475ae95 | 1020 | } |
1da177e4 | 1021 | |
f07f18dd | 1022 | find_conflict: |
5263e31e | 1023 | list_for_each_entry(fl, &ctx->flc_flock, fl_list) { |
993dfa87 | 1024 | if (!flock_locks_conflict(request, fl)) |
1da177e4 LT |
1025 | continue; |
1026 | error = -EAGAIN; | |
bde74e4b MS |
1027 | if (!(request->fl_flags & FL_SLEEP)) |
1028 | goto out; | |
1029 | error = FILE_LOCK_DEFERRED; | |
fd7732e0 | 1030 | locks_insert_block(fl, request, flock_locks_conflict); |
1da177e4 LT |
1031 | goto out; |
1032 | } | |
f07f18dd TM |
1033 | if (request->fl_flags & FL_ACCESS) |
1034 | goto out; | |
993dfa87 | 1035 | locks_copy_lock(new_fl, request); |
5946c431 | 1036 | locks_move_blocks(new_fl, request); |
e084c1bd | 1037 | locks_insert_lock_ctx(new_fl, &ctx->flc_flock); |
993dfa87 | 1038 | new_fl = NULL; |
9cedc194 | 1039 | error = 0; |
1da177e4 LT |
1040 | |
1041 | out: | |
6109c850 | 1042 | spin_unlock(&ctx->flc_lock); |
02e525b2 | 1043 | percpu_up_read(&file_rwsem); |
993dfa87 TM |
1044 | if (new_fl) |
1045 | locks_free_lock(new_fl); | |
ed9814d8 | 1046 | locks_dispose_list(&dispose); |
c883da31 | 1047 | trace_flock_lock_inode(inode, request, error); |
1da177e4 LT |
1048 | return error; |
1049 | } | |
1050 | ||
b4d629a3 JL |
1051 | static int posix_lock_inode(struct inode *inode, struct file_lock *request, |
1052 | struct file_lock *conflock) | |
1da177e4 | 1053 | { |
bd61e0a9 | 1054 | struct file_lock *fl, *tmp; |
39005d02 MS |
1055 | struct file_lock *new_fl = NULL; |
1056 | struct file_lock *new_fl2 = NULL; | |
1da177e4 LT |
1057 | struct file_lock *left = NULL; |
1058 | struct file_lock *right = NULL; | |
bd61e0a9 | 1059 | struct file_lock_context *ctx; |
b9746ef8 JL |
1060 | int error; |
1061 | bool added = false; | |
ed9814d8 | 1062 | LIST_HEAD(dispose); |
1da177e4 | 1063 | |
5c1c669a | 1064 | ctx = locks_get_lock_context(inode, request->fl_type); |
bd61e0a9 | 1065 | if (!ctx) |
5c1c669a | 1066 | return (request->fl_type == F_UNLCK) ? 0 : -ENOMEM; |
bd61e0a9 | 1067 | |
1da177e4 LT |
1068 | /* |
1069 | * We may need two file_lock structures for this operation, | |
1070 | * so we get them in advance to avoid races. | |
39005d02 MS |
1071 | * |
1072 | * In some cases we can be sure, that no new locks will be needed | |
1da177e4 | 1073 | */ |
39005d02 MS |
1074 | if (!(request->fl_flags & FL_ACCESS) && |
1075 | (request->fl_type != F_UNLCK || | |
1076 | request->fl_start != 0 || request->fl_end != OFFSET_MAX)) { | |
1077 | new_fl = locks_alloc_lock(); | |
1078 | new_fl2 = locks_alloc_lock(); | |
1079 | } | |
1da177e4 | 1080 | |
02e525b2 | 1081 | percpu_down_read(&file_rwsem); |
6109c850 | 1082 | spin_lock(&ctx->flc_lock); |
1cb36012 JL |
1083 | /* |
1084 | * New lock request. Walk all POSIX locks and look for conflicts. If | |
1085 | * there are any, either return error or put the request on the | |
48f74186 | 1086 | * blocker's list of waiters and the global blocked_hash. |
1cb36012 | 1087 | */ |
1da177e4 | 1088 | if (request->fl_type != F_UNLCK) { |
bd61e0a9 | 1089 | list_for_each_entry(fl, &ctx->flc_posix, fl_list) { |
1da177e4 LT |
1090 | if (!posix_locks_conflict(request, fl)) |
1091 | continue; | |
5842add2 | 1092 | if (conflock) |
3fe0fff1 | 1093 | locks_copy_conflock(conflock, fl); |
1da177e4 LT |
1094 | error = -EAGAIN; |
1095 | if (!(request->fl_flags & FL_SLEEP)) | |
1096 | goto out; | |
1c8c601a JL |
1097 | /* |
1098 | * Deadlock detection and insertion into the blocked | |
1099 | * locks list must be done while holding the same lock! | |
1100 | */ | |
1da177e4 | 1101 | error = -EDEADLK; |
7b2296af | 1102 | spin_lock(&blocked_lock_lock); |
945ab8f6 JL |
1103 | /* |
1104 | * Ensure that we don't find any locks blocked on this | |
1105 | * request during deadlock detection. | |
1106 | */ | |
1107 | __locks_wake_up_blocks(request); | |
1c8c601a JL |
1108 | if (likely(!posix_locks_deadlock(request, fl))) { |
1109 | error = FILE_LOCK_DEFERRED; | |
fd7732e0 N |
1110 | __locks_insert_block(fl, request, |
1111 | posix_locks_conflict); | |
1c8c601a | 1112 | } |
7b2296af | 1113 | spin_unlock(&blocked_lock_lock); |
1da177e4 | 1114 | goto out; |
7bbd1fc0 N |
1115 | } |
1116 | } | |
1da177e4 LT |
1117 | |
1118 | /* If we're just looking for a conflict, we're done. */ | |
1119 | error = 0; | |
1120 | if (request->fl_flags & FL_ACCESS) | |
1121 | goto out; | |
1122 | ||
bd61e0a9 JL |
1123 | /* Find the first old lock with the same owner as the new lock */ |
1124 | list_for_each_entry(fl, &ctx->flc_posix, fl_list) { | |
1125 | if (posix_same_owner(request, fl)) | |
1126 | break; | |
1da177e4 LT |
1127 | } |
1128 | ||
1cb36012 | 1129 | /* Process locks with this owner. */ |
bd61e0a9 JL |
1130 | list_for_each_entry_safe_from(fl, tmp, &ctx->flc_posix, fl_list) { |
1131 | if (!posix_same_owner(request, fl)) | |
1132 | break; | |
1133 | ||
1134 | /* Detect adjacent or overlapping regions (if same lock type) */ | |
1da177e4 | 1135 | if (request->fl_type == fl->fl_type) { |
449231d6 OK |
1136 | /* In all comparisons of start vs end, use |
1137 | * "start - 1" rather than "end + 1". If end | |
1138 | * is OFFSET_MAX, end + 1 will become negative. | |
1139 | */ | |
1da177e4 | 1140 | if (fl->fl_end < request->fl_start - 1) |
bd61e0a9 | 1141 | continue; |
1da177e4 LT |
1142 | /* If the next lock in the list has entirely bigger |
1143 | * addresses than the new one, insert the lock here. | |
1144 | */ | |
449231d6 | 1145 | if (fl->fl_start - 1 > request->fl_end) |
1da177e4 LT |
1146 | break; |
1147 | ||
1148 | /* If we come here, the new and old lock are of the | |
1149 | * same type and adjacent or overlapping. Make one | |
1150 | * lock yielding from the lower start address of both | |
1151 | * locks to the higher end address. | |
1152 | */ | |
1153 | if (fl->fl_start > request->fl_start) | |
1154 | fl->fl_start = request->fl_start; | |
1155 | else | |
1156 | request->fl_start = fl->fl_start; | |
1157 | if (fl->fl_end < request->fl_end) | |
1158 | fl->fl_end = request->fl_end; | |
1159 | else | |
1160 | request->fl_end = fl->fl_end; | |
1161 | if (added) { | |
e084c1bd | 1162 | locks_delete_lock_ctx(fl, &dispose); |
1da177e4 LT |
1163 | continue; |
1164 | } | |
1165 | request = fl; | |
b9746ef8 | 1166 | added = true; |
bd61e0a9 | 1167 | } else { |
1da177e4 LT |
1168 | /* Processing for different lock types is a bit |
1169 | * more complex. | |
1170 | */ | |
1171 | if (fl->fl_end < request->fl_start) | |
bd61e0a9 | 1172 | continue; |
1da177e4 LT |
1173 | if (fl->fl_start > request->fl_end) |
1174 | break; | |
1175 | if (request->fl_type == F_UNLCK) | |
b9746ef8 | 1176 | added = true; |
1da177e4 LT |
1177 | if (fl->fl_start < request->fl_start) |
1178 | left = fl; | |
1179 | /* If the next lock in the list has a higher end | |
1180 | * address than the new one, insert the new one here. | |
1181 | */ | |
1182 | if (fl->fl_end > request->fl_end) { | |
1183 | right = fl; | |
1184 | break; | |
1185 | } | |
1186 | if (fl->fl_start >= request->fl_start) { | |
1187 | /* The new lock completely replaces an old | |
1188 | * one (This may happen several times). | |
1189 | */ | |
1190 | if (added) { | |
e084c1bd | 1191 | locks_delete_lock_ctx(fl, &dispose); |
1da177e4 LT |
1192 | continue; |
1193 | } | |
b84d49f9 JL |
1194 | /* |
1195 | * Replace the old lock with new_fl, and | |
1196 | * remove the old one. It's safe to do the | |
1197 | * insert here since we know that we won't be | |
1198 | * using new_fl later, and that the lock is | |
1199 | * just replacing an existing lock. | |
1da177e4 | 1200 | */ |
b84d49f9 JL |
1201 | error = -ENOLCK; |
1202 | if (!new_fl) | |
1203 | goto out; | |
1204 | locks_copy_lock(new_fl, request); | |
5ef15968 | 1205 | locks_move_blocks(new_fl, request); |
b84d49f9 JL |
1206 | request = new_fl; |
1207 | new_fl = NULL; | |
e084c1bd JL |
1208 | locks_insert_lock_ctx(request, &fl->fl_list); |
1209 | locks_delete_lock_ctx(fl, &dispose); | |
b9746ef8 | 1210 | added = true; |
1da177e4 LT |
1211 | } |
1212 | } | |
1da177e4 LT |
1213 | } |
1214 | ||
0d9a490a | 1215 | /* |
1cb36012 JL |
1216 | * The above code only modifies existing locks in case of merging or |
1217 | * replacing. If new lock(s) need to be inserted all modifications are | |
1218 | * done below this, so it's safe yet to bail out. | |
0d9a490a MS |
1219 | */ |
1220 | error = -ENOLCK; /* "no luck" */ | |
1221 | if (right && left == right && !new_fl2) | |
1222 | goto out; | |
1223 | ||
1da177e4 LT |
1224 | error = 0; |
1225 | if (!added) { | |
f475ae95 TM |
1226 | if (request->fl_type == F_UNLCK) { |
1227 | if (request->fl_flags & FL_EXISTS) | |
1228 | error = -ENOENT; | |
1da177e4 | 1229 | goto out; |
f475ae95 | 1230 | } |
0d9a490a MS |
1231 | |
1232 | if (!new_fl) { | |
1233 | error = -ENOLCK; | |
1234 | goto out; | |
1235 | } | |
1da177e4 | 1236 | locks_copy_lock(new_fl, request); |
5946c431 | 1237 | locks_move_blocks(new_fl, request); |
e084c1bd | 1238 | locks_insert_lock_ctx(new_fl, &fl->fl_list); |
2e2f756f | 1239 | fl = new_fl; |
1da177e4 LT |
1240 | new_fl = NULL; |
1241 | } | |
1242 | if (right) { | |
1243 | if (left == right) { | |
1244 | /* The new lock breaks the old one in two pieces, | |
1245 | * so we have to use the second new lock. | |
1246 | */ | |
1247 | left = new_fl2; | |
1248 | new_fl2 = NULL; | |
1249 | locks_copy_lock(left, right); | |
e084c1bd | 1250 | locks_insert_lock_ctx(left, &fl->fl_list); |
1da177e4 LT |
1251 | } |
1252 | right->fl_start = request->fl_end + 1; | |
1253 | locks_wake_up_blocks(right); | |
1254 | } | |
1255 | if (left) { | |
1256 | left->fl_end = request->fl_start - 1; | |
1257 | locks_wake_up_blocks(left); | |
1258 | } | |
1259 | out: | |
6109c850 | 1260 | spin_unlock(&ctx->flc_lock); |
02e525b2 | 1261 | percpu_up_read(&file_rwsem); |
1da177e4 LT |
1262 | /* |
1263 | * Free any unused locks. | |
1264 | */ | |
1265 | if (new_fl) | |
1266 | locks_free_lock(new_fl); | |
1267 | if (new_fl2) | |
1268 | locks_free_lock(new_fl2); | |
ed9814d8 | 1269 | locks_dispose_list(&dispose); |
1890910f JL |
1270 | trace_posix_lock_inode(inode, request, error); |
1271 | ||
1da177e4 LT |
1272 | return error; |
1273 | } | |
1274 | ||
1275 | /** | |
1276 | * posix_lock_file - Apply a POSIX-style lock to a file | |
1277 | * @filp: The file to apply the lock to | |
1278 | * @fl: The lock to be applied | |
150b3934 | 1279 | * @conflock: Place to return a copy of the conflicting lock, if found. |
1da177e4 LT |
1280 | * |
1281 | * Add a POSIX style lock to a file. | |
1282 | * We merge adjacent & overlapping locks whenever possible. | |
1283 | * POSIX locks are sorted by owner task, then by starting address | |
f475ae95 TM |
1284 | * |
1285 | * Note that if called with an FL_EXISTS argument, the caller may determine | |
1286 | * whether or not a lock was successfully freed by testing the return | |
1287 | * value for -ENOENT. | |
1da177e4 | 1288 | */ |
150b3934 | 1289 | int posix_lock_file(struct file *filp, struct file_lock *fl, |
5842add2 AA |
1290 | struct file_lock *conflock) |
1291 | { | |
c568d683 | 1292 | return posix_lock_inode(locks_inode(filp), fl, conflock); |
1da177e4 | 1293 | } |
150b3934 | 1294 | EXPORT_SYMBOL(posix_lock_file); |
1da177e4 LT |
1295 | |
1296 | /** | |
29d01b22 JL |
1297 | * posix_lock_inode_wait - Apply a POSIX-style lock to a file |
1298 | * @inode: inode of file to which lock request should be applied | |
1da177e4 LT |
1299 | * @fl: The lock to be applied |
1300 | * | |
616fb38f | 1301 | * Apply a POSIX style lock request to an inode. |
1da177e4 | 1302 | */ |
616fb38f | 1303 | static int posix_lock_inode_wait(struct inode *inode, struct file_lock *fl) |
1da177e4 LT |
1304 | { |
1305 | int error; | |
1306 | might_sleep (); | |
1307 | for (;;) { | |
b4d629a3 | 1308 | error = posix_lock_inode(inode, fl, NULL); |
bde74e4b | 1309 | if (error != FILE_LOCK_DEFERRED) |
1da177e4 | 1310 | break; |
dcf23ac3 LT |
1311 | error = wait_event_interruptible(fl->fl_wait, |
1312 | list_empty(&fl->fl_blocked_member)); | |
16306a61 N |
1313 | if (error) |
1314 | break; | |
1da177e4 | 1315 | } |
16306a61 | 1316 | locks_delete_block(fl); |
1da177e4 LT |
1317 | return error; |
1318 | } | |
29d01b22 | 1319 | |
778fc546 BF |
1320 | static void lease_clear_pending(struct file_lock *fl, int arg) |
1321 | { | |
1322 | switch (arg) { | |
1323 | case F_UNLCK: | |
1324 | fl->fl_flags &= ~FL_UNLOCK_PENDING; | |
df561f66 | 1325 | fallthrough; |
778fc546 BF |
1326 | case F_RDLCK: |
1327 | fl->fl_flags &= ~FL_DOWNGRADE_PENDING; | |
1328 | } | |
1329 | } | |
1330 | ||
1da177e4 | 1331 | /* We already had a lease on this file; just change its type */ |
7448cc37 | 1332 | int lease_modify(struct file_lock *fl, int arg, struct list_head *dispose) |
1da177e4 | 1333 | { |
1da177e4 LT |
1334 | int error = assign_type(fl, arg); |
1335 | ||
1336 | if (error) | |
1337 | return error; | |
778fc546 | 1338 | lease_clear_pending(fl, arg); |
1da177e4 | 1339 | locks_wake_up_blocks(fl); |
3b6e2723 FB |
1340 | if (arg == F_UNLCK) { |
1341 | struct file *filp = fl->fl_file; | |
1342 | ||
1343 | f_delown(filp); | |
1344 | filp->f_owner.signum = 0; | |
96d6d59c BF |
1345 | fasync_helper(0, fl->fl_file, 0, &fl->fl_fasync); |
1346 | if (fl->fl_fasync != NULL) { | |
1347 | printk(KERN_ERR "locks_delete_lock: fasync == %p\n", fl->fl_fasync); | |
1348 | fl->fl_fasync = NULL; | |
1349 | } | |
e084c1bd | 1350 | locks_delete_lock_ctx(fl, dispose); |
3b6e2723 | 1351 | } |
1da177e4 LT |
1352 | return 0; |
1353 | } | |
1da177e4 LT |
1354 | EXPORT_SYMBOL(lease_modify); |
1355 | ||
778fc546 BF |
1356 | static bool past_time(unsigned long then) |
1357 | { | |
1358 | if (!then) | |
1359 | /* 0 is a special value meaning "this never expires": */ | |
1360 | return false; | |
1361 | return time_after(jiffies, then); | |
1362 | } | |
1363 | ||
c45198ed | 1364 | static void time_out_leases(struct inode *inode, struct list_head *dispose) |
1da177e4 | 1365 | { |
8634b51f JL |
1366 | struct file_lock_context *ctx = inode->i_flctx; |
1367 | struct file_lock *fl, *tmp; | |
1da177e4 | 1368 | |
6109c850 | 1369 | lockdep_assert_held(&ctx->flc_lock); |
f82b4b67 | 1370 | |
8634b51f | 1371 | list_for_each_entry_safe(fl, tmp, &ctx->flc_lease, fl_list) { |
62af4f1f | 1372 | trace_time_out_leases(inode, fl); |
778fc546 | 1373 | if (past_time(fl->fl_downgrade_time)) |
7448cc37 | 1374 | lease_modify(fl, F_RDLCK, dispose); |
778fc546 | 1375 | if (past_time(fl->fl_break_time)) |
7448cc37 | 1376 | lease_modify(fl, F_UNLCK, dispose); |
1da177e4 LT |
1377 | } |
1378 | } | |
1379 | ||
df4e8d2c BF |
1380 | static bool leases_conflict(struct file_lock *lease, struct file_lock *breaker) |
1381 | { | |
d51f527f IW |
1382 | bool rc; |
1383 | ||
28df3d15 BF |
1384 | if (lease->fl_lmops->lm_breaker_owns_lease |
1385 | && lease->fl_lmops->lm_breaker_owns_lease(lease)) | |
1386 | return false; | |
d51f527f IW |
1387 | if ((breaker->fl_flags & FL_LAYOUT) != (lease->fl_flags & FL_LAYOUT)) { |
1388 | rc = false; | |
1389 | goto trace; | |
1390 | } | |
1391 | if ((breaker->fl_flags & FL_DELEG) && (lease->fl_flags & FL_LEASE)) { | |
1392 | rc = false; | |
1393 | goto trace; | |
1394 | } | |
1395 | ||
1396 | rc = locks_conflict(breaker, lease); | |
1397 | trace: | |
1398 | trace_leases_conflict(rc, lease, breaker); | |
1399 | return rc; | |
df4e8d2c BF |
1400 | } |
1401 | ||
03d12ddf JL |
1402 | static bool |
1403 | any_leases_conflict(struct inode *inode, struct file_lock *breaker) | |
1404 | { | |
8634b51f | 1405 | struct file_lock_context *ctx = inode->i_flctx; |
03d12ddf JL |
1406 | struct file_lock *fl; |
1407 | ||
6109c850 | 1408 | lockdep_assert_held(&ctx->flc_lock); |
03d12ddf | 1409 | |
8634b51f | 1410 | list_for_each_entry(fl, &ctx->flc_lease, fl_list) { |
03d12ddf JL |
1411 | if (leases_conflict(fl, breaker)) |
1412 | return true; | |
1413 | } | |
1414 | return false; | |
1415 | } | |
1416 | ||
1da177e4 LT |
1417 | /** |
1418 | * __break_lease - revoke all outstanding leases on file | |
1419 | * @inode: the inode of the file to return | |
df4e8d2c BF |
1420 | * @mode: O_RDONLY: break only write leases; O_WRONLY or O_RDWR: |
1421 | * break all leases | |
1422 | * @type: FL_LEASE: break leases and delegations; FL_DELEG: break | |
1423 | * only delegations | |
1da177e4 | 1424 | * |
87250dd2 | 1425 | * break_lease (inlined for speed) has checked there already is at least |
1426 | * some kind of lock (maybe a lease) on this file. Leases are broken on | |
1427 | * a call to open() or truncate(). This function can sleep unless you | |
1da177e4 LT |
1428 | * specified %O_NONBLOCK to your open(). |
1429 | */ | |
df4e8d2c | 1430 | int __break_lease(struct inode *inode, unsigned int mode, unsigned int type) |
1da177e4 | 1431 | { |
778fc546 | 1432 | int error = 0; |
128a3785 | 1433 | struct file_lock_context *ctx; |
a901125c | 1434 | struct file_lock *new_fl, *fl, *tmp; |
1da177e4 | 1435 | unsigned long break_time; |
8737c930 | 1436 | int want_write = (mode & O_ACCMODE) != O_RDONLY; |
c45198ed | 1437 | LIST_HEAD(dispose); |
1da177e4 | 1438 | |
8737c930 | 1439 | new_fl = lease_alloc(NULL, want_write ? F_WRLCK : F_RDLCK); |
6d4b9e38 LT |
1440 | if (IS_ERR(new_fl)) |
1441 | return PTR_ERR(new_fl); | |
df4e8d2c | 1442 | new_fl->fl_flags = type; |
1da177e4 | 1443 | |
8634b51f | 1444 | /* typically we will check that ctx is non-NULL before calling */ |
128a3785 | 1445 | ctx = smp_load_acquire(&inode->i_flctx); |
8634b51f JL |
1446 | if (!ctx) { |
1447 | WARN_ON_ONCE(1); | |
cfddf9f4 | 1448 | goto free_lock; |
8634b51f JL |
1449 | } |
1450 | ||
02e525b2 | 1451 | percpu_down_read(&file_rwsem); |
6109c850 | 1452 | spin_lock(&ctx->flc_lock); |
1da177e4 | 1453 | |
c45198ed | 1454 | time_out_leases(inode, &dispose); |
1da177e4 | 1455 | |
03d12ddf | 1456 | if (!any_leases_conflict(inode, new_fl)) |
778fc546 BF |
1457 | goto out; |
1458 | ||
1da177e4 LT |
1459 | break_time = 0; |
1460 | if (lease_break_time > 0) { | |
1461 | break_time = jiffies + lease_break_time * HZ; | |
1462 | if (break_time == 0) | |
1463 | break_time++; /* so that 0 means no break time */ | |
1464 | } | |
1465 | ||
a901125c | 1466 | list_for_each_entry_safe(fl, tmp, &ctx->flc_lease, fl_list) { |
df4e8d2c BF |
1467 | if (!leases_conflict(fl, new_fl)) |
1468 | continue; | |
778fc546 BF |
1469 | if (want_write) { |
1470 | if (fl->fl_flags & FL_UNLOCK_PENDING) | |
1471 | continue; | |
1472 | fl->fl_flags |= FL_UNLOCK_PENDING; | |
1da177e4 | 1473 | fl->fl_break_time = break_time; |
778fc546 | 1474 | } else { |
8634b51f | 1475 | if (lease_breaking(fl)) |
778fc546 BF |
1476 | continue; |
1477 | fl->fl_flags |= FL_DOWNGRADE_PENDING; | |
1478 | fl->fl_downgrade_time = break_time; | |
1da177e4 | 1479 | } |
4d01b7f5 | 1480 | if (fl->fl_lmops->lm_break(fl)) |
e084c1bd | 1481 | locks_delete_lock_ctx(fl, &dispose); |
1da177e4 LT |
1482 | } |
1483 | ||
8634b51f | 1484 | if (list_empty(&ctx->flc_lease)) |
4d01b7f5 JL |
1485 | goto out; |
1486 | ||
843c6b2f | 1487 | if (mode & O_NONBLOCK) { |
62af4f1f | 1488 | trace_break_lease_noblock(inode, new_fl); |
1da177e4 LT |
1489 | error = -EWOULDBLOCK; |
1490 | goto out; | |
1491 | } | |
1492 | ||
1493 | restart: | |
8634b51f JL |
1494 | fl = list_first_entry(&ctx->flc_lease, struct file_lock, fl_list); |
1495 | break_time = fl->fl_break_time; | |
f1c6bb2c | 1496 | if (break_time != 0) |
1da177e4 | 1497 | break_time -= jiffies; |
f1c6bb2c JL |
1498 | if (break_time == 0) |
1499 | break_time++; | |
fd7732e0 | 1500 | locks_insert_block(fl, new_fl, leases_conflict); |
62af4f1f | 1501 | trace_break_lease_block(inode, new_fl); |
6109c850 | 1502 | spin_unlock(&ctx->flc_lock); |
02e525b2 | 1503 | percpu_up_read(&file_rwsem); |
aba37660 | 1504 | |
c45198ed | 1505 | locks_dispose_list(&dispose); |
4321e01e | 1506 | error = wait_event_interruptible_timeout(new_fl->fl_wait, |
dcf23ac3 LT |
1507 | list_empty(&new_fl->fl_blocked_member), |
1508 | break_time); | |
aba37660 | 1509 | |
02e525b2 | 1510 | percpu_down_read(&file_rwsem); |
6109c850 | 1511 | spin_lock(&ctx->flc_lock); |
62af4f1f | 1512 | trace_break_lease_unblock(inode, new_fl); |
1c8c601a | 1513 | locks_delete_block(new_fl); |
1da177e4 | 1514 | if (error >= 0) { |
778fc546 BF |
1515 | /* |
1516 | * Wait for the next conflicting lease that has not been | |
1517 | * broken yet | |
1518 | */ | |
03d12ddf JL |
1519 | if (error == 0) |
1520 | time_out_leases(inode, &dispose); | |
1521 | if (any_leases_conflict(inode, new_fl)) | |
1522 | goto restart; | |
1da177e4 LT |
1523 | error = 0; |
1524 | } | |
1da177e4 | 1525 | out: |
6109c850 | 1526 | spin_unlock(&ctx->flc_lock); |
02e525b2 | 1527 | percpu_up_read(&file_rwsem); |
c45198ed | 1528 | locks_dispose_list(&dispose); |
cfddf9f4 | 1529 | free_lock: |
6d4b9e38 | 1530 | locks_free_lock(new_fl); |
1da177e4 LT |
1531 | return error; |
1532 | } | |
1da177e4 LT |
1533 | EXPORT_SYMBOL(__break_lease); |
1534 | ||
1535 | /** | |
76c47948 | 1536 | * lease_get_mtime - update modified time of an inode with exclusive lease |
1da177e4 | 1537 | * @inode: the inode |
76c47948 | 1538 | * @time: pointer to a timespec which contains the last modified time |
1da177e4 LT |
1539 | * |
1540 | * This is to force NFS clients to flush their caches for files with | |
1541 | * exclusive leases. The justification is that if someone has an | |
a6b91919 | 1542 | * exclusive lease, then they could be modifying it. |
1da177e4 | 1543 | */ |
95582b00 | 1544 | void lease_get_mtime(struct inode *inode, struct timespec64 *time) |
1da177e4 | 1545 | { |
bfe86024 | 1546 | bool has_lease = false; |
128a3785 | 1547 | struct file_lock_context *ctx; |
8634b51f | 1548 | struct file_lock *fl; |
bfe86024 | 1549 | |
128a3785 | 1550 | ctx = smp_load_acquire(&inode->i_flctx); |
8634b51f | 1551 | if (ctx && !list_empty_careful(&ctx->flc_lease)) { |
6109c850 | 1552 | spin_lock(&ctx->flc_lock); |
8ace5dfb GT |
1553 | fl = list_first_entry_or_null(&ctx->flc_lease, |
1554 | struct file_lock, fl_list); | |
1555 | if (fl && (fl->fl_type == F_WRLCK)) | |
1556 | has_lease = true; | |
6109c850 | 1557 | spin_unlock(&ctx->flc_lock); |
bfe86024 JL |
1558 | } |
1559 | ||
1560 | if (has_lease) | |
c2050a45 | 1561 | *time = current_time(inode); |
1da177e4 | 1562 | } |
1da177e4 LT |
1563 | EXPORT_SYMBOL(lease_get_mtime); |
1564 | ||
1565 | /** | |
1566 | * fcntl_getlease - Enquire what lease is currently active | |
1567 | * @filp: the file | |
1568 | * | |
1569 | * The value returned by this function will be one of | |
1570 | * (if no lease break is pending): | |
1571 | * | |
1572 | * %F_RDLCK to indicate a shared lease is held. | |
1573 | * | |
1574 | * %F_WRLCK to indicate an exclusive lease is held. | |
1575 | * | |
1576 | * %F_UNLCK to indicate no lease is held. | |
1577 | * | |
1578 | * (if a lease break is pending): | |
1579 | * | |
1580 | * %F_RDLCK to indicate an exclusive lease needs to be | |
1581 | * changed to a shared lease (or removed). | |
1582 | * | |
1583 | * %F_UNLCK to indicate the lease needs to be removed. | |
1584 | * | |
1585 | * XXX: sfr & willy disagree over whether F_INPROGRESS | |
1586 | * should be returned to userspace. | |
1587 | */ | |
1588 | int fcntl_getlease(struct file *filp) | |
1589 | { | |
1590 | struct file_lock *fl; | |
c568d683 | 1591 | struct inode *inode = locks_inode(filp); |
128a3785 | 1592 | struct file_lock_context *ctx; |
1da177e4 | 1593 | int type = F_UNLCK; |
c45198ed | 1594 | LIST_HEAD(dispose); |
1da177e4 | 1595 | |
128a3785 | 1596 | ctx = smp_load_acquire(&inode->i_flctx); |
8634b51f | 1597 | if (ctx && !list_empty_careful(&ctx->flc_lease)) { |
02e525b2 | 1598 | percpu_down_read(&file_rwsem); |
6109c850 | 1599 | spin_lock(&ctx->flc_lock); |
c568d683 | 1600 | time_out_leases(inode, &dispose); |
8634b51f JL |
1601 | list_for_each_entry(fl, &ctx->flc_lease, fl_list) { |
1602 | if (fl->fl_file != filp) | |
1603 | continue; | |
778fc546 | 1604 | type = target_leasetype(fl); |
1da177e4 LT |
1605 | break; |
1606 | } | |
6109c850 | 1607 | spin_unlock(&ctx->flc_lock); |
02e525b2 | 1608 | percpu_up_read(&file_rwsem); |
5f43086b | 1609 | |
8634b51f | 1610 | locks_dispose_list(&dispose); |
1da177e4 | 1611 | } |
1da177e4 LT |
1612 | return type; |
1613 | } | |
1614 | ||
24cbe784 | 1615 | /** |
387e3746 | 1616 | * check_conflicting_open - see if the given file points to an inode that has |
7bbd1fc0 N |
1617 | * an existing open that would conflict with the |
1618 | * desired lease. | |
387e3746 | 1619 | * @filp: file to check |
24cbe784 | 1620 | * @arg: type of lease that we're trying to acquire |
7fadc59c | 1621 | * @flags: current lock flags |
24cbe784 JL |
1622 | * |
1623 | * Check to see if there's an existing open fd on this file that would | |
1624 | * conflict with the lease we're trying to set. | |
1625 | */ | |
1626 | static int | |
387e3746 | 1627 | check_conflicting_open(struct file *filp, const long arg, int flags) |
24cbe784 | 1628 | { |
387e3746 AG |
1629 | struct inode *inode = locks_inode(filp); |
1630 | int self_wcount = 0, self_rcount = 0; | |
24cbe784 | 1631 | |
11afe9f7 CH |
1632 | if (flags & FL_LAYOUT) |
1633 | return 0; | |
aba2072f BF |
1634 | if (flags & FL_DELEG) |
1635 | /* We leave these checks to the caller */ | |
1636 | return 0; | |
11afe9f7 | 1637 | |
387e3746 AG |
1638 | if (arg == F_RDLCK) |
1639 | return inode_is_open_for_write(inode) ? -EAGAIN : 0; | |
1640 | else if (arg != F_WRLCK) | |
1641 | return 0; | |
1642 | ||
1643 | /* | |
1644 | * Make sure that only read/write count is from lease requestor. | |
1645 | * Note that this will result in denying write leases when i_writecount | |
1646 | * is negative, which is what we want. (We shouldn't grant write leases | |
1647 | * on files open for execution.) | |
1648 | */ | |
1649 | if (filp->f_mode & FMODE_WRITE) | |
1650 | self_wcount = 1; | |
1651 | else if (filp->f_mode & FMODE_READ) | |
1652 | self_rcount = 1; | |
24cbe784 | 1653 | |
387e3746 AG |
1654 | if (atomic_read(&inode->i_writecount) != self_wcount || |
1655 | atomic_read(&inode->i_readcount) != self_rcount) | |
1656 | return -EAGAIN; | |
24cbe784 | 1657 | |
387e3746 | 1658 | return 0; |
24cbe784 JL |
1659 | } |
1660 | ||
e6f5c789 JL |
1661 | static int |
1662 | generic_add_lease(struct file *filp, long arg, struct file_lock **flp, void **priv) | |
1da177e4 | 1663 | { |
8634b51f | 1664 | struct file_lock *fl, *my_fl = NULL, *lease; |
387e3746 | 1665 | struct inode *inode = locks_inode(filp); |
8634b51f | 1666 | struct file_lock_context *ctx; |
df4e8d2c | 1667 | bool is_deleg = (*flp)->fl_flags & FL_DELEG; |
c1f24ef4 | 1668 | int error; |
c45198ed | 1669 | LIST_HEAD(dispose); |
1da177e4 | 1670 | |
096657b6 | 1671 | lease = *flp; |
62af4f1f JL |
1672 | trace_generic_add_lease(inode, lease); |
1673 | ||
5c1c669a JL |
1674 | /* Note that arg is never F_UNLCK here */ |
1675 | ctx = locks_get_lock_context(inode, arg); | |
8634b51f JL |
1676 | if (!ctx) |
1677 | return -ENOMEM; | |
1678 | ||
df4e8d2c BF |
1679 | /* |
1680 | * In the delegation case we need mutual exclusion with | |
1681 | * a number of operations that take the i_mutex. We trylock | |
1682 | * because delegations are an optional optimization, and if | |
1683 | * there's some chance of a conflict--we'd rather not | |
1684 | * bother, maybe that's a sign this just isn't a good file to | |
1685 | * hand out a delegation on. | |
1686 | */ | |
5955102c | 1687 | if (is_deleg && !inode_trylock(inode)) |
df4e8d2c BF |
1688 | return -EAGAIN; |
1689 | ||
1690 | if (is_deleg && arg == F_WRLCK) { | |
1691 | /* Write delegations are not currently supported: */ | |
5955102c | 1692 | inode_unlock(inode); |
df4e8d2c BF |
1693 | WARN_ON_ONCE(1); |
1694 | return -EINVAL; | |
1695 | } | |
096657b6 | 1696 | |
02e525b2 | 1697 | percpu_down_read(&file_rwsem); |
6109c850 | 1698 | spin_lock(&ctx->flc_lock); |
c45198ed | 1699 | time_out_leases(inode, &dispose); |
387e3746 | 1700 | error = check_conflicting_open(filp, arg, lease->fl_flags); |
24cbe784 | 1701 | if (error) |
096657b6 | 1702 | goto out; |
6d5e8b05 | 1703 | |
1da177e4 LT |
1704 | /* |
1705 | * At this point, we know that if there is an exclusive | |
1706 | * lease on this file, then we hold it on this filp | |
1707 | * (otherwise our open of this file would have blocked). | |
1708 | * And if we are trying to acquire an exclusive lease, | |
1709 | * then the file is not open by anyone (including us) | |
1710 | * except for this filp. | |
1711 | */ | |
c1f24ef4 | 1712 | error = -EAGAIN; |
8634b51f | 1713 | list_for_each_entry(fl, &ctx->flc_lease, fl_list) { |
2ab99ee1 CH |
1714 | if (fl->fl_file == filp && |
1715 | fl->fl_owner == lease->fl_owner) { | |
8634b51f | 1716 | my_fl = fl; |
c1f24ef4 BF |
1717 | continue; |
1718 | } | |
8634b51f | 1719 | |
c1f24ef4 BF |
1720 | /* |
1721 | * No exclusive leases if someone else has a lease on | |
1722 | * this file: | |
1723 | */ | |
1724 | if (arg == F_WRLCK) | |
1725 | goto out; | |
1726 | /* | |
1727 | * Modifying our existing lease is OK, but no getting a | |
1728 | * new lease if someone else is opening for write: | |
1729 | */ | |
1730 | if (fl->fl_flags & FL_UNLOCK_PENDING) | |
1731 | goto out; | |
1da177e4 LT |
1732 | } |
1733 | ||
8634b51f | 1734 | if (my_fl != NULL) { |
0164bf02 JL |
1735 | lease = my_fl; |
1736 | error = lease->fl_lmops->lm_change(lease, arg, &dispose); | |
1c7dd2ff JL |
1737 | if (error) |
1738 | goto out; | |
1739 | goto out_setup; | |
1da177e4 LT |
1740 | } |
1741 | ||
1da177e4 LT |
1742 | error = -EINVAL; |
1743 | if (!leases_enable) | |
1744 | goto out; | |
1745 | ||
e084c1bd | 1746 | locks_insert_lock_ctx(lease, &ctx->flc_lease); |
24cbe784 JL |
1747 | /* |
1748 | * The check in break_lease() is lockless. It's possible for another | |
1749 | * open to race in after we did the earlier check for a conflicting | |
1750 | * open but before the lease was inserted. Check again for a | |
1751 | * conflicting open and cancel the lease if there is one. | |
1752 | * | |
1753 | * We also add a barrier here to ensure that the insertion of the lock | |
1754 | * precedes these checks. | |
1755 | */ | |
1756 | smp_mb(); | |
387e3746 | 1757 | error = check_conflicting_open(filp, arg, lease->fl_flags); |
8634b51f | 1758 | if (error) { |
e084c1bd | 1759 | locks_unlink_lock_ctx(lease); |
8634b51f JL |
1760 | goto out; |
1761 | } | |
1c7dd2ff JL |
1762 | |
1763 | out_setup: | |
1764 | if (lease->fl_lmops->lm_setup) | |
1765 | lease->fl_lmops->lm_setup(lease, priv); | |
1da177e4 | 1766 | out: |
6109c850 | 1767 | spin_unlock(&ctx->flc_lock); |
02e525b2 | 1768 | percpu_up_read(&file_rwsem); |
c45198ed | 1769 | locks_dispose_list(&dispose); |
df4e8d2c | 1770 | if (is_deleg) |
5955102c | 1771 | inode_unlock(inode); |
8634b51f | 1772 | if (!error && !my_fl) |
1c7dd2ff | 1773 | *flp = NULL; |
1da177e4 LT |
1774 | return error; |
1775 | } | |
8335ebd9 | 1776 | |
2ab99ee1 | 1777 | static int generic_delete_lease(struct file *filp, void *owner) |
8335ebd9 | 1778 | { |
0efaa7e8 | 1779 | int error = -EAGAIN; |
8634b51f | 1780 | struct file_lock *fl, *victim = NULL; |
c568d683 | 1781 | struct inode *inode = locks_inode(filp); |
128a3785 | 1782 | struct file_lock_context *ctx; |
c45198ed | 1783 | LIST_HEAD(dispose); |
8335ebd9 | 1784 | |
128a3785 | 1785 | ctx = smp_load_acquire(&inode->i_flctx); |
8634b51f JL |
1786 | if (!ctx) { |
1787 | trace_generic_delete_lease(inode, NULL); | |
1788 | return error; | |
1789 | } | |
1790 | ||
02e525b2 | 1791 | percpu_down_read(&file_rwsem); |
6109c850 | 1792 | spin_lock(&ctx->flc_lock); |
8634b51f | 1793 | list_for_each_entry(fl, &ctx->flc_lease, fl_list) { |
2ab99ee1 CH |
1794 | if (fl->fl_file == filp && |
1795 | fl->fl_owner == owner) { | |
8634b51f | 1796 | victim = fl; |
0efaa7e8 | 1797 | break; |
8634b51f | 1798 | } |
8335ebd9 | 1799 | } |
a9b1b455 | 1800 | trace_generic_delete_lease(inode, victim); |
8634b51f | 1801 | if (victim) |
7448cc37 | 1802 | error = fl->fl_lmops->lm_change(victim, F_UNLCK, &dispose); |
6109c850 | 1803 | spin_unlock(&ctx->flc_lock); |
02e525b2 | 1804 | percpu_up_read(&file_rwsem); |
c45198ed | 1805 | locks_dispose_list(&dispose); |
0efaa7e8 | 1806 | return error; |
8335ebd9 BF |
1807 | } |
1808 | ||
1809 | /** | |
1810 | * generic_setlease - sets a lease on an open file | |
1c7dd2ff JL |
1811 | * @filp: file pointer |
1812 | * @arg: type of lease to obtain | |
1813 | * @flp: input - file_lock to use, output - file_lock inserted | |
1814 | * @priv: private data for lm_setup (may be NULL if lm_setup | |
1815 | * doesn't require it) | |
8335ebd9 BF |
1816 | * |
1817 | * The (input) flp->fl_lmops->lm_break function is required | |
1818 | * by break_lease(). | |
8335ebd9 | 1819 | */ |
e6f5c789 JL |
1820 | int generic_setlease(struct file *filp, long arg, struct file_lock **flp, |
1821 | void **priv) | |
8335ebd9 | 1822 | { |
c568d683 | 1823 | struct inode *inode = locks_inode(filp); |
8335ebd9 BF |
1824 | int error; |
1825 | ||
8e96e3b7 | 1826 | if ((!uid_eq(current_fsuid(), inode->i_uid)) && !capable(CAP_LEASE)) |
8335ebd9 BF |
1827 | return -EACCES; |
1828 | if (!S_ISREG(inode->i_mode)) | |
1829 | return -EINVAL; | |
1830 | error = security_file_lock(filp, arg); | |
1831 | if (error) | |
1832 | return error; | |
1833 | ||
8335ebd9 BF |
1834 | switch (arg) { |
1835 | case F_UNLCK: | |
2ab99ee1 | 1836 | return generic_delete_lease(filp, *priv); |
8335ebd9 BF |
1837 | case F_RDLCK: |
1838 | case F_WRLCK: | |
0efaa7e8 JL |
1839 | if (!(*flp)->fl_lmops->lm_break) { |
1840 | WARN_ON_ONCE(1); | |
1841 | return -ENOLCK; | |
1842 | } | |
11afe9f7 | 1843 | |
e6f5c789 | 1844 | return generic_add_lease(filp, arg, flp, priv); |
8335ebd9 | 1845 | default: |
8d657eb3 | 1846 | return -EINVAL; |
8335ebd9 BF |
1847 | } |
1848 | } | |
0af1a450 | 1849 | EXPORT_SYMBOL(generic_setlease); |
1da177e4 | 1850 | |
18f6622e JL |
1851 | #if IS_ENABLED(CONFIG_SRCU) |
1852 | /* | |
1853 | * Kernel subsystems can register to be notified on any attempt to set | |
1854 | * a new lease with the lease_notifier_chain. This is used by (e.g.) nfsd | |
1855 | * to close files that it may have cached when there is an attempt to set a | |
1856 | * conflicting lease. | |
1857 | */ | |
1858 | static struct srcu_notifier_head lease_notifier_chain; | |
1859 | ||
1860 | static inline void | |
1861 | lease_notifier_chain_init(void) | |
1862 | { | |
1863 | srcu_init_notifier_head(&lease_notifier_chain); | |
1864 | } | |
1865 | ||
1866 | static inline void | |
1867 | setlease_notifier(long arg, struct file_lock *lease) | |
1868 | { | |
1869 | if (arg != F_UNLCK) | |
1870 | srcu_notifier_call_chain(&lease_notifier_chain, arg, lease); | |
1871 | } | |
1872 | ||
1873 | int lease_register_notifier(struct notifier_block *nb) | |
1874 | { | |
1875 | return srcu_notifier_chain_register(&lease_notifier_chain, nb); | |
1876 | } | |
1877 | EXPORT_SYMBOL_GPL(lease_register_notifier); | |
1878 | ||
1879 | void lease_unregister_notifier(struct notifier_block *nb) | |
1880 | { | |
1881 | srcu_notifier_chain_unregister(&lease_notifier_chain, nb); | |
1882 | } | |
1883 | EXPORT_SYMBOL_GPL(lease_unregister_notifier); | |
1884 | ||
1885 | #else /* !IS_ENABLED(CONFIG_SRCU) */ | |
1886 | static inline void | |
1887 | lease_notifier_chain_init(void) | |
1888 | { | |
1889 | } | |
1890 | ||
1891 | static inline void | |
1892 | setlease_notifier(long arg, struct file_lock *lease) | |
1893 | { | |
1894 | } | |
1895 | ||
1896 | int lease_register_notifier(struct notifier_block *nb) | |
1897 | { | |
1898 | return 0; | |
1899 | } | |
1900 | EXPORT_SYMBOL_GPL(lease_register_notifier); | |
1901 | ||
1902 | void lease_unregister_notifier(struct notifier_block *nb) | |
1903 | { | |
1904 | } | |
1905 | EXPORT_SYMBOL_GPL(lease_unregister_notifier); | |
1906 | ||
1907 | #endif /* IS_ENABLED(CONFIG_SRCU) */ | |
1908 | ||
b89f4321 | 1909 | /** |
e51673aa | 1910 | * vfs_setlease - sets a lease on an open file |
1c7dd2ff JL |
1911 | * @filp: file pointer |
1912 | * @arg: type of lease to obtain | |
1913 | * @lease: file_lock to use when adding a lease | |
1914 | * @priv: private info for lm_setup when adding a lease (may be | |
7bbd1fc0 | 1915 | * NULL if lm_setup doesn't require it) |
e51673aa JL |
1916 | * |
1917 | * Call this to establish a lease on the file. The "lease" argument is not | |
1918 | * used for F_UNLCK requests and may be NULL. For commands that set or alter | |
80b79dd0 MCC |
1919 | * an existing lease, the ``(*lease)->fl_lmops->lm_break`` operation must be |
1920 | * set; if not, this function will return -ENOLCK (and generate a scary-looking | |
e51673aa | 1921 | * stack trace). |
1c7dd2ff JL |
1922 | * |
1923 | * The "priv" pointer is passed directly to the lm_setup function as-is. It | |
1924 | * may be NULL if the lm_setup operation doesn't require it. | |
1da177e4 | 1925 | */ |
e6f5c789 JL |
1926 | int |
1927 | vfs_setlease(struct file *filp, long arg, struct file_lock **lease, void **priv) | |
1da177e4 | 1928 | { |
18f6622e JL |
1929 | if (lease) |
1930 | setlease_notifier(arg, *lease); | |
de2a4a50 | 1931 | if (filp->f_op->setlease) |
f82b4b67 | 1932 | return filp->f_op->setlease(filp, arg, lease, priv); |
1c7dd2ff | 1933 | else |
f82b4b67 | 1934 | return generic_setlease(filp, arg, lease, priv); |
1da177e4 | 1935 | } |
a9933cea | 1936 | EXPORT_SYMBOL_GPL(vfs_setlease); |
1da177e4 | 1937 | |
0ceaf6c7 | 1938 | static int do_fcntl_add_lease(unsigned int fd, struct file *filp, long arg) |
1da177e4 | 1939 | { |
1c7dd2ff | 1940 | struct file_lock *fl; |
f7347ce4 | 1941 | struct fasync_struct *new; |
1da177e4 LT |
1942 | int error; |
1943 | ||
c5b1f0d9 AB |
1944 | fl = lease_alloc(filp, arg); |
1945 | if (IS_ERR(fl)) | |
1946 | return PTR_ERR(fl); | |
1da177e4 | 1947 | |
f7347ce4 LT |
1948 | new = fasync_alloc(); |
1949 | if (!new) { | |
1950 | locks_free_lock(fl); | |
1951 | return -ENOMEM; | |
1952 | } | |
1c7dd2ff | 1953 | new->fa_fd = fd; |
f7347ce4 | 1954 | |
1c7dd2ff | 1955 | error = vfs_setlease(filp, arg, &fl, (void **)&new); |
2dfb928f JL |
1956 | if (fl) |
1957 | locks_free_lock(fl); | |
f7347ce4 LT |
1958 | if (new) |
1959 | fasync_free(new); | |
1da177e4 LT |
1960 | return error; |
1961 | } | |
1962 | ||
0ceaf6c7 BF |
1963 | /** |
1964 | * fcntl_setlease - sets a lease on an open file | |
1965 | * @fd: open file descriptor | |
1966 | * @filp: file pointer | |
1967 | * @arg: type of lease to obtain | |
1968 | * | |
1969 | * Call this fcntl to establish a lease on the file. | |
1970 | * Note that you also need to call %F_SETSIG to | |
1971 | * receive a signal when the lease is broken. | |
1972 | */ | |
1973 | int fcntl_setlease(unsigned int fd, struct file *filp, long arg) | |
1974 | { | |
1975 | if (arg == F_UNLCK) | |
2ab99ee1 | 1976 | return vfs_setlease(filp, F_UNLCK, NULL, (void **)&filp); |
0ceaf6c7 BF |
1977 | return do_fcntl_add_lease(fd, filp, arg); |
1978 | } | |
1979 | ||
1da177e4 | 1980 | /** |
29d01b22 JL |
1981 | * flock_lock_inode_wait - Apply a FLOCK-style lock to a file |
1982 | * @inode: inode of the file to apply to | |
1da177e4 LT |
1983 | * @fl: The lock to be applied |
1984 | * | |
29d01b22 | 1985 | * Apply a FLOCK style lock request to an inode. |
1da177e4 | 1986 | */ |
616fb38f | 1987 | static int flock_lock_inode_wait(struct inode *inode, struct file_lock *fl) |
1da177e4 LT |
1988 | { |
1989 | int error; | |
1990 | might_sleep(); | |
1991 | for (;;) { | |
29d01b22 | 1992 | error = flock_lock_inode(inode, fl); |
bde74e4b | 1993 | if (error != FILE_LOCK_DEFERRED) |
1da177e4 | 1994 | break; |
dcf23ac3 LT |
1995 | error = wait_event_interruptible(fl->fl_wait, |
1996 | list_empty(&fl->fl_blocked_member)); | |
16306a61 N |
1997 | if (error) |
1998 | break; | |
1da177e4 | 1999 | } |
16306a61 | 2000 | locks_delete_block(fl); |
1da177e4 LT |
2001 | return error; |
2002 | } | |
2003 | ||
e55c34a6 BC |
2004 | /** |
2005 | * locks_lock_inode_wait - Apply a lock to an inode | |
2006 | * @inode: inode of the file to apply to | |
2007 | * @fl: The lock to be applied | |
2008 | * | |
2009 | * Apply a POSIX or FLOCK style lock request to an inode. | |
2010 | */ | |
2011 | int locks_lock_inode_wait(struct inode *inode, struct file_lock *fl) | |
2012 | { | |
2013 | int res = 0; | |
2014 | switch (fl->fl_flags & (FL_POSIX|FL_FLOCK)) { | |
2015 | case FL_POSIX: | |
2016 | res = posix_lock_inode_wait(inode, fl); | |
2017 | break; | |
2018 | case FL_FLOCK: | |
2019 | res = flock_lock_inode_wait(inode, fl); | |
2020 | break; | |
2021 | default: | |
2022 | BUG(); | |
2023 | } | |
2024 | return res; | |
2025 | } | |
2026 | EXPORT_SYMBOL(locks_lock_inode_wait); | |
2027 | ||
1da177e4 LT |
2028 | /** |
2029 | * sys_flock: - flock() system call. | |
2030 | * @fd: the file descriptor to lock. | |
2031 | * @cmd: the type of lock to apply. | |
2032 | * | |
2033 | * Apply a %FL_FLOCK style lock to an open file descriptor. | |
80b79dd0 | 2034 | * The @cmd can be one of: |
1da177e4 | 2035 | * |
80b79dd0 MCC |
2036 | * - %LOCK_SH -- a shared lock. |
2037 | * - %LOCK_EX -- an exclusive lock. | |
2038 | * - %LOCK_UN -- remove an existing lock. | |
90f7d7a0 | 2039 | * - %LOCK_MAND -- a 'mandatory' flock. (DEPRECATED) |
1da177e4 | 2040 | * |
90f7d7a0 | 2041 | * %LOCK_MAND support has been removed from the kernel. |
1da177e4 | 2042 | */ |
002c8976 | 2043 | SYSCALL_DEFINE2(flock, unsigned int, fd, unsigned int, cmd) |
1da177e4 | 2044 | { |
2903ff01 | 2045 | struct fd f = fdget(fd); |
1da177e4 LT |
2046 | struct file_lock *lock; |
2047 | int can_sleep, unlock; | |
2048 | int error; | |
2049 | ||
2050 | error = -EBADF; | |
2903ff01 | 2051 | if (!f.file) |
1da177e4 LT |
2052 | goto out; |
2053 | ||
2054 | can_sleep = !(cmd & LOCK_NB); | |
2055 | cmd &= ~LOCK_NB; | |
2056 | unlock = (cmd == LOCK_UN); | |
2057 | ||
90f7d7a0 JL |
2058 | if (!unlock && !(f.file->f_mode & (FMODE_READ|FMODE_WRITE))) |
2059 | goto out_putf; | |
2060 | ||
2061 | /* | |
2062 | * LOCK_MAND locks were broken for a long time in that they never | |
2063 | * conflicted with one another and didn't prevent any sort of open, | |
2064 | * read or write activity. | |
2065 | * | |
2066 | * Just ignore these requests now, to preserve legacy behavior, but | |
2067 | * throw a warning to let people know that they don't actually work. | |
2068 | */ | |
2069 | if (cmd & LOCK_MAND) { | |
2070 | pr_warn_once("Attempt to set a LOCK_MAND lock via flock(2). This support has been removed and the request ignored.\n"); | |
2071 | error = 0; | |
1da177e4 | 2072 | goto out_putf; |
90f7d7a0 | 2073 | } |
1da177e4 | 2074 | |
d6367d62 | 2075 | lock = flock_make_lock(f.file, cmd, NULL); |
6e129d00 JL |
2076 | if (IS_ERR(lock)) { |
2077 | error = PTR_ERR(lock); | |
1da177e4 | 2078 | goto out_putf; |
6e129d00 JL |
2079 | } |
2080 | ||
1da177e4 LT |
2081 | if (can_sleep) |
2082 | lock->fl_flags |= FL_SLEEP; | |
2083 | ||
2903ff01 | 2084 | error = security_file_lock(f.file, lock->fl_type); |
1da177e4 LT |
2085 | if (error) |
2086 | goto out_free; | |
2087 | ||
de2a4a50 | 2088 | if (f.file->f_op->flock) |
2903ff01 | 2089 | error = f.file->f_op->flock(f.file, |
1da177e4 LT |
2090 | (can_sleep) ? F_SETLKW : F_SETLK, |
2091 | lock); | |
2092 | else | |
4f656367 | 2093 | error = locks_lock_file_wait(f.file, lock); |
1da177e4 LT |
2094 | |
2095 | out_free: | |
993dfa87 | 2096 | locks_free_lock(lock); |
1da177e4 LT |
2097 | |
2098 | out_putf: | |
2903ff01 | 2099 | fdput(f); |
1da177e4 LT |
2100 | out: |
2101 | return error; | |
2102 | } | |
2103 | ||
3ee17abd BF |
2104 | /** |
2105 | * vfs_test_lock - test file byte range lock | |
2106 | * @filp: The file to test lock for | |
6924c554 | 2107 | * @fl: The lock to test; also used to hold result |
3ee17abd BF |
2108 | * |
2109 | * Returns -ERRNO on failure. Indicates presence of conflicting lock by | |
2110 | * setting conf->fl_type to something other than F_UNLCK. | |
2111 | */ | |
2112 | int vfs_test_lock(struct file *filp, struct file_lock *fl) | |
2113 | { | |
de2a4a50 | 2114 | if (filp->f_op->lock) |
3ee17abd BF |
2115 | return filp->f_op->lock(filp, F_GETLK, fl); |
2116 | posix_test_lock(filp, fl); | |
2117 | return 0; | |
2118 | } | |
2119 | EXPORT_SYMBOL_GPL(vfs_test_lock); | |
2120 | ||
9d5b86ac BC |
2121 | /** |
2122 | * locks_translate_pid - translate a file_lock's fl_pid number into a namespace | |
2123 | * @fl: The file_lock who's fl_pid should be translated | |
2124 | * @ns: The namespace into which the pid should be translated | |
2125 | * | |
2126 | * Used to tranlate a fl_pid into a namespace virtual pid number | |
2127 | */ | |
2128 | static pid_t locks_translate_pid(struct file_lock *fl, struct pid_namespace *ns) | |
2129 | { | |
2130 | pid_t vnr; | |
2131 | struct pid *pid; | |
2132 | ||
2133 | if (IS_OFDLCK(fl)) | |
2134 | return -1; | |
2135 | if (IS_REMOTELCK(fl)) | |
2136 | return fl->fl_pid; | |
826d7bc9 KK |
2137 | /* |
2138 | * If the flock owner process is dead and its pid has been already | |
2139 | * freed, the translation below won't work, but we still want to show | |
2140 | * flock owner pid number in init pidns. | |
2141 | */ | |
2142 | if (ns == &init_pid_ns) | |
2143 | return (pid_t)fl->fl_pid; | |
9d5b86ac BC |
2144 | |
2145 | rcu_read_lock(); | |
2146 | pid = find_pid_ns(fl->fl_pid, &init_pid_ns); | |
2147 | vnr = pid_nr_ns(pid, ns); | |
2148 | rcu_read_unlock(); | |
2149 | return vnr; | |
2150 | } | |
2151 | ||
c2fa1b8a BF |
2152 | static int posix_lock_to_flock(struct flock *flock, struct file_lock *fl) |
2153 | { | |
9d5b86ac | 2154 | flock->l_pid = locks_translate_pid(fl, task_active_pid_ns(current)); |
c2fa1b8a BF |
2155 | #if BITS_PER_LONG == 32 |
2156 | /* | |
2157 | * Make sure we can represent the posix lock via | |
2158 | * legacy 32bit flock. | |
2159 | */ | |
2160 | if (fl->fl_start > OFFT_OFFSET_MAX) | |
2161 | return -EOVERFLOW; | |
2162 | if (fl->fl_end != OFFSET_MAX && fl->fl_end > OFFT_OFFSET_MAX) | |
2163 | return -EOVERFLOW; | |
2164 | #endif | |
2165 | flock->l_start = fl->fl_start; | |
2166 | flock->l_len = fl->fl_end == OFFSET_MAX ? 0 : | |
2167 | fl->fl_end - fl->fl_start + 1; | |
2168 | flock->l_whence = 0; | |
129a84de | 2169 | flock->l_type = fl->fl_type; |
c2fa1b8a BF |
2170 | return 0; |
2171 | } | |
2172 | ||
2173 | #if BITS_PER_LONG == 32 | |
2174 | static void posix_lock_to_flock64(struct flock64 *flock, struct file_lock *fl) | |
2175 | { | |
9d5b86ac | 2176 | flock->l_pid = locks_translate_pid(fl, task_active_pid_ns(current)); |
c2fa1b8a BF |
2177 | flock->l_start = fl->fl_start; |
2178 | flock->l_len = fl->fl_end == OFFSET_MAX ? 0 : | |
2179 | fl->fl_end - fl->fl_start + 1; | |
2180 | flock->l_whence = 0; | |
2181 | flock->l_type = fl->fl_type; | |
2182 | } | |
2183 | #endif | |
2184 | ||
1da177e4 LT |
2185 | /* Report the first existing lock that would conflict with l. |
2186 | * This implements the F_GETLK command of fcntl(). | |
2187 | */ | |
a75d30c7 | 2188 | int fcntl_getlk(struct file *filp, unsigned int cmd, struct flock *flock) |
1da177e4 | 2189 | { |
52306e88 | 2190 | struct file_lock *fl; |
1da177e4 LT |
2191 | int error; |
2192 | ||
52306e88 BC |
2193 | fl = locks_alloc_lock(); |
2194 | if (fl == NULL) | |
2195 | return -ENOMEM; | |
1da177e4 | 2196 | error = -EINVAL; |
a75d30c7 | 2197 | if (flock->l_type != F_RDLCK && flock->l_type != F_WRLCK) |
1da177e4 LT |
2198 | goto out; |
2199 | ||
52306e88 | 2200 | error = flock_to_posix_lock(filp, fl, flock); |
1da177e4 LT |
2201 | if (error) |
2202 | goto out; | |
2203 | ||
0d3f7a2d | 2204 | if (cmd == F_OFD_GETLK) { |
90478939 | 2205 | error = -EINVAL; |
a75d30c7 | 2206 | if (flock->l_pid != 0) |
90478939 JL |
2207 | goto out; |
2208 | ||
52306e88 BC |
2209 | fl->fl_flags |= FL_OFDLCK; |
2210 | fl->fl_owner = filp; | |
5d50ffd7 JL |
2211 | } |
2212 | ||
52306e88 | 2213 | error = vfs_test_lock(filp, fl); |
3ee17abd BF |
2214 | if (error) |
2215 | goto out; | |
7bbd1fc0 | 2216 | |
52306e88 BC |
2217 | flock->l_type = fl->fl_type; |
2218 | if (fl->fl_type != F_UNLCK) { | |
2219 | error = posix_lock_to_flock(flock, fl); | |
c2fa1b8a | 2220 | if (error) |
52306e88 | 2221 | goto out; |
1da177e4 | 2222 | } |
1da177e4 | 2223 | out: |
52306e88 | 2224 | locks_free_lock(fl); |
1da177e4 LT |
2225 | return error; |
2226 | } | |
2227 | ||
7723ec97 ME |
2228 | /** |
2229 | * vfs_lock_file - file byte range lock | |
2230 | * @filp: The file to apply the lock to | |
2231 | * @cmd: type of locking operation (F_SETLK, F_GETLK, etc.) | |
2232 | * @fl: The lock to be applied | |
150b3934 ME |
2233 | * @conf: Place to return a copy of the conflicting lock, if found. |
2234 | * | |
2235 | * A caller that doesn't care about the conflicting lock may pass NULL | |
2236 | * as the final argument. | |
2237 | * | |
2238 | * If the filesystem defines a private ->lock() method, then @conf will | |
2239 | * be left unchanged; so a caller that cares should initialize it to | |
2240 | * some acceptable default. | |
2beb6614 ME |
2241 | * |
2242 | * To avoid blocking kernel daemons, such as lockd, that need to acquire POSIX | |
2243 | * locks, the ->lock() interface may return asynchronously, before the lock has | |
2244 | * been granted or denied by the underlying filesystem, if (and only if) | |
8fb47a4f | 2245 | * lm_grant is set. Callers expecting ->lock() to return asynchronously |
2beb6614 ME |
2246 | * will only use F_SETLK, not F_SETLKW; they will set FL_SLEEP if (and only if) |
2247 | * the request is for a blocking lock. When ->lock() does return asynchronously, | |
8fb47a4f | 2248 | * it must return FILE_LOCK_DEFERRED, and call ->lm_grant() when the lock |
2beb6614 ME |
2249 | * request completes. |
2250 | * If the request is for non-blocking lock the file system should return | |
bde74e4b MS |
2251 | * FILE_LOCK_DEFERRED then try to get the lock and call the callback routine |
2252 | * with the result. If the request timed out the callback routine will return a | |
2beb6614 ME |
2253 | * nonzero return code and the file system should release the lock. The file |
2254 | * system is also responsible to keep a corresponding posix lock when it | |
2255 | * grants a lock so the VFS can find out which locks are locally held and do | |
2256 | * the correct lock cleanup when required. | |
2257 | * The underlying filesystem must not drop the kernel lock or call | |
8fb47a4f | 2258 | * ->lm_grant() before returning to the caller with a FILE_LOCK_DEFERRED |
2beb6614 | 2259 | * return code. |
7723ec97 | 2260 | */ |
150b3934 | 2261 | int vfs_lock_file(struct file *filp, unsigned int cmd, struct file_lock *fl, struct file_lock *conf) |
7723ec97 | 2262 | { |
de2a4a50 | 2263 | if (filp->f_op->lock) |
7723ec97 ME |
2264 | return filp->f_op->lock(filp, cmd, fl); |
2265 | else | |
150b3934 | 2266 | return posix_lock_file(filp, fl, conf); |
7723ec97 ME |
2267 | } |
2268 | EXPORT_SYMBOL_GPL(vfs_lock_file); | |
2269 | ||
b648a6de MS |
2270 | static int do_lock_file_wait(struct file *filp, unsigned int cmd, |
2271 | struct file_lock *fl) | |
2272 | { | |
2273 | int error; | |
2274 | ||
2275 | error = security_file_lock(filp, fl->fl_type); | |
2276 | if (error) | |
2277 | return error; | |
2278 | ||
764c76b3 MS |
2279 | for (;;) { |
2280 | error = vfs_lock_file(filp, cmd, fl, NULL); | |
2281 | if (error != FILE_LOCK_DEFERRED) | |
b648a6de | 2282 | break; |
dcf23ac3 LT |
2283 | error = wait_event_interruptible(fl->fl_wait, |
2284 | list_empty(&fl->fl_blocked_member)); | |
16306a61 N |
2285 | if (error) |
2286 | break; | |
b648a6de | 2287 | } |
16306a61 | 2288 | locks_delete_block(fl); |
b648a6de MS |
2289 | |
2290 | return error; | |
2291 | } | |
2292 | ||
6ca7d910 | 2293 | /* Ensure that fl->fl_file has compatible f_mode for F_SETLK calls */ |
cf01f4ee JL |
2294 | static int |
2295 | check_fmode_for_setlk(struct file_lock *fl) | |
2296 | { | |
2297 | switch (fl->fl_type) { | |
2298 | case F_RDLCK: | |
2299 | if (!(fl->fl_file->f_mode & FMODE_READ)) | |
2300 | return -EBADF; | |
2301 | break; | |
2302 | case F_WRLCK: | |
2303 | if (!(fl->fl_file->f_mode & FMODE_WRITE)) | |
2304 | return -EBADF; | |
2305 | } | |
2306 | return 0; | |
2307 | } | |
2308 | ||
1da177e4 LT |
2309 | /* Apply the lock described by l to an open file descriptor. |
2310 | * This implements both the F_SETLK and F_SETLKW commands of fcntl(). | |
2311 | */ | |
c293621b | 2312 | int fcntl_setlk(unsigned int fd, struct file *filp, unsigned int cmd, |
a75d30c7 | 2313 | struct flock *flock) |
1da177e4 LT |
2314 | { |
2315 | struct file_lock *file_lock = locks_alloc_lock(); | |
a75d30c7 | 2316 | struct inode *inode = locks_inode(filp); |
0b2bac2f | 2317 | struct file *f; |
1da177e4 LT |
2318 | int error; |
2319 | ||
2320 | if (file_lock == NULL) | |
2321 | return -ENOLCK; | |
2322 | ||
a75d30c7 | 2323 | error = flock_to_posix_lock(filp, file_lock, flock); |
1da177e4 LT |
2324 | if (error) |
2325 | goto out; | |
5d50ffd7 | 2326 | |
cf01f4ee JL |
2327 | error = check_fmode_for_setlk(file_lock); |
2328 | if (error) | |
2329 | goto out; | |
2330 | ||
5d50ffd7 JL |
2331 | /* |
2332 | * If the cmd is requesting file-private locks, then set the | |
cff2fce5 | 2333 | * FL_OFDLCK flag and override the owner. |
5d50ffd7 JL |
2334 | */ |
2335 | switch (cmd) { | |
0d3f7a2d | 2336 | case F_OFD_SETLK: |
90478939 | 2337 | error = -EINVAL; |
a75d30c7 | 2338 | if (flock->l_pid != 0) |
90478939 JL |
2339 | goto out; |
2340 | ||
5d50ffd7 | 2341 | cmd = F_SETLK; |
cff2fce5 | 2342 | file_lock->fl_flags |= FL_OFDLCK; |
73a8f5f7 | 2343 | file_lock->fl_owner = filp; |
5d50ffd7 | 2344 | break; |
0d3f7a2d | 2345 | case F_OFD_SETLKW: |
90478939 | 2346 | error = -EINVAL; |
a75d30c7 | 2347 | if (flock->l_pid != 0) |
90478939 JL |
2348 | goto out; |
2349 | ||
5d50ffd7 | 2350 | cmd = F_SETLKW; |
cff2fce5 | 2351 | file_lock->fl_flags |= FL_OFDLCK; |
73a8f5f7 | 2352 | file_lock->fl_owner = filp; |
df561f66 | 2353 | fallthrough; |
5d50ffd7 | 2354 | case F_SETLKW: |
1da177e4 LT |
2355 | file_lock->fl_flags |= FL_SLEEP; |
2356 | } | |
5d50ffd7 | 2357 | |
b648a6de | 2358 | error = do_lock_file_wait(filp, cmd, file_lock); |
1da177e4 | 2359 | |
c293621b | 2360 | /* |
0752ba80 JL |
2361 | * Attempt to detect a close/fcntl race and recover by releasing the |
2362 | * lock that was just acquired. There is no need to do that when we're | |
2363 | * unlocking though, or for OFD locks. | |
c293621b | 2364 | */ |
0752ba80 JL |
2365 | if (!error && file_lock->fl_type != F_UNLCK && |
2366 | !(file_lock->fl_flags & FL_OFDLCK)) { | |
120ce2b0 | 2367 | struct files_struct *files = current->files; |
7f3697e2 JL |
2368 | /* |
2369 | * We need that spin_lock here - it prevents reordering between | |
2370 | * update of i_flctx->flc_posix and check for it done in | |
2371 | * close(). rcu_read_lock() wouldn't do. | |
2372 | */ | |
120ce2b0 EB |
2373 | spin_lock(&files->file_lock); |
2374 | f = files_lookup_fd_locked(files, fd); | |
2375 | spin_unlock(&files->file_lock); | |
7f3697e2 JL |
2376 | if (f != filp) { |
2377 | file_lock->fl_type = F_UNLCK; | |
2378 | error = do_lock_file_wait(filp, cmd, file_lock); | |
2379 | WARN_ON_ONCE(error); | |
2380 | error = -EBADF; | |
2381 | } | |
1da177e4 | 2382 | } |
c293621b | 2383 | out: |
1890910f | 2384 | trace_fcntl_setlk(inode, file_lock, error); |
1da177e4 LT |
2385 | locks_free_lock(file_lock); |
2386 | return error; | |
2387 | } | |
2388 | ||
2389 | #if BITS_PER_LONG == 32 | |
2390 | /* Report the first existing lock that would conflict with l. | |
2391 | * This implements the F_GETLK command of fcntl(). | |
2392 | */ | |
a75d30c7 | 2393 | int fcntl_getlk64(struct file *filp, unsigned int cmd, struct flock64 *flock) |
1da177e4 | 2394 | { |
52306e88 | 2395 | struct file_lock *fl; |
1da177e4 LT |
2396 | int error; |
2397 | ||
52306e88 BC |
2398 | fl = locks_alloc_lock(); |
2399 | if (fl == NULL) | |
2400 | return -ENOMEM; | |
2401 | ||
1da177e4 | 2402 | error = -EINVAL; |
a75d30c7 | 2403 | if (flock->l_type != F_RDLCK && flock->l_type != F_WRLCK) |
1da177e4 LT |
2404 | goto out; |
2405 | ||
52306e88 | 2406 | error = flock64_to_posix_lock(filp, fl, flock); |
1da177e4 LT |
2407 | if (error) |
2408 | goto out; | |
2409 | ||
0d3f7a2d | 2410 | if (cmd == F_OFD_GETLK) { |
90478939 | 2411 | error = -EINVAL; |
a75d30c7 | 2412 | if (flock->l_pid != 0) |
90478939 JL |
2413 | goto out; |
2414 | ||
5d50ffd7 | 2415 | cmd = F_GETLK64; |
52306e88 BC |
2416 | fl->fl_flags |= FL_OFDLCK; |
2417 | fl->fl_owner = filp; | |
5d50ffd7 JL |
2418 | } |
2419 | ||
52306e88 | 2420 | error = vfs_test_lock(filp, fl); |
3ee17abd BF |
2421 | if (error) |
2422 | goto out; | |
2423 | ||
52306e88 BC |
2424 | flock->l_type = fl->fl_type; |
2425 | if (fl->fl_type != F_UNLCK) | |
2426 | posix_lock_to_flock64(flock, fl); | |
f328296e | 2427 | |
1da177e4 | 2428 | out: |
52306e88 | 2429 | locks_free_lock(fl); |
1da177e4 LT |
2430 | return error; |
2431 | } | |
2432 | ||
2433 | /* Apply the lock described by l to an open file descriptor. | |
2434 | * This implements both the F_SETLK and F_SETLKW commands of fcntl(). | |
2435 | */ | |
c293621b | 2436 | int fcntl_setlk64(unsigned int fd, struct file *filp, unsigned int cmd, |
a75d30c7 | 2437 | struct flock64 *flock) |
1da177e4 LT |
2438 | { |
2439 | struct file_lock *file_lock = locks_alloc_lock(); | |
0b2bac2f | 2440 | struct file *f; |
1da177e4 LT |
2441 | int error; |
2442 | ||
2443 | if (file_lock == NULL) | |
2444 | return -ENOLCK; | |
2445 | ||
a75d30c7 | 2446 | error = flock64_to_posix_lock(filp, file_lock, flock); |
1da177e4 LT |
2447 | if (error) |
2448 | goto out; | |
5d50ffd7 | 2449 | |
cf01f4ee JL |
2450 | error = check_fmode_for_setlk(file_lock); |
2451 | if (error) | |
2452 | goto out; | |
2453 | ||
5d50ffd7 JL |
2454 | /* |
2455 | * If the cmd is requesting file-private locks, then set the | |
cff2fce5 | 2456 | * FL_OFDLCK flag and override the owner. |
5d50ffd7 JL |
2457 | */ |
2458 | switch (cmd) { | |
0d3f7a2d | 2459 | case F_OFD_SETLK: |
90478939 | 2460 | error = -EINVAL; |
a75d30c7 | 2461 | if (flock->l_pid != 0) |
90478939 JL |
2462 | goto out; |
2463 | ||
5d50ffd7 | 2464 | cmd = F_SETLK64; |
cff2fce5 | 2465 | file_lock->fl_flags |= FL_OFDLCK; |
73a8f5f7 | 2466 | file_lock->fl_owner = filp; |
5d50ffd7 | 2467 | break; |
0d3f7a2d | 2468 | case F_OFD_SETLKW: |
90478939 | 2469 | error = -EINVAL; |
a75d30c7 | 2470 | if (flock->l_pid != 0) |
90478939 JL |
2471 | goto out; |
2472 | ||
5d50ffd7 | 2473 | cmd = F_SETLKW64; |
cff2fce5 | 2474 | file_lock->fl_flags |= FL_OFDLCK; |
73a8f5f7 | 2475 | file_lock->fl_owner = filp; |
df561f66 | 2476 | fallthrough; |
5d50ffd7 | 2477 | case F_SETLKW64: |
1da177e4 LT |
2478 | file_lock->fl_flags |= FL_SLEEP; |
2479 | } | |
5d50ffd7 | 2480 | |
b648a6de | 2481 | error = do_lock_file_wait(filp, cmd, file_lock); |
1da177e4 | 2482 | |
c293621b | 2483 | /* |
0752ba80 JL |
2484 | * Attempt to detect a close/fcntl race and recover by releasing the |
2485 | * lock that was just acquired. There is no need to do that when we're | |
2486 | * unlocking though, or for OFD locks. | |
c293621b | 2487 | */ |
0752ba80 JL |
2488 | if (!error && file_lock->fl_type != F_UNLCK && |
2489 | !(file_lock->fl_flags & FL_OFDLCK)) { | |
120ce2b0 | 2490 | struct files_struct *files = current->files; |
7f3697e2 JL |
2491 | /* |
2492 | * We need that spin_lock here - it prevents reordering between | |
2493 | * update of i_flctx->flc_posix and check for it done in | |
2494 | * close(). rcu_read_lock() wouldn't do. | |
2495 | */ | |
120ce2b0 EB |
2496 | spin_lock(&files->file_lock); |
2497 | f = files_lookup_fd_locked(files, fd); | |
2498 | spin_unlock(&files->file_lock); | |
7f3697e2 JL |
2499 | if (f != filp) { |
2500 | file_lock->fl_type = F_UNLCK; | |
2501 | error = do_lock_file_wait(filp, cmd, file_lock); | |
2502 | WARN_ON_ONCE(error); | |
2503 | error = -EBADF; | |
2504 | } | |
1da177e4 | 2505 | } |
1da177e4 LT |
2506 | out: |
2507 | locks_free_lock(file_lock); | |
2508 | return error; | |
2509 | } | |
2510 | #endif /* BITS_PER_LONG == 32 */ | |
2511 | ||
2512 | /* | |
2513 | * This function is called when the file is being removed | |
2514 | * from the task's fd array. POSIX locks belonging to this task | |
2515 | * are deleted at this time. | |
2516 | */ | |
2517 | void locks_remove_posix(struct file *filp, fl_owner_t owner) | |
2518 | { | |
1890910f | 2519 | int error; |
c568d683 | 2520 | struct inode *inode = locks_inode(filp); |
ff7b86b8 | 2521 | struct file_lock lock; |
128a3785 | 2522 | struct file_lock_context *ctx; |
1da177e4 LT |
2523 | |
2524 | /* | |
2525 | * If there are no locks held on this file, we don't need to call | |
2526 | * posix_lock_file(). Another process could be setting a lock on this | |
2527 | * file at the same time, but we wouldn't remove that lock anyway. | |
2528 | */ | |
c568d683 | 2529 | ctx = smp_load_acquire(&inode->i_flctx); |
bd61e0a9 | 2530 | if (!ctx || list_empty(&ctx->flc_posix)) |
1da177e4 LT |
2531 | return; |
2532 | ||
d6367d62 | 2533 | locks_init_lock(&lock); |
1da177e4 | 2534 | lock.fl_type = F_UNLCK; |
75e1fcc0 | 2535 | lock.fl_flags = FL_POSIX | FL_CLOSE; |
1da177e4 LT |
2536 | lock.fl_start = 0; |
2537 | lock.fl_end = OFFSET_MAX; | |
2538 | lock.fl_owner = owner; | |
2539 | lock.fl_pid = current->tgid; | |
2540 | lock.fl_file = filp; | |
2541 | lock.fl_ops = NULL; | |
2542 | lock.fl_lmops = NULL; | |
2543 | ||
1890910f | 2544 | error = vfs_lock_file(filp, F_SETLK, &lock, NULL); |
1da177e4 | 2545 | |
1da177e4 LT |
2546 | if (lock.fl_ops && lock.fl_ops->fl_release_private) |
2547 | lock.fl_ops->fl_release_private(&lock); | |
c568d683 | 2548 | trace_locks_remove_posix(inode, &lock, error); |
1da177e4 | 2549 | } |
1da177e4 LT |
2550 | EXPORT_SYMBOL(locks_remove_posix); |
2551 | ||
3d8e560d | 2552 | /* The i_flctx must be valid when calling into here */ |
dd459bb1 | 2553 | static void |
128a3785 | 2554 | locks_remove_flock(struct file *filp, struct file_lock_context *flctx) |
dd459bb1 | 2555 | { |
d6367d62 | 2556 | struct file_lock fl; |
c568d683 | 2557 | struct inode *inode = locks_inode(filp); |
dd459bb1 | 2558 | |
3d8e560d | 2559 | if (list_empty(&flctx->flc_flock)) |
dd459bb1 JL |
2560 | return; |
2561 | ||
d6367d62 N |
2562 | flock_make_lock(filp, LOCK_UN, &fl); |
2563 | fl.fl_flags |= FL_CLOSE; | |
2564 | ||
de2a4a50 | 2565 | if (filp->f_op->flock) |
dd459bb1 JL |
2566 | filp->f_op->flock(filp, F_SETLKW, &fl); |
2567 | else | |
bcd7f78d | 2568 | flock_lock_inode(inode, &fl); |
dd459bb1 JL |
2569 | |
2570 | if (fl.fl_ops && fl.fl_ops->fl_release_private) | |
2571 | fl.fl_ops->fl_release_private(&fl); | |
2572 | } | |
2573 | ||
3d8e560d | 2574 | /* The i_flctx must be valid when calling into here */ |
8634b51f | 2575 | static void |
128a3785 | 2576 | locks_remove_lease(struct file *filp, struct file_lock_context *ctx) |
8634b51f | 2577 | { |
8634b51f JL |
2578 | struct file_lock *fl, *tmp; |
2579 | LIST_HEAD(dispose); | |
2580 | ||
3d8e560d | 2581 | if (list_empty(&ctx->flc_lease)) |
8634b51f JL |
2582 | return; |
2583 | ||
02e525b2 | 2584 | percpu_down_read(&file_rwsem); |
6109c850 | 2585 | spin_lock(&ctx->flc_lock); |
8634b51f | 2586 | list_for_each_entry_safe(fl, tmp, &ctx->flc_lease, fl_list) |
c4e136cd JL |
2587 | if (filp == fl->fl_file) |
2588 | lease_modify(fl, F_UNLCK, &dispose); | |
6109c850 | 2589 | spin_unlock(&ctx->flc_lock); |
02e525b2 | 2590 | percpu_up_read(&file_rwsem); |
5f43086b | 2591 | |
8634b51f JL |
2592 | locks_dispose_list(&dispose); |
2593 | } | |
2594 | ||
1da177e4 LT |
2595 | /* |
2596 | * This function is called on the last close of an open file. | |
2597 | */ | |
78ed8a13 | 2598 | void locks_remove_file(struct file *filp) |
1da177e4 | 2599 | { |
128a3785 DV |
2600 | struct file_lock_context *ctx; |
2601 | ||
c568d683 | 2602 | ctx = smp_load_acquire(&locks_inode(filp)->i_flctx); |
128a3785 | 2603 | if (!ctx) |
3d8e560d JL |
2604 | return; |
2605 | ||
dd459bb1 | 2606 | /* remove any OFD locks */ |
73a8f5f7 | 2607 | locks_remove_posix(filp, filp); |
5d50ffd7 | 2608 | |
dd459bb1 | 2609 | /* remove flock locks */ |
128a3785 | 2610 | locks_remove_flock(filp, ctx); |
dd459bb1 | 2611 | |
8634b51f | 2612 | /* remove any leases */ |
128a3785 | 2613 | locks_remove_lease(filp, ctx); |
3953704f BC |
2614 | |
2615 | spin_lock(&ctx->flc_lock); | |
2616 | locks_check_ctx_file_list(filp, &ctx->flc_posix, "POSIX"); | |
2617 | locks_check_ctx_file_list(filp, &ctx->flc_flock, "FLOCK"); | |
2618 | locks_check_ctx_file_list(filp, &ctx->flc_lease, "LEASE"); | |
2619 | spin_unlock(&ctx->flc_lock); | |
1da177e4 LT |
2620 | } |
2621 | ||
9b9d2ab4 ME |
2622 | /** |
2623 | * vfs_cancel_lock - file byte range unblock lock | |
2624 | * @filp: The file to apply the unblock to | |
2625 | * @fl: The lock to be unblocked | |
2626 | * | |
2627 | * Used by lock managers to cancel blocked requests | |
2628 | */ | |
2629 | int vfs_cancel_lock(struct file *filp, struct file_lock *fl) | |
2630 | { | |
de2a4a50 | 2631 | if (filp->f_op->lock) |
9b9d2ab4 ME |
2632 | return filp->f_op->lock(filp, F_CANCELLK, fl); |
2633 | return 0; | |
2634 | } | |
9b9d2ab4 ME |
2635 | EXPORT_SYMBOL_GPL(vfs_cancel_lock); |
2636 | ||
7f8ada98 | 2637 | #ifdef CONFIG_PROC_FS |
d8ba7a36 | 2638 | #include <linux/proc_fs.h> |
7f8ada98 PE |
2639 | #include <linux/seq_file.h> |
2640 | ||
7012b02a JL |
2641 | struct locks_iterator { |
2642 | int li_cpu; | |
2643 | loff_t li_pos; | |
2644 | }; | |
2645 | ||
7f8ada98 | 2646 | static void lock_get_status(struct seq_file *f, struct file_lock *fl, |
b8da9b10 | 2647 | loff_t id, char *pfx, int repeat) |
1da177e4 LT |
2648 | { |
2649 | struct inode *inode = NULL; | |
ab1f1611 | 2650 | unsigned int fl_pid; |
9d78edea | 2651 | struct pid_namespace *proc_pidns = proc_pid_ns(file_inode(f->file)->i_sb); |
90f7d7a0 | 2652 | int type; |
ab1f1611 | 2653 | |
9d5b86ac BC |
2654 | fl_pid = locks_translate_pid(fl, proc_pidns); |
2655 | /* | |
1cf8e5de KK |
2656 | * If lock owner is dead (and pid is freed) or not visible in current |
2657 | * pidns, zero is shown as a pid value. Check lock info from | |
2658 | * init_pid_ns to get saved lock pid value. | |
9d5b86ac | 2659 | */ |
1da177e4 LT |
2660 | |
2661 | if (fl->fl_file != NULL) | |
c568d683 | 2662 | inode = locks_inode(fl->fl_file); |
1da177e4 | 2663 | |
b8da9b10 LL |
2664 | seq_printf(f, "%lld: ", id); |
2665 | ||
2666 | if (repeat) | |
2667 | seq_printf(f, "%*s", repeat - 1 + (int)strlen(pfx), pfx); | |
2668 | ||
1da177e4 | 2669 | if (IS_POSIX(fl)) { |
c918d42a | 2670 | if (fl->fl_flags & FL_ACCESS) |
5315c26a | 2671 | seq_puts(f, "ACCESS"); |
cff2fce5 | 2672 | else if (IS_OFDLCK(fl)) |
5315c26a | 2673 | seq_puts(f, "OFDLCK"); |
c918d42a | 2674 | else |
5315c26a | 2675 | seq_puts(f, "POSIX "); |
c918d42a JL |
2676 | |
2677 | seq_printf(f, " %s ", | |
f7e33bdb | 2678 | (inode == NULL) ? "*NOINODE*" : "ADVISORY "); |
1da177e4 | 2679 | } else if (IS_FLOCK(fl)) { |
90f7d7a0 | 2680 | seq_puts(f, "FLOCK ADVISORY "); |
1da177e4 | 2681 | } else if (IS_LEASE(fl)) { |
8144f1f6 JL |
2682 | if (fl->fl_flags & FL_DELEG) |
2683 | seq_puts(f, "DELEG "); | |
2684 | else | |
2685 | seq_puts(f, "LEASE "); | |
2686 | ||
ab83fa4b | 2687 | if (lease_breaking(fl)) |
5315c26a | 2688 | seq_puts(f, "BREAKING "); |
1da177e4 | 2689 | else if (fl->fl_file) |
5315c26a | 2690 | seq_puts(f, "ACTIVE "); |
1da177e4 | 2691 | else |
5315c26a | 2692 | seq_puts(f, "BREAKER "); |
1da177e4 | 2693 | } else { |
5315c26a | 2694 | seq_puts(f, "UNKNOWN UNKNOWN "); |
1da177e4 | 2695 | } |
90f7d7a0 | 2696 | type = IS_LEASE(fl) ? target_leasetype(fl) : fl->fl_type; |
43e4cb94 | 2697 | |
90f7d7a0 JL |
2698 | seq_printf(f, "%s ", (type == F_WRLCK) ? "WRITE" : |
2699 | (type == F_RDLCK) ? "READ" : "UNLCK"); | |
1da177e4 | 2700 | if (inode) { |
3648888e | 2701 | /* userspace relies on this representation of dev_t */ |
98ca480a | 2702 | seq_printf(f, "%d %02x:%02x:%lu ", fl_pid, |
1da177e4 LT |
2703 | MAJOR(inode->i_sb->s_dev), |
2704 | MINOR(inode->i_sb->s_dev), inode->i_ino); | |
1da177e4 | 2705 | } else { |
ab1f1611 | 2706 | seq_printf(f, "%d <none>:0 ", fl_pid); |
1da177e4 LT |
2707 | } |
2708 | if (IS_POSIX(fl)) { | |
2709 | if (fl->fl_end == OFFSET_MAX) | |
7f8ada98 | 2710 | seq_printf(f, "%Ld EOF\n", fl->fl_start); |
1da177e4 | 2711 | else |
7f8ada98 | 2712 | seq_printf(f, "%Ld %Ld\n", fl->fl_start, fl->fl_end); |
1da177e4 | 2713 | } else { |
5315c26a | 2714 | seq_puts(f, "0 EOF\n"); |
1da177e4 LT |
2715 | } |
2716 | } | |
2717 | ||
b8da9b10 LL |
2718 | static struct file_lock *get_next_blocked_member(struct file_lock *node) |
2719 | { | |
2720 | struct file_lock *tmp; | |
2721 | ||
2722 | /* NULL node or root node */ | |
2723 | if (node == NULL || node->fl_blocker == NULL) | |
2724 | return NULL; | |
2725 | ||
2726 | /* Next member in the linked list could be itself */ | |
2727 | tmp = list_next_entry(node, fl_blocked_member); | |
2728 | if (list_entry_is_head(tmp, &node->fl_blocker->fl_blocked_requests, fl_blocked_member) | |
2729 | || tmp == node) { | |
2730 | return NULL; | |
2731 | } | |
2732 | ||
2733 | return tmp; | |
2734 | } | |
2735 | ||
7f8ada98 | 2736 | static int locks_show(struct seq_file *f, void *v) |
1da177e4 | 2737 | { |
7012b02a | 2738 | struct locks_iterator *iter = f->private; |
b8da9b10 | 2739 | struct file_lock *cur, *tmp; |
9d78edea | 2740 | struct pid_namespace *proc_pidns = proc_pid_ns(file_inode(f->file)->i_sb); |
b8da9b10 | 2741 | int level = 0; |
1da177e4 | 2742 | |
b8da9b10 | 2743 | cur = hlist_entry(v, struct file_lock, fl_link); |
1da177e4 | 2744 | |
b8da9b10 | 2745 | if (locks_translate_pid(cur, proc_pidns) == 0) |
d67fd44f NB |
2746 | return 0; |
2747 | ||
b8da9b10 LL |
2748 | /* View this crossed linked list as a binary tree, the first member of fl_blocked_requests |
2749 | * is the left child of current node, the next silibing in fl_blocked_member is the | |
2750 | * right child, we can alse get the parent of current node from fl_blocker, so this | |
2751 | * question becomes traversal of a binary tree | |
2752 | */ | |
2753 | while (cur != NULL) { | |
2754 | if (level) | |
2755 | lock_get_status(f, cur, iter->li_pos, "-> ", level); | |
2756 | else | |
2757 | lock_get_status(f, cur, iter->li_pos, "", level); | |
1da177e4 | 2758 | |
b8da9b10 LL |
2759 | if (!list_empty(&cur->fl_blocked_requests)) { |
2760 | /* Turn left */ | |
2761 | cur = list_first_entry_or_null(&cur->fl_blocked_requests, | |
2762 | struct file_lock, fl_blocked_member); | |
2763 | level++; | |
2764 | } else { | |
2765 | /* Turn right */ | |
2766 | tmp = get_next_blocked_member(cur); | |
2767 | /* Fall back to parent node */ | |
2768 | while (tmp == NULL && cur->fl_blocker != NULL) { | |
2769 | cur = cur->fl_blocker; | |
2770 | level--; | |
2771 | tmp = get_next_blocked_member(cur); | |
2772 | } | |
2773 | cur = tmp; | |
2774 | } | |
2775 | } | |
094f2825 | 2776 | |
7f8ada98 PE |
2777 | return 0; |
2778 | } | |
1da177e4 | 2779 | |
6c8c9031 AV |
2780 | static void __show_fd_locks(struct seq_file *f, |
2781 | struct list_head *head, int *id, | |
2782 | struct file *filp, struct files_struct *files) | |
2783 | { | |
2784 | struct file_lock *fl; | |
2785 | ||
2786 | list_for_each_entry(fl, head, fl_list) { | |
2787 | ||
2788 | if (filp != fl->fl_file) | |
2789 | continue; | |
2790 | if (fl->fl_owner != files && | |
2791 | fl->fl_owner != filp) | |
2792 | continue; | |
2793 | ||
2794 | (*id)++; | |
2795 | seq_puts(f, "lock:\t"); | |
b8da9b10 | 2796 | lock_get_status(f, fl, *id, "", 0); |
6c8c9031 AV |
2797 | } |
2798 | } | |
2799 | ||
2800 | void show_fd_locks(struct seq_file *f, | |
2801 | struct file *filp, struct files_struct *files) | |
2802 | { | |
c568d683 | 2803 | struct inode *inode = locks_inode(filp); |
6c8c9031 AV |
2804 | struct file_lock_context *ctx; |
2805 | int id = 0; | |
2806 | ||
128a3785 | 2807 | ctx = smp_load_acquire(&inode->i_flctx); |
6c8c9031 AV |
2808 | if (!ctx) |
2809 | return; | |
2810 | ||
2811 | spin_lock(&ctx->flc_lock); | |
2812 | __show_fd_locks(f, &ctx->flc_flock, &id, filp, files); | |
2813 | __show_fd_locks(f, &ctx->flc_posix, &id, filp, files); | |
2814 | __show_fd_locks(f, &ctx->flc_lease, &id, filp, files); | |
2815 | spin_unlock(&ctx->flc_lock); | |
2816 | } | |
2817 | ||
7f8ada98 | 2818 | static void *locks_start(struct seq_file *f, loff_t *pos) |
b03dfdec | 2819 | __acquires(&blocked_lock_lock) |
7f8ada98 | 2820 | { |
7012b02a | 2821 | struct locks_iterator *iter = f->private; |
99dc8292 | 2822 | |
7012b02a | 2823 | iter->li_pos = *pos + 1; |
aba37660 | 2824 | percpu_down_write(&file_rwsem); |
7b2296af | 2825 | spin_lock(&blocked_lock_lock); |
7c3f654d | 2826 | return seq_hlist_start_percpu(&file_lock_list.hlist, &iter->li_cpu, *pos); |
7f8ada98 | 2827 | } |
1da177e4 | 2828 | |
7f8ada98 PE |
2829 | static void *locks_next(struct seq_file *f, void *v, loff_t *pos) |
2830 | { | |
7012b02a JL |
2831 | struct locks_iterator *iter = f->private; |
2832 | ||
2833 | ++iter->li_pos; | |
7c3f654d | 2834 | return seq_hlist_next_percpu(v, &file_lock_list.hlist, &iter->li_cpu, pos); |
7f8ada98 | 2835 | } |
1da177e4 | 2836 | |
7f8ada98 | 2837 | static void locks_stop(struct seq_file *f, void *v) |
b03dfdec | 2838 | __releases(&blocked_lock_lock) |
7f8ada98 | 2839 | { |
7b2296af | 2840 | spin_unlock(&blocked_lock_lock); |
aba37660 | 2841 | percpu_up_write(&file_rwsem); |
1da177e4 LT |
2842 | } |
2843 | ||
d8ba7a36 | 2844 | static const struct seq_operations locks_seq_operations = { |
7f8ada98 PE |
2845 | .start = locks_start, |
2846 | .next = locks_next, | |
2847 | .stop = locks_stop, | |
2848 | .show = locks_show, | |
2849 | }; | |
d8ba7a36 | 2850 | |
d8ba7a36 AD |
2851 | static int __init proc_locks_init(void) |
2852 | { | |
44414d82 CH |
2853 | proc_create_seq_private("locks", 0, NULL, &locks_seq_operations, |
2854 | sizeof(struct locks_iterator), NULL); | |
d8ba7a36 AD |
2855 | return 0; |
2856 | } | |
91899226 | 2857 | fs_initcall(proc_locks_init); |
7f8ada98 PE |
2858 | #endif |
2859 | ||
1da177e4 LT |
2860 | static int __init filelock_init(void) |
2861 | { | |
7012b02a JL |
2862 | int i; |
2863 | ||
4a075e39 | 2864 | flctx_cache = kmem_cache_create("file_lock_ctx", |
3754707b | 2865 | sizeof(struct file_lock_context), 0, SLAB_PANIC, NULL); |
4a075e39 | 2866 | |
1da177e4 | 2867 | filelock_cache = kmem_cache_create("file_lock_cache", |
3754707b | 2868 | sizeof(struct file_lock), 0, SLAB_PANIC, NULL); |
ee19cc40 | 2869 | |
7c3f654d PZ |
2870 | for_each_possible_cpu(i) { |
2871 | struct file_lock_list_struct *fll = per_cpu_ptr(&file_lock_list, i); | |
2872 | ||
2873 | spin_lock_init(&fll->lock); | |
2874 | INIT_HLIST_HEAD(&fll->hlist); | |
2875 | } | |
7012b02a | 2876 | |
18f6622e | 2877 | lease_notifier_chain_init(); |
1da177e4 LT |
2878 | return 0; |
2879 | } | |
1da177e4 | 2880 | core_initcall(filelock_init); |