Commit | Line | Data |
---|---|---|
b2441318 | 1 | // SPDX-License-Identifier: GPL-2.0 |
1da177e4 LT |
2 | /* |
3 | * linux/fs/pipe.c | |
4 | * | |
5 | * Copyright (C) 1991, 1992, 1999 Linus Torvalds | |
6 | */ | |
7 | ||
8 | #include <linux/mm.h> | |
9 | #include <linux/file.h> | |
10 | #include <linux/poll.h> | |
11 | #include <linux/slab.h> | |
12 | #include <linux/module.h> | |
13 | #include <linux/init.h> | |
14 | #include <linux/fs.h> | |
35f3d14d | 15 | #include <linux/log2.h> |
1da177e4 | 16 | #include <linux/mount.h> |
4fa7ec5d | 17 | #include <linux/pseudo_fs.h> |
b502bd11 | 18 | #include <linux/magic.h> |
1da177e4 LT |
19 | #include <linux/pipe_fs_i.h> |
20 | #include <linux/uio.h> | |
21 | #include <linux/highmem.h> | |
5274f052 | 22 | #include <linux/pagemap.h> |
db349509 | 23 | #include <linux/audit.h> |
ba719bae | 24 | #include <linux/syscalls.h> |
b492e95b | 25 | #include <linux/fcntl.h> |
d86133bd | 26 | #include <linux/memcontrol.h> |
c73be61c | 27 | #include <linux/watch_queue.h> |
1da177e4 | 28 | |
7c0f6ba6 | 29 | #include <linux/uaccess.h> |
1da177e4 LT |
30 | #include <asm/ioctls.h> |
31 | ||
599a0ac1 AV |
32 | #include "internal.h" |
33 | ||
46c4c9d1 AXH |
34 | /* |
35 | * New pipe buffers will be restricted to this size while the user is exceeding | |
36 | * their pipe buffer quota. The general pipe use case needs at least two | |
37 | * buffers: one for data yet to be read, and one for new data. If this is less | |
38 | * than two, then a write to a non-empty pipe may block even if the pipe is not | |
39 | * full. This can occur with GNU make jobserver or similar uses of pipes as | |
40 | * semaphores: multiple processes may be waiting to write tokens back to the | |
41 | * pipe before reading tokens: https://lore.kernel.org/lkml/1628086770.5rn8p04n6j.none@localhost/. | |
42 | * | |
43 | * Users can reduce their pipe buffers with F_SETPIPE_SZ below this at their | |
44 | * own risk, namely: pipe writes to non-full pipes may block until the pipe is | |
45 | * emptied. | |
46 | */ | |
47 | #define PIPE_MIN_DEF_BUFFERS 2 | |
48 | ||
b492e95b JA |
49 | /* |
50 | * The max size that a non-root user is allowed to grow the pipe. Can | |
ff9da691 | 51 | * be set by root in /proc/sys/fs/pipe-max-size |
b492e95b | 52 | */ |
ff9da691 JA |
53 | unsigned int pipe_max_size = 1048576; |
54 | ||
759c0114 WT |
55 | /* Maximum allocatable pages per user. Hard limit is unset by default, soft |
56 | * matches default values. | |
57 | */ | |
58 | unsigned long pipe_user_pages_hard; | |
59 | unsigned long pipe_user_pages_soft = PIPE_DEF_BUFFERS * INR_OPEN_CUR; | |
60 | ||
1da177e4 | 61 | /* |
8cefc107 DH |
62 | * We use head and tail indices that aren't masked off, except at the point of |
63 | * dereference, but rather they're allowed to wrap naturally. This means there | |
64 | * isn't a dead spot in the buffer, but the ring has to be a power of two and | |
65 | * <= 2^31. | |
66 | * -- David Howells 2019-09-23. | |
67 | * | |
1da177e4 LT |
68 | * Reads with count = 0 should always return 0. |
69 | * -- Julian Bradfield 1999-06-07. | |
70 | * | |
71 | * FIFOs and Pipes now generate SIGIO for both readers and writers. | |
72 | * -- Jeremy Elson <jelson@circlemud.org> 2001-08-16 | |
73 | * | |
74 | * pipe_read & write cleanup | |
75 | * -- Manfred Spraul <manfred@colorfullife.com> 2002-05-09 | |
76 | */ | |
77 | ||
61e0d47c MS |
78 | static void pipe_lock_nested(struct pipe_inode_info *pipe, int subclass) |
79 | { | |
6447a3cf | 80 | if (pipe->files) |
72b0d9aa | 81 | mutex_lock_nested(&pipe->mutex, subclass); |
61e0d47c MS |
82 | } |
83 | ||
84 | void pipe_lock(struct pipe_inode_info *pipe) | |
85 | { | |
86 | /* | |
87 | * pipe_lock() nests non-pipe inode locks (for writing to a file) | |
88 | */ | |
89 | pipe_lock_nested(pipe, I_MUTEX_PARENT); | |
90 | } | |
91 | EXPORT_SYMBOL(pipe_lock); | |
92 | ||
93 | void pipe_unlock(struct pipe_inode_info *pipe) | |
94 | { | |
6447a3cf | 95 | if (pipe->files) |
72b0d9aa | 96 | mutex_unlock(&pipe->mutex); |
61e0d47c MS |
97 | } |
98 | EXPORT_SYMBOL(pipe_unlock); | |
99 | ||
ebec73f4 AV |
100 | static inline void __pipe_lock(struct pipe_inode_info *pipe) |
101 | { | |
102 | mutex_lock_nested(&pipe->mutex, I_MUTEX_PARENT); | |
103 | } | |
104 | ||
105 | static inline void __pipe_unlock(struct pipe_inode_info *pipe) | |
106 | { | |
107 | mutex_unlock(&pipe->mutex); | |
108 | } | |
109 | ||
61e0d47c MS |
110 | void pipe_double_lock(struct pipe_inode_info *pipe1, |
111 | struct pipe_inode_info *pipe2) | |
112 | { | |
113 | BUG_ON(pipe1 == pipe2); | |
114 | ||
115 | if (pipe1 < pipe2) { | |
116 | pipe_lock_nested(pipe1, I_MUTEX_PARENT); | |
117 | pipe_lock_nested(pipe2, I_MUTEX_CHILD); | |
118 | } else { | |
023d43c7 PZ |
119 | pipe_lock_nested(pipe2, I_MUTEX_PARENT); |
120 | pipe_lock_nested(pipe1, I_MUTEX_CHILD); | |
61e0d47c MS |
121 | } |
122 | } | |
123 | ||
341b446b IM |
124 | static void anon_pipe_buf_release(struct pipe_inode_info *pipe, |
125 | struct pipe_buffer *buf) | |
1da177e4 LT |
126 | { |
127 | struct page *page = buf->page; | |
128 | ||
5274f052 JA |
129 | /* |
130 | * If nobody else uses this page, and we don't already have a | |
131 | * temporary page, let's keep track of it as a one-deep | |
341b446b | 132 | * allocation cache. (Otherwise just release our reference to it) |
5274f052 | 133 | */ |
341b446b | 134 | if (page_count(page) == 1 && !pipe->tmp_page) |
923f4f23 | 135 | pipe->tmp_page = page; |
341b446b | 136 | else |
09cbfeaf | 137 | put_page(page); |
1da177e4 LT |
138 | } |
139 | ||
c928f642 CH |
140 | static bool anon_pipe_buf_try_steal(struct pipe_inode_info *pipe, |
141 | struct pipe_buffer *buf) | |
d86133bd VD |
142 | { |
143 | struct page *page = buf->page; | |
144 | ||
c928f642 CH |
145 | if (page_count(page) != 1) |
146 | return false; | |
147 | memcg_kmem_uncharge_page(page, 0); | |
148 | __SetPageLocked(page); | |
149 | return true; | |
d86133bd VD |
150 | } |
151 | ||
0845718d | 152 | /** |
c928f642 | 153 | * generic_pipe_buf_try_steal - attempt to take ownership of a &pipe_buffer |
0845718d JA |
154 | * @pipe: the pipe that the buffer belongs to |
155 | * @buf: the buffer to attempt to steal | |
156 | * | |
157 | * Description: | |
b51d63c6 | 158 | * This function attempts to steal the &struct page attached to |
0845718d JA |
159 | * @buf. If successful, this function returns 0 and returns with |
160 | * the page locked. The caller may then reuse the page for whatever | |
b51d63c6 | 161 | * he wishes; the typical use is insertion into a different file |
0845718d JA |
162 | * page cache. |
163 | */ | |
c928f642 CH |
164 | bool generic_pipe_buf_try_steal(struct pipe_inode_info *pipe, |
165 | struct pipe_buffer *buf) | |
5abc97aa | 166 | { |
46e678c9 JA |
167 | struct page *page = buf->page; |
168 | ||
0845718d JA |
169 | /* |
170 | * A reference of one is golden, that means that the owner of this | |
171 | * page is the only one holding a reference to it. lock the page | |
172 | * and return OK. | |
173 | */ | |
46e678c9 | 174 | if (page_count(page) == 1) { |
46e678c9 | 175 | lock_page(page); |
c928f642 | 176 | return true; |
46e678c9 | 177 | } |
c928f642 | 178 | return false; |
5abc97aa | 179 | } |
c928f642 | 180 | EXPORT_SYMBOL(generic_pipe_buf_try_steal); |
5abc97aa | 181 | |
0845718d | 182 | /** |
b51d63c6 | 183 | * generic_pipe_buf_get - get a reference to a &struct pipe_buffer |
0845718d JA |
184 | * @pipe: the pipe that the buffer belongs to |
185 | * @buf: the buffer to get a reference to | |
186 | * | |
187 | * Description: | |
188 | * This function grabs an extra reference to @buf. It's used in | |
3d742d4b | 189 | * the tee() system call, when we duplicate the buffers in one |
0845718d JA |
190 | * pipe into another. |
191 | */ | |
15fab63e | 192 | bool generic_pipe_buf_get(struct pipe_inode_info *pipe, struct pipe_buffer *buf) |
70524490 | 193 | { |
15fab63e | 194 | return try_get_page(buf->page); |
70524490 | 195 | } |
51921cb7 | 196 | EXPORT_SYMBOL(generic_pipe_buf_get); |
70524490 | 197 | |
6818173b MS |
198 | /** |
199 | * generic_pipe_buf_release - put a reference to a &struct pipe_buffer | |
200 | * @pipe: the pipe that the buffer belongs to | |
201 | * @buf: the buffer to put a reference to | |
202 | * | |
203 | * Description: | |
204 | * This function releases a reference to @buf. | |
205 | */ | |
206 | void generic_pipe_buf_release(struct pipe_inode_info *pipe, | |
207 | struct pipe_buffer *buf) | |
208 | { | |
09cbfeaf | 209 | put_page(buf->page); |
6818173b | 210 | } |
51921cb7 | 211 | EXPORT_SYMBOL(generic_pipe_buf_release); |
6818173b | 212 | |
d4c3cca9 | 213 | static const struct pipe_buf_operations anon_pipe_buf_ops = { |
c928f642 CH |
214 | .release = anon_pipe_buf_release, |
215 | .try_steal = anon_pipe_buf_try_steal, | |
216 | .get = generic_pipe_buf_get, | |
1da177e4 LT |
217 | }; |
218 | ||
85190d15 LT |
219 | /* Done while waiting without holding the pipe lock - thus the READ_ONCE() */ |
220 | static inline bool pipe_readable(const struct pipe_inode_info *pipe) | |
221 | { | |
222 | unsigned int head = READ_ONCE(pipe->head); | |
223 | unsigned int tail = READ_ONCE(pipe->tail); | |
224 | unsigned int writers = READ_ONCE(pipe->writers); | |
225 | ||
226 | return !pipe_empty(head, tail) || !writers; | |
227 | } | |
228 | ||
1da177e4 | 229 | static ssize_t |
fb9096a3 | 230 | pipe_read(struct kiocb *iocb, struct iov_iter *to) |
1da177e4 | 231 | { |
fb9096a3 | 232 | size_t total_len = iov_iter_count(to); |
ee0b3e67 | 233 | struct file *filp = iocb->ki_filp; |
de32ec4c | 234 | struct pipe_inode_info *pipe = filp->private_data; |
0ddad21d | 235 | bool was_full, wake_next_reader = false; |
1da177e4 | 236 | ssize_t ret; |
1da177e4 | 237 | |
1da177e4 LT |
238 | /* Null read succeeds. */ |
239 | if (unlikely(total_len == 0)) | |
240 | return 0; | |
241 | ||
1da177e4 | 242 | ret = 0; |
ebec73f4 | 243 | __pipe_lock(pipe); |
f467a6a6 LT |
244 | |
245 | /* | |
246 | * We only wake up writers if the pipe was full when we started | |
247 | * reading in order to avoid unnecessary wakeups. | |
248 | * | |
249 | * But when we do wake up writers, we do so using a sync wakeup | |
250 | * (WF_SYNC), because we want them to get going and generate more | |
251 | * data for us. | |
252 | */ | |
253 | was_full = pipe_full(pipe->head, pipe->tail, pipe->max_usage); | |
1da177e4 | 254 | for (;;) { |
8cefc107 DH |
255 | unsigned int head = pipe->head; |
256 | unsigned int tail = pipe->tail; | |
257 | unsigned int mask = pipe->ring_size - 1; | |
258 | ||
e7d553d6 DH |
259 | #ifdef CONFIG_WATCH_QUEUE |
260 | if (pipe->note_loss) { | |
261 | struct watch_notification n; | |
262 | ||
263 | if (total_len < 8) { | |
264 | if (ret == 0) | |
265 | ret = -ENOBUFS; | |
266 | break; | |
267 | } | |
268 | ||
269 | n.type = WATCH_TYPE_META; | |
270 | n.subtype = WATCH_META_LOSS_NOTIFICATION; | |
271 | n.info = watch_sizeof(n); | |
272 | if (copy_to_iter(&n, sizeof(n), to) != sizeof(n)) { | |
273 | if (ret == 0) | |
274 | ret = -EFAULT; | |
275 | break; | |
276 | } | |
277 | ret += sizeof(n); | |
278 | total_len -= sizeof(n); | |
279 | pipe->note_loss = false; | |
280 | } | |
281 | #endif | |
282 | ||
8cefc107 DH |
283 | if (!pipe_empty(head, tail)) { |
284 | struct pipe_buffer *buf = &pipe->bufs[tail & mask]; | |
1da177e4 | 285 | size_t chars = buf->len; |
637b58c2 AV |
286 | size_t written; |
287 | int error; | |
1da177e4 | 288 | |
8cfba763 DH |
289 | if (chars > total_len) { |
290 | if (buf->flags & PIPE_BUF_FLAG_WHOLE) { | |
291 | if (ret == 0) | |
292 | ret = -ENOBUFS; | |
293 | break; | |
294 | } | |
1da177e4 | 295 | chars = total_len; |
8cfba763 | 296 | } |
1da177e4 | 297 | |
fba597db | 298 | error = pipe_buf_confirm(pipe, buf); |
f84d7519 | 299 | if (error) { |
5274f052 | 300 | if (!ret) |
e5953cbd | 301 | ret = error; |
5274f052 JA |
302 | break; |
303 | } | |
f84d7519 | 304 | |
fb9096a3 | 305 | written = copy_page_to_iter(buf->page, buf->offset, chars, to); |
637b58c2 | 306 | if (unlikely(written < chars)) { |
341b446b | 307 | if (!ret) |
637b58c2 | 308 | ret = -EFAULT; |
1da177e4 LT |
309 | break; |
310 | } | |
311 | ret += chars; | |
312 | buf->offset += chars; | |
313 | buf->len -= chars; | |
9883035a LT |
314 | |
315 | /* Was it a packet buffer? Clean up and exit */ | |
316 | if (buf->flags & PIPE_BUF_FLAG_PACKET) { | |
317 | total_len = chars; | |
318 | buf->len = 0; | |
319 | } | |
320 | ||
1da177e4 | 321 | if (!buf->len) { |
a779638c | 322 | pipe_buf_release(pipe, buf); |
0ddad21d | 323 | spin_lock_irq(&pipe->rd_wait.lock); |
e7d553d6 DH |
324 | #ifdef CONFIG_WATCH_QUEUE |
325 | if (buf->flags & PIPE_BUF_FLAG_LOSS) | |
326 | pipe->note_loss = true; | |
327 | #endif | |
8cefc107 DH |
328 | tail++; |
329 | pipe->tail = tail; | |
0ddad21d | 330 | spin_unlock_irq(&pipe->rd_wait.lock); |
1da177e4 LT |
331 | } |
332 | total_len -= chars; | |
333 | if (!total_len) | |
334 | break; /* common path: read succeeded */ | |
8cefc107 DH |
335 | if (!pipe_empty(head, tail)) /* More to do? */ |
336 | continue; | |
1da177e4 | 337 | } |
8cefc107 | 338 | |
923f4f23 | 339 | if (!pipe->writers) |
1da177e4 | 340 | break; |
a28c8b9d LT |
341 | if (ret) |
342 | break; | |
343 | if (filp->f_flags & O_NONBLOCK) { | |
344 | ret = -EAGAIN; | |
345 | break; | |
1da177e4 | 346 | } |
85190d15 | 347 | __pipe_unlock(pipe); |
d1c6a2aa LT |
348 | |
349 | /* | |
350 | * We only get here if we didn't actually read anything. | |
351 | * | |
352 | * However, we could have seen (and removed) a zero-sized | |
353 | * pipe buffer, and might have made space in the buffers | |
354 | * that way. | |
355 | * | |
356 | * You can't make zero-sized pipe buffers by doing an empty | |
357 | * write (not even in packet mode), but they can happen if | |
358 | * the writer gets an EFAULT when trying to fill a buffer | |
359 | * that already got allocated and inserted in the buffer | |
360 | * array. | |
361 | * | |
362 | * So we still need to wake up any pending writers in the | |
363 | * _very_ unlikely case that the pipe was full, but we got | |
364 | * no data. | |
365 | */ | |
366 | if (unlikely(was_full)) { | |
0ddad21d | 367 | wake_up_interruptible_sync_poll(&pipe->wr_wait, EPOLLOUT | EPOLLWRNORM); |
f467a6a6 LT |
368 | kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT); |
369 | } | |
d1c6a2aa LT |
370 | |
371 | /* | |
372 | * But because we didn't read anything, at this point we can | |
373 | * just return directly with -ERESTARTSYS if we're interrupted, | |
374 | * since we've done any required wakeups and there's no need | |
375 | * to mark anything accessed. And we've dropped the lock. | |
376 | */ | |
0ddad21d | 377 | if (wait_event_interruptible_exclusive(pipe->rd_wait, pipe_readable(pipe)) < 0) |
d1c6a2aa LT |
378 | return -ERESTARTSYS; |
379 | ||
85190d15 | 380 | __pipe_lock(pipe); |
f467a6a6 | 381 | was_full = pipe_full(pipe->head, pipe->tail, pipe->max_usage); |
0ddad21d | 382 | wake_next_reader = true; |
1da177e4 | 383 | } |
0ddad21d LT |
384 | if (pipe_empty(pipe->head, pipe->tail)) |
385 | wake_next_reader = false; | |
ebec73f4 | 386 | __pipe_unlock(pipe); |
341b446b | 387 | |
f467a6a6 | 388 | if (was_full) { |
0ddad21d | 389 | wake_up_interruptible_sync_poll(&pipe->wr_wait, EPOLLOUT | EPOLLWRNORM); |
923f4f23 | 390 | kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT); |
1da177e4 | 391 | } |
0ddad21d LT |
392 | if (wake_next_reader) |
393 | wake_up_interruptible_sync_poll(&pipe->rd_wait, EPOLLIN | EPOLLRDNORM); | |
1da177e4 LT |
394 | if (ret > 0) |
395 | file_accessed(filp); | |
396 | return ret; | |
397 | } | |
398 | ||
9883035a LT |
399 | static inline int is_packetized(struct file *file) |
400 | { | |
401 | return (file->f_flags & O_DIRECT) != 0; | |
402 | } | |
403 | ||
85190d15 LT |
404 | /* Done while waiting without holding the pipe lock - thus the READ_ONCE() */ |
405 | static inline bool pipe_writable(const struct pipe_inode_info *pipe) | |
406 | { | |
407 | unsigned int head = READ_ONCE(pipe->head); | |
408 | unsigned int tail = READ_ONCE(pipe->tail); | |
409 | unsigned int max_usage = READ_ONCE(pipe->max_usage); | |
410 | ||
411 | return !pipe_full(head, tail, max_usage) || | |
412 | !READ_ONCE(pipe->readers); | |
413 | } | |
414 | ||
1da177e4 | 415 | static ssize_t |
f0d1bec9 | 416 | pipe_write(struct kiocb *iocb, struct iov_iter *from) |
1da177e4 | 417 | { |
ee0b3e67 | 418 | struct file *filp = iocb->ki_filp; |
de32ec4c | 419 | struct pipe_inode_info *pipe = filp->private_data; |
8f868d68 | 420 | unsigned int head; |
f0d1bec9 | 421 | ssize_t ret = 0; |
f0d1bec9 | 422 | size_t total_len = iov_iter_count(from); |
1da177e4 | 423 | ssize_t chars; |
1b6b26ae | 424 | bool was_empty = false; |
0ddad21d | 425 | bool wake_next_writer = false; |
1da177e4 | 426 | |
1da177e4 LT |
427 | /* Null write succeeds. */ |
428 | if (unlikely(total_len == 0)) | |
429 | return 0; | |
430 | ||
ebec73f4 | 431 | __pipe_lock(pipe); |
1da177e4 | 432 | |
923f4f23 | 433 | if (!pipe->readers) { |
1da177e4 LT |
434 | send_sig(SIGPIPE, current, 0); |
435 | ret = -EPIPE; | |
436 | goto out; | |
437 | } | |
438 | ||
c73be61c DH |
439 | #ifdef CONFIG_WATCH_QUEUE |
440 | if (pipe->watch_queue) { | |
441 | ret = -EXDEV; | |
442 | goto out; | |
443 | } | |
444 | #endif | |
445 | ||
1b6b26ae | 446 | /* |
1b6b26ae LT |
447 | * If it wasn't empty we try to merge new data into |
448 | * the last buffer. | |
449 | * | |
450 | * That naturally merges small writes, but it also | |
3a34b13a | 451 | * page-aligns the rest of the writes for large writes |
1b6b26ae LT |
452 | * spanning multiple pages. |
453 | */ | |
8cefc107 | 454 | head = pipe->head; |
3b844826 | 455 | was_empty = pipe_empty(head, pipe->tail); |
1b6b26ae | 456 | chars = total_len & (PAGE_SIZE-1); |
3b844826 | 457 | if (chars && !was_empty) { |
8f868d68 | 458 | unsigned int mask = pipe->ring_size - 1; |
8cefc107 | 459 | struct pipe_buffer *buf = &pipe->bufs[(head - 1) & mask]; |
1da177e4 | 460 | int offset = buf->offset + buf->len; |
341b446b | 461 | |
f6dd9755 CH |
462 | if ((buf->flags & PIPE_BUF_FLAG_CAN_MERGE) && |
463 | offset + chars <= PAGE_SIZE) { | |
fba597db | 464 | ret = pipe_buf_confirm(pipe, buf); |
6ae08069 | 465 | if (ret) |
5274f052 | 466 | goto out; |
f84d7519 | 467 | |
f0d1bec9 AV |
468 | ret = copy_page_from_iter(buf->page, offset, chars, from); |
469 | if (unlikely(ret < chars)) { | |
6ae08069 | 470 | ret = -EFAULT; |
1da177e4 | 471 | goto out; |
f6762b7a | 472 | } |
1b6b26ae | 473 | |
6ae08069 | 474 | buf->len += ret; |
f0d1bec9 | 475 | if (!iov_iter_count(from)) |
1da177e4 LT |
476 | goto out; |
477 | } | |
478 | } | |
479 | ||
480 | for (;;) { | |
923f4f23 | 481 | if (!pipe->readers) { |
1da177e4 | 482 | send_sig(SIGPIPE, current, 0); |
341b446b IM |
483 | if (!ret) |
484 | ret = -EPIPE; | |
1da177e4 LT |
485 | break; |
486 | } | |
8cefc107 | 487 | |
a194dfe6 | 488 | head = pipe->head; |
8f868d68 DH |
489 | if (!pipe_full(head, pipe->tail, pipe->max_usage)) { |
490 | unsigned int mask = pipe->ring_size - 1; | |
8cefc107 | 491 | struct pipe_buffer *buf = &pipe->bufs[head & mask]; |
923f4f23 | 492 | struct page *page = pipe->tmp_page; |
f0d1bec9 | 493 | int copied; |
1da177e4 LT |
494 | |
495 | if (!page) { | |
d86133bd | 496 | page = alloc_page(GFP_HIGHUSER | __GFP_ACCOUNT); |
1da177e4 LT |
497 | if (unlikely(!page)) { |
498 | ret = ret ? : -ENOMEM; | |
499 | break; | |
500 | } | |
923f4f23 | 501 | pipe->tmp_page = page; |
1da177e4 | 502 | } |
a194dfe6 DH |
503 | |
504 | /* Allocate a slot in the ring in advance and attach an | |
505 | * empty buffer. If we fault or otherwise fail to use | |
506 | * it, either the reader will consume it or it'll still | |
507 | * be there for the next write. | |
508 | */ | |
0ddad21d | 509 | spin_lock_irq(&pipe->rd_wait.lock); |
a194dfe6 DH |
510 | |
511 | head = pipe->head; | |
8f868d68 | 512 | if (pipe_full(head, pipe->tail, pipe->max_usage)) { |
0ddad21d | 513 | spin_unlock_irq(&pipe->rd_wait.lock); |
8df44129 DH |
514 | continue; |
515 | } | |
516 | ||
a194dfe6 | 517 | pipe->head = head + 1; |
0ddad21d | 518 | spin_unlock_irq(&pipe->rd_wait.lock); |
1da177e4 LT |
519 | |
520 | /* Insert it into the buffer array */ | |
a194dfe6 | 521 | buf = &pipe->bufs[head & mask]; |
1da177e4 LT |
522 | buf->page = page; |
523 | buf->ops = &anon_pipe_buf_ops; | |
524 | buf->offset = 0; | |
a194dfe6 | 525 | buf->len = 0; |
f6dd9755 | 526 | if (is_packetized(filp)) |
9883035a | 527 | buf->flags = PIPE_BUF_FLAG_PACKET; |
f6dd9755 CH |
528 | else |
529 | buf->flags = PIPE_BUF_FLAG_CAN_MERGE; | |
923f4f23 | 530 | pipe->tmp_page = NULL; |
1da177e4 | 531 | |
a194dfe6 DH |
532 | copied = copy_page_from_iter(page, 0, PAGE_SIZE, from); |
533 | if (unlikely(copied < PAGE_SIZE && iov_iter_count(from))) { | |
534 | if (!ret) | |
535 | ret = -EFAULT; | |
536 | break; | |
537 | } | |
538 | ret += copied; | |
539 | buf->offset = 0; | |
540 | buf->len = copied; | |
541 | ||
f0d1bec9 | 542 | if (!iov_iter_count(from)) |
1da177e4 LT |
543 | break; |
544 | } | |
8cefc107 | 545 | |
8f868d68 | 546 | if (!pipe_full(head, pipe->tail, pipe->max_usage)) |
1da177e4 | 547 | continue; |
8cefc107 DH |
548 | |
549 | /* Wait for buffer space to become available. */ | |
1da177e4 | 550 | if (filp->f_flags & O_NONBLOCK) { |
341b446b IM |
551 | if (!ret) |
552 | ret = -EAGAIN; | |
1da177e4 LT |
553 | break; |
554 | } | |
555 | if (signal_pending(current)) { | |
341b446b IM |
556 | if (!ret) |
557 | ret = -ERESTARTSYS; | |
1da177e4 LT |
558 | break; |
559 | } | |
1b6b26ae LT |
560 | |
561 | /* | |
562 | * We're going to release the pipe lock and wait for more | |
563 | * space. We wake up any readers if necessary, and then | |
564 | * after waiting we need to re-check whether the pipe | |
565 | * become empty while we dropped the lock. | |
566 | */ | |
85190d15 | 567 | __pipe_unlock(pipe); |
1b6b26ae | 568 | if (was_empty) { |
0ddad21d | 569 | wake_up_interruptible_sync_poll(&pipe->rd_wait, EPOLLIN | EPOLLRDNORM); |
1b6b26ae LT |
570 | kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN); |
571 | } | |
0ddad21d | 572 | wait_event_interruptible_exclusive(pipe->wr_wait, pipe_writable(pipe)); |
85190d15 | 573 | __pipe_lock(pipe); |
0dd1e377 | 574 | was_empty = pipe_empty(pipe->head, pipe->tail); |
0ddad21d | 575 | wake_next_writer = true; |
1da177e4 LT |
576 | } |
577 | out: | |
0ddad21d LT |
578 | if (pipe_full(pipe->head, pipe->tail, pipe->max_usage)) |
579 | wake_next_writer = false; | |
ebec73f4 | 580 | __pipe_unlock(pipe); |
1b6b26ae LT |
581 | |
582 | /* | |
583 | * If we do do a wakeup event, we do a 'sync' wakeup, because we | |
584 | * want the reader to start processing things asap, rather than | |
585 | * leave the data pending. | |
586 | * | |
587 | * This is particularly important for small writes, because of | |
588 | * how (for example) the GNU make jobserver uses small writes to | |
589 | * wake up pending jobs | |
3b844826 LT |
590 | * |
591 | * Epoll nonsensically wants a wakeup whether the pipe | |
592 | * was already empty or not. | |
1b6b26ae | 593 | */ |
3b844826 | 594 | if (was_empty || pipe->poll_usage) { |
0ddad21d | 595 | wake_up_interruptible_sync_poll(&pipe->rd_wait, EPOLLIN | EPOLLRDNORM); |
923f4f23 | 596 | kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN); |
1da177e4 | 597 | } |
0ddad21d LT |
598 | if (wake_next_writer) |
599 | wake_up_interruptible_sync_poll(&pipe->wr_wait, EPOLLOUT | EPOLLWRNORM); | |
7e775f46 | 600 | if (ret > 0 && sb_start_write_trylock(file_inode(filp)->i_sb)) { |
c3b2da31 JB |
601 | int err = file_update_time(filp); |
602 | if (err) | |
603 | ret = err; | |
7e775f46 | 604 | sb_end_write(file_inode(filp)->i_sb); |
c3b2da31 | 605 | } |
1da177e4 LT |
606 | return ret; |
607 | } | |
608 | ||
d59d0b1b | 609 | static long pipe_ioctl(struct file *filp, unsigned int cmd, unsigned long arg) |
1da177e4 | 610 | { |
de32ec4c | 611 | struct pipe_inode_info *pipe = filp->private_data; |
8cefc107 | 612 | int count, head, tail, mask; |
1da177e4 LT |
613 | |
614 | switch (cmd) { | |
c73be61c DH |
615 | case FIONREAD: |
616 | __pipe_lock(pipe); | |
617 | count = 0; | |
618 | head = pipe->head; | |
619 | tail = pipe->tail; | |
620 | mask = pipe->ring_size - 1; | |
8cefc107 | 621 | |
c73be61c DH |
622 | while (tail != head) { |
623 | count += pipe->bufs[tail & mask].len; | |
624 | tail++; | |
625 | } | |
626 | __pipe_unlock(pipe); | |
923f4f23 | 627 | |
c73be61c | 628 | return put_user(count, (int __user *)arg); |
923f4f23 | 629 | |
c73be61c DH |
630 | #ifdef CONFIG_WATCH_QUEUE |
631 | case IOC_WATCH_QUEUE_SET_SIZE: { | |
632 | int ret; | |
633 | __pipe_lock(pipe); | |
634 | ret = watch_queue_set_size(pipe, arg); | |
635 | __pipe_unlock(pipe); | |
636 | return ret; | |
637 | } | |
638 | ||
639 | case IOC_WATCH_QUEUE_SET_FILTER: | |
640 | return watch_queue_set_filter( | |
641 | pipe, (struct watch_notification_filter __user *)arg); | |
642 | #endif | |
643 | ||
644 | default: | |
645 | return -ENOIOCTLCMD; | |
1da177e4 LT |
646 | } |
647 | } | |
648 | ||
dd67081b | 649 | /* No kernel lock held - fine */ |
a11e1d43 LT |
650 | static __poll_t |
651 | pipe_poll(struct file *filp, poll_table *wait) | |
dd67081b | 652 | { |
a11e1d43 | 653 | __poll_t mask; |
dd67081b | 654 | struct pipe_inode_info *pipe = filp->private_data; |
ad910e36 | 655 | unsigned int head, tail; |
a11e1d43 | 656 | |
3b844826 LT |
657 | /* Epoll has some historical nasty semantics, this enables them */ |
658 | pipe->poll_usage = 1; | |
659 | ||
ad910e36 | 660 | /* |
0ddad21d | 661 | * Reading pipe state only -- no need for acquiring the semaphore. |
ad910e36 LT |
662 | * |
663 | * But because this is racy, the code has to add the | |
664 | * entry to the poll table _first_ .. | |
665 | */ | |
0ddad21d LT |
666 | if (filp->f_mode & FMODE_READ) |
667 | poll_wait(filp, &pipe->rd_wait, wait); | |
668 | if (filp->f_mode & FMODE_WRITE) | |
669 | poll_wait(filp, &pipe->wr_wait, wait); | |
1da177e4 | 670 | |
ad910e36 LT |
671 | /* |
672 | * .. and only then can you do the racy tests. That way, | |
673 | * if something changes and you got it wrong, the poll | |
674 | * table entry will wake you up and fix it. | |
675 | */ | |
676 | head = READ_ONCE(pipe->head); | |
677 | tail = READ_ONCE(pipe->tail); | |
678 | ||
a11e1d43 | 679 | mask = 0; |
1da177e4 | 680 | if (filp->f_mode & FMODE_READ) { |
8cefc107 DH |
681 | if (!pipe_empty(head, tail)) |
682 | mask |= EPOLLIN | EPOLLRDNORM; | |
923f4f23 | 683 | if (!pipe->writers && filp->f_version != pipe->w_counter) |
a9a08845 | 684 | mask |= EPOLLHUP; |
1da177e4 LT |
685 | } |
686 | ||
687 | if (filp->f_mode & FMODE_WRITE) { | |
6718b6f8 | 688 | if (!pipe_full(head, tail, pipe->max_usage)) |
8cefc107 | 689 | mask |= EPOLLOUT | EPOLLWRNORM; |
5e5d7a22 | 690 | /* |
a9a08845 | 691 | * Most Unices do not set EPOLLERR for FIFOs but on Linux they |
5e5d7a22 PE |
692 | * behave exactly like pipes for poll(). |
693 | */ | |
923f4f23 | 694 | if (!pipe->readers) |
a9a08845 | 695 | mask |= EPOLLERR; |
1da177e4 LT |
696 | } |
697 | ||
698 | return mask; | |
699 | } | |
700 | ||
b0d8d229 LT |
701 | static void put_pipe_info(struct inode *inode, struct pipe_inode_info *pipe) |
702 | { | |
703 | int kill = 0; | |
704 | ||
705 | spin_lock(&inode->i_lock); | |
706 | if (!--pipe->files) { | |
707 | inode->i_pipe = NULL; | |
708 | kill = 1; | |
709 | } | |
710 | spin_unlock(&inode->i_lock); | |
711 | ||
712 | if (kill) | |
713 | free_pipe_info(pipe); | |
714 | } | |
715 | ||
1da177e4 | 716 | static int |
599a0ac1 | 717 | pipe_release(struct inode *inode, struct file *file) |
1da177e4 | 718 | { |
b0d8d229 | 719 | struct pipe_inode_info *pipe = file->private_data; |
923f4f23 | 720 | |
ebec73f4 | 721 | __pipe_lock(pipe); |
599a0ac1 AV |
722 | if (file->f_mode & FMODE_READ) |
723 | pipe->readers--; | |
724 | if (file->f_mode & FMODE_WRITE) | |
725 | pipe->writers--; | |
341b446b | 726 | |
6551d5c5 LT |
727 | /* Was that the last reader or writer, but not the other side? */ |
728 | if (!pipe->readers != !pipe->writers) { | |
729 | wake_up_interruptible_all(&pipe->rd_wait); | |
730 | wake_up_interruptible_all(&pipe->wr_wait); | |
923f4f23 IM |
731 | kill_fasync(&pipe->fasync_readers, SIGIO, POLL_IN); |
732 | kill_fasync(&pipe->fasync_writers, SIGIO, POLL_OUT); | |
1da177e4 | 733 | } |
ebec73f4 | 734 | __pipe_unlock(pipe); |
ba5bb147 | 735 | |
b0d8d229 | 736 | put_pipe_info(inode, pipe); |
1da177e4 LT |
737 | return 0; |
738 | } | |
739 | ||
740 | static int | |
599a0ac1 | 741 | pipe_fasync(int fd, struct file *filp, int on) |
1da177e4 | 742 | { |
de32ec4c | 743 | struct pipe_inode_info *pipe = filp->private_data; |
599a0ac1 | 744 | int retval = 0; |
1da177e4 | 745 | |
ebec73f4 | 746 | __pipe_lock(pipe); |
599a0ac1 AV |
747 | if (filp->f_mode & FMODE_READ) |
748 | retval = fasync_helper(fd, filp, on, &pipe->fasync_readers); | |
749 | if ((filp->f_mode & FMODE_WRITE) && retval >= 0) { | |
341b446b | 750 | retval = fasync_helper(fd, filp, on, &pipe->fasync_writers); |
599a0ac1 AV |
751 | if (retval < 0 && (filp->f_mode & FMODE_READ)) |
752 | /* this can happen only if on == T */ | |
e5bc49ba ON |
753 | fasync_helper(-1, filp, 0, &pipe->fasync_readers); |
754 | } | |
ebec73f4 | 755 | __pipe_unlock(pipe); |
60aa4924 | 756 | return retval; |
1da177e4 LT |
757 | } |
758 | ||
c73be61c DH |
759 | unsigned long account_pipe_buffers(struct user_struct *user, |
760 | unsigned long old, unsigned long new) | |
759c0114 | 761 | { |
9c87bcf0 | 762 | return atomic_long_add_return(new - old, &user->pipe_bufs); |
759c0114 WT |
763 | } |
764 | ||
c73be61c | 765 | bool too_many_pipe_buffers_soft(unsigned long user_bufs) |
759c0114 | 766 | { |
f7340761 EB |
767 | unsigned long soft_limit = READ_ONCE(pipe_user_pages_soft); |
768 | ||
769 | return soft_limit && user_bufs > soft_limit; | |
759c0114 WT |
770 | } |
771 | ||
c73be61c | 772 | bool too_many_pipe_buffers_hard(unsigned long user_bufs) |
759c0114 | 773 | { |
f7340761 EB |
774 | unsigned long hard_limit = READ_ONCE(pipe_user_pages_hard); |
775 | ||
776 | return hard_limit && user_bufs > hard_limit; | |
759c0114 WT |
777 | } |
778 | ||
c73be61c | 779 | bool pipe_is_unprivileged_user(void) |
85c2dd54 EB |
780 | { |
781 | return !capable(CAP_SYS_RESOURCE) && !capable(CAP_SYS_ADMIN); | |
782 | } | |
783 | ||
7bee130e | 784 | struct pipe_inode_info *alloc_pipe_info(void) |
3a326a2c | 785 | { |
923f4f23 | 786 | struct pipe_inode_info *pipe; |
09b4d199 MK |
787 | unsigned long pipe_bufs = PIPE_DEF_BUFFERS; |
788 | struct user_struct *user = get_current_user(); | |
9c87bcf0 | 789 | unsigned long user_bufs; |
f7340761 | 790 | unsigned int max_size = READ_ONCE(pipe_max_size); |
3a326a2c | 791 | |
d86133bd | 792 | pipe = kzalloc(sizeof(struct pipe_inode_info), GFP_KERNEL_ACCOUNT); |
09b4d199 MK |
793 | if (pipe == NULL) |
794 | goto out_free_uid; | |
795 | ||
f7340761 EB |
796 | if (pipe_bufs * PAGE_SIZE > max_size && !capable(CAP_SYS_RESOURCE)) |
797 | pipe_bufs = max_size >> PAGE_SHIFT; | |
086e774a | 798 | |
9c87bcf0 | 799 | user_bufs = account_pipe_buffers(user, 0, pipe_bufs); |
a005ca0e | 800 | |
c73be61c | 801 | if (too_many_pipe_buffers_soft(user_bufs) && pipe_is_unprivileged_user()) { |
46c4c9d1 AXH |
802 | user_bufs = account_pipe_buffers(user, pipe_bufs, PIPE_MIN_DEF_BUFFERS); |
803 | pipe_bufs = PIPE_MIN_DEF_BUFFERS; | |
09b4d199 | 804 | } |
759c0114 | 805 | |
c73be61c | 806 | if (too_many_pipe_buffers_hard(user_bufs) && pipe_is_unprivileged_user()) |
a005ca0e MK |
807 | goto out_revert_acct; |
808 | ||
809 | pipe->bufs = kcalloc(pipe_bufs, sizeof(struct pipe_buffer), | |
810 | GFP_KERNEL_ACCOUNT); | |
811 | ||
09b4d199 | 812 | if (pipe->bufs) { |
0ddad21d LT |
813 | init_waitqueue_head(&pipe->rd_wait); |
814 | init_waitqueue_head(&pipe->wr_wait); | |
09b4d199 | 815 | pipe->r_counter = pipe->w_counter = 1; |
6718b6f8 | 816 | pipe->max_usage = pipe_bufs; |
8cefc107 | 817 | pipe->ring_size = pipe_bufs; |
c73be61c | 818 | pipe->nr_accounted = pipe_bufs; |
09b4d199 | 819 | pipe->user = user; |
09b4d199 MK |
820 | mutex_init(&pipe->mutex); |
821 | return pipe; | |
3a326a2c IM |
822 | } |
823 | ||
a005ca0e | 824 | out_revert_acct: |
9c87bcf0 | 825 | (void) account_pipe_buffers(user, pipe_bufs, 0); |
09b4d199 MK |
826 | kfree(pipe); |
827 | out_free_uid: | |
828 | free_uid(user); | |
35f3d14d | 829 | return NULL; |
3a326a2c IM |
830 | } |
831 | ||
4b8a8f1e | 832 | void free_pipe_info(struct pipe_inode_info *pipe) |
1da177e4 LT |
833 | { |
834 | int i; | |
1da177e4 | 835 | |
c73be61c DH |
836 | #ifdef CONFIG_WATCH_QUEUE |
837 | if (pipe->watch_queue) { | |
838 | watch_queue_clear(pipe->watch_queue); | |
839 | put_watch_queue(pipe->watch_queue); | |
840 | } | |
841 | #endif | |
842 | ||
843 | (void) account_pipe_buffers(pipe->user, pipe->nr_accounted, 0); | |
759c0114 | 844 | free_uid(pipe->user); |
8cefc107 | 845 | for (i = 0; i < pipe->ring_size; i++) { |
923f4f23 | 846 | struct pipe_buffer *buf = pipe->bufs + i; |
1da177e4 | 847 | if (buf->ops) |
a779638c | 848 | pipe_buf_release(pipe, buf); |
1da177e4 | 849 | } |
923f4f23 IM |
850 | if (pipe->tmp_page) |
851 | __free_page(pipe->tmp_page); | |
35f3d14d | 852 | kfree(pipe->bufs); |
923f4f23 | 853 | kfree(pipe); |
1da177e4 LT |
854 | } |
855 | ||
fa3536cc | 856 | static struct vfsmount *pipe_mnt __read_mostly; |
341b446b | 857 | |
c23fbb6b ED |
858 | /* |
859 | * pipefs_dname() is called from d_path(). | |
860 | */ | |
861 | static char *pipefs_dname(struct dentry *dentry, char *buffer, int buflen) | |
862 | { | |
863 | return dynamic_dname(dentry, buffer, buflen, "pipe:[%lu]", | |
75c3cfa8 | 864 | d_inode(dentry)->i_ino); |
c23fbb6b ED |
865 | } |
866 | ||
3ba13d17 | 867 | static const struct dentry_operations pipefs_dentry_operations = { |
c23fbb6b | 868 | .d_dname = pipefs_dname, |
1da177e4 LT |
869 | }; |
870 | ||
871 | static struct inode * get_pipe_inode(void) | |
872 | { | |
a209dfc7 | 873 | struct inode *inode = new_inode_pseudo(pipe_mnt->mnt_sb); |
923f4f23 | 874 | struct pipe_inode_info *pipe; |
1da177e4 LT |
875 | |
876 | if (!inode) | |
877 | goto fail_inode; | |
878 | ||
85fe4025 CH |
879 | inode->i_ino = get_next_ino(); |
880 | ||
7bee130e | 881 | pipe = alloc_pipe_info(); |
923f4f23 | 882 | if (!pipe) |
1da177e4 | 883 | goto fail_iput; |
3a326a2c | 884 | |
ba5bb147 AV |
885 | inode->i_pipe = pipe; |
886 | pipe->files = 2; | |
923f4f23 | 887 | pipe->readers = pipe->writers = 1; |
599a0ac1 | 888 | inode->i_fop = &pipefifo_fops; |
1da177e4 LT |
889 | |
890 | /* | |
891 | * Mark the inode dirty from the very beginning, | |
892 | * that way it will never be moved to the dirty | |
893 | * list because "mark_inode_dirty()" will think | |
894 | * that it already _is_ on the dirty list. | |
895 | */ | |
896 | inode->i_state = I_DIRTY; | |
897 | inode->i_mode = S_IFIFO | S_IRUSR | S_IWUSR; | |
da9592ed DH |
898 | inode->i_uid = current_fsuid(); |
899 | inode->i_gid = current_fsgid(); | |
078cd827 | 900 | inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode); |
923f4f23 | 901 | |
1da177e4 LT |
902 | return inode; |
903 | ||
904 | fail_iput: | |
905 | iput(inode); | |
341b446b | 906 | |
1da177e4 LT |
907 | fail_inode: |
908 | return NULL; | |
909 | } | |
910 | ||
e4fad8e5 | 911 | int create_pipe_files(struct file **res, int flags) |
1da177e4 | 912 | { |
e4fad8e5 | 913 | struct inode *inode = get_pipe_inode(); |
d6cbd281 | 914 | struct file *f; |
8a018eb5 | 915 | int error; |
1da177e4 | 916 | |
1da177e4 | 917 | if (!inode) |
e4fad8e5 | 918 | return -ENFILE; |
1da177e4 | 919 | |
c73be61c | 920 | if (flags & O_NOTIFICATION_PIPE) { |
8a018eb5 QC |
921 | error = watch_queue_init(inode->i_pipe); |
922 | if (error) { | |
923 | free_pipe_info(inode->i_pipe); | |
c73be61c | 924 | iput(inode); |
8a018eb5 | 925 | return error; |
c73be61c | 926 | } |
c73be61c DH |
927 | } |
928 | ||
152b6372 AV |
929 | f = alloc_file_pseudo(inode, pipe_mnt, "", |
930 | O_WRONLY | (flags & (O_NONBLOCK | O_DIRECT)), | |
931 | &pipefifo_fops); | |
e9bb1f9b | 932 | if (IS_ERR(f)) { |
152b6372 AV |
933 | free_pipe_info(inode->i_pipe); |
934 | iput(inode); | |
935 | return PTR_ERR(f); | |
e9bb1f9b | 936 | } |
341b446b | 937 | |
de32ec4c | 938 | f->private_data = inode->i_pipe; |
d6cbd281 | 939 | |
183266f2 AV |
940 | res[0] = alloc_file_clone(f, O_RDONLY | (flags & O_NONBLOCK), |
941 | &pipefifo_fops); | |
e9bb1f9b | 942 | if (IS_ERR(res[0])) { |
b10a4a9f AV |
943 | put_pipe_info(inode, inode->i_pipe); |
944 | fput(f); | |
945 | return PTR_ERR(res[0]); | |
e9bb1f9b | 946 | } |
de32ec4c | 947 | res[0]->private_data = inode->i_pipe; |
e4fad8e5 | 948 | res[1] = f; |
d8e464ec LT |
949 | stream_open(inode, res[0]); |
950 | stream_open(inode, res[1]); | |
e4fad8e5 | 951 | return 0; |
d6cbd281 AK |
952 | } |
953 | ||
5b249b1b | 954 | static int __do_pipe_flags(int *fd, struct file **files, int flags) |
d6cbd281 | 955 | { |
d6cbd281 AK |
956 | int error; |
957 | int fdw, fdr; | |
958 | ||
c73be61c | 959 | if (flags & ~(O_CLOEXEC | O_NONBLOCK | O_DIRECT | O_NOTIFICATION_PIPE)) |
ed8cae8b UD |
960 | return -EINVAL; |
961 | ||
e4fad8e5 AV |
962 | error = create_pipe_files(files, flags); |
963 | if (error) | |
964 | return error; | |
d6cbd281 | 965 | |
ed8cae8b | 966 | error = get_unused_fd_flags(flags); |
d6cbd281 AK |
967 | if (error < 0) |
968 | goto err_read_pipe; | |
969 | fdr = error; | |
970 | ||
ed8cae8b | 971 | error = get_unused_fd_flags(flags); |
d6cbd281 AK |
972 | if (error < 0) |
973 | goto err_fdr; | |
974 | fdw = error; | |
975 | ||
157cf649 | 976 | audit_fd_pair(fdr, fdw); |
d6cbd281 AK |
977 | fd[0] = fdr; |
978 | fd[1] = fdw; | |
d6cbd281 AK |
979 | return 0; |
980 | ||
981 | err_fdr: | |
982 | put_unused_fd(fdr); | |
983 | err_read_pipe: | |
e4fad8e5 AV |
984 | fput(files[0]); |
985 | fput(files[1]); | |
d6cbd281 | 986 | return error; |
1da177e4 LT |
987 | } |
988 | ||
5b249b1b AV |
989 | int do_pipe_flags(int *fd, int flags) |
990 | { | |
991 | struct file *files[2]; | |
992 | int error = __do_pipe_flags(fd, files, flags); | |
993 | if (!error) { | |
994 | fd_install(fd[0], files[0]); | |
995 | fd_install(fd[1], files[1]); | |
996 | } | |
997 | return error; | |
998 | } | |
999 | ||
d35c7b0e UD |
1000 | /* |
1001 | * sys_pipe() is the normal C calling standard for creating | |
1002 | * a pipe. It's not the way Unix traditionally does this, though. | |
1003 | */ | |
0a216dd1 | 1004 | static int do_pipe2(int __user *fildes, int flags) |
d35c7b0e | 1005 | { |
5b249b1b | 1006 | struct file *files[2]; |
d35c7b0e UD |
1007 | int fd[2]; |
1008 | int error; | |
1009 | ||
5b249b1b | 1010 | error = __do_pipe_flags(fd, files, flags); |
d35c7b0e | 1011 | if (!error) { |
5b249b1b AV |
1012 | if (unlikely(copy_to_user(fildes, fd, sizeof(fd)))) { |
1013 | fput(files[0]); | |
1014 | fput(files[1]); | |
1015 | put_unused_fd(fd[0]); | |
1016 | put_unused_fd(fd[1]); | |
d35c7b0e | 1017 | error = -EFAULT; |
5b249b1b AV |
1018 | } else { |
1019 | fd_install(fd[0], files[0]); | |
1020 | fd_install(fd[1], files[1]); | |
ba719bae | 1021 | } |
d35c7b0e UD |
1022 | } |
1023 | return error; | |
1024 | } | |
1025 | ||
0a216dd1 DB |
1026 | SYSCALL_DEFINE2(pipe2, int __user *, fildes, int, flags) |
1027 | { | |
1028 | return do_pipe2(fildes, flags); | |
1029 | } | |
1030 | ||
2b664219 | 1031 | SYSCALL_DEFINE1(pipe, int __user *, fildes) |
ed8cae8b | 1032 | { |
0a216dd1 | 1033 | return do_pipe2(fildes, 0); |
ed8cae8b UD |
1034 | } |
1035 | ||
472e5b05 LT |
1036 | /* |
1037 | * This is the stupid "wait for pipe to be readable or writable" | |
1038 | * model. | |
1039 | * | |
1040 | * See pipe_read/write() for the proper kind of exclusive wait, | |
1041 | * but that requires that we wake up any other readers/writers | |
1042 | * if we then do not end up reading everything (ie the whole | |
1043 | * "wake_next_reader/writer" logic in pipe_read/write()). | |
1044 | */ | |
1045 | void pipe_wait_readable(struct pipe_inode_info *pipe) | |
1046 | { | |
1047 | pipe_unlock(pipe); | |
1048 | wait_event_interruptible(pipe->rd_wait, pipe_readable(pipe)); | |
1049 | pipe_lock(pipe); | |
1050 | } | |
1051 | ||
1052 | void pipe_wait_writable(struct pipe_inode_info *pipe) | |
1053 | { | |
1054 | pipe_unlock(pipe); | |
1055 | wait_event_interruptible(pipe->wr_wait, pipe_writable(pipe)); | |
1056 | pipe_lock(pipe); | |
1057 | } | |
1058 | ||
1059 | /* | |
1060 | * This depends on both the wait (here) and the wakeup (wake_up_partner) | |
1061 | * holding the pipe lock, so "*cnt" is stable and we know a wakeup cannot | |
1062 | * race with the count check and waitqueue prep. | |
1063 | * | |
1064 | * Normally in order to avoid races, you'd do the prepare_to_wait() first, | |
1065 | * then check the condition you're waiting for, and only then sleep. But | |
1066 | * because of the pipe lock, we can check the condition before being on | |
1067 | * the wait queue. | |
1068 | * | |
1069 | * We use the 'rd_wait' waitqueue for pipe partner waiting. | |
1070 | */ | |
fc7478a2 | 1071 | static int wait_for_partner(struct pipe_inode_info *pipe, unsigned int *cnt) |
f776c738 | 1072 | { |
472e5b05 | 1073 | DEFINE_WAIT(rdwait); |
8cefc107 | 1074 | int cur = *cnt; |
f776c738 AV |
1075 | |
1076 | while (cur == *cnt) { | |
472e5b05 LT |
1077 | prepare_to_wait(&pipe->rd_wait, &rdwait, TASK_INTERRUPTIBLE); |
1078 | pipe_unlock(pipe); | |
1079 | schedule(); | |
1080 | finish_wait(&pipe->rd_wait, &rdwait); | |
1081 | pipe_lock(pipe); | |
f776c738 AV |
1082 | if (signal_pending(current)) |
1083 | break; | |
1084 | } | |
1085 | return cur == *cnt ? -ERESTARTSYS : 0; | |
1086 | } | |
1087 | ||
fc7478a2 | 1088 | static void wake_up_partner(struct pipe_inode_info *pipe) |
f776c738 | 1089 | { |
6551d5c5 | 1090 | wake_up_interruptible_all(&pipe->rd_wait); |
f776c738 AV |
1091 | } |
1092 | ||
1093 | static int fifo_open(struct inode *inode, struct file *filp) | |
1094 | { | |
1095 | struct pipe_inode_info *pipe; | |
599a0ac1 | 1096 | bool is_pipe = inode->i_sb->s_magic == PIPEFS_MAGIC; |
f776c738 AV |
1097 | int ret; |
1098 | ||
ba5bb147 AV |
1099 | filp->f_version = 0; |
1100 | ||
1101 | spin_lock(&inode->i_lock); | |
1102 | if (inode->i_pipe) { | |
1103 | pipe = inode->i_pipe; | |
1104 | pipe->files++; | |
1105 | spin_unlock(&inode->i_lock); | |
1106 | } else { | |
1107 | spin_unlock(&inode->i_lock); | |
7bee130e | 1108 | pipe = alloc_pipe_info(); |
f776c738 | 1109 | if (!pipe) |
ba5bb147 AV |
1110 | return -ENOMEM; |
1111 | pipe->files = 1; | |
1112 | spin_lock(&inode->i_lock); | |
1113 | if (unlikely(inode->i_pipe)) { | |
1114 | inode->i_pipe->files++; | |
1115 | spin_unlock(&inode->i_lock); | |
4b8a8f1e | 1116 | free_pipe_info(pipe); |
ba5bb147 AV |
1117 | pipe = inode->i_pipe; |
1118 | } else { | |
1119 | inode->i_pipe = pipe; | |
1120 | spin_unlock(&inode->i_lock); | |
1121 | } | |
f776c738 | 1122 | } |
de32ec4c | 1123 | filp->private_data = pipe; |
ba5bb147 AV |
1124 | /* OK, we have a pipe and it's pinned down */ |
1125 | ||
ebec73f4 | 1126 | __pipe_lock(pipe); |
f776c738 AV |
1127 | |
1128 | /* We can only do regular read/write on fifos */ | |
d8e464ec | 1129 | stream_open(inode, filp); |
f776c738 | 1130 | |
d8e464ec | 1131 | switch (filp->f_mode & (FMODE_READ | FMODE_WRITE)) { |
f776c738 AV |
1132 | case FMODE_READ: |
1133 | /* | |
1134 | * O_RDONLY | |
1135 | * POSIX.1 says that O_NONBLOCK means return with the FIFO | |
1136 | * opened, even when there is no process writing the FIFO. | |
1137 | */ | |
f776c738 AV |
1138 | pipe->r_counter++; |
1139 | if (pipe->readers++ == 0) | |
fc7478a2 | 1140 | wake_up_partner(pipe); |
f776c738 | 1141 | |
599a0ac1 | 1142 | if (!is_pipe && !pipe->writers) { |
f776c738 | 1143 | if ((filp->f_flags & O_NONBLOCK)) { |
a9a08845 | 1144 | /* suppress EPOLLHUP until we have |
f776c738 AV |
1145 | * seen a writer */ |
1146 | filp->f_version = pipe->w_counter; | |
1147 | } else { | |
fc7478a2 | 1148 | if (wait_for_partner(pipe, &pipe->w_counter)) |
f776c738 AV |
1149 | goto err_rd; |
1150 | } | |
1151 | } | |
1152 | break; | |
8cefc107 | 1153 | |
f776c738 AV |
1154 | case FMODE_WRITE: |
1155 | /* | |
1156 | * O_WRONLY | |
1157 | * POSIX.1 says that O_NONBLOCK means return -1 with | |
1158 | * errno=ENXIO when there is no process reading the FIFO. | |
1159 | */ | |
1160 | ret = -ENXIO; | |
599a0ac1 | 1161 | if (!is_pipe && (filp->f_flags & O_NONBLOCK) && !pipe->readers) |
f776c738 AV |
1162 | goto err; |
1163 | ||
f776c738 AV |
1164 | pipe->w_counter++; |
1165 | if (!pipe->writers++) | |
fc7478a2 | 1166 | wake_up_partner(pipe); |
f776c738 | 1167 | |
599a0ac1 | 1168 | if (!is_pipe && !pipe->readers) { |
fc7478a2 | 1169 | if (wait_for_partner(pipe, &pipe->r_counter)) |
f776c738 AV |
1170 | goto err_wr; |
1171 | } | |
1172 | break; | |
8cefc107 | 1173 | |
f776c738 AV |
1174 | case FMODE_READ | FMODE_WRITE: |
1175 | /* | |
1176 | * O_RDWR | |
1177 | * POSIX.1 leaves this case "undefined" when O_NONBLOCK is set. | |
1178 | * This implementation will NEVER block on a O_RDWR open, since | |
1179 | * the process can at least talk to itself. | |
1180 | */ | |
f776c738 AV |
1181 | |
1182 | pipe->readers++; | |
1183 | pipe->writers++; | |
1184 | pipe->r_counter++; | |
1185 | pipe->w_counter++; | |
1186 | if (pipe->readers == 1 || pipe->writers == 1) | |
fc7478a2 | 1187 | wake_up_partner(pipe); |
f776c738 AV |
1188 | break; |
1189 | ||
1190 | default: | |
1191 | ret = -EINVAL; | |
1192 | goto err; | |
1193 | } | |
1194 | ||
1195 | /* Ok! */ | |
ebec73f4 | 1196 | __pipe_unlock(pipe); |
f776c738 AV |
1197 | return 0; |
1198 | ||
1199 | err_rd: | |
1200 | if (!--pipe->readers) | |
0ddad21d | 1201 | wake_up_interruptible(&pipe->wr_wait); |
f776c738 AV |
1202 | ret = -ERESTARTSYS; |
1203 | goto err; | |
1204 | ||
1205 | err_wr: | |
1206 | if (!--pipe->writers) | |
6551d5c5 | 1207 | wake_up_interruptible_all(&pipe->rd_wait); |
f776c738 AV |
1208 | ret = -ERESTARTSYS; |
1209 | goto err; | |
1210 | ||
1211 | err: | |
ebec73f4 | 1212 | __pipe_unlock(pipe); |
b0d8d229 LT |
1213 | |
1214 | put_pipe_info(inode, pipe); | |
f776c738 AV |
1215 | return ret; |
1216 | } | |
1217 | ||
599a0ac1 AV |
1218 | const struct file_operations pipefifo_fops = { |
1219 | .open = fifo_open, | |
1220 | .llseek = no_llseek, | |
fb9096a3 | 1221 | .read_iter = pipe_read, |
f0d1bec9 | 1222 | .write_iter = pipe_write, |
a11e1d43 | 1223 | .poll = pipe_poll, |
599a0ac1 AV |
1224 | .unlocked_ioctl = pipe_ioctl, |
1225 | .release = pipe_release, | |
1226 | .fasync = pipe_fasync, | |
f8ad8187 | 1227 | .splice_write = iter_file_splice_write, |
f776c738 AV |
1228 | }; |
1229 | ||
f491bd71 MK |
1230 | /* |
1231 | * Currently we rely on the pipe array holding a power-of-2 number | |
d3f14c48 | 1232 | * of pages. Returns 0 on error. |
f491bd71 | 1233 | */ |
96e99be4 | 1234 | unsigned int round_pipe_size(unsigned long size) |
f491bd71 | 1235 | { |
c4fed5a9 | 1236 | if (size > (1U << 31)) |
96e99be4 EB |
1237 | return 0; |
1238 | ||
4c2e4bef EB |
1239 | /* Minimum pipe size, as required by POSIX */ |
1240 | if (size < PAGE_SIZE) | |
c4fed5a9 | 1241 | return PAGE_SIZE; |
d3f14c48 | 1242 | |
c4fed5a9 | 1243 | return roundup_pow_of_two(size); |
f491bd71 MK |
1244 | } |
1245 | ||
35f3d14d | 1246 | /* |
c73be61c | 1247 | * Resize the pipe ring to a number of slots. |
35f3d14d | 1248 | */ |
c73be61c | 1249 | int pipe_resize_ring(struct pipe_inode_info *pipe, unsigned int nr_slots) |
35f3d14d JA |
1250 | { |
1251 | struct pipe_buffer *bufs; | |
c73be61c | 1252 | unsigned int head, tail, mask, n; |
35f3d14d | 1253 | |
35f3d14d | 1254 | /* |
8cefc107 DH |
1255 | * We can shrink the pipe, if arg is greater than the ring occupancy. |
1256 | * Since we don't expect a lot of shrink+grow operations, just free and | |
1257 | * allocate again like we would do for growing. If the pipe currently | |
35f3d14d JA |
1258 | * contains more buffers than arg, then return busy. |
1259 | */ | |
8cefc107 DH |
1260 | mask = pipe->ring_size - 1; |
1261 | head = pipe->head; | |
1262 | tail = pipe->tail; | |
1263 | n = pipe_occupancy(pipe->head, pipe->tail); | |
c73be61c DH |
1264 | if (nr_slots < n) |
1265 | return -EBUSY; | |
35f3d14d | 1266 | |
8cefc107 | 1267 | bufs = kcalloc(nr_slots, sizeof(*bufs), |
d86133bd | 1268 | GFP_KERNEL_ACCOUNT | __GFP_NOWARN); |
c73be61c DH |
1269 | if (unlikely(!bufs)) |
1270 | return -ENOMEM; | |
35f3d14d JA |
1271 | |
1272 | /* | |
1273 | * The pipe array wraps around, so just start the new one at zero | |
8cefc107 | 1274 | * and adjust the indices. |
35f3d14d | 1275 | */ |
8cefc107 DH |
1276 | if (n > 0) { |
1277 | unsigned int h = head & mask; | |
1278 | unsigned int t = tail & mask; | |
1279 | if (h > t) { | |
1280 | memcpy(bufs, pipe->bufs + t, | |
1281 | n * sizeof(struct pipe_buffer)); | |
1282 | } else { | |
1283 | unsigned int tsize = pipe->ring_size - t; | |
1284 | if (h > 0) | |
1285 | memcpy(bufs + tsize, pipe->bufs, | |
1286 | h * sizeof(struct pipe_buffer)); | |
1287 | memcpy(bufs, pipe->bufs + t, | |
1288 | tsize * sizeof(struct pipe_buffer)); | |
1289 | } | |
35f3d14d JA |
1290 | } |
1291 | ||
8cefc107 DH |
1292 | head = n; |
1293 | tail = 0; | |
1294 | ||
35f3d14d JA |
1295 | kfree(pipe->bufs); |
1296 | pipe->bufs = bufs; | |
8cefc107 | 1297 | pipe->ring_size = nr_slots; |
c73be61c DH |
1298 | if (pipe->max_usage > nr_slots) |
1299 | pipe->max_usage = nr_slots; | |
8cefc107 DH |
1300 | pipe->tail = tail; |
1301 | pipe->head = head; | |
6551d5c5 LT |
1302 | |
1303 | /* This might have made more room for writers */ | |
1304 | wake_up_interruptible(&pipe->wr_wait); | |
c73be61c DH |
1305 | return 0; |
1306 | } | |
1307 | ||
1308 | /* | |
1309 | * Allocate a new array of pipe buffers and copy the info over. Returns the | |
1310 | * pipe size if successful, or return -ERROR on error. | |
1311 | */ | |
1312 | static long pipe_set_size(struct pipe_inode_info *pipe, unsigned long arg) | |
1313 | { | |
1314 | unsigned long user_bufs; | |
1315 | unsigned int nr_slots, size; | |
1316 | long ret = 0; | |
1317 | ||
1318 | #ifdef CONFIG_WATCH_QUEUE | |
1319 | if (pipe->watch_queue) | |
1320 | return -EBUSY; | |
1321 | #endif | |
1322 | ||
1323 | size = round_pipe_size(arg); | |
1324 | nr_slots = size >> PAGE_SHIFT; | |
1325 | ||
1326 | if (!nr_slots) | |
1327 | return -EINVAL; | |
1328 | ||
1329 | /* | |
1330 | * If trying to increase the pipe capacity, check that an | |
1331 | * unprivileged user is not trying to exceed various limits | |
1332 | * (soft limit check here, hard limit check just below). | |
1333 | * Decreasing the pipe capacity is always permitted, even | |
1334 | * if the user is currently over a limit. | |
1335 | */ | |
1336 | if (nr_slots > pipe->max_usage && | |
1337 | size > pipe_max_size && !capable(CAP_SYS_RESOURCE)) | |
1338 | return -EPERM; | |
1339 | ||
1340 | user_bufs = account_pipe_buffers(pipe->user, pipe->nr_accounted, nr_slots); | |
1341 | ||
1342 | if (nr_slots > pipe->max_usage && | |
1343 | (too_many_pipe_buffers_hard(user_bufs) || | |
1344 | too_many_pipe_buffers_soft(user_bufs)) && | |
1345 | pipe_is_unprivileged_user()) { | |
1346 | ret = -EPERM; | |
1347 | goto out_revert_acct; | |
1348 | } | |
1349 | ||
1350 | ret = pipe_resize_ring(pipe, nr_slots); | |
1351 | if (ret < 0) | |
1352 | goto out_revert_acct; | |
1353 | ||
1354 | pipe->max_usage = nr_slots; | |
1355 | pipe->nr_accounted = nr_slots; | |
6718b6f8 | 1356 | return pipe->max_usage * PAGE_SIZE; |
b0b91d18 MK |
1357 | |
1358 | out_revert_acct: | |
c73be61c | 1359 | (void) account_pipe_buffers(pipe->user, nr_slots, pipe->nr_accounted); |
b0b91d18 | 1360 | return ret; |
35f3d14d JA |
1361 | } |
1362 | ||
72083646 | 1363 | /* |
4e7b5671 CH |
1364 | * Note that i_pipe and i_cdev share the same location, so checking ->i_pipe is |
1365 | * not enough to verify that this is a pipe. | |
72083646 | 1366 | */ |
c73be61c | 1367 | struct pipe_inode_info *get_pipe_info(struct file *file, bool for_splice) |
72083646 | 1368 | { |
c73be61c DH |
1369 | struct pipe_inode_info *pipe = file->private_data; |
1370 | ||
1371 | if (file->f_op != &pipefifo_fops || !pipe) | |
1372 | return NULL; | |
1373 | #ifdef CONFIG_WATCH_QUEUE | |
1374 | if (for_splice && pipe->watch_queue) | |
1375 | return NULL; | |
1376 | #endif | |
1377 | return pipe; | |
72083646 LT |
1378 | } |
1379 | ||
35f3d14d JA |
1380 | long pipe_fcntl(struct file *file, unsigned int cmd, unsigned long arg) |
1381 | { | |
1382 | struct pipe_inode_info *pipe; | |
1383 | long ret; | |
1384 | ||
c73be61c | 1385 | pipe = get_pipe_info(file, false); |
35f3d14d JA |
1386 | if (!pipe) |
1387 | return -EBADF; | |
1388 | ||
ebec73f4 | 1389 | __pipe_lock(pipe); |
35f3d14d JA |
1390 | |
1391 | switch (cmd) { | |
d37d4166 MK |
1392 | case F_SETPIPE_SZ: |
1393 | ret = pipe_set_size(pipe, arg); | |
35f3d14d JA |
1394 | break; |
1395 | case F_GETPIPE_SZ: | |
6718b6f8 | 1396 | ret = pipe->max_usage * PAGE_SIZE; |
35f3d14d JA |
1397 | break; |
1398 | default: | |
1399 | ret = -EINVAL; | |
1400 | break; | |
1401 | } | |
1402 | ||
ebec73f4 | 1403 | __pipe_unlock(pipe); |
35f3d14d JA |
1404 | return ret; |
1405 | } | |
1406 | ||
ff0c7d15 NP |
1407 | static const struct super_operations pipefs_ops = { |
1408 | .destroy_inode = free_inode_nonrcu, | |
d70ef97b | 1409 | .statfs = simple_statfs, |
ff0c7d15 NP |
1410 | }; |
1411 | ||
1da177e4 LT |
1412 | /* |
1413 | * pipefs should _never_ be mounted by userland - too much of security hassle, | |
1414 | * no real gain from having the whole whorehouse mounted. So we don't need | |
1415 | * any operations on the root directory. However, we need a non-trivial | |
1416 | * d_name - pipe: will go nicely and kill the special-casing in procfs. | |
1417 | */ | |
4fa7ec5d DH |
1418 | |
1419 | static int pipefs_init_fs_context(struct fs_context *fc) | |
1da177e4 | 1420 | { |
4fa7ec5d DH |
1421 | struct pseudo_fs_context *ctx = init_pseudo(fc, PIPEFS_MAGIC); |
1422 | if (!ctx) | |
1423 | return -ENOMEM; | |
1424 | ctx->ops = &pipefs_ops; | |
1425 | ctx->dops = &pipefs_dentry_operations; | |
1426 | return 0; | |
1da177e4 LT |
1427 | } |
1428 | ||
1429 | static struct file_system_type pipe_fs_type = { | |
1430 | .name = "pipefs", | |
4fa7ec5d | 1431 | .init_fs_context = pipefs_init_fs_context, |
1da177e4 LT |
1432 | .kill_sb = kill_anon_super, |
1433 | }; | |
1434 | ||
1435 | static int __init init_pipe_fs(void) | |
1436 | { | |
1437 | int err = register_filesystem(&pipe_fs_type); | |
341b446b | 1438 | |
1da177e4 LT |
1439 | if (!err) { |
1440 | pipe_mnt = kern_mount(&pipe_fs_type); | |
1441 | if (IS_ERR(pipe_mnt)) { | |
1442 | err = PTR_ERR(pipe_mnt); | |
1443 | unregister_filesystem(&pipe_fs_type); | |
1444 | } | |
1445 | } | |
1446 | return err; | |
1447 | } | |
1448 | ||
1da177e4 | 1449 | fs_initcall(init_pipe_fs); |