… | |
… | |
2 | * libev solaris event port backend |
2 | * libev solaris event port backend |
3 | * |
3 | * |
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
5 | * All rights reserved. |
5 | * All rights reserved. |
6 | * |
6 | * |
7 | * Redistribution and use in source and binary forms, with or without |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * modification, are permitted provided that the following conditions are |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * 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. |
10 | * |
27 | * |
11 | * * Redistributions of source code must retain the above copyright |
28 | * Alternatively, the contents of this file may be used under the terms of |
12 | * notice, this list of conditions and the following disclaimer. |
29 | * the GNU General Public License ("GPL") version 2 or any later version, |
13 | * |
30 | * in which case the provisions of the GPL are applicable instead of |
14 | * * Redistributions in binary form must reproduce the above |
31 | * the above. If you wish to allow the use of your version of this file |
15 | * copyright notice, this list of conditions and the following |
32 | * only under the terms of the GPL and not to allow others to use your |
16 | * disclaimer in the documentation and/or other materials provided |
33 | * version of this file under the BSD license, indicate your decision |
17 | * with the distribution. |
34 | * by deleting the provisions above and replace them with the notice |
18 | * |
35 | * and other provisions required by the GPL. If you do not delete the |
19 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
36 | * provisions above, a recipient may use your version of this file under |
20 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
37 | * either the BSD or the GPL. |
21 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
|
22 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
|
23 | * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
|
24 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
|
25 | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|
|
26 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|
|
27 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
|
28 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
|
29 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
30 | */ |
38 | */ |
31 | |
39 | |
32 | #include <sys/types.h> |
40 | #include <sys/types.h> |
33 | #include <sys/time.h> |
41 | #include <sys/time.h> |
34 | #include <poll.h> |
42 | #include <poll.h> |
35 | #include <port.h> |
43 | #include <port.h> |
36 | #include <string.h> |
44 | #include <string.h> |
37 | #include <errno.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 | syserr ("(libev) port_associate"); |
|
|
63 | } |
|
|
64 | } |
38 | |
65 | |
39 | static void |
66 | static void |
40 | port_modify (EV_P_ int fd, int oev, int nev) |
67 | port_modify (EV_P_ int fd, int oev, int nev) |
41 | { |
68 | { |
42 | /* we need to reassociate no matter what, as closes are |
69 | /* we need to reassociate no matter what, as closes are |
… | |
… | |
45 | if (!nev) |
72 | if (!nev) |
46 | { |
73 | { |
47 | if (oev) |
74 | if (oev) |
48 | port_dissociate (backend_fd, PORT_SOURCE_FD, fd); |
75 | port_dissociate (backend_fd, PORT_SOURCE_FD, fd); |
49 | } |
76 | } |
50 | else if (0 > |
|
|
51 | port_associate ( |
|
|
52 | backend_fd, PORT_SOURCE_FD, fd, |
|
|
53 | (nev & EV_READ ? POLLIN : 0) |
|
|
54 | | (nev & EV_WRITE ? POLLOUT : 0), |
|
|
55 | 0 |
|
|
56 | ) |
|
|
57 | ) |
|
|
58 | { |
|
|
59 | if (errno == EBADFD) |
|
|
60 | fd_kill (EV_A_ fd); |
|
|
61 | else |
77 | else |
62 | syserr ("(libev) port_associate"); |
78 | port_associate_and_check (EV_A_ fd, nev); |
63 | } |
|
|
64 | } |
79 | } |
65 | |
80 | |
66 | static void |
81 | static void |
67 | port_poll (EV_P_ ev_tstamp timeout) |
82 | port_poll (EV_P_ ev_tstamp timeout) |
68 | { |
83 | { |
… | |
… | |
93 | fd, |
108 | fd, |
94 | (port_events [i].portev_events & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
109 | (port_events [i].portev_events & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
95 | | (port_events [i].portev_events & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
110 | | (port_events [i].portev_events & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
96 | ); |
111 | ); |
97 | |
112 | |
98 | anfds [fd].events = 0; /* event received == disassociated */ |
113 | port_associate_and_check (EV_A_ fd, anfds [fd].events); |
99 | fd_change (EV_A_ fd); /* need to reify later */ |
|
|
100 | } |
114 | } |
101 | } |
115 | } |
102 | |
116 | |
103 | if (expect_false (nget == port_eventmax)) |
117 | if (expect_false (nget == port_eventmax)) |
104 | { |
118 | { |
105 | ev_free (port_events); |
119 | ev_free (port_events); |
106 | port_eventmax = array_roundsize (port_event_t, port_eventmax << 1); |
120 | port_eventmax = array_nextsize (sizeof (port_event_t), port_eventmax, port_eventmax + 1); |
107 | port_events = (port_event_t *)ev_malloc (sizeof (port_event_t) * port_eventmax); |
121 | port_events = (port_event_t *)ev_malloc (sizeof (port_event_t) * port_eventmax); |
108 | } |
122 | } |
109 | } |
123 | } |
110 | |
124 | |
111 | int inline_size |
125 | int inline_size |