dev.c 49 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206
  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. void *mapaddr;
  564. void *buf;
  565. unsigned len;
  566. unsigned move_pages:1;
  567. };
  568. static void fuse_copy_init(struct fuse_copy_state *cs, struct fuse_conn *fc,
  569. int write,
  570. const struct iovec *iov, unsigned long nr_segs)
  571. {
  572. memset(cs, 0, sizeof(*cs));
  573. cs->fc = fc;
  574. cs->write = write;
  575. cs->iov = iov;
  576. cs->nr_segs = nr_segs;
  577. }
  578. /* Unmap and put previous page of userspace buffer */
  579. static void fuse_copy_finish(struct fuse_copy_state *cs)
  580. {
  581. if (cs->currbuf) {
  582. struct pipe_buffer *buf = cs->currbuf;
  583. if (!cs->write) {
  584. buf->ops->unmap(cs->pipe, buf, cs->mapaddr);
  585. } else {
  586. kunmap(buf->page);
  587. buf->len = PAGE_SIZE - cs->len;
  588. }
  589. cs->currbuf = NULL;
  590. cs->mapaddr = NULL;
  591. } else if (cs->mapaddr) {
  592. kunmap(cs->pg);
  593. if (cs->write) {
  594. flush_dcache_page(cs->pg);
  595. set_page_dirty_lock(cs->pg);
  596. }
  597. put_page(cs->pg);
  598. cs->mapaddr = NULL;
  599. }
  600. }
  601. /*
  602. * Get another pagefull of userspace buffer, and map it to kernel
  603. * address space, and lock request
  604. */
  605. static int fuse_copy_fill(struct fuse_copy_state *cs)
  606. {
  607. unsigned long offset;
  608. int err;
  609. unlock_request(cs->fc, cs->req);
  610. fuse_copy_finish(cs);
  611. if (cs->pipebufs) {
  612. struct pipe_buffer *buf = cs->pipebufs;
  613. if (!cs->write) {
  614. err = buf->ops->confirm(cs->pipe, buf);
  615. if (err)
  616. return err;
  617. BUG_ON(!cs->nr_segs);
  618. cs->currbuf = buf;
  619. cs->mapaddr = buf->ops->map(cs->pipe, buf, 0);
  620. cs->len = buf->len;
  621. cs->buf = cs->mapaddr + buf->offset;
  622. cs->pipebufs++;
  623. cs->nr_segs--;
  624. } else {
  625. struct page *page;
  626. if (cs->nr_segs == cs->pipe->buffers)
  627. return -EIO;
  628. page = alloc_page(GFP_HIGHUSER);
  629. if (!page)
  630. return -ENOMEM;
  631. buf->page = page;
  632. buf->offset = 0;
  633. buf->len = 0;
  634. cs->currbuf = buf;
  635. cs->mapaddr = kmap(page);
  636. cs->buf = cs->mapaddr;
  637. cs->len = PAGE_SIZE;
  638. cs->pipebufs++;
  639. cs->nr_segs++;
  640. }
  641. } else {
  642. if (!cs->seglen) {
  643. BUG_ON(!cs->nr_segs);
  644. cs->seglen = cs->iov[0].iov_len;
  645. cs->addr = (unsigned long) cs->iov[0].iov_base;
  646. cs->iov++;
  647. cs->nr_segs--;
  648. }
  649. err = get_user_pages_fast(cs->addr, 1, cs->write, &cs->pg);
  650. if (err < 0)
  651. return err;
  652. BUG_ON(err != 1);
  653. offset = cs->addr % PAGE_SIZE;
  654. cs->mapaddr = kmap(cs->pg);
  655. cs->buf = cs->mapaddr + offset;
  656. cs->len = min(PAGE_SIZE - offset, cs->seglen);
  657. cs->seglen -= cs->len;
  658. cs->addr += cs->len;
  659. }
  660. return lock_request(cs->fc, cs->req);
  661. }
  662. /* Do as much copy to/from userspace buffer as we can */
  663. static int fuse_copy_do(struct fuse_copy_state *cs, void **val, unsigned *size)
  664. {
  665. unsigned ncpy = min(*size, cs->len);
  666. if (val) {
  667. if (cs->write)
  668. memcpy(cs->buf, *val, ncpy);
  669. else
  670. memcpy(*val, cs->buf, ncpy);
  671. *val += ncpy;
  672. }
  673. *size -= ncpy;
  674. cs->len -= ncpy;
  675. cs->buf += ncpy;
  676. return ncpy;
  677. }
  678. static int fuse_check_page(struct page *page)
  679. {
  680. if (page_mapcount(page) ||
  681. page->mapping != NULL ||
  682. page_count(page) != 1 ||
  683. (page->flags & PAGE_FLAGS_CHECK_AT_PREP &
  684. ~(1 << PG_locked |
  685. 1 << PG_referenced |
  686. 1 << PG_uptodate |
  687. 1 << PG_lru |
  688. 1 << PG_active |
  689. 1 << PG_reclaim))) {
  690. printk(KERN_WARNING "fuse: trying to steal weird page\n");
  691. 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);
  692. return 1;
  693. }
  694. return 0;
  695. }
  696. static int fuse_try_move_page(struct fuse_copy_state *cs, struct page **pagep)
  697. {
  698. int err;
  699. struct page *oldpage = *pagep;
  700. struct page *newpage;
  701. struct pipe_buffer *buf = cs->pipebufs;
  702. unlock_request(cs->fc, cs->req);
  703. fuse_copy_finish(cs);
  704. err = buf->ops->confirm(cs->pipe, buf);
  705. if (err)
  706. return err;
  707. BUG_ON(!cs->nr_segs);
  708. cs->currbuf = buf;
  709. cs->len = buf->len;
  710. cs->pipebufs++;
  711. cs->nr_segs--;
  712. if (cs->len != PAGE_SIZE)
  713. goto out_fallback;
  714. if (buf->ops->steal(cs->pipe, buf) != 0)
  715. goto out_fallback;
  716. newpage = buf->page;
  717. if (WARN_ON(!PageUptodate(newpage)))
  718. return -EIO;
  719. ClearPageMappedToDisk(newpage);
  720. if (fuse_check_page(newpage) != 0)
  721. goto out_fallback_unlock;
  722. /*
  723. * This is a new and locked page, it shouldn't be mapped or
  724. * have any special flags on it
  725. */
  726. if (WARN_ON(page_mapped(oldpage)))
  727. goto out_fallback_unlock;
  728. if (WARN_ON(page_has_private(oldpage)))
  729. goto out_fallback_unlock;
  730. if (WARN_ON(PageDirty(oldpage) || PageWriteback(oldpage)))
  731. goto out_fallback_unlock;
  732. if (WARN_ON(PageMlocked(oldpage)))
  733. goto out_fallback_unlock;
  734. err = replace_page_cache_page(oldpage, newpage, GFP_KERNEL);
  735. if (err) {
  736. unlock_page(newpage);
  737. return err;
  738. }
  739. page_cache_get(newpage);
  740. if (!(buf->flags & PIPE_BUF_FLAG_LRU))
  741. lru_cache_add_file(newpage);
  742. err = 0;
  743. spin_lock(&cs->fc->lock);
  744. if (cs->req->aborted)
  745. err = -ENOENT;
  746. else
  747. *pagep = newpage;
  748. spin_unlock(&cs->fc->lock);
  749. if (err) {
  750. unlock_page(newpage);
  751. page_cache_release(newpage);
  752. return err;
  753. }
  754. unlock_page(oldpage);
  755. page_cache_release(oldpage);
  756. cs->len = 0;
  757. return 0;
  758. out_fallback_unlock:
  759. unlock_page(newpage);
  760. out_fallback:
  761. cs->mapaddr = buf->ops->map(cs->pipe, buf, 1);
  762. cs->buf = cs->mapaddr + buf->offset;
  763. err = lock_request(cs->fc, cs->req);
  764. if (err)
  765. return err;
  766. return 1;
  767. }
  768. static int fuse_ref_page(struct fuse_copy_state *cs, struct page *page,
  769. unsigned offset, unsigned count)
  770. {
  771. struct pipe_buffer *buf;
  772. if (cs->nr_segs == cs->pipe->buffers)
  773. return -EIO;
  774. unlock_request(cs->fc, cs->req);
  775. fuse_copy_finish(cs);
  776. buf = cs->pipebufs;
  777. page_cache_get(page);
  778. buf->page = page;
  779. buf->offset = offset;
  780. buf->len = count;
  781. cs->pipebufs++;
  782. cs->nr_segs++;
  783. cs->len = 0;
  784. return 0;
  785. }
  786. /*
  787. * Copy a page in the request to/from the userspace buffer. Must be
  788. * done atomically
  789. */
  790. static int fuse_copy_page(struct fuse_copy_state *cs, struct page **pagep,
  791. unsigned offset, unsigned count, int zeroing)
  792. {
  793. int err;
  794. struct page *page = *pagep;
  795. if (page && zeroing && count < PAGE_SIZE)
  796. clear_highpage(page);
  797. while (count) {
  798. if (cs->write && cs->pipebufs && page) {
  799. return fuse_ref_page(cs, page, offset, count);
  800. } else if (!cs->len) {
  801. if (cs->move_pages && page &&
  802. offset == 0 && count == PAGE_SIZE) {
  803. err = fuse_try_move_page(cs, pagep);
  804. if (err <= 0)
  805. return err;
  806. } else {
  807. err = fuse_copy_fill(cs);
  808. if (err)
  809. return err;
  810. }
  811. }
  812. if (page) {
  813. void *mapaddr = kmap_atomic(page);
  814. void *buf = mapaddr + offset;
  815. offset += fuse_copy_do(cs, &buf, &count);
  816. kunmap_atomic(mapaddr);
  817. } else
  818. offset += fuse_copy_do(cs, NULL, &count);
  819. }
  820. if (page && !cs->write)
  821. flush_dcache_page(page);
  822. return 0;
  823. }
  824. /* Copy pages in the request to/from userspace buffer */
  825. static int fuse_copy_pages(struct fuse_copy_state *cs, unsigned nbytes,
  826. int zeroing)
  827. {
  828. unsigned i;
  829. struct fuse_req *req = cs->req;
  830. for (i = 0; i < req->num_pages && (nbytes || zeroing); i++) {
  831. int err;
  832. unsigned offset = req->page_descs[i].offset;
  833. unsigned count = min(nbytes, req->page_descs[i].length);
  834. err = fuse_copy_page(cs, &req->pages[i], offset, count,
  835. zeroing);
  836. if (err)
  837. return err;
  838. nbytes -= count;
  839. }
  840. return 0;
  841. }
  842. /* Copy a single argument in the request to/from userspace buffer */
  843. static int fuse_copy_one(struct fuse_copy_state *cs, void *val, unsigned size)
  844. {
  845. while (size) {
  846. if (!cs->len) {
  847. int err = fuse_copy_fill(cs);
  848. if (err)
  849. return err;
  850. }
  851. fuse_copy_do(cs, &val, &size);
  852. }
  853. return 0;
  854. }
  855. /* Copy request arguments to/from userspace buffer */
  856. static int fuse_copy_args(struct fuse_copy_state *cs, unsigned numargs,
  857. unsigned argpages, struct fuse_arg *args,
  858. int zeroing)
  859. {
  860. int err = 0;
  861. unsigned i;
  862. for (i = 0; !err && i < numargs; i++) {
  863. struct fuse_arg *arg = &args[i];
  864. if (i == numargs - 1 && argpages)
  865. err = fuse_copy_pages(cs, arg->size, zeroing);
  866. else
  867. err = fuse_copy_one(cs, arg->value, arg->size);
  868. }
  869. return err;
  870. }
  871. static int forget_pending(struct fuse_conn *fc)
  872. {
  873. return fc->forget_list_head.next != NULL;
  874. }
  875. static int request_pending(struct fuse_conn *fc)
  876. {
  877. return !list_empty(&fc->pending) || !list_empty(&fc->interrupts) ||
  878. forget_pending(fc);
  879. }
  880. /* Wait until a request is available on the pending list */
  881. static void request_wait(struct fuse_conn *fc)
  882. __releases(fc->lock)
  883. __acquires(fc->lock)
  884. {
  885. DECLARE_WAITQUEUE(wait, current);
  886. add_wait_queue_exclusive(&fc->waitq, &wait);
  887. while (fc->connected && !request_pending(fc)) {
  888. set_current_state(TASK_INTERRUPTIBLE);
  889. if (signal_pending(current))
  890. break;
  891. spin_unlock(&fc->lock);
  892. schedule();
  893. spin_lock(&fc->lock);
  894. }
  895. set_current_state(TASK_RUNNING);
  896. remove_wait_queue(&fc->waitq, &wait);
  897. }
  898. /*
  899. * Transfer an interrupt request to userspace
  900. *
  901. * Unlike other requests this is assembled on demand, without a need
  902. * to allocate a separate fuse_req structure.
  903. *
  904. * Called with fc->lock held, releases it
  905. */
  906. static int fuse_read_interrupt(struct fuse_conn *fc, struct fuse_copy_state *cs,
  907. size_t nbytes, struct fuse_req *req)
  908. __releases(fc->lock)
  909. {
  910. struct fuse_in_header ih;
  911. struct fuse_interrupt_in arg;
  912. unsigned reqsize = sizeof(ih) + sizeof(arg);
  913. int err;
  914. list_del_init(&req->intr_entry);
  915. req->intr_unique = fuse_get_unique(fc);
  916. memset(&ih, 0, sizeof(ih));
  917. memset(&arg, 0, sizeof(arg));
  918. ih.len = reqsize;
  919. ih.opcode = FUSE_INTERRUPT;
  920. ih.unique = req->intr_unique;
  921. arg.unique = req->in.h.unique;
  922. spin_unlock(&fc->lock);
  923. if (nbytes < reqsize)
  924. return -EINVAL;
  925. err = fuse_copy_one(cs, &ih, sizeof(ih));
  926. if (!err)
  927. err = fuse_copy_one(cs, &arg, sizeof(arg));
  928. fuse_copy_finish(cs);
  929. return err ? err : reqsize;
  930. }
  931. static struct fuse_forget_link *dequeue_forget(struct fuse_conn *fc,
  932. unsigned max,
  933. unsigned *countp)
  934. {
  935. struct fuse_forget_link *head = fc->forget_list_head.next;
  936. struct fuse_forget_link **newhead = &head;
  937. unsigned count;
  938. for (count = 0; *newhead != NULL && count < max; count++)
  939. newhead = &(*newhead)->next;
  940. fc->forget_list_head.next = *newhead;
  941. *newhead = NULL;
  942. if (fc->forget_list_head.next == NULL)
  943. fc->forget_list_tail = &fc->forget_list_head;
  944. if (countp != NULL)
  945. *countp = count;
  946. return head;
  947. }
  948. static int fuse_read_single_forget(struct fuse_conn *fc,
  949. struct fuse_copy_state *cs,
  950. size_t nbytes)
  951. __releases(fc->lock)
  952. {
  953. int err;
  954. struct fuse_forget_link *forget = dequeue_forget(fc, 1, NULL);
  955. struct fuse_forget_in arg = {
  956. .nlookup = forget->forget_one.nlookup,
  957. };
  958. struct fuse_in_header ih = {
  959. .opcode = FUSE_FORGET,
  960. .nodeid = forget->forget_one.nodeid,
  961. .unique = fuse_get_unique(fc),
  962. .len = sizeof(ih) + sizeof(arg),
  963. };
  964. spin_unlock(&fc->lock);
  965. kfree(forget);
  966. if (nbytes < ih.len)
  967. return -EINVAL;
  968. err = fuse_copy_one(cs, &ih, sizeof(ih));
  969. if (!err)
  970. err = fuse_copy_one(cs, &arg, sizeof(arg));
  971. fuse_copy_finish(cs);
  972. if (err)
  973. return err;
  974. return ih.len;
  975. }
  976. static int fuse_read_batch_forget(struct fuse_conn *fc,
  977. struct fuse_copy_state *cs, size_t nbytes)
  978. __releases(fc->lock)
  979. {
  980. int err;
  981. unsigned max_forgets;
  982. unsigned count;
  983. struct fuse_forget_link *head;
  984. struct fuse_batch_forget_in arg = { .count = 0 };
  985. struct fuse_in_header ih = {
  986. .opcode = FUSE_BATCH_FORGET,
  987. .unique = fuse_get_unique(fc),
  988. .len = sizeof(ih) + sizeof(arg),
  989. };
  990. if (nbytes < ih.len) {
  991. spin_unlock(&fc->lock);
  992. return -EINVAL;
  993. }
  994. max_forgets = (nbytes - ih.len) / sizeof(struct fuse_forget_one);
  995. head = dequeue_forget(fc, max_forgets, &count);
  996. spin_unlock(&fc->lock);
  997. arg.count = count;
  998. ih.len += count * sizeof(struct fuse_forget_one);
  999. err = fuse_copy_one(cs, &ih, sizeof(ih));
  1000. if (!err)
  1001. err = fuse_copy_one(cs, &arg, sizeof(arg));
  1002. while (head) {
  1003. struct fuse_forget_link *forget = head;
  1004. if (!err) {
  1005. err = fuse_copy_one(cs, &forget->forget_one,
  1006. sizeof(forget->forget_one));
  1007. }
  1008. head = forget->next;
  1009. kfree(forget);
  1010. }
  1011. fuse_copy_finish(cs);
  1012. if (err)
  1013. return err;
  1014. return ih.len;
  1015. }
  1016. static int fuse_read_forget(struct fuse_conn *fc, struct fuse_copy_state *cs,
  1017. size_t nbytes)
  1018. __releases(fc->lock)
  1019. {
  1020. if (fc->minor < 16 || fc->forget_list_head.next->next == NULL)
  1021. return fuse_read_single_forget(fc, cs, nbytes);
  1022. else
  1023. return fuse_read_batch_forget(fc, cs, nbytes);
  1024. }
  1025. /*
  1026. * Read a single request into the userspace filesystem's buffer. This
  1027. * function waits until a request is available, then removes it from
  1028. * the pending list and copies request data to userspace buffer. If
  1029. * no reply is needed (FORGET) or request has been aborted or there
  1030. * was an error during the copying then it's finished by calling
  1031. * request_end(). Otherwise add it to the processing list, and set
  1032. * the 'sent' flag.
  1033. */
  1034. static ssize_t fuse_dev_do_read(struct fuse_conn *fc, struct file *file,
  1035. struct fuse_copy_state *cs, size_t nbytes)
  1036. {
  1037. int err;
  1038. struct fuse_req *req;
  1039. struct fuse_in *in;
  1040. unsigned reqsize;
  1041. restart:
  1042. spin_lock(&fc->lock);
  1043. err = -EAGAIN;
  1044. if ((file->f_flags & O_NONBLOCK) && fc->connected &&
  1045. !request_pending(fc))
  1046. goto err_unlock;
  1047. request_wait(fc);
  1048. err = -ENODEV;
  1049. if (!fc->connected)
  1050. goto err_unlock;
  1051. err = -ERESTARTSYS;
  1052. if (!request_pending(fc))
  1053. goto err_unlock;
  1054. if (!list_empty(&fc->interrupts)) {
  1055. req = list_entry(fc->interrupts.next, struct fuse_req,
  1056. intr_entry);
  1057. return fuse_read_interrupt(fc, cs, nbytes, req);
  1058. }
  1059. if (forget_pending(fc)) {
  1060. if (list_empty(&fc->pending) || fc->forget_batch-- > 0)
  1061. return fuse_read_forget(fc, cs, nbytes);
  1062. if (fc->forget_batch <= -8)
  1063. fc->forget_batch = 16;
  1064. }
  1065. req = list_entry(fc->pending.next, struct fuse_req, list);
  1066. req->state = FUSE_REQ_READING;
  1067. list_move(&req->list, &fc->io);
  1068. in = &req->in;
  1069. reqsize = in->h.len;
  1070. /* If request is too large, reply with an error and restart the read */
  1071. if (nbytes < reqsize) {
  1072. req->out.h.error = -EIO;
  1073. /* SETXATTR is special, since it may contain too large data */
  1074. if (in->h.opcode == FUSE_SETXATTR)
  1075. req->out.h.error = -E2BIG;
  1076. request_end(fc, req);
  1077. goto restart;
  1078. }
  1079. spin_unlock(&fc->lock);
  1080. cs->req = req;
  1081. err = fuse_copy_one(cs, &in->h, sizeof(in->h));
  1082. if (!err)
  1083. err = fuse_copy_args(cs, in->numargs, in->argpages,
  1084. (struct fuse_arg *) in->args, 0);
  1085. fuse_copy_finish(cs);
  1086. spin_lock(&fc->lock);
  1087. req->locked = 0;
  1088. if (req->aborted) {
  1089. request_end(fc, req);
  1090. return -ENODEV;
  1091. }
  1092. if (err) {
  1093. req->out.h.error = -EIO;
  1094. request_end(fc, req);
  1095. return err;
  1096. }
  1097. if (!req->isreply)
  1098. request_end(fc, req);
  1099. else {
  1100. req->state = FUSE_REQ_SENT;
  1101. list_move_tail(&req->list, &fc->processing);
  1102. if (req->interrupted)
  1103. queue_interrupt(fc, req);
  1104. spin_unlock(&fc->lock);
  1105. }
  1106. return reqsize;
  1107. err_unlock:
  1108. spin_unlock(&fc->lock);
  1109. return err;
  1110. }
  1111. static ssize_t fuse_dev_read(struct kiocb *iocb, const struct iovec *iov,
  1112. unsigned long nr_segs, loff_t pos)
  1113. {
  1114. struct fuse_copy_state cs;
  1115. struct file *file = iocb->ki_filp;
  1116. struct fuse_conn *fc = fuse_get_conn(file);
  1117. if (!fc)
  1118. return -EPERM;
  1119. fuse_copy_init(&cs, fc, 1, iov, nr_segs);
  1120. return fuse_dev_do_read(fc, file, &cs, iov_length(iov, nr_segs));
  1121. }
  1122. static int fuse_dev_pipe_buf_steal(struct pipe_inode_info *pipe,
  1123. struct pipe_buffer *buf)
  1124. {
  1125. return 1;
  1126. }
  1127. static const struct pipe_buf_operations fuse_dev_pipe_buf_ops = {
  1128. .can_merge = 0,
  1129. .map = generic_pipe_buf_map,
  1130. .unmap = generic_pipe_buf_unmap,
  1131. .confirm = generic_pipe_buf_confirm,
  1132. .release = generic_pipe_buf_release,
  1133. .steal = fuse_dev_pipe_buf_steal,
  1134. .get = generic_pipe_buf_get,
  1135. };
  1136. static ssize_t fuse_dev_splice_read(struct file *in, loff_t *ppos,
  1137. struct pipe_inode_info *pipe,
  1138. size_t len, unsigned int flags)
  1139. {
  1140. int ret;
  1141. int page_nr = 0;
  1142. int do_wakeup = 0;
  1143. struct pipe_buffer *bufs;
  1144. struct fuse_copy_state cs;
  1145. struct fuse_conn *fc = fuse_get_conn(in);
  1146. if (!fc)
  1147. return -EPERM;
  1148. bufs = kmalloc(pipe->buffers * sizeof(struct pipe_buffer), GFP_KERNEL);
  1149. if (!bufs)
  1150. return -ENOMEM;
  1151. fuse_copy_init(&cs, fc, 1, NULL, 0);
  1152. cs.pipebufs = bufs;
  1153. cs.pipe = pipe;
  1154. ret = fuse_dev_do_read(fc, in, &cs, len);
  1155. if (ret < 0)
  1156. goto out;
  1157. ret = 0;
  1158. pipe_lock(pipe);
  1159. if (!pipe->readers) {
  1160. send_sig(SIGPIPE, current, 0);
  1161. if (!ret)
  1162. ret = -EPIPE;
  1163. goto out_unlock;
  1164. }
  1165. if (pipe->nrbufs + cs.nr_segs > pipe->buffers) {
  1166. ret = -EIO;
  1167. goto out_unlock;
  1168. }
  1169. while (page_nr < cs.nr_segs) {
  1170. int newbuf = (pipe->curbuf + pipe->nrbufs) & (pipe->buffers - 1);
  1171. struct pipe_buffer *buf = pipe->bufs + newbuf;
  1172. buf->page = bufs[page_nr].page;
  1173. buf->offset = bufs[page_nr].offset;
  1174. buf->len = bufs[page_nr].len;
  1175. buf->ops = &fuse_dev_pipe_buf_ops;
  1176. pipe->nrbufs++;
  1177. page_nr++;
  1178. ret += buf->len;
  1179. if (pipe->files)
  1180. do_wakeup = 1;
  1181. }
  1182. out_unlock:
  1183. pipe_unlock(pipe);
  1184. if (do_wakeup) {
  1185. smp_mb();
  1186. if (waitqueue_active(&pipe->wait))
  1187. wake_up_interruptible(&pipe->wait);
  1188. kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
  1189. }
  1190. out:
  1191. for (; page_nr < cs.nr_segs; page_nr++)
  1192. page_cache_release(bufs[page_nr].page);
  1193. kfree(bufs);
  1194. return ret;
  1195. }
  1196. static int fuse_notify_poll(struct fuse_conn *fc, unsigned int size,
  1197. struct fuse_copy_state *cs)
  1198. {
  1199. struct fuse_notify_poll_wakeup_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. return fuse_notify_poll_wakeup(fc, &outarg);
  1208. err:
  1209. fuse_copy_finish(cs);
  1210. return err;
  1211. }
  1212. static int fuse_notify_inval_inode(struct fuse_conn *fc, unsigned int size,
  1213. struct fuse_copy_state *cs)
  1214. {
  1215. struct fuse_notify_inval_inode_out outarg;
  1216. int err = -EINVAL;
  1217. if (size != sizeof(outarg))
  1218. goto err;
  1219. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1220. if (err)
  1221. goto err;
  1222. fuse_copy_finish(cs);
  1223. down_read(&fc->killsb);
  1224. err = -ENOENT;
  1225. if (fc->sb) {
  1226. err = fuse_reverse_inval_inode(fc->sb, outarg.ino,
  1227. outarg.off, outarg.len);
  1228. }
  1229. up_read(&fc->killsb);
  1230. return err;
  1231. err:
  1232. fuse_copy_finish(cs);
  1233. return err;
  1234. }
  1235. static int fuse_notify_inval_entry(struct fuse_conn *fc, unsigned int size,
  1236. struct fuse_copy_state *cs)
  1237. {
  1238. struct fuse_notify_inval_entry_out outarg;
  1239. int err = -ENOMEM;
  1240. char *buf;
  1241. struct qstr name;
  1242. buf = kzalloc(FUSE_NAME_MAX + 1, GFP_KERNEL);
  1243. if (!buf)
  1244. goto err;
  1245. 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. err = -ENAMETOOLONG;
  1252. if (outarg.namelen > FUSE_NAME_MAX)
  1253. goto err;
  1254. err = -EINVAL;
  1255. if (size != sizeof(outarg) + outarg.namelen + 1)
  1256. goto err;
  1257. name.name = buf;
  1258. name.len = outarg.namelen;
  1259. err = fuse_copy_one(cs, buf, outarg.namelen + 1);
  1260. if (err)
  1261. goto err;
  1262. fuse_copy_finish(cs);
  1263. buf[outarg.namelen] = 0;
  1264. name.hash = full_name_hash(name.name, name.len);
  1265. down_read(&fc->killsb);
  1266. err = -ENOENT;
  1267. if (fc->sb)
  1268. err = fuse_reverse_inval_entry(fc->sb, outarg.parent, 0, &name);
  1269. up_read(&fc->killsb);
  1270. kfree(buf);
  1271. return err;
  1272. err:
  1273. kfree(buf);
  1274. fuse_copy_finish(cs);
  1275. return err;
  1276. }
  1277. static int fuse_notify_delete(struct fuse_conn *fc, unsigned int size,
  1278. struct fuse_copy_state *cs)
  1279. {
  1280. struct fuse_notify_delete_out outarg;
  1281. int err = -ENOMEM;
  1282. char *buf;
  1283. struct qstr name;
  1284. buf = kzalloc(FUSE_NAME_MAX + 1, GFP_KERNEL);
  1285. if (!buf)
  1286. goto err;
  1287. err = -EINVAL;
  1288. if (size < sizeof(outarg))
  1289. goto err;
  1290. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1291. if (err)
  1292. goto err;
  1293. err = -ENAMETOOLONG;
  1294. if (outarg.namelen > FUSE_NAME_MAX)
  1295. goto err;
  1296. err = -EINVAL;
  1297. if (size != sizeof(outarg) + outarg.namelen + 1)
  1298. goto err;
  1299. name.name = buf;
  1300. name.len = outarg.namelen;
  1301. err = fuse_copy_one(cs, buf, outarg.namelen + 1);
  1302. if (err)
  1303. goto err;
  1304. fuse_copy_finish(cs);
  1305. buf[outarg.namelen] = 0;
  1306. name.hash = full_name_hash(name.name, name.len);
  1307. down_read(&fc->killsb);
  1308. err = -ENOENT;
  1309. if (fc->sb)
  1310. err = fuse_reverse_inval_entry(fc->sb, outarg.parent,
  1311. outarg.child, &name);
  1312. up_read(&fc->killsb);
  1313. kfree(buf);
  1314. return err;
  1315. err:
  1316. kfree(buf);
  1317. fuse_copy_finish(cs);
  1318. return err;
  1319. }
  1320. static int fuse_notify_store(struct fuse_conn *fc, unsigned int size,
  1321. struct fuse_copy_state *cs)
  1322. {
  1323. struct fuse_notify_store_out outarg;
  1324. struct inode *inode;
  1325. struct address_space *mapping;
  1326. u64 nodeid;
  1327. int err;
  1328. pgoff_t index;
  1329. unsigned int offset;
  1330. unsigned int num;
  1331. loff_t file_size;
  1332. loff_t end;
  1333. err = -EINVAL;
  1334. if (size < sizeof(outarg))
  1335. goto out_finish;
  1336. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1337. if (err)
  1338. goto out_finish;
  1339. err = -EINVAL;
  1340. if (size - sizeof(outarg) != outarg.size)
  1341. goto out_finish;
  1342. nodeid = outarg.nodeid;
  1343. down_read(&fc->killsb);
  1344. err = -ENOENT;
  1345. if (!fc->sb)
  1346. goto out_up_killsb;
  1347. inode = ilookup5(fc->sb, nodeid, fuse_inode_eq, &nodeid);
  1348. if (!inode)
  1349. goto out_up_killsb;
  1350. mapping = inode->i_mapping;
  1351. index = outarg.offset >> PAGE_CACHE_SHIFT;
  1352. offset = outarg.offset & ~PAGE_CACHE_MASK;
  1353. file_size = i_size_read(inode);
  1354. end = outarg.offset + outarg.size;
  1355. if (end > file_size) {
  1356. file_size = end;
  1357. fuse_write_update_size(inode, file_size);
  1358. }
  1359. num = outarg.size;
  1360. while (num) {
  1361. struct page *page;
  1362. unsigned int this_num;
  1363. err = -ENOMEM;
  1364. page = find_or_create_page(mapping, index,
  1365. mapping_gfp_mask(mapping));
  1366. if (!page)
  1367. goto out_iput;
  1368. this_num = min_t(unsigned, num, PAGE_CACHE_SIZE - offset);
  1369. err = fuse_copy_page(cs, &page, offset, this_num, 0);
  1370. if (!err && offset == 0 && (num != 0 || file_size == end))
  1371. SetPageUptodate(page);
  1372. unlock_page(page);
  1373. page_cache_release(page);
  1374. if (err)
  1375. goto out_iput;
  1376. num -= this_num;
  1377. offset = 0;
  1378. index++;
  1379. }
  1380. err = 0;
  1381. out_iput:
  1382. iput(inode);
  1383. out_up_killsb:
  1384. up_read(&fc->killsb);
  1385. out_finish:
  1386. fuse_copy_finish(cs);
  1387. return err;
  1388. }
  1389. static void fuse_retrieve_end(struct fuse_conn *fc, struct fuse_req *req)
  1390. {
  1391. release_pages(req->pages, req->num_pages, 0);
  1392. }
  1393. static int fuse_retrieve(struct fuse_conn *fc, struct inode *inode,
  1394. struct fuse_notify_retrieve_out *outarg)
  1395. {
  1396. int err;
  1397. struct address_space *mapping = inode->i_mapping;
  1398. struct fuse_req *req;
  1399. pgoff_t index;
  1400. loff_t file_size;
  1401. unsigned int num;
  1402. unsigned int offset;
  1403. size_t total_len = 0;
  1404. int num_pages;
  1405. offset = outarg->offset & ~PAGE_CACHE_MASK;
  1406. file_size = i_size_read(inode);
  1407. num = outarg->size;
  1408. if (outarg->offset > file_size)
  1409. num = 0;
  1410. else if (outarg->offset + num > file_size)
  1411. num = file_size - outarg->offset;
  1412. num_pages = (num + offset + PAGE_SIZE - 1) >> PAGE_SHIFT;
  1413. num_pages = min(num_pages, FUSE_MAX_PAGES_PER_REQ);
  1414. req = fuse_get_req(fc, num_pages);
  1415. if (IS_ERR(req))
  1416. return PTR_ERR(req);
  1417. req->in.h.opcode = FUSE_NOTIFY_REPLY;
  1418. req->in.h.nodeid = outarg->nodeid;
  1419. req->in.numargs = 2;
  1420. req->in.argpages = 1;
  1421. req->page_descs[0].offset = offset;
  1422. req->end = fuse_retrieve_end;
  1423. index = outarg->offset >> PAGE_CACHE_SHIFT;
  1424. while (num && req->num_pages < num_pages) {
  1425. struct page *page;
  1426. unsigned int this_num;
  1427. page = find_get_page(mapping, index);
  1428. if (!page)
  1429. break;
  1430. this_num = min_t(unsigned, num, PAGE_CACHE_SIZE - offset);
  1431. req->pages[req->num_pages] = page;
  1432. req->page_descs[req->num_pages].length = this_num;
  1433. req->num_pages++;
  1434. offset = 0;
  1435. num -= this_num;
  1436. total_len += this_num;
  1437. index++;
  1438. }
  1439. req->misc.retrieve_in.offset = outarg->offset;
  1440. req->misc.retrieve_in.size = total_len;
  1441. req->in.args[0].size = sizeof(req->misc.retrieve_in);
  1442. req->in.args[0].value = &req->misc.retrieve_in;
  1443. req->in.args[1].size = total_len;
  1444. err = fuse_request_send_notify_reply(fc, req, outarg->notify_unique);
  1445. if (err)
  1446. fuse_retrieve_end(fc, req);
  1447. return err;
  1448. }
  1449. static int fuse_notify_retrieve(struct fuse_conn *fc, unsigned int size,
  1450. struct fuse_copy_state *cs)
  1451. {
  1452. struct fuse_notify_retrieve_out outarg;
  1453. struct inode *inode;
  1454. int err;
  1455. err = -EINVAL;
  1456. if (size != sizeof(outarg))
  1457. goto copy_finish;
  1458. err = fuse_copy_one(cs, &outarg, sizeof(outarg));
  1459. if (err)
  1460. goto copy_finish;
  1461. fuse_copy_finish(cs);
  1462. down_read(&fc->killsb);
  1463. err = -ENOENT;
  1464. if (fc->sb) {
  1465. u64 nodeid = outarg.nodeid;
  1466. inode = ilookup5(fc->sb, nodeid, fuse_inode_eq, &nodeid);
  1467. if (inode) {
  1468. err = fuse_retrieve(fc, inode, &outarg);
  1469. iput(inode);
  1470. }
  1471. }
  1472. up_read(&fc->killsb);
  1473. return err;
  1474. copy_finish:
  1475. fuse_copy_finish(cs);
  1476. return err;
  1477. }
  1478. static int fuse_notify(struct fuse_conn *fc, enum fuse_notify_code code,
  1479. unsigned int size, struct fuse_copy_state *cs)
  1480. {
  1481. switch (code) {
  1482. case FUSE_NOTIFY_POLL:
  1483. return fuse_notify_poll(fc, size, cs);
  1484. case FUSE_NOTIFY_INVAL_INODE:
  1485. return fuse_notify_inval_inode(fc, size, cs);
  1486. case FUSE_NOTIFY_INVAL_ENTRY:
  1487. return fuse_notify_inval_entry(fc, size, cs);
  1488. case FUSE_NOTIFY_STORE:
  1489. return fuse_notify_store(fc, size, cs);
  1490. case FUSE_NOTIFY_RETRIEVE:
  1491. return fuse_notify_retrieve(fc, size, cs);
  1492. case FUSE_NOTIFY_DELETE:
  1493. return fuse_notify_delete(fc, size, cs);
  1494. default:
  1495. fuse_copy_finish(cs);
  1496. return -EINVAL;
  1497. }
  1498. }
  1499. /* Look up request on processing list by unique ID */
  1500. static struct fuse_req *request_find(struct fuse_conn *fc, u64 unique)
  1501. {
  1502. struct list_head *entry;
  1503. list_for_each(entry, &fc->processing) {
  1504. struct fuse_req *req;
  1505. req = list_entry(entry, struct fuse_req, list);
  1506. if (req->in.h.unique == unique || req->intr_unique == unique)
  1507. return req;
  1508. }
  1509. return NULL;
  1510. }
  1511. static int copy_out_args(struct fuse_copy_state *cs, struct fuse_out *out,
  1512. unsigned nbytes)
  1513. {
  1514. unsigned reqsize = sizeof(struct fuse_out_header);
  1515. if (out->h.error)
  1516. return nbytes != reqsize ? -EINVAL : 0;
  1517. reqsize += len_args(out->numargs, out->args);
  1518. if (reqsize < nbytes || (reqsize > nbytes && !out->argvar))
  1519. return -EINVAL;
  1520. else if (reqsize > nbytes) {
  1521. struct fuse_arg *lastarg = &out->args[out->numargs-1];
  1522. unsigned diffsize = reqsize - nbytes;
  1523. if (diffsize > lastarg->size)
  1524. return -EINVAL;
  1525. lastarg->size -= diffsize;
  1526. }
  1527. return fuse_copy_args(cs, out->numargs, out->argpages, out->args,
  1528. out->page_zeroing);
  1529. }
  1530. /*
  1531. * Write a single reply to a request. First the header is copied from
  1532. * the write buffer. The request is then searched on the processing
  1533. * list by the unique ID found in the header. If found, then remove
  1534. * it from the list and copy the rest of the buffer to the request.
  1535. * The request is finished by calling request_end()
  1536. */
  1537. static ssize_t fuse_dev_do_write(struct fuse_conn *fc,
  1538. struct fuse_copy_state *cs, size_t nbytes)
  1539. {
  1540. int err;
  1541. struct fuse_req *req;
  1542. struct fuse_out_header oh;
  1543. if (nbytes < sizeof(struct fuse_out_header))
  1544. return -EINVAL;
  1545. err = fuse_copy_one(cs, &oh, sizeof(oh));
  1546. if (err)
  1547. goto err_finish;
  1548. err = -EINVAL;
  1549. if (oh.len != nbytes)
  1550. goto err_finish;
  1551. /*
  1552. * Zero oh.unique indicates unsolicited notification message
  1553. * and error contains notification code.
  1554. */
  1555. if (!oh.unique) {
  1556. err = fuse_notify(fc, oh.error, nbytes - sizeof(oh), cs);
  1557. return err ? err : nbytes;
  1558. }
  1559. err = -EINVAL;
  1560. if (oh.error <= -1000 || oh.error > 0)
  1561. goto err_finish;
  1562. spin_lock(&fc->lock);
  1563. err = -ENOENT;
  1564. if (!fc->connected)
  1565. goto err_unlock;
  1566. req = request_find(fc, oh.unique);
  1567. if (!req)
  1568. goto err_unlock;
  1569. if (req->aborted) {
  1570. spin_unlock(&fc->lock);
  1571. fuse_copy_finish(cs);
  1572. spin_lock(&fc->lock);
  1573. request_end(fc, req);
  1574. return -ENOENT;
  1575. }
  1576. /* Is it an interrupt reply? */
  1577. if (req->intr_unique == oh.unique) {
  1578. err = -EINVAL;
  1579. if (nbytes != sizeof(struct fuse_out_header))
  1580. goto err_unlock;
  1581. if (oh.error == -ENOSYS)
  1582. fc->no_interrupt = 1;
  1583. else if (oh.error == -EAGAIN)
  1584. queue_interrupt(fc, req);
  1585. spin_unlock(&fc->lock);
  1586. fuse_copy_finish(cs);
  1587. return nbytes;
  1588. }
  1589. req->state = FUSE_REQ_WRITING;
  1590. list_move(&req->list, &fc->io);
  1591. req->out.h = oh;
  1592. req->locked = 1;
  1593. cs->req = req;
  1594. if (!req->out.page_replace)
  1595. cs->move_pages = 0;
  1596. spin_unlock(&fc->lock);
  1597. err = copy_out_args(cs, &req->out, nbytes);
  1598. fuse_copy_finish(cs);
  1599. spin_lock(&fc->lock);
  1600. req->locked = 0;
  1601. if (!err) {
  1602. if (req->aborted)
  1603. err = -ENOENT;
  1604. } else if (!req->aborted)
  1605. req->out.h.error = -EIO;
  1606. request_end(fc, req);
  1607. return err ? err : nbytes;
  1608. err_unlock:
  1609. spin_unlock(&fc->lock);
  1610. err_finish:
  1611. fuse_copy_finish(cs);
  1612. return err;
  1613. }
  1614. static ssize_t fuse_dev_write(struct kiocb *iocb, const struct iovec *iov,
  1615. unsigned long nr_segs, loff_t pos)
  1616. {
  1617. struct fuse_copy_state cs;
  1618. struct fuse_conn *fc = fuse_get_conn(iocb->ki_filp);
  1619. if (!fc)
  1620. return -EPERM;
  1621. fuse_copy_init(&cs, fc, 0, iov, nr_segs);
  1622. return fuse_dev_do_write(fc, &cs, iov_length(iov, nr_segs));
  1623. }
  1624. static ssize_t fuse_dev_splice_write(struct pipe_inode_info *pipe,
  1625. struct file *out, loff_t *ppos,
  1626. size_t len, unsigned int flags)
  1627. {
  1628. unsigned nbuf;
  1629. unsigned idx;
  1630. struct pipe_buffer *bufs;
  1631. struct fuse_copy_state cs;
  1632. struct fuse_conn *fc;
  1633. size_t rem;
  1634. ssize_t ret;
  1635. fc = fuse_get_conn(out);
  1636. if (!fc)
  1637. return -EPERM;
  1638. bufs = kmalloc(pipe->buffers * sizeof(struct pipe_buffer), GFP_KERNEL);
  1639. if (!bufs)
  1640. return -ENOMEM;
  1641. pipe_lock(pipe);
  1642. nbuf = 0;
  1643. rem = 0;
  1644. for (idx = 0; idx < pipe->nrbufs && rem < len; idx++)
  1645. rem += pipe->bufs[(pipe->curbuf + idx) & (pipe->buffers - 1)].len;
  1646. ret = -EINVAL;
  1647. if (rem < len) {
  1648. pipe_unlock(pipe);
  1649. goto out;
  1650. }
  1651. rem = len;
  1652. while (rem) {
  1653. struct pipe_buffer *ibuf;
  1654. struct pipe_buffer *obuf;
  1655. BUG_ON(nbuf >= pipe->buffers);
  1656. BUG_ON(!pipe->nrbufs);
  1657. ibuf = &pipe->bufs[pipe->curbuf];
  1658. obuf = &bufs[nbuf];
  1659. if (rem >= ibuf->len) {
  1660. *obuf = *ibuf;
  1661. ibuf->ops = NULL;
  1662. pipe->curbuf = (pipe->curbuf + 1) & (pipe->buffers - 1);
  1663. pipe->nrbufs--;
  1664. } else {
  1665. ibuf->ops->get(pipe, ibuf);
  1666. *obuf = *ibuf;
  1667. obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
  1668. obuf->len = rem;
  1669. ibuf->offset += obuf->len;
  1670. ibuf->len -= obuf->len;
  1671. }
  1672. nbuf++;
  1673. rem -= obuf->len;
  1674. }
  1675. pipe_unlock(pipe);
  1676. fuse_copy_init(&cs, fc, 0, NULL, nbuf);
  1677. cs.pipebufs = bufs;
  1678. cs.pipe = pipe;
  1679. if (flags & SPLICE_F_MOVE)
  1680. cs.move_pages = 1;
  1681. ret = fuse_dev_do_write(fc, &cs, len);
  1682. for (idx = 0; idx < nbuf; idx++) {
  1683. struct pipe_buffer *buf = &bufs[idx];
  1684. buf->ops->release(pipe, buf);
  1685. }
  1686. out:
  1687. kfree(bufs);
  1688. return ret;
  1689. }
  1690. static unsigned fuse_dev_poll(struct file *file, poll_table *wait)
  1691. {
  1692. unsigned mask = POLLOUT | POLLWRNORM;
  1693. struct fuse_conn *fc = fuse_get_conn(file);
  1694. if (!fc)
  1695. return POLLERR;
  1696. poll_wait(file, &fc->waitq, wait);
  1697. spin_lock(&fc->lock);
  1698. if (!fc->connected)
  1699. mask = POLLERR;
  1700. else if (request_pending(fc))
  1701. mask |= POLLIN | POLLRDNORM;
  1702. spin_unlock(&fc->lock);
  1703. return mask;
  1704. }
  1705. /*
  1706. * Abort all requests on the given list (pending or processing)
  1707. *
  1708. * This function releases and reacquires fc->lock
  1709. */
  1710. static void end_requests(struct fuse_conn *fc, struct list_head *head)
  1711. __releases(fc->lock)
  1712. __acquires(fc->lock)
  1713. {
  1714. while (!list_empty(head)) {
  1715. struct fuse_req *req;
  1716. req = list_entry(head->next, struct fuse_req, list);
  1717. req->out.h.error = -ECONNABORTED;
  1718. request_end(fc, req);
  1719. spin_lock(&fc->lock);
  1720. }
  1721. }
  1722. /*
  1723. * Abort requests under I/O
  1724. *
  1725. * The requests are set to aborted and finished, and the request
  1726. * waiter is woken up. This will make request_wait_answer() wait
  1727. * until the request is unlocked and then return.
  1728. *
  1729. * If the request is asynchronous, then the end function needs to be
  1730. * called after waiting for the request to be unlocked (if it was
  1731. * locked).
  1732. */
  1733. static void end_io_requests(struct fuse_conn *fc)
  1734. __releases(fc->lock)
  1735. __acquires(fc->lock)
  1736. {
  1737. while (!list_empty(&fc->io)) {
  1738. struct fuse_req *req =
  1739. list_entry(fc->io.next, struct fuse_req, list);
  1740. void (*end) (struct fuse_conn *, struct fuse_req *) = req->end;
  1741. req->aborted = 1;
  1742. req->out.h.error = -ECONNABORTED;
  1743. req->state = FUSE_REQ_FINISHED;
  1744. list_del_init(&req->list);
  1745. wake_up(&req->waitq);
  1746. if (end) {
  1747. req->end = NULL;
  1748. __fuse_get_request(req);
  1749. spin_unlock(&fc->lock);
  1750. wait_event(req->waitq, !req->locked);
  1751. end(fc, req);
  1752. fuse_put_request(fc, req);
  1753. spin_lock(&fc->lock);
  1754. }
  1755. }
  1756. }
  1757. static void end_queued_requests(struct fuse_conn *fc)
  1758. __releases(fc->lock)
  1759. __acquires(fc->lock)
  1760. {
  1761. fc->max_background = UINT_MAX;
  1762. flush_bg_queue(fc);
  1763. end_requests(fc, &fc->pending);
  1764. end_requests(fc, &fc->processing);
  1765. while (forget_pending(fc))
  1766. kfree(dequeue_forget(fc, 1, NULL));
  1767. }
  1768. static void end_polls(struct fuse_conn *fc)
  1769. {
  1770. struct rb_node *p;
  1771. p = rb_first(&fc->polled_files);
  1772. while (p) {
  1773. struct fuse_file *ff;
  1774. ff = rb_entry(p, struct fuse_file, polled_node);
  1775. wake_up_interruptible_all(&ff->poll_wait);
  1776. p = rb_next(p);
  1777. }
  1778. }
  1779. /*
  1780. * Abort all requests.
  1781. *
  1782. * Emergency exit in case of a malicious or accidental deadlock, or
  1783. * just a hung filesystem.
  1784. *
  1785. * The same effect is usually achievable through killing the
  1786. * filesystem daemon and all users of the filesystem. The exception
  1787. * is the combination of an asynchronous request and the tricky
  1788. * deadlock (see Documentation/filesystems/fuse.txt).
  1789. *
  1790. * During the aborting, progression of requests from the pending and
  1791. * processing lists onto the io list, and progression of new requests
  1792. * onto the pending list is prevented by req->connected being false.
  1793. *
  1794. * Progression of requests under I/O to the processing list is
  1795. * prevented by the req->aborted flag being true for these requests.
  1796. * For this reason requests on the io list must be aborted first.
  1797. */
  1798. void fuse_abort_conn(struct fuse_conn *fc)
  1799. {
  1800. spin_lock(&fc->lock);
  1801. if (fc->connected) {
  1802. fc->connected = 0;
  1803. fc->blocked = 0;
  1804. fc->initialized = 1;
  1805. end_io_requests(fc);
  1806. end_queued_requests(fc);
  1807. end_polls(fc);
  1808. wake_up_all(&fc->waitq);
  1809. wake_up_all(&fc->blocked_waitq);
  1810. kill_fasync(&fc->fasync, SIGIO, POLL_IN);
  1811. }
  1812. spin_unlock(&fc->lock);
  1813. }
  1814. EXPORT_SYMBOL_GPL(fuse_abort_conn);
  1815. int fuse_dev_release(struct inode *inode, struct file *file)
  1816. {
  1817. struct fuse_conn *fc = fuse_get_conn(file);
  1818. if (fc) {
  1819. spin_lock(&fc->lock);
  1820. fc->connected = 0;
  1821. fc->blocked = 0;
  1822. fc->initialized = 1;
  1823. end_queued_requests(fc);
  1824. end_polls(fc);
  1825. wake_up_all(&fc->blocked_waitq);
  1826. spin_unlock(&fc->lock);
  1827. fuse_conn_put(fc);
  1828. }
  1829. return 0;
  1830. }
  1831. EXPORT_SYMBOL_GPL(fuse_dev_release);
  1832. static int fuse_dev_fasync(int fd, struct file *file, int on)
  1833. {
  1834. struct fuse_conn *fc = fuse_get_conn(file);
  1835. if (!fc)
  1836. return -EPERM;
  1837. /* No locking - fasync_helper does its own locking */
  1838. return fasync_helper(fd, file, on, &fc->fasync);
  1839. }
  1840. const struct file_operations fuse_dev_operations = {
  1841. .owner = THIS_MODULE,
  1842. .llseek = no_llseek,
  1843. .read = do_sync_read,
  1844. .aio_read = fuse_dev_read,
  1845. .splice_read = fuse_dev_splice_read,
  1846. .write = do_sync_write,
  1847. .aio_write = fuse_dev_write,
  1848. .splice_write = fuse_dev_splice_write,
  1849. .poll = fuse_dev_poll,
  1850. .release = fuse_dev_release,
  1851. .fasync = fuse_dev_fasync,
  1852. };
  1853. EXPORT_SYMBOL_GPL(fuse_dev_operations);
  1854. static struct miscdevice fuse_miscdevice = {
  1855. .minor = FUSE_MINOR,
  1856. .name = "fuse",
  1857. .fops = &fuse_dev_operations,
  1858. };
  1859. int __init fuse_dev_init(void)
  1860. {
  1861. int err = -ENOMEM;
  1862. fuse_req_cachep = kmem_cache_create("fuse_request",
  1863. sizeof(struct fuse_req),
  1864. 0, 0, NULL);
  1865. if (!fuse_req_cachep)
  1866. goto out;
  1867. err = misc_register(&fuse_miscdevice);
  1868. if (err)
  1869. goto out_cache_clean;
  1870. return 0;
  1871. out_cache_clean:
  1872. kmem_cache_destroy(fuse_req_cachep);
  1873. out:
  1874. return err;
  1875. }
  1876. void fuse_dev_cleanup(void)
  1877. {
  1878. misc_deregister(&fuse_miscdevice);
  1879. kmem_cache_destroy(fuse_req_cachep);
  1880. }