|
|
1 | /* |
|
|
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
|
|
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
|
|
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
|
|
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
|
|
7 | * |
|
|
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
|
|
9 | * under the terms of the GNU General Public License as published by the Free |
|
|
10 | * Software Foundation; either version 2 of the License, or (at your option) |
|
|
11 | * any later version. |
|
|
12 | * |
|
|
13 | * This program is distributed in the hope that it will be useful, but |
|
|
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
|
|
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 | * for more details. |
|
|
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License along |
|
|
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
|
|
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
|
|
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
|
|
23 | */ |
|
|
24 | |
1 | // |
25 | // |
2 | // cfperl.h perl interface |
26 | // cfperl.h perl interface |
3 | // |
27 | // |
4 | #ifndef CFPERL_H__ |
28 | #ifndef CFPERL_H__ |
5 | #define CFPERL_H__ |
29 | #define CFPERL_H__ |
6 | |
30 | |
|
|
31 | #include <cstdarg> |
7 | #include <cstdio> |
32 | #include <cstdio> |
|
|
33 | #include <bitset> |
8 | |
34 | |
9 | using namespace std; |
35 | using namespace std; |
10 | |
36 | |
11 | #include <EXTERN.h> |
37 | #include <EXTERN.h> |
12 | #include <perl.h> |
38 | #include <perl.h> |
… | |
… | |
62 | |
88 | |
63 | void cfperl_init (); |
89 | void cfperl_init (); |
64 | void cfperl_main (); |
90 | void cfperl_main (); |
65 | void cfperl_emergency_save (); |
91 | void cfperl_emergency_save (); |
66 | void cfperl_cleanup (int make_core); |
92 | void cfperl_cleanup (int make_core); |
|
|
93 | void cfperl_make_book (object *book, int level); |
|
|
94 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
67 | |
95 | |
68 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
96 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
69 | |
97 | |
70 | // virtual server time, excluding time jumps and lag |
98 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
71 | extern double runtime; |
99 | extern tstamp NOW; // real time of current server tick |
72 | |
100 | |
73 | enum event_klass |
101 | enum event_klass |
74 | { |
102 | { |
75 | KLASS_NONE, |
103 | KLASS_NONE, |
76 | KLASS_GLOBAL, |
104 | KLASS_GLOBAL, |
… | |
… | |
87 | # define def(klass,name) EVENT_ ## klass ## _ ## name, |
115 | # define def(klass,name) EVENT_ ## klass ## _ ## name, |
88 | # include "eventinc.h" |
116 | # include "eventinc.h" |
89 | # undef def |
117 | # undef def |
90 | NUM_EVENT_TYPES |
118 | NUM_EVENT_TYPES |
91 | }; |
119 | }; |
|
|
120 | |
|
|
121 | // in which global events or per-type events are we interested |
|
|
122 | extern bitset<NUM_EVENT_TYPES> ev_want_event; |
|
|
123 | extern bitset<NUM_TYPES> ev_want_type; |
92 | |
124 | |
93 | #define ARG_AV(o) DT_AV , static_cast<AV *> (o) |
125 | #define ARG_AV(o) DT_AV , static_cast<AV *> (o) |
94 | #define ARG_INT(v) DT_INT , static_cast<int> (v) |
126 | #define ARG_INT(v) DT_INT , static_cast<int> (v) |
95 | #define ARG_INT64(v) DT_INT64 , static_cast<sint64> (v) |
127 | #define ARG_INT64(v) DT_INT64 , static_cast<sint64> (v) |
96 | #define ARG_DOUBLE(v) DT_DOUBLE, static_cast<double> (v) |
128 | #define ARG_DOUBLE(v) DT_DOUBLE, static_cast<double> (v) |
… | |
… | |
103 | #define ARG_CLIENT(o) DT_CLIENT, (void *)(static_cast<client *> (o)) |
135 | #define ARG_CLIENT(o) DT_CLIENT, (void *)(static_cast<client *> (o)) |
104 | #define ARG_PARTY(o) DT_PARTY , (void *)(static_cast<party *> (o)) |
136 | #define ARG_PARTY(o) DT_PARTY , (void *)(static_cast<party *> (o)) |
105 | #define ARG_REGION(o) DT_REGION, (void *)(static_cast<region *> (o)) |
137 | #define ARG_REGION(o) DT_REGION, (void *)(static_cast<region *> (o)) |
106 | |
138 | |
107 | // the ", ## __VA_ARGS" is, unfortunately, a gnu-cpp extension |
139 | // the ", ## __VA_ARGS" is, unfortunately, a gnu-cpp extension |
108 | |
140 | #define INVOKE(obj,event, ...) (expect_false ((obj)->should_invoke (event)) ? (obj)->invoke (event, ## __VA_ARGS__, DT_END) : 0) |
109 | // all these return true when the normal event processing should be skipped (if any) |
|
|
110 | #define INVOKE_GLOBAL(event, ...) gbl_ev.invoke (EVENT_ ## GLOBAL ## _ ## event, ## __VA_ARGS__, DT_END) |
141 | #define INVOKE_GLOBAL(event, ...) INVOKE (&gbl_ev, EVENT_ ## GLOBAL ## _ ## event, ## __VA_ARGS__) |
111 | #define INVOKE_ATTACHABLE(event, obj, ...) (obj)->invoke (EVENT_ ## ATTACHABLE ## _ ## event, ## __VA_ARGS__, DT_END) |
142 | #define INVOKE_ATTACHABLE(event, obj, ...) INVOKE (obj , EVENT_ ## ATTACHABLE ## _ ## event, ## __VA_ARGS__) |
112 | #define INVOKE_OBJECT(event, obj, ...) (obj)->invoke (EVENT_ ## OBJECT ## _ ## event, ## __VA_ARGS__, DT_END) |
143 | #define INVOKE_OBJECT(event, obj, ...) INVOKE (obj , EVENT_ ## OBJECT ## _ ## event, ## __VA_ARGS__) |
113 | #define INVOKE_CLIENT(event, obj, ...) (obj)->invoke (EVENT_ ## CLIENT ## _ ## event, ## __VA_ARGS__, DT_END) |
144 | #define INVOKE_CLIENT(event, obj, ...) INVOKE (obj , EVENT_ ## CLIENT ## _ ## event, ## __VA_ARGS__) |
114 | #define INVOKE_PLAYER(event, obj, ...) (obj)->invoke (EVENT_ ## PLAYER ## _ ## event, ## __VA_ARGS__, DT_END) |
145 | #define INVOKE_PLAYER(event, obj, ...) INVOKE (obj , EVENT_ ## PLAYER ## _ ## event, ## __VA_ARGS__) |
115 | #define INVOKE_MAP(event, obj, ...) (obj)->invoke (EVENT_ ## MAP ## _ ## event, ## __VA_ARGS__, DT_END) |
146 | #define INVOKE_MAP(event, obj, ...) INVOKE (obj , EVENT_ ## MAP ## _ ## event, ## __VA_ARGS__) |
116 | |
147 | |
117 | //TODO should index into @result |
148 | //TODO should index into @result |
118 | #define RESULT(idx,type) cfperl_result_ ## type (idx) |
149 | #define RESULT(idx,type) cfperl_result_ ## type (idx) |
119 | #define RESULT_DOUBLE(idx) RESULT(idx, DOUBLE) |
150 | #define RESULT_DOUBLE(idx) RESULT(idx, DOUBLE) |
120 | #define RESULT_INT(idx) RESULT(idx, INT) |
151 | #define RESULT_INT(idx) RESULT(idx, INT) |
… | |
… | |
144 | MTH void refcnt_inc () const { ++refcnt; } |
175 | MTH void refcnt_inc () const { ++refcnt; } |
145 | MTH void refcnt_dec () const { --refcnt; } |
176 | MTH void refcnt_dec () const { --refcnt; } |
146 | |
177 | |
147 | MTH int refcnt_cnt () const; |
178 | MTH int refcnt_cnt () const; |
148 | // check wether the object has died and destroy |
179 | // check wether the object has died and destroy |
149 | MTH void refcnt_chk () { if (refcnt <= 0) do_check (); } |
180 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
150 | |
181 | |
151 | // destroy the object unless it was already destroyed |
182 | // destroy the object unless it was already destroyed |
152 | // this politely asks everybody interested the reduce |
183 | // this politely asks everybody interested the reduce |
153 | // the refcount to 0 as soon as possible. |
184 | // the refcount to 0 as soon as possible. |
154 | MTH void destroy (); |
185 | MTH void destroy (); |
… | |
… | |
183 | |
214 | |
184 | virtual ~attachable (); |
215 | virtual ~attachable (); |
185 | |
216 | |
186 | attachable &operator =(const attachable &src); |
217 | attachable &operator =(const attachable &src); |
187 | |
218 | |
|
|
219 | // used to _quickly_ device wether to shortcut the evaluation |
|
|
220 | bool should_invoke (event_type event) |
|
|
221 | { |
|
|
222 | return ev_want_event [event] || cb; |
|
|
223 | } |
|
|
224 | |
188 | bool invoke (event_type event, ...); |
225 | bool invoke (event_type event, ...); |
|
|
226 | |
189 | MTH void instantiate (); |
227 | MTH void instantiate (); |
190 | void reattach (); |
228 | void reattach (); |
191 | |
229 | |
192 | protected: |
230 | protected: |
193 | // do the real refcount checking work |
231 | // do the real refcount checking work |
… | |
… | |
205 | |
243 | |
206 | extern struct global gbl_ev; |
244 | extern struct global gbl_ev; |
207 | |
245 | |
208 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
246 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
209 | |
247 | |
210 | struct object_freezer : dynbuf |
248 | struct object_freezer : dynbuf_text |
211 | { |
249 | { |
212 | AV *av; |
250 | AV *av; |
213 | |
251 | |
214 | object_freezer (); |
252 | object_freezer (); |
215 | ~object_freezer (); |
253 | ~object_freezer (); |
… | |
… | |
219 | // used only for user-defined key-value pairs |
257 | // used only for user-defined key-value pairs |
220 | void put (const shstr &k, const shstr &v) |
258 | void put (const shstr &k, const shstr &v) |
221 | { |
259 | { |
222 | add (k); |
260 | add (k); |
223 | |
261 | |
224 | if (v) |
262 | if (expect_true (v)) |
225 | add (' '), add (v); |
263 | add (' '), add (v); |
226 | |
264 | |
227 | add ('\n'); |
265 | add ('\n'); |
228 | } |
266 | } |
229 | |
267 | |
230 | //TODO//temporary, used only for saving body locations |
|
|
231 | void put (const char *k, int v) |
|
|
232 | { |
|
|
233 | add (k); |
|
|
234 | add (' '); |
|
|
235 | add (sint32 (v)); |
|
|
236 | add ('\n'); |
|
|
237 | } |
|
|
238 | |
|
|
239 | template<typename T> |
268 | template<typename T> |
240 | void put_string (keyword k, const T &v) |
269 | void put_kw_string (keyword k, const T &v) |
241 | { |
270 | { |
242 | int klen = keyword_len [k]; |
271 | int klen = keyword_len [k]; |
243 | int vlen = v ? strlen (v) + 1 : 0; |
272 | int vlen = v ? strlen (v) + 1 : 0; |
244 | |
273 | |
245 | char *p = (char *)alloc (klen + vlen + 1); |
274 | char *p = (char *)alloc (klen + vlen + 1); |
246 | |
275 | |
247 | memcpy (p, keyword_str [k], klen); p += klen; |
276 | memcpy (p, keyword_str [k], klen); p += klen; |
248 | |
277 | |
249 | if (v) |
278 | if (expect_true (v)) |
250 | { |
279 | { |
251 | *p++ = ' '; vlen--; |
280 | *p++ = ' '; vlen--; |
252 | memcpy (p, v, vlen); p += vlen; |
281 | memcpy (p, v, vlen); p += vlen; |
253 | } |
282 | } |
254 | |
283 | |
255 | *p = '\n'; |
284 | *p = '\n'; |
256 | } |
285 | } |
257 | |
286 | |
258 | void put (keyword k, const char *v = 0) |
287 | void put (keyword k, const char *v = 0) |
259 | { |
288 | { |
260 | put_string (k, v); |
289 | put_kw_string (k, v); |
261 | } |
290 | } |
262 | |
291 | |
263 | void put (keyword k, const shstr &v) |
292 | void put (keyword k, const shstr &v) |
264 | { |
293 | { |
265 | put_string (k, v); |
294 | put_kw_string (k, v); |
266 | } |
295 | } |
267 | |
296 | |
268 | void put (keyword k, double v) |
297 | void put (keyword k, double v) |
269 | { |
298 | { |
270 | char buf [128]; |
299 | force (MAX_KEYWORD_LEN + 2 + 32); |
271 | |
300 | fadd (keyword_str [k], keyword_len [k]); |
272 | snprintf (buf, 128, "%.7g", v); |
301 | fadd (' '); |
273 | |
302 | falloc (sprintf (ptr, "%.7g", v)); |
274 | put (k, (const char *)buf); |
303 | fadd ('\n'); |
275 | } |
304 | } |
276 | |
305 | |
277 | void put_(keyword k, sint64 v) |
306 | void put_(keyword k, sint64 v) |
278 | { |
307 | { |
|
|
308 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
279 | add (keyword_str [k], keyword_len [k]); |
309 | fadd (keyword_str [k], keyword_len [k]); |
280 | add (' '); |
310 | fadd (' '); |
281 | add (v); |
311 | add (v); |
282 | add ('\n'); |
312 | fadd ('\n'); |
283 | } |
313 | } |
284 | |
314 | |
285 | void put_(keyword k, sint32 v) |
315 | void put_(keyword k, sint32 v) |
286 | { |
316 | { |
|
|
317 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
287 | add (keyword_str [k], keyword_len [k]); |
318 | fadd (keyword_str [k], keyword_len [k]); |
288 | add (' '); |
319 | fadd (' '); |
289 | add (v); |
320 | add (v); |
290 | add ('\n'); |
321 | fadd ('\n'); |
291 | } |
|
|
292 | |
|
|
293 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
294 | { |
|
|
295 | add (keyword_str [kbeg], keyword_len [kbeg]); add ('\n'); |
|
|
296 | |
|
|
297 | if (v) |
|
|
298 | { |
|
|
299 | add (v); |
|
|
300 | add ('\n'); |
|
|
301 | } |
|
|
302 | |
|
|
303 | add (keyword_str [kend], keyword_len [kend]); add ('\n'); |
|
|
304 | } |
322 | } |
305 | |
323 | |
306 | void put (keyword k, float v) { put (k, (double)v); } |
324 | void put (keyword k, float v) { put (k, (double)v); } |
307 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
325 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
308 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
326 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
… | |
… | |
313 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
331 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
314 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
332 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
315 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
333 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
316 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
334 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
317 | |
335 | |
318 | template<typename T> |
336 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
337 | { |
|
|
338 | force (MAX_KEYWORD_LEN + 1); |
|
|
339 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
340 | |
|
|
341 | if (expect_true (v)) |
|
|
342 | { |
|
|
343 | add (v); |
|
|
344 | add ('\n'); |
|
|
345 | } |
|
|
346 | |
|
|
347 | force (MAX_KEYWORD_LEN + 1); |
|
|
348 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
349 | } |
|
|
350 | |
|
|
351 | void put (keyword k, archetype *v); |
|
|
352 | void put (keyword k, treasurelist *v); |
319 | void put (keyword k, const T *v) |
353 | void put (keyword k, faceinfo *v); |
320 | { |
|
|
321 | if (v) |
|
|
322 | put (k, v->name); |
|
|
323 | else |
|
|
324 | put (k, (const char *)0); |
|
|
325 | } |
|
|
326 | |
354 | |
327 | template<typename T> |
355 | template<typename T> |
328 | void put (keyword k, const refptr<T> &v) |
356 | void put (keyword k, const refptr<T> &v) |
329 | { |
357 | { |
330 | put (k, (T *)v); |
358 | put (k, (T *)v); |
… | |
… | |
334 | char *as_string (); // like strdup |
362 | char *as_string (); // like strdup |
335 | |
363 | |
336 | operator bool () { return !!av; } |
364 | operator bool () { return !!av; } |
337 | }; |
365 | }; |
338 | |
366 | |
339 | // compatibility support, should be removed when no longer needed |
|
|
340 | void fprintf (object_freezer &freezer, const char *format, ...); |
|
|
341 | void fputs (const char *s, object_freezer &freezer); |
|
|
342 | |
|
|
343 | struct object_thawer |
367 | struct object_thawer |
344 | { |
368 | { |
|
|
369 | char *line; // current beginning of line |
345 | SV *text; // text part |
370 | SV *text; // text part |
346 | AV *av; // perl part |
371 | AV *av; // perl part |
347 | int linenum; |
372 | int linenum; |
348 | char *line; // current beginning of line |
|
|
349 | keyword kw; |
373 | keyword kw; |
350 | char *kw_str, *value; |
374 | char *kw_str; // the keyword parsed, as string |
|
|
375 | char *value; // the value, or 0 if no value |
|
|
376 | char *value_nn; // the value, or the empty string if no value |
351 | const char *name; |
377 | const char *name; |
352 | |
378 | |
353 | operator bool () { return !!text; } |
379 | operator bool () { return !!text; } |
354 | |
380 | |
355 | object_thawer (const char *path = 0); |
381 | object_thawer (const char *path = 0); |
… | |
… | |
359 | void get (attachable *obj, int oid); |
385 | void get (attachable *obj, int oid); |
360 | |
386 | |
361 | // parse next line |
387 | // parse next line |
362 | void next (); |
388 | void next (); |
363 | // skip the current key-value (usually fetch next line, for |
389 | // skip the current key-value (usually fetch next line, for |
364 | // multiline-fields, skips untilt he corresponding end-kw |
390 | // multiline-fields, skips till the corresponding end-kw |
365 | void skip (); |
391 | void skip (); |
366 | |
392 | |
367 | //TODO: remove, deprecated |
|
|
368 | keyword get_kv () |
|
|
369 | { |
|
|
370 | next (); |
|
|
371 | return kw; |
|
|
372 | } |
|
|
373 | |
|
|
374 | |
|
|
375 | char *get_str () { return value; } // may be 0 |
393 | char *get_str () { return value; } // may be 0 |
|
|
394 | void get_ml (keyword kend, shstr &sh); |
376 | |
395 | |
377 | void get (shstr &sh) const; |
|
|
378 | void get_ornull (shstr &sh) const { sh = value; } |
396 | void get_ornull (shstr &sh) const { sh = value; } |
379 | void get_ml (keyword kend, shstr &sh); |
397 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
380 | |
398 | |
|
|
399 | bool get_bool () const { return *value_nn == '1'; } |
381 | sint32 get_sint32 () const; |
400 | sint32 get_sint32 () const; |
382 | sint64 get_sint64 () const; |
401 | sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); } |
383 | double get_double () const; |
402 | double get_double () const { return strtod (value_nn, 0); } |
384 | |
403 | |
385 | void get (float &v) { v = get_double (); } |
404 | void get (float &v) { v = get_double (); } |
386 | void get (double &v) { v = get_double (); } |
405 | void get (double &v) { v = get_double (); } |
387 | |
406 | |
388 | void get (bool &i) { i = get_sint32 (); } |
407 | void get (bool &i) { i = get_bool (); } |
389 | void get (sint8 &i) { i = get_sint32 (); } |
408 | void get (sint8 &i) { i = get_sint32 (); } |
390 | void get (uint8 &i) { i = get_sint32 (); } |
409 | void get (uint8 &i) { i = get_sint32 (); } |
391 | void get (sint16 &i) { i = get_sint32 (); } |
410 | void get (sint16 &i) { i = get_sint32 (); } |
392 | void get (uint16 &i) { i = get_sint32 (); } |
411 | void get (uint16 &i) { i = get_sint32 (); } |
393 | void get (sint32 &i) { i = get_sint32 (); } |
412 | void get (sint32 &i) { i = get_sint32 (); } |
… | |
… | |
407 | static struct CoroAPI *GCoroAPI; |
426 | static struct CoroAPI *GCoroAPI; |
408 | |
427 | |
409 | static int nready () { return CORO_NREADY; } |
428 | static int nready () { return CORO_NREADY; } |
410 | static int cede () { return CORO_CEDE ; } |
429 | static int cede () { return CORO_CEDE ; } |
411 | |
430 | |
|
|
431 | static tstamp next_cede; |
412 | static int cede_counter; |
432 | static int cede_counter; |
413 | |
433 | |
|
|
434 | static void do_cede_every (); |
|
|
435 | static void do_cede_to_tick (); |
|
|
436 | static void do_cede_to_tick_every (); |
|
|
437 | |
414 | static void cede_every (int count) |
438 | static void cede_every (int count) |
415 | { |
439 | { |
416 | if (++cede_counter >= count) |
440 | if (expect_false (++cede_counter >= count)) |
417 | { |
441 | do_cede_every (); |
418 | cede_counter = 0; |
|
|
419 | |
|
|
420 | if (coroapi::nready ()) |
|
|
421 | coroapi::cede (); |
|
|
422 | } |
|
|
423 | } |
442 | } |
|
|
443 | |
|
|
444 | static bool cede_to_tick () |
|
|
445 | { |
|
|
446 | if (expect_true (now () < next_cede)) |
|
|
447 | return false; |
|
|
448 | |
|
|
449 | do_cede_to_tick (); |
|
|
450 | return true; |
|
|
451 | } |
|
|
452 | |
|
|
453 | static bool cede_to_tick_every (int count) |
|
|
454 | { |
|
|
455 | if (expect_true (++cede_counter < count)) |
|
|
456 | return false; |
|
|
457 | |
|
|
458 | return cede_to_tick (); |
|
|
459 | } |
|
|
460 | |
|
|
461 | static void wait_for_tick (); |
|
|
462 | static void wait_for_tick_begin (); |
424 | }; |
463 | }; |
425 | |
464 | |
426 | struct watcher_base |
465 | struct watcher_base |
427 | { |
466 | { |
428 | static struct EventAPI *GEventAPI; |
467 | static struct EventAPI *GEventAPI; |