dev.c 45 KB

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