dev.c 51 KB

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