|
|
1 | /* |
|
|
2 | * loop member variable declarations |
|
|
3 | * |
|
|
4 | * Copyright (c) 2007 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, ev_rt_now) |
|
|
6 | VARx(ev_tstamp, rtmn_diff) /* difference realtime - monotonic time */ |
44 | VARx(ev_tstamp, rtmn_diff) /* difference realtime - monotonic time */ |
7 | VARx(int, method) |
|
|
8 | |
45 | |
|
|
46 | VARx(ev_tstamp, io_blocktime) |
|
|
47 | VARx(ev_tstamp, timeout_blocktime) |
|
|
48 | |
|
|
49 | VARx(int, backend) |
|
|
50 | VARx(int, activecnt) /* total number of active events ("refcount") */ |
|
|
51 | VARx(unsigned int, loop_count) /* total number of loop iterations/blocks */ |
|
|
52 | |
|
|
53 | VARx(int, backend_fd) |
9 | VARx(ev_tstamp, method_fudge) /* assumed typical timer resolution */ |
54 | VARx(ev_tstamp, backend_fudge) /* assumed typical timer resolution */ |
10 | VAR (method_modify, void (*method_modify)(EV_P_ int fd, int oev, int nev)) |
55 | VAR (backend_modify, void (*backend_modify)(EV_P_ int fd, int oev, int nev)) |
11 | VAR (method_poll , void (*method_poll)(EV_P_ ev_tstamp timeout)) |
56 | VAR (backend_poll , void (*backend_poll)(EV_P_ ev_tstamp timeout)) |
|
|
57 | |
|
|
58 | #if !defined(_WIN32) || EV_GENWRAP |
|
|
59 | VARx(pid_t, curpid) |
|
|
60 | #endif |
12 | |
61 | |
13 | VARx(int, postfork) /* true if we need to recreate kernel state after fork */ |
62 | VARx(int, postfork) /* true if we need to recreate kernel state after fork */ |
14 | VARx(int, activecnt) /* number of active events */ |
|
|
15 | |
63 | |
16 | #if EV_USE_SELECT || EV_GENWRAP |
64 | #if EV_USE_SELECT || EV_GENWRAP |
17 | VARx(unsigned char *, vec_ri) |
65 | VARx(void *, vec_ri) |
18 | VARx(unsigned char *, vec_ro) |
66 | VARx(void *, vec_ro) |
19 | VARx(unsigned char *, vec_wi) |
67 | VARx(void *, vec_wi) |
20 | VARx(unsigned char *, vec_wo) |
68 | VARx(void *, vec_wo) |
21 | VARx(int, vec_max) |
69 | VARx(int, vec_max) |
22 | #endif |
70 | #endif |
23 | |
71 | |
24 | #if EV_USE_POLL || EV_GENWRAP |
72 | #if EV_USE_POLL || EV_GENWRAP |
25 | VARx(struct pollfd *, polls) |
73 | VARx(struct pollfd *, polls) |
… | |
… | |
28 | VARx(int *, pollidxs) /* maps fds into structure indices */ |
76 | VARx(int *, pollidxs) /* maps fds into structure indices */ |
29 | VARx(int, pollidxmax) |
77 | VARx(int, pollidxmax) |
30 | #endif |
78 | #endif |
31 | |
79 | |
32 | #if EV_USE_EPOLL || EV_GENWRAP |
80 | #if EV_USE_EPOLL || EV_GENWRAP |
33 | VARx(int, epoll_fd) |
|
|
34 | |
|
|
35 | VARx(struct epoll_event *, epoll_events) |
81 | VARx(struct epoll_event *, epoll_events) |
36 | VARx(int, epoll_eventmax) |
82 | VARx(int, epoll_eventmax) |
37 | #endif |
83 | #endif |
38 | |
84 | |
39 | #if EV_USE_KQUEUE || EV_GENWRAP |
85 | #if EV_USE_KQUEUE || EV_GENWRAP |
40 | VARx(int, kqueue_fd) |
|
|
41 | VARx(struct kevent *, kqueue_changes) |
86 | VARx(struct kevent *, kqueue_changes) |
42 | VARx(int, kqueue_changemax) |
87 | VARx(int, kqueue_changemax) |
43 | VARx(int, kqueue_changecnt) |
88 | VARx(int, kqueue_changecnt) |
44 | VARx(struct kevent *, kqueue_events) |
89 | VARx(struct kevent *, kqueue_events) |
45 | VARx(int, kqueue_eventmax) |
90 | VARx(int, kqueue_eventmax) |
|
|
91 | #endif |
|
|
92 | |
|
|
93 | #if EV_USE_PORT || EV_GENWRAP |
|
|
94 | VARx(struct port_event *, port_events) |
|
|
95 | VARx(int, port_eventmax) |
46 | #endif |
96 | #endif |
47 | |
97 | |
48 | VARx(ANFD *, anfds) |
98 | VARx(ANFD *, anfds) |
49 | VARx(int, anfdmax) |
99 | VARx(int, anfdmax) |
50 | |
100 | |
… | |
… | |
54 | |
104 | |
55 | VARx(int *, fdchanges) |
105 | VARx(int *, fdchanges) |
56 | VARx(int, fdchangemax) |
106 | VARx(int, fdchangemax) |
57 | VARx(int, fdchangecnt) |
107 | VARx(int, fdchangecnt) |
58 | |
108 | |
59 | VARx(struct ev_timer **, timers) |
109 | VARx(WT *, timers) |
60 | VARx(int, timermax) |
110 | VARx(int, timermax) |
61 | VARx(int, timercnt) |
111 | VARx(int, timercnt) |
62 | |
112 | |
63 | VARx(struct ev_periodic **, periodics) |
113 | #if EV_PERIODIC_ENABLE || EV_GENWRAP |
|
|
114 | VARx(WT *, periodics) |
64 | VARx(int, periodicmax) |
115 | VARx(int, periodicmax) |
65 | VARx(int, periodiccnt) |
116 | VARx(int, periodiccnt) |
|
|
117 | #endif |
66 | |
118 | |
67 | VARx(struct ev_idle **, idles) |
119 | #if EV_IDLE_ENABLE || EV_GENWRAP |
68 | VARx(int, idlemax) |
120 | VAR (idles, ev_idle **idles [NUMPRI]) |
69 | VARx(int, idlecnt) |
121 | VAR (idlemax, int idlemax [NUMPRI]) |
|
|
122 | VAR (idlecnt, int idlecnt [NUMPRI]) |
|
|
123 | #endif |
|
|
124 | VARx(int, idleall) /* total number */ |
70 | |
125 | |
71 | VARx(struct ev_prepare **, prepares) |
126 | VARx(struct ev_prepare **, prepares) |
72 | VARx(int, preparemax) |
127 | VARx(int, preparemax) |
73 | VARx(int, preparecnt) |
128 | VARx(int, preparecnt) |
74 | |
129 | |
75 | VARx(struct ev_check **, checks) |
130 | VARx(struct ev_check **, checks) |
76 | VARx(int, checkmax) |
131 | VARx(int, checkmax) |
77 | VARx(int, checkcnt) |
132 | VARx(int, checkcnt) |
78 | |
133 | |
|
|
134 | #if EV_FORK_ENABLE || EV_GENWRAP |
|
|
135 | VARx(struct ev_fork **, forks) |
|
|
136 | VARx(int, forkmax) |
|
|
137 | VARx(int, forkcnt) |
|
|
138 | #endif |
|
|
139 | |
|
|
140 | #if EV_USE_INOTIFY || EV_GENWRAP |
|
|
141 | VARx(int, fs_fd) |
|
|
142 | VARx(ev_io, fs_w) |
|
|
143 | VAR (fs_hash, ANFS fs_hash [EV_INOTIFY_HASHSIZE]) |
|
|
144 | #endif |
|
|
145 | |
79 | #undef VARx |
146 | #undef VARx |
80 | |
147 | |