2014-07-23 17:21:00 +00:00
|
|
|
#pragma once
|
2023-04-01 03:18:41 +00:00
|
|
|
///@file
|
2014-07-23 17:21:00 +00:00
|
|
|
|
|
|
|
#include <thread>
|
2014-07-23 22:16:06 +00:00
|
|
|
#include <atomic>
|
2014-07-23 17:21:00 +00:00
|
|
|
|
2014-12-14 00:51:14 +00:00
|
|
|
#include <cstdlib>
|
2014-07-23 17:21:00 +00:00
|
|
|
#include <poll.h>
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <signal.h>
|
|
|
|
|
|
|
|
namespace nix {
|
|
|
|
|
|
|
|
|
|
|
|
class MonitorFdHup
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
std::thread thread;
|
|
|
|
|
|
|
|
public:
|
|
|
|
MonitorFdHup(int fd)
|
|
|
|
{
|
2014-07-24 07:52:10 +00:00
|
|
|
thread = std::thread([fd]() {
|
2018-02-14 17:35:07 +00:00
|
|
|
while (true) {
|
2023-01-11 18:48:40 +00:00
|
|
|
/* Wait indefinitely until a POLLHUP occurs. */
|
|
|
|
struct pollfd fds[1];
|
|
|
|
fds[0].fd = fd;
|
|
|
|
/* Polling for no specific events (i.e. just waiting
|
|
|
|
for an error/hangup) doesn't work on macOS
|
|
|
|
anymore. So wait for read events and ignore
|
|
|
|
them. */
|
|
|
|
fds[0].events =
|
|
|
|
#ifdef __APPLE__
|
|
|
|
POLLRDNORM
|
|
|
|
#else
|
|
|
|
0
|
|
|
|
#endif
|
|
|
|
;
|
|
|
|
auto count = poll(fds, 1, -1);
|
|
|
|
if (count == -1) abort(); // can't happen
|
|
|
|
/* This shouldn't happen, but can on macOS due to a bug.
|
|
|
|
See rdar://37550628.
|
|
|
|
|
|
|
|
This may eventually need a delay or further
|
|
|
|
coordination with the main thread if spinning proves
|
|
|
|
too harmful.
|
|
|
|
*/
|
|
|
|
if (count == 0) continue;
|
|
|
|
if (fds[0].revents & POLLHUP) {
|
|
|
|
triggerInterrupt();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* This will only happen on macOS. We sleep a bit to
|
|
|
|
avoid waking up too often if the client is sending
|
|
|
|
input. */
|
|
|
|
sleep(1);
|
2018-02-14 17:35:07 +00:00
|
|
|
}
|
2014-07-23 17:21:00 +00:00
|
|
|
});
|
|
|
|
};
|
|
|
|
|
|
|
|
~MonitorFdHup()
|
|
|
|
{
|
2014-07-24 09:47:51 +00:00
|
|
|
pthread_cancel(thread.native_handle());
|
2014-07-23 17:21:00 +00:00
|
|
|
thread.join();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
}
|