|
|
1 | /* |
|
|
2 | * loop member variable declarations |
|
|
3 | * |
|
|
4 | * Copyright (c) 2007,2008,2009,2010,2011,2012,2013,2019 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 | |
| 1 | #define VARx(type,name) VAR(name, type name) |
40 | #define VARx(type,name) VAR(name, type name) |
| 2 | |
41 | |
| 3 | VARx(ev_tstamp, now_floor); /* last time we refreshed rt_time */ |
42 | VARx(ev_tstamp, now_floor) /* last time we refreshed rt_time */ |
| 4 | VARx(ev_tstamp, mn_now); /* monotonic clock "now" */ |
43 | VARx(ev_tstamp, mn_now) /* monotonic clock "now" */ |
| 5 | VARx(ev_tstamp, rt_now); |
|
|
| 6 | VARx(ev_tstamp, diff); /* difference realtime - monotonic time */ |
44 | VARx(ev_tstamp, rtmn_diff) /* difference realtime - monotonic time */ |
| 7 | VARx(int, method); |
|
|
| 8 | |
45 | |
| 9 | VARx(int, have_monotonic); /* runtime */ |
46 | /* for reverse feeding of events */ |
|
|
47 | VARx(W *, rfeeds) |
|
|
48 | VARx(int, rfeedmax) |
|
|
49 | VARx(int, rfeedcnt) |
| 10 | |
50 | |
|
|
51 | VAR (pendings, ANPENDING *pendings [NUMPRI]) |
|
|
52 | VAR (pendingmax, int pendingmax [NUMPRI]) |
|
|
53 | VAR (pendingcnt, int pendingcnt [NUMPRI]) |
|
|
54 | VARx(int, pendingpri) /* highest priority currently pending */ |
|
|
55 | VARx(ev_prepare, pending_w) /* dummy pending watcher */ |
|
|
56 | |
|
|
57 | VARx(ev_tstamp, io_blocktime) |
|
|
58 | VARx(ev_tstamp, timeout_blocktime) |
|
|
59 | |
|
|
60 | VARx(int, backend) |
|
|
61 | VARx(int, activecnt) /* total number of active events ("refcount") */ |
|
|
62 | VARx(EV_ATOMIC_T, loop_done) /* signal by ev_break */ |
|
|
63 | |
|
|
64 | VARx(int, backend_fd) |
| 11 | VARx(ev_tstamp, method_fudge); /* assumed typical timer resolution */ |
65 | VARx(ev_tstamp, backend_mintime) /* assumed typical timer resolution */ |
| 12 | VAR (method_modify, void (*method_modify)(EV_P_ int fd, int oev, int nev)); |
66 | VAR (backend_modify, void (*backend_modify)(EV_P_ int fd, int oev, int nev)) |
| 13 | VAR (method_poll , void (*method_poll)(EV_P_ ev_tstamp timeout)); |
67 | VAR (backend_poll , void (*backend_poll)(EV_P_ ev_tstamp timeout)) |
| 14 | |
68 | |
| 15 | VARx(int, activecnt); /* number of active events */ |
69 | VARx(ANFD *, anfds) |
|
|
70 | VARx(int, anfdmax) |
| 16 | |
71 | |
| 17 | #if EV_USE_SELECT |
72 | VAR (evpipe, int evpipe [2]) |
| 18 | VARx(unsigned char *, vec_ri); |
73 | VARx(ev_io, pipe_w) |
| 19 | VARx(unsigned char *, vec_ro); |
74 | VARx(EV_ATOMIC_T, pipe_write_wanted) |
| 20 | VARx(unsigned char *, vec_wi); |
75 | VARx(EV_ATOMIC_T, pipe_write_skipped) |
| 21 | VARx(unsigned char *, vec_wo); |
76 | |
|
|
77 | #if !defined(_WIN32) || EV_GENWRAP |
|
|
78 | VARx(pid_t, curpid) |
|
|
79 | #endif |
|
|
80 | |
|
|
81 | VARx(char, postfork) /* true if we need to recreate kernel state after fork */ |
|
|
82 | |
|
|
83 | #if EV_USE_SELECT || EV_GENWRAP |
|
|
84 | VARx(void *, vec_ri) |
|
|
85 | VARx(void *, vec_ro) |
|
|
86 | VARx(void *, vec_wi) |
|
|
87 | VARx(void *, vec_wo) |
|
|
88 | #if defined(_WIN32) || EV_GENWRAP |
|
|
89 | VARx(void *, vec_eo) |
|
|
90 | #endif |
| 22 | VARx(int, vec_max); |
91 | VARx(int, vec_max) |
| 23 | #endif |
92 | #endif |
| 24 | |
93 | |
| 25 | #if EV_USEV_POLL |
94 | #if EV_USE_POLL || EV_GENWRAP |
| 26 | VARx(struct pollfd *, polls); |
95 | VARx(struct pollfd *, polls) |
| 27 | VARx(int, pollmax); |
96 | VARx(int, pollmax) |
| 28 | VARx(int, pollcnt); |
97 | VARx(int, pollcnt) |
| 29 | VARx(int *, pollidxs); /* maps fds into structure indices */ |
98 | VARx(int *, pollidxs) /* maps fds into structure indices */ |
| 30 | VARx(int, pollidxmax); |
99 | VARx(int, pollidxmax) |
| 31 | #endif |
100 | #endif |
| 32 | |
101 | |
| 33 | #if EV_USE_EPOLL |
102 | #if EV_USE_EPOLL || EV_GENWRAP |
| 34 | VARx(int, epoll_fd); |
|
|
| 35 | |
|
|
| 36 | VARx(struct epoll_event *, events); |
103 | VARx(struct epoll_event *, epoll_events) |
| 37 | VARx(int, eventmax); |
104 | VARx(int, epoll_eventmax) |
|
|
105 | VARx(int *, epoll_eperms) |
|
|
106 | VARx(int, epoll_epermcnt) |
|
|
107 | VARx(int, epoll_epermmax) |
| 38 | #endif |
108 | #endif |
| 39 | |
109 | |
| 40 | #if EV_USE_KQUEUE |
110 | #if EV_USE_LINUXAIO || EV_GENWRAP |
|
|
111 | VARx(aio_context_t, linuxaio_ctx) |
|
|
112 | VARx(int, linuxaio_iteration) |
|
|
113 | VARx(struct aniocb **, linuxaio_iocbps) |
|
|
114 | VARx(int, linuxaio_iocbpmax) |
|
|
115 | VARx(struct iocb **, linuxaio_submits) |
|
|
116 | VARx(int, linuxaio_submitcnt) |
|
|
117 | VARx(int, linuxaio_submitmax) |
|
|
118 | VARx(ev_io, linuxaio_epoll_w) |
|
|
119 | #endif |
|
|
120 | |
|
|
121 | #if EV_USE_KQUEUE || EV_GENWRAP |
| 41 | VARx(int, kqueue_fd); |
122 | VARx(pid_t, kqueue_fd_pid) |
| 42 | VARx(struct kevent *, kqueue_changes); |
123 | VARx(struct kevent *, kqueue_changes) |
| 43 | VARx(int, kqueue_changemax); |
124 | VARx(int, kqueue_changemax) |
| 44 | VARx(int, kqueue_changecnt); |
125 | VARx(int, kqueue_changecnt) |
| 45 | VARx(struct kevent *, kqueue_events); |
126 | VARx(struct kevent *, kqueue_events) |
| 46 | VARx(int, kqueue_eventmax); |
127 | VARx(int, kqueue_eventmax) |
| 47 | #endif |
128 | #endif |
| 48 | |
129 | |
| 49 | VARx(ANFD *, anfds); |
130 | #if EV_USE_PORT || EV_GENWRAP |
| 50 | VARx(int, anfdmax); |
131 | VARx(struct port_event *, port_events) |
|
|
132 | VARx(int, port_eventmax) |
|
|
133 | #endif |
| 51 | |
134 | |
| 52 | VAR (pendings, ANPENDING *pendings [NUMPRI]); |
135 | #if EV_USE_IOCP || EV_GENWRAP |
| 53 | VAR (pendingmax, int pendingmax [NUMPRI]); |
136 | VARx(HANDLE, iocp) |
| 54 | VAR (pendingcnt, int pendingcnt [NUMPRI]); |
137 | #endif |
| 55 | |
138 | |
| 56 | VARx(int *, fdchanges); |
139 | VARx(int *, fdchanges) |
| 57 | VARx(int, fdchangemax); |
140 | VARx(int, fdchangemax) |
| 58 | VARx(int, fdchangecnt); |
141 | VARx(int, fdchangecnt) |
| 59 | |
142 | |
| 60 | VARx(struct ev_timer **, timers); |
143 | VARx(ANHE *, timers) |
| 61 | VARx(int, timermax); |
144 | VARx(int, timermax) |
| 62 | VARx(int, timercnt); |
145 | VARx(int, timercnt) |
| 63 | |
146 | |
| 64 | VARx(struct ev_periodic **, periodics); |
147 | #if EV_PERIODIC_ENABLE || EV_GENWRAP |
|
|
148 | VARx(ANHE *, periodics) |
| 65 | VARx(int, periodicmax); |
149 | VARx(int, periodicmax) |
| 66 | VARx(int, periodiccnt); |
150 | VARx(int, periodiccnt) |
|
|
151 | #endif |
| 67 | |
152 | |
| 68 | VARx(struct ev_idle **, idles); |
153 | #if EV_IDLE_ENABLE || EV_GENWRAP |
| 69 | VARx(int, idlemax); |
154 | VAR (idles, ev_idle **idles [NUMPRI]) |
| 70 | VARx(int, idlecnt); |
155 | VAR (idlemax, int idlemax [NUMPRI]) |
|
|
156 | VAR (idlecnt, int idlecnt [NUMPRI]) |
|
|
157 | #endif |
|
|
158 | VARx(int, idleall) /* total number */ |
| 71 | |
159 | |
| 72 | VARx(struct ev_prepare **, prepares); |
160 | VARx(struct ev_prepare **, prepares) |
| 73 | VARx(int, preparemax); |
161 | VARx(int, preparemax) |
| 74 | VARx(int, preparecnt); |
162 | VARx(int, preparecnt) |
| 75 | |
163 | |
| 76 | VARx(struct ev_check **, checks); |
164 | VARx(struct ev_check **, checks) |
| 77 | VARx(int, checkmax); |
165 | VARx(int, checkmax) |
| 78 | VARx(int, checkcnt); |
166 | VARx(int, checkcnt) |
| 79 | |
167 | |
| 80 | VAR (childs, struct ev_child *childs [PID_HASHSIZE]); |
168 | #if EV_FORK_ENABLE || EV_GENWRAP |
| 81 | VARx(struct ev_signal, childev); |
169 | VARx(struct ev_fork **, forks) |
|
|
170 | VARx(int, forkmax) |
|
|
171 | VARx(int, forkcnt) |
|
|
172 | #endif |
| 82 | |
173 | |
| 83 | VARx(struct ev_io, sigev); |
174 | #if EV_CLEANUP_ENABLE || EV_GENWRAP |
|
|
175 | VARx(struct ev_cleanup **, cleanups) |
|
|
176 | VARx(int, cleanupmax) |
|
|
177 | VARx(int, cleanupcnt) |
|
|
178 | #endif |
|
|
179 | |
|
|
180 | #if EV_ASYNC_ENABLE || EV_GENWRAP |
|
|
181 | VARx(EV_ATOMIC_T, async_pending) |
|
|
182 | VARx(struct ev_async **, asyncs) |
|
|
183 | VARx(int, asyncmax) |
|
|
184 | VARx(int, asynccnt) |
|
|
185 | #endif |
|
|
186 | |
|
|
187 | #if EV_USE_INOTIFY || EV_GENWRAP |
|
|
188 | VARx(int, fs_fd) |
|
|
189 | VARx(ev_io, fs_w) |
|
|
190 | VARx(char, fs_2625) /* whether we are running in linux 2.6.25 or newer */ |
|
|
191 | VAR (fs_hash, ANFS fs_hash [EV_INOTIFY_HASHSIZE]) |
|
|
192 | #endif |
|
|
193 | |
|
|
194 | VARx(EV_ATOMIC_T, sig_pending) |
|
|
195 | #if EV_USE_SIGNALFD || EV_GENWRAP |
|
|
196 | VARx(int, sigfd) |
|
|
197 | VARx(ev_io, sigfd_w) |
|
|
198 | VARx(sigset_t, sigfd_set) |
|
|
199 | #endif |
|
|
200 | |
|
|
201 | VARx(unsigned int, origflags) /* original loop flags */ |
|
|
202 | |
|
|
203 | #if EV_FEATURE_API || EV_GENWRAP |
|
|
204 | VARx(unsigned int, loop_count) /* total number of loop iterations/blocks */ |
|
|
205 | VARx(unsigned int, loop_depth) /* #ev_run enters - #ev_run leaves */ |
|
|
206 | |
|
|
207 | VARx(void *, userdata) |
|
|
208 | /* C++ doesn't support the ev_loop_callback typedef here. stinks. */ |
|
|
209 | VAR (release_cb, void (*release_cb)(EV_P) EV_NOEXCEPT) |
|
|
210 | VAR (acquire_cb, void (*acquire_cb)(EV_P) EV_NOEXCEPT) |
|
|
211 | VAR (invoke_cb , ev_loop_callback invoke_cb) |
|
|
212 | #endif |
| 84 | |
213 | |
| 85 | #undef VARx |
214 | #undef VARx |
| 86 | |
215 | |
