dev.c 49 KB

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