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 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 | |
|
|
30 | #include <cstdarg> |
|
|
31 | #include <cstdio> |
|
|
32 | #include <bitset> |
|
|
33 | |
28 | |
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> |
… | |
… | |
86 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
81 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
87 | |
82 | |
88 | inline int call_pvsv (const char *ob, I32 flags) { return call_pv (ob, flags); } |
83 | inline int call_pvsv (const char *ob, I32 flags) { return call_pv (ob, flags); } |
89 | inline int call_pvsv (SV *ob, I32 flags) { return call_sv (ob, flags); } |
84 | inline int call_pvsv (SV *ob, I32 flags) { return call_sv (ob, flags); } |
90 | |
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 |
91 | #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) |
92 | #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 |
93 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
91 | #define CALL_ARG(expr) PUSHs (sv_2mortal (to_sv (expr))) |
94 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pvsv (name, (flags) | G_EVAL); SPAGAIN; |
92 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pvsv (name, (flags) | G_EVAL); SPAGAIN; |
95 | #define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE |
93 | #define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE; CALL_POP |
96 | |
94 | |
97 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
95 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
98 | |
96 | |
99 | void cfperl_init (); |
97 | void cfperl_init (); |
100 | void cfperl_main (); |
98 | void cfperl_main (); |
101 | void cfperl_tick (); |
99 | void cfperl_tick (); |
102 | void cfperl_emergency_save (); |
100 | void cfperl_emergency_save (); |
103 | void cfperl_cleanup (int make_core); |
101 | void cfperl_cleanup (int make_core); |
104 | void cfperl_make_book (object *book, int level); |
102 | void cfperl_make_book (object *book, int level); |
105 | 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); |
106 | int cfperl_can_merge (object *ob1, object *ob2); |
104 | int cfperl_can_merge (object *ob1, object *ob2); |
107 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
105 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
108 | |
106 | |
109 | bool is_match_expr (const char *expr); |
107 | bool is_match_expr (const_utf8_string expr); |
110 | /* applies the match expression and returns true if it matches */ |
108 | // applies the match expression and returns true if it matches |
111 | bool match (const char *expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
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); |
112 | |
112 | |
113 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
113 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
114 | |
114 | |
115 | #if IVSIZE >= 8 |
115 | #if IVSIZE >= 8 |
116 | typedef IV val64; |
116 | typedef IV val64; |
… | |
… | |
195 | |
195 | |
196 | enum { |
196 | enum { |
197 | F_DESTROYED = 0x01, |
197 | F_DESTROYED = 0x01, |
198 | F_DEBUG_TRACE = 0x02, |
198 | F_DEBUG_TRACE = 0x02, |
199 | }; |
199 | }; |
200 | uint8 ACC (RW, flags); |
200 | uint8 ACC (RW, attachable_flags); |
201 | |
201 | |
202 | static unordered_vector<attachable *> mortals; |
202 | static unordered_vector<attachable *> mortals; |
203 | MTH static void check_mortals (); |
203 | MTH static void check_mortals (); |
204 | |
204 | |
205 | // object is delete'd after the refcount reaches 0 |
205 | // object is delete'd after the refcount reaches 0 |
… | |
… | |
211 | // this politely asks everybody interested the reduce |
211 | // this politely asks everybody interested the reduce |
212 | // the refcount to 0 as soon as possible. |
212 | // the refcount to 0 as soon as possible. |
213 | MTH void destroy (); |
213 | MTH void destroy (); |
214 | |
214 | |
215 | // return wether an object was destroyed already |
215 | // return wether an object was destroyed already |
216 | 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 (); |
217 | |
220 | |
218 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
221 | virtual void gather_callbacks (AV *&callbacks, event_type event) const; |
219 | |
222 | |
220 | #if 0 |
223 | #if 0 |
221 | private: |
224 | private: |
… | |
… | |
229 | |
232 | |
230 | 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. |
231 | void optimise (); // possibly save some memory by destroying unneeded data |
234 | void optimise (); // possibly save some memory by destroying unneeded data |
232 | |
235 | |
233 | attachable () |
236 | attachable () |
234 | : flags (0), self (0), cb (0), attach (0) |
237 | : attachable_flags (0), self (0), cb (0), attach (0) |
235 | { |
238 | { |
236 | } |
239 | } |
237 | |
240 | |
238 | attachable (const attachable &src) |
241 | attachable (const attachable &src) |
239 | : flags (0), self (0), cb (0), attach (src.attach) |
242 | : attachable_flags (0), self (0), cb (0), attach (src.attach) |
240 | { |
243 | { |
241 | } |
244 | } |
242 | |
245 | |
243 | // 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 |
244 | 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); |
245 | |
248 | |
246 | 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) |
247 | { |
250 | { |
248 | set_key (key, value, 1); |
251 | set_key (key, value, 1); |
249 | } |
252 | } |
250 | |
253 | |
251 | 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) |
252 | { |
255 | { |
253 | set_key (key, value, 0); |
256 | set_key (key, value, 0); |
254 | } |
257 | } |
255 | |
258 | |
256 | attachable &operator =(const attachable &src); |
259 | attachable &operator =(const attachable &src); |
257 | |
260 | |
258 | // used to _quickly_ device wether to shortcut the evaluation |
261 | // used to _quickly_ decide wether to shortcut the evaluation |
259 | bool should_invoke (event_type event) |
262 | bool should_invoke (event_type event) |
260 | { |
263 | { |
261 | return ev_want_event [event] || cb; |
264 | return ev_want_event [event] || cb; |
262 | } |
265 | } |
263 | |
266 | |
… | |
… | |
285 | |
288 | |
286 | extern struct global gbl_ev; |
289 | extern struct global gbl_ev; |
287 | |
290 | |
288 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
291 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
289 | |
292 | |
290 | INTERFACE_CLASS(object_freezer) |
293 | #include "freezethaw.h" |
291 | struct object_freezer : dynbuf_text |
|
|
292 | { |
|
|
293 | AV *av; |
|
|
294 | |
|
|
295 | object_freezer (); |
|
|
296 | ~object_freezer (); |
|
|
297 | |
|
|
298 | void put (attachable *ext); |
|
|
299 | |
|
|
300 | // used only for user-defined key-value pairs |
|
|
301 | void put (shstr_tmp k, shstr_tmp v) |
|
|
302 | { |
|
|
303 | add (k); |
|
|
304 | |
|
|
305 | if (expect_true (v)) |
|
|
306 | add (' '), add (v); |
|
|
307 | |
|
|
308 | add ('\n'); |
|
|
309 | } |
|
|
310 | |
|
|
311 | template<typename T> |
|
|
312 | void put_kw_string (keyword k, const T &v) |
|
|
313 | { |
|
|
314 | int klen = keyword_len [k]; |
|
|
315 | int vlen = v ? strlen (v) + 1 : 0; |
|
|
316 | |
|
|
317 | char *p = (char *)alloc (klen + vlen + 1); |
|
|
318 | |
|
|
319 | memcpy (p, keyword_str [k], klen); p += klen; |
|
|
320 | |
|
|
321 | if (expect_true (v)) |
|
|
322 | { |
|
|
323 | *p++ = ' '; vlen--; |
|
|
324 | memcpy (p, v, vlen); p += vlen; |
|
|
325 | } |
|
|
326 | |
|
|
327 | *p = '\n'; |
|
|
328 | } |
|
|
329 | |
|
|
330 | void put (keyword k, const char *v = 0) |
|
|
331 | { |
|
|
332 | put_kw_string (k, v); |
|
|
333 | } |
|
|
334 | |
|
|
335 | void put (keyword k, shstr_tmp v) |
|
|
336 | { |
|
|
337 | put_kw_string (k, v); |
|
|
338 | } |
|
|
339 | |
|
|
340 | void put (keyword k, double v) |
|
|
341 | { |
|
|
342 | force (MAX_KEYWORD_LEN + 2 + 32); |
|
|
343 | fadd (keyword_str [k], keyword_len [k]); |
|
|
344 | fadd (' '); |
|
|
345 | falloc (sprintf (ptr, "%.7g", v)); |
|
|
346 | fadd ('\n'); |
|
|
347 | } |
|
|
348 | |
|
|
349 | void put_(keyword k, sint64 v) |
|
|
350 | { |
|
|
351 | force (MAX_KEYWORD_LEN + 2 + sint64_digits); |
|
|
352 | fadd (keyword_str [k], keyword_len [k]); |
|
|
353 | fadd (' '); |
|
|
354 | add (v); |
|
|
355 | fadd ('\n'); |
|
|
356 | } |
|
|
357 | |
|
|
358 | void put_(keyword k, sint32 v) |
|
|
359 | { |
|
|
360 | force (MAX_KEYWORD_LEN + 2 + sint32_digits); |
|
|
361 | fadd (keyword_str [k], keyword_len [k]); |
|
|
362 | fadd (' '); |
|
|
363 | add (v); |
|
|
364 | fadd ('\n'); |
|
|
365 | } |
|
|
366 | |
|
|
367 | void put (keyword k, float v) { put (k, (double)v); } |
|
|
368 | void put (keyword k, signed char v) { put_(k, (sint32)v); } |
|
|
369 | void put (keyword k, unsigned char v) { put_(k, (sint32)v); } |
|
|
370 | void put (keyword k, signed short v) { put_(k, (sint32)v); } |
|
|
371 | void put (keyword k, unsigned short v) { put_(k, (sint32)v); } |
|
|
372 | void put (keyword k, signed int v) { put_(k, (sint32)v); } |
|
|
373 | void put (keyword k, unsigned int v) { put_(k, (sint64)v); } |
|
|
374 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
|
|
375 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
|
|
376 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
|
|
377 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
|
|
378 | |
|
|
379 | void put (keyword kbeg, keyword kend, shstr_tmp v) |
|
|
380 | { |
|
|
381 | force (MAX_KEYWORD_LEN + 1); |
|
|
382 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
|
|
383 | |
|
|
384 | if (expect_true (v)) |
|
|
385 | { |
|
|
386 | add (v); |
|
|
387 | add ('\n'); |
|
|
388 | } |
|
|
389 | |
|
|
390 | force (MAX_KEYWORD_LEN + 1); |
|
|
391 | fadd (keyword_str [kend], keyword_len [kend]); fadd ('\n'); |
|
|
392 | } |
|
|
393 | |
|
|
394 | void put (keyword k, archetype *v); |
|
|
395 | void put (keyword k, treasurelist *v); |
|
|
396 | void put (keyword k, faceinfo *v); |
|
|
397 | |
|
|
398 | template<typename T> |
|
|
399 | void put (keyword k, const refptr<T> &v) |
|
|
400 | { |
|
|
401 | put (k, (T *)v); |
|
|
402 | } |
|
|
403 | |
|
|
404 | MTH bool save (const_octet_string path); |
|
|
405 | char *as_string (); // like strdup |
|
|
406 | |
|
|
407 | operator bool () { return !!av; } |
|
|
408 | }; |
|
|
409 | |
|
|
410 | INTERFACE_CLASS(object_thawer) |
|
|
411 | struct object_thawer |
|
|
412 | { |
|
|
413 | char *line; // current beginning of line |
|
|
414 | SV *text; // text part |
|
|
415 | AV *av; // perl part |
|
|
416 | int linenum; |
|
|
417 | keyword kw; |
|
|
418 | char *kw_str; // the keyword parsed, as string |
|
|
419 | char *value; // the value, or 0 if no value |
|
|
420 | const char *value_nn; // the value, or the empty string if no value |
|
|
421 | const char *name; |
|
|
422 | |
|
|
423 | operator bool () const { return !!text; } |
|
|
424 | |
|
|
425 | object_thawer (const char *path = 0); |
|
|
426 | object_thawer (const char *data, AV *perlav); |
|
|
427 | ~object_thawer (); |
|
|
428 | |
|
|
429 | void get (attachable *obj, int oid); |
|
|
430 | |
|
|
431 | // parse next line |
|
|
432 | MTH void next (); |
|
|
433 | // skip the current key-value (usually fetch next line, for |
|
|
434 | // multiline-fields, skips till the corresponding end-kw |
|
|
435 | MTH void skip (); |
|
|
436 | MTH void skip_block (); // skips till and over KW_end |
|
|
437 | |
|
|
438 | char *get_str () { return value; } // may be 0 |
|
|
439 | void get_ml (keyword kend, shstr &sh); |
|
|
440 | |
|
|
441 | void get_ornull (shstr &sh) const { sh = value; } |
|
|
442 | void get (shstr &sh) const { sh = value; } // might want to check for non-null here |
|
|
443 | |
|
|
444 | bool get_bool () const { return *value_nn == '1'; } |
|
|
445 | sint32 get_sint32 () const; |
|
|
446 | sint64 get_sint64 () const { return strtoll (value_nn, 0, 10); } |
|
|
447 | double get_double () const { return strtod (value_nn, 0); } |
|
|
448 | |
|
|
449 | void get (float &v) { v = get_double (); } |
|
|
450 | void get (double &v) { v = get_double (); } |
|
|
451 | |
|
|
452 | void get (bool &i) { i = get_bool (); } |
|
|
453 | void get (sint8 &i) { i = get_sint32 (); } |
|
|
454 | void get (uint8 &i) { i = get_sint32 (); } |
|
|
455 | void get (sint16 &i) { i = get_sint32 (); } |
|
|
456 | void get (uint16 &i) { i = get_sint32 (); } |
|
|
457 | void get (sint32 &i) { i = get_sint32 (); } |
|
|
458 | |
|
|
459 | void get (uint32 &i) { i = get_sint64 (); } |
|
|
460 | void get (sint64 &i) { i = get_sint64 (); } |
|
|
461 | |
|
|
462 | MTH void parse_warn (const char *msg); |
|
|
463 | MTH bool parse_error (const char *type = 0, const char *name = 0, bool skip = true); |
|
|
464 | |
|
|
465 | struct delayed_ref { |
|
|
466 | attachable *op; |
|
|
467 | object_ptr *ptr; |
|
|
468 | const char *ref; |
|
|
469 | }; |
|
|
470 | std::vector<delayed_ref> delrefs; |
|
|
471 | |
|
|
472 | void delayed_deref (attachable *op, object_ptr &ptr, const char *ref); |
|
|
473 | MTH void resolve_delayed_derefs (bool deref = true); |
|
|
474 | }; |
|
|
475 | |
|
|
476 | //TODO: remove |
|
|
477 | char *fgets (char *s, int n, object_thawer &thawer); |
|
|
478 | |
294 | |
479 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
295 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
480 | |
296 | |
481 | struct coroapi { |
297 | struct coroapi { |
482 | static struct CoroAPI *GCoroAPI; |
298 | static struct CoroAPI *GCoroAPI; |