Loading...
1/*
2 FUSE: Filesystem in Userspace
3 Copyright (C) 2001-2008 Miklos Szeredi <miklos@szeredi.hu>
4
5 This program can be distributed under the terms of the GNU GPL.
6 See the file COPYING.
7*/
8
9#include "fuse_i.h"
10
11#include <linux/init.h>
12#include <linux/module.h>
13#include <linux/poll.h>
14#include <linux/uio.h>
15#include <linux/miscdevice.h>
16#include <linux/pagemap.h>
17#include <linux/file.h>
18#include <linux/slab.h>
19#include <linux/pipe_fs_i.h>
20#include <linux/swap.h>
21#include <linux/splice.h>
22
23MODULE_ALIAS_MISCDEV(FUSE_MINOR);
24MODULE_ALIAS("devname:fuse");
25
26static struct kmem_cache *fuse_req_cachep;
27
28static struct fuse_dev *fuse_get_dev(struct file *file)
29{
30 /*
31 * Lockless access is OK, because file->private data is set
32 * once during mount and is valid until the file is released.
33 */
34 return ACCESS_ONCE(file->private_data);
35}
36
37static void fuse_request_init(struct fuse_req *req, struct page **pages,
38 struct fuse_page_desc *page_descs,
39 unsigned npages)
40{
41 memset(req, 0, sizeof(*req));
42 memset(pages, 0, sizeof(*pages) * npages);
43 memset(page_descs, 0, sizeof(*page_descs) * npages);
44 INIT_LIST_HEAD(&req->list);
45 INIT_LIST_HEAD(&req->intr_entry);
46 init_waitqueue_head(&req->waitq);
47 atomic_set(&req->count, 1);
48 req->pages = pages;
49 req->page_descs = page_descs;
50 req->max_pages = npages;
51 __set_bit(FR_PENDING, &req->flags);
52}
53
54static struct fuse_req *__fuse_request_alloc(unsigned npages, gfp_t flags)
55{
56 struct fuse_req *req = kmem_cache_alloc(fuse_req_cachep, flags);
57 if (req) {
58 struct page **pages;
59 struct fuse_page_desc *page_descs;
60
61 if (npages <= FUSE_REQ_INLINE_PAGES) {
62 pages = req->inline_pages;
63 page_descs = req->inline_page_descs;
64 } else {
65 pages = kmalloc(sizeof(struct page *) * npages, flags);
66 page_descs = kmalloc(sizeof(struct fuse_page_desc) *
67 npages, flags);
68 }
69
70 if (!pages || !page_descs) {
71 kfree(pages);
72 kfree(page_descs);
73 kmem_cache_free(fuse_req_cachep, req);
74 return NULL;
75 }
76
77 fuse_request_init(req, pages, page_descs, npages);
78 }
79 return req;
80}
81
82struct fuse_req *fuse_request_alloc(unsigned npages)
83{
84 return __fuse_request_alloc(npages, GFP_KERNEL);
85}
86EXPORT_SYMBOL_GPL(fuse_request_alloc);
87
88struct fuse_req *fuse_request_alloc_nofs(unsigned npages)
89{
90 return __fuse_request_alloc(npages, GFP_NOFS);
91}
92
93void fuse_request_free(struct fuse_req *req)
94{
95 if (req->pages != req->inline_pages) {
96 kfree(req->pages);
97 kfree(req->page_descs);
98 }
99 kmem_cache_free(fuse_req_cachep, req);
100}
101
102void __fuse_get_request(struct fuse_req *req)
103{
104 atomic_inc(&req->count);
105}
106
107/* Must be called with > 1 refcount */
108static void __fuse_put_request(struct fuse_req *req)
109{
110 BUG_ON(atomic_read(&req->count) < 2);
111 atomic_dec(&req->count);
112}
113
114static void fuse_req_init_context(struct fuse_req *req)
115{
116 req->in.h.uid = from_kuid_munged(&init_user_ns, current_fsuid());
117 req->in.h.gid = from_kgid_munged(&init_user_ns, current_fsgid());
118 req->in.h.pid = current->pid;
119}
120
121void fuse_set_initialized(struct fuse_conn *fc)
122{
123 /* Make sure stores before this are seen on another CPU */
124 smp_wmb();
125 fc->initialized = 1;
126}
127
128static bool fuse_block_alloc(struct fuse_conn *fc, bool for_background)
129{
130 return !fc->initialized || (for_background && fc->blocked);
131}
132
133static struct fuse_req *__fuse_get_req(struct fuse_conn *fc, unsigned npages,
134 bool for_background)
135{
136 struct fuse_req *req;
137 int err;
138 atomic_inc(&fc->num_waiting);
139
140 if (fuse_block_alloc(fc, for_background)) {
141 err = -EINTR;
142 if (wait_event_killable_exclusive(fc->blocked_waitq,
143 !fuse_block_alloc(fc, for_background)))
144 goto out;
145 }
146 /* Matches smp_wmb() in fuse_set_initialized() */
147 smp_rmb();
148
149 err = -ENOTCONN;
150 if (!fc->connected)
151 goto out;
152
153 err = -ECONNREFUSED;
154 if (fc->conn_error)
155 goto out;
156
157 req = fuse_request_alloc(npages);
158 err = -ENOMEM;
159 if (!req) {
160 if (for_background)
161 wake_up(&fc->blocked_waitq);
162 goto out;
163 }
164
165 fuse_req_init_context(req);
166 __set_bit(FR_WAITING, &req->flags);
167 if (for_background)
168 __set_bit(FR_BACKGROUND, &req->flags);
169
170 return req;
171
172 out:
173 atomic_dec(&fc->num_waiting);
174 return ERR_PTR(err);
175}
176
177struct fuse_req *fuse_get_req(struct fuse_conn *fc, unsigned npages)
178{
179 return __fuse_get_req(fc, npages, false);
180}
181EXPORT_SYMBOL_GPL(fuse_get_req);
182
183struct fuse_req *fuse_get_req_for_background(struct fuse_conn *fc,
184 unsigned npages)
185{
186 return __fuse_get_req(fc, npages, true);
187}
188EXPORT_SYMBOL_GPL(fuse_get_req_for_background);
189
190/*
191 * Return request in fuse_file->reserved_req. However that may
192 * currently be in use. If that is the case, wait for it to become
193 * available.
194 */
195static struct fuse_req *get_reserved_req(struct fuse_conn *fc,
196 struct file *file)
197{
198 struct fuse_req *req = NULL;
199 struct fuse_file *ff = file->private_data;
200
201 do {
202 wait_event(fc->reserved_req_waitq, ff->reserved_req);
203 spin_lock(&fc->lock);
204 if (ff->reserved_req) {
205 req = ff->reserved_req;
206 ff->reserved_req = NULL;
207 req->stolen_file = get_file(file);
208 }
209 spin_unlock(&fc->lock);
210 } while (!req);
211
212 return req;
213}
214
215/*
216 * Put stolen request back into fuse_file->reserved_req
217 */
218static void put_reserved_req(struct fuse_conn *fc, struct fuse_req *req)
219{
220 struct file *file = req->stolen_file;
221 struct fuse_file *ff = file->private_data;
222
223 spin_lock(&fc->lock);
224 fuse_request_init(req, req->pages, req->page_descs, req->max_pages);
225 BUG_ON(ff->reserved_req);
226 ff->reserved_req = req;
227 wake_up_all(&fc->reserved_req_waitq);
228 spin_unlock(&fc->lock);
229 fput(file);
230}
231
232/*
233 * Gets a requests for a file operation, always succeeds
234 *
235 * This is used for sending the FLUSH request, which must get to
236 * userspace, due to POSIX locks which may need to be unlocked.
237 *
238 * If allocation fails due to OOM, use the reserved request in
239 * fuse_file.
240 *
241 * This is very unlikely to deadlock accidentally, since the
242 * filesystem should not have it's own file open. If deadlock is
243 * intentional, it can still be broken by "aborting" the filesystem.
244 */
245struct fuse_req *fuse_get_req_nofail_nopages(struct fuse_conn *fc,
246 struct file *file)
247{
248 struct fuse_req *req;
249
250 atomic_inc(&fc->num_waiting);
251 wait_event(fc->blocked_waitq, fc->initialized);
252 /* Matches smp_wmb() in fuse_set_initialized() */
253 smp_rmb();
254 req = fuse_request_alloc(0);
255 if (!req)
256 req = get_reserved_req(fc, file);
257
258 fuse_req_init_context(req);
259 __set_bit(FR_WAITING, &req->flags);
260 __clear_bit(FR_BACKGROUND, &req->flags);
261 return req;
262}
263
264void fuse_put_request(struct fuse_conn *fc, struct fuse_req *req)
265{
266 if (atomic_dec_and_test(&req->count)) {
267 if (test_bit(FR_BACKGROUND, &req->flags)) {
268 /*
269 * We get here in the unlikely case that a background
270 * request was allocated but not sent
271 */
272 spin_lock(&fc->lock);
273 if (!fc->blocked)
274 wake_up(&fc->blocked_waitq);
275 spin_unlock(&fc->lock);
276 }
277
278 if (test_bit(FR_WAITING, &req->flags)) {
279 __clear_bit(FR_WAITING, &req->flags);
280 atomic_dec(&fc->num_waiting);
281 }
282
283 if (req->stolen_file)
284 put_reserved_req(fc, req);
285 else
286 fuse_request_free(req);
287 }
288}
289EXPORT_SYMBOL_GPL(fuse_put_request);
290
291static unsigned len_args(unsigned numargs, struct fuse_arg *args)
292{
293 unsigned nbytes = 0;
294 unsigned i;
295
296 for (i = 0; i < numargs; i++)
297 nbytes += args[i].size;
298
299 return nbytes;
300}
301
302static u64 fuse_get_unique(struct fuse_iqueue *fiq)
303{
304 return ++fiq->reqctr;
305}
306
307static void queue_request(struct fuse_iqueue *fiq, struct fuse_req *req)
308{
309 req->in.h.len = sizeof(struct fuse_in_header) +
310 len_args(req->in.numargs, (struct fuse_arg *) req->in.args);
311 list_add_tail(&req->list, &fiq->pending);
312 wake_up_locked(&fiq->waitq);
313 kill_fasync(&fiq->fasync, SIGIO, POLL_IN);
314}
315
316void fuse_queue_forget(struct fuse_conn *fc, struct fuse_forget_link *forget,
317 u64 nodeid, u64 nlookup)
318{
319 struct fuse_iqueue *fiq = &fc->iq;
320
321 forget->forget_one.nodeid = nodeid;
322 forget->forget_one.nlookup = nlookup;
323
324 spin_lock(&fiq->waitq.lock);
325 if (fiq->connected) {
326 fiq->forget_list_tail->next = forget;
327 fiq->forget_list_tail = forget;
328 wake_up_locked(&fiq->waitq);
329 kill_fasync(&fiq->fasync, SIGIO, POLL_IN);
330 } else {
331 kfree(forget);
332 }
333 spin_unlock(&fiq->waitq.lock);
334}
335
336static void flush_bg_queue(struct fuse_conn *fc)
337{
338 while (fc->active_background < fc->max_background &&
339 !list_empty(&fc->bg_queue)) {
340 struct fuse_req *req;
341 struct fuse_iqueue *fiq = &fc->iq;
342
343 req = list_entry(fc->bg_queue.next, struct fuse_req, list);
344 list_del(&req->list);
345 fc->active_background++;
346 spin_lock(&fiq->waitq.lock);
347 req->in.h.unique = fuse_get_unique(fiq);
348 queue_request(fiq, req);
349 spin_unlock(&fiq->waitq.lock);
350 }
351}
352
353/*
354 * This function is called when a request is finished. Either a reply
355 * has arrived or it was aborted (and not yet sent) or some error
356 * occurred during communication with userspace, or the device file
357 * was closed. The requester thread is woken up (if still waiting),
358 * the 'end' callback is called if given, else the reference to the
359 * request is released
360 */
361static void request_end(struct fuse_conn *fc, struct fuse_req *req)
362{
363 struct fuse_iqueue *fiq = &fc->iq;
364
365 if (test_and_set_bit(FR_FINISHED, &req->flags))
366 return;
367
368 spin_lock(&fiq->waitq.lock);
369 list_del_init(&req->intr_entry);
370 spin_unlock(&fiq->waitq.lock);
371 WARN_ON(test_bit(FR_PENDING, &req->flags));
372 WARN_ON(test_bit(FR_SENT, &req->flags));
373 if (test_bit(FR_BACKGROUND, &req->flags)) {
374 spin_lock(&fc->lock);
375 clear_bit(FR_BACKGROUND, &req->flags);
376 if (fc->num_background == fc->max_background)
377 fc->blocked = 0;
378
379 /* Wake up next waiter, if any */
380 if (!fc->blocked && waitqueue_active(&fc->blocked_waitq))
381 wake_up(&fc->blocked_waitq);
382
383 if (fc->num_background == fc->congestion_threshold &&
384 fc->connected && fc->bdi_initialized) {
385 clear_bdi_congested(&fc->bdi, BLK_RW_SYNC);
386 clear_bdi_congested(&fc->bdi, BLK_RW_ASYNC);
387 }
388 fc->num_background--;
389 fc->active_background--;
390 flush_bg_queue(fc);
391 spin_unlock(&fc->lock);
392 }
393 wake_up(&req->waitq);
394 if (req->end)
395 req->end(fc, req);
396 fuse_put_request(fc, req);
397}
398
399static void queue_interrupt(struct fuse_iqueue *fiq, struct fuse_req *req)
400{
401 spin_lock(&fiq->waitq.lock);
402 if (test_bit(FR_FINISHED, &req->flags)) {
403 spin_unlock(&fiq->waitq.lock);
404 return;
405 }
406 if (list_empty(&req->intr_entry)) {
407 list_add_tail(&req->intr_entry, &fiq->interrupts);
408 wake_up_locked(&fiq->waitq);
409 }
410 spin_unlock(&fiq->waitq.lock);
411 kill_fasync(&fiq->fasync, SIGIO, POLL_IN);
412}
413
414static void request_wait_answer(struct fuse_conn *fc, struct fuse_req *req)
415{
416 struct fuse_iqueue *fiq = &fc->iq;
417 int err;
418
419 if (!fc->no_interrupt) {
420 /* Any signal may interrupt this */
421 err = wait_event_interruptible(req->waitq,
422 test_bit(FR_FINISHED, &req->flags));
423 if (!err)
424 return;
425
426 set_bit(FR_INTERRUPTED, &req->flags);
427 /* matches barrier in fuse_dev_do_read() */
428 smp_mb__after_atomic();
429 if (test_bit(FR_SENT, &req->flags))
430 queue_interrupt(fiq, req);
431 }
432
433 if (!test_bit(FR_FORCE, &req->flags)) {
434 /* Only fatal signals may interrupt this */
435 err = wait_event_killable(req->waitq,
436 test_bit(FR_FINISHED, &req->flags));
437 if (!err)
438 return;
439
440 spin_lock(&fiq->waitq.lock);
441 /* Request is not yet in userspace, bail out */
442 if (test_bit(FR_PENDING, &req->flags)) {
443 list_del(&req->list);
444 spin_unlock(&fiq->waitq.lock);
445 __fuse_put_request(req);
446 req->out.h.error = -EINTR;
447 return;
448 }
449 spin_unlock(&fiq->waitq.lock);
450 }
451
452 /*
453 * Either request is already in userspace, or it was forced.
454 * Wait it out.
455 */
456 wait_event(req->waitq, test_bit(FR_FINISHED, &req->flags));
457}
458
459static void __fuse_request_send(struct fuse_conn *fc, struct fuse_req *req)
460{
461 struct fuse_iqueue *fiq = &fc->iq;
462
463 BUG_ON(test_bit(FR_BACKGROUND, &req->flags));
464 spin_lock(&fiq->waitq.lock);
465 if (!fiq->connected) {
466 spin_unlock(&fiq->waitq.lock);
467 req->out.h.error = -ENOTCONN;
468 } else {
469 req->in.h.unique = fuse_get_unique(fiq);
470 queue_request(fiq, req);
471 /* acquire extra reference, since request is still needed
472 after request_end() */
473 __fuse_get_request(req);
474 spin_unlock(&fiq->waitq.lock);
475
476 request_wait_answer(fc, req);
477 /* Pairs with smp_wmb() in request_end() */
478 smp_rmb();
479 }
480}
481
482void fuse_request_send(struct fuse_conn *fc, struct fuse_req *req)
483{
484 __set_bit(FR_ISREPLY, &req->flags);
485 if (!test_bit(FR_WAITING, &req->flags)) {
486 __set_bit(FR_WAITING, &req->flags);
487 atomic_inc(&fc->num_waiting);
488 }
489 __fuse_request_send(fc, req);
490}
491EXPORT_SYMBOL_GPL(fuse_request_send);
492
493static void fuse_adjust_compat(struct fuse_conn *fc, struct fuse_args *args)
494{
495 if (fc->minor < 4 && args->in.h.opcode == FUSE_STATFS)
496 args->out.args[0].size = FUSE_COMPAT_STATFS_SIZE;
497
498 if (fc->minor < 9) {
499 switch (args->in.h.opcode) {
500 case FUSE_LOOKUP:
501 case FUSE_CREATE:
502 case FUSE_MKNOD:
503 case FUSE_MKDIR:
504 case FUSE_SYMLINK:
505 case FUSE_LINK:
506 args->out.args[0].size = FUSE_COMPAT_ENTRY_OUT_SIZE;
507 break;
508 case FUSE_GETATTR:
509 case FUSE_SETATTR:
510 args->out.args[0].size = FUSE_COMPAT_ATTR_OUT_SIZE;
511 break;
512 }
513 }
514 if (fc->minor < 12) {
515 switch (args->in.h.opcode) {
516 case FUSE_CREATE:
517 args->in.args[0].size = sizeof(struct fuse_open_in);
518 break;
519 case FUSE_MKNOD:
520 args->in.args[0].size = FUSE_COMPAT_MKNOD_IN_SIZE;
521 break;
522 }
523 }
524}
525
526ssize_t fuse_simple_request(struct fuse_conn *fc, struct fuse_args *args)
527{
528 struct fuse_req *req;
529 ssize_t ret;
530
531 req = fuse_get_req(fc, 0);
532 if (IS_ERR(req))
533 return PTR_ERR(req);
534
535 /* Needs to be done after fuse_get_req() so that fc->minor is valid */
536 fuse_adjust_compat(fc, args);
537
538 req->in.h.opcode = args->in.h.opcode;
539 req->in.h.nodeid = args->in.h.nodeid;
540 req->in.numargs = args->in.numargs;
541 memcpy(req->in.args, args->in.args,
542 args->in.numargs * sizeof(struct fuse_in_arg));
543 req->out.argvar = args->out.argvar;
544 req->out.numargs = args->out.numargs;
545 memcpy(req->out.args, args->out.args,
546 args->out.numargs * sizeof(struct fuse_arg));
547 fuse_request_send(fc, req);
548 ret = req->out.h.error;
549 if (!ret && args->out.argvar) {
550 BUG_ON(args->out.numargs != 1);
551 ret = req->out.args[0].size;
552 }
553 fuse_put_request(fc, req);
554
555 return ret;
556}
557
558/*
559 * Called under fc->lock
560 *
561 * fc->connected must have been checked previously
562 */
563void fuse_request_send_background_locked(struct fuse_conn *fc,
564 struct fuse_req *req)
565{
566 BUG_ON(!test_bit(FR_BACKGROUND, &req->flags));
567 if (!test_bit(FR_WAITING, &req->flags)) {
568 __set_bit(FR_WAITING, &req->flags);
569 atomic_inc(&fc->num_waiting);
570 }
571 __set_bit(FR_ISREPLY, &req->flags);
572 fc->num_background++;
573 if (fc->num_background == fc->max_background)
574 fc->blocked = 1;
575 if (fc->num_background == fc->congestion_threshold &&
576 fc->bdi_initialized) {
577 set_bdi_congested(&fc->bdi, BLK_RW_SYNC);
578 set_bdi_congested(&fc->bdi, BLK_RW_ASYNC);
579 }
580 list_add_tail(&req->list, &fc->bg_queue);
581 flush_bg_queue(fc);
582}
583
584void fuse_request_send_background(struct fuse_conn *fc, struct fuse_req *req)
585{
586 BUG_ON(!req->end);
587 spin_lock(&fc->lock);
588 if (fc->connected) {
589 fuse_request_send_background_locked(fc, req);
590 spin_unlock(&fc->lock);
591 } else {
592 spin_unlock(&fc->lock);
593 req->out.h.error = -ENOTCONN;
594 req->end(fc, req);
595 fuse_put_request(fc, req);
596 }
597}
598EXPORT_SYMBOL_GPL(fuse_request_send_background);
599
600static int fuse_request_send_notify_reply(struct fuse_conn *fc,
601 struct fuse_req *req, u64 unique)
602{
603 int err = -ENODEV;
604 struct fuse_iqueue *fiq = &fc->iq;
605
606 __clear_bit(FR_ISREPLY, &req->flags);
607 req->in.h.unique = unique;
608 spin_lock(&fiq->waitq.lock);
609 if (fiq->connected) {
610 queue_request(fiq, req);
611 err = 0;
612 }
613 spin_unlock(&fiq->waitq.lock);
614
615 return err;
616}
617
618void fuse_force_forget(struct file *file, u64 nodeid)
619{
620 struct inode *inode = file_inode(file);
621 struct fuse_conn *fc = get_fuse_conn(inode);
622 struct fuse_req *req;
623 struct fuse_forget_in inarg;
624
625 memset(&inarg, 0, sizeof(inarg));
626 inarg.nlookup = 1;
627 req = fuse_get_req_nofail_nopages(fc, file);
628 req->in.h.opcode = FUSE_FORGET;
629 req->in.h.nodeid = nodeid;
630 req->in.numargs = 1;
631 req->in.args[0].size = sizeof(inarg);
632 req->in.args[0].value = &inarg;
633 __clear_bit(FR_ISREPLY, &req->flags);
634 __fuse_request_send(fc, req);
635 /* ignore errors */
636 fuse_put_request(fc, req);
637}
638
639/*
640 * Lock the request. Up to the next unlock_request() there mustn't be
641 * anything that could cause a page-fault. If the request was already
642 * aborted bail out.
643 */
644static int lock_request(struct fuse_req *req)
645{
646 int err = 0;
647 if (req) {
648 spin_lock(&req->waitq.lock);
649 if (test_bit(FR_ABORTED, &req->flags))
650 err = -ENOENT;
651 else
652 set_bit(FR_LOCKED, &req->flags);
653 spin_unlock(&req->waitq.lock);
654 }
655 return err;
656}
657
658/*
659 * Unlock request. If it was aborted while locked, caller is responsible
660 * for unlocking and ending the request.
661 */
662static int unlock_request(struct fuse_req *req)
663{
664 int err = 0;
665 if (req) {
666 spin_lock(&req->waitq.lock);
667 if (test_bit(FR_ABORTED, &req->flags))
668 err = -ENOENT;
669 else
670 clear_bit(FR_LOCKED, &req->flags);
671 spin_unlock(&req->waitq.lock);
672 }
673 return err;
674}
675
676struct fuse_copy_state {
677 int write;
678 struct fuse_req *req;
679 struct iov_iter *iter;
680 struct pipe_buffer *pipebufs;
681 struct pipe_buffer *currbuf;
682 struct pipe_inode_info *pipe;
683 unsigned long nr_segs;
684 struct page *pg;
685 unsigned len;
686 unsigned offset;
687 unsigned move_pages:1;
688};
689
690static void fuse_copy_init(struct fuse_copy_state *cs, int write,
691 struct iov_iter *iter)
692{
693 memset(cs, 0, sizeof(*cs));
694 cs->write = write;
695 cs->iter = iter;
696}
697
698/* Unmap and put previous page of userspace buffer */
699static void fuse_copy_finish(struct fuse_copy_state *cs)
700{
701 if (cs->currbuf) {
702 struct pipe_buffer *buf = cs->currbuf;
703
704 if (cs->write)
705 buf->len = PAGE_SIZE - cs->len;
706 cs->currbuf = NULL;
707 } else if (cs->pg) {
708 if (cs->write) {
709 flush_dcache_page(cs->pg);
710 set_page_dirty_lock(cs->pg);
711 }
712 put_page(cs->pg);
713 }
714 cs->pg = NULL;
715}
716
717/*
718 * Get another pagefull of userspace buffer, and map it to kernel
719 * address space, and lock request
720 */
721static int fuse_copy_fill(struct fuse_copy_state *cs)
722{
723 struct page *page;
724 int err;
725
726 err = unlock_request(cs->req);
727 if (err)
728 return err;
729
730 fuse_copy_finish(cs);
731 if (cs->pipebufs) {
732 struct pipe_buffer *buf = cs->pipebufs;
733
734 if (!cs->write) {
735 err = pipe_buf_confirm(cs->pipe, buf);
736 if (err)
737 return err;
738
739 BUG_ON(!cs->nr_segs);
740 cs->currbuf = buf;
741 cs->pg = buf->page;
742 cs->offset = buf->offset;
743 cs->len = buf->len;
744 cs->pipebufs++;
745 cs->nr_segs--;
746 } else {
747 if (cs->nr_segs == cs->pipe->buffers)
748 return -EIO;
749
750 page = alloc_page(GFP_HIGHUSER);
751 if (!page)
752 return -ENOMEM;
753
754 buf->page = page;
755 buf->offset = 0;
756 buf->len = 0;
757
758 cs->currbuf = buf;
759 cs->pg = page;
760 cs->offset = 0;
761 cs->len = PAGE_SIZE;
762 cs->pipebufs++;
763 cs->nr_segs++;
764 }
765 } else {
766 size_t off;
767 err = iov_iter_get_pages(cs->iter, &page, PAGE_SIZE, 1, &off);
768 if (err < 0)
769 return err;
770 BUG_ON(!err);
771 cs->len = err;
772 cs->offset = off;
773 cs->pg = page;
774 iov_iter_advance(cs->iter, err);
775 }
776
777 return lock_request(cs->req);
778}
779
780/* Do as much copy to/from userspace buffer as we can */
781static int fuse_copy_do(struct fuse_copy_state *cs, void **val, unsigned *size)
782{
783 unsigned ncpy = min(*size, cs->len);
784 if (val) {
785 void *pgaddr = kmap_atomic(cs->pg);
786 void *buf = pgaddr + cs->offset;
787
788 if (cs->write)
789 memcpy(buf, *val, ncpy);
790 else
791 memcpy(*val, buf, ncpy);
792
793 kunmap_atomic(pgaddr);
794 *val += ncpy;
795 }
796 *size -= ncpy;
797 cs->len -= ncpy;
798 cs->offset += ncpy;
799 return ncpy;
800}
801
802static int fuse_check_page(struct page *page)
803{
804 if (page_mapcount(page) ||
805 page->mapping != NULL ||
806 page_count(page) != 1 ||
807 (page->flags & PAGE_FLAGS_CHECK_AT_PREP &
808 ~(1 << PG_locked |
809 1 << PG_referenced |
810 1 << PG_uptodate |
811 1 << PG_lru |
812 1 << PG_active |
813 1 << PG_reclaim))) {
814 printk(KERN_WARNING "fuse: trying to steal weird page\n");
815 printk(KERN_WARNING " page=%p index=%li flags=%08lx, count=%i, mapcount=%i, mapping=%p\n", page, page->index, page->flags, page_count(page), page_mapcount(page), page->mapping);
816 return 1;
817 }
818 return 0;
819}
820
821static int fuse_try_move_page(struct fuse_copy_state *cs, struct page **pagep)
822{
823 int err;
824 struct page *oldpage = *pagep;
825 struct page *newpage;
826 struct pipe_buffer *buf = cs->pipebufs;
827
828 err = unlock_request(cs->req);
829 if (err)
830 return err;
831
832 fuse_copy_finish(cs);
833
834 err = pipe_buf_confirm(cs->pipe, buf);
835 if (err)
836 return err;
837
838 BUG_ON(!cs->nr_segs);
839 cs->currbuf = buf;
840 cs->len = buf->len;
841 cs->pipebufs++;
842 cs->nr_segs--;
843
844 if (cs->len != PAGE_SIZE)
845 goto out_fallback;
846
847 if (pipe_buf_steal(cs->pipe, buf) != 0)
848 goto out_fallback;
849
850 newpage = buf->page;
851
852 if (!PageUptodate(newpage))
853 SetPageUptodate(newpage);
854
855 ClearPageMappedToDisk(newpage);
856
857 if (fuse_check_page(newpage) != 0)
858 goto out_fallback_unlock;
859
860 /*
861 * This is a new and locked page, it shouldn't be mapped or
862 * have any special flags on it
863 */
864 if (WARN_ON(page_mapped(oldpage)))
865 goto out_fallback_unlock;
866 if (WARN_ON(page_has_private(oldpage)))
867 goto out_fallback_unlock;
868 if (WARN_ON(PageDirty(oldpage) || PageWriteback(oldpage)))
869 goto out_fallback_unlock;
870 if (WARN_ON(PageMlocked(oldpage)))
871 goto out_fallback_unlock;
872
873 err = replace_page_cache_page(oldpage, newpage, GFP_KERNEL);
874 if (err) {
875 unlock_page(newpage);
876 return err;
877 }
878
879 get_page(newpage);
880
881 if (!(buf->flags & PIPE_BUF_FLAG_LRU))
882 lru_cache_add_file(newpage);
883
884 err = 0;
885 spin_lock(&cs->req->waitq.lock);
886 if (test_bit(FR_ABORTED, &cs->req->flags))
887 err = -ENOENT;
888 else
889 *pagep = newpage;
890 spin_unlock(&cs->req->waitq.lock);
891
892 if (err) {
893 unlock_page(newpage);
894 put_page(newpage);
895 return err;
896 }
897
898 unlock_page(oldpage);
899 put_page(oldpage);
900 cs->len = 0;
901
902 return 0;
903
904out_fallback_unlock:
905 unlock_page(newpage);
906out_fallback:
907 cs->pg = buf->page;
908 cs->offset = buf->offset;
909
910 err = lock_request(cs->req);
911 if (err)
912 return err;
913
914 return 1;
915}
916
917static int fuse_ref_page(struct fuse_copy_state *cs, struct page *page,
918 unsigned offset, unsigned count)
919{
920 struct pipe_buffer *buf;
921 int err;
922
923 if (cs->nr_segs == cs->pipe->buffers)
924 return -EIO;
925
926 err = unlock_request(cs->req);
927 if (err)
928 return err;
929
930 fuse_copy_finish(cs);
931
932 buf = cs->pipebufs;
933 get_page(page);
934 buf->page = page;
935 buf->offset = offset;
936 buf->len = count;
937
938 cs->pipebufs++;
939 cs->nr_segs++;
940 cs->len = 0;
941
942 return 0;
943}
944
945/*
946 * Copy a page in the request to/from the userspace buffer. Must be
947 * done atomically
948 */
949static int fuse_copy_page(struct fuse_copy_state *cs, struct page **pagep,
950 unsigned offset, unsigned count, int zeroing)
951{
952 int err;
953 struct page *page = *pagep;
954
955 if (page && zeroing && count < PAGE_SIZE)
956 clear_highpage(page);
957
958 while (count) {
959 if (cs->write && cs->pipebufs && page) {
960 return fuse_ref_page(cs, page, offset, count);
961 } else if (!cs->len) {
962 if (cs->move_pages && page &&
963 offset == 0 && count == PAGE_SIZE) {
964 err = fuse_try_move_page(cs, pagep);
965 if (err <= 0)
966 return err;
967 } else {
968 err = fuse_copy_fill(cs);
969 if (err)
970 return err;
971 }
972 }
973 if (page) {
974 void *mapaddr = kmap_atomic(page);
975 void *buf = mapaddr + offset;
976 offset += fuse_copy_do(cs, &buf, &count);
977 kunmap_atomic(mapaddr);
978 } else
979 offset += fuse_copy_do(cs, NULL, &count);
980 }
981 if (page && !cs->write)
982 flush_dcache_page(page);
983 return 0;
984}
985
986/* Copy pages in the request to/from userspace buffer */
987static int fuse_copy_pages(struct fuse_copy_state *cs, unsigned nbytes,
988 int zeroing)
989{
990 unsigned i;
991 struct fuse_req *req = cs->req;
992
993 for (i = 0; i < req->num_pages && (nbytes || zeroing); i++) {
994 int err;
995 unsigned offset = req->page_descs[i].offset;
996 unsigned count = min(nbytes, req->page_descs[i].length);
997
998 err = fuse_copy_page(cs, &req->pages[i], offset, count,
999 zeroing);
1000 if (err)
1001 return err;
1002
1003 nbytes -= count;
1004 }
1005 return 0;
1006}
1007
1008/* Copy a single argument in the request to/from userspace buffer */
1009static int fuse_copy_one(struct fuse_copy_state *cs, void *val, unsigned size)
1010{
1011 while (size) {
1012 if (!cs->len) {
1013 int err = fuse_copy_fill(cs);
1014 if (err)
1015 return err;
1016 }
1017 fuse_copy_do(cs, &val, &size);
1018 }
1019 return 0;
1020}
1021
1022/* Copy request arguments to/from userspace buffer */
1023static int fuse_copy_args(struct fuse_copy_state *cs, unsigned numargs,
1024 unsigned argpages, struct fuse_arg *args,
1025 int zeroing)
1026{
1027 int err = 0;
1028 unsigned i;
1029
1030 for (i = 0; !err && i < numargs; i++) {
1031 struct fuse_arg *arg = &args[i];
1032 if (i == numargs - 1 && argpages)
1033 err = fuse_copy_pages(cs, arg->size, zeroing);
1034 else
1035 err = fuse_copy_one(cs, arg->value, arg->size);
1036 }
1037 return err;
1038}
1039
1040static int forget_pending(struct fuse_iqueue *fiq)
1041{
1042 return fiq->forget_list_head.next != NULL;
1043}
1044
1045static int request_pending(struct fuse_iqueue *fiq)
1046{
1047 return !list_empty(&fiq->pending) || !list_empty(&fiq->interrupts) ||
1048 forget_pending(fiq);
1049}
1050
1051/*
1052 * Transfer an interrupt request to userspace
1053 *
1054 * Unlike other requests this is assembled on demand, without a need
1055 * to allocate a separate fuse_req structure.
1056 *
1057 * Called with fiq->waitq.lock held, releases it
1058 */
1059static int fuse_read_interrupt(struct fuse_iqueue *fiq,
1060 struct fuse_copy_state *cs,
1061 size_t nbytes, struct fuse_req *req)
1062__releases(fiq->waitq.lock)
1063{
1064 struct fuse_in_header ih;
1065 struct fuse_interrupt_in arg;
1066 unsigned reqsize = sizeof(ih) + sizeof(arg);
1067 int err;
1068
1069 list_del_init(&req->intr_entry);
1070 req->intr_unique = fuse_get_unique(fiq);
1071 memset(&ih, 0, sizeof(ih));
1072 memset(&arg, 0, sizeof(arg));
1073 ih.len = reqsize;
1074 ih.opcode = FUSE_INTERRUPT;
1075 ih.unique = req->intr_unique;
1076 arg.unique = req->in.h.unique;
1077
1078 spin_unlock(&fiq->waitq.lock);
1079 if (nbytes < reqsize)
1080 return -EINVAL;
1081
1082 err = fuse_copy_one(cs, &ih, sizeof(ih));
1083 if (!err)
1084 err = fuse_copy_one(cs, &arg, sizeof(arg));
1085 fuse_copy_finish(cs);
1086
1087 return err ? err : reqsize;
1088}
1089
1090static struct fuse_forget_link *dequeue_forget(struct fuse_iqueue *fiq,
1091 unsigned max,
1092 unsigned *countp)
1093{
1094 struct fuse_forget_link *head = fiq->forget_list_head.next;
1095 struct fuse_forget_link **newhead = &head;
1096 unsigned count;
1097
1098 for (count = 0; *newhead != NULL && count < max; count++)
1099 newhead = &(*newhead)->next;
1100
1101 fiq->forget_list_head.next = *newhead;
1102 *newhead = NULL;
1103 if (fiq->forget_list_head.next == NULL)
1104 fiq->forget_list_tail = &fiq->forget_list_head;
1105
1106 if (countp != NULL)
1107 *countp = count;
1108
1109 return head;
1110}
1111
1112static int fuse_read_single_forget(struct fuse_iqueue *fiq,
1113 struct fuse_copy_state *cs,
1114 size_t nbytes)
1115__releases(fiq->waitq.lock)
1116{
1117 int err;
1118 struct fuse_forget_link *forget = dequeue_forget(fiq, 1, NULL);
1119 struct fuse_forget_in arg = {
1120 .nlookup = forget->forget_one.nlookup,
1121 };
1122 struct fuse_in_header ih = {
1123 .opcode = FUSE_FORGET,
1124 .nodeid = forget->forget_one.nodeid,
1125 .unique = fuse_get_unique(fiq),
1126 .len = sizeof(ih) + sizeof(arg),
1127 };
1128
1129 spin_unlock(&fiq->waitq.lock);
1130 kfree(forget);
1131 if (nbytes < ih.len)
1132 return -EINVAL;
1133
1134 err = fuse_copy_one(cs, &ih, sizeof(ih));
1135 if (!err)
1136 err = fuse_copy_one(cs, &arg, sizeof(arg));
1137 fuse_copy_finish(cs);
1138
1139 if (err)
1140 return err;
1141
1142 return ih.len;
1143}
1144
1145static int fuse_read_batch_forget(struct fuse_iqueue *fiq,
1146 struct fuse_copy_state *cs, size_t nbytes)
1147__releases(fiq->waitq.lock)
1148{
1149 int err;
1150 unsigned max_forgets;
1151 unsigned count;
1152 struct fuse_forget_link *head;
1153 struct fuse_batch_forget_in arg = { .count = 0 };
1154 struct fuse_in_header ih = {
1155 .opcode = FUSE_BATCH_FORGET,
1156 .unique = fuse_get_unique(fiq),
1157 .len = sizeof(ih) + sizeof(arg),
1158 };
1159
1160 if (nbytes < ih.len) {
1161 spin_unlock(&fiq->waitq.lock);
1162 return -EINVAL;
1163 }
1164
1165 max_forgets = (nbytes - ih.len) / sizeof(struct fuse_forget_one);
1166 head = dequeue_forget(fiq, max_forgets, &count);
1167 spin_unlock(&fiq->waitq.lock);
1168
1169 arg.count = count;
1170 ih.len += count * sizeof(struct fuse_forget_one);
1171 err = fuse_copy_one(cs, &ih, sizeof(ih));
1172 if (!err)
1173 err = fuse_copy_one(cs, &arg, sizeof(arg));
1174
1175 while (head) {
1176 struct fuse_forget_link *forget = head;
1177
1178 if (!err) {
1179 err = fuse_copy_one(cs, &forget->forget_one,
1180 sizeof(forget->forget_one));
1181 }
1182 head = forget->next;
1183 kfree(forget);
1184 }
1185
1186 fuse_copy_finish(cs);
1187
1188 if (err)
1189 return err;
1190
1191 return ih.len;
1192}
1193
1194static int fuse_read_forget(struct fuse_conn *fc, struct fuse_iqueue *fiq,
1195 struct fuse_copy_state *cs,
1196 size_t nbytes)
1197__releases(fiq->waitq.lock)
1198{
1199 if (fc->minor < 16 || fiq->forget_list_head.next->next == NULL)
1200 return fuse_read_single_forget(fiq, cs, nbytes);
1201 else
1202 return fuse_read_batch_forget(fiq, cs, nbytes);
1203}
1204
1205/*
1206 * Read a single request into the userspace filesystem's buffer. This
1207 * function waits until a request is available, then removes it from
1208 * the pending list and copies request data to userspace buffer. If
1209 * no reply is needed (FORGET) or request has been aborted or there
1210 * was an error during the copying then it's finished by calling
1211 * request_end(). Otherwise add it to the processing list, and set
1212 * the 'sent' flag.
1213 */
1214static ssize_t fuse_dev_do_read(struct fuse_dev *fud, struct file *file,
1215 struct fuse_copy_state *cs, size_t nbytes)
1216{
1217 ssize_t err;
1218 struct fuse_conn *fc = fud->fc;
1219 struct fuse_iqueue *fiq = &fc->iq;
1220 struct fuse_pqueue *fpq = &fud->pq;
1221 struct fuse_req *req;
1222 struct fuse_in *in;
1223 unsigned reqsize;
1224
1225 restart:
1226 spin_lock(&fiq->waitq.lock);
1227 err = -EAGAIN;
1228 if ((file->f_flags & O_NONBLOCK) && fiq->connected &&
1229 !request_pending(fiq))
1230 goto err_unlock;
1231
1232 err = wait_event_interruptible_exclusive_locked(fiq->waitq,
1233 !fiq->connected || request_pending(fiq));
1234 if (err)
1235 goto err_unlock;
1236
1237 err = -ENODEV;
1238 if (!fiq->connected)
1239 goto err_unlock;
1240
1241 if (!list_empty(&fiq->interrupts)) {
1242 req = list_entry(fiq->interrupts.next, struct fuse_req,
1243 intr_entry);
1244 return fuse_read_interrupt(fiq, cs, nbytes, req);
1245 }
1246
1247 if (forget_pending(fiq)) {
1248 if (list_empty(&fiq->pending) || fiq->forget_batch-- > 0)
1249 return fuse_read_forget(fc, fiq, cs, nbytes);
1250
1251 if (fiq->forget_batch <= -8)
1252 fiq->forget_batch = 16;
1253 }
1254
1255 req = list_entry(fiq->pending.next, struct fuse_req, list);
1256 clear_bit(FR_PENDING, &req->flags);
1257 list_del_init(&req->list);
1258 spin_unlock(&fiq->waitq.lock);
1259
1260 in = &req->in;
1261 reqsize = in->h.len;
1262 /* If request is too large, reply with an error and restart the read */
1263 if (nbytes < reqsize) {
1264 req->out.h.error = -EIO;
1265 /* SETXATTR is special, since it may contain too large data */
1266 if (in->h.opcode == FUSE_SETXATTR)
1267 req->out.h.error = -E2BIG;
1268 request_end(fc, req);
1269 goto restart;
1270 }
1271 spin_lock(&fpq->lock);
1272 list_add(&req->list, &fpq->io);
1273 spin_unlock(&fpq->lock);
1274 cs->req = req;
1275 err = fuse_copy_one(cs, &in->h, sizeof(in->h));
1276 if (!err)
1277 err = fuse_copy_args(cs, in->numargs, in->argpages,
1278 (struct fuse_arg *) in->args, 0);
1279 fuse_copy_finish(cs);
1280 spin_lock(&fpq->lock);
1281 clear_bit(FR_LOCKED, &req->flags);
1282 if (!fpq->connected) {
1283 err = -ENODEV;
1284 goto out_end;
1285 }
1286 if (err) {
1287 req->out.h.error = -EIO;
1288 goto out_end;
1289 }
1290 if (!test_bit(FR_ISREPLY, &req->flags)) {
1291 err = reqsize;
1292 goto out_end;
1293 }
1294 list_move_tail(&req->list, &fpq->processing);
1295 spin_unlock(&fpq->lock);
1296 set_bit(FR_SENT, &req->flags);
1297 /* matches barrier in request_wait_answer() */
1298 smp_mb__after_atomic();
1299 if (test_bit(FR_INTERRUPTED, &req->flags))
1300 queue_interrupt(fiq, req);
1301
1302 return reqsize;
1303
1304out_end:
1305 if (!test_bit(FR_PRIVATE, &req->flags))
1306 list_del_init(&req->list);
1307 spin_unlock(&fpq->lock);
1308 request_end(fc, req);
1309 return err;
1310
1311 err_unlock:
1312 spin_unlock(&fiq->waitq.lock);
1313 return err;
1314}
1315
1316static int fuse_dev_open(struct inode *inode, struct file *file)
1317{
1318 /*
1319 * The fuse device's file's private_data is used to hold
1320 * the fuse_conn(ection) when it is mounted, and is used to
1321 * keep track of whether the file has been mounted already.
1322 */
1323 file->private_data = NULL;
1324 return 0;
1325}
1326
1327static ssize_t fuse_dev_read(struct kiocb *iocb, struct iov_iter *to)
1328{
1329 struct fuse_copy_state cs;
1330 struct file *file = iocb->ki_filp;
1331 struct fuse_dev *fud = fuse_get_dev(file);
1332
1333 if (!fud)
1334 return -EPERM;
1335
1336 if (!iter_is_iovec(to))
1337 return -EINVAL;
1338
1339 fuse_copy_init(&cs, 1, to);
1340
1341 return fuse_dev_do_read(fud, file, &cs, iov_iter_count(to));
1342}
1343
1344static ssize_t fuse_dev_splice_read(struct file *in, loff_t *ppos,
1345 struct pipe_inode_info *pipe,
1346 size_t len, unsigned int flags)
1347{
1348 int total, ret;
1349 int page_nr = 0;
1350 struct pipe_buffer *bufs;
1351 struct fuse_copy_state cs;
1352 struct fuse_dev *fud = fuse_get_dev(in);
1353
1354 if (!fud)
1355 return -EPERM;
1356
1357 bufs = kmalloc(pipe->buffers * sizeof(struct pipe_buffer), GFP_KERNEL);
1358 if (!bufs)
1359 return -ENOMEM;
1360
1361 fuse_copy_init(&cs, 1, NULL);
1362 cs.pipebufs = bufs;
1363 cs.pipe = pipe;
1364 ret = fuse_dev_do_read(fud, in, &cs, len);
1365 if (ret < 0)
1366 goto out;
1367
1368 if (pipe->nrbufs + cs.nr_segs > pipe->buffers) {
1369 ret = -EIO;
1370 goto out;
1371 }
1372
1373 for (ret = total = 0; page_nr < cs.nr_segs; total += ret) {
1374 /*
1375 * Need to be careful about this. Having buf->ops in module
1376 * code can Oops if the buffer persists after module unload.
1377 */
1378 bufs[page_nr].ops = &nosteal_pipe_buf_ops;
1379 bufs[page_nr].flags = 0;
1380 ret = add_to_pipe(pipe, &bufs[page_nr++]);
1381 if (unlikely(ret < 0))
1382 break;
1383 }
1384 if (total)
1385 ret = total;
1386out:
1387 for (; page_nr < cs.nr_segs; page_nr++)
1388 put_page(bufs[page_nr].page);
1389
1390 kfree(bufs);
1391 return ret;
1392}
1393
1394static int fuse_notify_poll(struct fuse_conn *fc, unsigned int size,
1395 struct fuse_copy_state *cs)
1396{
1397 struct fuse_notify_poll_wakeup_out outarg;
1398 int err = -EINVAL;
1399
1400 if (size != sizeof(outarg))
1401 goto err;
1402
1403 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1404 if (err)
1405 goto err;
1406
1407 fuse_copy_finish(cs);
1408 return fuse_notify_poll_wakeup(fc, &outarg);
1409
1410err:
1411 fuse_copy_finish(cs);
1412 return err;
1413}
1414
1415static int fuse_notify_inval_inode(struct fuse_conn *fc, unsigned int size,
1416 struct fuse_copy_state *cs)
1417{
1418 struct fuse_notify_inval_inode_out outarg;
1419 int err = -EINVAL;
1420
1421 if (size != sizeof(outarg))
1422 goto err;
1423
1424 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1425 if (err)
1426 goto err;
1427 fuse_copy_finish(cs);
1428
1429 down_read(&fc->killsb);
1430 err = -ENOENT;
1431 if (fc->sb) {
1432 err = fuse_reverse_inval_inode(fc->sb, outarg.ino,
1433 outarg.off, outarg.len);
1434 }
1435 up_read(&fc->killsb);
1436 return err;
1437
1438err:
1439 fuse_copy_finish(cs);
1440 return err;
1441}
1442
1443static int fuse_notify_inval_entry(struct fuse_conn *fc, unsigned int size,
1444 struct fuse_copy_state *cs)
1445{
1446 struct fuse_notify_inval_entry_out outarg;
1447 int err = -ENOMEM;
1448 char *buf;
1449 struct qstr name;
1450
1451 buf = kzalloc(FUSE_NAME_MAX + 1, GFP_KERNEL);
1452 if (!buf)
1453 goto err;
1454
1455 err = -EINVAL;
1456 if (size < sizeof(outarg))
1457 goto err;
1458
1459 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1460 if (err)
1461 goto err;
1462
1463 err = -ENAMETOOLONG;
1464 if (outarg.namelen > FUSE_NAME_MAX)
1465 goto err;
1466
1467 err = -EINVAL;
1468 if (size != sizeof(outarg) + outarg.namelen + 1)
1469 goto err;
1470
1471 name.name = buf;
1472 name.len = outarg.namelen;
1473 err = fuse_copy_one(cs, buf, outarg.namelen + 1);
1474 if (err)
1475 goto err;
1476 fuse_copy_finish(cs);
1477 buf[outarg.namelen] = 0;
1478
1479 down_read(&fc->killsb);
1480 err = -ENOENT;
1481 if (fc->sb)
1482 err = fuse_reverse_inval_entry(fc->sb, outarg.parent, 0, &name);
1483 up_read(&fc->killsb);
1484 kfree(buf);
1485 return err;
1486
1487err:
1488 kfree(buf);
1489 fuse_copy_finish(cs);
1490 return err;
1491}
1492
1493static int fuse_notify_delete(struct fuse_conn *fc, unsigned int size,
1494 struct fuse_copy_state *cs)
1495{
1496 struct fuse_notify_delete_out outarg;
1497 int err = -ENOMEM;
1498 char *buf;
1499 struct qstr name;
1500
1501 buf = kzalloc(FUSE_NAME_MAX + 1, GFP_KERNEL);
1502 if (!buf)
1503 goto err;
1504
1505 err = -EINVAL;
1506 if (size < sizeof(outarg))
1507 goto err;
1508
1509 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1510 if (err)
1511 goto err;
1512
1513 err = -ENAMETOOLONG;
1514 if (outarg.namelen > FUSE_NAME_MAX)
1515 goto err;
1516
1517 err = -EINVAL;
1518 if (size != sizeof(outarg) + outarg.namelen + 1)
1519 goto err;
1520
1521 name.name = buf;
1522 name.len = outarg.namelen;
1523 err = fuse_copy_one(cs, buf, outarg.namelen + 1);
1524 if (err)
1525 goto err;
1526 fuse_copy_finish(cs);
1527 buf[outarg.namelen] = 0;
1528
1529 down_read(&fc->killsb);
1530 err = -ENOENT;
1531 if (fc->sb)
1532 err = fuse_reverse_inval_entry(fc->sb, outarg.parent,
1533 outarg.child, &name);
1534 up_read(&fc->killsb);
1535 kfree(buf);
1536 return err;
1537
1538err:
1539 kfree(buf);
1540 fuse_copy_finish(cs);
1541 return err;
1542}
1543
1544static int fuse_notify_store(struct fuse_conn *fc, unsigned int size,
1545 struct fuse_copy_state *cs)
1546{
1547 struct fuse_notify_store_out outarg;
1548 struct inode *inode;
1549 struct address_space *mapping;
1550 u64 nodeid;
1551 int err;
1552 pgoff_t index;
1553 unsigned int offset;
1554 unsigned int num;
1555 loff_t file_size;
1556 loff_t end;
1557
1558 err = -EINVAL;
1559 if (size < sizeof(outarg))
1560 goto out_finish;
1561
1562 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1563 if (err)
1564 goto out_finish;
1565
1566 err = -EINVAL;
1567 if (size - sizeof(outarg) != outarg.size)
1568 goto out_finish;
1569
1570 nodeid = outarg.nodeid;
1571
1572 down_read(&fc->killsb);
1573
1574 err = -ENOENT;
1575 if (!fc->sb)
1576 goto out_up_killsb;
1577
1578 inode = ilookup5(fc->sb, nodeid, fuse_inode_eq, &nodeid);
1579 if (!inode)
1580 goto out_up_killsb;
1581
1582 mapping = inode->i_mapping;
1583 index = outarg.offset >> PAGE_SHIFT;
1584 offset = outarg.offset & ~PAGE_MASK;
1585 file_size = i_size_read(inode);
1586 end = outarg.offset + outarg.size;
1587 if (end > file_size) {
1588 file_size = end;
1589 fuse_write_update_size(inode, file_size);
1590 }
1591
1592 num = outarg.size;
1593 while (num) {
1594 struct page *page;
1595 unsigned int this_num;
1596
1597 err = -ENOMEM;
1598 page = find_or_create_page(mapping, index,
1599 mapping_gfp_mask(mapping));
1600 if (!page)
1601 goto out_iput;
1602
1603 this_num = min_t(unsigned, num, PAGE_SIZE - offset);
1604 err = fuse_copy_page(cs, &page, offset, this_num, 0);
1605 if (!err && offset == 0 &&
1606 (this_num == PAGE_SIZE || file_size == end))
1607 SetPageUptodate(page);
1608 unlock_page(page);
1609 put_page(page);
1610
1611 if (err)
1612 goto out_iput;
1613
1614 num -= this_num;
1615 offset = 0;
1616 index++;
1617 }
1618
1619 err = 0;
1620
1621out_iput:
1622 iput(inode);
1623out_up_killsb:
1624 up_read(&fc->killsb);
1625out_finish:
1626 fuse_copy_finish(cs);
1627 return err;
1628}
1629
1630static void fuse_retrieve_end(struct fuse_conn *fc, struct fuse_req *req)
1631{
1632 release_pages(req->pages, req->num_pages, false);
1633}
1634
1635static int fuse_retrieve(struct fuse_conn *fc, struct inode *inode,
1636 struct fuse_notify_retrieve_out *outarg)
1637{
1638 int err;
1639 struct address_space *mapping = inode->i_mapping;
1640 struct fuse_req *req;
1641 pgoff_t index;
1642 loff_t file_size;
1643 unsigned int num;
1644 unsigned int offset;
1645 size_t total_len = 0;
1646 int num_pages;
1647
1648 offset = outarg->offset & ~PAGE_MASK;
1649 file_size = i_size_read(inode);
1650
1651 num = outarg->size;
1652 if (outarg->offset > file_size)
1653 num = 0;
1654 else if (outarg->offset + num > file_size)
1655 num = file_size - outarg->offset;
1656
1657 num_pages = (num + offset + PAGE_SIZE - 1) >> PAGE_SHIFT;
1658 num_pages = min(num_pages, FUSE_MAX_PAGES_PER_REQ);
1659
1660 req = fuse_get_req(fc, num_pages);
1661 if (IS_ERR(req))
1662 return PTR_ERR(req);
1663
1664 req->in.h.opcode = FUSE_NOTIFY_REPLY;
1665 req->in.h.nodeid = outarg->nodeid;
1666 req->in.numargs = 2;
1667 req->in.argpages = 1;
1668 req->page_descs[0].offset = offset;
1669 req->end = fuse_retrieve_end;
1670
1671 index = outarg->offset >> PAGE_SHIFT;
1672
1673 while (num && req->num_pages < num_pages) {
1674 struct page *page;
1675 unsigned int this_num;
1676
1677 page = find_get_page(mapping, index);
1678 if (!page)
1679 break;
1680
1681 this_num = min_t(unsigned, num, PAGE_SIZE - offset);
1682 req->pages[req->num_pages] = page;
1683 req->page_descs[req->num_pages].length = this_num;
1684 req->num_pages++;
1685
1686 offset = 0;
1687 num -= this_num;
1688 total_len += this_num;
1689 index++;
1690 }
1691 req->misc.retrieve_in.offset = outarg->offset;
1692 req->misc.retrieve_in.size = total_len;
1693 req->in.args[0].size = sizeof(req->misc.retrieve_in);
1694 req->in.args[0].value = &req->misc.retrieve_in;
1695 req->in.args[1].size = total_len;
1696
1697 err = fuse_request_send_notify_reply(fc, req, outarg->notify_unique);
1698 if (err)
1699 fuse_retrieve_end(fc, req);
1700
1701 return err;
1702}
1703
1704static int fuse_notify_retrieve(struct fuse_conn *fc, unsigned int size,
1705 struct fuse_copy_state *cs)
1706{
1707 struct fuse_notify_retrieve_out outarg;
1708 struct inode *inode;
1709 int err;
1710
1711 err = -EINVAL;
1712 if (size != sizeof(outarg))
1713 goto copy_finish;
1714
1715 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1716 if (err)
1717 goto copy_finish;
1718
1719 fuse_copy_finish(cs);
1720
1721 down_read(&fc->killsb);
1722 err = -ENOENT;
1723 if (fc->sb) {
1724 u64 nodeid = outarg.nodeid;
1725
1726 inode = ilookup5(fc->sb, nodeid, fuse_inode_eq, &nodeid);
1727 if (inode) {
1728 err = fuse_retrieve(fc, inode, &outarg);
1729 iput(inode);
1730 }
1731 }
1732 up_read(&fc->killsb);
1733
1734 return err;
1735
1736copy_finish:
1737 fuse_copy_finish(cs);
1738 return err;
1739}
1740
1741static int fuse_notify(struct fuse_conn *fc, enum fuse_notify_code code,
1742 unsigned int size, struct fuse_copy_state *cs)
1743{
1744 /* Don't try to move pages (yet) */
1745 cs->move_pages = 0;
1746
1747 switch (code) {
1748 case FUSE_NOTIFY_POLL:
1749 return fuse_notify_poll(fc, size, cs);
1750
1751 case FUSE_NOTIFY_INVAL_INODE:
1752 return fuse_notify_inval_inode(fc, size, cs);
1753
1754 case FUSE_NOTIFY_INVAL_ENTRY:
1755 return fuse_notify_inval_entry(fc, size, cs);
1756
1757 case FUSE_NOTIFY_STORE:
1758 return fuse_notify_store(fc, size, cs);
1759
1760 case FUSE_NOTIFY_RETRIEVE:
1761 return fuse_notify_retrieve(fc, size, cs);
1762
1763 case FUSE_NOTIFY_DELETE:
1764 return fuse_notify_delete(fc, size, cs);
1765
1766 default:
1767 fuse_copy_finish(cs);
1768 return -EINVAL;
1769 }
1770}
1771
1772/* Look up request on processing list by unique ID */
1773static struct fuse_req *request_find(struct fuse_pqueue *fpq, u64 unique)
1774{
1775 struct fuse_req *req;
1776
1777 list_for_each_entry(req, &fpq->processing, list) {
1778 if (req->in.h.unique == unique || req->intr_unique == unique)
1779 return req;
1780 }
1781 return NULL;
1782}
1783
1784static int copy_out_args(struct fuse_copy_state *cs, struct fuse_out *out,
1785 unsigned nbytes)
1786{
1787 unsigned reqsize = sizeof(struct fuse_out_header);
1788
1789 if (out->h.error)
1790 return nbytes != reqsize ? -EINVAL : 0;
1791
1792 reqsize += len_args(out->numargs, out->args);
1793
1794 if (reqsize < nbytes || (reqsize > nbytes && !out->argvar))
1795 return -EINVAL;
1796 else if (reqsize > nbytes) {
1797 struct fuse_arg *lastarg = &out->args[out->numargs-1];
1798 unsigned diffsize = reqsize - nbytes;
1799 if (diffsize > lastarg->size)
1800 return -EINVAL;
1801 lastarg->size -= diffsize;
1802 }
1803 return fuse_copy_args(cs, out->numargs, out->argpages, out->args,
1804 out->page_zeroing);
1805}
1806
1807/*
1808 * Write a single reply to a request. First the header is copied from
1809 * the write buffer. The request is then searched on the processing
1810 * list by the unique ID found in the header. If found, then remove
1811 * it from the list and copy the rest of the buffer to the request.
1812 * The request is finished by calling request_end()
1813 */
1814static ssize_t fuse_dev_do_write(struct fuse_dev *fud,
1815 struct fuse_copy_state *cs, size_t nbytes)
1816{
1817 int err;
1818 struct fuse_conn *fc = fud->fc;
1819 struct fuse_pqueue *fpq = &fud->pq;
1820 struct fuse_req *req;
1821 struct fuse_out_header oh;
1822
1823 if (nbytes < sizeof(struct fuse_out_header))
1824 return -EINVAL;
1825
1826 err = fuse_copy_one(cs, &oh, sizeof(oh));
1827 if (err)
1828 goto err_finish;
1829
1830 err = -EINVAL;
1831 if (oh.len != nbytes)
1832 goto err_finish;
1833
1834 /*
1835 * Zero oh.unique indicates unsolicited notification message
1836 * and error contains notification code.
1837 */
1838 if (!oh.unique) {
1839 err = fuse_notify(fc, oh.error, nbytes - sizeof(oh), cs);
1840 return err ? err : nbytes;
1841 }
1842
1843 err = -EINVAL;
1844 if (oh.error <= -1000 || oh.error > 0)
1845 goto err_finish;
1846
1847 spin_lock(&fpq->lock);
1848 err = -ENOENT;
1849 if (!fpq->connected)
1850 goto err_unlock_pq;
1851
1852 req = request_find(fpq, oh.unique);
1853 if (!req)
1854 goto err_unlock_pq;
1855
1856 /* Is it an interrupt reply? */
1857 if (req->intr_unique == oh.unique) {
1858 spin_unlock(&fpq->lock);
1859
1860 err = -EINVAL;
1861 if (nbytes != sizeof(struct fuse_out_header))
1862 goto err_finish;
1863
1864 if (oh.error == -ENOSYS)
1865 fc->no_interrupt = 1;
1866 else if (oh.error == -EAGAIN)
1867 queue_interrupt(&fc->iq, req);
1868
1869 fuse_copy_finish(cs);
1870 return nbytes;
1871 }
1872
1873 clear_bit(FR_SENT, &req->flags);
1874 list_move(&req->list, &fpq->io);
1875 req->out.h = oh;
1876 set_bit(FR_LOCKED, &req->flags);
1877 spin_unlock(&fpq->lock);
1878 cs->req = req;
1879 if (!req->out.page_replace)
1880 cs->move_pages = 0;
1881
1882 err = copy_out_args(cs, &req->out, nbytes);
1883 fuse_copy_finish(cs);
1884
1885 spin_lock(&fpq->lock);
1886 clear_bit(FR_LOCKED, &req->flags);
1887 if (!fpq->connected)
1888 err = -ENOENT;
1889 else if (err)
1890 req->out.h.error = -EIO;
1891 if (!test_bit(FR_PRIVATE, &req->flags))
1892 list_del_init(&req->list);
1893 spin_unlock(&fpq->lock);
1894
1895 request_end(fc, req);
1896
1897 return err ? err : nbytes;
1898
1899 err_unlock_pq:
1900 spin_unlock(&fpq->lock);
1901 err_finish:
1902 fuse_copy_finish(cs);
1903 return err;
1904}
1905
1906static ssize_t fuse_dev_write(struct kiocb *iocb, struct iov_iter *from)
1907{
1908 struct fuse_copy_state cs;
1909 struct fuse_dev *fud = fuse_get_dev(iocb->ki_filp);
1910
1911 if (!fud)
1912 return -EPERM;
1913
1914 if (!iter_is_iovec(from))
1915 return -EINVAL;
1916
1917 fuse_copy_init(&cs, 0, from);
1918
1919 return fuse_dev_do_write(fud, &cs, iov_iter_count(from));
1920}
1921
1922static ssize_t fuse_dev_splice_write(struct pipe_inode_info *pipe,
1923 struct file *out, loff_t *ppos,
1924 size_t len, unsigned int flags)
1925{
1926 unsigned nbuf;
1927 unsigned idx;
1928 struct pipe_buffer *bufs;
1929 struct fuse_copy_state cs;
1930 struct fuse_dev *fud;
1931 size_t rem;
1932 ssize_t ret;
1933
1934 fud = fuse_get_dev(out);
1935 if (!fud)
1936 return -EPERM;
1937
1938 bufs = kmalloc(pipe->buffers * sizeof(struct pipe_buffer), GFP_KERNEL);
1939 if (!bufs)
1940 return -ENOMEM;
1941
1942 pipe_lock(pipe);
1943 nbuf = 0;
1944 rem = 0;
1945 for (idx = 0; idx < pipe->nrbufs && rem < len; idx++)
1946 rem += pipe->bufs[(pipe->curbuf + idx) & (pipe->buffers - 1)].len;
1947
1948 ret = -EINVAL;
1949 if (rem < len) {
1950 pipe_unlock(pipe);
1951 goto out;
1952 }
1953
1954 rem = len;
1955 while (rem) {
1956 struct pipe_buffer *ibuf;
1957 struct pipe_buffer *obuf;
1958
1959 BUG_ON(nbuf >= pipe->buffers);
1960 BUG_ON(!pipe->nrbufs);
1961 ibuf = &pipe->bufs[pipe->curbuf];
1962 obuf = &bufs[nbuf];
1963
1964 if (rem >= ibuf->len) {
1965 *obuf = *ibuf;
1966 ibuf->ops = NULL;
1967 pipe->curbuf = (pipe->curbuf + 1) & (pipe->buffers - 1);
1968 pipe->nrbufs--;
1969 } else {
1970 pipe_buf_get(pipe, ibuf);
1971 *obuf = *ibuf;
1972 obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
1973 obuf->len = rem;
1974 ibuf->offset += obuf->len;
1975 ibuf->len -= obuf->len;
1976 }
1977 nbuf++;
1978 rem -= obuf->len;
1979 }
1980 pipe_unlock(pipe);
1981
1982 fuse_copy_init(&cs, 0, NULL);
1983 cs.pipebufs = bufs;
1984 cs.nr_segs = nbuf;
1985 cs.pipe = pipe;
1986
1987 if (flags & SPLICE_F_MOVE)
1988 cs.move_pages = 1;
1989
1990 ret = fuse_dev_do_write(fud, &cs, len);
1991
1992 for (idx = 0; idx < nbuf; idx++)
1993 pipe_buf_release(pipe, &bufs[idx]);
1994
1995out:
1996 kfree(bufs);
1997 return ret;
1998}
1999
2000static unsigned fuse_dev_poll(struct file *file, poll_table *wait)
2001{
2002 unsigned mask = POLLOUT | POLLWRNORM;
2003 struct fuse_iqueue *fiq;
2004 struct fuse_dev *fud = fuse_get_dev(file);
2005
2006 if (!fud)
2007 return POLLERR;
2008
2009 fiq = &fud->fc->iq;
2010 poll_wait(file, &fiq->waitq, wait);
2011
2012 spin_lock(&fiq->waitq.lock);
2013 if (!fiq->connected)
2014 mask = POLLERR;
2015 else if (request_pending(fiq))
2016 mask |= POLLIN | POLLRDNORM;
2017 spin_unlock(&fiq->waitq.lock);
2018
2019 return mask;
2020}
2021
2022/*
2023 * Abort all requests on the given list (pending or processing)
2024 *
2025 * This function releases and reacquires fc->lock
2026 */
2027static void end_requests(struct fuse_conn *fc, struct list_head *head)
2028{
2029 while (!list_empty(head)) {
2030 struct fuse_req *req;
2031 req = list_entry(head->next, struct fuse_req, list);
2032 req->out.h.error = -ECONNABORTED;
2033 clear_bit(FR_SENT, &req->flags);
2034 list_del_init(&req->list);
2035 request_end(fc, req);
2036 }
2037}
2038
2039static void end_polls(struct fuse_conn *fc)
2040{
2041 struct rb_node *p;
2042
2043 p = rb_first(&fc->polled_files);
2044
2045 while (p) {
2046 struct fuse_file *ff;
2047 ff = rb_entry(p, struct fuse_file, polled_node);
2048 wake_up_interruptible_all(&ff->poll_wait);
2049
2050 p = rb_next(p);
2051 }
2052}
2053
2054/*
2055 * Abort all requests.
2056 *
2057 * Emergency exit in case of a malicious or accidental deadlock, or just a hung
2058 * filesystem.
2059 *
2060 * The same effect is usually achievable through killing the filesystem daemon
2061 * and all users of the filesystem. The exception is the combination of an
2062 * asynchronous request and the tricky deadlock (see
2063 * Documentation/filesystems/fuse.txt).
2064 *
2065 * Aborting requests under I/O goes as follows: 1: Separate out unlocked
2066 * requests, they should be finished off immediately. Locked requests will be
2067 * finished after unlock; see unlock_request(). 2: Finish off the unlocked
2068 * requests. It is possible that some request will finish before we can. This
2069 * is OK, the request will in that case be removed from the list before we touch
2070 * it.
2071 */
2072void fuse_abort_conn(struct fuse_conn *fc)
2073{
2074 struct fuse_iqueue *fiq = &fc->iq;
2075
2076 spin_lock(&fc->lock);
2077 if (fc->connected) {
2078 struct fuse_dev *fud;
2079 struct fuse_req *req, *next;
2080 LIST_HEAD(to_end1);
2081 LIST_HEAD(to_end2);
2082
2083 fc->connected = 0;
2084 fc->blocked = 0;
2085 fuse_set_initialized(fc);
2086 list_for_each_entry(fud, &fc->devices, entry) {
2087 struct fuse_pqueue *fpq = &fud->pq;
2088
2089 spin_lock(&fpq->lock);
2090 fpq->connected = 0;
2091 list_for_each_entry_safe(req, next, &fpq->io, list) {
2092 req->out.h.error = -ECONNABORTED;
2093 spin_lock(&req->waitq.lock);
2094 set_bit(FR_ABORTED, &req->flags);
2095 if (!test_bit(FR_LOCKED, &req->flags)) {
2096 set_bit(FR_PRIVATE, &req->flags);
2097 list_move(&req->list, &to_end1);
2098 }
2099 spin_unlock(&req->waitq.lock);
2100 }
2101 list_splice_init(&fpq->processing, &to_end2);
2102 spin_unlock(&fpq->lock);
2103 }
2104 fc->max_background = UINT_MAX;
2105 flush_bg_queue(fc);
2106
2107 spin_lock(&fiq->waitq.lock);
2108 fiq->connected = 0;
2109 list_splice_init(&fiq->pending, &to_end2);
2110 list_for_each_entry(req, &to_end2, list)
2111 clear_bit(FR_PENDING, &req->flags);
2112 while (forget_pending(fiq))
2113 kfree(dequeue_forget(fiq, 1, NULL));
2114 wake_up_all_locked(&fiq->waitq);
2115 spin_unlock(&fiq->waitq.lock);
2116 kill_fasync(&fiq->fasync, SIGIO, POLL_IN);
2117 end_polls(fc);
2118 wake_up_all(&fc->blocked_waitq);
2119 spin_unlock(&fc->lock);
2120
2121 while (!list_empty(&to_end1)) {
2122 req = list_first_entry(&to_end1, struct fuse_req, list);
2123 __fuse_get_request(req);
2124 list_del_init(&req->list);
2125 request_end(fc, req);
2126 }
2127 end_requests(fc, &to_end2);
2128 } else {
2129 spin_unlock(&fc->lock);
2130 }
2131}
2132EXPORT_SYMBOL_GPL(fuse_abort_conn);
2133
2134int fuse_dev_release(struct inode *inode, struct file *file)
2135{
2136 struct fuse_dev *fud = fuse_get_dev(file);
2137
2138 if (fud) {
2139 struct fuse_conn *fc = fud->fc;
2140 struct fuse_pqueue *fpq = &fud->pq;
2141
2142 WARN_ON(!list_empty(&fpq->io));
2143 end_requests(fc, &fpq->processing);
2144 /* Are we the last open device? */
2145 if (atomic_dec_and_test(&fc->dev_count)) {
2146 WARN_ON(fc->iq.fasync != NULL);
2147 fuse_abort_conn(fc);
2148 }
2149 fuse_dev_free(fud);
2150 }
2151 return 0;
2152}
2153EXPORT_SYMBOL_GPL(fuse_dev_release);
2154
2155static int fuse_dev_fasync(int fd, struct file *file, int on)
2156{
2157 struct fuse_dev *fud = fuse_get_dev(file);
2158
2159 if (!fud)
2160 return -EPERM;
2161
2162 /* No locking - fasync_helper does its own locking */
2163 return fasync_helper(fd, file, on, &fud->fc->iq.fasync);
2164}
2165
2166static int fuse_device_clone(struct fuse_conn *fc, struct file *new)
2167{
2168 struct fuse_dev *fud;
2169
2170 if (new->private_data)
2171 return -EINVAL;
2172
2173 fud = fuse_dev_alloc(fc);
2174 if (!fud)
2175 return -ENOMEM;
2176
2177 new->private_data = fud;
2178 atomic_inc(&fc->dev_count);
2179
2180 return 0;
2181}
2182
2183static long fuse_dev_ioctl(struct file *file, unsigned int cmd,
2184 unsigned long arg)
2185{
2186 int err = -ENOTTY;
2187
2188 if (cmd == FUSE_DEV_IOC_CLONE) {
2189 int oldfd;
2190
2191 err = -EFAULT;
2192 if (!get_user(oldfd, (__u32 __user *) arg)) {
2193 struct file *old = fget(oldfd);
2194
2195 err = -EINVAL;
2196 if (old) {
2197 struct fuse_dev *fud = NULL;
2198
2199 /*
2200 * Check against file->f_op because CUSE
2201 * uses the same ioctl handler.
2202 */
2203 if (old->f_op == file->f_op &&
2204 old->f_cred->user_ns == file->f_cred->user_ns)
2205 fud = fuse_get_dev(old);
2206
2207 if (fud) {
2208 mutex_lock(&fuse_mutex);
2209 err = fuse_device_clone(fud->fc, file);
2210 mutex_unlock(&fuse_mutex);
2211 }
2212 fput(old);
2213 }
2214 }
2215 }
2216 return err;
2217}
2218
2219const struct file_operations fuse_dev_operations = {
2220 .owner = THIS_MODULE,
2221 .open = fuse_dev_open,
2222 .llseek = no_llseek,
2223 .read_iter = fuse_dev_read,
2224 .splice_read = fuse_dev_splice_read,
2225 .write_iter = fuse_dev_write,
2226 .splice_write = fuse_dev_splice_write,
2227 .poll = fuse_dev_poll,
2228 .release = fuse_dev_release,
2229 .fasync = fuse_dev_fasync,
2230 .unlocked_ioctl = fuse_dev_ioctl,
2231 .compat_ioctl = fuse_dev_ioctl,
2232};
2233EXPORT_SYMBOL_GPL(fuse_dev_operations);
2234
2235static struct miscdevice fuse_miscdevice = {
2236 .minor = FUSE_MINOR,
2237 .name = "fuse",
2238 .fops = &fuse_dev_operations,
2239};
2240
2241int __init fuse_dev_init(void)
2242{
2243 int err = -ENOMEM;
2244 fuse_req_cachep = kmem_cache_create("fuse_request",
2245 sizeof(struct fuse_req),
2246 0, 0, NULL);
2247 if (!fuse_req_cachep)
2248 goto out;
2249
2250 err = misc_register(&fuse_miscdevice);
2251 if (err)
2252 goto out_cache_clean;
2253
2254 return 0;
2255
2256 out_cache_clean:
2257 kmem_cache_destroy(fuse_req_cachep);
2258 out:
2259 return err;
2260}
2261
2262void fuse_dev_cleanup(void)
2263{
2264 misc_deregister(&fuse_miscdevice);
2265 kmem_cache_destroy(fuse_req_cachep);
2266}
1/*
2 FUSE: Filesystem in Userspace
3 Copyright (C) 2001-2008 Miklos Szeredi <miklos@szeredi.hu>
4
5 This program can be distributed under the terms of the GNU GPL.
6 See the file COPYING.
7*/
8
9#include "fuse_i.h"
10
11#include <linux/init.h>
12#include <linux/module.h>
13#include <linux/poll.h>
14#include <linux/sched/signal.h>
15#include <linux/uio.h>
16#include <linux/miscdevice.h>
17#include <linux/pagemap.h>
18#include <linux/file.h>
19#include <linux/slab.h>
20#include <linux/pipe_fs_i.h>
21#include <linux/swap.h>
22#include <linux/splice.h>
23#include <linux/sched.h>
24
25#define CREATE_TRACE_POINTS
26#include "fuse_trace.h"
27
28MODULE_ALIAS_MISCDEV(FUSE_MINOR);
29MODULE_ALIAS("devname:fuse");
30
31/* Ordinary requests have even IDs, while interrupts IDs are odd */
32#define FUSE_INT_REQ_BIT (1ULL << 0)
33#define FUSE_REQ_ID_STEP (1ULL << 1)
34
35static struct kmem_cache *fuse_req_cachep;
36
37static void end_requests(struct list_head *head);
38
39static struct fuse_dev *fuse_get_dev(struct file *file)
40{
41 /*
42 * Lockless access is OK, because file->private data is set
43 * once during mount and is valid until the file is released.
44 */
45 return READ_ONCE(file->private_data);
46}
47
48static void fuse_request_init(struct fuse_mount *fm, struct fuse_req *req)
49{
50 INIT_LIST_HEAD(&req->list);
51 INIT_LIST_HEAD(&req->intr_entry);
52 init_waitqueue_head(&req->waitq);
53 refcount_set(&req->count, 1);
54 __set_bit(FR_PENDING, &req->flags);
55 req->fm = fm;
56}
57
58static struct fuse_req *fuse_request_alloc(struct fuse_mount *fm, gfp_t flags)
59{
60 struct fuse_req *req = kmem_cache_zalloc(fuse_req_cachep, flags);
61 if (req)
62 fuse_request_init(fm, req);
63
64 return req;
65}
66
67static void fuse_request_free(struct fuse_req *req)
68{
69 kmem_cache_free(fuse_req_cachep, req);
70}
71
72static void __fuse_get_request(struct fuse_req *req)
73{
74 refcount_inc(&req->count);
75}
76
77/* Must be called with > 1 refcount */
78static void __fuse_put_request(struct fuse_req *req)
79{
80 refcount_dec(&req->count);
81}
82
83void fuse_set_initialized(struct fuse_conn *fc)
84{
85 /* Make sure stores before this are seen on another CPU */
86 smp_wmb();
87 fc->initialized = 1;
88}
89
90static bool fuse_block_alloc(struct fuse_conn *fc, bool for_background)
91{
92 return !fc->initialized || (for_background && fc->blocked);
93}
94
95static void fuse_drop_waiting(struct fuse_conn *fc)
96{
97 /*
98 * lockess check of fc->connected is okay, because atomic_dec_and_test()
99 * provides a memory barrier matched with the one in fuse_wait_aborted()
100 * to ensure no wake-up is missed.
101 */
102 if (atomic_dec_and_test(&fc->num_waiting) &&
103 !READ_ONCE(fc->connected)) {
104 /* wake up aborters */
105 wake_up_all(&fc->blocked_waitq);
106 }
107}
108
109static void fuse_put_request(struct fuse_req *req);
110
111static struct fuse_req *fuse_get_req(struct mnt_idmap *idmap,
112 struct fuse_mount *fm,
113 bool for_background)
114{
115 struct fuse_conn *fc = fm->fc;
116 struct fuse_req *req;
117 bool no_idmap = !fm->sb || (fm->sb->s_iflags & SB_I_NOIDMAP);
118 kuid_t fsuid;
119 kgid_t fsgid;
120 int err;
121
122 atomic_inc(&fc->num_waiting);
123
124 if (fuse_block_alloc(fc, for_background)) {
125 err = -EINTR;
126 if (wait_event_killable_exclusive(fc->blocked_waitq,
127 !fuse_block_alloc(fc, for_background)))
128 goto out;
129 }
130 /* Matches smp_wmb() in fuse_set_initialized() */
131 smp_rmb();
132
133 err = -ENOTCONN;
134 if (!fc->connected)
135 goto out;
136
137 err = -ECONNREFUSED;
138 if (fc->conn_error)
139 goto out;
140
141 req = fuse_request_alloc(fm, GFP_KERNEL);
142 err = -ENOMEM;
143 if (!req) {
144 if (for_background)
145 wake_up(&fc->blocked_waitq);
146 goto out;
147 }
148
149 req->in.h.pid = pid_nr_ns(task_pid(current), fc->pid_ns);
150
151 __set_bit(FR_WAITING, &req->flags);
152 if (for_background)
153 __set_bit(FR_BACKGROUND, &req->flags);
154
155 /*
156 * Keep the old behavior when idmappings support was not
157 * declared by a FUSE server.
158 *
159 * For those FUSE servers who support idmapped mounts,
160 * we send UID/GID only along with "inode creation"
161 * fuse requests, otherwise idmap == &invalid_mnt_idmap and
162 * req->in.h.{u,g}id will be equal to FUSE_INVALID_UIDGID.
163 */
164 fsuid = no_idmap ? current_fsuid() : mapped_fsuid(idmap, fc->user_ns);
165 fsgid = no_idmap ? current_fsgid() : mapped_fsgid(idmap, fc->user_ns);
166 req->in.h.uid = from_kuid(fc->user_ns, fsuid);
167 req->in.h.gid = from_kgid(fc->user_ns, fsgid);
168
169 if (no_idmap && unlikely(req->in.h.uid == ((uid_t)-1) ||
170 req->in.h.gid == ((gid_t)-1))) {
171 fuse_put_request(req);
172 return ERR_PTR(-EOVERFLOW);
173 }
174
175 return req;
176
177 out:
178 fuse_drop_waiting(fc);
179 return ERR_PTR(err);
180}
181
182static void fuse_put_request(struct fuse_req *req)
183{
184 struct fuse_conn *fc = req->fm->fc;
185
186 if (refcount_dec_and_test(&req->count)) {
187 if (test_bit(FR_BACKGROUND, &req->flags)) {
188 /*
189 * We get here in the unlikely case that a background
190 * request was allocated but not sent
191 */
192 spin_lock(&fc->bg_lock);
193 if (!fc->blocked)
194 wake_up(&fc->blocked_waitq);
195 spin_unlock(&fc->bg_lock);
196 }
197
198 if (test_bit(FR_WAITING, &req->flags)) {
199 __clear_bit(FR_WAITING, &req->flags);
200 fuse_drop_waiting(fc);
201 }
202
203 fuse_request_free(req);
204 }
205}
206
207unsigned int fuse_len_args(unsigned int numargs, struct fuse_arg *args)
208{
209 unsigned nbytes = 0;
210 unsigned i;
211
212 for (i = 0; i < numargs; i++)
213 nbytes += args[i].size;
214
215 return nbytes;
216}
217EXPORT_SYMBOL_GPL(fuse_len_args);
218
219static u64 fuse_get_unique_locked(struct fuse_iqueue *fiq)
220{
221 fiq->reqctr += FUSE_REQ_ID_STEP;
222 return fiq->reqctr;
223}
224
225u64 fuse_get_unique(struct fuse_iqueue *fiq)
226{
227 u64 ret;
228
229 spin_lock(&fiq->lock);
230 ret = fuse_get_unique_locked(fiq);
231 spin_unlock(&fiq->lock);
232
233 return ret;
234}
235EXPORT_SYMBOL_GPL(fuse_get_unique);
236
237static unsigned int fuse_req_hash(u64 unique)
238{
239 return hash_long(unique & ~FUSE_INT_REQ_BIT, FUSE_PQ_HASH_BITS);
240}
241
242/*
243 * A new request is available, wake fiq->waitq
244 */
245static void fuse_dev_wake_and_unlock(struct fuse_iqueue *fiq)
246__releases(fiq->lock)
247{
248 wake_up(&fiq->waitq);
249 kill_fasync(&fiq->fasync, SIGIO, POLL_IN);
250 spin_unlock(&fiq->lock);
251}
252
253static void fuse_dev_queue_forget(struct fuse_iqueue *fiq, struct fuse_forget_link *forget)
254{
255 spin_lock(&fiq->lock);
256 if (fiq->connected) {
257 fiq->forget_list_tail->next = forget;
258 fiq->forget_list_tail = forget;
259 fuse_dev_wake_and_unlock(fiq);
260 } else {
261 kfree(forget);
262 spin_unlock(&fiq->lock);
263 }
264}
265
266static void fuse_dev_queue_interrupt(struct fuse_iqueue *fiq, struct fuse_req *req)
267{
268 spin_lock(&fiq->lock);
269 if (list_empty(&req->intr_entry)) {
270 list_add_tail(&req->intr_entry, &fiq->interrupts);
271 /*
272 * Pairs with smp_mb() implied by test_and_set_bit()
273 * from fuse_request_end().
274 */
275 smp_mb();
276 if (test_bit(FR_FINISHED, &req->flags)) {
277 list_del_init(&req->intr_entry);
278 spin_unlock(&fiq->lock);
279 } else {
280 fuse_dev_wake_and_unlock(fiq);
281 }
282 } else {
283 spin_unlock(&fiq->lock);
284 }
285}
286
287static void fuse_dev_queue_req(struct fuse_iqueue *fiq, struct fuse_req *req)
288{
289 spin_lock(&fiq->lock);
290 if (fiq->connected) {
291 if (req->in.h.opcode != FUSE_NOTIFY_REPLY)
292 req->in.h.unique = fuse_get_unique_locked(fiq);
293 list_add_tail(&req->list, &fiq->pending);
294 fuse_dev_wake_and_unlock(fiq);
295 } else {
296 spin_unlock(&fiq->lock);
297 req->out.h.error = -ENOTCONN;
298 clear_bit(FR_PENDING, &req->flags);
299 fuse_request_end(req);
300 }
301}
302
303const struct fuse_iqueue_ops fuse_dev_fiq_ops = {
304 .send_forget = fuse_dev_queue_forget,
305 .send_interrupt = fuse_dev_queue_interrupt,
306 .send_req = fuse_dev_queue_req,
307};
308EXPORT_SYMBOL_GPL(fuse_dev_fiq_ops);
309
310static void fuse_send_one(struct fuse_iqueue *fiq, struct fuse_req *req)
311{
312 req->in.h.len = sizeof(struct fuse_in_header) +
313 fuse_len_args(req->args->in_numargs,
314 (struct fuse_arg *) req->args->in_args);
315 trace_fuse_request_send(req);
316 fiq->ops->send_req(fiq, req);
317}
318
319void fuse_queue_forget(struct fuse_conn *fc, struct fuse_forget_link *forget,
320 u64 nodeid, u64 nlookup)
321{
322 struct fuse_iqueue *fiq = &fc->iq;
323
324 forget->forget_one.nodeid = nodeid;
325 forget->forget_one.nlookup = nlookup;
326
327 fiq->ops->send_forget(fiq, forget);
328}
329
330static void flush_bg_queue(struct fuse_conn *fc)
331{
332 struct fuse_iqueue *fiq = &fc->iq;
333
334 while (fc->active_background < fc->max_background &&
335 !list_empty(&fc->bg_queue)) {
336 struct fuse_req *req;
337
338 req = list_first_entry(&fc->bg_queue, struct fuse_req, list);
339 list_del(&req->list);
340 fc->active_background++;
341 fuse_send_one(fiq, req);
342 }
343}
344
345/*
346 * This function is called when a request is finished. Either a reply
347 * has arrived or it was aborted (and not yet sent) or some error
348 * occurred during communication with userspace, or the device file
349 * was closed. The requester thread is woken up (if still waiting),
350 * the 'end' callback is called if given, else the reference to the
351 * request is released
352 */
353void fuse_request_end(struct fuse_req *req)
354{
355 struct fuse_mount *fm = req->fm;
356 struct fuse_conn *fc = fm->fc;
357 struct fuse_iqueue *fiq = &fc->iq;
358
359 if (test_and_set_bit(FR_FINISHED, &req->flags))
360 goto put_request;
361
362 trace_fuse_request_end(req);
363 /*
364 * test_and_set_bit() implies smp_mb() between bit
365 * changing and below FR_INTERRUPTED check. Pairs with
366 * smp_mb() from queue_interrupt().
367 */
368 if (test_bit(FR_INTERRUPTED, &req->flags)) {
369 spin_lock(&fiq->lock);
370 list_del_init(&req->intr_entry);
371 spin_unlock(&fiq->lock);
372 }
373 WARN_ON(test_bit(FR_PENDING, &req->flags));
374 WARN_ON(test_bit(FR_SENT, &req->flags));
375 if (test_bit(FR_BACKGROUND, &req->flags)) {
376 spin_lock(&fc->bg_lock);
377 clear_bit(FR_BACKGROUND, &req->flags);
378 if (fc->num_background == fc->max_background) {
379 fc->blocked = 0;
380 wake_up(&fc->blocked_waitq);
381 } else if (!fc->blocked) {
382 /*
383 * Wake up next waiter, if any. It's okay to use
384 * waitqueue_active(), as we've already synced up
385 * fc->blocked with waiters with the wake_up() call
386 * above.
387 */
388 if (waitqueue_active(&fc->blocked_waitq))
389 wake_up(&fc->blocked_waitq);
390 }
391
392 fc->num_background--;
393 fc->active_background--;
394 flush_bg_queue(fc);
395 spin_unlock(&fc->bg_lock);
396 } else {
397 /* Wake up waiter sleeping in request_wait_answer() */
398 wake_up(&req->waitq);
399 }
400
401 if (test_bit(FR_ASYNC, &req->flags))
402 req->args->end(fm, req->args, req->out.h.error);
403put_request:
404 fuse_put_request(req);
405}
406EXPORT_SYMBOL_GPL(fuse_request_end);
407
408static int queue_interrupt(struct fuse_req *req)
409{
410 struct fuse_iqueue *fiq = &req->fm->fc->iq;
411
412 /* Check for we've sent request to interrupt this req */
413 if (unlikely(!test_bit(FR_INTERRUPTED, &req->flags)))
414 return -EINVAL;
415
416 fiq->ops->send_interrupt(fiq, req);
417
418 return 0;
419}
420
421static void request_wait_answer(struct fuse_req *req)
422{
423 struct fuse_conn *fc = req->fm->fc;
424 struct fuse_iqueue *fiq = &fc->iq;
425 int err;
426
427 if (!fc->no_interrupt) {
428 /* Any signal may interrupt this */
429 err = wait_event_interruptible(req->waitq,
430 test_bit(FR_FINISHED, &req->flags));
431 if (!err)
432 return;
433
434 set_bit(FR_INTERRUPTED, &req->flags);
435 /* matches barrier in fuse_dev_do_read() */
436 smp_mb__after_atomic();
437 if (test_bit(FR_SENT, &req->flags))
438 queue_interrupt(req);
439 }
440
441 if (!test_bit(FR_FORCE, &req->flags)) {
442 /* Only fatal signals may interrupt this */
443 err = wait_event_killable(req->waitq,
444 test_bit(FR_FINISHED, &req->flags));
445 if (!err)
446 return;
447
448 spin_lock(&fiq->lock);
449 /* Request is not yet in userspace, bail out */
450 if (test_bit(FR_PENDING, &req->flags)) {
451 list_del(&req->list);
452 spin_unlock(&fiq->lock);
453 __fuse_put_request(req);
454 req->out.h.error = -EINTR;
455 return;
456 }
457 spin_unlock(&fiq->lock);
458 }
459
460 /*
461 * Either request is already in userspace, or it was forced.
462 * Wait it out.
463 */
464 wait_event(req->waitq, test_bit(FR_FINISHED, &req->flags));
465}
466
467static void __fuse_request_send(struct fuse_req *req)
468{
469 struct fuse_iqueue *fiq = &req->fm->fc->iq;
470
471 BUG_ON(test_bit(FR_BACKGROUND, &req->flags));
472
473 /* acquire extra reference, since request is still needed after
474 fuse_request_end() */
475 __fuse_get_request(req);
476 fuse_send_one(fiq, req);
477
478 request_wait_answer(req);
479 /* Pairs with smp_wmb() in fuse_request_end() */
480 smp_rmb();
481}
482
483static void fuse_adjust_compat(struct fuse_conn *fc, struct fuse_args *args)
484{
485 if (fc->minor < 4 && args->opcode == FUSE_STATFS)
486 args->out_args[0].size = FUSE_COMPAT_STATFS_SIZE;
487
488 if (fc->minor < 9) {
489 switch (args->opcode) {
490 case FUSE_LOOKUP:
491 case FUSE_CREATE:
492 case FUSE_MKNOD:
493 case FUSE_MKDIR:
494 case FUSE_SYMLINK:
495 case FUSE_LINK:
496 args->out_args[0].size = FUSE_COMPAT_ENTRY_OUT_SIZE;
497 break;
498 case FUSE_GETATTR:
499 case FUSE_SETATTR:
500 args->out_args[0].size = FUSE_COMPAT_ATTR_OUT_SIZE;
501 break;
502 }
503 }
504 if (fc->minor < 12) {
505 switch (args->opcode) {
506 case FUSE_CREATE:
507 args->in_args[0].size = sizeof(struct fuse_open_in);
508 break;
509 case FUSE_MKNOD:
510 args->in_args[0].size = FUSE_COMPAT_MKNOD_IN_SIZE;
511 break;
512 }
513 }
514}
515
516static void fuse_force_creds(struct fuse_req *req)
517{
518 struct fuse_conn *fc = req->fm->fc;
519
520 if (!req->fm->sb || req->fm->sb->s_iflags & SB_I_NOIDMAP) {
521 req->in.h.uid = from_kuid_munged(fc->user_ns, current_fsuid());
522 req->in.h.gid = from_kgid_munged(fc->user_ns, current_fsgid());
523 } else {
524 req->in.h.uid = FUSE_INVALID_UIDGID;
525 req->in.h.gid = FUSE_INVALID_UIDGID;
526 }
527
528 req->in.h.pid = pid_nr_ns(task_pid(current), fc->pid_ns);
529}
530
531static void fuse_args_to_req(struct fuse_req *req, struct fuse_args *args)
532{
533 req->in.h.opcode = args->opcode;
534 req->in.h.nodeid = args->nodeid;
535 req->args = args;
536 if (args->is_ext)
537 req->in.h.total_extlen = args->in_args[args->ext_idx].size / 8;
538 if (args->end)
539 __set_bit(FR_ASYNC, &req->flags);
540}
541
542ssize_t __fuse_simple_request(struct mnt_idmap *idmap,
543 struct fuse_mount *fm,
544 struct fuse_args *args)
545{
546 struct fuse_conn *fc = fm->fc;
547 struct fuse_req *req;
548 ssize_t ret;
549
550 if (args->force) {
551 atomic_inc(&fc->num_waiting);
552 req = fuse_request_alloc(fm, GFP_KERNEL | __GFP_NOFAIL);
553
554 if (!args->nocreds)
555 fuse_force_creds(req);
556
557 __set_bit(FR_WAITING, &req->flags);
558 __set_bit(FR_FORCE, &req->flags);
559 } else {
560 WARN_ON(args->nocreds);
561 req = fuse_get_req(idmap, fm, false);
562 if (IS_ERR(req))
563 return PTR_ERR(req);
564 }
565
566 /* Needs to be done after fuse_get_req() so that fc->minor is valid */
567 fuse_adjust_compat(fc, args);
568 fuse_args_to_req(req, args);
569
570 if (!args->noreply)
571 __set_bit(FR_ISREPLY, &req->flags);
572 __fuse_request_send(req);
573 ret = req->out.h.error;
574 if (!ret && args->out_argvar) {
575 BUG_ON(args->out_numargs == 0);
576 ret = args->out_args[args->out_numargs - 1].size;
577 }
578 fuse_put_request(req);
579
580 return ret;
581}
582
583static bool fuse_request_queue_background(struct fuse_req *req)
584{
585 struct fuse_mount *fm = req->fm;
586 struct fuse_conn *fc = fm->fc;
587 bool queued = false;
588
589 WARN_ON(!test_bit(FR_BACKGROUND, &req->flags));
590 if (!test_bit(FR_WAITING, &req->flags)) {
591 __set_bit(FR_WAITING, &req->flags);
592 atomic_inc(&fc->num_waiting);
593 }
594 __set_bit(FR_ISREPLY, &req->flags);
595 spin_lock(&fc->bg_lock);
596 if (likely(fc->connected)) {
597 fc->num_background++;
598 if (fc->num_background == fc->max_background)
599 fc->blocked = 1;
600 list_add_tail(&req->list, &fc->bg_queue);
601 flush_bg_queue(fc);
602 queued = true;
603 }
604 spin_unlock(&fc->bg_lock);
605
606 return queued;
607}
608
609int fuse_simple_background(struct fuse_mount *fm, struct fuse_args *args,
610 gfp_t gfp_flags)
611{
612 struct fuse_req *req;
613
614 if (args->force) {
615 WARN_ON(!args->nocreds);
616 req = fuse_request_alloc(fm, gfp_flags);
617 if (!req)
618 return -ENOMEM;
619 __set_bit(FR_BACKGROUND, &req->flags);
620 } else {
621 WARN_ON(args->nocreds);
622 req = fuse_get_req(&invalid_mnt_idmap, fm, true);
623 if (IS_ERR(req))
624 return PTR_ERR(req);
625 }
626
627 fuse_args_to_req(req, args);
628
629 if (!fuse_request_queue_background(req)) {
630 fuse_put_request(req);
631 return -ENOTCONN;
632 }
633
634 return 0;
635}
636EXPORT_SYMBOL_GPL(fuse_simple_background);
637
638static int fuse_simple_notify_reply(struct fuse_mount *fm,
639 struct fuse_args *args, u64 unique)
640{
641 struct fuse_req *req;
642 struct fuse_iqueue *fiq = &fm->fc->iq;
643
644 req = fuse_get_req(&invalid_mnt_idmap, fm, false);
645 if (IS_ERR(req))
646 return PTR_ERR(req);
647
648 __clear_bit(FR_ISREPLY, &req->flags);
649 req->in.h.unique = unique;
650
651 fuse_args_to_req(req, args);
652
653 fuse_send_one(fiq, req);
654
655 return 0;
656}
657
658/*
659 * Lock the request. Up to the next unlock_request() there mustn't be
660 * anything that could cause a page-fault. If the request was already
661 * aborted bail out.
662 */
663static int lock_request(struct fuse_req *req)
664{
665 int err = 0;
666 if (req) {
667 spin_lock(&req->waitq.lock);
668 if (test_bit(FR_ABORTED, &req->flags))
669 err = -ENOENT;
670 else
671 set_bit(FR_LOCKED, &req->flags);
672 spin_unlock(&req->waitq.lock);
673 }
674 return err;
675}
676
677/*
678 * Unlock request. If it was aborted while locked, caller is responsible
679 * for unlocking and ending the request.
680 */
681static int unlock_request(struct fuse_req *req)
682{
683 int err = 0;
684 if (req) {
685 spin_lock(&req->waitq.lock);
686 if (test_bit(FR_ABORTED, &req->flags))
687 err = -ENOENT;
688 else
689 clear_bit(FR_LOCKED, &req->flags);
690 spin_unlock(&req->waitq.lock);
691 }
692 return err;
693}
694
695struct fuse_copy_state {
696 int write;
697 struct fuse_req *req;
698 struct iov_iter *iter;
699 struct pipe_buffer *pipebufs;
700 struct pipe_buffer *currbuf;
701 struct pipe_inode_info *pipe;
702 unsigned long nr_segs;
703 struct page *pg;
704 unsigned len;
705 unsigned offset;
706 unsigned move_pages:1;
707};
708
709static void fuse_copy_init(struct fuse_copy_state *cs, int write,
710 struct iov_iter *iter)
711{
712 memset(cs, 0, sizeof(*cs));
713 cs->write = write;
714 cs->iter = iter;
715}
716
717/* Unmap and put previous page of userspace buffer */
718static void fuse_copy_finish(struct fuse_copy_state *cs)
719{
720 if (cs->currbuf) {
721 struct pipe_buffer *buf = cs->currbuf;
722
723 if (cs->write)
724 buf->len = PAGE_SIZE - cs->len;
725 cs->currbuf = NULL;
726 } else if (cs->pg) {
727 if (cs->write) {
728 flush_dcache_page(cs->pg);
729 set_page_dirty_lock(cs->pg);
730 }
731 put_page(cs->pg);
732 }
733 cs->pg = NULL;
734}
735
736/*
737 * Get another pagefull of userspace buffer, and map it to kernel
738 * address space, and lock request
739 */
740static int fuse_copy_fill(struct fuse_copy_state *cs)
741{
742 struct page *page;
743 int err;
744
745 err = unlock_request(cs->req);
746 if (err)
747 return err;
748
749 fuse_copy_finish(cs);
750 if (cs->pipebufs) {
751 struct pipe_buffer *buf = cs->pipebufs;
752
753 if (!cs->write) {
754 err = pipe_buf_confirm(cs->pipe, buf);
755 if (err)
756 return err;
757
758 BUG_ON(!cs->nr_segs);
759 cs->currbuf = buf;
760 cs->pg = buf->page;
761 cs->offset = buf->offset;
762 cs->len = buf->len;
763 cs->pipebufs++;
764 cs->nr_segs--;
765 } else {
766 if (cs->nr_segs >= cs->pipe->max_usage)
767 return -EIO;
768
769 page = alloc_page(GFP_HIGHUSER);
770 if (!page)
771 return -ENOMEM;
772
773 buf->page = page;
774 buf->offset = 0;
775 buf->len = 0;
776
777 cs->currbuf = buf;
778 cs->pg = page;
779 cs->offset = 0;
780 cs->len = PAGE_SIZE;
781 cs->pipebufs++;
782 cs->nr_segs++;
783 }
784 } else {
785 size_t off;
786 err = iov_iter_get_pages2(cs->iter, &page, PAGE_SIZE, 1, &off);
787 if (err < 0)
788 return err;
789 BUG_ON(!err);
790 cs->len = err;
791 cs->offset = off;
792 cs->pg = page;
793 }
794
795 return lock_request(cs->req);
796}
797
798/* Do as much copy to/from userspace buffer as we can */
799static int fuse_copy_do(struct fuse_copy_state *cs, void **val, unsigned *size)
800{
801 unsigned ncpy = min(*size, cs->len);
802 if (val) {
803 void *pgaddr = kmap_local_page(cs->pg);
804 void *buf = pgaddr + cs->offset;
805
806 if (cs->write)
807 memcpy(buf, *val, ncpy);
808 else
809 memcpy(*val, buf, ncpy);
810
811 kunmap_local(pgaddr);
812 *val += ncpy;
813 }
814 *size -= ncpy;
815 cs->len -= ncpy;
816 cs->offset += ncpy;
817 return ncpy;
818}
819
820static int fuse_check_folio(struct folio *folio)
821{
822 if (folio_mapped(folio) ||
823 folio->mapping != NULL ||
824 (folio->flags & PAGE_FLAGS_CHECK_AT_PREP &
825 ~(1 << PG_locked |
826 1 << PG_referenced |
827 1 << PG_lru |
828 1 << PG_active |
829 1 << PG_workingset |
830 1 << PG_reclaim |
831 1 << PG_waiters |
832 LRU_GEN_MASK | LRU_REFS_MASK))) {
833 dump_page(&folio->page, "fuse: trying to steal weird page");
834 return 1;
835 }
836 return 0;
837}
838
839/*
840 * Attempt to steal a page from the splice() pipe and move it into the
841 * pagecache. If successful, the pointer in @pagep will be updated. The
842 * folio that was originally in @pagep will lose a reference and the new
843 * folio returned in @pagep will carry a reference.
844 */
845static int fuse_try_move_page(struct fuse_copy_state *cs, struct page **pagep)
846{
847 int err;
848 struct folio *oldfolio = page_folio(*pagep);
849 struct folio *newfolio;
850 struct pipe_buffer *buf = cs->pipebufs;
851
852 folio_get(oldfolio);
853 err = unlock_request(cs->req);
854 if (err)
855 goto out_put_old;
856
857 fuse_copy_finish(cs);
858
859 err = pipe_buf_confirm(cs->pipe, buf);
860 if (err)
861 goto out_put_old;
862
863 BUG_ON(!cs->nr_segs);
864 cs->currbuf = buf;
865 cs->len = buf->len;
866 cs->pipebufs++;
867 cs->nr_segs--;
868
869 if (cs->len != PAGE_SIZE)
870 goto out_fallback;
871
872 if (!pipe_buf_try_steal(cs->pipe, buf))
873 goto out_fallback;
874
875 newfolio = page_folio(buf->page);
876
877 folio_clear_uptodate(newfolio);
878 folio_clear_mappedtodisk(newfolio);
879
880 if (fuse_check_folio(newfolio) != 0)
881 goto out_fallback_unlock;
882
883 /*
884 * This is a new and locked page, it shouldn't be mapped or
885 * have any special flags on it
886 */
887 if (WARN_ON(folio_mapped(oldfolio)))
888 goto out_fallback_unlock;
889 if (WARN_ON(folio_has_private(oldfolio)))
890 goto out_fallback_unlock;
891 if (WARN_ON(folio_test_dirty(oldfolio) ||
892 folio_test_writeback(oldfolio)))
893 goto out_fallback_unlock;
894 if (WARN_ON(folio_test_mlocked(oldfolio)))
895 goto out_fallback_unlock;
896
897 replace_page_cache_folio(oldfolio, newfolio);
898
899 folio_get(newfolio);
900
901 if (!(buf->flags & PIPE_BUF_FLAG_LRU))
902 folio_add_lru(newfolio);
903
904 /*
905 * Release while we have extra ref on stolen page. Otherwise
906 * anon_pipe_buf_release() might think the page can be reused.
907 */
908 pipe_buf_release(cs->pipe, buf);
909
910 err = 0;
911 spin_lock(&cs->req->waitq.lock);
912 if (test_bit(FR_ABORTED, &cs->req->flags))
913 err = -ENOENT;
914 else
915 *pagep = &newfolio->page;
916 spin_unlock(&cs->req->waitq.lock);
917
918 if (err) {
919 folio_unlock(newfolio);
920 folio_put(newfolio);
921 goto out_put_old;
922 }
923
924 folio_unlock(oldfolio);
925 /* Drop ref for ap->pages[] array */
926 folio_put(oldfolio);
927 cs->len = 0;
928
929 err = 0;
930out_put_old:
931 /* Drop ref obtained in this function */
932 folio_put(oldfolio);
933 return err;
934
935out_fallback_unlock:
936 folio_unlock(newfolio);
937out_fallback:
938 cs->pg = buf->page;
939 cs->offset = buf->offset;
940
941 err = lock_request(cs->req);
942 if (!err)
943 err = 1;
944
945 goto out_put_old;
946}
947
948static int fuse_ref_page(struct fuse_copy_state *cs, struct page *page,
949 unsigned offset, unsigned count)
950{
951 struct pipe_buffer *buf;
952 int err;
953
954 if (cs->nr_segs >= cs->pipe->max_usage)
955 return -EIO;
956
957 get_page(page);
958 err = unlock_request(cs->req);
959 if (err) {
960 put_page(page);
961 return err;
962 }
963
964 fuse_copy_finish(cs);
965
966 buf = cs->pipebufs;
967 buf->page = page;
968 buf->offset = offset;
969 buf->len = count;
970
971 cs->pipebufs++;
972 cs->nr_segs++;
973 cs->len = 0;
974
975 return 0;
976}
977
978/*
979 * Copy a page in the request to/from the userspace buffer. Must be
980 * done atomically
981 */
982static int fuse_copy_page(struct fuse_copy_state *cs, struct page **pagep,
983 unsigned offset, unsigned count, int zeroing)
984{
985 int err;
986 struct page *page = *pagep;
987
988 if (page && zeroing && count < PAGE_SIZE)
989 clear_highpage(page);
990
991 while (count) {
992 if (cs->write && cs->pipebufs && page) {
993 /*
994 * Can't control lifetime of pipe buffers, so always
995 * copy user pages.
996 */
997 if (cs->req->args->user_pages) {
998 err = fuse_copy_fill(cs);
999 if (err)
1000 return err;
1001 } else {
1002 return fuse_ref_page(cs, page, offset, count);
1003 }
1004 } else if (!cs->len) {
1005 if (cs->move_pages && page &&
1006 offset == 0 && count == PAGE_SIZE) {
1007 err = fuse_try_move_page(cs, pagep);
1008 if (err <= 0)
1009 return err;
1010 } else {
1011 err = fuse_copy_fill(cs);
1012 if (err)
1013 return err;
1014 }
1015 }
1016 if (page) {
1017 void *mapaddr = kmap_local_page(page);
1018 void *buf = mapaddr + offset;
1019 offset += fuse_copy_do(cs, &buf, &count);
1020 kunmap_local(mapaddr);
1021 } else
1022 offset += fuse_copy_do(cs, NULL, &count);
1023 }
1024 if (page && !cs->write)
1025 flush_dcache_page(page);
1026 return 0;
1027}
1028
1029/* Copy pages in the request to/from userspace buffer */
1030static int fuse_copy_pages(struct fuse_copy_state *cs, unsigned nbytes,
1031 int zeroing)
1032{
1033 unsigned i;
1034 struct fuse_req *req = cs->req;
1035 struct fuse_args_pages *ap = container_of(req->args, typeof(*ap), args);
1036
1037 for (i = 0; i < ap->num_folios && (nbytes || zeroing); i++) {
1038 int err;
1039 unsigned int offset = ap->descs[i].offset;
1040 unsigned int count = min(nbytes, ap->descs[i].length);
1041 struct page *orig, *pagep;
1042
1043 orig = pagep = &ap->folios[i]->page;
1044
1045 err = fuse_copy_page(cs, &pagep, offset, count, zeroing);
1046 if (err)
1047 return err;
1048
1049 nbytes -= count;
1050
1051 /*
1052 * fuse_copy_page may have moved a page from a pipe instead of
1053 * copying into our given page, so update the folios if it was
1054 * replaced.
1055 */
1056 if (pagep != orig)
1057 ap->folios[i] = page_folio(pagep);
1058 }
1059 return 0;
1060}
1061
1062/* Copy a single argument in the request to/from userspace buffer */
1063static int fuse_copy_one(struct fuse_copy_state *cs, void *val, unsigned size)
1064{
1065 while (size) {
1066 if (!cs->len) {
1067 int err = fuse_copy_fill(cs);
1068 if (err)
1069 return err;
1070 }
1071 fuse_copy_do(cs, &val, &size);
1072 }
1073 return 0;
1074}
1075
1076/* Copy request arguments to/from userspace buffer */
1077static int fuse_copy_args(struct fuse_copy_state *cs, unsigned numargs,
1078 unsigned argpages, struct fuse_arg *args,
1079 int zeroing)
1080{
1081 int err = 0;
1082 unsigned i;
1083
1084 for (i = 0; !err && i < numargs; i++) {
1085 struct fuse_arg *arg = &args[i];
1086 if (i == numargs - 1 && argpages)
1087 err = fuse_copy_pages(cs, arg->size, zeroing);
1088 else
1089 err = fuse_copy_one(cs, arg->value, arg->size);
1090 }
1091 return err;
1092}
1093
1094static int forget_pending(struct fuse_iqueue *fiq)
1095{
1096 return fiq->forget_list_head.next != NULL;
1097}
1098
1099static int request_pending(struct fuse_iqueue *fiq)
1100{
1101 return !list_empty(&fiq->pending) || !list_empty(&fiq->interrupts) ||
1102 forget_pending(fiq);
1103}
1104
1105/*
1106 * Transfer an interrupt request to userspace
1107 *
1108 * Unlike other requests this is assembled on demand, without a need
1109 * to allocate a separate fuse_req structure.
1110 *
1111 * Called with fiq->lock held, releases it
1112 */
1113static int fuse_read_interrupt(struct fuse_iqueue *fiq,
1114 struct fuse_copy_state *cs,
1115 size_t nbytes, struct fuse_req *req)
1116__releases(fiq->lock)
1117{
1118 struct fuse_in_header ih;
1119 struct fuse_interrupt_in arg;
1120 unsigned reqsize = sizeof(ih) + sizeof(arg);
1121 int err;
1122
1123 list_del_init(&req->intr_entry);
1124 memset(&ih, 0, sizeof(ih));
1125 memset(&arg, 0, sizeof(arg));
1126 ih.len = reqsize;
1127 ih.opcode = FUSE_INTERRUPT;
1128 ih.unique = (req->in.h.unique | FUSE_INT_REQ_BIT);
1129 arg.unique = req->in.h.unique;
1130
1131 spin_unlock(&fiq->lock);
1132 if (nbytes < reqsize)
1133 return -EINVAL;
1134
1135 err = fuse_copy_one(cs, &ih, sizeof(ih));
1136 if (!err)
1137 err = fuse_copy_one(cs, &arg, sizeof(arg));
1138 fuse_copy_finish(cs);
1139
1140 return err ? err : reqsize;
1141}
1142
1143static struct fuse_forget_link *fuse_dequeue_forget(struct fuse_iqueue *fiq,
1144 unsigned int max,
1145 unsigned int *countp)
1146{
1147 struct fuse_forget_link *head = fiq->forget_list_head.next;
1148 struct fuse_forget_link **newhead = &head;
1149 unsigned count;
1150
1151 for (count = 0; *newhead != NULL && count < max; count++)
1152 newhead = &(*newhead)->next;
1153
1154 fiq->forget_list_head.next = *newhead;
1155 *newhead = NULL;
1156 if (fiq->forget_list_head.next == NULL)
1157 fiq->forget_list_tail = &fiq->forget_list_head;
1158
1159 if (countp != NULL)
1160 *countp = count;
1161
1162 return head;
1163}
1164
1165static int fuse_read_single_forget(struct fuse_iqueue *fiq,
1166 struct fuse_copy_state *cs,
1167 size_t nbytes)
1168__releases(fiq->lock)
1169{
1170 int err;
1171 struct fuse_forget_link *forget = fuse_dequeue_forget(fiq, 1, NULL);
1172 struct fuse_forget_in arg = {
1173 .nlookup = forget->forget_one.nlookup,
1174 };
1175 struct fuse_in_header ih = {
1176 .opcode = FUSE_FORGET,
1177 .nodeid = forget->forget_one.nodeid,
1178 .unique = fuse_get_unique_locked(fiq),
1179 .len = sizeof(ih) + sizeof(arg),
1180 };
1181
1182 spin_unlock(&fiq->lock);
1183 kfree(forget);
1184 if (nbytes < ih.len)
1185 return -EINVAL;
1186
1187 err = fuse_copy_one(cs, &ih, sizeof(ih));
1188 if (!err)
1189 err = fuse_copy_one(cs, &arg, sizeof(arg));
1190 fuse_copy_finish(cs);
1191
1192 if (err)
1193 return err;
1194
1195 return ih.len;
1196}
1197
1198static int fuse_read_batch_forget(struct fuse_iqueue *fiq,
1199 struct fuse_copy_state *cs, size_t nbytes)
1200__releases(fiq->lock)
1201{
1202 int err;
1203 unsigned max_forgets;
1204 unsigned count;
1205 struct fuse_forget_link *head;
1206 struct fuse_batch_forget_in arg = { .count = 0 };
1207 struct fuse_in_header ih = {
1208 .opcode = FUSE_BATCH_FORGET,
1209 .unique = fuse_get_unique_locked(fiq),
1210 .len = sizeof(ih) + sizeof(arg),
1211 };
1212
1213 if (nbytes < ih.len) {
1214 spin_unlock(&fiq->lock);
1215 return -EINVAL;
1216 }
1217
1218 max_forgets = (nbytes - ih.len) / sizeof(struct fuse_forget_one);
1219 head = fuse_dequeue_forget(fiq, max_forgets, &count);
1220 spin_unlock(&fiq->lock);
1221
1222 arg.count = count;
1223 ih.len += count * sizeof(struct fuse_forget_one);
1224 err = fuse_copy_one(cs, &ih, sizeof(ih));
1225 if (!err)
1226 err = fuse_copy_one(cs, &arg, sizeof(arg));
1227
1228 while (head) {
1229 struct fuse_forget_link *forget = head;
1230
1231 if (!err) {
1232 err = fuse_copy_one(cs, &forget->forget_one,
1233 sizeof(forget->forget_one));
1234 }
1235 head = forget->next;
1236 kfree(forget);
1237 }
1238
1239 fuse_copy_finish(cs);
1240
1241 if (err)
1242 return err;
1243
1244 return ih.len;
1245}
1246
1247static int fuse_read_forget(struct fuse_conn *fc, struct fuse_iqueue *fiq,
1248 struct fuse_copy_state *cs,
1249 size_t nbytes)
1250__releases(fiq->lock)
1251{
1252 if (fc->minor < 16 || fiq->forget_list_head.next->next == NULL)
1253 return fuse_read_single_forget(fiq, cs, nbytes);
1254 else
1255 return fuse_read_batch_forget(fiq, cs, nbytes);
1256}
1257
1258/*
1259 * Read a single request into the userspace filesystem's buffer. This
1260 * function waits until a request is available, then removes it from
1261 * the pending list and copies request data to userspace buffer. If
1262 * no reply is needed (FORGET) or request has been aborted or there
1263 * was an error during the copying then it's finished by calling
1264 * fuse_request_end(). Otherwise add it to the processing list, and set
1265 * the 'sent' flag.
1266 */
1267static ssize_t fuse_dev_do_read(struct fuse_dev *fud, struct file *file,
1268 struct fuse_copy_state *cs, size_t nbytes)
1269{
1270 ssize_t err;
1271 struct fuse_conn *fc = fud->fc;
1272 struct fuse_iqueue *fiq = &fc->iq;
1273 struct fuse_pqueue *fpq = &fud->pq;
1274 struct fuse_req *req;
1275 struct fuse_args *args;
1276 unsigned reqsize;
1277 unsigned int hash;
1278
1279 /*
1280 * Require sane minimum read buffer - that has capacity for fixed part
1281 * of any request header + negotiated max_write room for data.
1282 *
1283 * Historically libfuse reserves 4K for fixed header room, but e.g.
1284 * GlusterFS reserves only 80 bytes
1285 *
1286 * = `sizeof(fuse_in_header) + sizeof(fuse_write_in)`
1287 *
1288 * which is the absolute minimum any sane filesystem should be using
1289 * for header room.
1290 */
1291 if (nbytes < max_t(size_t, FUSE_MIN_READ_BUFFER,
1292 sizeof(struct fuse_in_header) +
1293 sizeof(struct fuse_write_in) +
1294 fc->max_write))
1295 return -EINVAL;
1296
1297 restart:
1298 for (;;) {
1299 spin_lock(&fiq->lock);
1300 if (!fiq->connected || request_pending(fiq))
1301 break;
1302 spin_unlock(&fiq->lock);
1303
1304 if (file->f_flags & O_NONBLOCK)
1305 return -EAGAIN;
1306 err = wait_event_interruptible_exclusive(fiq->waitq,
1307 !fiq->connected || request_pending(fiq));
1308 if (err)
1309 return err;
1310 }
1311
1312 if (!fiq->connected) {
1313 err = fc->aborted ? -ECONNABORTED : -ENODEV;
1314 goto err_unlock;
1315 }
1316
1317 if (!list_empty(&fiq->interrupts)) {
1318 req = list_entry(fiq->interrupts.next, struct fuse_req,
1319 intr_entry);
1320 return fuse_read_interrupt(fiq, cs, nbytes, req);
1321 }
1322
1323 if (forget_pending(fiq)) {
1324 if (list_empty(&fiq->pending) || fiq->forget_batch-- > 0)
1325 return fuse_read_forget(fc, fiq, cs, nbytes);
1326
1327 if (fiq->forget_batch <= -8)
1328 fiq->forget_batch = 16;
1329 }
1330
1331 req = list_entry(fiq->pending.next, struct fuse_req, list);
1332 clear_bit(FR_PENDING, &req->flags);
1333 list_del_init(&req->list);
1334 spin_unlock(&fiq->lock);
1335
1336 args = req->args;
1337 reqsize = req->in.h.len;
1338
1339 /* If request is too large, reply with an error and restart the read */
1340 if (nbytes < reqsize) {
1341 req->out.h.error = -EIO;
1342 /* SETXATTR is special, since it may contain too large data */
1343 if (args->opcode == FUSE_SETXATTR)
1344 req->out.h.error = -E2BIG;
1345 fuse_request_end(req);
1346 goto restart;
1347 }
1348 spin_lock(&fpq->lock);
1349 /*
1350 * Must not put request on fpq->io queue after having been shut down by
1351 * fuse_abort_conn()
1352 */
1353 if (!fpq->connected) {
1354 req->out.h.error = err = -ECONNABORTED;
1355 goto out_end;
1356
1357 }
1358 list_add(&req->list, &fpq->io);
1359 spin_unlock(&fpq->lock);
1360 cs->req = req;
1361 err = fuse_copy_one(cs, &req->in.h, sizeof(req->in.h));
1362 if (!err)
1363 err = fuse_copy_args(cs, args->in_numargs, args->in_pages,
1364 (struct fuse_arg *) args->in_args, 0);
1365 fuse_copy_finish(cs);
1366 spin_lock(&fpq->lock);
1367 clear_bit(FR_LOCKED, &req->flags);
1368 if (!fpq->connected) {
1369 err = fc->aborted ? -ECONNABORTED : -ENODEV;
1370 goto out_end;
1371 }
1372 if (err) {
1373 req->out.h.error = -EIO;
1374 goto out_end;
1375 }
1376 if (!test_bit(FR_ISREPLY, &req->flags)) {
1377 err = reqsize;
1378 goto out_end;
1379 }
1380 hash = fuse_req_hash(req->in.h.unique);
1381 list_move_tail(&req->list, &fpq->processing[hash]);
1382 __fuse_get_request(req);
1383 set_bit(FR_SENT, &req->flags);
1384 spin_unlock(&fpq->lock);
1385 /* matches barrier in request_wait_answer() */
1386 smp_mb__after_atomic();
1387 if (test_bit(FR_INTERRUPTED, &req->flags))
1388 queue_interrupt(req);
1389 fuse_put_request(req);
1390
1391 return reqsize;
1392
1393out_end:
1394 if (!test_bit(FR_PRIVATE, &req->flags))
1395 list_del_init(&req->list);
1396 spin_unlock(&fpq->lock);
1397 fuse_request_end(req);
1398 return err;
1399
1400 err_unlock:
1401 spin_unlock(&fiq->lock);
1402 return err;
1403}
1404
1405static int fuse_dev_open(struct inode *inode, struct file *file)
1406{
1407 /*
1408 * The fuse device's file's private_data is used to hold
1409 * the fuse_conn(ection) when it is mounted, and is used to
1410 * keep track of whether the file has been mounted already.
1411 */
1412 file->private_data = NULL;
1413 return 0;
1414}
1415
1416static ssize_t fuse_dev_read(struct kiocb *iocb, struct iov_iter *to)
1417{
1418 struct fuse_copy_state cs;
1419 struct file *file = iocb->ki_filp;
1420 struct fuse_dev *fud = fuse_get_dev(file);
1421
1422 if (!fud)
1423 return -EPERM;
1424
1425 if (!user_backed_iter(to))
1426 return -EINVAL;
1427
1428 fuse_copy_init(&cs, 1, to);
1429
1430 return fuse_dev_do_read(fud, file, &cs, iov_iter_count(to));
1431}
1432
1433static ssize_t fuse_dev_splice_read(struct file *in, loff_t *ppos,
1434 struct pipe_inode_info *pipe,
1435 size_t len, unsigned int flags)
1436{
1437 int total, ret;
1438 int page_nr = 0;
1439 struct pipe_buffer *bufs;
1440 struct fuse_copy_state cs;
1441 struct fuse_dev *fud = fuse_get_dev(in);
1442
1443 if (!fud)
1444 return -EPERM;
1445
1446 bufs = kvmalloc_array(pipe->max_usage, sizeof(struct pipe_buffer),
1447 GFP_KERNEL);
1448 if (!bufs)
1449 return -ENOMEM;
1450
1451 fuse_copy_init(&cs, 1, NULL);
1452 cs.pipebufs = bufs;
1453 cs.pipe = pipe;
1454 ret = fuse_dev_do_read(fud, in, &cs, len);
1455 if (ret < 0)
1456 goto out;
1457
1458 if (pipe_occupancy(pipe->head, pipe->tail) + cs.nr_segs > pipe->max_usage) {
1459 ret = -EIO;
1460 goto out;
1461 }
1462
1463 for (ret = total = 0; page_nr < cs.nr_segs; total += ret) {
1464 /*
1465 * Need to be careful about this. Having buf->ops in module
1466 * code can Oops if the buffer persists after module unload.
1467 */
1468 bufs[page_nr].ops = &nosteal_pipe_buf_ops;
1469 bufs[page_nr].flags = 0;
1470 ret = add_to_pipe(pipe, &bufs[page_nr++]);
1471 if (unlikely(ret < 0))
1472 break;
1473 }
1474 if (total)
1475 ret = total;
1476out:
1477 for (; page_nr < cs.nr_segs; page_nr++)
1478 put_page(bufs[page_nr].page);
1479
1480 kvfree(bufs);
1481 return ret;
1482}
1483
1484static int fuse_notify_poll(struct fuse_conn *fc, unsigned int size,
1485 struct fuse_copy_state *cs)
1486{
1487 struct fuse_notify_poll_wakeup_out outarg;
1488 int err = -EINVAL;
1489
1490 if (size != sizeof(outarg))
1491 goto err;
1492
1493 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1494 if (err)
1495 goto err;
1496
1497 fuse_copy_finish(cs);
1498 return fuse_notify_poll_wakeup(fc, &outarg);
1499
1500err:
1501 fuse_copy_finish(cs);
1502 return err;
1503}
1504
1505static int fuse_notify_inval_inode(struct fuse_conn *fc, unsigned int size,
1506 struct fuse_copy_state *cs)
1507{
1508 struct fuse_notify_inval_inode_out outarg;
1509 int err = -EINVAL;
1510
1511 if (size != sizeof(outarg))
1512 goto err;
1513
1514 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1515 if (err)
1516 goto err;
1517 fuse_copy_finish(cs);
1518
1519 down_read(&fc->killsb);
1520 err = fuse_reverse_inval_inode(fc, outarg.ino,
1521 outarg.off, outarg.len);
1522 up_read(&fc->killsb);
1523 return err;
1524
1525err:
1526 fuse_copy_finish(cs);
1527 return err;
1528}
1529
1530static int fuse_notify_inval_entry(struct fuse_conn *fc, unsigned int size,
1531 struct fuse_copy_state *cs)
1532{
1533 struct fuse_notify_inval_entry_out outarg;
1534 int err = -ENOMEM;
1535 char *buf;
1536 struct qstr name;
1537
1538 buf = kzalloc(FUSE_NAME_MAX + 1, GFP_KERNEL);
1539 if (!buf)
1540 goto err;
1541
1542 err = -EINVAL;
1543 if (size < sizeof(outarg))
1544 goto err;
1545
1546 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1547 if (err)
1548 goto err;
1549
1550 err = -ENAMETOOLONG;
1551 if (outarg.namelen > FUSE_NAME_MAX)
1552 goto err;
1553
1554 err = -EINVAL;
1555 if (size != sizeof(outarg) + outarg.namelen + 1)
1556 goto err;
1557
1558 name.name = buf;
1559 name.len = outarg.namelen;
1560 err = fuse_copy_one(cs, buf, outarg.namelen + 1);
1561 if (err)
1562 goto err;
1563 fuse_copy_finish(cs);
1564 buf[outarg.namelen] = 0;
1565
1566 down_read(&fc->killsb);
1567 err = fuse_reverse_inval_entry(fc, outarg.parent, 0, &name, outarg.flags);
1568 up_read(&fc->killsb);
1569 kfree(buf);
1570 return err;
1571
1572err:
1573 kfree(buf);
1574 fuse_copy_finish(cs);
1575 return err;
1576}
1577
1578static int fuse_notify_delete(struct fuse_conn *fc, unsigned int size,
1579 struct fuse_copy_state *cs)
1580{
1581 struct fuse_notify_delete_out outarg;
1582 int err = -ENOMEM;
1583 char *buf;
1584 struct qstr name;
1585
1586 buf = kzalloc(FUSE_NAME_MAX + 1, GFP_KERNEL);
1587 if (!buf)
1588 goto err;
1589
1590 err = -EINVAL;
1591 if (size < sizeof(outarg))
1592 goto err;
1593
1594 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1595 if (err)
1596 goto err;
1597
1598 err = -ENAMETOOLONG;
1599 if (outarg.namelen > FUSE_NAME_MAX)
1600 goto err;
1601
1602 err = -EINVAL;
1603 if (size != sizeof(outarg) + outarg.namelen + 1)
1604 goto err;
1605
1606 name.name = buf;
1607 name.len = outarg.namelen;
1608 err = fuse_copy_one(cs, buf, outarg.namelen + 1);
1609 if (err)
1610 goto err;
1611 fuse_copy_finish(cs);
1612 buf[outarg.namelen] = 0;
1613
1614 down_read(&fc->killsb);
1615 err = fuse_reverse_inval_entry(fc, outarg.parent, outarg.child, &name, 0);
1616 up_read(&fc->killsb);
1617 kfree(buf);
1618 return err;
1619
1620err:
1621 kfree(buf);
1622 fuse_copy_finish(cs);
1623 return err;
1624}
1625
1626static int fuse_notify_store(struct fuse_conn *fc, unsigned int size,
1627 struct fuse_copy_state *cs)
1628{
1629 struct fuse_notify_store_out outarg;
1630 struct inode *inode;
1631 struct address_space *mapping;
1632 u64 nodeid;
1633 int err;
1634 pgoff_t index;
1635 unsigned int offset;
1636 unsigned int num;
1637 loff_t file_size;
1638 loff_t end;
1639
1640 err = -EINVAL;
1641 if (size < sizeof(outarg))
1642 goto out_finish;
1643
1644 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1645 if (err)
1646 goto out_finish;
1647
1648 err = -EINVAL;
1649 if (size - sizeof(outarg) != outarg.size)
1650 goto out_finish;
1651
1652 nodeid = outarg.nodeid;
1653
1654 down_read(&fc->killsb);
1655
1656 err = -ENOENT;
1657 inode = fuse_ilookup(fc, nodeid, NULL);
1658 if (!inode)
1659 goto out_up_killsb;
1660
1661 mapping = inode->i_mapping;
1662 index = outarg.offset >> PAGE_SHIFT;
1663 offset = outarg.offset & ~PAGE_MASK;
1664 file_size = i_size_read(inode);
1665 end = outarg.offset + outarg.size;
1666 if (end > file_size) {
1667 file_size = end;
1668 fuse_write_update_attr(inode, file_size, outarg.size);
1669 }
1670
1671 num = outarg.size;
1672 while (num) {
1673 struct folio *folio;
1674 struct page *page;
1675 unsigned int this_num;
1676
1677 folio = filemap_grab_folio(mapping, index);
1678 err = PTR_ERR(folio);
1679 if (IS_ERR(folio))
1680 goto out_iput;
1681
1682 page = &folio->page;
1683 this_num = min_t(unsigned, num, folio_size(folio) - offset);
1684 err = fuse_copy_page(cs, &page, offset, this_num, 0);
1685 if (!folio_test_uptodate(folio) && !err && offset == 0 &&
1686 (this_num == folio_size(folio) || file_size == end)) {
1687 folio_zero_segment(folio, this_num, folio_size(folio));
1688 folio_mark_uptodate(folio);
1689 }
1690 folio_unlock(folio);
1691 folio_put(folio);
1692
1693 if (err)
1694 goto out_iput;
1695
1696 num -= this_num;
1697 offset = 0;
1698 index++;
1699 }
1700
1701 err = 0;
1702
1703out_iput:
1704 iput(inode);
1705out_up_killsb:
1706 up_read(&fc->killsb);
1707out_finish:
1708 fuse_copy_finish(cs);
1709 return err;
1710}
1711
1712struct fuse_retrieve_args {
1713 struct fuse_args_pages ap;
1714 struct fuse_notify_retrieve_in inarg;
1715};
1716
1717static void fuse_retrieve_end(struct fuse_mount *fm, struct fuse_args *args,
1718 int error)
1719{
1720 struct fuse_retrieve_args *ra =
1721 container_of(args, typeof(*ra), ap.args);
1722
1723 release_pages(ra->ap.folios, ra->ap.num_folios);
1724 kfree(ra);
1725}
1726
1727static int fuse_retrieve(struct fuse_mount *fm, struct inode *inode,
1728 struct fuse_notify_retrieve_out *outarg)
1729{
1730 int err;
1731 struct address_space *mapping = inode->i_mapping;
1732 pgoff_t index;
1733 loff_t file_size;
1734 unsigned int num;
1735 unsigned int offset;
1736 size_t total_len = 0;
1737 unsigned int num_pages, cur_pages = 0;
1738 struct fuse_conn *fc = fm->fc;
1739 struct fuse_retrieve_args *ra;
1740 size_t args_size = sizeof(*ra);
1741 struct fuse_args_pages *ap;
1742 struct fuse_args *args;
1743
1744 offset = outarg->offset & ~PAGE_MASK;
1745 file_size = i_size_read(inode);
1746
1747 num = min(outarg->size, fc->max_write);
1748 if (outarg->offset > file_size)
1749 num = 0;
1750 else if (outarg->offset + num > file_size)
1751 num = file_size - outarg->offset;
1752
1753 num_pages = (num + offset + PAGE_SIZE - 1) >> PAGE_SHIFT;
1754 num_pages = min(num_pages, fc->max_pages);
1755
1756 args_size += num_pages * (sizeof(ap->folios[0]) + sizeof(ap->descs[0]));
1757
1758 ra = kzalloc(args_size, GFP_KERNEL);
1759 if (!ra)
1760 return -ENOMEM;
1761
1762 ap = &ra->ap;
1763 ap->folios = (void *) (ra + 1);
1764 ap->descs = (void *) (ap->folios + num_pages);
1765
1766 args = &ap->args;
1767 args->nodeid = outarg->nodeid;
1768 args->opcode = FUSE_NOTIFY_REPLY;
1769 args->in_numargs = 2;
1770 args->in_pages = true;
1771 args->end = fuse_retrieve_end;
1772
1773 index = outarg->offset >> PAGE_SHIFT;
1774
1775 while (num && cur_pages < num_pages) {
1776 struct folio *folio;
1777 unsigned int this_num;
1778
1779 folio = filemap_get_folio(mapping, index);
1780 if (IS_ERR(folio))
1781 break;
1782
1783 this_num = min_t(unsigned, num, PAGE_SIZE - offset);
1784 ap->folios[ap->num_folios] = folio;
1785 ap->descs[ap->num_folios].offset = offset;
1786 ap->descs[ap->num_folios].length = this_num;
1787 ap->num_folios++;
1788 cur_pages++;
1789
1790 offset = 0;
1791 num -= this_num;
1792 total_len += this_num;
1793 index++;
1794 }
1795 ra->inarg.offset = outarg->offset;
1796 ra->inarg.size = total_len;
1797 args->in_args[0].size = sizeof(ra->inarg);
1798 args->in_args[0].value = &ra->inarg;
1799 args->in_args[1].size = total_len;
1800
1801 err = fuse_simple_notify_reply(fm, args, outarg->notify_unique);
1802 if (err)
1803 fuse_retrieve_end(fm, args, err);
1804
1805 return err;
1806}
1807
1808static int fuse_notify_retrieve(struct fuse_conn *fc, unsigned int size,
1809 struct fuse_copy_state *cs)
1810{
1811 struct fuse_notify_retrieve_out outarg;
1812 struct fuse_mount *fm;
1813 struct inode *inode;
1814 u64 nodeid;
1815 int err;
1816
1817 err = -EINVAL;
1818 if (size != sizeof(outarg))
1819 goto copy_finish;
1820
1821 err = fuse_copy_one(cs, &outarg, sizeof(outarg));
1822 if (err)
1823 goto copy_finish;
1824
1825 fuse_copy_finish(cs);
1826
1827 down_read(&fc->killsb);
1828 err = -ENOENT;
1829 nodeid = outarg.nodeid;
1830
1831 inode = fuse_ilookup(fc, nodeid, &fm);
1832 if (inode) {
1833 err = fuse_retrieve(fm, inode, &outarg);
1834 iput(inode);
1835 }
1836 up_read(&fc->killsb);
1837
1838 return err;
1839
1840copy_finish:
1841 fuse_copy_finish(cs);
1842 return err;
1843}
1844
1845/*
1846 * Resending all processing queue requests.
1847 *
1848 * During a FUSE daemon panics and failover, it is possible for some inflight
1849 * requests to be lost and never returned. As a result, applications awaiting
1850 * replies would become stuck forever. To address this, we can use notification
1851 * to trigger resending of these pending requests to the FUSE daemon, ensuring
1852 * they are properly processed again.
1853 *
1854 * Please note that this strategy is applicable only to idempotent requests or
1855 * if the FUSE daemon takes careful measures to avoid processing duplicated
1856 * non-idempotent requests.
1857 */
1858static void fuse_resend(struct fuse_conn *fc)
1859{
1860 struct fuse_dev *fud;
1861 struct fuse_req *req, *next;
1862 struct fuse_iqueue *fiq = &fc->iq;
1863 LIST_HEAD(to_queue);
1864 unsigned int i;
1865
1866 spin_lock(&fc->lock);
1867 if (!fc->connected) {
1868 spin_unlock(&fc->lock);
1869 return;
1870 }
1871
1872 list_for_each_entry(fud, &fc->devices, entry) {
1873 struct fuse_pqueue *fpq = &fud->pq;
1874
1875 spin_lock(&fpq->lock);
1876 for (i = 0; i < FUSE_PQ_HASH_SIZE; i++)
1877 list_splice_tail_init(&fpq->processing[i], &to_queue);
1878 spin_unlock(&fpq->lock);
1879 }
1880 spin_unlock(&fc->lock);
1881
1882 list_for_each_entry_safe(req, next, &to_queue, list) {
1883 set_bit(FR_PENDING, &req->flags);
1884 clear_bit(FR_SENT, &req->flags);
1885 /* mark the request as resend request */
1886 req->in.h.unique |= FUSE_UNIQUE_RESEND;
1887 }
1888
1889 spin_lock(&fiq->lock);
1890 if (!fiq->connected) {
1891 spin_unlock(&fiq->lock);
1892 list_for_each_entry(req, &to_queue, list)
1893 clear_bit(FR_PENDING, &req->flags);
1894 end_requests(&to_queue);
1895 return;
1896 }
1897 /* iq and pq requests are both oldest to newest */
1898 list_splice(&to_queue, &fiq->pending);
1899 fuse_dev_wake_and_unlock(fiq);
1900}
1901
1902static int fuse_notify_resend(struct fuse_conn *fc)
1903{
1904 fuse_resend(fc);
1905 return 0;
1906}
1907
1908static int fuse_notify(struct fuse_conn *fc, enum fuse_notify_code code,
1909 unsigned int size, struct fuse_copy_state *cs)
1910{
1911 /* Don't try to move pages (yet) */
1912 cs->move_pages = 0;
1913
1914 switch (code) {
1915 case FUSE_NOTIFY_POLL:
1916 return fuse_notify_poll(fc, size, cs);
1917
1918 case FUSE_NOTIFY_INVAL_INODE:
1919 return fuse_notify_inval_inode(fc, size, cs);
1920
1921 case FUSE_NOTIFY_INVAL_ENTRY:
1922 return fuse_notify_inval_entry(fc, size, cs);
1923
1924 case FUSE_NOTIFY_STORE:
1925 return fuse_notify_store(fc, size, cs);
1926
1927 case FUSE_NOTIFY_RETRIEVE:
1928 return fuse_notify_retrieve(fc, size, cs);
1929
1930 case FUSE_NOTIFY_DELETE:
1931 return fuse_notify_delete(fc, size, cs);
1932
1933 case FUSE_NOTIFY_RESEND:
1934 return fuse_notify_resend(fc);
1935
1936 default:
1937 fuse_copy_finish(cs);
1938 return -EINVAL;
1939 }
1940}
1941
1942/* Look up request on processing list by unique ID */
1943static struct fuse_req *request_find(struct fuse_pqueue *fpq, u64 unique)
1944{
1945 unsigned int hash = fuse_req_hash(unique);
1946 struct fuse_req *req;
1947
1948 list_for_each_entry(req, &fpq->processing[hash], list) {
1949 if (req->in.h.unique == unique)
1950 return req;
1951 }
1952 return NULL;
1953}
1954
1955static int copy_out_args(struct fuse_copy_state *cs, struct fuse_args *args,
1956 unsigned nbytes)
1957{
1958 unsigned reqsize = sizeof(struct fuse_out_header);
1959
1960 reqsize += fuse_len_args(args->out_numargs, args->out_args);
1961
1962 if (reqsize < nbytes || (reqsize > nbytes && !args->out_argvar))
1963 return -EINVAL;
1964 else if (reqsize > nbytes) {
1965 struct fuse_arg *lastarg = &args->out_args[args->out_numargs-1];
1966 unsigned diffsize = reqsize - nbytes;
1967
1968 if (diffsize > lastarg->size)
1969 return -EINVAL;
1970 lastarg->size -= diffsize;
1971 }
1972 return fuse_copy_args(cs, args->out_numargs, args->out_pages,
1973 args->out_args, args->page_zeroing);
1974}
1975
1976/*
1977 * Write a single reply to a request. First the header is copied from
1978 * the write buffer. The request is then searched on the processing
1979 * list by the unique ID found in the header. If found, then remove
1980 * it from the list and copy the rest of the buffer to the request.
1981 * The request is finished by calling fuse_request_end().
1982 */
1983static ssize_t fuse_dev_do_write(struct fuse_dev *fud,
1984 struct fuse_copy_state *cs, size_t nbytes)
1985{
1986 int err;
1987 struct fuse_conn *fc = fud->fc;
1988 struct fuse_pqueue *fpq = &fud->pq;
1989 struct fuse_req *req;
1990 struct fuse_out_header oh;
1991
1992 err = -EINVAL;
1993 if (nbytes < sizeof(struct fuse_out_header))
1994 goto out;
1995
1996 err = fuse_copy_one(cs, &oh, sizeof(oh));
1997 if (err)
1998 goto copy_finish;
1999
2000 err = -EINVAL;
2001 if (oh.len != nbytes)
2002 goto copy_finish;
2003
2004 /*
2005 * Zero oh.unique indicates unsolicited notification message
2006 * and error contains notification code.
2007 */
2008 if (!oh.unique) {
2009 err = fuse_notify(fc, oh.error, nbytes - sizeof(oh), cs);
2010 goto out;
2011 }
2012
2013 err = -EINVAL;
2014 if (oh.error <= -512 || oh.error > 0)
2015 goto copy_finish;
2016
2017 spin_lock(&fpq->lock);
2018 req = NULL;
2019 if (fpq->connected)
2020 req = request_find(fpq, oh.unique & ~FUSE_INT_REQ_BIT);
2021
2022 err = -ENOENT;
2023 if (!req) {
2024 spin_unlock(&fpq->lock);
2025 goto copy_finish;
2026 }
2027
2028 /* Is it an interrupt reply ID? */
2029 if (oh.unique & FUSE_INT_REQ_BIT) {
2030 __fuse_get_request(req);
2031 spin_unlock(&fpq->lock);
2032
2033 err = 0;
2034 if (nbytes != sizeof(struct fuse_out_header))
2035 err = -EINVAL;
2036 else if (oh.error == -ENOSYS)
2037 fc->no_interrupt = 1;
2038 else if (oh.error == -EAGAIN)
2039 err = queue_interrupt(req);
2040
2041 fuse_put_request(req);
2042
2043 goto copy_finish;
2044 }
2045
2046 clear_bit(FR_SENT, &req->flags);
2047 list_move(&req->list, &fpq->io);
2048 req->out.h = oh;
2049 set_bit(FR_LOCKED, &req->flags);
2050 spin_unlock(&fpq->lock);
2051 cs->req = req;
2052 if (!req->args->page_replace)
2053 cs->move_pages = 0;
2054
2055 if (oh.error)
2056 err = nbytes != sizeof(oh) ? -EINVAL : 0;
2057 else
2058 err = copy_out_args(cs, req->args, nbytes);
2059 fuse_copy_finish(cs);
2060
2061 spin_lock(&fpq->lock);
2062 clear_bit(FR_LOCKED, &req->flags);
2063 if (!fpq->connected)
2064 err = -ENOENT;
2065 else if (err)
2066 req->out.h.error = -EIO;
2067 if (!test_bit(FR_PRIVATE, &req->flags))
2068 list_del_init(&req->list);
2069 spin_unlock(&fpq->lock);
2070
2071 fuse_request_end(req);
2072out:
2073 return err ? err : nbytes;
2074
2075copy_finish:
2076 fuse_copy_finish(cs);
2077 goto out;
2078}
2079
2080static ssize_t fuse_dev_write(struct kiocb *iocb, struct iov_iter *from)
2081{
2082 struct fuse_copy_state cs;
2083 struct fuse_dev *fud = fuse_get_dev(iocb->ki_filp);
2084
2085 if (!fud)
2086 return -EPERM;
2087
2088 if (!user_backed_iter(from))
2089 return -EINVAL;
2090
2091 fuse_copy_init(&cs, 0, from);
2092
2093 return fuse_dev_do_write(fud, &cs, iov_iter_count(from));
2094}
2095
2096static ssize_t fuse_dev_splice_write(struct pipe_inode_info *pipe,
2097 struct file *out, loff_t *ppos,
2098 size_t len, unsigned int flags)
2099{
2100 unsigned int head, tail, mask, count;
2101 unsigned nbuf;
2102 unsigned idx;
2103 struct pipe_buffer *bufs;
2104 struct fuse_copy_state cs;
2105 struct fuse_dev *fud;
2106 size_t rem;
2107 ssize_t ret;
2108
2109 fud = fuse_get_dev(out);
2110 if (!fud)
2111 return -EPERM;
2112
2113 pipe_lock(pipe);
2114
2115 head = pipe->head;
2116 tail = pipe->tail;
2117 mask = pipe->ring_size - 1;
2118 count = head - tail;
2119
2120 bufs = kvmalloc_array(count, sizeof(struct pipe_buffer), GFP_KERNEL);
2121 if (!bufs) {
2122 pipe_unlock(pipe);
2123 return -ENOMEM;
2124 }
2125
2126 nbuf = 0;
2127 rem = 0;
2128 for (idx = tail; idx != head && rem < len; idx++)
2129 rem += pipe->bufs[idx & mask].len;
2130
2131 ret = -EINVAL;
2132 if (rem < len)
2133 goto out_free;
2134
2135 rem = len;
2136 while (rem) {
2137 struct pipe_buffer *ibuf;
2138 struct pipe_buffer *obuf;
2139
2140 if (WARN_ON(nbuf >= count || tail == head))
2141 goto out_free;
2142
2143 ibuf = &pipe->bufs[tail & mask];
2144 obuf = &bufs[nbuf];
2145
2146 if (rem >= ibuf->len) {
2147 *obuf = *ibuf;
2148 ibuf->ops = NULL;
2149 tail++;
2150 pipe->tail = tail;
2151 } else {
2152 if (!pipe_buf_get(pipe, ibuf))
2153 goto out_free;
2154
2155 *obuf = *ibuf;
2156 obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
2157 obuf->len = rem;
2158 ibuf->offset += obuf->len;
2159 ibuf->len -= obuf->len;
2160 }
2161 nbuf++;
2162 rem -= obuf->len;
2163 }
2164 pipe_unlock(pipe);
2165
2166 fuse_copy_init(&cs, 0, NULL);
2167 cs.pipebufs = bufs;
2168 cs.nr_segs = nbuf;
2169 cs.pipe = pipe;
2170
2171 if (flags & SPLICE_F_MOVE)
2172 cs.move_pages = 1;
2173
2174 ret = fuse_dev_do_write(fud, &cs, len);
2175
2176 pipe_lock(pipe);
2177out_free:
2178 for (idx = 0; idx < nbuf; idx++) {
2179 struct pipe_buffer *buf = &bufs[idx];
2180
2181 if (buf->ops)
2182 pipe_buf_release(pipe, buf);
2183 }
2184 pipe_unlock(pipe);
2185
2186 kvfree(bufs);
2187 return ret;
2188}
2189
2190static __poll_t fuse_dev_poll(struct file *file, poll_table *wait)
2191{
2192 __poll_t mask = EPOLLOUT | EPOLLWRNORM;
2193 struct fuse_iqueue *fiq;
2194 struct fuse_dev *fud = fuse_get_dev(file);
2195
2196 if (!fud)
2197 return EPOLLERR;
2198
2199 fiq = &fud->fc->iq;
2200 poll_wait(file, &fiq->waitq, wait);
2201
2202 spin_lock(&fiq->lock);
2203 if (!fiq->connected)
2204 mask = EPOLLERR;
2205 else if (request_pending(fiq))
2206 mask |= EPOLLIN | EPOLLRDNORM;
2207 spin_unlock(&fiq->lock);
2208
2209 return mask;
2210}
2211
2212/* Abort all requests on the given list (pending or processing) */
2213static void end_requests(struct list_head *head)
2214{
2215 while (!list_empty(head)) {
2216 struct fuse_req *req;
2217 req = list_entry(head->next, struct fuse_req, list);
2218 req->out.h.error = -ECONNABORTED;
2219 clear_bit(FR_SENT, &req->flags);
2220 list_del_init(&req->list);
2221 fuse_request_end(req);
2222 }
2223}
2224
2225static void end_polls(struct fuse_conn *fc)
2226{
2227 struct rb_node *p;
2228
2229 p = rb_first(&fc->polled_files);
2230
2231 while (p) {
2232 struct fuse_file *ff;
2233 ff = rb_entry(p, struct fuse_file, polled_node);
2234 wake_up_interruptible_all(&ff->poll_wait);
2235
2236 p = rb_next(p);
2237 }
2238}
2239
2240/*
2241 * Abort all requests.
2242 *
2243 * Emergency exit in case of a malicious or accidental deadlock, or just a hung
2244 * filesystem.
2245 *
2246 * The same effect is usually achievable through killing the filesystem daemon
2247 * and all users of the filesystem. The exception is the combination of an
2248 * asynchronous request and the tricky deadlock (see
2249 * Documentation/filesystems/fuse.rst).
2250 *
2251 * Aborting requests under I/O goes as follows: 1: Separate out unlocked
2252 * requests, they should be finished off immediately. Locked requests will be
2253 * finished after unlock; see unlock_request(). 2: Finish off the unlocked
2254 * requests. It is possible that some request will finish before we can. This
2255 * is OK, the request will in that case be removed from the list before we touch
2256 * it.
2257 */
2258void fuse_abort_conn(struct fuse_conn *fc)
2259{
2260 struct fuse_iqueue *fiq = &fc->iq;
2261
2262 spin_lock(&fc->lock);
2263 if (fc->connected) {
2264 struct fuse_dev *fud;
2265 struct fuse_req *req, *next;
2266 LIST_HEAD(to_end);
2267 unsigned int i;
2268
2269 /* Background queuing checks fc->connected under bg_lock */
2270 spin_lock(&fc->bg_lock);
2271 fc->connected = 0;
2272 spin_unlock(&fc->bg_lock);
2273
2274 fuse_set_initialized(fc);
2275 list_for_each_entry(fud, &fc->devices, entry) {
2276 struct fuse_pqueue *fpq = &fud->pq;
2277
2278 spin_lock(&fpq->lock);
2279 fpq->connected = 0;
2280 list_for_each_entry_safe(req, next, &fpq->io, list) {
2281 req->out.h.error = -ECONNABORTED;
2282 spin_lock(&req->waitq.lock);
2283 set_bit(FR_ABORTED, &req->flags);
2284 if (!test_bit(FR_LOCKED, &req->flags)) {
2285 set_bit(FR_PRIVATE, &req->flags);
2286 __fuse_get_request(req);
2287 list_move(&req->list, &to_end);
2288 }
2289 spin_unlock(&req->waitq.lock);
2290 }
2291 for (i = 0; i < FUSE_PQ_HASH_SIZE; i++)
2292 list_splice_tail_init(&fpq->processing[i],
2293 &to_end);
2294 spin_unlock(&fpq->lock);
2295 }
2296 spin_lock(&fc->bg_lock);
2297 fc->blocked = 0;
2298 fc->max_background = UINT_MAX;
2299 flush_bg_queue(fc);
2300 spin_unlock(&fc->bg_lock);
2301
2302 spin_lock(&fiq->lock);
2303 fiq->connected = 0;
2304 list_for_each_entry(req, &fiq->pending, list)
2305 clear_bit(FR_PENDING, &req->flags);
2306 list_splice_tail_init(&fiq->pending, &to_end);
2307 while (forget_pending(fiq))
2308 kfree(fuse_dequeue_forget(fiq, 1, NULL));
2309 wake_up_all(&fiq->waitq);
2310 spin_unlock(&fiq->lock);
2311 kill_fasync(&fiq->fasync, SIGIO, POLL_IN);
2312 end_polls(fc);
2313 wake_up_all(&fc->blocked_waitq);
2314 spin_unlock(&fc->lock);
2315
2316 end_requests(&to_end);
2317 } else {
2318 spin_unlock(&fc->lock);
2319 }
2320}
2321EXPORT_SYMBOL_GPL(fuse_abort_conn);
2322
2323void fuse_wait_aborted(struct fuse_conn *fc)
2324{
2325 /* matches implicit memory barrier in fuse_drop_waiting() */
2326 smp_mb();
2327 wait_event(fc->blocked_waitq, atomic_read(&fc->num_waiting) == 0);
2328}
2329
2330int fuse_dev_release(struct inode *inode, struct file *file)
2331{
2332 struct fuse_dev *fud = fuse_get_dev(file);
2333
2334 if (fud) {
2335 struct fuse_conn *fc = fud->fc;
2336 struct fuse_pqueue *fpq = &fud->pq;
2337 LIST_HEAD(to_end);
2338 unsigned int i;
2339
2340 spin_lock(&fpq->lock);
2341 WARN_ON(!list_empty(&fpq->io));
2342 for (i = 0; i < FUSE_PQ_HASH_SIZE; i++)
2343 list_splice_init(&fpq->processing[i], &to_end);
2344 spin_unlock(&fpq->lock);
2345
2346 end_requests(&to_end);
2347
2348 /* Are we the last open device? */
2349 if (atomic_dec_and_test(&fc->dev_count)) {
2350 WARN_ON(fc->iq.fasync != NULL);
2351 fuse_abort_conn(fc);
2352 }
2353 fuse_dev_free(fud);
2354 }
2355 return 0;
2356}
2357EXPORT_SYMBOL_GPL(fuse_dev_release);
2358
2359static int fuse_dev_fasync(int fd, struct file *file, int on)
2360{
2361 struct fuse_dev *fud = fuse_get_dev(file);
2362
2363 if (!fud)
2364 return -EPERM;
2365
2366 /* No locking - fasync_helper does its own locking */
2367 return fasync_helper(fd, file, on, &fud->fc->iq.fasync);
2368}
2369
2370static int fuse_device_clone(struct fuse_conn *fc, struct file *new)
2371{
2372 struct fuse_dev *fud;
2373
2374 if (new->private_data)
2375 return -EINVAL;
2376
2377 fud = fuse_dev_alloc_install(fc);
2378 if (!fud)
2379 return -ENOMEM;
2380
2381 new->private_data = fud;
2382 atomic_inc(&fc->dev_count);
2383
2384 return 0;
2385}
2386
2387static long fuse_dev_ioctl_clone(struct file *file, __u32 __user *argp)
2388{
2389 int res;
2390 int oldfd;
2391 struct fuse_dev *fud = NULL;
2392
2393 if (get_user(oldfd, argp))
2394 return -EFAULT;
2395
2396 CLASS(fd, f)(oldfd);
2397 if (fd_empty(f))
2398 return -EINVAL;
2399
2400 /*
2401 * Check against file->f_op because CUSE
2402 * uses the same ioctl handler.
2403 */
2404 if (fd_file(f)->f_op == file->f_op)
2405 fud = fuse_get_dev(fd_file(f));
2406
2407 res = -EINVAL;
2408 if (fud) {
2409 mutex_lock(&fuse_mutex);
2410 res = fuse_device_clone(fud->fc, file);
2411 mutex_unlock(&fuse_mutex);
2412 }
2413
2414 return res;
2415}
2416
2417static long fuse_dev_ioctl_backing_open(struct file *file,
2418 struct fuse_backing_map __user *argp)
2419{
2420 struct fuse_dev *fud = fuse_get_dev(file);
2421 struct fuse_backing_map map;
2422
2423 if (!fud)
2424 return -EPERM;
2425
2426 if (!IS_ENABLED(CONFIG_FUSE_PASSTHROUGH))
2427 return -EOPNOTSUPP;
2428
2429 if (copy_from_user(&map, argp, sizeof(map)))
2430 return -EFAULT;
2431
2432 return fuse_backing_open(fud->fc, &map);
2433}
2434
2435static long fuse_dev_ioctl_backing_close(struct file *file, __u32 __user *argp)
2436{
2437 struct fuse_dev *fud = fuse_get_dev(file);
2438 int backing_id;
2439
2440 if (!fud)
2441 return -EPERM;
2442
2443 if (!IS_ENABLED(CONFIG_FUSE_PASSTHROUGH))
2444 return -EOPNOTSUPP;
2445
2446 if (get_user(backing_id, argp))
2447 return -EFAULT;
2448
2449 return fuse_backing_close(fud->fc, backing_id);
2450}
2451
2452static long fuse_dev_ioctl(struct file *file, unsigned int cmd,
2453 unsigned long arg)
2454{
2455 void __user *argp = (void __user *)arg;
2456
2457 switch (cmd) {
2458 case FUSE_DEV_IOC_CLONE:
2459 return fuse_dev_ioctl_clone(file, argp);
2460
2461 case FUSE_DEV_IOC_BACKING_OPEN:
2462 return fuse_dev_ioctl_backing_open(file, argp);
2463
2464 case FUSE_DEV_IOC_BACKING_CLOSE:
2465 return fuse_dev_ioctl_backing_close(file, argp);
2466
2467 default:
2468 return -ENOTTY;
2469 }
2470}
2471
2472const struct file_operations fuse_dev_operations = {
2473 .owner = THIS_MODULE,
2474 .open = fuse_dev_open,
2475 .read_iter = fuse_dev_read,
2476 .splice_read = fuse_dev_splice_read,
2477 .write_iter = fuse_dev_write,
2478 .splice_write = fuse_dev_splice_write,
2479 .poll = fuse_dev_poll,
2480 .release = fuse_dev_release,
2481 .fasync = fuse_dev_fasync,
2482 .unlocked_ioctl = fuse_dev_ioctl,
2483 .compat_ioctl = compat_ptr_ioctl,
2484};
2485EXPORT_SYMBOL_GPL(fuse_dev_operations);
2486
2487static struct miscdevice fuse_miscdevice = {
2488 .minor = FUSE_MINOR,
2489 .name = "fuse",
2490 .fops = &fuse_dev_operations,
2491};
2492
2493int __init fuse_dev_init(void)
2494{
2495 int err = -ENOMEM;
2496 fuse_req_cachep = kmem_cache_create("fuse_request",
2497 sizeof(struct fuse_req),
2498 0, 0, NULL);
2499 if (!fuse_req_cachep)
2500 goto out;
2501
2502 err = misc_register(&fuse_miscdevice);
2503 if (err)
2504 goto out_cache_clean;
2505
2506 return 0;
2507
2508 out_cache_clean:
2509 kmem_cache_destroy(fuse_req_cachep);
2510 out:
2511 return err;
2512}
2513
2514void fuse_dev_cleanup(void)
2515{
2516 misc_deregister(&fuse_miscdevice);
2517 kmem_cache_destroy(fuse_req_cachep);
2518}