dev.c 48 KB

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