dev.c 49 KB

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