splice.c 39 KB

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