dev.c 49 KB

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