dev.c 53 KB

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