1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
|
|
4 | * Copyright (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
6 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * the terms of the Affero GNU General Public License as published by the |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * option) any later version. |
10 | * option) any later version. |
10 | * |
11 | * |
11 | * This program is distributed in the hope that it will be useful, |
12 | * This program is distributed in the hope that it will be useful, |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. |
15 | * GNU General Public License for more details. |
15 | * |
16 | * |
16 | * You should have received a copy of the Affero GNU General Public License |
17 | * You should have received a copy of the Affero GNU General Public License |
17 | * and the GNU General Public License along with this program. If not, see |
18 | * and the GNU General Public License along with this program. If not, see |
18 | * <http://www.gnu.org/licenses/>. |
19 | * <http://www.gnu.org/licenses/>. |
19 | * |
20 | * |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | */ |
22 | */ |
22 | |
23 | |
23 | // |
24 | // |
24 | // cfperl.h perl interface |
25 | // cfperl.h perl interface |
… | |
… | |
101 | void cfperl_cleanup (int make_core); |
102 | void cfperl_cleanup (int make_core); |
102 | void cfperl_make_book (object *book, int level); |
103 | void cfperl_make_book (object *book, int level); |
103 | void cfperl_send_msg (client *ns, int color, const_utf8_string type, const_utf8_string msg); |
104 | void cfperl_send_msg (client *ns, int color, const_utf8_string type, const_utf8_string msg); |
104 | int cfperl_can_merge (object *ob1, object *ob2); |
105 | int cfperl_can_merge (object *ob1, object *ob2); |
105 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
106 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
|
|
107 | void cfperl_ix (client *ns, int set, faceidx idx, int pri); |
106 | |
108 | |
107 | bool is_match_expr (const_utf8_string expr); |
109 | bool is_match_expr (const_utf8_string expr); |
108 | // applies the match expression and returns true if it matches |
110 | // applies the match expression and returns true if it matches |
109 | bool match (const_utf8_string expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
111 | bool 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 |
112 | // same as above, but returns the first object found, or 0 |
… | |
… | |
129 | #endif |
131 | #endif |
130 | |
132 | |
131 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
133 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
132 | extern tstamp NOW; // real time of current server tick |
134 | extern tstamp NOW; // real time of current server tick |
133 | |
135 | |
|
|
136 | ecb_noinline utf8_string cfSvPVutf8_nolen (SV *sv); |
|
|
137 | |
134 | enum event_klass |
138 | enum event_klass |
135 | { |
139 | { |
136 | KLASS_NONE, |
140 | KLASS_NONE, |
137 | KLASS_GLOBAL, |
141 | KLASS_GLOBAL, |
138 | KLASS_ATTACHABLE, |
142 | KLASS_ATTACHABLE, |
… | |
… | |
168 | #define ARG_CLIENT(o) DT_CLIENT, (void *)(static_cast<client *> (o)) |
172 | #define ARG_CLIENT(o) DT_CLIENT, (void *)(static_cast<client *> (o)) |
169 | #define ARG_PARTY(o) DT_PARTY , (void *)(static_cast<party *> (o)) |
173 | #define ARG_PARTY(o) DT_PARTY , (void *)(static_cast<party *> (o)) |
170 | #define ARG_REGION(o) DT_REGION, (void *)(static_cast<region *> (o)) |
174 | #define ARG_REGION(o) DT_REGION, (void *)(static_cast<region *> (o)) |
171 | |
175 | |
172 | // the ", ## __VA_ARGS" is, unfortunately, a gnu-cpp extension |
176 | // the ", ## __VA_ARGS" is, unfortunately, a gnu-cpp extension |
173 | #define INVOKE(obj,event, ...) (expect_false ((obj)->should_invoke (event)) ? (obj)->invoke (event, ## __VA_ARGS__, DT_END) : 0) |
177 | #define INVOKE(obj,event, ...) (ecb_expect_false ((obj)->should_invoke (event)) ? (obj)->invoke (event, ## __VA_ARGS__, DT_END) : 0) |
174 | #define INVOKE_GLOBAL(event, ...) INVOKE (&gbl_ev, EVENT_ ## GLOBAL ## _ ## event, ## __VA_ARGS__) |
178 | #define INVOKE_GLOBAL(event, ...) INVOKE (&gbl_ev, EVENT_ ## GLOBAL ## _ ## event, ## __VA_ARGS__) |
175 | #define INVOKE_ATTACHABLE(event, obj, ...) INVOKE (obj , EVENT_ ## ATTACHABLE ## _ ## event, ## __VA_ARGS__) |
179 | #define INVOKE_ATTACHABLE(event, obj, ...) INVOKE (obj , EVENT_ ## ATTACHABLE ## _ ## event, ## __VA_ARGS__) |
176 | #define INVOKE_OBJECT(event, obj, ...) INVOKE (obj , EVENT_ ## OBJECT ## _ ## event, ## __VA_ARGS__) |
180 | #define INVOKE_OBJECT(event, obj, ...) INVOKE (obj , EVENT_ ## OBJECT ## _ ## event, ## __VA_ARGS__) |
177 | #define INVOKE_CLIENT(event, obj, ...) INVOKE (obj , EVENT_ ## CLIENT ## _ ## event, ## __VA_ARGS__) |
181 | #define INVOKE_CLIENT(event, obj, ...) INVOKE (obj , EVENT_ ## CLIENT ## _ ## event, ## __VA_ARGS__) |
178 | #define INVOKE_PLAYER(event, obj, ...) INVOKE (obj , EVENT_ ## PLAYER ## _ ## event, ## __VA_ARGS__) |
182 | #define INVOKE_PLAYER(event, obj, ...) INVOKE (obj , EVENT_ ## PLAYER ## _ ## event, ## __VA_ARGS__) |
… | |
… | |
203 | MTH static void check_mortals (); |
207 | MTH static void check_mortals (); |
204 | |
208 | |
205 | // object is delete'd after the refcount reaches 0 |
209 | // object is delete'd after the refcount reaches 0 |
206 | MTH int refcnt_cnt () const; |
210 | MTH int refcnt_cnt () const; |
207 | // check wether the object has died and destroy |
211 | // check wether the object has died and destroy |
208 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
212 | MTH void refcnt_chk () { if (ecb_expect_false (refcnt <= 0)) do_check (); } |
209 | |
213 | |
210 | // destroy the object unless it was already destroyed |
214 | // destroy the object unless it was already destroyed |
211 | // this politely asks everybody interested the reduce |
215 | // this politely asks everybody interested the reduce |
212 | // the refcount to 0 as soon as possible. |
216 | // the refcount to 0 as soon as possible. |
213 | MTH void destroy (); |
217 | MTH void destroy (); |
… | |
… | |
288 | |
292 | |
289 | extern struct global gbl_ev; |
293 | extern struct global gbl_ev; |
290 | |
294 | |
291 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
295 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
292 | |
296 | |
293 | // a little dirty hack, maybe unify with something else at a later time |
297 | #include "freezethaw.h" |
294 | struct keyword_string |
|
|
295 | { |
|
|
296 | const char *s; |
|
|
297 | const int l; |
|
|
298 | |
|
|
299 | keyword_string (const char *s, int l) |
|
|
300 | : s(s), l(l) |
|
|
301 | { } |
|
|
302 | |
|
|
303 | keyword_string (keyword kw) |
|
|
304 | : s(keyword_str [kw]), l(keyword_len [kw]) |
|
|
305 | { |
|
|
306 | } |
|
|
307 | |
|
|
308 | keyword_string (shstr_tmp sh) |
|
|
309 | : s(&sh), l(sh.length ()) |
|
|
310 | { |
|
|
311 | } |
|
|
312 | }; |
|
|
313 | |
|
|
314 | #define CS(keyword) keyword_string (# keyword, sizeof (# keyword) - 1) |
|
|
315 | #define KW(keyword) CS(keyword) |
|
|
316 | |
|
|
317 | INTERFACE_CLASS(object_freezer) |
|
|
318 | struct object_freezer : dynbuf_text |
|
|
319 | { |
|
|
320 | AV *av; |
|
|
321 | |
|
|
322 | object_freezer (); |
|
|
323 | ~object_freezer (); |
|
|
324 | |
|
|
325 | // serialise perl part |
|
|
326 | void put_ (attachable *ext); |
|
|
327 | void put (attachable *ext) |
|
|
328 | { |
|
|
329 | if (expect_false (ext->self)) |
|
|
330 | put_ (ext); |
|
|
331 | } |
|
|
332 | |
|
|
333 | // null value (== no space after keyword) |
|
|
334 | void put (const keyword_string k) |
|
|
335 | { |
|
|
336 | char *p = force (k.l + 1); |
|
|
337 | memcpy (p, k.s, k.l); p += k.l; *p++ = '\n'; |
|
|
338 | alloc (p); |
|
|
339 | } |
|
|
340 | |
|
|
341 | void put (const keyword_string k, const keyword_string v) |
|
|
342 | { |
|
|
343 | char *p = force (k.l + 1 + v.l + 1); |
|
|
344 | memcpy (p, k.s, k.l); p += k.l; *p++ = ' '; |
|
|
345 | memcpy (p, v.s, v.l); p += v.l; *p++ = '\n'; |
|
|
346 | alloc (p); |
|
|
347 | } |
|
|
348 | |
|
|
349 | void put (const keyword_string k, const_utf8_string v) |
|
|
350 | { |
|
|
351 | if (expect_true (v)) |
|
|
352 | put (k, keyword_string (v, strlen (v))); |
|
|
353 | else |
|
|
354 | put (k); |
|
|
355 | } |
|
|
356 | |
|
|
357 | void put (const keyword_string k, shstr_tmp v) |
|
|
358 | { |
|
|
359 | put (k, keyword_string (v)); |
|
|
360 | } |
|
|
361 | |
|
|
362 | void put (const keyword_string k, double v) |
|
|
363 | { |
|
|
364 | char *p = force (MAX_KEYWORD_LEN + 2 + 32); |
|
|
365 | memcpy (p, k.s, k.l); p += k.l; *p++ = ' '; |
|
|
366 | p += sprintf (p, "%.7g", v); *p++ = '\n'; |
|
|
367 | alloc (p); |
|
|
368 | } |
|
|
369 | |
|
|
370 | void put_(const keyword_string k, sint64 v) |
|
|
371 | { |
|
|
372 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
|
|
373 | fadd (k.s, k.l); |
|
|
374 | fadd (' '); |
|
|
375 | add (v); |
|
|
376 | fadd ('\n'); |
|
|
377 | } |
|
|
378 | |
|
|
379 | void put_(const keyword_string k, sint32 v) |
|
|
380 | { |
|
|
381 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
|
|
382 | fadd (k.s, k.l); |
|
|
383 | fadd (' '); |
|
|
384 | add (v); |
|
|
385 | fadd ('\n'); |
|
|
386 | } |
|
|
387 | |
|
|
388 | void put (const keyword_string k, float v) { put (k, (double)v); } |
|
|
389 | void put (const keyword_string k, signed char v) { put_(k, (sint32)v); } |
|
|
390 | void put (const keyword_string k, unsigned char v) { put_(k, (sint32)v); } |
|
|
391 | void put (const keyword_string k, signed short v) { put_(k, (sint32)v); } |
|
|
392 | void put (const keyword_string k, unsigned short v) { put_(k, (sint32)v); } |
|
|
393 | void put (const keyword_string k, signed int v) { put_(k, (sint32)v); } |
|
|
394 | void put (const keyword_string k, unsigned int v) { put_(k, (sint64)v); } |
|
|
395 | void put (const keyword_string k, signed long v) { put_(k, (sint64)v); } |
|
|
396 | void put (const keyword_string k, unsigned long v) { put_(k, (sint64)v); } |
|
|
397 | void put (const keyword_string k, signed long long v) { put_(k, (sint64)v); } |
|
|
398 | void put (const keyword_string k, unsigned long long v) { put_(k, (sint64)v); } |
|
|
399 | |
|
|
400 | void put (const keyword_string kbeg, const keyword_string kend, shstr_tmp v) |
|
|
401 | { |
|
|
402 | force (MAX_KEYWORD_LEN + 1); |
|
|
403 | fadd (kbeg.s, kbeg.l); fadd ('\n'); |
|
|
404 | |
|
|
405 | if (expect_true (v)) |
|
|
406 | { |
|
|
407 | add (v); |
|
|
408 | add ('\n'); |
|
|
409 | } |
|
|
410 | |
|
|
411 | force (MAX_KEYWORD_LEN + 1); |
|
|
412 | fadd (kend.s, kend.l); fadd ('\n'); |
|
|
413 | } |
|
|
414 | |
|
|
415 | void put (const keyword_string k, archetype *v); |
|
|
416 | void put (const keyword_string k, treasurelist *v); |
|
|
417 | void put (const keyword_string k, faceinfo *v); |
|
|
418 | |
|
|
419 | template<typename T> |
|
|
420 | void put (const keyword_string k, const refptr<T> &v) |
|
|
421 | { |
|
|
422 | put (k, (T *)v); |
|
|
423 | } |
|
|
424 | |
|
|
425 | MTH bool save (const_octet_string path); |
|
|
426 | utf8_string as_string (); // like strdup |
|
|
427 | |
|
|
428 | operator bool () { return !!av; } |
|
|
429 | }; |
|
|
430 | |
|
|
431 | INTERFACE_CLASS(object_thawer) |
|
|
432 | struct object_thawer |
|
|
433 | { |
|
|
434 | char *line; // current beginning of line |
|
|
435 | SV *text; // text part |
|
|
436 | AV *av; // perl part |
|
|
437 | int linenum; |
|
|
438 | keyword kw; |
|
|
439 | char *kw_str; // the keyword parsed, as string |
|
|
440 | char *value; // the value, or 0 if no value |
|
|
441 | const char *value_nn; // the value, or the empty string if no value |
|
|
442 | const char *name; |
|
|
443 | |
|
|
444 | operator bool () const { return !!text; } |
|
|
445 | |
|
|
446 | object_thawer (const_utf8_string path = 0); |
|
|
447 | object_thawer (const_utf8_string data, AV *perlav); |
|
|
448 | ~object_thawer (); |
|
|
449 | |
|
|
450 | void get (attachable *obj, int oid); |
|
|
451 | |
|
|
452 | // parse next line |
|
|
453 | MTH void next (); |
|
|
454 | // skip the current key-value (usually fetch next line, for |
|
|
455 | // multiline-fields, skips till the corresponding end-kw |
|
|
456 | MTH void skip (); |
|
|
457 | MTH void skip_block (); // skips till and over KW_end |
|
|
458 | |
|
|
459 | bool has_value () { return value; } |
|
|
460 | const_utf8_string get_str () { return value_nn; } // empty string when missing |
|
|
461 | void get_ml (keyword kend, shstr &sh); |
|
|
462 | |
|
|
463 | void get_ornull (shstr &sh) const { sh = value; } |
|
|
464 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
|
|
465 | |
|
|
466 | bool get_bool () const { return *value_nn == '1'; } |
|
|
467 | sint32 get_sint32 () const; |
|
|
468 | sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); } |
|
|
469 | double get_double () const { return strtod (value_nn, 0); } |
|
|
470 | |
|
|
471 | void get (float &v) { v = get_double (); } |
|
|
472 | void get (double &v) { v = get_double (); } |
|
|
473 | |
|
|
474 | void get (bool &i) { i = get_bool (); } |
|
|
475 | void get (sint8 &i) { i = get_sint32 (); } |
|
|
476 | void get (uint8 &i) { i = get_sint32 (); } |
|
|
477 | void get (sint16 &i) { i = get_sint32 (); } |
|
|
478 | void get (uint16 &i) { i = get_sint32 (); } |
|
|
479 | void get (sint32 &i) { i = get_sint32 (); } |
|
|
480 | |
|
|
481 | void get (uint32 &i) { i = get_sint64 (); } |
|
|
482 | void get (sint64 &i) { i = get_sint64 (); } |
|
|
483 | |
|
|
484 | MTH void parse_warn (const_utf8_string msg); |
|
|
485 | MTH bool parse_error (const_utf8_string type = 0, const_utf8_string name = 0, bool skip = true); |
|
|
486 | |
|
|
487 | struct delayed_ref { |
|
|
488 | attachable *op; |
|
|
489 | object_ptr *ptr; |
|
|
490 | const_utf8_string ref; |
|
|
491 | }; |
|
|
492 | std::vector<delayed_ref> delrefs; |
|
|
493 | |
|
|
494 | void delayed_deref (attachable *op, object_ptr &ptr, const_utf8_string ref); |
|
|
495 | MTH void resolve_delayed_derefs (bool deref = true); |
|
|
496 | }; |
|
|
497 | |
|
|
498 | //TODO: remove |
|
|
499 | char *fgets (char *s, int n, object_thawer &thawer); |
|
|
500 | |
298 | |
501 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
299 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
502 | |
300 | |
503 | struct coroapi { |
301 | struct coroapi { |
504 | static struct CoroAPI *GCoroAPI; |
302 | static struct CoroAPI *GCoroAPI; |
… | |
… | |
511 | static void do_cede_to_tick (); |
309 | static void do_cede_to_tick (); |
512 | |
310 | |
513 | // actually cede's far more often |
311 | // actually cede's far more often |
514 | static bool cede_to_tick () |
312 | static bool cede_to_tick () |
515 | { |
313 | { |
516 | if (expect_true (!cede_pending)) |
314 | if (ecb_expect_true (!cede_pending)) |
517 | return false; |
315 | return false; |
518 | |
316 | |
519 | do_cede_to_tick (); |
317 | do_cede_to_tick (); |
520 | return true; |
318 | return true; |
521 | } |
319 | } |