dev.c 48 KB

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