dev.c 47 KB

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