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