ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/cfperl.h
(Generate patch)

Comparing deliantra/server/include/cfperl.h (file contents):
Revision 1.89 by root, Tue Sep 4 05:43:21 2007 UTC vs.
Revision 1.121 by root, Thu Apr 15 03:34:30 2010 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 5 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 6 * Deliantra is free software: you can redistribute it and/or modify it under
9 * it under the terms of the GNU General Public License as published by 7 * the terms of the Affero GNU General Public License as published by the
10 * the Free Software Foundation, either version 3 of the License, or 8 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 9 * option) any later version.
12 * 10 *
13 * This program is distributed in the hope that it will be useful, 11 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details. 14 * GNU General Public License for more details.
17 * 15 *
18 * You should have received a copy of the GNU General Public License 16 * You should have received a copy of the Affero GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>.
20 * 19 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 20 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 21 */
23 22
24// 23//
25// cfperl.h perl interface 24// cfperl.h perl interface
26// 25//
27#ifndef CFPERL_H__ 26#ifndef CFPERL_H__
28#define CFPERL_H__ 27#define CFPERL_H__
29 28
30#include <cstdarg>
31#include <cstdio>
32#include <bitset>
33
34using namespace std; 29using namespace std;
35 30
36#include <EXTERN.h> 31#include <EXTERN.h>
37#include <perl.h> 32#include <perl.h>
38#include <XSUB.h> 33#include <XSUB.h>
39 34
40#include <EventAPI.h> 35#include <EVAPI.h>
41#include <CoroAPI.h> 36#include <CoroAPI.h>
42 37
43#include "util.h" 38#include "util.h"
44#include "keyword.h" 39#include "keyword.h"
45#include "dynbuf.h" 40#include "dynbuf.h"
… …
50// optimisations/workaround for functions requiring my_perl in scope (anti-bloat) 45// optimisations/workaround for functions requiring my_perl in scope (anti-bloat)
51#undef localtime 46#undef localtime
52#undef srand48 47#undef srand48
53#undef drand48 48#undef drand48
54#undef srandom 49#undef srandom
50#undef opendir
55#undef readdir 51#undef readdir
52#undef closedir
56#undef getprotobyname 53#undef getprotobyname
57#undef gethostbyname 54#undef gethostbyname
58#undef ctime 55#undef ctime
59#undef strerror 56#undef strerror
60#undef _ 57#undef _
… …
79 76
80// some macros to simplify perl in-calls 77// some macros to simplify perl in-calls
81 78
82#define CHECK_ERROR \ 79#define CHECK_ERROR \
83 if (SvTRUE (ERRSV)) \ 80 if (SvTRUE (ERRSV)) \
84 LOG (llevError, "runtime error in %s: %s\n", __func__, SvPVutf8_nolen (ERRSV)); 81 LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV));
85 82
83inline int call_pvsv (const char *ob, I32 flags) { return call_pv (ob, flags); }
84inline int call_pvsv (SV *ob, I32 flags) { return call_sv (ob, flags); }
85
86// TODO: temporarily enabled pushstack/popstack for all calls from the core, to maybe fix object memleak?
87#define CALL_PUSH PUSHSTACKi (PERLSI_UNKNOWN)
88#define CALL_POP PUTBACK; POPSTACK; SPAGAIN
86#define CALL_BEGIN(args) dSP; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) 89#define CALL_BEGIN(args) dSP; CALL_PUSH; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args)
87#define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc 90#define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc
88#define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) 91#define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr)))
89#define CALL_CALL(name, flags) PUTBACK; int count = call_pv (name, (flags) | G_EVAL); SPAGAIN; 92#define CALL_CALL(name, flags) PUTBACK; int count = call_pvsv (name, (flags) | G_EVAL); SPAGAIN;
90#define CALL_END CHECK_ERROR; FREETMPS; LEAVE 93#define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE; CALL_POP
91 94
92////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 95//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
93 96
94void cfperl_init (); 97void cfperl_init ();
95void cfperl_main (); 98void cfperl_main ();
99void cfperl_tick ();
96void cfperl_emergency_save (); 100void cfperl_emergency_save ();
97void cfperl_cleanup (int make_core); 101void cfperl_cleanup (int make_core);
98void cfperl_make_book (object *book, int level); 102void cfperl_make_book (object *book, int level);
99void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); 103void cfperl_send_msg (client *ns, int color, const_utf8_string type, const_utf8_string msg);
100int cfperl_can_merge (object *ob1, object *ob2); 104int cfperl_can_merge (object *ob1, object *ob2);
105void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0);
101 106
107bool is_match_expr (const_utf8_string expr);
108// applies the match expression and returns true if it matches
109bool match (const_utf8_string expr, object *ob, object *self = 0, object *source = 0, object *originator = 0);
110// same as above, but returns the first object found, or 0
111object *match_one (const_utf8_string expr, object *ob, object *self = 0, object *source = 0, object *originator = 0);
112
102////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 113//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
114
115#if IVSIZE >= 8
116 typedef IV val64;
117 typedef IV uval64;
118# define newSVval64 newSViv
119# define SvVAL64 SvIV
120# define newSVuval64 newSVuv
121# define SvUVAL64 SvUV
122#else
123 typedef double val64;
124 typedef double uval64;
125# define newSVval64 newSVnv
126# define SvVAL64 SvNV
127# define newSVuval64 newSVnv
128# define SvUVAL64 SvNV
129#endif
103 130
104extern tstamp runtime; // virtual server time, excluding time jumps and lag 131extern tstamp runtime; // virtual server time, excluding time jumps and lag
105extern tstamp NOW; // real time of current server tick 132extern tstamp NOW; // real time of current server tick
106 133
107enum event_klass 134enum event_klass
… …
164INTERFACE_CLASS (attachable) 191INTERFACE_CLASS (attachable)
165struct attachable : refcnt_base 192struct attachable : refcnt_base
166{ 193{
167 static MGVTBL vtbl; 194 static MGVTBL vtbl;
168 195
169 static unordered_vector<attachable *> mortals;
170 MTH static void check_mortals ();
171
172 enum { 196 enum {
173 F_DESTROYED = 0x01, 197 F_DESTROYED = 0x01,
174 F_DEBUG_TRACE = 0x02, 198 F_DEBUG_TRACE = 0x02,
175 }; 199 };
176 int ACC (RW, flags); 200 uint8 ACC (RW, attachable_flags);
201
202 static unordered_vector<attachable *> mortals;
203 MTH static void check_mortals ();
177 204
178 // object is delete'd after the refcount reaches 0 205 // object is delete'd after the refcount reaches 0
179 MTH int refcnt_cnt () const; 206 MTH int refcnt_cnt () const;
180 // check wether the object has died and destroy 207 // check wether the object has died and destroy
181 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } 208 MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); }
… …
184 // this politely asks everybody interested the reduce 211 // this politely asks everybody interested the reduce
185 // the refcount to 0 as soon as possible. 212 // the refcount to 0 as soon as possible.
186 MTH void destroy (); 213 MTH void destroy ();
187 214
188 // return wether an object was destroyed already 215 // return wether an object was destroyed already
189 MTH bool destroyed () const { return flags & F_DESTROYED; } 216 MTH bool destroyed () const { return attachable_flags & F_DESTROYED; }
217
218 // destruct and free the memory for this object
219 virtual void do_delete ();
190 220
191 virtual void gather_callbacks (AV *&callbacks, event_type event) const; 221 virtual void gather_callbacks (AV *&callbacks, event_type event) const;
192 222
193#if 0 223#if 0
194private: 224private:
… …
202 232
203 void sever_self (); // sever this object from its self, if it has one. 233 void sever_self (); // sever this object from its self, if it has one.
204 void optimise (); // possibly save some memory by destroying unneeded data 234 void optimise (); // possibly save some memory by destroying unneeded data
205 235
206 attachable () 236 attachable ()
207 : flags (0), self (0), cb (0), attach (0) 237 : attachable_flags (0), self (0), cb (0), attach (0)
208 { 238 {
209 } 239 }
210 240
211 attachable (const attachable &src) 241 attachable (const attachable &src)
212 : flags (0), self (0), cb (0), attach (src.attach) 242 : attachable_flags (0), self (0), cb (0), attach (src.attach)
213 { 243 {
214 } 244 }
215 245
216 // set a custom key to the given value, or delete it if value = 0 246 // set a custom key to the given value, or delete it if value = 0
217 void set_key (const char *key, const char *value = 0, bool is_utf8 = 0); 247 void set_key (const_utf8_string key, const_utf8_string value = 0, bool is_utf8 = 0);
218 248
219 void set_key_text (const char *key, const char *value = 0) 249 void set_key_text (const_utf8_string key, const_utf8_string value = 0)
220 { 250 {
221 set_key (key, value, 1); 251 set_key (key, value, 1);
222 } 252 }
223 253
224 void set_key_data (const char *key, const char *value = 0) 254 void set_key_data (const_utf8_string key, const_utf8_string value = 0)
225 { 255 {
226 set_key (key, value, 0); 256 set_key (key, value, 0);
227 } 257 }
228 258
229 attachable &operator =(const attachable &src); 259 attachable &operator =(const attachable &src);
230 260
231 // used to _quickly_ device wether to shortcut the evaluation 261 // used to _quickly_ decide wether to shortcut the evaluation
232 bool should_invoke (event_type event) 262 bool should_invoke (event_type event)
233 { 263 {
234 return ev_want_event [event] || cb; 264 return ev_want_event [event] || cb;
235 } 265 }
236 266
… …
258 288
259extern struct global gbl_ev; 289extern struct global gbl_ev;
260 290
261////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 291//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
262 292
293// a little dirty hack, maybe unify with something else at a later time
294// it is used to communicate as much info about the keyword string
295// to the consuemr as possible, for maximum performance.
296struct keyword_string
297{
298 const char *s;
299 const int l;
300
301 keyword_string (const char *s, int l)
302 : s(s), l(l)
303 { }
304
305 keyword_string (keyword kw)
306 : s(keyword_str [kw]), l(keyword_len [kw])
307 {
308 }
309
310 keyword_string (shstr_tmp sh)
311 : s(&sh), l(sh.length ())
312 {
313 }
314};
315
316#define CS(keyword) keyword_string (# keyword, sizeof (# keyword) - 1)
317#define KW(keyword) CS(keyword)
318
263INTERFACE_CLASS(object_freezer) 319INTERFACE_CLASS(object_freezer)
264struct object_freezer : dynbuf_text 320struct object_freezer : dynbuf_text
265{ 321{
266 AV *av; 322 AV *av;
267 323
268 object_freezer (); 324 object_freezer ();
269 ~object_freezer (); 325 ~object_freezer ();
270 326
327 // serialise perl part
271 void put (attachable *ext); 328 void put_ (attachable *ext);
272 329 void put (attachable *ext)
273 // used only for user-defined key-value pairs
274 void put (const shstr &k, const shstr &v)
275 { 330 {
276 add (k); 331 if (expect_false (ext->self))
332 put_ (ext);
333 }
277 334
335 // null value (== no space after keyword)
336 void put (const keyword_string k)
337 {
338 char *p = force (k.l + 1);
339 memcpy (p, k.s, k.l); p += k.l; *p++ = '\n';
340 alloc (p);
341 }
342
343 void put (const keyword_string k, const keyword_string v)
344 {
345 char *p = force (k.l + 1 + v.l + 1);
346 memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
347 memcpy (p, v.s, v.l); p += v.l; *p++ = '\n';
348 alloc (p);
349 }
350
351 void put (const keyword_string k, const_utf8_string v)
352 {
278 if (expect_true (v)) 353 if (expect_true (v))
279 add (' '), add (v); 354 put (k, keyword_string (v, strlen (v)));
280 355 else
281 add ('\n'); 356 put (k);
282 } 357 }
283 358
284 template<typename T> 359 void put (const keyword_string k, shstr_tmp v)
285 void put_kw_string (keyword k, const T &v)
286 { 360 {
287 int klen = keyword_len [k]; 361 put (k, keyword_string (v));
288 int vlen = v ? strlen (v) + 1 : 0;
289
290 char *p = (char *)alloc (klen + vlen + 1);
291
292 memcpy (p, keyword_str [k], klen); p += klen;
293
294 if (expect_true (v))
295 {
296 *p++ = ' '; vlen--;
297 memcpy (p, v, vlen); p += vlen;
298 }
299
300 *p = '\n';
301 } 362 }
302 363
303 void put (keyword k, const char *v = 0)
304 {
305 put_kw_string (k, v);
306 }
307
308 void put (keyword k, const shstr &v)
309 {
310 put_kw_string (k, v);
311 }
312
313 void put (keyword k, double v) 364 void put (const keyword_string k, double v)
314 { 365 {
315 force (MAX_KEYWORD_LEN + 2 + 32); 366 char *p = force (MAX_KEYWORD_LEN + 2 + 32);
316 fadd (keyword_str [k], keyword_len [k]); 367 memcpy (p, k.s, k.l); p += k.l; *p++ = ' ';
317 fadd (' '); 368 p += sprintf (p, "%.7g", v); *p++ = '\n';
318 falloc (sprintf (ptr, "%.7g", v)); 369 alloc (p);
319 fadd ('\n');
320 } 370 }
321 371
322 void put_(keyword k, sint64 v) 372 void put_(const keyword_string k, sint64 v)
323 { 373 {
324 force (MAX_KEYWORD_LEN + 2 + sint64_digits); 374 force (MAX_KEYWORD_LEN + 2 + sint64_digits);
325 fadd (keyword_str [k], keyword_len [k]); 375 fadd (k.s, k.l);
326 fadd (' '); 376 fadd (' ');
327 add (v); 377 add (v);
328 fadd ('\n'); 378 fadd ('\n');
329 } 379 }
330 380
331 void put_(keyword k, sint32 v) 381 void put_(const keyword_string k, sint32 v)
332 { 382 {
333 force (MAX_KEYWORD_LEN + 2 + sint32_digits); 383 force (MAX_KEYWORD_LEN + 2 + sint32_digits);
334 fadd (keyword_str [k], keyword_len [k]); 384 fadd (k.s, k.l);
335 fadd (' '); 385 fadd (' ');
336 add (v); 386 add (v);
337 fadd ('\n'); 387 fadd ('\n');
338 } 388 }
339 389
340 void put (keyword k, float v) { put (k, (double)v); } 390 void put (const keyword_string k, float v) { put (k, (double)v); }
341 void put (keyword k, signed char v) { put_(k, (sint32)v); } 391 void put (const keyword_string k, signed char v) { put_(k, (sint32)v); }
342 void put (keyword k, unsigned char v) { put_(k, (sint32)v); } 392 void put (const keyword_string k, unsigned char v) { put_(k, (sint32)v); }
343 void put (keyword k, signed short v) { put_(k, (sint32)v); } 393 void put (const keyword_string k, signed short v) { put_(k, (sint32)v); }
344 void put (keyword k, unsigned short v) { put_(k, (sint32)v); } 394 void put (const keyword_string k, unsigned short v) { put_(k, (sint32)v); }
345 void put (keyword k, signed int v) { put_(k, (sint32)v); } 395 void put (const keyword_string k, signed int v) { put_(k, (sint32)v); }
346 void put (keyword k, unsigned int v) { put_(k, (sint64)v); } 396 void put (const keyword_string k, unsigned int v) { put_(k, (sint64)v); }
347 void put (keyword k, signed long v) { put_(k, (sint64)v); } 397 void put (const keyword_string k, signed long v) { put_(k, (sint64)v); }
348 void put (keyword k, unsigned long v) { put_(k, (sint64)v); } 398 void put (const keyword_string k, unsigned long v) { put_(k, (sint64)v); }
349 void put (keyword k, signed long long v) { put_(k, (sint64)v); } 399 void put (const keyword_string k, signed long long v) { put_(k, (sint64)v); }
350 void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } 400 void put (const keyword_string k, unsigned long long v) { put_(k, (sint64)v); }
351 401
352 void put (keyword kbeg, keyword kend, const shstr &v) 402 void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v)
353 { 403 {
354 force (MAX_KEYWORD_LEN + 1); 404 force (MAX_KEYWORD_LEN + 1);
355 fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); 405 fadd (kbeg.s, kbeg.l); fadd ('\n');
356 406
357 if (expect_true (v)) 407 if (expect_true (v))
358 { 408 {
359 add (v); 409 add (v);
360 add ('\n'); 410 add ('\n');
361 } 411 }
362 412
363 force (MAX_KEYWORD_LEN + 1); 413 force (MAX_KEYWORD_LEN + 1);
364 fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); 414 fadd (kend.s, kend.l); fadd ('\n');
365 } 415 }
366 416
367 void put (keyword k, archetype *v); 417 void put (const keyword_string k, archetype *v);
368 void put (keyword k, treasurelist *v); 418 void put (const keyword_string k, treasurelist *v);
369 void put (keyword k, faceinfo *v); 419 void put (const keyword_string k, faceinfo *v);
370 420
371 template<typename T> 421 template<typename T>
372 void put (keyword k, const refptr<T> &v) 422 void put (const keyword_string k, const refptr<T> &v)
373 { 423 {
374 put (k, (T *)v); 424 put (k, (T *)v);
375 } 425 }
376 426
377 MTH bool save (const_octet_string path); 427 MTH bool save (const_octet_string path);
378 char *as_string (); // like strdup 428 utf8_string as_string (); // like strdup
379 429
380 operator bool () { return !!av; } 430 operator bool () { return !!av; }
381}; 431};
382 432
383INTERFACE_CLASS(object_thawer) 433INTERFACE_CLASS(object_thawer)
… …
388 AV *av; // perl part 438 AV *av; // perl part
389 int linenum; 439 int linenum;
390 keyword kw; 440 keyword kw;
391 char *kw_str; // the keyword parsed, as string 441 char *kw_str; // the keyword parsed, as string
392 char *value; // the value, or 0 if no value 442 char *value; // the value, or 0 if no value
393 char *value_nn; // the value, or the empty string if no value 443 const char *value_nn; // the value, or the empty string if no value
394 const char *name; 444 const char *name;
395 445
396 operator bool () const { return !!text; } 446 operator bool () const { return !!text; }
397 447
398 object_thawer (const char *path = 0); 448 object_thawer (const_utf8_string path = 0);
399 object_thawer (const char *data, AV *perlav); 449 object_thawer (const_utf8_string data, AV *perlav);
400 ~object_thawer (); 450 ~object_thawer ();
401 451
402 void get (attachable *obj, int oid); 452 void get (attachable *obj, int oid);
403 453
404 // parse next line 454 // parse next line
… …
406 // skip the current key-value (usually fetch next line, for 456 // skip the current key-value (usually fetch next line, for
407 // multiline-fields, skips till the corresponding end-kw 457 // multiline-fields, skips till the corresponding end-kw
408 MTH void skip (); 458 MTH void skip ();
409 MTH void skip_block (); // skips till and over KW_end 459 MTH void skip_block (); // skips till and over KW_end
410 460
411 char *get_str () { return value; } // may be 0 461 bool has_value () { return value; }
462 const_utf8_string get_str () { return value_nn; } // empty string when missing
412 void get_ml (keyword kend, shstr &sh); 463 void get_ml (keyword kend, shstr &sh);
413 464
414 void get_ornull (shstr &sh) const { sh = value; } 465 void get_ornull (shstr &sh) const { sh = value; }
415 void get (shstr &sh) const { sh = value; } // might want to check for non-null here 466 void get (shstr &sh) const { sh = value; } // might want to check for non-null here
416 467
… …
430 void get (sint32 &i) { i = get_sint32 (); } 481 void get (sint32 &i) { i = get_sint32 (); }
431 482
432 void get (uint32 &i) { i = get_sint64 (); } 483 void get (uint32 &i) { i = get_sint64 (); }
433 void get (sint64 &i) { i = get_sint64 (); } 484 void get (sint64 &i) { i = get_sint64 (); }
434 485
435 MTH void parse_warn (const char *msg); 486 MTH void parse_warn (const_utf8_string msg);
436 MTH bool parse_error (const char *type = 0, const char *name = 0, bool skip = true); 487 MTH bool parse_error (const_utf8_string type = 0, const_utf8_string name = 0, bool skip = true);
437 488
438 struct delayed_ref { 489 struct delayed_ref {
439 attachable *op; 490 attachable *op;
440 object_ptr *ptr; 491 object_ptr *ptr;
441 const char *ref; 492 const_utf8_string ref;
442 }; 493 };
443 std::vector<delayed_ref> delrefs; 494 std::vector<delayed_ref> delrefs;
444 495
445 void delayed_deref (attachable *op, object_ptr &ptr, const char *ref); 496 void delayed_deref (attachable *op, object_ptr &ptr, const_utf8_string ref);
446 MTH void resolve_delayed_derefs (bool deref = true); 497 MTH void resolve_delayed_derefs (bool deref = true);
447}; 498};
448 499
449//TODO: remove 500//TODO: remove
450char *fgets (char *s, int n, object_thawer &thawer); 501char *fgets (char *s, int n, object_thawer &thawer);
… …
452////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 503//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
453 504
454struct coroapi { 505struct coroapi {
455 static struct CoroAPI *GCoroAPI; 506 static struct CoroAPI *GCoroAPI;
456 507
508 static EV_ATOMIC_T cede_pending;
509
457 static int nready () { return CORO_NREADY; } 510 static int nready () { return CORO_NREADY; }
458 static int cede () { return CORO_CEDE ; } 511 static int cede () { cede_pending = 0; return CORO_CEDE ; }
459 512
460 static tstamp next_cede;
461 static int cede_counter;
462
463 static void do_cede_every ();
464 static void do_cede_to_tick (); 513 static void do_cede_to_tick ();
465 static void do_cede_to_tick_every ();
466 514
467 static void cede_every (int count) 515 // actually cede's far more often
468 {
469 if (expect_false (++cede_counter >= count))
470 do_cede_every ();
471 }
472
473 static bool cede_to_tick () 516 static bool cede_to_tick ()
474 { 517 {
475 if (expect_true (now () < next_cede)) 518 if (expect_true (!cede_pending))
476 return false; 519 return false;
477 520
478 do_cede_to_tick (); 521 do_cede_to_tick ();
479 return true; 522 return true;
480 } 523 }
481 524
482 static bool cede_to_tick_every (int count)
483 {
484 if (expect_true (++cede_counter < count))
485 return false;
486
487 return cede_to_tick ();
488 }
489
490 static void wait_for_tick (); 525 static void wait_for_tick ();
491 static void wait_for_tick_begin (); 526 static void wait_for_tick_begin ();
492}; 527};
493 528
494struct watcher_base 529struct evapi
495{ 530{
496 static struct EventAPI *GEventAPI; 531 static struct EVAPI *GEVAPI;
497}; 532};
498 533
499template<class base>
500struct watcher : watcher_base
501{
502 base *pe;
503
504 void start (bool repeat = false) { GEventAPI->start ((pe_watcher *)pe, repeat); }
505 void stop (bool cancel_events = false) { GEventAPI->stop ((pe_watcher *)pe, cancel_events); }
506 void now () { GEventAPI->now ((pe_watcher *)pe); }
507 void suspend () { GEventAPI->suspend ((pe_watcher *)pe); }
508 void resume () { GEventAPI->resume ((pe_watcher *)pe); }
509
510 void prio (int new_prio) { ((pe_watcher *)pe)->prio = new_prio; }
511
512 ~watcher ()
513 {
514 cancel ();
515 }
516
517private:
518 void cancel () { GEventAPI->cancel ((pe_watcher *)pe); } // private
519};
520
521struct iw : watcher<pe_idle>, callback<void (iw &)>
522{
523 template<class O, class M>
524 iw (O object, M method)
525 : callback<void (iw &)> (object, method)
526 {
527 alloc ();
528 }
529
530private:
531 void alloc ();
532};
533
534struct iow : watcher<pe_io>, callback<void (iow &, int)> 534struct iow : ev_io, evapi, callback<void (iow &, int)>
535{ 535{
536 static void thunk (EV_P_ struct ev_io *w_, int revents)
537 {
538 iow &w = *static_cast<iow *>(w_);
539
540 w (w, revents);
541 }
542
536 template<class O, class M> 543 template<class O, class M>
537 iow (O object, M method) 544 iow (O object, M method)
538 : callback<void (iow &, int)> (object, method) 545 : callback<void (iow &, int)> (object, method)
539 { 546 {
540 alloc (); 547 ev_init ((ev_io *)this, thunk);
541 } 548 }
542 549
543 void fd (int fd); 550 void prio (int prio)
544 int poll (); 551 {
552 ev_set_priority ((ev_io *)this, prio);
553 }
554
555 void set (int fd, int events)
556 {
557 ev_io_set ((ev_io *)this, fd, events);
558 }
559
560 int poll () const { return events; }
561
545 void poll (int events); 562 void poll (int events);
546 563
547private: 564 void start ()
548 void alloc (); 565 {
566 ev_io_start (EV_DEFAULT, (ev_io *)this);
567 }
568
569 void stop ()
570 {
571 ev_io_stop (EV_DEFAULT, (ev_io *)this);
572 }
573
574 ~iow ()
575 {
576 stop ();
577 }
578};
579
580struct asyncw : ev_async, evapi, callback<void (ev_async &, int)>
581{
582 static void thunk (EV_P_ struct ev_async *w_, int revents)
583 {
584 asyncw &w = *static_cast<asyncw *>(w_);
585
586 w (w, revents);
587 }
588
589 template<class O, class M>
590 asyncw (O object, M method)
591 : callback<void (asyncw &, int)> (object, method)
592 {
593 ev_init ((ev_async *)this, thunk);
594 }
595
596 void start ()
597 {
598 ev_async_start (EV_DEFAULT, (ev_async *)this);
599 }
600
601 void stop ()
602 {
603 ev_async_stop (EV_DEFAULT, (ev_async *)this);
604 }
605
606 ~asyncw ()
607 {
608 stop ();
609 }
549}; 610};
550 611
551#endif 612#endif
552 613

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines