]>
git.ipfire.org Git - thirdparty/systemd.git/blob - src/basic/io-util.c
1 /* SPDX-License-Identifier: LGPL-2.1-or-later */
9 #include "string-util.h"
10 #include "time-util.h"
12 int flush_fd(int fd
) {
15 /* Read from the specified file descriptor, until POLLIN is not set anymore, throwing away everything
16 * read. Note that some file descriptors (notable IP sockets) will trigger POLLIN even when no data can be read
17 * (due to IP packet checksum mismatches), hence this function is only safe to be non-blocking if the fd used
18 * was set to non-blocking too. */
25 r
= fd_wait_for_event(fd
, POLLIN
, 0);
35 l
= read(fd
, buf
, sizeof(buf
));
51 ssize_t
loop_read(int fd
, void *buf
, size_t nbytes
, bool do_poll
) {
52 uint8_t *p
= ASSERT_PTR(buf
);
57 /* If called with nbytes == 0, let's call read() at least
58 * once, to validate the operation */
60 if (nbytes
> (size_t) SSIZE_MAX
)
66 k
= read(fd
, p
, nbytes
);
71 if (errno
== EAGAIN
&& do_poll
) {
73 /* We knowingly ignore any return value here,
74 * and expect that any error/EOF is reported
77 (void) fd_wait_for_event(fd
, POLLIN
, USEC_INFINITY
);
81 return n
> 0 ? n
: -errno
;
87 assert((size_t) k
<= nbytes
);
97 int loop_read_exact(int fd
, void *buf
, size_t nbytes
, bool do_poll
) {
100 n
= loop_read(fd
, buf
, nbytes
, do_poll
);
103 if ((size_t) n
!= nbytes
)
109 int loop_write(int fd
, const void *buf
, size_t nbytes
, bool do_poll
) {
110 const uint8_t *p
= ASSERT_PTR(buf
);
114 if (_unlikely_(nbytes
> (size_t) SSIZE_MAX
))
120 k
= write(fd
, p
, nbytes
);
125 if (errno
== EAGAIN
&& do_poll
) {
126 /* We knowingly ignore any return value here,
127 * and expect that any error/EOF is reported
130 (void) fd_wait_for_event(fd
, POLLOUT
, USEC_INFINITY
);
137 if (_unlikely_(nbytes
> 0 && k
== 0)) /* Can't really happen */
140 assert((size_t) k
<= nbytes
);
144 } while (nbytes
> 0);
149 int pipe_eof(int fd
) {
152 r
= fd_wait_for_event(fd
, POLLIN
, 0);
156 return !!(r
& POLLHUP
);
159 int ppoll_usec(struct pollfd
*fds
, size_t nfds
, usec_t timeout
) {
162 assert(fds
|| nfds
== 0);
164 /* This is a wrapper around ppoll() that does primarily two things:
166 * ✅ Takes a usec_t instead of a struct timespec
168 * ✅ Guarantees that if an invalid fd is specified we return EBADF (i.e. converts POLLNVAL to
169 * EBADF). This is done because EBADF is a programming error usually, and hence should bubble up
170 * as error, and not be eaten up as non-error POLLNVAL event.
172 * ⚠️ ⚠️ ⚠️ Note that this function does not add any special handling for EINTR. Don't forget
173 * poll()/ppoll() will return with EINTR on any received signal always, there is no automatic
174 * restarting via SA_RESTART available. Thus, typically you want to handle EINTR not as an error,
175 * but just as reason to restart things, under the assumption you use a more appropriate mechanism
176 * to handle signals, such as signalfd() or signal handlers. ⚠️ ⚠️ ⚠️
182 r
= ppoll(fds
, nfds
, timeout
== USEC_INFINITY
? NULL
: TIMESPEC_STORE(timeout
), NULL
);
188 for (size_t i
= 0, n
= r
; i
< nfds
&& n
> 0; i
++) {
189 if (fds
[i
].revents
== 0)
191 if (fds
[i
].revents
& POLLNVAL
)
199 int fd_wait_for_event(int fd
, int event
, usec_t timeout
) {
200 struct pollfd pollfd
= {
206 /* ⚠️ ⚠️ ⚠️ Keep in mind you almost certainly want to handle -EINTR gracefully in the caller, see
207 * ppoll_usec() above! ⚠️ ⚠️ ⚠️ */
209 r
= ppoll_usec(&pollfd
, 1, timeout
);
213 return pollfd
.revents
;
216 static size_t nul_length(const uint8_t *p
, size_t sz
) {
231 ssize_t
sparse_write(int fd
, const void *p
, size_t sz
, size_t run_length
) {
232 const uint8_t *q
, *w
, *e
;
240 n
= nul_length(q
, e
- q
);
242 /* If there are more than the specified run length of
243 * NUL bytes, or if this is the beginning or the end
244 * of the buffer, then seek instead of write */
245 if ((n
> run_length
) ||
247 (n
> 0 && q
+ n
>= e
)) {
249 l
= write(fd
, w
, q
- w
);
256 if (lseek(fd
, n
, SEEK_CUR
) == (off_t
) -1)
268 l
= write(fd
, w
, q
- w
);
275 return q
- (const uint8_t*) p
;
278 char* set_iovec_string_field(struct iovec
*iovec
, size_t *n_iovec
, const char *field
, const char *value
) {
281 x
= strjoin(field
, value
);
283 iovec
[(*n_iovec
)++] = IOVEC_MAKE_STRING(x
);
287 char* set_iovec_string_field_free(struct iovec
*iovec
, size_t *n_iovec
, const char *field
, char *value
) {
290 x
= set_iovec_string_field(iovec
, n_iovec
, field
, value
);
295 struct iovec_wrapper
*iovw_new(void) {
296 return malloc0(sizeof(struct iovec_wrapper
));
299 void iovw_free_contents(struct iovec_wrapper
*iovw
, bool free_vectors
) {
301 for (size_t i
= 0; i
< iovw
->count
; i
++)
302 free(iovw
->iovec
[i
].iov_base
);
304 iovw
->iovec
= mfree(iovw
->iovec
);
308 struct iovec_wrapper
*iovw_free_free(struct iovec_wrapper
*iovw
) {
309 iovw_free_contents(iovw
, true);
314 struct iovec_wrapper
*iovw_free(struct iovec_wrapper
*iovw
) {
315 iovw_free_contents(iovw
, false);
320 int iovw_put(struct iovec_wrapper
*iovw
, void *data
, size_t len
) {
321 if (iovw
->count
>= IOV_MAX
)
324 if (!GREEDY_REALLOC(iovw
->iovec
, iovw
->count
+ 1))
327 iovw
->iovec
[iovw
->count
++] = IOVEC_MAKE(data
, len
);
331 int iovw_put_string_field(struct iovec_wrapper
*iovw
, const char *field
, const char *value
) {
332 _cleanup_free_
char *x
= NULL
;
335 x
= strjoin(field
, value
);
339 r
= iovw_put(iovw
, x
, strlen(x
));
346 int iovw_put_string_field_free(struct iovec_wrapper
*iovw
, const char *field
, char *value
) {
347 _cleanup_free_ _unused_
char *free_ptr
= value
;
349 return iovw_put_string_field(iovw
, field
, value
);
352 void iovw_rebase(struct iovec_wrapper
*iovw
, char *old
, char *new) {
353 for (size_t i
= 0; i
< iovw
->count
; i
++)
354 iovw
->iovec
[i
].iov_base
= (char *)iovw
->iovec
[i
].iov_base
- old
+ new;
357 size_t iovw_size(struct iovec_wrapper
*iovw
) {
360 for (size_t i
= 0; i
< iovw
->count
; i
++)
361 n
+= iovw
->iovec
[i
].iov_len
;