splice.c 36 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579
  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/pipe_fs_i.h>
  24. #include <linux/mm_inline.h>
  25. #include <linux/swap.h>
  26. #include <linux/writeback.h>
  27. #include <linux/buffer_head.h>
  28. #include <linux/module.h>
  29. #include <linux/syscalls.h>
  30. #include <linux/uio.h>
  31. struct partial_page {
  32. unsigned int offset;
  33. unsigned int len;
  34. };
  35. /*
  36. * Passed to splice_to_pipe
  37. */
  38. struct splice_pipe_desc {
  39. struct page **pages; /* page map */
  40. struct partial_page *partial; /* pages[] may not be contig */
  41. int nr_pages; /* number of pages in map */
  42. unsigned int flags; /* splice flags */
  43. const struct pipe_buf_operations *ops;/* ops associated with output pipe */
  44. };
  45. /*
  46. * Attempt to steal a page from a pipe buffer. This should perhaps go into
  47. * a vm helper function, it's already simplified quite a bit by the
  48. * addition of remove_mapping(). If success is returned, the caller may
  49. * attempt to reuse this page for another destination.
  50. */
  51. static int page_cache_pipe_buf_steal(struct pipe_inode_info *pipe,
  52. struct pipe_buffer *buf)
  53. {
  54. struct page *page = buf->page;
  55. struct address_space *mapping;
  56. lock_page(page);
  57. mapping = page_mapping(page);
  58. if (mapping) {
  59. WARN_ON(!PageUptodate(page));
  60. /*
  61. * At least for ext2 with nobh option, we need to wait on
  62. * writeback completing on this page, since we'll remove it
  63. * from the pagecache. Otherwise truncate wont wait on the
  64. * page, allowing the disk blocks to be reused by someone else
  65. * before we actually wrote our data to them. fs corruption
  66. * ensues.
  67. */
  68. wait_on_page_writeback(page);
  69. if (PagePrivate(page))
  70. try_to_release_page(page, GFP_KERNEL);
  71. /*
  72. * If we succeeded in removing the mapping, set LRU flag
  73. * and return good.
  74. */
  75. if (remove_mapping(mapping, page)) {
  76. buf->flags |= PIPE_BUF_FLAG_LRU;
  77. return 0;
  78. }
  79. }
  80. /*
  81. * Raced with truncate or failed to remove page from current
  82. * address space, unlock and return failure.
  83. */
  84. unlock_page(page);
  85. return 1;
  86. }
  87. static void page_cache_pipe_buf_release(struct pipe_inode_info *pipe,
  88. struct pipe_buffer *buf)
  89. {
  90. page_cache_release(buf->page);
  91. buf->flags &= ~PIPE_BUF_FLAG_LRU;
  92. }
  93. static int page_cache_pipe_buf_pin(struct pipe_inode_info *pipe,
  94. struct pipe_buffer *buf)
  95. {
  96. struct page *page = buf->page;
  97. int err;
  98. if (!PageUptodate(page)) {
  99. lock_page(page);
  100. /*
  101. * Page got truncated/unhashed. This will cause a 0-byte
  102. * splice, if this is the first page.
  103. */
  104. if (!page->mapping) {
  105. err = -ENODATA;
  106. goto error;
  107. }
  108. /*
  109. * Uh oh, read-error from disk.
  110. */
  111. if (!PageUptodate(page)) {
  112. err = -EIO;
  113. goto error;
  114. }
  115. /*
  116. * Page is ok afterall, we are done.
  117. */
  118. unlock_page(page);
  119. }
  120. return 0;
  121. error:
  122. unlock_page(page);
  123. return err;
  124. }
  125. static const struct pipe_buf_operations page_cache_pipe_buf_ops = {
  126. .can_merge = 0,
  127. .map = generic_pipe_buf_map,
  128. .unmap = generic_pipe_buf_unmap,
  129. .pin = page_cache_pipe_buf_pin,
  130. .release = page_cache_pipe_buf_release,
  131. .steal = page_cache_pipe_buf_steal,
  132. .get = generic_pipe_buf_get,
  133. };
  134. static int user_page_pipe_buf_steal(struct pipe_inode_info *pipe,
  135. struct pipe_buffer *buf)
  136. {
  137. if (!(buf->flags & PIPE_BUF_FLAG_GIFT))
  138. return 1;
  139. buf->flags |= PIPE_BUF_FLAG_LRU;
  140. return generic_pipe_buf_steal(pipe, buf);
  141. }
  142. static const struct pipe_buf_operations user_page_pipe_buf_ops = {
  143. .can_merge = 0,
  144. .map = generic_pipe_buf_map,
  145. .unmap = generic_pipe_buf_unmap,
  146. .pin = generic_pipe_buf_pin,
  147. .release = page_cache_pipe_buf_release,
  148. .steal = user_page_pipe_buf_steal,
  149. .get = generic_pipe_buf_get,
  150. };
  151. /*
  152. * Pipe output worker. This sets up our pipe format with the page cache
  153. * pipe buffer operations. Otherwise very similar to the regular pipe_writev().
  154. */
  155. static ssize_t splice_to_pipe(struct pipe_inode_info *pipe,
  156. struct splice_pipe_desc *spd)
  157. {
  158. int ret, do_wakeup, page_nr;
  159. ret = 0;
  160. do_wakeup = 0;
  161. page_nr = 0;
  162. if (pipe->inode)
  163. mutex_lock(&pipe->inode->i_mutex);
  164. for (;;) {
  165. if (!pipe->readers) {
  166. send_sig(SIGPIPE, current, 0);
  167. if (!ret)
  168. ret = -EPIPE;
  169. break;
  170. }
  171. if (pipe->nrbufs < PIPE_BUFFERS) {
  172. int newbuf = (pipe->curbuf + pipe->nrbufs) & (PIPE_BUFFERS - 1);
  173. struct pipe_buffer *buf = pipe->bufs + newbuf;
  174. buf->page = spd->pages[page_nr];
  175. buf->offset = spd->partial[page_nr].offset;
  176. buf->len = spd->partial[page_nr].len;
  177. buf->ops = spd->ops;
  178. if (spd->flags & SPLICE_F_GIFT)
  179. buf->flags |= PIPE_BUF_FLAG_GIFT;
  180. pipe->nrbufs++;
  181. page_nr++;
  182. ret += buf->len;
  183. if (pipe->inode)
  184. do_wakeup = 1;
  185. if (!--spd->nr_pages)
  186. break;
  187. if (pipe->nrbufs < PIPE_BUFFERS)
  188. continue;
  189. break;
  190. }
  191. if (spd->flags & SPLICE_F_NONBLOCK) {
  192. if (!ret)
  193. ret = -EAGAIN;
  194. break;
  195. }
  196. if (signal_pending(current)) {
  197. if (!ret)
  198. ret = -ERESTARTSYS;
  199. break;
  200. }
  201. if (do_wakeup) {
  202. smp_mb();
  203. if (waitqueue_active(&pipe->wait))
  204. wake_up_interruptible_sync(&pipe->wait);
  205. kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
  206. do_wakeup = 0;
  207. }
  208. pipe->waiting_writers++;
  209. pipe_wait(pipe);
  210. pipe->waiting_writers--;
  211. }
  212. if (pipe->inode)
  213. mutex_unlock(&pipe->inode->i_mutex);
  214. if (do_wakeup) {
  215. smp_mb();
  216. if (waitqueue_active(&pipe->wait))
  217. wake_up_interruptible(&pipe->wait);
  218. kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN);
  219. }
  220. while (page_nr < spd->nr_pages)
  221. page_cache_release(spd->pages[page_nr++]);
  222. return ret;
  223. }
  224. static int
  225. __generic_file_splice_read(struct file *in, loff_t *ppos,
  226. struct pipe_inode_info *pipe, size_t len,
  227. unsigned int flags)
  228. {
  229. struct address_space *mapping = in->f_mapping;
  230. unsigned int loff, nr_pages;
  231. struct page *pages[PIPE_BUFFERS];
  232. struct partial_page partial[PIPE_BUFFERS];
  233. struct page *page;
  234. pgoff_t index, end_index;
  235. loff_t isize;
  236. size_t total_len;
  237. int error, page_nr;
  238. struct splice_pipe_desc spd = {
  239. .pages = pages,
  240. .partial = partial,
  241. .flags = flags,
  242. .ops = &page_cache_pipe_buf_ops,
  243. };
  244. index = *ppos >> PAGE_CACHE_SHIFT;
  245. loff = *ppos & ~PAGE_CACHE_MASK;
  246. nr_pages = (len + loff + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
  247. if (nr_pages > PIPE_BUFFERS)
  248. nr_pages = PIPE_BUFFERS;
  249. /*
  250. * Initiate read-ahead on this page range. however, don't call into
  251. * read-ahead if this is a non-zero offset (we are likely doing small
  252. * chunk splice and the page is already there) for a single page.
  253. */
  254. if (!loff || nr_pages > 1)
  255. page_cache_readahead(mapping, &in->f_ra, in, index, nr_pages);
  256. /*
  257. * Now fill in the holes:
  258. */
  259. error = 0;
  260. total_len = 0;
  261. /*
  262. * Lookup the (hopefully) full range of pages we need.
  263. */
  264. spd.nr_pages = find_get_pages_contig(mapping, index, nr_pages, pages);
  265. /*
  266. * If find_get_pages_contig() returned fewer pages than we needed,
  267. * allocate the rest.
  268. */
  269. index += spd.nr_pages;
  270. while (spd.nr_pages < nr_pages) {
  271. /*
  272. * Page could be there, find_get_pages_contig() breaks on
  273. * the first hole.
  274. */
  275. page = find_get_page(mapping, index);
  276. if (!page) {
  277. /*
  278. * Make sure the read-ahead engine is notified
  279. * about this failure.
  280. */
  281. handle_ra_miss(mapping, &in->f_ra, index);
  282. /*
  283. * page didn't exist, allocate one.
  284. */
  285. page = page_cache_alloc_cold(mapping);
  286. if (!page)
  287. break;
  288. error = add_to_page_cache_lru(page, mapping, index,
  289. GFP_KERNEL);
  290. if (unlikely(error)) {
  291. page_cache_release(page);
  292. if (error == -EEXIST)
  293. continue;
  294. break;
  295. }
  296. /*
  297. * add_to_page_cache() locks the page, unlock it
  298. * to avoid convoluting the logic below even more.
  299. */
  300. unlock_page(page);
  301. }
  302. pages[spd.nr_pages++] = page;
  303. index++;
  304. }
  305. /*
  306. * Now loop over the map and see if we need to start IO on any
  307. * pages, fill in the partial map, etc.
  308. */
  309. index = *ppos >> PAGE_CACHE_SHIFT;
  310. nr_pages = spd.nr_pages;
  311. spd.nr_pages = 0;
  312. for (page_nr = 0; page_nr < nr_pages; page_nr++) {
  313. unsigned int this_len;
  314. if (!len)
  315. break;
  316. /*
  317. * this_len is the max we'll use from this page
  318. */
  319. this_len = min_t(unsigned long, len, PAGE_CACHE_SIZE - loff);
  320. page = pages[page_nr];
  321. /*
  322. * If the page isn't uptodate, we may need to start io on it
  323. */
  324. if (!PageUptodate(page)) {
  325. /*
  326. * If in nonblock mode then dont block on waiting
  327. * for an in-flight io page
  328. */
  329. if (flags & SPLICE_F_NONBLOCK)
  330. break;
  331. lock_page(page);
  332. /*
  333. * page was truncated, stop here. if this isn't the
  334. * first page, we'll just complete what we already
  335. * added
  336. */
  337. if (!page->mapping) {
  338. unlock_page(page);
  339. break;
  340. }
  341. /*
  342. * page was already under io and is now done, great
  343. */
  344. if (PageUptodate(page)) {
  345. unlock_page(page);
  346. goto fill_it;
  347. }
  348. /*
  349. * need to read in the page
  350. */
  351. error = mapping->a_ops->readpage(in, page);
  352. if (unlikely(error)) {
  353. /*
  354. * We really should re-lookup the page here,
  355. * but it complicates things a lot. Instead
  356. * lets just do what we already stored, and
  357. * we'll get it the next time we are called.
  358. */
  359. if (error == AOP_TRUNCATED_PAGE)
  360. error = 0;
  361. break;
  362. }
  363. /*
  364. * i_size must be checked after ->readpage().
  365. */
  366. isize = i_size_read(mapping->host);
  367. end_index = (isize - 1) >> PAGE_CACHE_SHIFT;
  368. if (unlikely(!isize || index > end_index))
  369. break;
  370. /*
  371. * if this is the last page, see if we need to shrink
  372. * the length and stop
  373. */
  374. if (end_index == index) {
  375. loff = PAGE_CACHE_SIZE - (isize & ~PAGE_CACHE_MASK);
  376. if (total_len + loff > isize)
  377. break;
  378. /*
  379. * force quit after adding this page
  380. */
  381. len = this_len;
  382. this_len = min(this_len, loff);
  383. loff = 0;
  384. }
  385. }
  386. fill_it:
  387. partial[page_nr].offset = loff;
  388. partial[page_nr].len = this_len;
  389. len -= this_len;
  390. total_len += this_len;
  391. loff = 0;
  392. spd.nr_pages++;
  393. index++;
  394. }
  395. /*
  396. * Release any pages at the end, if we quit early. 'i' is how far
  397. * we got, 'nr_pages' is how many pages are in the map.
  398. */
  399. while (page_nr < nr_pages)
  400. page_cache_release(pages[page_nr++]);
  401. if (spd.nr_pages)
  402. return splice_to_pipe(pipe, &spd);
  403. return error;
  404. }
  405. /**
  406. * generic_file_splice_read - splice data from file to a pipe
  407. * @in: file to splice from
  408. * @pipe: pipe to splice to
  409. * @len: number of bytes to splice
  410. * @flags: splice modifier flags
  411. *
  412. * Will read pages from given file and fill them into a pipe.
  413. */
  414. ssize_t generic_file_splice_read(struct file *in, loff_t *ppos,
  415. struct pipe_inode_info *pipe, size_t len,
  416. unsigned int flags)
  417. {
  418. ssize_t spliced;
  419. int ret;
  420. ret = 0;
  421. spliced = 0;
  422. while (len) {
  423. ret = __generic_file_splice_read(in, ppos, pipe, len, flags);
  424. if (ret < 0)
  425. break;
  426. else if (!ret) {
  427. if (spliced)
  428. break;
  429. if (flags & SPLICE_F_NONBLOCK) {
  430. ret = -EAGAIN;
  431. break;
  432. }
  433. }
  434. *ppos += ret;
  435. len -= ret;
  436. spliced += ret;
  437. }
  438. if (spliced)
  439. return spliced;
  440. return ret;
  441. }
  442. EXPORT_SYMBOL(generic_file_splice_read);
  443. /*
  444. * Send 'sd->len' bytes to socket from 'sd->file' at position 'sd->pos'
  445. * using sendpage(). Return the number of bytes sent.
  446. */
  447. static int pipe_to_sendpage(struct pipe_inode_info *pipe,
  448. struct pipe_buffer *buf, struct splice_desc *sd)
  449. {
  450. struct file *file = sd->file;
  451. loff_t pos = sd->pos;
  452. int ret, more;
  453. ret = buf->ops->pin(pipe, buf);
  454. if (!ret) {
  455. more = (sd->flags & SPLICE_F_MORE) || sd->len < sd->total_len;
  456. ret = file->f_op->sendpage(file, buf->page, buf->offset,
  457. sd->len, &pos, more);
  458. }
  459. return ret;
  460. }
  461. /*
  462. * This is a little more tricky than the file -> pipe splicing. There are
  463. * basically three cases:
  464. *
  465. * - Destination page already exists in the address space and there
  466. * are users of it. For that case we have no other option that
  467. * copying the data. Tough luck.
  468. * - Destination page already exists in the address space, but there
  469. * are no users of it. Make sure it's uptodate, then drop it. Fall
  470. * through to last case.
  471. * - Destination page does not exist, we can add the pipe page to
  472. * the page cache and avoid the copy.
  473. *
  474. * If asked to move pages to the output file (SPLICE_F_MOVE is set in
  475. * sd->flags), we attempt to migrate pages from the pipe to the output
  476. * file address space page cache. This is possible if no one else has
  477. * the pipe page referenced outside of the pipe and page cache. If
  478. * SPLICE_F_MOVE isn't set, or we cannot move the page, we simply create
  479. * a new page in the output file page cache and fill/dirty that.
  480. */
  481. static int pipe_to_file(struct pipe_inode_info *pipe, struct pipe_buffer *buf,
  482. struct splice_desc *sd)
  483. {
  484. struct file *file = sd->file;
  485. struct address_space *mapping = file->f_mapping;
  486. unsigned int offset, this_len;
  487. struct page *page;
  488. pgoff_t index;
  489. int ret;
  490. /*
  491. * make sure the data in this buffer is uptodate
  492. */
  493. ret = buf->ops->pin(pipe, buf);
  494. if (unlikely(ret))
  495. return ret;
  496. index = sd->pos >> PAGE_CACHE_SHIFT;
  497. offset = sd->pos & ~PAGE_CACHE_MASK;
  498. this_len = sd->len;
  499. if (this_len + offset > PAGE_CACHE_SIZE)
  500. this_len = PAGE_CACHE_SIZE - offset;
  501. find_page:
  502. page = find_lock_page(mapping, index);
  503. if (!page) {
  504. ret = -ENOMEM;
  505. page = page_cache_alloc_cold(mapping);
  506. if (unlikely(!page))
  507. goto out_ret;
  508. /*
  509. * This will also lock the page
  510. */
  511. ret = add_to_page_cache_lru(page, mapping, index,
  512. GFP_KERNEL);
  513. if (unlikely(ret))
  514. goto out;
  515. }
  516. /*
  517. * We get here with the page locked. If the page is also
  518. * uptodate, we don't need to do more. If it isn't, we
  519. * may need to bring it in if we are not going to overwrite
  520. * the full page.
  521. */
  522. if (!PageUptodate(page)) {
  523. if (this_len < PAGE_CACHE_SIZE) {
  524. ret = mapping->a_ops->readpage(file, page);
  525. if (unlikely(ret))
  526. goto out;
  527. lock_page(page);
  528. if (!PageUptodate(page)) {
  529. /*
  530. * Page got invalidated, repeat.
  531. */
  532. if (!page->mapping) {
  533. unlock_page(page);
  534. page_cache_release(page);
  535. goto find_page;
  536. }
  537. ret = -EIO;
  538. goto out;
  539. }
  540. } else
  541. SetPageUptodate(page);
  542. }
  543. ret = mapping->a_ops->prepare_write(file, page, offset, offset+this_len);
  544. if (unlikely(ret)) {
  545. loff_t isize = i_size_read(mapping->host);
  546. if (ret != AOP_TRUNCATED_PAGE)
  547. unlock_page(page);
  548. page_cache_release(page);
  549. if (ret == AOP_TRUNCATED_PAGE)
  550. goto find_page;
  551. /*
  552. * prepare_write() may have instantiated a few blocks
  553. * outside i_size. Trim these off again.
  554. */
  555. if (sd->pos + this_len > isize)
  556. vmtruncate(mapping->host, isize);
  557. goto out_ret;
  558. }
  559. if (buf->page != page) {
  560. /*
  561. * Careful, ->map() uses KM_USER0!
  562. */
  563. char *src = buf->ops->map(pipe, buf, 1);
  564. char *dst = kmap_atomic(page, KM_USER1);
  565. memcpy(dst + offset, src + buf->offset, this_len);
  566. flush_dcache_page(page);
  567. kunmap_atomic(dst, KM_USER1);
  568. buf->ops->unmap(pipe, buf, src);
  569. }
  570. ret = mapping->a_ops->commit_write(file, page, offset, offset+this_len);
  571. if (!ret) {
  572. /*
  573. * Return the number of bytes written and mark page as
  574. * accessed, we are now done!
  575. */
  576. ret = this_len;
  577. mark_page_accessed(page);
  578. balance_dirty_pages_ratelimited(mapping);
  579. } else if (ret == AOP_TRUNCATED_PAGE) {
  580. page_cache_release(page);
  581. goto find_page;
  582. }
  583. out:
  584. page_cache_release(page);
  585. unlock_page(page);
  586. out_ret:
  587. return ret;
  588. }
  589. /*
  590. * Pipe input worker. Most of this logic works like a regular pipe, the
  591. * key here is the 'actor' worker passed in that actually moves the data
  592. * to the wanted destination. See pipe_to_file/pipe_to_sendpage above.
  593. */
  594. static ssize_t __splice_from_pipe(struct pipe_inode_info *pipe,
  595. struct file *out, loff_t *ppos, size_t len,
  596. unsigned int flags, splice_actor *actor)
  597. {
  598. int ret, do_wakeup, err;
  599. struct splice_desc sd;
  600. ret = 0;
  601. do_wakeup = 0;
  602. sd.total_len = len;
  603. sd.flags = flags;
  604. sd.file = out;
  605. sd.pos = *ppos;
  606. for (;;) {
  607. if (pipe->nrbufs) {
  608. struct pipe_buffer *buf = pipe->bufs + pipe->curbuf;
  609. const struct pipe_buf_operations *ops = buf->ops;
  610. sd.len = buf->len;
  611. if (sd.len > sd.total_len)
  612. sd.len = sd.total_len;
  613. err = actor(pipe, buf, &sd);
  614. if (err <= 0) {
  615. if (!ret && err != -ENODATA)
  616. ret = err;
  617. break;
  618. }
  619. ret += err;
  620. buf->offset += err;
  621. buf->len -= err;
  622. sd.len -= err;
  623. sd.pos += err;
  624. sd.total_len -= err;
  625. if (sd.len)
  626. continue;
  627. if (!buf->len) {
  628. buf->ops = NULL;
  629. ops->release(pipe, buf);
  630. pipe->curbuf = (pipe->curbuf + 1) & (PIPE_BUFFERS - 1);
  631. pipe->nrbufs--;
  632. if (pipe->inode)
  633. do_wakeup = 1;
  634. }
  635. if (!sd.total_len)
  636. break;
  637. }
  638. if (pipe->nrbufs)
  639. continue;
  640. if (!pipe->writers)
  641. break;
  642. if (!pipe->waiting_writers) {
  643. if (ret)
  644. break;
  645. }
  646. if (flags & SPLICE_F_NONBLOCK) {
  647. if (!ret)
  648. ret = -EAGAIN;
  649. break;
  650. }
  651. if (signal_pending(current)) {
  652. if (!ret)
  653. ret = -ERESTARTSYS;
  654. break;
  655. }
  656. if (do_wakeup) {
  657. smp_mb();
  658. if (waitqueue_active(&pipe->wait))
  659. wake_up_interruptible_sync(&pipe->wait);
  660. kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
  661. do_wakeup = 0;
  662. }
  663. pipe_wait(pipe);
  664. }
  665. if (do_wakeup) {
  666. smp_mb();
  667. if (waitqueue_active(&pipe->wait))
  668. wake_up_interruptible(&pipe->wait);
  669. kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT);
  670. }
  671. return ret;
  672. }
  673. ssize_t splice_from_pipe(struct pipe_inode_info *pipe, struct file *out,
  674. loff_t *ppos, size_t len, unsigned int flags,
  675. splice_actor *actor)
  676. {
  677. ssize_t ret;
  678. struct inode *inode = out->f_mapping->host;
  679. /*
  680. * The actor worker might be calling ->prepare_write and
  681. * ->commit_write. Most of the time, these expect i_mutex to
  682. * be held. Since this may result in an ABBA deadlock with
  683. * pipe->inode, we have to order lock acquiry here.
  684. */
  685. inode_double_lock(inode, pipe->inode);
  686. ret = __splice_from_pipe(pipe, out, ppos, len, flags, actor);
  687. inode_double_unlock(inode, pipe->inode);
  688. return ret;
  689. }
  690. /**
  691. * generic_file_splice_write_nolock - generic_file_splice_write without mutexes
  692. * @pipe: pipe info
  693. * @out: file to write to
  694. * @len: number of bytes to splice
  695. * @flags: splice modifier flags
  696. *
  697. * Will either move or copy pages (determined by @flags options) from
  698. * the given pipe inode to the given file. The caller is responsible
  699. * for acquiring i_mutex on both inodes.
  700. *
  701. */
  702. ssize_t
  703. generic_file_splice_write_nolock(struct pipe_inode_info *pipe, struct file *out,
  704. loff_t *ppos, size_t len, unsigned int flags)
  705. {
  706. struct address_space *mapping = out->f_mapping;
  707. struct inode *inode = mapping->host;
  708. ssize_t ret;
  709. int err;
  710. err = remove_suid(out->f_path.dentry);
  711. if (unlikely(err))
  712. return err;
  713. ret = __splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_file);
  714. if (ret > 0) {
  715. *ppos += ret;
  716. /*
  717. * If file or inode is SYNC and we actually wrote some data,
  718. * sync it.
  719. */
  720. if (unlikely((out->f_flags & O_SYNC) || IS_SYNC(inode))) {
  721. err = generic_osync_inode(inode, mapping,
  722. OSYNC_METADATA|OSYNC_DATA);
  723. if (err)
  724. ret = err;
  725. }
  726. }
  727. return ret;
  728. }
  729. EXPORT_SYMBOL(generic_file_splice_write_nolock);
  730. /**
  731. * generic_file_splice_write - splice data from a pipe to a file
  732. * @pipe: pipe info
  733. * @out: file to write to
  734. * @len: number of bytes to splice
  735. * @flags: splice modifier flags
  736. *
  737. * Will either move or copy pages (determined by @flags options) from
  738. * the given pipe inode to the given file.
  739. *
  740. */
  741. ssize_t
  742. generic_file_splice_write(struct pipe_inode_info *pipe, struct file *out,
  743. loff_t *ppos, size_t len, unsigned int flags)
  744. {
  745. struct address_space *mapping = out->f_mapping;
  746. struct inode *inode = mapping->host;
  747. ssize_t ret;
  748. int err;
  749. err = should_remove_suid(out->f_path.dentry);
  750. if (unlikely(err)) {
  751. mutex_lock(&inode->i_mutex);
  752. err = __remove_suid(out->f_path.dentry, err);
  753. mutex_unlock(&inode->i_mutex);
  754. if (err)
  755. return err;
  756. }
  757. ret = splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_file);
  758. if (ret > 0) {
  759. *ppos += ret;
  760. /*
  761. * If file or inode is SYNC and we actually wrote some data,
  762. * sync it.
  763. */
  764. if (unlikely((out->f_flags & O_SYNC) || IS_SYNC(inode))) {
  765. mutex_lock(&inode->i_mutex);
  766. err = generic_osync_inode(inode, mapping,
  767. OSYNC_METADATA|OSYNC_DATA);
  768. mutex_unlock(&inode->i_mutex);
  769. if (err)
  770. ret = err;
  771. }
  772. }
  773. return ret;
  774. }
  775. EXPORT_SYMBOL(generic_file_splice_write);
  776. /**
  777. * generic_splice_sendpage - splice data from a pipe to a socket
  778. * @inode: pipe inode
  779. * @out: socket to write to
  780. * @len: number of bytes to splice
  781. * @flags: splice modifier flags
  782. *
  783. * Will send @len bytes from the pipe to a network socket. No data copying
  784. * is involved.
  785. *
  786. */
  787. ssize_t generic_splice_sendpage(struct pipe_inode_info *pipe, struct file *out,
  788. loff_t *ppos, size_t len, unsigned int flags)
  789. {
  790. return splice_from_pipe(pipe, out, ppos, len, flags, pipe_to_sendpage);
  791. }
  792. EXPORT_SYMBOL(generic_splice_sendpage);
  793. /*
  794. * Attempt to initiate a splice from pipe to file.
  795. */
  796. static long do_splice_from(struct pipe_inode_info *pipe, struct file *out,
  797. loff_t *ppos, size_t len, unsigned int flags)
  798. {
  799. int ret;
  800. if (unlikely(!out->f_op || !out->f_op->splice_write))
  801. return -EINVAL;
  802. if (unlikely(!(out->f_mode & FMODE_WRITE)))
  803. return -EBADF;
  804. ret = rw_verify_area(WRITE, out, ppos, len);
  805. if (unlikely(ret < 0))
  806. return ret;
  807. return out->f_op->splice_write(pipe, out, ppos, len, flags);
  808. }
  809. /*
  810. * Attempt to initiate a splice from a file to a pipe.
  811. */
  812. static long do_splice_to(struct file *in, loff_t *ppos,
  813. struct pipe_inode_info *pipe, size_t len,
  814. unsigned int flags)
  815. {
  816. loff_t isize, left;
  817. int ret;
  818. if (unlikely(!in->f_op || !in->f_op->splice_read))
  819. return -EINVAL;
  820. if (unlikely(!(in->f_mode & FMODE_READ)))
  821. return -EBADF;
  822. ret = rw_verify_area(READ, in, ppos, len);
  823. if (unlikely(ret < 0))
  824. return ret;
  825. isize = i_size_read(in->f_mapping->host);
  826. if (unlikely(*ppos >= isize))
  827. return 0;
  828. left = isize - *ppos;
  829. if (unlikely(left < len))
  830. len = left;
  831. return in->f_op->splice_read(in, ppos, pipe, len, flags);
  832. }
  833. long do_splice_direct(struct file *in, loff_t *ppos, struct file *out,
  834. size_t len, unsigned int flags)
  835. {
  836. struct pipe_inode_info *pipe;
  837. long ret, bytes;
  838. loff_t out_off;
  839. umode_t i_mode;
  840. int i;
  841. /*
  842. * We require the input being a regular file, as we don't want to
  843. * randomly drop data for eg socket -> socket splicing. Use the
  844. * piped splicing for that!
  845. */
  846. i_mode = in->f_path.dentry->d_inode->i_mode;
  847. if (unlikely(!S_ISREG(i_mode) && !S_ISBLK(i_mode)))
  848. return -EINVAL;
  849. /*
  850. * neither in nor out is a pipe, setup an internal pipe attached to
  851. * 'out' and transfer the wanted data from 'in' to 'out' through that
  852. */
  853. pipe = current->splice_pipe;
  854. if (unlikely(!pipe)) {
  855. pipe = alloc_pipe_info(NULL);
  856. if (!pipe)
  857. return -ENOMEM;
  858. /*
  859. * We don't have an immediate reader, but we'll read the stuff
  860. * out of the pipe right after the splice_to_pipe(). So set
  861. * PIPE_READERS appropriately.
  862. */
  863. pipe->readers = 1;
  864. current->splice_pipe = pipe;
  865. }
  866. /*
  867. * Do the splice.
  868. */
  869. ret = 0;
  870. bytes = 0;
  871. out_off = 0;
  872. while (len) {
  873. size_t read_len, max_read_len;
  874. /*
  875. * Do at most PIPE_BUFFERS pages worth of transfer:
  876. */
  877. max_read_len = min(len, (size_t)(PIPE_BUFFERS*PAGE_SIZE));
  878. ret = do_splice_to(in, ppos, pipe, max_read_len, flags);
  879. if (unlikely(ret < 0))
  880. goto out_release;
  881. read_len = ret;
  882. /*
  883. * NOTE: nonblocking mode only applies to the input. We
  884. * must not do the output in nonblocking mode as then we
  885. * could get stuck data in the internal pipe:
  886. */
  887. ret = do_splice_from(pipe, out, &out_off, read_len,
  888. flags & ~SPLICE_F_NONBLOCK);
  889. if (unlikely(ret < 0))
  890. goto out_release;
  891. bytes += ret;
  892. len -= ret;
  893. /*
  894. * In nonblocking mode, if we got back a short read then
  895. * that was due to either an IO error or due to the
  896. * pagecache entry not being there. In the IO error case
  897. * the _next_ splice attempt will produce a clean IO error
  898. * return value (not a short read), so in both cases it's
  899. * correct to break out of the loop here:
  900. */
  901. if ((flags & SPLICE_F_NONBLOCK) && (read_len < max_read_len))
  902. break;
  903. }
  904. pipe->nrbufs = pipe->curbuf = 0;
  905. return bytes;
  906. out_release:
  907. /*
  908. * If we did an incomplete transfer we must release
  909. * the pipe buffers in question:
  910. */
  911. for (i = 0; i < PIPE_BUFFERS; i++) {
  912. struct pipe_buffer *buf = pipe->bufs + i;
  913. if (buf->ops) {
  914. buf->ops->release(pipe, buf);
  915. buf->ops = NULL;
  916. }
  917. }
  918. pipe->nrbufs = pipe->curbuf = 0;
  919. /*
  920. * If we transferred some data, return the number of bytes:
  921. */
  922. if (bytes > 0)
  923. return bytes;
  924. return ret;
  925. }
  926. EXPORT_SYMBOL(do_splice_direct);
  927. /*
  928. * After the inode slimming patch, i_pipe/i_bdev/i_cdev share the same
  929. * location, so checking ->i_pipe is not enough to verify that this is a
  930. * pipe.
  931. */
  932. static inline struct pipe_inode_info *pipe_info(struct inode *inode)
  933. {
  934. if (S_ISFIFO(inode->i_mode))
  935. return inode->i_pipe;
  936. return NULL;
  937. }
  938. /*
  939. * Determine where to splice to/from.
  940. */
  941. static long do_splice(struct file *in, loff_t __user *off_in,
  942. struct file *out, loff_t __user *off_out,
  943. size_t len, unsigned int flags)
  944. {
  945. struct pipe_inode_info *pipe;
  946. loff_t offset, *off;
  947. long ret;
  948. pipe = pipe_info(in->f_path.dentry->d_inode);
  949. if (pipe) {
  950. if (off_in)
  951. return -ESPIPE;
  952. if (off_out) {
  953. if (out->f_op->llseek == no_llseek)
  954. return -EINVAL;
  955. if (copy_from_user(&offset, off_out, sizeof(loff_t)))
  956. return -EFAULT;
  957. off = &offset;
  958. } else
  959. off = &out->f_pos;
  960. ret = do_splice_from(pipe, out, off, len, flags);
  961. if (off_out && copy_to_user(off_out, off, sizeof(loff_t)))
  962. ret = -EFAULT;
  963. return ret;
  964. }
  965. pipe = pipe_info(out->f_path.dentry->d_inode);
  966. if (pipe) {
  967. if (off_out)
  968. return -ESPIPE;
  969. if (off_in) {
  970. if (in->f_op->llseek == no_llseek)
  971. return -EINVAL;
  972. if (copy_from_user(&offset, off_in, sizeof(loff_t)))
  973. return -EFAULT;
  974. off = &offset;
  975. } else
  976. off = &in->f_pos;
  977. ret = do_splice_to(in, off, pipe, len, flags);
  978. if (off_in && copy_to_user(off_in, off, sizeof(loff_t)))
  979. ret = -EFAULT;
  980. return ret;
  981. }
  982. return -EINVAL;
  983. }
  984. /*
  985. * Map an iov into an array of pages and offset/length tupples. With the
  986. * partial_page structure, we can map several non-contiguous ranges into
  987. * our ones pages[] map instead of splitting that operation into pieces.
  988. * Could easily be exported as a generic helper for other users, in which
  989. * case one would probably want to add a 'max_nr_pages' parameter as well.
  990. */
  991. static int get_iovec_page_array(const struct iovec __user *iov,
  992. unsigned int nr_vecs, struct page **pages,
  993. struct partial_page *partial, int aligned)
  994. {
  995. int buffers = 0, error = 0;
  996. /*
  997. * It's ok to take the mmap_sem for reading, even
  998. * across a "get_user()".
  999. */
  1000. down_read(&current->mm->mmap_sem);
  1001. while (nr_vecs) {
  1002. unsigned long off, npages;
  1003. void __user *base;
  1004. size_t len;
  1005. int i;
  1006. /*
  1007. * Get user address base and length for this iovec.
  1008. */
  1009. error = get_user(base, &iov->iov_base);
  1010. if (unlikely(error))
  1011. break;
  1012. error = get_user(len, &iov->iov_len);
  1013. if (unlikely(error))
  1014. break;
  1015. /*
  1016. * Sanity check this iovec. 0 read succeeds.
  1017. */
  1018. if (unlikely(!len))
  1019. break;
  1020. error = -EFAULT;
  1021. if (unlikely(!base))
  1022. break;
  1023. /*
  1024. * Get this base offset and number of pages, then map
  1025. * in the user pages.
  1026. */
  1027. off = (unsigned long) base & ~PAGE_MASK;
  1028. /*
  1029. * If asked for alignment, the offset must be zero and the
  1030. * length a multiple of the PAGE_SIZE.
  1031. */
  1032. error = -EINVAL;
  1033. if (aligned && (off || len & ~PAGE_MASK))
  1034. break;
  1035. npages = (off + len + PAGE_SIZE - 1) >> PAGE_SHIFT;
  1036. if (npages > PIPE_BUFFERS - buffers)
  1037. npages = PIPE_BUFFERS - buffers;
  1038. error = get_user_pages(current, current->mm,
  1039. (unsigned long) base, npages, 0, 0,
  1040. &pages[buffers], NULL);
  1041. if (unlikely(error <= 0))
  1042. break;
  1043. /*
  1044. * Fill this contiguous range into the partial page map.
  1045. */
  1046. for (i = 0; i < error; i++) {
  1047. const int plen = min_t(size_t, len, PAGE_SIZE - off);
  1048. partial[buffers].offset = off;
  1049. partial[buffers].len = plen;
  1050. off = 0;
  1051. len -= plen;
  1052. buffers++;
  1053. }
  1054. /*
  1055. * We didn't complete this iov, stop here since it probably
  1056. * means we have to move some of this into a pipe to
  1057. * be able to continue.
  1058. */
  1059. if (len)
  1060. break;
  1061. /*
  1062. * Don't continue if we mapped fewer pages than we asked for,
  1063. * or if we mapped the max number of pages that we have
  1064. * room for.
  1065. */
  1066. if (error < npages || buffers == PIPE_BUFFERS)
  1067. break;
  1068. nr_vecs--;
  1069. iov++;
  1070. }
  1071. up_read(&current->mm->mmap_sem);
  1072. if (buffers)
  1073. return buffers;
  1074. return error;
  1075. }
  1076. /*
  1077. * vmsplice splices a user address range into a pipe. It can be thought of
  1078. * as splice-from-memory, where the regular splice is splice-from-file (or
  1079. * to file). In both cases the output is a pipe, naturally.
  1080. *
  1081. * Note that vmsplice only supports splicing _from_ user memory to a pipe,
  1082. * not the other way around. Splicing from user memory is a simple operation
  1083. * that can be supported without any funky alignment restrictions or nasty
  1084. * vm tricks. We simply map in the user memory and fill them into a pipe.
  1085. * The reverse isn't quite as easy, though. There are two possible solutions
  1086. * for that:
  1087. *
  1088. * - memcpy() the data internally, at which point we might as well just
  1089. * do a regular read() on the buffer anyway.
  1090. * - Lots of nasty vm tricks, that are neither fast nor flexible (it
  1091. * has restriction limitations on both ends of the pipe).
  1092. *
  1093. * Alas, it isn't here.
  1094. *
  1095. */
  1096. static long do_vmsplice(struct file *file, const struct iovec __user *iov,
  1097. unsigned long nr_segs, unsigned int flags)
  1098. {
  1099. struct pipe_inode_info *pipe;
  1100. struct page *pages[PIPE_BUFFERS];
  1101. struct partial_page partial[PIPE_BUFFERS];
  1102. struct splice_pipe_desc spd = {
  1103. .pages = pages,
  1104. .partial = partial,
  1105. .flags = flags,
  1106. .ops = &user_page_pipe_buf_ops,
  1107. };
  1108. pipe = pipe_info(file->f_path.dentry->d_inode);
  1109. if (!pipe)
  1110. return -EBADF;
  1111. if (unlikely(nr_segs > UIO_MAXIOV))
  1112. return -EINVAL;
  1113. else if (unlikely(!nr_segs))
  1114. return 0;
  1115. spd.nr_pages = get_iovec_page_array(iov, nr_segs, pages, partial,
  1116. flags & SPLICE_F_GIFT);
  1117. if (spd.nr_pages <= 0)
  1118. return spd.nr_pages;
  1119. return splice_to_pipe(pipe, &spd);
  1120. }
  1121. asmlinkage long sys_vmsplice(int fd, const struct iovec __user *iov,
  1122. unsigned long nr_segs, unsigned int flags)
  1123. {
  1124. struct file *file;
  1125. long error;
  1126. int fput;
  1127. error = -EBADF;
  1128. file = fget_light(fd, &fput);
  1129. if (file) {
  1130. if (file->f_mode & FMODE_WRITE)
  1131. error = do_vmsplice(file, iov, nr_segs, flags);
  1132. fput_light(file, fput);
  1133. }
  1134. return error;
  1135. }
  1136. asmlinkage long sys_splice(int fd_in, loff_t __user *off_in,
  1137. int fd_out, loff_t __user *off_out,
  1138. size_t len, unsigned int flags)
  1139. {
  1140. long error;
  1141. struct file *in, *out;
  1142. int fput_in, fput_out;
  1143. if (unlikely(!len))
  1144. return 0;
  1145. error = -EBADF;
  1146. in = fget_light(fd_in, &fput_in);
  1147. if (in) {
  1148. if (in->f_mode & FMODE_READ) {
  1149. out = fget_light(fd_out, &fput_out);
  1150. if (out) {
  1151. if (out->f_mode & FMODE_WRITE)
  1152. error = do_splice(in, off_in,
  1153. out, off_out,
  1154. len, flags);
  1155. fput_light(out, fput_out);
  1156. }
  1157. }
  1158. fput_light(in, fput_in);
  1159. }
  1160. return error;
  1161. }
  1162. /*
  1163. * Make sure there's data to read. Wait for input if we can, otherwise
  1164. * return an appropriate error.
  1165. */
  1166. static int link_ipipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
  1167. {
  1168. int ret;
  1169. /*
  1170. * Check ->nrbufs without the inode lock first. This function
  1171. * is speculative anyways, so missing one is ok.
  1172. */
  1173. if (pipe->nrbufs)
  1174. return 0;
  1175. ret = 0;
  1176. mutex_lock(&pipe->inode->i_mutex);
  1177. while (!pipe->nrbufs) {
  1178. if (signal_pending(current)) {
  1179. ret = -ERESTARTSYS;
  1180. break;
  1181. }
  1182. if (!pipe->writers)
  1183. break;
  1184. if (!pipe->waiting_writers) {
  1185. if (flags & SPLICE_F_NONBLOCK) {
  1186. ret = -EAGAIN;
  1187. break;
  1188. }
  1189. }
  1190. pipe_wait(pipe);
  1191. }
  1192. mutex_unlock(&pipe->inode->i_mutex);
  1193. return ret;
  1194. }
  1195. /*
  1196. * Make sure there's writeable room. Wait for room if we can, otherwise
  1197. * return an appropriate error.
  1198. */
  1199. static int link_opipe_prep(struct pipe_inode_info *pipe, unsigned int flags)
  1200. {
  1201. int ret;
  1202. /*
  1203. * Check ->nrbufs without the inode lock first. This function
  1204. * is speculative anyways, so missing one is ok.
  1205. */
  1206. if (pipe->nrbufs < PIPE_BUFFERS)
  1207. return 0;
  1208. ret = 0;
  1209. mutex_lock(&pipe->inode->i_mutex);
  1210. while (pipe->nrbufs >= PIPE_BUFFERS) {
  1211. if (!pipe->readers) {
  1212. send_sig(SIGPIPE, current, 0);
  1213. ret = -EPIPE;
  1214. break;
  1215. }
  1216. if (flags & SPLICE_F_NONBLOCK) {
  1217. ret = -EAGAIN;
  1218. break;
  1219. }
  1220. if (signal_pending(current)) {
  1221. ret = -ERESTARTSYS;
  1222. break;
  1223. }
  1224. pipe->waiting_writers++;
  1225. pipe_wait(pipe);
  1226. pipe->waiting_writers--;
  1227. }
  1228. mutex_unlock(&pipe->inode->i_mutex);
  1229. return ret;
  1230. }
  1231. /*
  1232. * Link contents of ipipe to opipe.
  1233. */
  1234. static int link_pipe(struct pipe_inode_info *ipipe,
  1235. struct pipe_inode_info *opipe,
  1236. size_t len, unsigned int flags)
  1237. {
  1238. struct pipe_buffer *ibuf, *obuf;
  1239. int ret = 0, i = 0, nbuf;
  1240. /*
  1241. * Potential ABBA deadlock, work around it by ordering lock
  1242. * grabbing by inode address. Otherwise two different processes
  1243. * could deadlock (one doing tee from A -> B, the other from B -> A).
  1244. */
  1245. inode_double_lock(ipipe->inode, opipe->inode);
  1246. do {
  1247. if (!opipe->readers) {
  1248. send_sig(SIGPIPE, current, 0);
  1249. if (!ret)
  1250. ret = -EPIPE;
  1251. break;
  1252. }
  1253. /*
  1254. * If we have iterated all input buffers or ran out of
  1255. * output room, break.
  1256. */
  1257. if (i >= ipipe->nrbufs || opipe->nrbufs >= PIPE_BUFFERS)
  1258. break;
  1259. ibuf = ipipe->bufs + ((ipipe->curbuf + i) & (PIPE_BUFFERS - 1));
  1260. nbuf = (opipe->curbuf + opipe->nrbufs) & (PIPE_BUFFERS - 1);
  1261. /*
  1262. * Get a reference to this pipe buffer,
  1263. * so we can copy the contents over.
  1264. */
  1265. ibuf->ops->get(ipipe, ibuf);
  1266. obuf = opipe->bufs + nbuf;
  1267. *obuf = *ibuf;
  1268. /*
  1269. * Don't inherit the gift flag, we need to
  1270. * prevent multiple steals of this page.
  1271. */
  1272. obuf->flags &= ~PIPE_BUF_FLAG_GIFT;
  1273. if (obuf->len > len)
  1274. obuf->len = len;
  1275. opipe->nrbufs++;
  1276. ret += obuf->len;
  1277. len -= obuf->len;
  1278. i++;
  1279. } while (len);
  1280. inode_double_unlock(ipipe->inode, opipe->inode);
  1281. /*
  1282. * If we put data in the output pipe, wakeup any potential readers.
  1283. */
  1284. if (ret > 0) {
  1285. smp_mb();
  1286. if (waitqueue_active(&opipe->wait))
  1287. wake_up_interruptible(&opipe->wait);
  1288. kill_fasync(&opipe->fasync_readers, SIGIO, POLL_IN);
  1289. }
  1290. return ret;
  1291. }
  1292. /*
  1293. * This is a tee(1) implementation that works on pipes. It doesn't copy
  1294. * any data, it simply references the 'in' pages on the 'out' pipe.
  1295. * The 'flags' used are the SPLICE_F_* variants, currently the only
  1296. * applicable one is SPLICE_F_NONBLOCK.
  1297. */
  1298. static long do_tee(struct file *in, struct file *out, size_t len,
  1299. unsigned int flags)
  1300. {
  1301. struct pipe_inode_info *ipipe = pipe_info(in->f_path.dentry->d_inode);
  1302. struct pipe_inode_info *opipe = pipe_info(out->f_path.dentry->d_inode);
  1303. int ret = -EINVAL;
  1304. /*
  1305. * Duplicate the contents of ipipe to opipe without actually
  1306. * copying the data.
  1307. */
  1308. if (ipipe && opipe && ipipe != opipe) {
  1309. /*
  1310. * Keep going, unless we encounter an error. The ipipe/opipe
  1311. * ordering doesn't really matter.
  1312. */
  1313. ret = link_ipipe_prep(ipipe, flags);
  1314. if (!ret) {
  1315. ret = link_opipe_prep(opipe, flags);
  1316. if (!ret) {
  1317. ret = link_pipe(ipipe, opipe, len, flags);
  1318. if (!ret && (flags & SPLICE_F_NONBLOCK))
  1319. ret = -EAGAIN;
  1320. }
  1321. }
  1322. }
  1323. return ret;
  1324. }
  1325. asmlinkage long sys_tee(int fdin, int fdout, size_t len, unsigned int flags)
  1326. {
  1327. struct file *in;
  1328. int error, fput_in;
  1329. if (unlikely(!len))
  1330. return 0;
  1331. error = -EBADF;
  1332. in = fget_light(fdin, &fput_in);
  1333. if (in) {
  1334. if (in->f_mode & FMODE_READ) {
  1335. int fput_out;
  1336. struct file *out = fget_light(fdout, &fput_out);
  1337. if (out) {
  1338. if (out->f_mode & FMODE_WRITE)
  1339. error = do_tee(in, out, len, flags);
  1340. fput_light(out, fput_out);
  1341. }
  1342. }
  1343. fput_light(in, fput_in);
  1344. }
  1345. return error;
  1346. }