dev.c 49 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217
  1. /*
  2. FUSE: Filesystem in Userspace
  3. Copyright (C) 2001-2008 Miklos Szeredi <miklos@szeredi.hu>
  4. This program can be distributed under the terms of the GNU GPL.
  5. See the file COPYING.
  6. */
  7. #include "fuse_i.h"
  8. #include <linux/init.h>
  9. #include <linux/module.h>
  10. #include <linux/poll.h>
  11. #include <linux/uio.h>
  12. #include <linux/miscdevice.h>
  13. #include <linux/pagemap.h>
  14. #include <linux/file.h>
  15. #include <linux/slab.h>
  16. #include <linux/pipe_fs_i.h>
  17. #include <linux/swap.h>
  18. #include <linux/splice.h>
  19. #include <linux/aio.h>
  20. MODULE_ALIAS_MISCDEV(FUSE_MINOR);
  21. MODULE_ALIAS("devname:fuse");
  22. static struct kmem_cache *fuse_req_cachep;
  23. static struct fuse_conn *fuse_get_conn(struct file *file)
  24. {
  25. /*
  26. * Lockless access is OK, because file->private data is set
  27. * once during mount and is valid until the file is released.
  28. */
  29. return file->private_data;
  30. }
  31. static void fuse_request_init(struct fuse_req *req, struct page **pages,
  32. struct fuse_page_desc *page_descs,
  33. unsigned npages)
  34. {
  35. memset(req, 0, sizeof(*req));
  36. memset(pages, 0, sizeof(*pages) * npages);
  37. memset(page_descs, 0, sizeof(*page_descs) * npages);
  38. INIT_LIST_HEAD(&req->list);
  39. INIT_LIST_HEAD(&req->intr_entry);
  40. init_waitqueue_head(&req->waitq);
  41. atomic_set(&req->count, 1);
  42. req->pages = pages;
  43. req->page_descs = page_descs;
  44. req->max_pages = npages;
  45. }
  46. static struct fuse_req *__fuse_request_alloc(unsigned npages, gfp_t flags)
  47. {
  48. struct fuse_req *req = kmem_cache_alloc(fuse_req_cachep, flags);
  49. if (req) {
  50. struct page **pages;
  51. struct fuse_page_desc *page_descs;
  52. if (npages <= FUSE_REQ_INLINE_PAGES) {
  53. pages = req->inline_pages;
  54. page_descs = req->inline_page_descs;
  55. } else {
  56. pages = kmalloc(sizeof(struct page *) * npages, flags);
  57. page_descs = kmalloc(sizeof(struct fuse_page_desc) *
  58. npages, flags);
  59. }
  60. if (!pages || !page_descs) {
  61. kfree(pages);
  62. kfree(page_descs);
  63. kmem_cache_free(fuse_req_cachep, req);
  64. return NULL;
  65. }
  66. fuse_request_init(req, pages, page_descs, npages);
  67. }
  68. return req;
  69. }
  70. struct fuse_req *fuse_request_alloc(unsigned npages)
  71. {
  72. return __fuse_request_alloc(npages, GFP_KERNEL);
  73. }
  74. EXPORT_SYMBOL_GPL(fuse_request_alloc);
  75. struct fuse_req *fuse_request_alloc_nofs(unsigned npages)
  76. {
  77. return __fuse_request_alloc(npages, GFP_NOFS);
  78. }
  79. void fuse_request_free(struct fuse_req *req)
  80. {
  81. if (req->pages != req->inline_pages) {
  82. kfree(req->pages);
  83. kfree(req->page_descs);
  84. }
  85. kmem_cache_free(fuse_req_cachep, req);
  86. }
  87. static void block_sigs(sigset_t *oldset)
  88. {
  89. sigset_t mask;
  90. siginitsetinv(&mask, sigmask(SIGKILL));
  91. sigprocmask(SIG_BLOCK, &mask, oldset);
  92. }
  93. static void restore_sigs(sigset_t *oldset)
  94. {
  95. sigprocmask(SIG_SETMASK, oldset, NULL);
  96. }
  97. void __fuse_get_request(struct fuse_req *req)
  98. {
  99. atomic_inc(&req->count);
  100. }
  101. /* Must be called with > 1 refcount */
  102. static void __fuse_put_request(struct fuse_req *req)
  103. {
  104. BUG_ON(atomic_read(&req->count) < 2);
  105. atomic_dec(&req->count);
  106. }
  107. static void fuse_req_init_context(struct fuse_req *req)
  108. {
  109. req->in.h.uid = from_kuid_munged(&init_user_ns, current_fsuid());
  110. req->in.h.gid = from_kgid_munged(&init_user_ns, current_fsgid());
  111. req->in.h.pid = current->pid;
  112. }
  113. static bool fuse_block_alloc(struct fuse_conn *fc, bool for_background)
  114. {
  115. return !fc->initialized || (for_background && fc->blocked);
  116. }
  117. static struct fuse_req *__fuse_get_req(struct fuse_conn *fc, unsigned npages,
  118. bool for_background)
  119. {
  120. struct fuse_req *req;
  121. int err;
  122. atomic_inc(&fc->num_waiting);
  123. if (fuse_block_alloc(fc, for_background)) {
  124. sigset_t oldset;
  125. int intr;
  126. block_sigs(&oldset);
  127. intr = wait_event_interruptible_exclusive(fc->blocked_waitq,
  128. !fuse_block_alloc(fc, for_background));
  129. restore_sigs(&oldset);
  130. err = -EINTR;
  131. if (intr)
  132. goto out;
  133. }
  134. err = -ENOTCONN;
  135. if (!fc->connected)
  136. goto out;
  137. req = fuse_request_alloc(npages);
  138. err = -ENOMEM;
  139. if (!req) {
  140. if (for_background)
  141. wake_up(&fc->blocked_waitq);
  142. goto out;
  143. }
  144. fuse_req_init_context(req);
  145. req->waiting = 1;
  146. req->background = for_background;
  147. return req;
  148. out:
  149. atomic_dec(&fc->num_waiting);
  150. return ERR_PTR(err);
  151. }
  152. struct fuse_req *fuse_get_req(struct fuse_conn *fc, unsigned npages)
  153. {
  154. return __fuse_get_req(fc, npages, false);
  155. }
  156. EXPORT_SYMBOL_GPL(fuse_get_req);
  157. struct fuse_req *fuse_get_req_for_background(struct fuse_conn *fc,
  158. unsigned npages)
  159. {
  160. return __fuse_get_req(fc, npages, true);
  161. }
  162. EXPORT_SYMBOL_GPL(fuse_get_req_for_background);
  163. /*
  164. * Return request in fuse_file->reserved_req. However that may
  165. * currently be in use. If that is the case, wait for it to become
  166. * available.
  167. */
  168. static struct fuse_req *get_reserved_req(struct fuse_conn *fc,
  169. struct file *file)
  170. {
  171. struct fuse_req *req = NULL;
  172. struct fuse_file *ff = file->private_data;
  173. do {
  174. wait_event(fc->reserved_req_waitq, ff->reserved_req);
  175. spin_lock(&fc->lock);
  176. if (ff->reserved_req) {
  177. req = ff->reserved_req;
  178. ff->reserved_req = NULL;
  179. req->stolen_file = get_file(file);
  180. }
  181. spin_unlock(&fc->lock);
  182. } while (!req);
  183. return req;
  184. }
  185. /*
  186. * Put stolen request back into fuse_file->reserved_req
  187. */
  188. static void put_reserved_req(struct fuse_conn *fc, struct fuse_req *req)
  189. {
  190. struct file *file = req->stolen_file;
  191. struct fuse_file *ff = file->private_data;
  192. spin_lock(&fc->lock);
  193. fuse_request_init(req, req->pages, req->page_descs, req->max_pages);
  194. BUG_ON(ff->reserved_req);
  195. ff->reserved_req = req;
  196. wake_up_all(&fc->reserved_req_waitq);
  197. spin_unlock(&fc->lock);
  198. fput(file);
  199. }
  200. /*
  201. * Gets a requests for a file operation, always succeeds
  202. *
  203. * This is used for sending the FLUSH request, which must get to
  204. * userspace, due to POSIX locks which may need to be unlocked.
  205. *
  206. * If allocation fails due to OOM, use the reserved request in
  207. * fuse_file.
  208. *
  209. * This is very unlikely to deadlock accidentally, since the
  210. * filesystem should not have it's own file open. If deadlock is
  211. * intentional, it can still be broken by "aborting" the filesystem.
  212. */
  213. struct fuse_req *fuse_get_req_nofail_nopages(struct fuse_conn *fc,
  214. struct file *file)
  215. {
  216. struct fuse_req *req;
  217. atomic_inc(&fc->num_waiting);
  218. wait_event(fc->blocked_waitq, fc->initialized);
  219. req = fuse_request_alloc(0);
  220. if (!req)
  221. req = get_reserved_req(fc, file);
  222. fuse_req_init_context(req);
  223. req->waiting = 1;
  224. req->background = 0;
  225. return req;
  226. }
  227. void fuse_put_request(struct fuse_conn *fc, struct fuse_req *req)
  228. {
  229. if (atomic_dec_and_test(&req->count)) {
  230. if (unlikely(req->background)) {
  231. /*
  232. * We get here in the unlikely case that a background
  233. * request was allocated but not sent
  234. */
  235. spin_lock(&fc->lock);
  236. if (!fc->blocked)
  237. wake_up(&fc->blocked_waitq);
  238. spin_unlock(&fc->lock);
  239. }
  240. if (req->waiting)
  241. atomic_dec(&fc->num_waiting);
  242. if (req->stolen_file)
  243. put_reserved_req(fc, req);
  244. else
  245. fuse_request_free(req);
  246. }
  247. }
  248. EXPORT_SYMBOL_GPL(fuse_put_request);
  249. static unsigned len_args(unsigned numargs, struct fuse_arg *args)
  250. {
  251. unsigned nbytes = 0;
  252. unsigned i;
  253. for (i = 0; i < numargs; i++)
  254. nbytes += args[i].size;
  255. return nbytes;
  256. }
  257. static u64 fuse_get_unique(struct fuse_conn *fc)
  258. {
  259. fc->reqctr++;
  260. /* zero is special */
  261. if (fc->reqctr == 0)
  262. fc->reqctr = 1;
  263. return fc->reqctr;
  264. }
  265. static void queue_request(struct fuse_conn *fc, struct fuse_req *req)
  266. {
  267. req->in.h.len = sizeof(struct fuse_in_header) +
  268. len_args(req->in.numargs, (struct fuse_arg *) req->in.args);
  269. list_add_tail(&req->list, &fc->pending);
  270. req->state = FUSE_REQ_PENDING;
  271. if (!req->waiting) {
  272. req->waiting = 1;
  273. atomic_inc(&fc->num_waiting);
  274. }
  275. wake_up(&fc->waitq);
  276. kill_fasync(&fc->fasync, SIGIO, POLL_IN);
  277. }
  278. void fuse_queue_forget(struct fuse_conn *fc, struct fuse_forget_link *forget,
  279. u64 nodeid, u64 nlookup)
  280. {
  281. forget->forget_one.nodeid = nodeid;
  282. forget->forget_one.nlookup = nlookup;
  283. spin_lock(&fc->lock);
  284. if (fc->connected) {
  285. fc->forget_list_tail->next = forget;
  286. fc->forget_list_tail = forget;
  287. wake_up(&fc->waitq);
  288. kill_fasync(&fc->fasync, SIGIO, POLL_IN);
  289. } else {
  290. kfree(forget);
  291. }
  292. spin_unlock(&fc->lock);
  293. }
  294. static void flush_bg_queue(struct fuse_conn *fc)
  295. {
  296. while (fc->active_background < fc->max_background &&
  297. !list_empty(&fc->bg_queue)) {
  298. struct fuse_req *req;
  299. req = list_entry(fc->bg_queue.next, struct fuse_req, list);
  300. list_del(&req->list);
  301. fc->active_background++;
  302. req->in.h.unique = fuse_get_unique(fc);
  303. queue_request(fc, req);
  304. }
  305. }
  306. /*
  307. * This function is called when a request is finished. Either a reply
  308. * has arrived or it was aborted (and not yet sent) or some error
  309. * occurred during communication with userspace, or the device file
  310. * was closed. The requester thread is woken up (if still waiting),
  311. * the 'end' callback is called if given, else the reference to the
  312. * request is released
  313. *
  314. * Called with fc->lock, unlocks it
  315. */
  316. static void request_end(struct fuse_conn *fc, struct fuse_req *req)
  317. __releases(fc->lock)
  318. {
  319. void (*end) (struct fuse_conn *, struct fuse_req *) = req->end;
  320. req->end = NULL;
  321. list_del(&req->list);
  322. list_del(&req->intr_entry);
  323. req->state = FUSE_REQ_FINISHED;
  324. if (req->background) {
  325. req->background = 0;
  326. if (fc->num_background == fc->max_background)
  327. fc->blocked = 0;
  328. /* Wake up next waiter, if any */
  329. if (!fc->blocked && waitqueue_active(&fc->blocked_waitq))
  330. wake_up(&fc->blocked_waitq);
  331. if (fc->num_background == fc->congestion_threshold &&
  332. fc->connected && fc->bdi_initialized) {
  333. clear_bdi_congested(&fc->bdi, BLK_RW_SYNC);
  334. clear_bdi_congested(&fc->bdi, BLK_RW_ASYNC);
  335. }
  336. fc->num_background--;
  337. fc->active_background--;
  338. flush_bg_queue(fc);
  339. }
  340. spin_unlock(&fc->lock);
  341. wake_up(&req->waitq);
  342. if (end)
  343. end(fc, req);
  344. fuse_put_request(fc, req);
  345. }
  346. static void wait_answer_interruptible(struct fuse_conn *fc,
  347. struct fuse_req *req)
  348. __releases(fc->lock)
  349. __acquires(fc->lock)
  350. {
  351. if (signal_pending(current))
  352. return;
  353. spin_unlock(&fc->lock);
  354. wait_event_interruptible(req->waitq, req->state == FUSE_REQ_FINISHED);
  355. spin_lock(&fc->lock);
  356. }
  357. static void queue_interrupt(struct fuse_conn *fc, struct fuse_req *req)
  358. {
  359. list_add_tail(&req->intr_entry, &fc->interrupts);
  360. wake_up(&fc->waitq);
  361. kill_fasync(&fc->fasync, SIGIO, POLL_IN);
  362. }
  363. static void request_wait_answer(struct fuse_conn *fc, struct fuse_req *req)
  364. __releases(fc->lock)
  365. __acquires(fc->lock)
  366. {
  367. if (!fc->no_interrupt) {
  368. /* Any signal may interrupt this */
  369. wait_answer_interruptible(fc, req);
  370. if (req->aborted)
  371. goto aborted;
  372. if (req->state == FUSE_REQ_FINISHED)
  373. return;
  374. req->interrupted = 1;
  375. if (req->state == FUSE_REQ_SENT)
  376. queue_interrupt(fc, req);
  377. }
  378. if (!req->force) {
  379. sigset_t oldset;
  380. /* Only fatal signals may interrupt this */
  381. block_sigs(&oldset);
  382. wait_answer_interruptible(fc, req);
  383. restore_sigs(&oldset);
  384. if (req->aborted)
  385. goto aborted;
  386. if (req->state == FUSE_REQ_FINISHED)
  387. return;
  388. /* Request is not yet in userspace, bail out */
  389. if (req->state == FUSE_REQ_PENDING) {
  390. list_del(&req->list);
  391. __fuse_put_request(req);
  392. req->out.h.error = -EINTR;
  393. return;
  394. }
  395. }
  396. /*
  397. * Either request is already in userspace, or it was forced.
  398. * Wait it out.
  399. */
  400. spin_unlock(&fc->lock);
  401. wait_event(req->waitq, req->state == FUSE_REQ_FINISHED);
  402. spin_lock(&fc->lock);
  403. if (!req->aborted)
  404. return;
  405. aborted:
  406. BUG_ON(req->state != FUSE_REQ_FINISHED);
  407. if (req->locked) {
  408. /* This is uninterruptible sleep, because data is
  409. being copied to/from the buffers of req. During
  410. locked state, there mustn't be any filesystem
  411. operation (e.g. page fault), since that could lead
  412. to deadlock */
  413. spin_unlock(&fc->lock);
  414. wait_event(req->waitq, !req->locked);
  415. spin_lock(&fc->lock);
  416. }
  417. }
  418. static void __fuse_request_send(struct fuse_conn *fc, struct fuse_req *req)
  419. {
  420. BUG_ON(req->background);
  421. spin_lock(&fc->lock);
  422. if (!fc->connected)
  423. req->out.h.error = -ENOTCONN;
  424. else if (fc->conn_error)
  425. req->out.h.error = -ECONNREFUSED;
  426. else {
  427. req->in.h.unique = fuse_get_unique(fc);
  428. queue_request(fc, req);
  429. /* acquire extra reference, since request is still needed
  430. after request_end() */
  431. __fuse_get_request(req);
  432. request_wait_answer(fc, req);
  433. }
  434. spin_unlock(&fc->lock);
  435. }
  436. void fuse_request_send(struct fuse_conn *fc, struct fuse_req *req)
  437. {
  438. req->isreply = 1;
  439. __fuse_request_send(fc, req);
  440. }
  441. EXPORT_SYMBOL_GPL(fuse_request_send);
  442. ssize_t fuse_simple_request(struct fuse_conn *fc, struct fuse_args *args)
  443. {
  444. struct fuse_req *req;
  445. ssize_t ret;
  446. req = fuse_get_req(fc, 0);
  447. if (IS_ERR(req))
  448. return PTR_ERR(req);
  449. req->in.h.opcode = args->in.h.opcode;
  450. req->in.h.nodeid = args->in.h.nodeid;
  451. req->in.numargs = args->in.numargs;
  452. memcpy(req->in.args, args->in.args,
  453. args->in.numargs * sizeof(struct fuse_in_arg));
  454. req->out.argvar = args->out.argvar;
  455. req->out.numargs = args->out.numargs;
  456. memcpy(req->out.args, args->out.args,
  457. args->out.numargs * sizeof(struct fuse_arg));
  458. fuse_request_send(fc, req);
  459. ret = req->out.h.error;
  460. if (!ret && args->out.argvar) {
  461. BUG_ON(args->out.numargs != 1);
  462. ret = req->out.args[0].size;
  463. }
  464. fuse_put_request(fc, req);
  465. return ret;
  466. }
  467. static void fuse_request_send_nowait_locked(struct fuse_conn *fc,
  468. struct fuse_req *req)
  469. {
  470. BUG_ON(!req->background);
  471. fc->num_background++;
  472. if (fc->num_background == fc->max_background)
  473. fc->blocked = 1;
  474. if (fc->num_background == fc->congestion_threshold &&
  475. fc->bdi_initialized) {
  476. set_bdi_congested(&fc->bdi, BLK_RW_SYNC);
  477. set_bdi_congested(&fc->bdi, BLK_RW_ASYNC);
  478. }
  479. list_add_tail(&req->list, &fc->bg_queue);
  480. flush_bg_queue(fc);
  481. }
  482. static void fuse_request_send_nowait(struct fuse_conn *fc, struct fuse_req *req)
  483. {
  484. spin_lock(&fc->lock);
  485. if (fc->connected) {
  486. fuse_request_send_nowait_locked(fc, req);
  487. spin_unlock(&fc->lock);
  488. } else {
  489. req->out.h.error = -ENOTCONN;
  490. request_end(fc, req);
  491. }
  492. }
  493. void fuse_request_send_background(struct fuse_conn *fc, struct fuse_req *req)
  494. {
  495. req->isreply = 1;
  496. fuse_request_send_nowait(fc, req);
  497. }
  498. EXPORT_SYMBOL_GPL(fuse_request_send_background);
  499. static int fuse_request_send_notify_reply(struct fuse_conn *fc,
  500. struct fuse_req *req, u64 unique)
  501. {
  502. int err = -ENODEV;
  503. req->isreply = 0;
  504. req->in.h.unique = unique;
  505. spin_lock(&fc->lock);
  506. if (fc->connected) {
  507. queue_request(fc, req);
  508. err = 0;
  509. }
  510. spin_unlock(&fc->lock);
  511. return err;
  512. }
  513. /*
  514. * Called under fc->lock
  515. *
  516. * fc->connected must have been checked previously
  517. */
  518. void fuse_request_send_background_locked(struct fuse_conn *fc,
  519. struct fuse_req *req)
  520. {
  521. req->isreply = 1;
  522. fuse_request_send_nowait_locked(fc, req);
  523. }
  524. void fuse_force_forget(struct file *file, u64 nodeid)
  525. {
  526. struct inode *inode = file_inode(file);
  527. struct fuse_conn *fc = get_fuse_conn(inode);
  528. struct fuse_req *req;
  529. struct fuse_forget_in inarg;
  530. memset(&inarg, 0, sizeof(inarg));
  531. inarg.nlookup = 1;
  532. req = fuse_get_req_nofail_nopages(fc, file);
  533. req->in.h.opcode = FUSE_FORGET;
  534. req->in.h.nodeid = nodeid;
  535. req->in.numargs = 1;
  536. req->in.args[0].size = sizeof(inarg);
  537. req->in.args[0].value = &inarg;
  538. req->isreply = 0;
  539. __fuse_request_send(fc, req);
  540. /* ignore errors */
  541. fuse_put_request(fc, req);
  542. }
  543. /*
  544. * Lock the request. Up to the next unlock_request() there mustn't be
  545. * anything that could cause a page-fault. If the request was already
  546. * aborted bail out.
  547. */
  548. static int lock_request(struct fuse_conn *fc, struct fuse_req *req)
  549. {
  550. int err = 0;
  551. if (req) {
  552. spin_lock(&fc->lock);
  553. if (req->aborted)
  554. err = -ENOENT;
  555. else
  556. req->locked = 1;
  557. spin_unlock(&fc->lock);
  558. }
  559. return err;
  560. }
  561. /*
  562. * Unlock request. If it was aborted during being locked, the
  563. * requester thread is currently waiting for it to be unlocked, so
  564. * wake it up.
  565. */
  566. static void unlock_request(struct fuse_conn *fc, struct fuse_req *req)
  567. {
  568. if (req) {
  569. spin_lock(&fc->lock);
  570. req->locked = 0;
  571. if (req->aborted)
  572. wake_up(&req->waitq);
  573. spin_unlock(&fc->lock);
  574. }
  575. }
  576. struct fuse_copy_state {
  577. struct fuse_conn *fc;
  578. int write;
  579. struct fuse_req *req;
  580. const struct iovec *iov;
  581. struct pipe_buffer *pipebufs;
  582. struct pipe_buffer *currbuf;
  583. struct pipe_inode_info *pipe;
  584. unsigned long nr_segs;
  585. unsigned long seglen;
  586. unsigned long addr;
  587. struct page *pg;
  588. unsigned len;
  589. unsigned offset;
  590. unsigned move_pages:1;
  591. };
  592. static void fuse_copy_init(struct fuse_copy_state *cs, struct fuse_conn *fc,
  593. int write,
  594. const struct iovec *iov, unsigned long nr_segs)
  595. {
  596. memset(cs, 0, sizeof(*cs));
  597. cs->fc = fc;
  598. cs->write = write;
  599. cs->iov = iov;
  600. cs->nr_segs = nr_segs;
  601. }
  602. /* Unmap and put previous page of userspace buffer */
  603. static void fuse_copy_finish(struct fuse_copy_state *cs)
  604. {
  605. if (cs->currbuf) {
  606. struct pipe_buffer *buf = cs->currbuf;
  607. if (cs->write)
  608. buf->len = PAGE_SIZE - cs->len;
  609. cs->currbuf = NULL;
  610. } else if (cs->pg) {
  611. if (cs->write) {
  612. flush_dcache_page(cs->pg);
  613. set_page_dirty_lock(cs->pg);
  614. }
  615. put_page(cs->pg);
  616. }
  617. cs->pg = NULL;
  618. }
  619. /*
  620. * Get another pagefull of userspace buffer, and map it to kernel
  621. * address space, and lock request
  622. */
  623. static int fuse_copy_fill(struct fuse_copy_state *cs)
  624. {
  625. struct page *page;
  626. int err;
  627. unlock_request(cs->fc, cs->req);
  628. fuse_copy_finish(cs);
  629. if (cs->pipebufs) {
  630. struct pipe_buffer *buf = cs->pipebufs;
  631. if (!cs->write) {
  632. err = buf->ops->confirm(cs->pipe, buf);
  633. if (err)
  634. return err;
  635. BUG_ON(!cs->nr_segs);
  636. cs->currbuf = buf;
  637. cs->pg = buf->page;
  638. cs->offset = buf->offset;
  639. cs->len = buf->len;
  640. cs->pipebufs++;
  641. cs->nr_segs--;
  642. } else {
  643. if (cs->nr_segs == cs->pipe->buffers)
  644. return -EIO;
  645. page = alloc_page(GFP_HIGHUSER);
  646. if (!page)
  647. return -ENOMEM;
  648. buf->page = page;
  649. buf->offset = 0;
  650. buf->len = 0;
  651. cs->currbuf = buf;
  652. cs->pg = page;
  653. cs->offset = 0;
  654. cs->len = PAGE_SIZE;
  655. cs->pipebufs++;
  656. cs->nr_segs++;
  657. }
  658. } else {
  659. if (!cs->seglen) {
  660. BUG_ON(!cs->nr_segs);
  661. cs->seglen = cs->iov[0].iov_len;
  662. cs->addr = (unsigned long) cs->iov[0].iov_base;
  663. cs->iov++;
  664. cs->nr_segs--;
  665. }
  666. err = get_user_pages_fast(cs->addr, 1, cs->write, &page);
  667. if (err < 0)
  668. return err;
  669. BUG_ON(err != 1);
  670. cs->pg = page;
  671. cs->offset = cs->addr % PAGE_SIZE;
  672. cs->len = min(PAGE_SIZE - cs->offset, cs->seglen);
  673. cs->seglen -= cs->len;
  674. cs->addr += cs->len;
  675. }
  676. return lock_request(cs->fc, cs->req);
  677. }
  678. /* Do as much copy to/from userspace buffer as we can */
  679. static int fuse_copy_do(struct fuse_copy_state *cs, void **val, unsigned *size)
  680. {
  681. unsigned ncpy = min(*size, cs->len);
  682. if (val) {
  683. void *pgaddr = kmap_atomic(cs->pg);
  684. void *buf = pgaddr + cs->offset;
  685. if (cs->write)
  686. memcpy(buf, *val, ncpy);
  687. else
  688. memcpy(*val, buf, ncpy);
  689. kunmap_atomic(pgaddr);
  690. *val += ncpy;
  691. }
  692. *size -= ncpy;
  693. cs->len -= ncpy;
  694. cs->offset += ncpy;
  695. return ncpy;
  696. }
  697. static int fuse_check_page(struct page *page)
  698. {
  699. if (page_mapcount(page) ||
  700. page->mapping != NULL ||
  701. page_count(page) != 1 ||
  702. (page->flags & PAGE_FLAGS_CHECK_AT_PREP &
  703. ~(1 << PG_locked |
  704. 1 << PG_referenced |
  705. 1 << PG_uptodate |
  706. 1 << PG_lru |
  707. 1 << PG_active |
  708. 1 << PG_reclaim))) {
  709. printk(KERN_WARNING "fuse: trying to steal weird page\n");
  710. 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);
  711. return 1;
  712. }
  713. return 0;
  714. }
  715. static int fuse_try_move_page(struct fuse_copy_state *cs, struct page **pagep)
  716. {
  717. int err;
  718. struct page *oldpage = *pagep;
  719. struct page *newpage;
  720. struct pipe_buffer *buf = cs->pipebufs;
  721. unlock_request(cs->fc, cs->req);
  722. fuse_copy_finish(cs);
  723. err = buf->ops->confirm(cs->pipe, buf);
  724. if (err)
  725. return err;
  726. BUG_ON(!cs->nr_segs);
  727. cs->currbuf = buf;
  728. cs->len = buf->len;
  729. cs->pipebufs++;
  730. cs->nr_segs--;
  731. if (cs->len != PAGE_SIZE)
  732. goto out_fallback;
  733. if (buf->ops->steal(cs->pipe, buf) != 0)
  734. goto out_fallback;
  735. newpage = buf->page;
  736. if (WARN_ON(!PageUptodate(newpage)))
  737. return -EIO;
  738. ClearPageMappedToDisk(newpage);
  739. if (fuse_check_page(newpage) != 0)
  740. goto out_fallback_unlock;
  741. /*
  742. * This is a new and locked page, it shouldn't be mapped or
  743. * have any special flags on it
  744. */
  745. if (WARN_ON(page_mapped(oldpage)))
  746. goto out_fallback_unlock;
  747. if (WARN_ON(page_has_private(oldpage)))
  748. goto out_fallback_unlock;
  749. if (WARN_ON(PageDirty(oldpage) || PageWriteback(oldpage)))
  750. goto out_fallback_unlock;
  751. if (WARN_ON(PageMlocked(oldpage)))
  752. goto out_fallback_unlock;
  753. err = replace_page_cache_page(oldpage, newpage, GFP_KERNEL);
  754. if (err) {
  755. unlock_page(newpage);
  756. return err;
  757. }
  758. page_cache_get(newpage);
  759. if (!(buf->flags & PIPE_BUF_FLAG_LRU))
  760. lru_cache_add_file(newpage);
  761. err = 0;
  762. spin_lock(&cs->fc->lock);
  763. if (cs->req->aborted)
  764. err = -ENOENT;
  765. else
  766. *pagep = newpage;
  767. spin_unlock(&cs->fc->lock);
  768. if (err) {
  769. unlock_page(newpage);
  770. page_cache_release(newpage);
  771. return err;
  772. }
  773. unlock_page(oldpage);
  774. page_cache_release(oldpage);
  775. cs->len = 0;
  776. return 0;
  777. out_fallback_unlock:
  778. unlock_page(newpage);
  779. out_fallback:
  780. cs->pg = buf->page;
  781. cs->offset = buf->offset;
  782. err = lock_request(cs->fc, cs->req);
  783. if (err)
  784. return err;
  785. return 1;
  786. }
  787. static int fuse_ref_page(struct fuse_copy_state *cs, struct page *page,
  788. unsigned offset, unsigned count)
  789. {
  790. struct pipe_buffer *buf;
  791. if (cs->nr_segs == cs->pipe->buffers)
  792. return -EIO;
  793. unlock_request(cs->fc, cs->req);
  794. fuse_copy_finish(cs);
  795. buf = cs->pipebufs;
  796. page_cache_get(page);
  797. buf->page = page;
  798. buf->offset = offset;
  799. buf->len = count;
  800. cs->pipebufs++;
  801. cs->nr_segs++;
  802. cs->len = 0;
  803. return 0;
  804. }
  805. /*
  806. * Copy a page in the request to/from the userspace buffer. Must be
  807. * done atomically
  808. */
  809. static int fuse_copy_page(struct fuse_copy_state *cs, struct page **pagep,
  810. unsigned offset, unsigned count, int zeroing)
  811. {
  812. int err;
  813. struct page *page = *pagep;
  814. if (page && zeroing && count < PAGE_SIZE)
  815. clear_highpage(page);
  816. while (count) {
  817. if (cs->write && cs->pipebufs && page) {
  818. return fuse_ref_page(cs, page, offset, count);
  819. } else if (!cs->len) {
  820. if (cs->move_pages && page &&
  821. offset == 0 && count == PAGE_SIZE) {
  822. err = fuse_try_move_page(cs, pagep);
  823. if (err <= 0)
  824. return err;
  825. } else {
  826. err = fuse_copy_fill(cs);
  827. if (err)
  828. return err;
  829. }
  830. }
  831. if (page) {
  832. void *mapaddr = kmap_atomic(page);
  833. void *buf = mapaddr + offset;
  834. offset += fuse_copy_do(cs, &buf, &count);
  835. kunmap_atomic(mapaddr);
  836. } else
  837. offset += fuse_copy_do(cs, NULL, &count);
  838. }
  839. if (page && !cs->write)
  840. flush_dcache_page(page);
  841. return 0;
  842. }
  843. /* Copy pages in the request to/from userspace buffer */
  844. static int fuse_copy_pages(struct fuse_copy_state *cs, unsigned nbytes,
  845. int zeroing)
  846. {
  847. unsigned i;
  848. struct fuse_req *req = cs->req;
  849. for (i = 0; i < req->num_pages && (nbytes || zeroing); i++) {
  850. int err;
  851. unsigned offset = req->page_descs[i].offset;
  852. unsigned count = min(nbytes, req->page_descs[i].length);
  853. err = fuse_copy_page(cs, &req->pages[i], offset, count,
  854. zeroing);
  855. if (err)
  856. return err;
  857. nbytes -= count;
  858. }
  859. return 0;
  860. }
  861. /* Copy a single argument in the request to/from userspace buffer */
  862. static int fuse_copy_one(struct fuse_copy_state *cs, void *val, unsigned size)
  863. {
  864. while (size) {
  865. if (!cs->len) {
  866. int err = fuse_copy_fill(cs);
  867. if (err)
  868. return err;
  869. }
  870. fuse_copy_do(cs, &val, &size);
  871. }
  872. return 0;
  873. }
  874. /* Copy request arguments to/from userspace buffer */
  875. static int fuse_copy_args(struct fuse_copy_state *cs, unsigned numargs,
  876. unsigned argpages, struct fuse_arg *args,
  877. int zeroing)
  878. {
  879. int err = 0;
  880. unsigned i;
  881. for (i = 0; !err && i < numargs; i++) {
  882. struct fuse_arg *arg = &args[i];
  883. if (i == numargs - 1 && argpages)
  884. err = fuse_copy_pages(cs, arg->size, zeroing);
  885. else
  886. err = fuse_copy_one(cs, arg->value, arg->size);
  887. }
  888. return err;
  889. }
  890. static int forget_pending(struct fuse_conn *fc)
  891. {
  892. return fc->forget_list_head.next != NULL;
  893. }
  894. static int request_pending(struct fuse_conn *fc)
  895. {
  896. return !list_empty(&fc->pending) || !list_empty(&fc->interrupts) ||
  897. forget_pending(fc);
  898. }
  899. /* Wait until a request is available on the pending list */
  900. static void request_wait(struct fuse_conn *fc)
  901. __releases(fc->lock)
  902. __acquires(fc->lock)
  903. {
  904. DECLARE_WAITQUEUE(wait, current);
  905. add_wait_queue_exclusive(&fc->waitq, &wait);
  906. while (fc->connected && !request_pending(fc)) {
  907. set_current_state(TASK_INTERRUPTIBLE);
  908. if (signal_pending(current))
  909. break;
  910. spin_unlock(&fc->lock);
  911. schedule();
  912. spin_lock(&fc->lock);
  913. }
  914. set_current_state(TASK_RUNNING);
  915. remove_wait_queue(&fc->waitq, &wait);
  916. }
  917. /*
  918. * Transfer an interrupt request to userspace
  919. *
  920. * Unlike other requests this is assembled on demand, without a need
  921. * to allocate a separate fuse_req structure.
  922. *
  923. * Called with fc->lock held, releases it
  924. */
  925. static int fuse_read_interrupt(struct fuse_conn *fc, struct fuse_copy_state *cs,
  926. size_t nbytes, struct fuse_req *req)
  927. __releases(fc->lock)
  928. {
  929. struct fuse_in_header ih;
  930. struct fuse_interrupt_in arg;
  931. unsigned reqsize = sizeof(ih) + sizeof(arg);
  932. int err;
  933. list_del_init(&req->intr_entry);
  934. req->intr_unique = fuse_get_unique(fc);
  935. memset(&ih, 0, sizeof(ih));
  936. memset(&arg, 0, sizeof(arg));
  937. ih.len = reqsize;
  938. ih.opcode = FUSE_INTERRUPT;
  939. ih.unique = req->intr_unique;
  940. arg.unique = req->in.h.unique;
  941. spin_unlock(&fc->lock);
  942. if (nbytes < reqsize)
  943. return -EINVAL;
  944. err = fuse_copy_one(cs, &ih, sizeof(ih));
  945. if (!err)
  946. err = fuse_copy_one(cs, &arg, sizeof(arg));
  947. fuse_copy_finish(cs);
  948. return err ? err : reqsize;
  949. }
  950. static struct fuse_forget_link *dequeue_forget(struct fuse_conn *fc,
  951. unsigned max,
  952. unsigned *countp)
  953. {
  954. struct fuse_forget_link *head = fc->forget_list_head.next;
  955. struct fuse_forget_link **newhead = &head;
  956. unsigned count;
  957. for (count = 0; *newhead != NULL && count < max; count++)
  958. newhead = &(*newhead)->next;
  959. fc->forget_list_head.next = *newhead;
  960. *newhead = NULL;
  961. if (fc->forget_list_head.next == NULL)
  962. fc->forget_list_tail = &fc->forget_list_head;
  963. if (countp != NULL)
  964. *countp = count;
  965. return head;
  966. }
  967. static int fuse_read_single_forget(struct fuse_conn *fc,
  968. struct fuse_copy_state *cs,
  969. size_t nbytes)
  970. __releases(fc->lock)
  971. {
  972. int err;
  973. struct fuse_forget_link *forget = dequeue_forget(fc, 1, NULL);
  974. struct fuse_forget_in arg = {
  975. .nlookup = forget->forget_one.nlookup,
  976. };
  977. struct fuse_in_header ih = {
  978. .opcode = FUSE_FORGET,
  979. .nodeid = forget->forget_one.nodeid,
  980. .unique = fuse_get_unique(fc),
  981. .len = sizeof(ih) + sizeof(arg),
  982. };
  983. spin_unlock(&fc->lock);
  984. kfree(forget);
  985. if (nbytes < ih.len)
  986. return -EINVAL;
  987. err = fuse_copy_one(cs, &ih, sizeof(ih));
  988. if (!err)
  989. err = fuse_copy_one(cs, &arg, sizeof(arg));
  990. fuse_copy_finish(cs);
  991. if (err)
  992. return err;
  993. return ih.len;
  994. }
  995. static int fuse_read_batch_forget(struct fuse_conn *fc,
  996. struct fuse_copy_state *cs, size_t nbytes)
  997. __releases(fc->lock)
  998. {
  999. int err;
  1000. unsigned max_forgets;
  1001. unsigned count;
  1002. struct fuse_forget_link *head;
  1003. struct fuse_batch_forget_in arg = { .count = 0 };
  1004. struct fuse_in_header ih = {
  1005. .opcode = FUSE_BATCH_FORGET,
  1006. .unique = fuse_get_unique(fc),
  1007. .len = sizeof(ih) + sizeof(arg),
  1008. };
  1009. if (nbytes < ih.len) {
  1010. spin_unlock(&fc->lock);
  1011. return -EINVAL;
  1012. }
  1013. max_forgets = (nbytes - ih.len) / sizeof(struct fuse_forget_one);
  1014. head = dequeue_forget(fc, max_forgets, &count);
  1015. spin_unlock(&fc->lock);
  1016. arg.count = count;
  1017. ih.len += count * sizeof(struct fuse_forget_one);
  1018. err = fuse_copy_one(cs, &ih, sizeof(ih));
  1019. if (!err)
  1020. err = fuse_copy_one(cs, &arg, sizeof(arg));
  1021. while (head) {
  1022. struct fuse_forget_link *forget = head;
  1023. if (!err) {
  1024. err = fuse_copy_one(cs, &forget->forget_one,
  1025. sizeof(forget->forget_one));
  1026. }
  1027. head = forget->next;
  1028. kfree(forget);
  1029. }
  1030. fuse_copy_finish(cs);
  1031. if (err)
  1032. return err;
  1033. return ih.len;
  1034. }
  1035. static int fuse_read_forget(struct fuse_conn *fc, struct fuse_copy_state *cs,
  1036. size_t nbytes)
  1037. __releases(fc->lock)
  1038. {
  1039. if (fc->minor < 16 || fc->forget_list_head.next->next == NULL)
  1040. return fuse_read_single_forget(fc, cs, nbytes);
  1041. else
  1042. return fuse_read_batch_forget(fc, cs, nbytes);
  1043. }
  1044. /*
  1045. * Read a single request into the userspace filesystem's buffer. This
  1046. * function waits until a request is available, then removes it from
  1047. * the pending list and copies request data to userspace buffer. If
  1048. * no reply is needed (FORGET) or request has been aborted or there
  1049. * was an error during the copying then it's finished by calling
  1050. * request_end(). Otherwise add it to the processing list, and set
  1051. * the 'sent' flag.
  1052. */
  1053. static ssize_t fuse_dev_do_read(struct fuse_conn *fc, struct file *file,
  1054. struct fuse_copy_state *cs, size_t nbytes)
  1055. {
  1056. int err;
  1057. struct fuse_req *req;
  1058. struct fuse_in *in;
  1059. unsigned reqsize;
  1060. restart:
  1061. spin_lock(&fc->lock);
  1062. err = -EAGAIN;
  1063. if ((file->f_flags & O_NONBLOCK) && fc->connected &&
  1064. !request_pending(fc))
  1065. goto err_unlock;
  1066. request_wait(fc);
  1067. err = -ENODEV;
  1068. if (!fc->connected)
  1069. goto err_unlock;
  1070. err = -ERESTARTSYS;
  1071. if (!request_pending(fc))
  1072. goto err_unlock;
  1073. if (!list_empty(&fc->interrupts)) {
  1074. req = list_entry(fc->interrupts.next, struct fuse_req,
  1075. intr_entry);
  1076. return fuse_read_interrupt(fc, cs, nbytes, req);
  1077. }
  1078. if (forget_pending(fc)) {
  1079. if (list_empty(&fc->pending) || fc->forget_batch-- > 0)
  1080. return fuse_read_forget(fc, cs, nbytes);
  1081. if (fc->forget_batch <= -8)
  1082. fc->forget_batch = 16;
  1083. }
  1084. req = list_entry(fc->pending.next, struct fuse_req, list);
  1085. req->state = FUSE_REQ_READING;
  1086. list_move(&req->list, &fc->io);
  1087. in = &req->in;
  1088. reqsize = in->h.len;
  1089. /* If request is too large, reply with an error and restart the read */
  1090. if (nbytes < reqsize) {
  1091. req->out.h.error = -EIO;
  1092. /* SETXATTR is special, since it may contain too large data */
  1093. if (in->h.opcode == FUSE_SETXATTR)
  1094. req->out.h.error = -E2BIG;
  1095. request_end(fc, req);
  1096. goto restart;
  1097. }
  1098. spin_unlock(&fc->lock);
  1099. cs->req = req;
  1100. err = fuse_copy_one(cs, &in->h, sizeof(in->h));
  1101. if (!err)
  1102. err = fuse_copy_args(cs, in->numargs, in->argpages,
  1103. (struct fuse_arg *) in->args, 0);
  1104. fuse_copy_finish(cs);
  1105. spin_lock(&fc->lock);
  1106. req->locked = 0;
  1107. if (req->aborted) {
  1108. request_end(fc, req);
  1109. return -ENODEV;
  1110. }
  1111. if (err) {
  1112. req->out.h.error = -EIO;
  1113. request_end(fc, req);
  1114. return err;
  1115. }
  1116. if (!req->isreply)
  1117. request_end(fc, req);
  1118. else {
  1119. req->state = FUSE_REQ_SENT;
  1120. list_move_tail(&req->list, &fc->processing);
  1121. if (req->interrupted)
  1122. queue_interrupt(fc, req);
  1123. spin_unlock(&fc->lock);
  1124. }
  1125. return reqsize;
  1126. err_unlock:
  1127. spin_unlock(&fc->lock);
  1128. return err;
  1129. }
  1130. static ssize_t fuse_dev_read(struct kiocb *iocb, const struct iovec *iov,
  1131. unsigned long nr_segs, loff_t pos)
  1132. {
  1133. struct fuse_copy_state cs;
  1134. struct file *file = iocb->ki_filp;
  1135. struct fuse_conn *fc = fuse_get_conn(file);
  1136. if (!fc)
  1137. return -EPERM;
  1138. fuse_copy_init(&cs, fc, 1, iov, nr_segs);
  1139. return fuse_dev_do_read(fc, file, &cs, iov_length(iov, nr_segs));
  1140. }
  1141. static ssize_t fuse_dev_splice_read(struct file *in, loff_t *ppos,
  1142. struct pipe_inode_info *pipe,
  1143. size_t len, unsigned int flags)
  1144. {
  1145. int ret;
  1146. int page_nr = 0;
  1147. int do_wakeup = 0;
  1148. struct pipe_buffer *bufs;
  1149. struct fuse_copy_state cs;
  1150. struct fuse_conn *fc = fuse_get_conn(in);
  1151. if (!fc)
  1152. return -EPERM;
  1153. bufs = kmalloc(pipe->buffers * sizeof(struct pipe_buffer), GFP_KERNEL);
  1154. if (!bufs)
  1155. return -ENOMEM;
  1156. fuse_copy_init(&cs, fc, 1, NULL, 0);
  1157. cs.pipebufs = bufs;
  1158. cs.pipe = pipe;
  1159. ret = fuse_dev_do_read(fc, in, &cs, len);
  1160. if (ret < 0)
  1161. goto out;
  1162. ret = 0;
  1163. pipe_lock(pipe);
  1164. if (!pipe->readers) {
  1165. send_sig(SIGPIPE, current, 0);
  1166. if (!ret)
  1167. ret = -EPIPE;
  1168. goto out_unlock;
  1169. }
  1170. if (pipe->nrbufs + cs.nr_segs > pipe->buffers) {
  1171. ret = -EIO;
  1172. goto out_unlock;
  1173. }
  1174. while (page_nr < cs.nr_segs) {
  1175. int newbuf = (pipe->curbuf + pipe->nrbufs) & (pipe->buffers - 1);
  1176. struct pipe_buffer *buf = pipe->bufs + newbuf;
  1177. buf->page = bufs[page_nr].page;
  1178. buf->offset = bufs[page_nr].offset;
  1179. buf->len = bufs[page_nr].len;
  1180. /*
  1181. * Need to be careful about this. Having buf->ops in module
  1182. * code can Oops if the buffer persists after module unload.
  1183. */
  1184. buf->ops = &nosteal_pipe_buf_ops;
  1185. pipe->nrbufs++;
  1186. page_nr++;
  1187. ret += buf->len;
  1188. if (pipe->files)
  1189. do_wakeup = 1;
  1190. }
  1191. out_unlock:
  1192. pipe_unlock(pipe);
  1193. if (do_wakeup) {
  1194. smp_mb();
  1195. if (waitqueue_active(&pipe->wait))
  1196. wake_up_interruptible(&pipe->wait);
  1197. kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
  1198. }
  1199. out:
  1200. for (; page_nr < cs.nr_segs; page_nr++)
  1201. page_cache_release(bufs[page_nr].page);
  1202. kfree(bufs);
  1203. return ret;
  1204. }
  1205. static int fuse_notify_poll(struct fuse_conn *fc, unsigned int size,
  1206. struct fuse_copy_state *cs)
  1207. {
  1208. struct fuse_notify_poll_wakeup_out outarg;
  1209. int err = -EINVAL;
  1210. if (size != sizeof(outarg))
  1211. goto err;
  1212. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1213. if (err)
  1214. goto err;
  1215. fuse_copy_finish(cs);
  1216. return fuse_notify_poll_wakeup(fc, &outarg);
  1217. err:
  1218. fuse_copy_finish(cs);
  1219. return err;
  1220. }
  1221. static int fuse_notify_inval_inode(struct fuse_conn *fc, unsigned int size,
  1222. struct fuse_copy_state *cs)
  1223. {
  1224. struct fuse_notify_inval_inode_out outarg;
  1225. int err = -EINVAL;
  1226. if (size != sizeof(outarg))
  1227. goto err;
  1228. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1229. if (err)
  1230. goto err;
  1231. fuse_copy_finish(cs);
  1232. down_read(&fc->killsb);
  1233. err = -ENOENT;
  1234. if (fc->sb) {
  1235. err = fuse_reverse_inval_inode(fc->sb, outarg.ino,
  1236. outarg.off, outarg.len);
  1237. }
  1238. up_read(&fc->killsb);
  1239. return err;
  1240. err:
  1241. fuse_copy_finish(cs);
  1242. return err;
  1243. }
  1244. static int fuse_notify_inval_entry(struct fuse_conn *fc, unsigned int size,
  1245. struct fuse_copy_state *cs)
  1246. {
  1247. struct fuse_notify_inval_entry_out outarg;
  1248. int err = -ENOMEM;
  1249. char *buf;
  1250. struct qstr name;
  1251. buf = kzalloc(FUSE_NAME_MAX + 1, GFP_KERNEL);
  1252. if (!buf)
  1253. goto err;
  1254. err = -EINVAL;
  1255. if (size < sizeof(outarg))
  1256. goto err;
  1257. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1258. if (err)
  1259. goto err;
  1260. err = -ENAMETOOLONG;
  1261. if (outarg.namelen > FUSE_NAME_MAX)
  1262. goto err;
  1263. err = -EINVAL;
  1264. if (size != sizeof(outarg) + outarg.namelen + 1)
  1265. goto err;
  1266. name.name = buf;
  1267. name.len = outarg.namelen;
  1268. err = fuse_copy_one(cs, buf, outarg.namelen + 1);
  1269. if (err)
  1270. goto err;
  1271. fuse_copy_finish(cs);
  1272. buf[outarg.namelen] = 0;
  1273. name.hash = full_name_hash(name.name, name.len);
  1274. down_read(&fc->killsb);
  1275. err = -ENOENT;
  1276. if (fc->sb)
  1277. err = fuse_reverse_inval_entry(fc->sb, outarg.parent, 0, &name);
  1278. up_read(&fc->killsb);
  1279. kfree(buf);
  1280. return err;
  1281. err:
  1282. kfree(buf);
  1283. fuse_copy_finish(cs);
  1284. return err;
  1285. }
  1286. static int fuse_notify_delete(struct fuse_conn *fc, unsigned int size,
  1287. struct fuse_copy_state *cs)
  1288. {
  1289. struct fuse_notify_delete_out outarg;
  1290. int err = -ENOMEM;
  1291. char *buf;
  1292. struct qstr name;
  1293. buf = kzalloc(FUSE_NAME_MAX + 1, GFP_KERNEL);
  1294. if (!buf)
  1295. goto err;
  1296. err = -EINVAL;
  1297. if (size < sizeof(outarg))
  1298. goto err;
  1299. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1300. if (err)
  1301. goto err;
  1302. err = -ENAMETOOLONG;
  1303. if (outarg.namelen > FUSE_NAME_MAX)
  1304. goto err;
  1305. err = -EINVAL;
  1306. if (size != sizeof(outarg) + outarg.namelen + 1)
  1307. goto err;
  1308. name.name = buf;
  1309. name.len = outarg.namelen;
  1310. err = fuse_copy_one(cs, buf, outarg.namelen + 1);
  1311. if (err)
  1312. goto err;
  1313. fuse_copy_finish(cs);
  1314. buf[outarg.namelen] = 0;
  1315. name.hash = full_name_hash(name.name, name.len);
  1316. down_read(&fc->killsb);
  1317. err = -ENOENT;
  1318. if (fc->sb)
  1319. err = fuse_reverse_inval_entry(fc->sb, outarg.parent,
  1320. outarg.child, &name);
  1321. up_read(&fc->killsb);
  1322. kfree(buf);
  1323. return err;
  1324. err:
  1325. kfree(buf);
  1326. fuse_copy_finish(cs);
  1327. return err;
  1328. }
  1329. static int fuse_notify_store(struct fuse_conn *fc, unsigned int size,
  1330. struct fuse_copy_state *cs)
  1331. {
  1332. struct fuse_notify_store_out outarg;
  1333. struct inode *inode;
  1334. struct address_space *mapping;
  1335. u64 nodeid;
  1336. int err;
  1337. pgoff_t index;
  1338. unsigned int offset;
  1339. unsigned int num;
  1340. loff_t file_size;
  1341. loff_t end;
  1342. err = -EINVAL;
  1343. if (size < sizeof(outarg))
  1344. goto out_finish;
  1345. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1346. if (err)
  1347. goto out_finish;
  1348. err = -EINVAL;
  1349. if (size - sizeof(outarg) != outarg.size)
  1350. goto out_finish;
  1351. nodeid = outarg.nodeid;
  1352. down_read(&fc->killsb);
  1353. err = -ENOENT;
  1354. if (!fc->sb)
  1355. goto out_up_killsb;
  1356. inode = ilookup5(fc->sb, nodeid, fuse_inode_eq, &nodeid);
  1357. if (!inode)
  1358. goto out_up_killsb;
  1359. mapping = inode->i_mapping;
  1360. index = outarg.offset >> PAGE_CACHE_SHIFT;
  1361. offset = outarg.offset & ~PAGE_CACHE_MASK;
  1362. file_size = i_size_read(inode);
  1363. end = outarg.offset + outarg.size;
  1364. if (end > file_size) {
  1365. file_size = end;
  1366. fuse_write_update_size(inode, file_size);
  1367. }
  1368. num = outarg.size;
  1369. while (num) {
  1370. struct page *page;
  1371. unsigned int this_num;
  1372. err = -ENOMEM;
  1373. page = find_or_create_page(mapping, index,
  1374. mapping_gfp_mask(mapping));
  1375. if (!page)
  1376. goto out_iput;
  1377. this_num = min_t(unsigned, num, PAGE_CACHE_SIZE - offset);
  1378. err = fuse_copy_page(cs, &page, offset, this_num, 0);
  1379. if (!err && offset == 0 &&
  1380. (this_num == PAGE_CACHE_SIZE || file_size == end))
  1381. SetPageUptodate(page);
  1382. unlock_page(page);
  1383. page_cache_release(page);
  1384. if (err)
  1385. goto out_iput;
  1386. num -= this_num;
  1387. offset = 0;
  1388. index++;
  1389. }
  1390. err = 0;
  1391. out_iput:
  1392. iput(inode);
  1393. out_up_killsb:
  1394. up_read(&fc->killsb);
  1395. out_finish:
  1396. fuse_copy_finish(cs);
  1397. return err;
  1398. }
  1399. static void fuse_retrieve_end(struct fuse_conn *fc, struct fuse_req *req)
  1400. {
  1401. release_pages(req->pages, req->num_pages, false);
  1402. }
  1403. static int fuse_retrieve(struct fuse_conn *fc, struct inode *inode,
  1404. struct fuse_notify_retrieve_out *outarg)
  1405. {
  1406. int err;
  1407. struct address_space *mapping = inode->i_mapping;
  1408. struct fuse_req *req;
  1409. pgoff_t index;
  1410. loff_t file_size;
  1411. unsigned int num;
  1412. unsigned int offset;
  1413. size_t total_len = 0;
  1414. int num_pages;
  1415. offset = outarg->offset & ~PAGE_CACHE_MASK;
  1416. file_size = i_size_read(inode);
  1417. num = outarg->size;
  1418. if (outarg->offset > file_size)
  1419. num = 0;
  1420. else if (outarg->offset + num > file_size)
  1421. num = file_size - outarg->offset;
  1422. num_pages = (num + offset + PAGE_SIZE - 1) >> PAGE_SHIFT;
  1423. num_pages = min(num_pages, FUSE_MAX_PAGES_PER_REQ);
  1424. req = fuse_get_req(fc, num_pages);
  1425. if (IS_ERR(req))
  1426. return PTR_ERR(req);
  1427. req->in.h.opcode = FUSE_NOTIFY_REPLY;
  1428. req->in.h.nodeid = outarg->nodeid;
  1429. req->in.numargs = 2;
  1430. req->in.argpages = 1;
  1431. req->page_descs[0].offset = offset;
  1432. req->end = fuse_retrieve_end;
  1433. index = outarg->offset >> PAGE_CACHE_SHIFT;
  1434. while (num && req->num_pages < num_pages) {
  1435. struct page *page;
  1436. unsigned int this_num;
  1437. page = find_get_page(mapping, index);
  1438. if (!page)
  1439. break;
  1440. this_num = min_t(unsigned, num, PAGE_CACHE_SIZE - offset);
  1441. req->pages[req->num_pages] = page;
  1442. req->page_descs[req->num_pages].length = this_num;
  1443. req->num_pages++;
  1444. offset = 0;
  1445. num -= this_num;
  1446. total_len += this_num;
  1447. index++;
  1448. }
  1449. req->misc.retrieve_in.offset = outarg->offset;
  1450. req->misc.retrieve_in.size = total_len;
  1451. req->in.args[0].size = sizeof(req->misc.retrieve_in);
  1452. req->in.args[0].value = &req->misc.retrieve_in;
  1453. req->in.args[1].size = total_len;
  1454. err = fuse_request_send_notify_reply(fc, req, outarg->notify_unique);
  1455. if (err)
  1456. fuse_retrieve_end(fc, req);
  1457. return err;
  1458. }
  1459. static int fuse_notify_retrieve(struct fuse_conn *fc, unsigned int size,
  1460. struct fuse_copy_state *cs)
  1461. {
  1462. struct fuse_notify_retrieve_out outarg;
  1463. struct inode *inode;
  1464. int err;
  1465. err = -EINVAL;
  1466. if (size != sizeof(outarg))
  1467. goto copy_finish;
  1468. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1469. if (err)
  1470. goto copy_finish;
  1471. fuse_copy_finish(cs);
  1472. down_read(&fc->killsb);
  1473. err = -ENOENT;
  1474. if (fc->sb) {
  1475. u64 nodeid = outarg.nodeid;
  1476. inode = ilookup5(fc->sb, nodeid, fuse_inode_eq, &nodeid);
  1477. if (inode) {
  1478. err = fuse_retrieve(fc, inode, &outarg);
  1479. iput(inode);
  1480. }
  1481. }
  1482. up_read(&fc->killsb);
  1483. return err;
  1484. copy_finish:
  1485. fuse_copy_finish(cs);
  1486. return err;
  1487. }
  1488. static int fuse_notify(struct fuse_conn *fc, enum fuse_notify_code code,
  1489. unsigned int size, struct fuse_copy_state *cs)
  1490. {
  1491. switch (code) {
  1492. case FUSE_NOTIFY_POLL:
  1493. return fuse_notify_poll(fc, size, cs);
  1494. case FUSE_NOTIFY_INVAL_INODE:
  1495. return fuse_notify_inval_inode(fc, size, cs);
  1496. case FUSE_NOTIFY_INVAL_ENTRY:
  1497. return fuse_notify_inval_entry(fc, size, cs);
  1498. case FUSE_NOTIFY_STORE:
  1499. return fuse_notify_store(fc, size, cs);
  1500. case FUSE_NOTIFY_RETRIEVE:
  1501. return fuse_notify_retrieve(fc, size, cs);
  1502. case FUSE_NOTIFY_DELETE:
  1503. return fuse_notify_delete(fc, size, cs);
  1504. default:
  1505. fuse_copy_finish(cs);
  1506. return -EINVAL;
  1507. }
  1508. }
  1509. /* Look up request on processing list by unique ID */
  1510. static struct fuse_req *request_find(struct fuse_conn *fc, u64 unique)
  1511. {
  1512. struct fuse_req *req;
  1513. list_for_each_entry(req, &fc->processing, list) {
  1514. if (req->in.h.unique == unique || req->intr_unique == unique)
  1515. return req;
  1516. }
  1517. return NULL;
  1518. }
  1519. static int copy_out_args(struct fuse_copy_state *cs, struct fuse_out *out,
  1520. unsigned nbytes)
  1521. {
  1522. unsigned reqsize = sizeof(struct fuse_out_header);
  1523. if (out->h.error)
  1524. return nbytes != reqsize ? -EINVAL : 0;
  1525. reqsize += len_args(out->numargs, out->args);
  1526. if (reqsize < nbytes || (reqsize > nbytes && !out->argvar))
  1527. return -EINVAL;
  1528. else if (reqsize > nbytes) {
  1529. struct fuse_arg *lastarg = &out->args[out->numargs-1];
  1530. unsigned diffsize = reqsize - nbytes;
  1531. if (diffsize > lastarg->size)
  1532. return -EINVAL;
  1533. lastarg->size -= diffsize;
  1534. }
  1535. return fuse_copy_args(cs, out->numargs, out->argpages, out->args,
  1536. out->page_zeroing);
  1537. }
  1538. /*
  1539. * Write a single reply to a request. First the header is copied from
  1540. * the write buffer. The request is then searched on the processing
  1541. * list by the unique ID found in the header. If found, then remove
  1542. * it from the list and copy the rest of the buffer to the request.
  1543. * The request is finished by calling request_end()
  1544. */
  1545. static ssize_t fuse_dev_do_write(struct fuse_conn *fc,
  1546. struct fuse_copy_state *cs, size_t nbytes)
  1547. {
  1548. int err;
  1549. struct fuse_req *req;
  1550. struct fuse_out_header oh;
  1551. if (nbytes < sizeof(struct fuse_out_header))
  1552. return -EINVAL;
  1553. err = fuse_copy_one(cs, &oh, sizeof(oh));
  1554. if (err)
  1555. goto err_finish;
  1556. err = -EINVAL;
  1557. if (oh.len != nbytes)
  1558. goto err_finish;
  1559. /*
  1560. * Zero oh.unique indicates unsolicited notification message
  1561. * and error contains notification code.
  1562. */
  1563. if (!oh.unique) {
  1564. err = fuse_notify(fc, oh.error, nbytes - sizeof(oh), cs);
  1565. return err ? err : nbytes;
  1566. }
  1567. err = -EINVAL;
  1568. if (oh.error <= -1000 || oh.error > 0)
  1569. goto err_finish;
  1570. spin_lock(&fc->lock);
  1571. err = -ENOENT;
  1572. if (!fc->connected)
  1573. goto err_unlock;
  1574. req = request_find(fc, oh.unique);
  1575. if (!req)
  1576. goto err_unlock;
  1577. if (req->aborted) {
  1578. spin_unlock(&fc->lock);
  1579. fuse_copy_finish(cs);
  1580. spin_lock(&fc->lock);
  1581. request_end(fc, req);
  1582. return -ENOENT;
  1583. }
  1584. /* Is it an interrupt reply? */
  1585. if (req->intr_unique == oh.unique) {
  1586. err = -EINVAL;
  1587. if (nbytes != sizeof(struct fuse_out_header))
  1588. goto err_unlock;
  1589. if (oh.error == -ENOSYS)
  1590. fc->no_interrupt = 1;
  1591. else if (oh.error == -EAGAIN)
  1592. queue_interrupt(fc, req);
  1593. spin_unlock(&fc->lock);
  1594. fuse_copy_finish(cs);
  1595. return nbytes;
  1596. }
  1597. req->state = FUSE_REQ_WRITING;
  1598. list_move(&req->list, &fc->io);
  1599. req->out.h = oh;
  1600. req->locked = 1;
  1601. cs->req = req;
  1602. if (!req->out.page_replace)
  1603. cs->move_pages = 0;
  1604. spin_unlock(&fc->lock);
  1605. err = copy_out_args(cs, &req->out, nbytes);
  1606. fuse_copy_finish(cs);
  1607. spin_lock(&fc->lock);
  1608. req->locked = 0;
  1609. if (!err) {
  1610. if (req->aborted)
  1611. err = -ENOENT;
  1612. } else if (!req->aborted)
  1613. req->out.h.error = -EIO;
  1614. request_end(fc, req);
  1615. return err ? err : nbytes;
  1616. err_unlock:
  1617. spin_unlock(&fc->lock);
  1618. err_finish:
  1619. fuse_copy_finish(cs);
  1620. return err;
  1621. }
  1622. static ssize_t fuse_dev_write(struct kiocb *iocb, const struct iovec *iov,
  1623. unsigned long nr_segs, loff_t pos)
  1624. {
  1625. struct fuse_copy_state cs;
  1626. struct fuse_conn *fc = fuse_get_conn(iocb->ki_filp);
  1627. if (!fc)
  1628. return -EPERM;
  1629. fuse_copy_init(&cs, fc, 0, iov, nr_segs);
  1630. return fuse_dev_do_write(fc, &cs, iov_length(iov, nr_segs));
  1631. }
  1632. static ssize_t fuse_dev_splice_write(struct pipe_inode_info *pipe,
  1633. struct file *out, loff_t *ppos,
  1634. size_t len, unsigned int flags)
  1635. {
  1636. unsigned nbuf;
  1637. unsigned idx;
  1638. struct pipe_buffer *bufs;
  1639. struct fuse_copy_state cs;
  1640. struct fuse_conn *fc;
  1641. size_t rem;
  1642. ssize_t ret;
  1643. fc = fuse_get_conn(out);
  1644. if (!fc)
  1645. return -EPERM;
  1646. bufs = kmalloc(pipe->buffers * sizeof(struct pipe_buffer), GFP_KERNEL);
  1647. if (!bufs)
  1648. return -ENOMEM;
  1649. pipe_lock(pipe);
  1650. nbuf = 0;
  1651. rem = 0;
  1652. for (idx = 0; idx < pipe->nrbufs && rem < len; idx++)
  1653. rem += pipe->bufs[(pipe->curbuf + idx) & (pipe->buffers - 1)].len;
  1654. ret = -EINVAL;
  1655. if (rem < len) {
  1656. pipe_unlock(pipe);
  1657. goto out;
  1658. }
  1659. rem = len;
  1660. while (rem) {
  1661. struct pipe_buffer *ibuf;
  1662. struct pipe_buffer *obuf;
  1663. BUG_ON(nbuf >= pipe->buffers);
  1664. BUG_ON(!pipe->nrbufs);
  1665. ibuf = &pipe->bufs[pipe->curbuf];
  1666. obuf = &bufs[nbuf];
  1667. if (rem >= ibuf->len) {
  1668. *obuf = *ibuf;
  1669. ibuf->ops = NULL;
  1670. pipe->curbuf = (pipe->curbuf + 1) & (pipe->buffers - 1);
  1671. pipe->nrbufs--;
  1672. } else {
  1673. ibuf->ops->get(pipe, ibuf);
  1674. *obuf = *ibuf;
  1675. obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
  1676. obuf->len = rem;
  1677. ibuf->offset += obuf->len;
  1678. ibuf->len -= obuf->len;
  1679. }
  1680. nbuf++;
  1681. rem -= obuf->len;
  1682. }
  1683. pipe_unlock(pipe);
  1684. fuse_copy_init(&cs, fc, 0, NULL, nbuf);
  1685. cs.pipebufs = bufs;
  1686. cs.pipe = pipe;
  1687. if (flags & SPLICE_F_MOVE)
  1688. cs.move_pages = 1;
  1689. ret = fuse_dev_do_write(fc, &cs, len);
  1690. for (idx = 0; idx < nbuf; idx++) {
  1691. struct pipe_buffer *buf = &bufs[idx];
  1692. buf->ops->release(pipe, buf);
  1693. }
  1694. out:
  1695. kfree(bufs);
  1696. return ret;
  1697. }
  1698. static unsigned fuse_dev_poll(struct file *file, poll_table *wait)
  1699. {
  1700. unsigned mask = POLLOUT | POLLWRNORM;
  1701. struct fuse_conn *fc = fuse_get_conn(file);
  1702. if (!fc)
  1703. return POLLERR;
  1704. poll_wait(file, &fc->waitq, wait);
  1705. spin_lock(&fc->lock);
  1706. if (!fc->connected)
  1707. mask = POLLERR;
  1708. else if (request_pending(fc))
  1709. mask |= POLLIN | POLLRDNORM;
  1710. spin_unlock(&fc->lock);
  1711. return mask;
  1712. }
  1713. /*
  1714. * Abort all requests on the given list (pending or processing)
  1715. *
  1716. * This function releases and reacquires fc->lock
  1717. */
  1718. static void end_requests(struct fuse_conn *fc, struct list_head *head)
  1719. __releases(fc->lock)
  1720. __acquires(fc->lock)
  1721. {
  1722. while (!list_empty(head)) {
  1723. struct fuse_req *req;
  1724. req = list_entry(head->next, struct fuse_req, list);
  1725. req->out.h.error = -ECONNABORTED;
  1726. request_end(fc, req);
  1727. spin_lock(&fc->lock);
  1728. }
  1729. }
  1730. /*
  1731. * Abort requests under I/O
  1732. *
  1733. * The requests are set to aborted and finished, and the request
  1734. * waiter is woken up. This will make request_wait_answer() wait
  1735. * until the request is unlocked and then return.
  1736. *
  1737. * If the request is asynchronous, then the end function needs to be
  1738. * called after waiting for the request to be unlocked (if it was
  1739. * locked).
  1740. */
  1741. static void end_io_requests(struct fuse_conn *fc)
  1742. __releases(fc->lock)
  1743. __acquires(fc->lock)
  1744. {
  1745. while (!list_empty(&fc->io)) {
  1746. struct fuse_req *req =
  1747. list_entry(fc->io.next, struct fuse_req, list);
  1748. void (*end) (struct fuse_conn *, struct fuse_req *) = req->end;
  1749. req->aborted = 1;
  1750. req->out.h.error = -ECONNABORTED;
  1751. req->state = FUSE_REQ_FINISHED;
  1752. list_del_init(&req->list);
  1753. wake_up(&req->waitq);
  1754. if (end) {
  1755. req->end = NULL;
  1756. __fuse_get_request(req);
  1757. spin_unlock(&fc->lock);
  1758. wait_event(req->waitq, !req->locked);
  1759. end(fc, req);
  1760. fuse_put_request(fc, req);
  1761. spin_lock(&fc->lock);
  1762. }
  1763. }
  1764. }
  1765. static void end_queued_requests(struct fuse_conn *fc)
  1766. __releases(fc->lock)
  1767. __acquires(fc->lock)
  1768. {
  1769. fc->max_background = UINT_MAX;
  1770. flush_bg_queue(fc);
  1771. end_requests(fc, &fc->pending);
  1772. end_requests(fc, &fc->processing);
  1773. while (forget_pending(fc))
  1774. kfree(dequeue_forget(fc, 1, NULL));
  1775. }
  1776. static void end_polls(struct fuse_conn *fc)
  1777. {
  1778. struct rb_node *p;
  1779. p = rb_first(&fc->polled_files);
  1780. while (p) {
  1781. struct fuse_file *ff;
  1782. ff = rb_entry(p, struct fuse_file, polled_node);
  1783. wake_up_interruptible_all(&ff->poll_wait);
  1784. p = rb_next(p);
  1785. }
  1786. }
  1787. /*
  1788. * Abort all requests.
  1789. *
  1790. * Emergency exit in case of a malicious or accidental deadlock, or
  1791. * just a hung filesystem.
  1792. *
  1793. * The same effect is usually achievable through killing the
  1794. * filesystem daemon and all users of the filesystem. The exception
  1795. * is the combination of an asynchronous request and the tricky
  1796. * deadlock (see Documentation/filesystems/fuse.txt).
  1797. *
  1798. * During the aborting, progression of requests from the pending and
  1799. * processing lists onto the io list, and progression of new requests
  1800. * onto the pending list is prevented by req->connected being false.
  1801. *
  1802. * Progression of requests under I/O to the processing list is
  1803. * prevented by the req->aborted flag being true for these requests.
  1804. * For this reason requests on the io list must be aborted first.
  1805. */
  1806. void fuse_abort_conn(struct fuse_conn *fc)
  1807. {
  1808. spin_lock(&fc->lock);
  1809. if (fc->connected) {
  1810. fc->connected = 0;
  1811. fc->blocked = 0;
  1812. fc->initialized = 1;
  1813. end_io_requests(fc);
  1814. end_queued_requests(fc);
  1815. end_polls(fc);
  1816. wake_up_all(&fc->waitq);
  1817. wake_up_all(&fc->blocked_waitq);
  1818. kill_fasync(&fc->fasync, SIGIO, POLL_IN);
  1819. }
  1820. spin_unlock(&fc->lock);
  1821. }
  1822. EXPORT_SYMBOL_GPL(fuse_abort_conn);
  1823. int fuse_dev_release(struct inode *inode, struct file *file)
  1824. {
  1825. struct fuse_conn *fc = fuse_get_conn(file);
  1826. if (fc) {
  1827. spin_lock(&fc->lock);
  1828. fc->connected = 0;
  1829. fc->blocked = 0;
  1830. fc->initialized = 1;
  1831. end_queued_requests(fc);
  1832. end_polls(fc);
  1833. wake_up_all(&fc->blocked_waitq);
  1834. spin_unlock(&fc->lock);
  1835. fuse_conn_put(fc);
  1836. }
  1837. return 0;
  1838. }
  1839. EXPORT_SYMBOL_GPL(fuse_dev_release);
  1840. static int fuse_dev_fasync(int fd, struct file *file, int on)
  1841. {
  1842. struct fuse_conn *fc = fuse_get_conn(file);
  1843. if (!fc)
  1844. return -EPERM;
  1845. /* No locking - fasync_helper does its own locking */
  1846. return fasync_helper(fd, file, on, &fc->fasync);
  1847. }
  1848. const struct file_operations fuse_dev_operations = {
  1849. .owner = THIS_MODULE,
  1850. .llseek = no_llseek,
  1851. .read = do_sync_read,
  1852. .aio_read = fuse_dev_read,
  1853. .splice_read = fuse_dev_splice_read,
  1854. .write = do_sync_write,
  1855. .aio_write = fuse_dev_write,
  1856. .splice_write = fuse_dev_splice_write,
  1857. .poll = fuse_dev_poll,
  1858. .release = fuse_dev_release,
  1859. .fasync = fuse_dev_fasync,
  1860. };
  1861. EXPORT_SYMBOL_GPL(fuse_dev_operations);
  1862. static struct miscdevice fuse_miscdevice = {
  1863. .minor = FUSE_MINOR,
  1864. .name = "fuse",
  1865. .fops = &fuse_dev_operations,
  1866. };
  1867. int __init fuse_dev_init(void)
  1868. {
  1869. int err = -ENOMEM;
  1870. fuse_req_cachep = kmem_cache_create("fuse_request",
  1871. sizeof(struct fuse_req),
  1872. 0, 0, NULL);
  1873. if (!fuse_req_cachep)
  1874. goto out;
  1875. err = misc_register(&fuse_miscdevice);
  1876. if (err)
  1877. goto out_cache_clean;
  1878. return 0;
  1879. out_cache_clean:
  1880. kmem_cache_destroy(fuse_req_cachep);
  1881. out:
  1882. return err;
  1883. }
  1884. void fuse_dev_cleanup(void)
  1885. {
  1886. misc_deregister(&fuse_miscdevice);
  1887. kmem_cache_destroy(fuse_req_cachep);
  1888. }