| 1 | /* |
1 | /* |
| 2 | * libev poll fd activity backend |
2 | * libev poll fd activity backend |
| 3 | * |
3 | * |
| 4 | * Copyright (c) 2007,2008,2009,2010,2011 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011,2016,2019 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 modifica- |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
| 8 | * tion, are permitted provided that the following conditions are met: |
8 | * tion, are permitted provided that the following conditions are met: |
| 9 | * |
9 | * |
| … | |
… | |
| 37 | * either the BSD or the GPL. |
37 | * either the BSD or the GPL. |
| 38 | */ |
38 | */ |
| 39 | |
39 | |
| 40 | #include <poll.h> |
40 | #include <poll.h> |
| 41 | |
41 | |
| 42 | void inline_size |
42 | inline_size |
| 43 | pollidx_init (int *base, int count) |
43 | void |
|
|
44 | array_needsize_pollidx (int *base, int offset, int count) |
| 44 | { |
45 | { |
| 45 | /* consider using memset (.., -1, ...), which is practically guaranteed |
46 | /* using memset (.., -1, ...) is tempting, we we try |
| 46 | * to work on all systems implementing poll */ |
47 | * to be ultraportable |
|
|
48 | */ |
|
|
49 | base += offset; |
| 47 | while (count--) |
50 | while (count--) |
| 48 | *base++ = -1; |
51 | *base++ = -1; |
| 49 | } |
52 | } |
| 50 | |
53 | |
| 51 | static void |
54 | static void |
| … | |
… | |
| 54 | int idx; |
57 | int idx; |
| 55 | |
58 | |
| 56 | if (oev == nev) |
59 | if (oev == nev) |
| 57 | return; |
60 | return; |
| 58 | |
61 | |
| 59 | array_needsize (int, pollidxs, pollidxmax, fd + 1, pollidx_init); |
62 | array_needsize (int, pollidxs, pollidxmax, fd + 1, array_needsize_pollidx); |
| 60 | |
63 | |
| 61 | idx = pollidxs [fd]; |
64 | idx = pollidxs [fd]; |
| 62 | |
65 | |
| 63 | if (idx < 0) /* need to allocate a new pollfd */ |
66 | if (idx < 0) /* need to allocate a new pollfd */ |
| 64 | { |
67 | { |
| 65 | pollidxs [fd] = idx = pollcnt++; |
68 | pollidxs [fd] = idx = pollcnt++; |
| 66 | array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2); |
69 | array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit); |
| 67 | polls [idx].fd = fd; |
70 | polls [idx].fd = fd; |
| 68 | } |
71 | } |
| 69 | |
72 | |
| 70 | assert (polls [idx].fd == fd); |
73 | assert (polls [idx].fd == fd); |
| 71 | |
74 | |
| … | |
… | |
| 124 | ); |
127 | ); |
| 125 | } |
128 | } |
| 126 | } |
129 | } |
| 127 | } |
130 | } |
| 128 | |
131 | |
| 129 | int inline_size |
132 | inline_size |
|
|
133 | int |
| 130 | poll_init (EV_P_ int flags) |
134 | poll_init (EV_P_ int flags) |
| 131 | { |
135 | { |
| 132 | backend_mintime = 1e-3; |
136 | backend_mintime = 1e-3; |
| 133 | backend_modify = poll_modify; |
137 | backend_modify = poll_modify; |
| 134 | backend_poll = poll_poll; |
138 | backend_poll = poll_poll; |
| … | |
… | |
| 137 | polls = 0; pollmax = 0; pollcnt = 0; |
141 | polls = 0; pollmax = 0; pollcnt = 0; |
| 138 | |
142 | |
| 139 | return EVBACKEND_POLL; |
143 | return EVBACKEND_POLL; |
| 140 | } |
144 | } |
| 141 | |
145 | |
| 142 | void inline_size |
146 | inline_size |
|
|
147 | void |
| 143 | poll_destroy (EV_P) |
148 | poll_destroy (EV_P) |
| 144 | { |
149 | { |
| 145 | ev_free (pollidxs); |
150 | ev_free (pollidxs); |
| 146 | ev_free (polls); |
151 | ev_free (polls); |
| 147 | } |
152 | } |
