dev.c 49 KB

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