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 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 | // |
… | |
… | |
50 | // optimisations/workaround for functions requiring my_perl in scope (anti-bloat) |
49 | // optimisations/workaround for functions requiring my_perl in scope (anti-bloat) |
51 | #undef localtime |
50 | #undef localtime |
52 | #undef srand48 |
51 | #undef srand48 |
53 | #undef drand48 |
52 | #undef drand48 |
54 | #undef srandom |
53 | #undef srandom |
|
|
54 | #undef opendir |
55 | #undef readdir |
55 | #undef readdir |
|
|
56 | #undef closedir |
56 | #undef getprotobyname |
57 | #undef getprotobyname |
57 | #undef gethostbyname |
58 | #undef gethostbyname |
58 | #undef ctime |
59 | #undef ctime |
59 | #undef strerror |
60 | #undef strerror |
60 | #undef _ |
61 | #undef _ |
… | |
… | |
81 | |
82 | |
82 | #define CHECK_ERROR \ |
83 | #define CHECK_ERROR \ |
83 | if (SvTRUE (ERRSV)) \ |
84 | if (SvTRUE (ERRSV)) \ |
84 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
85 | LOG (llevError, "runtime error in %s: %s", __func__, SvPVutf8_nolen (ERRSV)); |
85 | |
86 | |
|
|
87 | inline int call_pvsv (const char *ob, I32 flags) { return call_pv (ob, flags); } |
|
|
88 | inline int call_pvsv (SV *ob, I32 flags) { return call_sv (ob, flags); } |
|
|
89 | |
86 | #define CALL_BEGIN(args) dSP; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) |
90 | #define CALL_BEGIN(args) dSP; ENTER; SAVETMPS; PUSHMARK (SP); EXTEND (SP, args) |
87 | #define CALL_ARG_SV(sv) PUSHs (sv_2mortal (sv)) // separate because no refcount inc |
91 | #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))) |
92 | #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; |
93 | #define CALL_CALL(name, flags) PUTBACK; int count = call_pvsv (name, (flags) | G_EVAL); SPAGAIN; |
90 | #define CALL_END CHECK_ERROR; FREETMPS; LEAVE |
94 | #define CALL_END PUTBACK; CHECK_ERROR; FREETMPS; LEAVE |
91 | |
95 | |
92 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
96 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
93 | |
97 | |
94 | void cfperl_init (); |
98 | void cfperl_init (); |
95 | void cfperl_main (); |
99 | void cfperl_main (); |
… | |
… | |
97 | void cfperl_emergency_save (); |
101 | void cfperl_emergency_save (); |
98 | void cfperl_cleanup (int make_core); |
102 | void cfperl_cleanup (int make_core); |
99 | void cfperl_make_book (object *book, int level); |
103 | void cfperl_make_book (object *book, int level); |
100 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
104 | void cfperl_send_msg (client *ns, int color, const char *type, const char *msg); |
101 | int cfperl_can_merge (object *ob1, object *ob2); |
105 | int cfperl_can_merge (object *ob1, object *ob2); |
|
|
106 | void cfperl_mapscript_activate (object *ob, int state, object *activator, object *originator = 0); |
|
|
107 | |
|
|
108 | bool is_match_expr (const char *expr); |
|
|
109 | // applies the match expression and returns true if it matches |
|
|
110 | bool match (const char *expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
|
|
111 | // same as above, but returns the first object found, or 0 |
|
|
112 | object *match_one (const char *expr, object *ob, object *self = 0, object *source = 0, object *originator = 0); |
102 | |
113 | |
103 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
114 | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// |
104 | |
115 | |
105 | #if IVSIZE >= 8 |
116 | #if IVSIZE >= 8 |
106 | typedef IV val64; |
117 | typedef IV val64; |
… | |
… | |
181 | INTERFACE_CLASS (attachable) |
192 | INTERFACE_CLASS (attachable) |
182 | struct attachable : refcnt_base |
193 | struct attachable : refcnt_base |
183 | { |
194 | { |
184 | static MGVTBL vtbl; |
195 | static MGVTBL vtbl; |
185 | |
196 | |
186 | static unordered_vector<attachable *> mortals; |
|
|
187 | MTH static void check_mortals (); |
|
|
188 | |
|
|
189 | enum { |
197 | enum { |
190 | F_DESTROYED = 0x01, |
198 | F_DESTROYED = 0x01, |
191 | F_DEBUG_TRACE = 0x02, |
199 | F_DEBUG_TRACE = 0x02, |
192 | }; |
200 | }; |
193 | int ACC (RW, flags); |
201 | uint8 ACC (RW, flags); |
|
|
202 | |
|
|
203 | static unordered_vector<attachable *> mortals; |
|
|
204 | MTH static void check_mortals (); |
194 | |
205 | |
195 | // object is delete'd after the refcount reaches 0 |
206 | // object is delete'd after the refcount reaches 0 |
196 | MTH int refcnt_cnt () const; |
207 | MTH int refcnt_cnt () const; |
197 | // check wether the object has died and destroy |
208 | // check wether the object has died and destroy |
198 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
209 | MTH void refcnt_chk () { if (expect_false (refcnt <= 0)) do_check (); } |
… | |
… | |
286 | ~object_freezer (); |
297 | ~object_freezer (); |
287 | |
298 | |
288 | void put (attachable *ext); |
299 | void put (attachable *ext); |
289 | |
300 | |
290 | // used only for user-defined key-value pairs |
301 | // used only for user-defined key-value pairs |
291 | void put (const shstr &k, const shstr &v) |
302 | void put (shstr_tmp k, shstr_tmp v) |
292 | { |
303 | { |
293 | add (k); |
304 | add (k); |
294 | |
305 | |
295 | if (expect_true (v)) |
306 | if (expect_true (v)) |
296 | add (' '), add (v); |
307 | add (' '), add (v); |
… | |
… | |
320 | void put (keyword k, const char *v = 0) |
331 | void put (keyword k, const char *v = 0) |
321 | { |
332 | { |
322 | put_kw_string (k, v); |
333 | put_kw_string (k, v); |
323 | } |
334 | } |
324 | |
335 | |
325 | void put (keyword k, const shstr &v) |
336 | void put (keyword k, shstr_tmp v) |
326 | { |
337 | { |
327 | put_kw_string (k, v); |
338 | put_kw_string (k, v); |
328 | } |
339 | } |
329 | |
340 | |
330 | void put (keyword k, double v) |
341 | void put (keyword k, double v) |
… | |
… | |
364 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
375 | void put (keyword k, signed long v) { put_(k, (sint64)v); } |
365 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
376 | void put (keyword k, unsigned long v) { put_(k, (sint64)v); } |
366 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
377 | void put (keyword k, signed long long v) { put_(k, (sint64)v); } |
367 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
378 | void put (keyword k, unsigned long long v) { put_(k, (sint64)v); } |
368 | |
379 | |
369 | void put (keyword kbeg, keyword kend, const shstr &v) |
380 | void put (keyword kbeg, keyword kend, shstr_tmp v) |
370 | { |
381 | { |
371 | force (MAX_KEYWORD_LEN + 1); |
382 | force (MAX_KEYWORD_LEN + 1); |
372 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
383 | fadd (keyword_str [kbeg], keyword_len [kbeg]); fadd ('\n'); |
373 | |
384 | |
374 | if (expect_true (v)) |
385 | if (expect_true (v)) |