dev.c 48 KB

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