dev.c 51 KB

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