dev.c 48 KB

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