Linux Audio

Check our new training course

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