mirror of
https://github.com/mpv-player/mpv
synced 2025-02-01 12:42:04 +00:00
5d44cf93df
On linux, several platforms poll for events over a fd. This has ms accuracy, but mpv's timer is in ns now so lots of precision is lost. We can use an mp_poll wrapper to use ppoll instead which takes a timespec directly with nanosecond precision. On systems without ppoll this falls back to old poll behavior. On wayland, we don't actually use this because ppoll completely messes up the event loop for some unknown reason.
81 lines
2.2 KiB
C
81 lines
2.2 KiB
C
/*
|
|
* This file is part of mpv.
|
|
*
|
|
* mpv is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* mpv is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with mpv. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <poll.h>
|
|
#include <sys/select.h>
|
|
#include <stdio.h>
|
|
|
|
#include "config.h"
|
|
#include "poll_wrapper.h"
|
|
#include "timer.h"
|
|
|
|
|
|
int mp_poll(struct pollfd *fds, int nfds, int64_t timeout_ns)
|
|
{
|
|
#if HAVE_PPOLL
|
|
struct timespec ts = mp_time_ns_to_realtime(timeout_ns);
|
|
return ppoll(fds, nfds, &ts, NULL);
|
|
#endif
|
|
return poll(fds, nfds, timeout_ns / 1e6);
|
|
}
|
|
|
|
// poll shim that supports device files on macOS.
|
|
int polldev(struct pollfd fds[], nfds_t nfds, int timeout)
|
|
{
|
|
#ifdef __APPLE__
|
|
int maxfd = 0;
|
|
fd_set readfds, writefds;
|
|
FD_ZERO(&readfds);
|
|
FD_ZERO(&writefds);
|
|
for (size_t i = 0; i < nfds; ++i) {
|
|
struct pollfd *fd = &fds[i];
|
|
if (fd->fd > maxfd) {
|
|
maxfd = fd->fd;
|
|
}
|
|
if ((fd->events & POLLIN)) {
|
|
FD_SET(fd->fd, &readfds);
|
|
}
|
|
if ((fd->events & POLLOUT)) {
|
|
FD_SET(fd->fd, &writefds);
|
|
}
|
|
}
|
|
struct timeval _timeout = {
|
|
.tv_sec = timeout / 1000,
|
|
.tv_usec = (timeout % 1000) * 1000
|
|
};
|
|
int n = select(maxfd + 1, &readfds, &writefds, NULL,
|
|
timeout != -1 ? &_timeout : NULL);
|
|
if (n < 0) {
|
|
return n;
|
|
}
|
|
for (size_t i = 0; i < nfds; ++i) {
|
|
struct pollfd *fd = &fds[i];
|
|
fd->revents = 0;
|
|
if (FD_ISSET(fd->fd, &readfds)) {
|
|
fd->revents |= POLLIN;
|
|
}
|
|
if (FD_ISSET(fd->fd, &writefds)) {
|
|
fd->revents |= POLLOUT;
|
|
}
|
|
}
|
|
return n;
|
|
#else
|
|
return poll(fds, nfds, timeout);
|
|
#endif
|
|
}
|