dev.c 51 KB

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