dev.c 51 KB

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