| 1 |
/* |
| 2 |
* libev solaris event port backend |
| 3 |
* |
| 4 |
* Copyright (c) 2007,2008,2009 Marc Alexander Lehmann <libev@schmorp.de> |
| 5 |
* All rights reserved. |
| 6 |
* |
| 7 |
* Redistribution and use in source and binary forms, with or without modifica- |
| 8 |
* tion, are permitted provided that the following conditions are met: |
| 9 |
* |
| 10 |
* 1. Redistributions of source code must retain the above copyright notice, |
| 11 |
* this list of conditions and the following disclaimer. |
| 12 |
* |
| 13 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 14 |
* notice, this list of conditions and the following disclaimer in the |
| 15 |
* documentation and/or other materials provided with the distribution. |
| 16 |
* |
| 17 |
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| 18 |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
| 19 |
* CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
| 20 |
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
| 21 |
* CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 22 |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
| 23 |
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 24 |
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- |
| 25 |
* ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
| 26 |
* OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 |
* |
| 28 |
* Alternatively, the contents of this file may be used under the terms of |
| 29 |
* the GNU General Public License ("GPL") version 2 or any later version, |
| 30 |
* in which case the provisions of the GPL are applicable instead of |
| 31 |
* the above. If you wish to allow the use of your version of this file |
| 32 |
* only under the terms of the GPL and not to allow others to use your |
| 33 |
* version of this file under the BSD license, indicate your decision |
| 34 |
* by deleting the provisions above and replace them with the notice |
| 35 |
* and other provisions required by the GPL. If you do not delete the |
| 36 |
* provisions above, a recipient may use your version of this file under |
| 37 |
* either the BSD or the GPL. |
| 38 |
*/ |
| 39 |
|
| 40 |
#include <sys/types.h> |
| 41 |
#include <sys/time.h> |
| 42 |
#include <poll.h> |
| 43 |
#include <port.h> |
| 44 |
#include <string.h> |
| 45 |
#include <errno.h> |
| 46 |
|
| 47 |
void inline_speed |
| 48 |
port_associate_and_check (EV_P_ int fd, int ev) |
| 49 |
{ |
| 50 |
if (0 > |
| 51 |
port_associate ( |
| 52 |
backend_fd, PORT_SOURCE_FD, fd, |
| 53 |
(ev & EV_READ ? POLLIN : 0) |
| 54 |
| (ev & EV_WRITE ? POLLOUT : 0), |
| 55 |
0 |
| 56 |
) |
| 57 |
) |
| 58 |
{ |
| 59 |
if (errno == EBADFD) |
| 60 |
fd_kill (EV_A_ fd); |
| 61 |
else |
| 62 |
ev_syserr ("(libev) port_associate"); |
| 63 |
} |
| 64 |
} |
| 65 |
|
| 66 |
static void |
| 67 |
port_modify (EV_P_ int fd, int oev, int nev) |
| 68 |
{ |
| 69 |
/* we need to reassociate no matter what, as closes are |
| 70 |
* once more silently being discarded. |
| 71 |
*/ |
| 72 |
if (!nev) |
| 73 |
{ |
| 74 |
if (oev) |
| 75 |
port_dissociate (backend_fd, PORT_SOURCE_FD, fd); |
| 76 |
} |
| 77 |
else |
| 78 |
port_associate_and_check (EV_A_ fd, nev); |
| 79 |
} |
| 80 |
|
| 81 |
static void |
| 82 |
port_poll (EV_P_ ev_tstamp timeout) |
| 83 |
{ |
| 84 |
int res, i; |
| 85 |
struct timespec ts; |
| 86 |
uint_t nget = 1; |
| 87 |
|
| 88 |
EV_RELEASE_CB; |
| 89 |
ts.tv_sec = (time_t)timeout; |
| 90 |
ts.tv_nsec = (long)(timeout - (ev_tstamp)ts.tv_sec) * 1e9; |
| 91 |
res = port_getn (backend_fd, port_events, port_eventmax, &nget, &ts); |
| 92 |
EV_ACQUIRE_CB; |
| 93 |
|
| 94 |
if (res == -1) |
| 95 |
{ |
| 96 |
if (errno != EINTR && errno != ETIME) |
| 97 |
ev_syserr ("(libev) port_getn (see http://bugs.opensolaris.org/view_bug.do?bug_id=6268715, try LIBEV_FLAGS=3 env variable)"); |
| 98 |
|
| 99 |
return; |
| 100 |
} |
| 101 |
|
| 102 |
for (i = 0; i < nget; ++i) |
| 103 |
{ |
| 104 |
if (port_events [i].portev_source == PORT_SOURCE_FD) |
| 105 |
{ |
| 106 |
int fd = port_events [i].portev_object; |
| 107 |
|
| 108 |
fd_event ( |
| 109 |
EV_A_ |
| 110 |
fd, |
| 111 |
(port_events [i].portev_events & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
| 112 |
| (port_events [i].portev_events & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
| 113 |
); |
| 114 |
|
| 115 |
port_associate_and_check (EV_A_ fd, anfds [fd].events); |
| 116 |
} |
| 117 |
} |
| 118 |
|
| 119 |
if (expect_false (nget == port_eventmax)) |
| 120 |
{ |
| 121 |
ev_free (port_events); |
| 122 |
port_eventmax = array_nextsize (sizeof (port_event_t), port_eventmax, port_eventmax + 1); |
| 123 |
port_events = (port_event_t *)ev_malloc (sizeof (port_event_t) * port_eventmax); |
| 124 |
} |
| 125 |
} |
| 126 |
|
| 127 |
int inline_size |
| 128 |
port_init (EV_P_ int flags) |
| 129 |
{ |
| 130 |
/* Initalize the kernel queue */ |
| 131 |
if ((backend_fd = port_create ()) < 0) |
| 132 |
return 0; |
| 133 |
|
| 134 |
fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */ |
| 135 |
|
| 136 |
backend_fudge = 1e-3; /* needed to compensate for port_getn returning early */ |
| 137 |
backend_modify = port_modify; |
| 138 |
backend_poll = port_poll; |
| 139 |
|
| 140 |
port_eventmax = 64; /* intiial number of events receivable per poll */ |
| 141 |
port_events = (port_event_t *)ev_malloc (sizeof (port_event_t) * port_eventmax); |
| 142 |
|
| 143 |
return EVBACKEND_PORT; |
| 144 |
} |
| 145 |
|
| 146 |
void inline_size |
| 147 |
port_destroy (EV_P) |
| 148 |
{ |
| 149 |
ev_free (port_events); |
| 150 |
} |
| 151 |
|
| 152 |
void inline_size |
| 153 |
port_fork (EV_P) |
| 154 |
{ |
| 155 |
close (backend_fd); |
| 156 |
|
| 157 |
while ((backend_fd = port_create ()) < 0) |
| 158 |
ev_syserr ("(libev) port"); |
| 159 |
|
| 160 |
fcntl (backend_fd, F_SETFD, FD_CLOEXEC); |
| 161 |
|
| 162 |
/* re-register interest in fds */ |
| 163 |
fd_rearm_all (EV_A); |
| 164 |
} |
| 165 |
|