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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 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 | * Deliantra 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 <support@deliantra.net> |
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 | |
|
|
34 | using namespace std; |
29 | using 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> |
… | |
… | |
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 _ |
… | |
… | |
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", __func__, SvPVutf8_nolen (ERRSV)); |
81 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
85 | |
82 | |
|
|
83 | inline int call_pvsv (const char *ob, I32 flags) { return call_pv (ob, flags); } |
|
|
84 | inline 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 | |
94 | void cfperl_init (); |
97 | void cfperl_init (); |
95 | void cfperl_main (); |
98 | void cfperl_main (); |
96 | void cfperl_tick (); |
99 | void cfperl_tick (); |
97 | void cfperl_emergency_save (); |
100 | void cfperl_emergency_save (); |
98 | void cfperl_cleanup (int make_core); |
101 | void cfperl_cleanup (int make_core); |
99 | void cfperl_make_book (object *book, int level); |
102 | void cfperl_make_book (object *book, int level); |
100 | void cfperl_expand_cfpod (player *pl, std::string &msg); |
|
|
101 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
103 | void cfperl_send_msg (client *ns, int color, const_utf8_string type, const_utf8_string msg); |
102 | int cfperl_can_merge (object *ob1, object *ob2); |
104 | int cfperl_can_merge (object *ob1, object *ob2); |
|
|
105 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
|
|
106 | |
|
|
107 | bool is_match_expr (const_utf8_string expr); |
|
|
108 | // 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); |
|
|
110 | // same as above, but returns the first object found, or 0 |
|
|
111 | object *match_one (const_utf8_string expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
103 | |
112 | |
104 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
113 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
105 | |
114 | |
106 | #if IVSIZE >= 8 |
115 | #if IVSIZE >= 8 |
107 | typedef IV val64; |
116 | typedef IV val64; |
… | |
… | |
120 | #endif |
129 | #endif |
121 | |
130 | |
122 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
131 | extern tstamp runtime; // virtual server time, excluding time jumps and lag |
123 | extern tstamp NOW; // real time of current server tick |
132 | extern tstamp NOW; // real time of current server tick |
124 | |
133 | |
|
|
134 | noinline utf8_string cfSvPVutf8_nolen (SV *sv); |
|
|
135 | |
125 | enum event_klass |
136 | enum event_klass |
126 | { |
137 | { |
127 | KLASS_NONE, |
138 | KLASS_NONE, |
128 | KLASS_GLOBAL, |
139 | KLASS_GLOBAL, |
129 | KLASS_ATTACHABLE, |
140 | KLASS_ATTACHABLE, |
… | |
… | |
182 | INTERFACE_CLASS (attachable) |
193 | INTERFACE_CLASS (attachable) |
183 | struct attachable : refcnt_base |
194 | struct attachable : refcnt_base |
184 | { |
195 | { |
185 | static MGVTBL vtbl; |
196 | static MGVTBL vtbl; |
186 | |
197 | |
187 | static unordered_vector<attachable *> mortals; |
|
|
188 | MTH static void check_mortals (); |
|
|
189 | |
|
|
190 | enum { |
198 | enum { |
191 | F_DESTROYED = 0x01, |
199 | F_DESTROYED = 0x01, |
192 | F_DEBUG_TRACE = 0x02, |
200 | F_DEBUG_TRACE = 0x02, |
193 | }; |
201 | }; |
194 | int ACC (RW, flags); |
202 | uint8 ACC (RW, attachable_flags); |
|
|
203 | |
|
|
204 | static unordered_vector<attachable *> mortals; |
|
|
205 | MTH static void check_mortals (); |
195 | |
206 | |
196 | // object is delete'd after the refcount reaches 0 |
207 | // object is delete'd after the refcount reaches 0 |
197 | MTH int refcnt_cnt () const; |
208 | MTH int refcnt_cnt () const; |
198 | // check wether the object has died and destroy |
209 | // check wether the object has died and destroy |
199 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
210 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
… | |
… | |
202 | // this politely asks everybody interested the reduce |
213 | // this politely asks everybody interested the reduce |
203 | // the refcount to 0 as soon as possible. |
214 | // the refcount to 0 as soon as possible. |
204 | MTH void destroy (); |
215 | MTH void destroy (); |
205 | |
216 | |
206 | // return wether an object was destroyed already |
217 | // return wether an object was destroyed already |
207 | MTH bool destroyed () const { return flags & F_DESTROYED; } |
218 | MTH bool destroyed () const { return attachable_flags & F_DESTROYED; } |
|
|
219 | |
|
|
220 | // destruct and free the memory for this object |
|
|
221 | virtual void do_delete (); |
208 | |
222 | |
209 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
223 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
210 | |
224 | |
211 | #if 0 |
225 | #if 0 |
212 | private: |
226 | private: |
… | |
… | |
220 | |
234 | |
221 | void sever_self (); // sever this object from its self, if it has one. |
235 | void sever_self (); // sever this object from its self, if it has one. |
222 | void optimise (); // possibly save some memory by destroying unneeded data |
236 | void optimise (); // possibly save some memory by destroying unneeded data |
223 | |
237 | |
224 | attachable () |
238 | attachable () |
225 | : flags (0), self (0), cb (0), attach (0) |
239 | : attachable_flags (0), self (0), cb (0), attach (0) |
226 | { |
240 | { |
227 | } |
241 | } |
228 | |
242 | |
229 | attachable (const attachable &src) |
243 | attachable (const attachable &src) |
230 | : flags (0), self (0), cb (0), attach (src.attach) |
244 | : attachable_flags (0), self (0), cb (0), attach (src.attach) |
231 | { |
245 | { |
232 | } |
246 | } |
233 | |
247 | |
234 | // set a custom key to the given value, or delete it if value = 0 |
248 | // set a custom key to the given value, or delete it if value = 0 |
235 | void set_key (const char *key, const char *value = 0, bool is_utf8 = 0); |
249 | void set_key (const_utf8_string key, const_utf8_string value = 0, bool is_utf8 = 0); |
236 | |
250 | |
237 | void set_key_text (const char *key, const char *value = 0) |
251 | void set_key_text (const_utf8_string key, const_utf8_string value = 0) |
238 | { |
252 | { |
239 | set_key (key, value, 1); |
253 | set_key (key, value, 1); |
240 | } |
254 | } |
241 | |
255 | |
242 | void set_key_data (const char *key, const char *value = 0) |
256 | void set_key_data (const_utf8_string key, const_utf8_string value = 0) |
243 | { |
257 | { |
244 | set_key (key, value, 0); |
258 | set_key (key, value, 0); |
245 | } |
259 | } |
246 | |
260 | |
247 | attachable &operator =(const attachable &src); |
261 | attachable &operator =(const attachable &src); |
248 | |
262 | |
249 | // used to _quickly_ device wether to shortcut the evaluation |
263 | // used to _quickly_ decide wether to shortcut the evaluation |
250 | bool should_invoke (event_type event) |
264 | bool should_invoke (event_type event) |
251 | { |
265 | { |
252 | return ev_want_event [event] || cb; |
266 | return ev_want_event [event] || cb; |
253 | } |
267 | } |
254 | |
268 | |
… | |
… | |
276 | |
290 | |
277 | extern struct global gbl_ev; |
291 | extern struct global gbl_ev; |
278 | |
292 | |
279 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
293 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
280 | |
294 | |
281 | INTERFACE_CLASS(object_freezer) |
295 | #include "freezethaw.h" |
282 | struct object_freezer : dynbuf_text |
|
|
283 | { |
|
|
284 | AV *av; |
|
|
285 | |
|
|
286 | object_freezer (); |
|
|
287 | ~object_freezer (); |
|
|
288 | |
|
|
289 | void put (attachable *ext); |
|
|
290 | |
|
|
291 | // used only for user-defined key-value pairs |
|
|
292 | void put (const shstr &k, const shstr &v) |
|
|
293 | { |
|
|
294 | add (k); |
|
|
295 | |
|
|
296 | if (expect_true (v)) |
|
|
297 | add (' '), add (v); |
|
|
298 | |
|
|
299 | add ('\n'); |
|
|
300 | } |
|
|
301 | |
|
|
302 | template<typename T> |
|
|
303 | void put_kw_string (keyword k, const T &v) |
|
|
304 | { |
|
|
305 | int klen = keyword_len [k]; |
|
|
306 | int vlen = v ? strlen (v) + 1 : 0; |
|
|
307 | |
|
|
308 | char *p = (char *)alloc (klen + vlen + 1); |
|
|
309 | |
|
|
310 | memcpy (p, keyword_str [k], klen); p += klen; |
|
|
311 | |
|
|
312 | if (expect_true (v)) |
|
|
313 | { |
|
|
314 | *p++ = ' '; vlen--; |
|
|
315 | memcpy (p, v, vlen); p += vlen; |
|
|
316 | } |
|
|
317 | |
|
|
318 | *p = '\n'; |
|
|
319 | } |
|
|
320 | |
|
|
321 | void put (keyword k, const char *v = 0) |
|
|
322 | { |
|
|
323 | put_kw_string (k, v); |
|
|
324 | } |
|
|
325 | |
|
|
326 | void put (keyword k, const shstr &v) |
|
|
327 | { |
|
|
328 | put_kw_string (k, v); |
|
|
329 | } |
|
|
330 | |
|
|
331 | void put (keyword k, double v) |
|
|
332 | { |
|
|
333 | force (MAX_KEYWORD_LEN + 2 + 32); |
|
|
334 | fadd (keyword_str [k], keyword_len [k]); |
|
|
335 | fadd (' '); |
|
|
336 | falloc (sprintf (ptr, "%.7g", v)); |
|
|
337 | fadd ('\n'); |
|
|
338 | } |
|
|
339 | |
|
|
340 | void put_(keyword k, sint64 v) |
|
|
341 | { |
|
|
342 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
|
|
343 | fadd (keyword_str [k], keyword_len [k]); |
|
|
344 | fadd (' '); |
|
|
345 | add (v); |
|
|
346 | fadd ('\n'); |
|
|
347 | } |
|
|
348 | |
|
|
349 | void put_(keyword k, sint32 v) |
|
|
350 | { |
|
|
351 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
|
|
352 | fadd (keyword_str [k], keyword_len [k]); |
|
|
353 | fadd (' '); |
|
|
354 | add (v); |
|
|
355 | fadd ('\n'); |
|
|
356 | } |
|
|
357 | |
|
|
358 | void put (keyword k, float v) { put (k, (double)v); } |
|
|
359 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
|
|
360 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
|
|
361 | void put (keyword k, signed short v) { put_(k, (sint32)v); } |
|
|
362 | void put (keyword k, unsigned short v) { put_(k, (sint32)v); } |
|
|
363 | void put (keyword k, signed int v) { put_(k, (sint32)v); } |
|
|
364 | void put (keyword k, unsigned int v) { put_(k, (sint64)v); } |
|
|
365 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
|
|
366 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
|
|
367 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
|
|
368 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
|
|
369 | |
|
|
370 | void put (keyword kbeg, keyword kend, const shstr &v) |
|
|
371 | { |
|
|
372 | force (MAX_KEYWORD_LEN + 1); |
|
|
373 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
374 | |
|
|
375 | if (expect_true (v)) |
|
|
376 | { |
|
|
377 | add (v); |
|
|
378 | add ('\n'); |
|
|
379 | } |
|
|
380 | |
|
|
381 | force (MAX_KEYWORD_LEN + 1); |
|
|
382 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
383 | } |
|
|
384 | |
|
|
385 | void put (keyword k, archetype *v); |
|
|
386 | void put (keyword k, treasurelist *v); |
|
|
387 | void put (keyword k, faceinfo *v); |
|
|
388 | |
|
|
389 | template<typename T> |
|
|
390 | void put (keyword k, const refptr<T> &v) |
|
|
391 | { |
|
|
392 | put (k, (T *)v); |
|
|
393 | } |
|
|
394 | |
|
|
395 | MTH bool save (const_octet_string path); |
|
|
396 | char *as_string (); // like strdup |
|
|
397 | |
|
|
398 | operator bool () { return !!av; } |
|
|
399 | }; |
|
|
400 | |
|
|
401 | INTERFACE_CLASS(object_thawer) |
|
|
402 | struct object_thawer |
|
|
403 | { |
|
|
404 | char *line; // current beginning of line |
|
|
405 | SV *text; // text part |
|
|
406 | AV *av; // perl part |
|
|
407 | int linenum; |
|
|
408 | keyword kw; |
|
|
409 | char *kw_str; // the keyword parsed, as string |
|
|
410 | char *value; // the value, or 0 if no value |
|
|
411 | const char *value_nn; // the value, or the empty string if no value |
|
|
412 | const char *name; |
|
|
413 | |
|
|
414 | operator bool () const { return !!text; } |
|
|
415 | |
|
|
416 | object_thawer (const char *path = 0); |
|
|
417 | object_thawer (const char *data, AV *perlav); |
|
|
418 | ~object_thawer (); |
|
|
419 | |
|
|
420 | void get (attachable *obj, int oid); |
|
|
421 | |
|
|
422 | // parse next line |
|
|
423 | MTH void next (); |
|
|
424 | // skip the current key-value (usually fetch next line, for |
|
|
425 | // multiline-fields, skips till the corresponding end-kw |
|
|
426 | MTH void skip (); |
|
|
427 | MTH void skip_block (); // skips till and over KW_end |
|
|
428 | |
|
|
429 | char *get_str () { return value; } // may be 0 |
|
|
430 | void get_ml (keyword kend, shstr &sh); |
|
|
431 | |
|
|
432 | void get_ornull (shstr &sh) const { sh = value; } |
|
|
433 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
|
|
434 | |
|
|
435 | bool get_bool () const { return *value_nn == '1'; } |
|
|
436 | sint32 get_sint32 () const; |
|
|
437 | sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); } |
|
|
438 | double get_double () const { return strtod (value_nn, 0); } |
|
|
439 | |
|
|
440 | void get (float &v) { v = get_double (); } |
|
|
441 | void get (double &v) { v = get_double (); } |
|
|
442 | |
|
|
443 | void get (bool &i) { i = get_bool (); } |
|
|
444 | void get (sint8 &i) { i = get_sint32 (); } |
|
|
445 | void get (uint8 &i) { i = get_sint32 (); } |
|
|
446 | void get (sint16 &i) { i = get_sint32 (); } |
|
|
447 | void get (uint16 &i) { i = get_sint32 (); } |
|
|
448 | void get (sint32 &i) { i = get_sint32 (); } |
|
|
449 | |
|
|
450 | void get (uint32 &i) { i = get_sint64 (); } |
|
|
451 | void get (sint64 &i) { i = get_sint64 (); } |
|
|
452 | |
|
|
453 | MTH void parse_warn (const char *msg); |
|
|
454 | MTH bool parse_error (const char *type = 0, const char *name = 0, bool skip = true); |
|
|
455 | |
|
|
456 | struct delayed_ref { |
|
|
457 | attachable *op; |
|
|
458 | object_ptr *ptr; |
|
|
459 | const char *ref; |
|
|
460 | }; |
|
|
461 | std::vector<delayed_ref> delrefs; |
|
|
462 | |
|
|
463 | void delayed_deref (attachable *op, object_ptr &ptr, const char *ref); |
|
|
464 | MTH void resolve_delayed_derefs (bool deref = true); |
|
|
465 | }; |
|
|
466 | |
|
|
467 | //TODO: remove |
|
|
468 | char *fgets (char *s, int n, object_thawer &thawer); |
|
|
469 | |
296 | |
470 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
297 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
471 | |
298 | |
472 | struct coroapi { |
299 | struct coroapi { |
473 | static struct CoroAPI *GCoroAPI; |
300 | static struct CoroAPI *GCoroAPI; |