dev.c 50 KB

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