splice.c 46 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034
  1. /*
  2. * "splice": joining two ropes together by interweaving their strands.
  3. *
  4. * This is the "extended pipe" functionality, where a pipe is used as
  5. * an arbitrary in-memory buffer. Think of a pipe as a small kernel
  6. * buffer that you can use to transfer data from one end to the other.
  7. *
  8. * The traditional unix read/write is extended with a "splice()" operation
  9. * that transfers data buffers to or from a pipe buffer.
  10. *
  11. * Named by Larry McVoy, original implementation from Linus, extended by
  12. * Jens to support splicing to files, network, direct splicing, etc and
  13. * fixing lots of bugs.
  14. *
  15. * Copyright (C) 2005-2006 Jens Axboe <axboe@kernel.dk>
  16. * Copyright (C) 2005-2006 Linus Torvalds <torvalds@osdl.org>
  17. * Copyright (C) 2006 Ingo Molnar <mingo@elte.hu>
  18. *
  19. */
  20. #include <linux/fs.h>
  21. #include <linux/file.h>
  22. #include <linux/pagemap.h>
  23. #include <linux/splice.h>
  24. #include <linux/memcontrol.h>
  25. #include <linux/mm_inline.h>
  26. #include <linux/swap.h>
  27. #include <linux/writeback.h>
  28. #include <linux/export.h>
  29. #include <linux/syscalls.h>
  30. #include <linux/uio.h>
  31. #include <linux/security.h>
  32. #include <linux/gfp.h>
  33. #include <linux/socket.h>
  34. #include <linux/compat.h>
  35. #include "internal.h"
  36. /*
  37. * Attempt to steal a page from a pipe buffer. This should perhaps go into
  38. * a vm helper function, it's already simplified quite a bit by the
  39. * addition of remove_mapping(). If success is returned, the caller may
  40. * attempt to reuse this page for another destination.
  41. */
  42. static int page_cache_pipe_buf_steal(struct pipe_inode_info *pipe,
  43. struct pipe_buffer *buf)
  44. {
  45. struct page *page = buf->page;
  46. struct address_space *mapping;
  47. lock_page(page);
  48. mapping = page_mapping(page);
  49. if (mapping) {
  50. WARN_ON(!PageUptodate(page));
  51. /*
  52. * At least for ext2 with nobh option, we need to wait on
  53. * writeback completing on this page, since we'll remove it
  54. * from the pagecache. Otherwise truncate wont wait on the
  55. * page, allowing the disk blocks to be reused by someone else
  56. * before we actually wrote our data to them. fs corruption
  57. * ensues.
  58. */
  59. wait_on_page_writeback(page);
  60. if (page_has_private(page) &&
  61. !try_to_release_page(page, GFP_KERNEL))
  62. goto out_unlock;
  63. /*
  64. * If we succeeded in removing the mapping, set LRU flag
  65. * and return good.
  66. */
  67. if (remove_mapping(mapping, page)) {
  68. buf->flags |= PIPE_BUF_FLAG_LRU;
  69. return 0;
  70. }
  71. }
  72. /*
  73. * Raced with truncate or failed to remove page from current
  74. * address space, unlock and return failure.
  75. */
  76. out_unlock:
  77. unlock_page(page);
  78. return 1;
  79. }
  80. static void page_cache_pipe_buf_release(struct pipe_inode_info *pipe,
  81. struct pipe_buffer *buf)
  82. {
  83. page_cache_release(buf->page);
  84. buf->flags &= ~PIPE_BUF_FLAG_LRU;
  85. }
  86. /*
  87. * Check whether the contents of buf is OK to access. Since the content
  88. * is a page cache page, IO may be in flight.
  89. */
  90. static int page_cache_pipe_buf_confirm(struct pipe_inode_info *pipe,
  91. struct pipe_buffer *buf)
  92. {
  93. struct page *page = buf->page;
  94. int err;
  95. if (!PageUptodate(page)) {
  96. lock_page(page);
  97. /*
  98. * Page got truncated/unhashed. This will cause a 0-byte
  99. * splice, if this is the first page.
  100. */
  101. if (!page->mapping) {
  102. err = -ENODATA;
  103. goto error;
  104. }
  105. /*
  106. * Uh oh, read-error from disk.
  107. */
  108. if (!PageUptodate(page)) {
  109. err = -EIO;
  110. goto error;
  111. }
  112. /*
  113. * Page is ok afterall, we are done.
  114. */
  115. unlock_page(page);
  116. }
  117. return 0;
  118. error:
  119. unlock_page(page);
  120. return err;
  121. }
  122. const struct pipe_buf_operations page_cache_pipe_buf_ops = {
  123. .can_merge = 0,
  124. .confirm = page_cache_pipe_buf_confirm,
  125. .release = page_cache_pipe_buf_release,
  126. .steal = page_cache_pipe_buf_steal,
  127. .get = generic_pipe_buf_get,
  128. };
  129. static int user_page_pipe_buf_steal(struct pipe_inode_info *pipe,
  130. struct pipe_buffer *buf)
  131. {
  132. if (!(buf->flags & PIPE_BUF_FLAG_GIFT))
  133. return 1;
  134. buf->flags |= PIPE_BUF_FLAG_LRU;
  135. return generic_pipe_buf_steal(pipe, buf);
  136. }
  137. static const struct pipe_buf_operations user_page_pipe_buf_ops = {
  138. .can_merge = 0,
  139. .confirm = generic_pipe_buf_confirm,
  140. .release = page_cache_pipe_buf_release,
  141. .steal = user_page_pipe_buf_steal,
  142. .get = generic_pipe_buf_get,
  143. };
  144. static void wakeup_pipe_readers(struct pipe_inode_info *pipe)
  145. {
  146. smp_mb();
  147. if (waitqueue_active(&pipe->wait))
  148. wake_up_interruptible(&pipe->wait);
  149. kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
  150. }
  151. /**
  152. * splice_to_pipe - fill passed data into a pipe
  153. * @pipe: pipe to fill
  154. * @spd: data to fill
  155. *
  156. * Description:
  157. * @spd contains a map of pages and len/offset tuples, along with
  158. * the struct pipe_buf_operations associated with these pages. This
  159. * function will link that data to the pipe.
  160. *
  161. */
  162. ssize_t splice_to_pipe(struct pipe_inode_info *pipe,
  163. struct splice_pipe_desc *spd)
  164. {
  165. unsigned int spd_pages = spd->nr_pages;
  166. int ret, do_wakeup, page_nr;
  167. ret = 0;
  168. do_wakeup = 0;
  169. page_nr = 0;
  170. pipe_lock(pipe);
  171. for (;;) {
  172. if (!pipe->readers) {
  173. send_sig(SIGPIPE, current, 0);
  174. if (!ret)
  175. ret = -EPIPE;
  176. break;
  177. }
  178. if (pipe->nrbufs < pipe->buffers) {
  179. int newbuf = (pipe->curbuf + pipe->nrbufs) & (pipe->buffers - 1);
  180. struct pipe_buffer *buf = pipe->bufs + newbuf;
  181. buf->page = spd->pages[page_nr];
  182. buf->offset = spd->partial[page_nr].offset;
  183. buf->len = spd->partial[page_nr].len;
  184. buf->private = spd->partial[page_nr].private;
  185. buf->ops = spd->ops;
  186. if (spd->flags & SPLICE_F_GIFT)
  187. buf->flags |= PIPE_BUF_FLAG_GIFT;
  188. pipe->nrbufs++;
  189. page_nr++;
  190. ret += buf->len;
  191. if (pipe->files)
  192. do_wakeup = 1;
  193. if (!--spd->nr_pages)
  194. break;
  195. if (pipe->nrbufs < pipe->buffers)
  196. continue;
  197. break;
  198. }
  199. if (spd->flags & SPLICE_F_NONBLOCK) {
  200. if (!ret)
  201. ret = -EAGAIN;
  202. break;
  203. }
  204. if (signal_pending(current)) {
  205. if (!ret)
  206. ret = -ERESTARTSYS;
  207. break;
  208. }
  209. if (do_wakeup) {
  210. smp_mb();
  211. if (waitqueue_active(&pipe->wait))
  212. wake_up_interruptible_sync(&pipe->wait);
  213. kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
  214. do_wakeup = 0;
  215. }
  216. pipe->waiting_writers++;
  217. pipe_wait(pipe);
  218. pipe->waiting_writers--;
  219. }
  220. pipe_unlock(pipe);
  221. if (do_wakeup)
  222. wakeup_pipe_readers(pipe);
  223. while (page_nr < spd_pages)
  224. spd->spd_release(spd, page_nr++);
  225. return ret;
  226. }
  227. void spd_release_page(struct splice_pipe_desc *spd, unsigned int i)
  228. {
  229. page_cache_release(spd->pages[i]);
  230. }
  231. /*
  232. * Check if we need to grow the arrays holding pages and partial page
  233. * descriptions.
  234. */
  235. int splice_grow_spd(const struct pipe_inode_info *pipe, struct splice_pipe_desc *spd)
  236. {
  237. unsigned int buffers = ACCESS_ONCE(pipe->buffers);
  238. spd->nr_pages_max = buffers;
  239. if (buffers <= PIPE_DEF_BUFFERS)
  240. return 0;
  241. spd->pages = kmalloc(buffers * sizeof(struct page *), GFP_KERNEL);
  242. spd->partial = kmalloc(buffers * sizeof(struct partial_page), GFP_KERNEL);
  243. if (spd->pages && spd->partial)
  244. return 0;
  245. kfree(spd->pages);
  246. kfree(spd->partial);
  247. return -ENOMEM;
  248. }
  249. void splice_shrink_spd(struct splice_pipe_desc *spd)
  250. {
  251. if (spd->nr_pages_max <= PIPE_DEF_BUFFERS)
  252. return;
  253. kfree(spd->pages);
  254. kfree(spd->partial);
  255. }
  256. static int
  257. __generic_file_splice_read(struct file *in, loff_t *ppos,
  258. struct pipe_inode_info *pipe, size_t len,
  259. unsigned int flags)
  260. {
  261. struct address_space *mapping = in->f_mapping;
  262. unsigned int loff, nr_pages, req_pages;
  263. struct page *pages[PIPE_DEF_BUFFERS];
  264. struct partial_page partial[PIPE_DEF_BUFFERS];
  265. struct page *page;
  266. pgoff_t index, end_index;
  267. loff_t isize;
  268. int error, page_nr;
  269. struct splice_pipe_desc spd = {
  270. .pages = pages,
  271. .partial = partial,
  272. .nr_pages_max = PIPE_DEF_BUFFERS,
  273. .flags = flags,
  274. .ops = &page_cache_pipe_buf_ops,
  275. .spd_release = spd_release_page,
  276. };
  277. if (splice_grow_spd(pipe, &spd))
  278. return -ENOMEM;
  279. index = *ppos >> PAGE_CACHE_SHIFT;
  280. loff = *ppos & ~PAGE_CACHE_MASK;
  281. req_pages = (len + loff + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
  282. nr_pages = min(req_pages, spd.nr_pages_max);
  283. /*
  284. * Lookup the (hopefully) full range of pages we need.
  285. */
  286. spd.nr_pages = find_get_pages_contig(mapping, index, nr_pages, spd.pages);
  287. index += spd.nr_pages;
  288. /*
  289. * If find_get_pages_contig() returned fewer pages than we needed,
  290. * readahead/allocate the rest and fill in the holes.
  291. */
  292. if (spd.nr_pages < nr_pages)
  293. page_cache_sync_readahead(mapping, &in->f_ra, in,
  294. index, req_pages - spd.nr_pages);
  295. error = 0;
  296. while (spd.nr_pages < nr_pages) {
  297. /*
  298. * Page could be there, find_get_pages_contig() breaks on
  299. * the first hole.
  300. */
  301. page = find_get_page(mapping, index);
  302. if (!page) {
  303. /*
  304. * page didn't exist, allocate one.
  305. */
  306. page = page_cache_alloc_cold(mapping);
  307. if (!page)
  308. break;
  309. error = add_to_page_cache_lru(page, mapping, index,
  310. GFP_KERNEL);
  311. if (unlikely(error)) {
  312. page_cache_release(page);
  313. if (error == -EEXIST)
  314. continue;
  315. break;
  316. }
  317. /*
  318. * add_to_page_cache() locks the page, unlock it
  319. * to avoid convoluting the logic below even more.
  320. */
  321. unlock_page(page);
  322. }
  323. spd.pages[spd.nr_pages++] = page;
  324. index++;
  325. }
  326. /*
  327. * Now loop over the map and see if we need to start IO on any
  328. * pages, fill in the partial map, etc.
  329. */
  330. index = *ppos >> PAGE_CACHE_SHIFT;
  331. nr_pages = spd.nr_pages;
  332. spd.nr_pages = 0;
  333. for (page_nr = 0; page_nr < nr_pages; page_nr++) {
  334. unsigned int this_len;
  335. if (!len)
  336. break;
  337. /*
  338. * this_len is the max we'll use from this page
  339. */
  340. this_len = min_t(unsigned long, len, PAGE_CACHE_SIZE - loff);
  341. page = spd.pages[page_nr];
  342. if (PageReadahead(page))
  343. page_cache_async_readahead(mapping, &in->f_ra, in,
  344. page, index, req_pages - page_nr);
  345. /*
  346. * If the page isn't uptodate, we may need to start io on it
  347. */
  348. if (!PageUptodate(page)) {
  349. lock_page(page);
  350. /*
  351. * Page was truncated, or invalidated by the
  352. * filesystem. Redo the find/create, but this time the
  353. * page is kept locked, so there's no chance of another
  354. * race with truncate/invalidate.
  355. */
  356. if (!page->mapping) {
  357. unlock_page(page);
  358. page = find_or_create_page(mapping, index,
  359. mapping_gfp_mask(mapping));
  360. if (!page) {
  361. error = -ENOMEM;
  362. break;
  363. }
  364. page_cache_release(spd.pages[page_nr]);
  365. spd.pages[page_nr] = page;
  366. }
  367. /*
  368. * page was already under io and is now done, great
  369. */
  370. if (PageUptodate(page)) {
  371. unlock_page(page);
  372. goto fill_it;
  373. }
  374. /*
  375. * need to read in the page
  376. */
  377. error = mapping->a_ops->readpage(in, page);
  378. if (unlikely(error)) {
  379. /*
  380. * We really should re-lookup the page here,
  381. * but it complicates things a lot. Instead
  382. * lets just do what we already stored, and
  383. * we'll get it the next time we are called.
  384. */
  385. if (error == AOP_TRUNCATED_PAGE)
  386. error = 0;
  387. break;
  388. }
  389. }
  390. fill_it:
  391. /*
  392. * i_size must be checked after PageUptodate.
  393. */
  394. isize = i_size_read(mapping->host);
  395. end_index = (isize - 1) >> PAGE_CACHE_SHIFT;
  396. if (unlikely(!isize || index > end_index))
  397. break;
  398. /*
  399. * if this is the last page, see if we need to shrink
  400. * the length and stop
  401. */
  402. if (end_index == index) {
  403. unsigned int plen;
  404. /*
  405. * max good bytes in this page
  406. */
  407. plen = ((isize - 1) & ~PAGE_CACHE_MASK) + 1;
  408. if (plen <= loff)
  409. break;
  410. /*
  411. * force quit after adding this page
  412. */
  413. this_len = min(this_len, plen - loff);
  414. len = this_len;
  415. }
  416. spd.partial[page_nr].offset = loff;
  417. spd.partial[page_nr].len = this_len;
  418. len -= this_len;
  419. loff = 0;
  420. spd.nr_pages++;
  421. index++;
  422. }
  423. /*
  424. * Release any pages at the end, if we quit early. 'page_nr' is how far
  425. * we got, 'nr_pages' is how many pages are in the map.
  426. */
  427. while (page_nr < nr_pages)
  428. page_cache_release(spd.pages[page_nr++]);
  429. in->f_ra.prev_pos = (loff_t)index << PAGE_CACHE_SHIFT;
  430. if (spd.nr_pages)
  431. error = splice_to_pipe(pipe, &spd);
  432. splice_shrink_spd(&spd);
  433. return error;
  434. }
  435. /**
  436. * generic_file_splice_read - splice data from file to a pipe
  437. * @in: file to splice from
  438. * @ppos: position in @in
  439. * @pipe: pipe to splice to
  440. * @len: number of bytes to splice
  441. * @flags: splice modifier flags
  442. *
  443. * Description:
  444. * Will read pages from given file and fill them into a pipe. Can be
  445. * used as long as the address_space operations for the source implements
  446. * a readpage() hook.
  447. *
  448. */
  449. ssize_t generic_file_splice_read(struct file *in, loff_t *ppos,
  450. struct pipe_inode_info *pipe, size_t len,
  451. unsigned int flags)
  452. {
  453. loff_t isize, left;
  454. int ret;
  455. if (IS_DAX(in->f_mapping->host))
  456. return default_file_splice_read(in, ppos, pipe, len, flags);
  457. isize = i_size_read(in->f_mapping->host);
  458. if (unlikely(*ppos >= isize))
  459. return 0;
  460. left = isize - *ppos;
  461. if (unlikely(left < len))
  462. len = left;
  463. ret = __generic_file_splice_read(in, ppos, pipe, len, flags);
  464. if (ret > 0) {
  465. *ppos += ret;
  466. file_accessed(in);
  467. }
  468. return ret;
  469. }
  470. EXPORT_SYMBOL(generic_file_splice_read);
  471. static const struct pipe_buf_operations default_pipe_buf_ops = {
  472. .can_merge = 0,
  473. .confirm = generic_pipe_buf_confirm,
  474. .release = generic_pipe_buf_release,
  475. .steal = generic_pipe_buf_steal,
  476. .get = generic_pipe_buf_get,
  477. };
  478. static int generic_pipe_buf_nosteal(struct pipe_inode_info *pipe,
  479. struct pipe_buffer *buf)
  480. {
  481. return 1;
  482. }
  483. /* Pipe buffer operations for a socket and similar. */
  484. const struct pipe_buf_operations nosteal_pipe_buf_ops = {
  485. .can_merge = 0,
  486. .confirm = generic_pipe_buf_confirm,
  487. .release = generic_pipe_buf_release,
  488. .steal = generic_pipe_buf_nosteal,
  489. .get = generic_pipe_buf_get,
  490. };
  491. EXPORT_SYMBOL(nosteal_pipe_buf_ops);
  492. static ssize_t kernel_readv(struct file *file, const struct iovec *vec,
  493. unsigned long vlen, loff_t offset)
  494. {
  495. mm_segment_t old_fs;
  496. loff_t pos = offset;
  497. ssize_t res;
  498. old_fs = get_fs();
  499. set_fs(get_ds());
  500. /* The cast to a user pointer is valid due to the set_fs() */
  501. res = vfs_readv(file, (const struct iovec __user *)vec, vlen, &pos);
  502. set_fs(old_fs);
  503. return res;
  504. }
  505. ssize_t kernel_write(struct file *file, const char *buf, size_t count,
  506. loff_t pos)
  507. {
  508. mm_segment_t old_fs;
  509. ssize_t res;
  510. old_fs = get_fs();
  511. set_fs(get_ds());
  512. /* The cast to a user pointer is valid due to the set_fs() */
  513. res = vfs_write(file, (__force const char __user *)buf, count, &pos);
  514. set_fs(old_fs);
  515. return res;
  516. }
  517. EXPORT_SYMBOL(kernel_write);
  518. ssize_t default_file_splice_read(struct file *in, loff_t *ppos,
  519. struct pipe_inode_info *pipe, size_t len,
  520. unsigned int flags)
  521. {
  522. unsigned int nr_pages;
  523. unsigned int nr_freed;
  524. size_t offset;
  525. struct page *pages[PIPE_DEF_BUFFERS];
  526. struct partial_page partial[PIPE_DEF_BUFFERS];
  527. struct iovec *vec, __vec[PIPE_DEF_BUFFERS];
  528. ssize_t res;
  529. size_t this_len;
  530. int error;
  531. int i;
  532. struct splice_pipe_desc spd = {
  533. .pages = pages,
  534. .partial = partial,
  535. .nr_pages_max = PIPE_DEF_BUFFERS,
  536. .flags = flags,
  537. .ops = &default_pipe_buf_ops,
  538. .spd_release = spd_release_page,
  539. };
  540. if (splice_grow_spd(pipe, &spd))
  541. return -ENOMEM;
  542. res = -ENOMEM;
  543. vec = __vec;
  544. if (spd.nr_pages_max > PIPE_DEF_BUFFERS) {
  545. vec = kmalloc(spd.nr_pages_max * sizeof(struct iovec), GFP_KERNEL);
  546. if (!vec)
  547. goto shrink_ret;
  548. }
  549. offset = *ppos & ~PAGE_CACHE_MASK;
  550. nr_pages = (len + offset + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
  551. for (i = 0; i < nr_pages && i < spd.nr_pages_max && len; i++) {
  552. struct page *page;
  553. page = alloc_page(GFP_USER);
  554. error = -ENOMEM;
  555. if (!page)
  556. goto err;
  557. this_len = min_t(size_t, len, PAGE_CACHE_SIZE - offset);
  558. vec[i].iov_base = (void __user *) page_address(page);
  559. vec[i].iov_len = this_len;
  560. spd.pages[i] = page;
  561. spd.nr_pages++;
  562. len -= this_len;
  563. offset = 0;
  564. }
  565. res = kernel_readv(in, vec, spd.nr_pages, *ppos);
  566. if (res < 0) {
  567. error = res;
  568. goto err;
  569. }
  570. error = 0;
  571. if (!res)
  572. goto err;
  573. nr_freed = 0;
  574. for (i = 0; i < spd.nr_pages; i++) {
  575. this_len = min_t(size_t, vec[i].iov_len, res);
  576. spd.partial[i].offset = 0;
  577. spd.partial[i].len = this_len;
  578. if (!this_len) {
  579. __free_page(spd.pages[i]);
  580. spd.pages[i] = NULL;
  581. nr_freed++;
  582. }
  583. res -= this_len;
  584. }
  585. spd.nr_pages -= nr_freed;
  586. res = splice_to_pipe(pipe, &spd);
  587. if (res > 0)
  588. *ppos += res;
  589. shrink_ret:
  590. if (vec != __vec)
  591. kfree(vec);
  592. splice_shrink_spd(&spd);
  593. return res;
  594. err:
  595. for (i = 0; i < spd.nr_pages; i++)
  596. __free_page(spd.pages[i]);
  597. res = error;
  598. goto shrink_ret;
  599. }
  600. EXPORT_SYMBOL(default_file_splice_read);
  601. /*
  602. * Send 'sd->len' bytes to socket from 'sd->file' at position 'sd->pos'
  603. * using sendpage(). Return the number of bytes sent.
  604. */
  605. static int pipe_to_sendpage(struct pipe_inode_info *pipe,
  606. struct pipe_buffer *buf, struct splice_desc *sd)
  607. {
  608. struct file *file = sd->u.file;
  609. loff_t pos = sd->pos;
  610. int more;
  611. if (!likely(file->f_op->sendpage))
  612. return -EINVAL;
  613. more = (sd->flags & SPLICE_F_MORE) ? MSG_MORE : 0;
  614. if (sd->len < sd->total_len && pipe->nrbufs > 1)
  615. more |= MSG_SENDPAGE_NOTLAST;
  616. return file->f_op->sendpage(file, buf->page, buf->offset,
  617. sd->len, &pos, more);
  618. }
  619. static void wakeup_pipe_writers(struct pipe_inode_info *pipe)
  620. {
  621. smp_mb();
  622. if (waitqueue_active(&pipe->wait))
  623. wake_up_interruptible(&pipe->wait);
  624. kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
  625. }
  626. /**
  627. * splice_from_pipe_feed - feed available data from a pipe to a file
  628. * @pipe: pipe to splice from
  629. * @sd: information to @actor
  630. * @actor: handler that splices the data
  631. *
  632. * Description:
  633. * This function loops over the pipe and calls @actor to do the
  634. * actual moving of a single struct pipe_buffer to the desired
  635. * destination. It returns when there's no more buffers left in
  636. * the pipe or if the requested number of bytes (@sd->total_len)
  637. * have been copied. It returns a positive number (one) if the
  638. * pipe needs to be filled with more data, zero if the required
  639. * number of bytes have been copied and -errno on error.
  640. *
  641. * This, together with splice_from_pipe_{begin,end,next}, may be
  642. * used to implement the functionality of __splice_from_pipe() when
  643. * locking is required around copying the pipe buffers to the
  644. * destination.
  645. */
  646. static int splice_from_pipe_feed(struct pipe_inode_info *pipe, struct splice_desc *sd,
  647. splice_actor *actor)
  648. {
  649. int ret;
  650. while (pipe->nrbufs) {
  651. struct pipe_buffer *buf = pipe->bufs + pipe->curbuf;
  652. const struct pipe_buf_operations *ops = buf->ops;
  653. sd->len = buf->len;
  654. if (sd->len > sd->total_len)
  655. sd->len = sd->total_len;
  656. ret = buf->ops->confirm(pipe, buf);
  657. if (unlikely(ret)) {
  658. if (ret == -ENODATA)
  659. ret = 0;
  660. return ret;
  661. }
  662. ret = actor(pipe, buf, sd);
  663. if (ret <= 0)
  664. return ret;
  665. buf->offset += ret;
  666. buf->len -= ret;
  667. sd->num_spliced += ret;
  668. sd->len -= ret;
  669. sd->pos += ret;
  670. sd->total_len -= ret;
  671. if (!buf->len) {
  672. buf->ops = NULL;
  673. ops->release(pipe, buf);
  674. pipe->curbuf = (pipe->curbuf + 1) & (pipe->buffers - 1);
  675. pipe->nrbufs--;
  676. if (pipe->files)
  677. sd->need_wakeup = true;
  678. }
  679. if (!sd->total_len)
  680. return 0;
  681. }
  682. return 1;
  683. }
  684. /**
  685. * splice_from_pipe_next - wait for some data to splice from
  686. * @pipe: pipe to splice from
  687. * @sd: information about the splice operation
  688. *
  689. * Description:
  690. * This function will wait for some data and return a positive
  691. * value (one) if pipe buffers are available. It will return zero
  692. * or -errno if no more data needs to be spliced.
  693. */
  694. static int splice_from_pipe_next(struct pipe_inode_info *pipe, struct splice_desc *sd)
  695. {
  696. while (!pipe->nrbufs) {
  697. if (!pipe->writers)
  698. return 0;
  699. if (!pipe->waiting_writers && sd->num_spliced)
  700. return 0;
  701. if (sd->flags & SPLICE_F_NONBLOCK)
  702. return -EAGAIN;
  703. if (signal_pending(current))
  704. return -ERESTARTSYS;
  705. if (sd->need_wakeup) {
  706. wakeup_pipe_writers(pipe);
  707. sd->need_wakeup = false;
  708. }
  709. pipe_wait(pipe);
  710. }
  711. return 1;
  712. }
  713. /**
  714. * splice_from_pipe_begin - start splicing from pipe
  715. * @sd: information about the splice operation
  716. *
  717. * Description:
  718. * This function should be called before a loop containing
  719. * splice_from_pipe_next() and splice_from_pipe_feed() to
  720. * initialize the necessary fields of @sd.
  721. */
  722. static void splice_from_pipe_begin(struct splice_desc *sd)
  723. {
  724. sd->num_spliced = 0;
  725. sd->need_wakeup = false;
  726. }
  727. /**
  728. * splice_from_pipe_end - finish splicing from pipe
  729. * @pipe: pipe to splice from
  730. * @sd: information about the splice operation
  731. *
  732. * Description:
  733. * This function will wake up pipe writers if necessary. It should
  734. * be called after a loop containing splice_from_pipe_next() and
  735. * splice_from_pipe_feed().
  736. */
  737. static void splice_from_pipe_end(struct pipe_inode_info *pipe, struct splice_desc *sd)
  738. {
  739. if (sd->need_wakeup)
  740. wakeup_pipe_writers(pipe);
  741. }
  742. /**
  743. * __splice_from_pipe - splice data from a pipe to given actor
  744. * @pipe: pipe to splice from
  745. * @sd: information to @actor
  746. * @actor: handler that splices the data
  747. *
  748. * Description:
  749. * This function does little more than loop over the pipe and call
  750. * @actor to do the actual moving of a single struct pipe_buffer to
  751. * the desired destination. See pipe_to_file, pipe_to_sendpage, or
  752. * pipe_to_user.
  753. *
  754. */
  755. ssize_t __splice_from_pipe(struct pipe_inode_info *pipe, struct splice_desc *sd,
  756. splice_actor *actor)
  757. {
  758. int ret;
  759. splice_from_pipe_begin(sd);
  760. do {
  761. ret = splice_from_pipe_next(pipe, sd);
  762. if (ret > 0)
  763. ret = splice_from_pipe_feed(pipe, sd, actor);
  764. } while (ret > 0);
  765. splice_from_pipe_end(pipe, sd);
  766. return sd->num_spliced ? sd->num_spliced : ret;
  767. }
  768. EXPORT_SYMBOL(__splice_from_pipe);
  769. /**
  770. * splice_from_pipe - splice data from a pipe to a file
  771. * @pipe: pipe to splice from
  772. * @out: file to splice to
  773. * @ppos: position in @out
  774. * @len: how many bytes to splice
  775. * @flags: splice modifier flags
  776. * @actor: handler that splices the data
  777. *
  778. * Description:
  779. * See __splice_from_pipe. This function locks the pipe inode,
  780. * otherwise it's identical to __splice_from_pipe().
  781. *
  782. */
  783. ssize_t splice_from_pipe(struct pipe_inode_info *pipe, struct file *out,
  784. loff_t *ppos, size_t len, unsigned int flags,
  785. splice_actor *actor)
  786. {
  787. ssize_t ret;
  788. struct splice_desc sd = {
  789. .total_len = len,
  790. .flags = flags,
  791. .pos = *ppos,
  792. .u.file = out,
  793. };
  794. pipe_lock(pipe);
  795. ret = __splice_from_pipe(pipe, &sd, actor);
  796. pipe_unlock(pipe);
  797. return ret;
  798. }
  799. /**
  800. * iter_file_splice_write - splice data from a pipe to a file
  801. * @pipe: pipe info
  802. * @out: file to write to
  803. * @ppos: position in @out
  804. * @len: number of bytes to splice
  805. * @flags: splice modifier flags
  806. *
  807. * Description:
  808. * Will either move or copy pages (determined by @flags options) from
  809. * the given pipe inode to the given file.
  810. * This one is ->write_iter-based.
  811. *
  812. */
  813. ssize_t
  814. iter_file_splice_write(struct pipe_inode_info *pipe, struct file *out,
  815. loff_t *ppos, size_t len, unsigned int flags)
  816. {
  817. struct splice_desc sd = {
  818. .total_len = len,
  819. .flags = flags,
  820. .pos = *ppos,
  821. .u.file = out,
  822. };
  823. int nbufs = pipe->buffers;
  824. struct bio_vec *array = kcalloc(nbufs, sizeof(struct bio_vec),
  825. GFP_KERNEL);
  826. ssize_t ret;
  827. if (unlikely(!array))
  828. return -ENOMEM;
  829. pipe_lock(pipe);
  830. splice_from_pipe_begin(&sd);
  831. while (sd.total_len) {
  832. struct iov_iter from;
  833. size_t left;
  834. int n, idx;
  835. ret = splice_from_pipe_next(pipe, &sd);
  836. if (ret <= 0)
  837. break;
  838. if (unlikely(nbufs < pipe->buffers)) {
  839. kfree(array);
  840. nbufs = pipe->buffers;
  841. array = kcalloc(nbufs, sizeof(struct bio_vec),
  842. GFP_KERNEL);
  843. if (!array) {
  844. ret = -ENOMEM;
  845. break;
  846. }
  847. }
  848. /* build the vector */
  849. left = sd.total_len;
  850. for (n = 0, idx = pipe->curbuf; left && n < pipe->nrbufs; n++, idx++) {
  851. struct pipe_buffer *buf = pipe->bufs + idx;
  852. size_t this_len = buf->len;
  853. if (this_len > left)
  854. this_len = left;
  855. if (idx == pipe->buffers - 1)
  856. idx = -1;
  857. ret = buf->ops->confirm(pipe, buf);
  858. if (unlikely(ret)) {
  859. if (ret == -ENODATA)
  860. ret = 0;
  861. goto done;
  862. }
  863. array[n].bv_page = buf->page;
  864. array[n].bv_len = this_len;
  865. array[n].bv_offset = buf->offset;
  866. left -= this_len;
  867. }
  868. iov_iter_bvec(&from, ITER_BVEC | WRITE, array, n,
  869. sd.total_len - left);
  870. ret = vfs_iter_write(out, &from, &sd.pos);
  871. if (ret <= 0)
  872. break;
  873. sd.num_spliced += ret;
  874. sd.total_len -= ret;
  875. *ppos = sd.pos;
  876. /* dismiss the fully eaten buffers, adjust the partial one */
  877. while (ret) {
  878. struct pipe_buffer *buf = pipe->bufs + pipe->curbuf;
  879. if (ret >= buf->len) {
  880. const struct pipe_buf_operations *ops = buf->ops;
  881. ret -= buf->len;
  882. buf->len = 0;
  883. buf->ops = NULL;
  884. ops->release(pipe, buf);
  885. pipe->curbuf = (pipe->curbuf + 1) & (pipe->buffers - 1);
  886. pipe->nrbufs--;
  887. if (pipe->files)
  888. sd.need_wakeup = true;
  889. } else {
  890. buf->offset += ret;
  891. buf->len -= ret;
  892. ret = 0;
  893. }
  894. }
  895. }
  896. done:
  897. kfree(array);
  898. splice_from_pipe_end(pipe, &sd);
  899. pipe_unlock(pipe);
  900. if (sd.num_spliced)
  901. ret = sd.num_spliced;
  902. return ret;
  903. }
  904. EXPORT_SYMBOL(iter_file_splice_write);
  905. static int write_pipe_buf(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
  906. struct splice_desc *sd)
  907. {
  908. int ret;
  909. void *data;
  910. loff_t tmp = sd->pos;
  911. data = kmap(buf->page);
  912. ret = __kernel_write(sd->u.file, data + buf->offset, sd->len, &tmp);
  913. kunmap(buf->page);
  914. return ret;
  915. }
  916. static ssize_t default_file_splice_write(struct pipe_inode_info *pipe,
  917. struct file *out, loff_t *ppos,
  918. size_t len, unsigned int flags)
  919. {
  920. ssize_t ret;
  921. ret = splice_from_pipe(pipe, out, ppos, len, flags, write_pipe_buf);
  922. if (ret > 0)
  923. *ppos += ret;
  924. return ret;
  925. }
  926. /**
  927. * generic_splice_sendpage - splice data from a pipe to a socket
  928. * @pipe: pipe to splice from
  929. * @out: socket to write to
  930. * @ppos: position in @out
  931. * @len: number of bytes to splice
  932. * @flags: splice modifier flags
  933. *
  934. * Description:
  935. * Will send @len bytes from the pipe to a network socket. No data copying
  936. * is involved.
  937. *
  938. */
  939. ssize_t generic_splice_sendpage(struct pipe_inode_info *pipe, struct file *out,
  940. loff_t *ppos, size_t len, unsigned int flags)
  941. {
  942. return splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_sendpage);
  943. }
  944. EXPORT_SYMBOL(generic_splice_sendpage);
  945. /*
  946. * Attempt to initiate a splice from pipe to file.
  947. */
  948. static long do_splice_from(struct pipe_inode_info *pipe, struct file *out,
  949. loff_t *ppos, size_t len, unsigned int flags)
  950. {
  951. ssize_t (*splice_write)(struct pipe_inode_info *, struct file *,
  952. loff_t *, size_t, unsigned int);
  953. if (out->f_op->splice_write)
  954. splice_write = out->f_op->splice_write;
  955. else
  956. splice_write = default_file_splice_write;
  957. return splice_write(pipe, out, ppos, len, flags);
  958. }
  959. /*
  960. * Attempt to initiate a splice from a file to a pipe.
  961. */
  962. static long do_splice_to(struct file *in, loff_t *ppos,
  963. struct pipe_inode_info *pipe, size_t len,
  964. unsigned int flags)
  965. {
  966. ssize_t (*splice_read)(struct file *, loff_t *,
  967. struct pipe_inode_info *, size_t, unsigned int);
  968. int ret;
  969. if (unlikely(!(in->f_mode & FMODE_READ)))
  970. return -EBADF;
  971. ret = rw_verify_area(READ, in, ppos, len);
  972. if (unlikely(ret < 0))
  973. return ret;
  974. if (in->f_op->splice_read)
  975. splice_read = in->f_op->splice_read;
  976. else
  977. splice_read = default_file_splice_read;
  978. return splice_read(in, ppos, pipe, len, flags);
  979. }
  980. /**
  981. * splice_direct_to_actor - splices data directly between two non-pipes
  982. * @in: file to splice from
  983. * @sd: actor information on where to splice to
  984. * @actor: handles the data splicing
  985. *
  986. * Description:
  987. * This is a special case helper to splice directly between two
  988. * points, without requiring an explicit pipe. Internally an allocated
  989. * pipe is cached in the process, and reused during the lifetime of
  990. * that process.
  991. *
  992. */
  993. ssize_t splice_direct_to_actor(struct file *in, struct splice_desc *sd,
  994. splice_direct_actor *actor)
  995. {
  996. struct pipe_inode_info *pipe;
  997. long ret, bytes;
  998. umode_t i_mode;
  999. size_t len;
  1000. int i, flags, more;
  1001. /*
  1002. * We require the input being a regular file, as we don't want to
  1003. * randomly drop data for eg socket -> socket splicing. Use the
  1004. * piped splicing for that!
  1005. */
  1006. i_mode = file_inode(in)->i_mode;
  1007. if (unlikely(!S_ISREG(i_mode) && !S_ISBLK(i_mode)))
  1008. return -EINVAL;
  1009. /*
  1010. * neither in nor out is a pipe, setup an internal pipe attached to
  1011. * 'out' and transfer the wanted data from 'in' to 'out' through that
  1012. */
  1013. pipe = current->splice_pipe;
  1014. if (unlikely(!pipe)) {
  1015. pipe = alloc_pipe_info();
  1016. if (!pipe)
  1017. return -ENOMEM;
  1018. /*
  1019. * We don't have an immediate reader, but we'll read the stuff
  1020. * out of the pipe right after the splice_to_pipe(). So set
  1021. * PIPE_READERS appropriately.
  1022. */
  1023. pipe->readers = 1;
  1024. current->splice_pipe = pipe;
  1025. }
  1026. /*
  1027. * Do the splice.
  1028. */
  1029. ret = 0;
  1030. bytes = 0;
  1031. len = sd->total_len;
  1032. flags = sd->flags;
  1033. /*
  1034. * Don't block on output, we have to drain the direct pipe.
  1035. */
  1036. sd->flags &= ~SPLICE_F_NONBLOCK;
  1037. more = sd->flags & SPLICE_F_MORE;
  1038. while (len) {
  1039. size_t read_len;
  1040. loff_t pos = sd->pos, prev_pos = pos;
  1041. ret = do_splice_to(in, &pos, pipe, len, flags);
  1042. if (unlikely(ret <= 0))
  1043. goto out_release;
  1044. read_len = ret;
  1045. sd->total_len = read_len;
  1046. /*
  1047. * If more data is pending, set SPLICE_F_MORE
  1048. * If this is the last data and SPLICE_F_MORE was not set
  1049. * initially, clears it.
  1050. */
  1051. if (read_len < len)
  1052. sd->flags |= SPLICE_F_MORE;
  1053. else if (!more)
  1054. sd->flags &= ~SPLICE_F_MORE;
  1055. /*
  1056. * NOTE: nonblocking mode only applies to the input. We
  1057. * must not do the output in nonblocking mode as then we
  1058. * could get stuck data in the internal pipe:
  1059. */
  1060. ret = actor(pipe, sd);
  1061. if (unlikely(ret <= 0)) {
  1062. sd->pos = prev_pos;
  1063. goto out_release;
  1064. }
  1065. bytes += ret;
  1066. len -= ret;
  1067. sd->pos = pos;
  1068. if (ret < read_len) {
  1069. sd->pos = prev_pos + ret;
  1070. goto out_release;
  1071. }
  1072. }
  1073. done:
  1074. pipe->nrbufs = pipe->curbuf = 0;
  1075. file_accessed(in);
  1076. return bytes;
  1077. out_release:
  1078. /*
  1079. * If we did an incomplete transfer we must release
  1080. * the pipe buffers in question:
  1081. */
  1082. for (i = 0; i < pipe->buffers; i++) {
  1083. struct pipe_buffer *buf = pipe->bufs + i;
  1084. if (buf->ops) {
  1085. buf->ops->release(pipe, buf);
  1086. buf->ops = NULL;
  1087. }
  1088. }
  1089. if (!bytes)
  1090. bytes = ret;
  1091. goto done;
  1092. }
  1093. EXPORT_SYMBOL(splice_direct_to_actor);
  1094. static int direct_splice_actor(struct pipe_inode_info *pipe,
  1095. struct splice_desc *sd)
  1096. {
  1097. struct file *file = sd->u.file;
  1098. return do_splice_from(pipe, file, sd->opos, sd->total_len,
  1099. sd->flags);
  1100. }
  1101. /**
  1102. * do_splice_direct - splices data directly between two files
  1103. * @in: file to splice from
  1104. * @ppos: input file offset
  1105. * @out: file to splice to
  1106. * @opos: output file offset
  1107. * @len: number of bytes to splice
  1108. * @flags: splice modifier flags
  1109. *
  1110. * Description:
  1111. * For use by do_sendfile(). splice can easily emulate sendfile, but
  1112. * doing it in the application would incur an extra system call
  1113. * (splice in + splice out, as compared to just sendfile()). So this helper
  1114. * can splice directly through a process-private pipe.
  1115. *
  1116. */
  1117. long do_splice_direct(struct file *in, loff_t *ppos, struct file *out,
  1118. loff_t *opos, size_t len, unsigned int flags)
  1119. {
  1120. struct splice_desc sd = {
  1121. .len = len,
  1122. .total_len = len,
  1123. .flags = flags,
  1124. .pos = *ppos,
  1125. .u.file = out,
  1126. .opos = opos,
  1127. };
  1128. long ret;
  1129. if (unlikely(!(out->f_mode & FMODE_WRITE)))
  1130. return -EBADF;
  1131. if (unlikely(out->f_flags & O_APPEND))
  1132. return -EINVAL;
  1133. ret = rw_verify_area(WRITE, out, opos, len);
  1134. if (unlikely(ret < 0))
  1135. return ret;
  1136. ret = splice_direct_to_actor(in, &sd, direct_splice_actor);
  1137. if (ret > 0)
  1138. *ppos = sd.pos;
  1139. return ret;
  1140. }
  1141. EXPORT_SYMBOL(do_splice_direct);
  1142. static int splice_pipe_to_pipe(struct pipe_inode_info *ipipe,
  1143. struct pipe_inode_info *opipe,
  1144. size_t len, unsigned int flags);
  1145. /*
  1146. * Determine where to splice to/from.
  1147. */
  1148. static long do_splice(struct file *in, loff_t __user *off_in,
  1149. struct file *out, loff_t __user *off_out,
  1150. size_t len, unsigned int flags)
  1151. {
  1152. struct pipe_inode_info *ipipe;
  1153. struct pipe_inode_info *opipe;
  1154. loff_t offset;
  1155. long ret;
  1156. ipipe = get_pipe_info(in);
  1157. opipe = get_pipe_info(out);
  1158. if (ipipe && opipe) {
  1159. if (off_in || off_out)
  1160. return -ESPIPE;
  1161. if (!(in->f_mode & FMODE_READ))
  1162. return -EBADF;
  1163. if (!(out->f_mode & FMODE_WRITE))
  1164. return -EBADF;
  1165. /* Splicing to self would be fun, but... */
  1166. if (ipipe == opipe)
  1167. return -EINVAL;
  1168. return splice_pipe_to_pipe(ipipe, opipe, len, flags);
  1169. }
  1170. if (ipipe) {
  1171. if (off_in)
  1172. return -ESPIPE;
  1173. if (off_out) {
  1174. if (!(out->f_mode & FMODE_PWRITE))
  1175. return -EINVAL;
  1176. if (copy_from_user(&offset, off_out, sizeof(loff_t)))
  1177. return -EFAULT;
  1178. } else {
  1179. offset = out->f_pos;
  1180. }
  1181. if (unlikely(!(out->f_mode & FMODE_WRITE)))
  1182. return -EBADF;
  1183. if (unlikely(out->f_flags & O_APPEND))
  1184. return -EINVAL;
  1185. ret = rw_verify_area(WRITE, out, &offset, len);
  1186. if (unlikely(ret < 0))
  1187. return ret;
  1188. file_start_write(out);
  1189. ret = do_splice_from(ipipe, out, &offset, len, flags);
  1190. file_end_write(out);
  1191. if (!off_out)
  1192. out->f_pos = offset;
  1193. else if (copy_to_user(off_out, &offset, sizeof(loff_t)))
  1194. ret = -EFAULT;
  1195. return ret;
  1196. }
  1197. if (opipe) {
  1198. if (off_out)
  1199. return -ESPIPE;
  1200. if (off_in) {
  1201. if (!(in->f_mode & FMODE_PREAD))
  1202. return -EINVAL;
  1203. if (copy_from_user(&offset, off_in, sizeof(loff_t)))
  1204. return -EFAULT;
  1205. } else {
  1206. offset = in->f_pos;
  1207. }
  1208. ret = do_splice_to(in, &offset, opipe, len, flags);
  1209. if (!off_in)
  1210. in->f_pos = offset;
  1211. else if (copy_to_user(off_in, &offset, sizeof(loff_t)))
  1212. ret = -EFAULT;
  1213. return ret;
  1214. }
  1215. return -EINVAL;
  1216. }
  1217. /*
  1218. * Map an iov into an array of pages and offset/length tupples. With the
  1219. * partial_page structure, we can map several non-contiguous ranges into
  1220. * our ones pages[] map instead of splitting that operation into pieces.
  1221. * Could easily be exported as a generic helper for other users, in which
  1222. * case one would probably want to add a 'max_nr_pages' parameter as well.
  1223. */
  1224. static int get_iovec_page_array(const struct iovec __user *iov,
  1225. unsigned int nr_vecs, struct page **pages,
  1226. struct partial_page *partial, bool aligned,
  1227. unsigned int pipe_buffers)
  1228. {
  1229. int buffers = 0, error = 0;
  1230. while (nr_vecs) {
  1231. unsigned long off, npages;
  1232. struct iovec entry;
  1233. void __user *base;
  1234. size_t len;
  1235. int i;
  1236. error = -EFAULT;
  1237. if (copy_from_user(&entry, iov, sizeof(entry)))
  1238. break;
  1239. base = entry.iov_base;
  1240. len = entry.iov_len;
  1241. /*
  1242. * Sanity check this iovec. 0 read succeeds.
  1243. */
  1244. error = 0;
  1245. if (unlikely(!len))
  1246. break;
  1247. error = -EFAULT;
  1248. if (!access_ok(VERIFY_READ, base, len))
  1249. break;
  1250. /*
  1251. * Get this base offset and number of pages, then map
  1252. * in the user pages.
  1253. */
  1254. off = (unsigned long) base & ~PAGE_MASK;
  1255. /*
  1256. * If asked for alignment, the offset must be zero and the
  1257. * length a multiple of the PAGE_SIZE.
  1258. */
  1259. error = -EINVAL;
  1260. if (aligned && (off || len & ~PAGE_MASK))
  1261. break;
  1262. npages = (off + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
  1263. if (npages > pipe_buffers - buffers)
  1264. npages = pipe_buffers - buffers;
  1265. error = get_user_pages_fast((unsigned long)base, npages,
  1266. 0, &pages[buffers]);
  1267. if (unlikely(error <= 0))
  1268. break;
  1269. /*
  1270. * Fill this contiguous range into the partial page map.
  1271. */
  1272. for (i = 0; i < error; i++) {
  1273. const int plen = min_t(size_t, len, PAGE_SIZE - off);
  1274. partial[buffers].offset = off;
  1275. partial[buffers].len = plen;
  1276. off = 0;
  1277. len -= plen;
  1278. buffers++;
  1279. }
  1280. /*
  1281. * We didn't complete this iov, stop here since it probably
  1282. * means we have to move some of this into a pipe to
  1283. * be able to continue.
  1284. */
  1285. if (len)
  1286. break;
  1287. /*
  1288. * Don't continue if we mapped fewer pages than we asked for,
  1289. * or if we mapped the max number of pages that we have
  1290. * room for.
  1291. */
  1292. if (error < npages || buffers == pipe_buffers)
  1293. break;
  1294. nr_vecs--;
  1295. iov++;
  1296. }
  1297. if (buffers)
  1298. return buffers;
  1299. return error;
  1300. }
  1301. static int pipe_to_user(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
  1302. struct splice_desc *sd)
  1303. {
  1304. int n = copy_page_to_iter(buf->page, buf->offset, sd->len, sd->u.data);
  1305. return n == sd->len ? n : -EFAULT;
  1306. }
  1307. /*
  1308. * For lack of a better implementation, implement vmsplice() to userspace
  1309. * as a simple copy of the pipes pages to the user iov.
  1310. */
  1311. static long vmsplice_to_user(struct file *file, const struct iovec __user *uiov,
  1312. unsigned long nr_segs, unsigned int flags)
  1313. {
  1314. struct pipe_inode_info *pipe;
  1315. struct splice_desc sd;
  1316. long ret;
  1317. struct iovec iovstack[UIO_FASTIOV];
  1318. struct iovec *iov = iovstack;
  1319. struct iov_iter iter;
  1320. pipe = get_pipe_info(file);
  1321. if (!pipe)
  1322. return -EBADF;
  1323. ret = import_iovec(READ, uiov, nr_segs,
  1324. ARRAY_SIZE(iovstack), &iov, &iter);
  1325. if (ret < 0)
  1326. return ret;
  1327. sd.total_len = iov_iter_count(&iter);
  1328. sd.len = 0;
  1329. sd.flags = flags;
  1330. sd.u.data = &iter;
  1331. sd.pos = 0;
  1332. if (sd.total_len) {
  1333. pipe_lock(pipe);
  1334. ret = __splice_from_pipe(pipe, &sd, pipe_to_user);
  1335. pipe_unlock(pipe);
  1336. }
  1337. kfree(iov);
  1338. return ret;
  1339. }
  1340. /*
  1341. * vmsplice splices a user address range into a pipe. It can be thought of
  1342. * as splice-from-memory, where the regular splice is splice-from-file (or
  1343. * to file). In both cases the output is a pipe, naturally.
  1344. */
  1345. static long vmsplice_to_pipe(struct file *file, const struct iovec __user *iov,
  1346. unsigned long nr_segs, unsigned int flags)
  1347. {
  1348. struct pipe_inode_info *pipe;
  1349. struct page *pages[PIPE_DEF_BUFFERS];
  1350. struct partial_page partial[PIPE_DEF_BUFFERS];
  1351. struct splice_pipe_desc spd = {
  1352. .pages = pages,
  1353. .partial = partial,
  1354. .nr_pages_max = PIPE_DEF_BUFFERS,
  1355. .flags = flags,
  1356. .ops = &user_page_pipe_buf_ops,
  1357. .spd_release = spd_release_page,
  1358. };
  1359. long ret;
  1360. pipe = get_pipe_info(file);
  1361. if (!pipe)
  1362. return -EBADF;
  1363. if (splice_grow_spd(pipe, &spd))
  1364. return -ENOMEM;
  1365. spd.nr_pages = get_iovec_page_array(iov, nr_segs, spd.pages,
  1366. spd.partial, false,
  1367. spd.nr_pages_max);
  1368. if (spd.nr_pages <= 0)
  1369. ret = spd.nr_pages;
  1370. else
  1371. ret = splice_to_pipe(pipe, &spd);
  1372. splice_shrink_spd(&spd);
  1373. return ret;
  1374. }
  1375. /*
  1376. * Note that vmsplice only really supports true splicing _from_ user memory
  1377. * to a pipe, not the other way around. Splicing from user memory is a simple
  1378. * operation that can be supported without any funky alignment restrictions
  1379. * or nasty vm tricks. We simply map in the user memory and fill them into
  1380. * a pipe. The reverse isn't quite as easy, though. There are two possible
  1381. * solutions for that:
  1382. *
  1383. * - memcpy() the data internally, at which point we might as well just
  1384. * do a regular read() on the buffer anyway.
  1385. * - Lots of nasty vm tricks, that are neither fast nor flexible (it
  1386. * has restriction limitations on both ends of the pipe).
  1387. *
  1388. * Currently we punt and implement it as a normal copy, see pipe_to_user().
  1389. *
  1390. */
  1391. SYSCALL_DEFINE4(vmsplice, int, fd, const struct iovec __user *, iov,
  1392. unsigned long, nr_segs, unsigned int, flags)
  1393. {
  1394. struct fd f;
  1395. long error;
  1396. if (unlikely(nr_segs > UIO_MAXIOV))
  1397. return -EINVAL;
  1398. else if (unlikely(!nr_segs))
  1399. return 0;
  1400. error = -EBADF;
  1401. f = fdget(fd);
  1402. if (f.file) {
  1403. if (f.file->f_mode & FMODE_WRITE)
  1404. error = vmsplice_to_pipe(f.file, iov, nr_segs, flags);
  1405. else if (f.file->f_mode & FMODE_READ)
  1406. error = vmsplice_to_user(f.file, iov, nr_segs, flags);
  1407. fdput(f);
  1408. }
  1409. return error;
  1410. }
  1411. #ifdef CONFIG_COMPAT
  1412. COMPAT_SYSCALL_DEFINE4(vmsplice, int, fd, const struct compat_iovec __user *, iov32,
  1413. unsigned int, nr_segs, unsigned int, flags)
  1414. {
  1415. unsigned i;
  1416. struct iovec __user *iov;
  1417. if (nr_segs > UIO_MAXIOV)
  1418. return -EINVAL;
  1419. iov = compat_alloc_user_space(nr_segs * sizeof(struct iovec));
  1420. for (i = 0; i < nr_segs; i++) {
  1421. struct compat_iovec v;
  1422. if (get_user(v.iov_base, &iov32[i].iov_base) ||
  1423. get_user(v.iov_len, &iov32[i].iov_len) ||
  1424. put_user(compat_ptr(v.iov_base), &iov[i].iov_base) ||
  1425. put_user(v.iov_len, &iov[i].iov_len))
  1426. return -EFAULT;
  1427. }
  1428. return sys_vmsplice(fd, iov, nr_segs, flags);
  1429. }
  1430. #endif
  1431. SYSCALL_DEFINE6(splice, int, fd_in, loff_t __user *, off_in,
  1432. int, fd_out, loff_t __user *, off_out,
  1433. size_t, len, unsigned int, flags)
  1434. {
  1435. struct fd in, out;
  1436. long error;
  1437. if (unlikely(!len))
  1438. return 0;
  1439. error = -EBADF;
  1440. in = fdget(fd_in);
  1441. if (in.file) {
  1442. if (in.file->f_mode & FMODE_READ) {
  1443. out = fdget(fd_out);
  1444. if (out.file) {
  1445. if (out.file->f_mode & FMODE_WRITE)
  1446. error = do_splice(in.file, off_in,
  1447. out.file, off_out,
  1448. len, flags);
  1449. fdput(out);
  1450. }
  1451. }
  1452. fdput(in);
  1453. }
  1454. return error;
  1455. }
  1456. /*
  1457. * Make sure there's data to read. Wait for input if we can, otherwise
  1458. * return an appropriate error.
  1459. */
  1460. static int ipipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
  1461. {
  1462. int ret;
  1463. /*
  1464. * Check ->nrbufs without the inode lock first. This function
  1465. * is speculative anyways, so missing one is ok.
  1466. */
  1467. if (pipe->nrbufs)
  1468. return 0;
  1469. ret = 0;
  1470. pipe_lock(pipe);
  1471. while (!pipe->nrbufs) {
  1472. if (signal_pending(current)) {
  1473. ret = -ERESTARTSYS;
  1474. break;
  1475. }
  1476. if (!pipe->writers)
  1477. break;
  1478. if (!pipe->waiting_writers) {
  1479. if (flags & SPLICE_F_NONBLOCK) {
  1480. ret = -EAGAIN;
  1481. break;
  1482. }
  1483. }
  1484. pipe_wait(pipe);
  1485. }
  1486. pipe_unlock(pipe);
  1487. return ret;
  1488. }
  1489. /*
  1490. * Make sure there's writeable room. Wait for room if we can, otherwise
  1491. * return an appropriate error.
  1492. */
  1493. static int opipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
  1494. {
  1495. int ret;
  1496. /*
  1497. * Check ->nrbufs without the inode lock first. This function
  1498. * is speculative anyways, so missing one is ok.
  1499. */
  1500. if (pipe->nrbufs < pipe->buffers)
  1501. return 0;
  1502. ret = 0;
  1503. pipe_lock(pipe);
  1504. while (pipe->nrbufs >= pipe->buffers) {
  1505. if (!pipe->readers) {
  1506. send_sig(SIGPIPE, current, 0);
  1507. ret = -EPIPE;
  1508. break;
  1509. }
  1510. if (flags & SPLICE_F_NONBLOCK) {
  1511. ret = -EAGAIN;
  1512. break;
  1513. }
  1514. if (signal_pending(current)) {
  1515. ret = -ERESTARTSYS;
  1516. break;
  1517. }
  1518. pipe->waiting_writers++;
  1519. pipe_wait(pipe);
  1520. pipe->waiting_writers--;
  1521. }
  1522. pipe_unlock(pipe);
  1523. return ret;
  1524. }
  1525. /*
  1526. * Splice contents of ipipe to opipe.
  1527. */
  1528. static int splice_pipe_to_pipe(struct pipe_inode_info *ipipe,
  1529. struct pipe_inode_info *opipe,
  1530. size_t len, unsigned int flags)
  1531. {
  1532. struct pipe_buffer *ibuf, *obuf;
  1533. int ret = 0, nbuf;
  1534. bool input_wakeup = false;
  1535. retry:
  1536. ret = ipipe_prep(ipipe, flags);
  1537. if (ret)
  1538. return ret;
  1539. ret = opipe_prep(opipe, flags);
  1540. if (ret)
  1541. return ret;
  1542. /*
  1543. * Potential ABBA deadlock, work around it by ordering lock
  1544. * grabbing by pipe info address. Otherwise two different processes
  1545. * could deadlock (one doing tee from A -> B, the other from B -> A).
  1546. */
  1547. pipe_double_lock(ipipe, opipe);
  1548. do {
  1549. if (!opipe->readers) {
  1550. send_sig(SIGPIPE, current, 0);
  1551. if (!ret)
  1552. ret = -EPIPE;
  1553. break;
  1554. }
  1555. if (!ipipe->nrbufs && !ipipe->writers)
  1556. break;
  1557. /*
  1558. * Cannot make any progress, because either the input
  1559. * pipe is empty or the output pipe is full.
  1560. */
  1561. if (!ipipe->nrbufs || opipe->nrbufs >= opipe->buffers) {
  1562. /* Already processed some buffers, break */
  1563. if (ret)
  1564. break;
  1565. if (flags & SPLICE_F_NONBLOCK) {
  1566. ret = -EAGAIN;
  1567. break;
  1568. }
  1569. /*
  1570. * We raced with another reader/writer and haven't
  1571. * managed to process any buffers. A zero return
  1572. * value means EOF, so retry instead.
  1573. */
  1574. pipe_unlock(ipipe);
  1575. pipe_unlock(opipe);
  1576. goto retry;
  1577. }
  1578. ibuf = ipipe->bufs + ipipe->curbuf;
  1579. nbuf = (opipe->curbuf + opipe->nrbufs) & (opipe->buffers - 1);
  1580. obuf = opipe->bufs + nbuf;
  1581. if (len >= ibuf->len) {
  1582. /*
  1583. * Simply move the whole buffer from ipipe to opipe
  1584. */
  1585. *obuf = *ibuf;
  1586. ibuf->ops = NULL;
  1587. opipe->nrbufs++;
  1588. ipipe->curbuf = (ipipe->curbuf + 1) & (ipipe->buffers - 1);
  1589. ipipe->nrbufs--;
  1590. input_wakeup = true;
  1591. } else {
  1592. /*
  1593. * Get a reference to this pipe buffer,
  1594. * so we can copy the contents over.
  1595. */
  1596. ibuf->ops->get(ipipe, ibuf);
  1597. *obuf = *ibuf;
  1598. /*
  1599. * Don't inherit the gift flag, we need to
  1600. * prevent multiple steals of this page.
  1601. */
  1602. obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
  1603. obuf->len = len;
  1604. opipe->nrbufs++;
  1605. ibuf->offset += obuf->len;
  1606. ibuf->len -= obuf->len;
  1607. }
  1608. ret += obuf->len;
  1609. len -= obuf->len;
  1610. } while (len);
  1611. pipe_unlock(ipipe);
  1612. pipe_unlock(opipe);
  1613. /*
  1614. * If we put data in the output pipe, wakeup any potential readers.
  1615. */
  1616. if (ret > 0)
  1617. wakeup_pipe_readers(opipe);
  1618. if (input_wakeup)
  1619. wakeup_pipe_writers(ipipe);
  1620. return ret;
  1621. }
  1622. /*
  1623. * Link contents of ipipe to opipe.
  1624. */
  1625. static int link_pipe(struct pipe_inode_info *ipipe,
  1626. struct pipe_inode_info *opipe,
  1627. size_t len, unsigned int flags)
  1628. {
  1629. struct pipe_buffer *ibuf, *obuf;
  1630. int ret = 0, i = 0, nbuf;
  1631. /*
  1632. * Potential ABBA deadlock, work around it by ordering lock
  1633. * grabbing by pipe info address. Otherwise two different processes
  1634. * could deadlock (one doing tee from A -> B, the other from B -> A).
  1635. */
  1636. pipe_double_lock(ipipe, opipe);
  1637. do {
  1638. if (!opipe->readers) {
  1639. send_sig(SIGPIPE, current, 0);
  1640. if (!ret)
  1641. ret = -EPIPE;
  1642. break;
  1643. }
  1644. /*
  1645. * If we have iterated all input buffers or ran out of
  1646. * output room, break.
  1647. */
  1648. if (i >= ipipe->nrbufs || opipe->nrbufs >= opipe->buffers)
  1649. break;
  1650. ibuf = ipipe->bufs + ((ipipe->curbuf + i) & (ipipe->buffers-1));
  1651. nbuf = (opipe->curbuf + opipe->nrbufs) & (opipe->buffers - 1);
  1652. /*
  1653. * Get a reference to this pipe buffer,
  1654. * so we can copy the contents over.
  1655. */
  1656. ibuf->ops->get(ipipe, ibuf);
  1657. obuf = opipe->bufs + nbuf;
  1658. *obuf = *ibuf;
  1659. /*
  1660. * Don't inherit the gift flag, we need to
  1661. * prevent multiple steals of this page.
  1662. */
  1663. obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
  1664. if (obuf->len > len)
  1665. obuf->len = len;
  1666. opipe->nrbufs++;
  1667. ret += obuf->len;
  1668. len -= obuf->len;
  1669. i++;
  1670. } while (len);
  1671. /*
  1672. * return EAGAIN if we have the potential of some data in the
  1673. * future, otherwise just return 0
  1674. */
  1675. if (!ret && ipipe->waiting_writers && (flags & SPLICE_F_NONBLOCK))
  1676. ret = -EAGAIN;
  1677. pipe_unlock(ipipe);
  1678. pipe_unlock(opipe);
  1679. /*
  1680. * If we put data in the output pipe, wakeup any potential readers.
  1681. */
  1682. if (ret > 0)
  1683. wakeup_pipe_readers(opipe);
  1684. return ret;
  1685. }
  1686. /*
  1687. * This is a tee(1) implementation that works on pipes. It doesn't copy
  1688. * any data, it simply references the 'in' pages on the 'out' pipe.
  1689. * The 'flags' used are the SPLICE_F_* variants, currently the only
  1690. * applicable one is SPLICE_F_NONBLOCK.
  1691. */
  1692. static long do_tee(struct file *in, struct file *out, size_t len,
  1693. unsigned int flags)
  1694. {
  1695. struct pipe_inode_info *ipipe = get_pipe_info(in);
  1696. struct pipe_inode_info *opipe = get_pipe_info(out);
  1697. int ret = -EINVAL;
  1698. /*
  1699. * Duplicate the contents of ipipe to opipe without actually
  1700. * copying the data.
  1701. */
  1702. if (ipipe && opipe && ipipe != opipe) {
  1703. /*
  1704. * Keep going, unless we encounter an error. The ipipe/opipe
  1705. * ordering doesn't really matter.
  1706. */
  1707. ret = ipipe_prep(ipipe, flags);
  1708. if (!ret) {
  1709. ret = opipe_prep(opipe, flags);
  1710. if (!ret)
  1711. ret = link_pipe(ipipe, opipe, len, flags);
  1712. }
  1713. }
  1714. return ret;
  1715. }
  1716. SYSCALL_DEFINE4(tee, int, fdin, int, fdout, size_t, len, unsigned int, flags)
  1717. {
  1718. struct fd in;
  1719. int error;
  1720. if (unlikely(!len))
  1721. return 0;
  1722. error = -EBADF;
  1723. in = fdget(fdin);
  1724. if (in.file) {
  1725. if (in.file->f_mode & FMODE_READ) {
  1726. struct fd out = fdget(fdout);
  1727. if (out.file) {
  1728. if (out.file->f_mode & FMODE_WRITE)
  1729. error = do_tee(in.file, out.file,
  1730. len, flags);
  1731. fdput(out);
  1732. }
  1733. }
  1734. fdput(in);
  1735. }
  1736. return error;
  1737. }